- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This work focuses on multi-hop QA on text-attributed graphs, where generic (text-targeted) RAG approaches do not effectively utilize graph structure and serialize subgraphs. It introduces Graph-O1 as an LLM agent with 4 callable functions over graphs with a Thought-Action-Observation loop. It explores multiple trajectories with Monte Carlo tree search scored by an LLM evaluator, where the policy is fine-tuned with GRPO on MCTS traces, using format and graph-operation rewards.
Critical strengths
None
Critical weaknesses
-
The technical novelty is limited. The first contribution claims that it is "the first agentic text-attributed graph RAG framework" is not true. The prior work Graph-CoT (Jin et al., 2024), which the paper builds on and compares against, is already an agentic framework on the same benchmark with the same four graph functions. The claim of being the first to apply o1-style reasoning with GRPO to graph reasoning also overlooks prior RL-trained graph and search agents, such as Graph-R1 (Luo et al., 2026), Search-R1 (Jin et al., 2025) and R1-Searcher (Song et al., 2025).
-
The reward described in Section 3.2 includes a +1.0/-0.5 answer-correctness term and a format term summed over steps and capped at 1.0, whereas Appendix B.3 states that answer fidelity is not scored at all, that the format reward lies in [0, 1.5] per completion, and that completions are capped at 256 tokens. This is a fundamental inconsistency: as implemented, the RL stage appears to be per-step GRPO on format and tool-call rewards over trajectories filtered for success, which is closer to rejection-sampling fine-tuning than to the "end-to-end" outcome-based RL claimed in the abstract and contributions.
Questions for authors
N/A