- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes ReScopeRAG, a training-free graph RAG framework that splits a question into dependent sub-queries and uses a Master with several Sub-Agents to run PPR inside Leiden communities.
Critical strengths
Treating the retrieval scope as something that shifts during multi-hop reasoning is a reasonable idea, and the decomposition stats and case study show the placeholder chaining actually gets used.
Critical weaknesses
The QA gains are mixed: MA-RAG is far ahead on 2Wiki (about 13 F1), HippoRAG2 matches it on HotpotQA, and the text even says some agentic methods have higher average scores, which contradicts Table 1. The retrieval comparison isn’t fair, since a multi-round, LLM-filtered evidence pool is compared only against single-shot retrievers, with no iterative baselines like IRCoT; HotpotQA Recall@5 even drops well below HippoRAG2. There’s no cost analysis, even though each round involves several LLM calls (decomposition, filtering, navigation, sufficiency check, scheduling) across multiple Sub-Agents for up to six rounds. The ablations are hard to read: removing scope adaptation drops F1 below BM25, which looks like a strawman, the global-scope variant is below plain HippoRAG2, and community granularity, which the whole method depends on, is never studied.
Questions for authors
How sensitive are the results to the Leiden resolution, and what happens when the gold passages for one sub-query fall in communities that aren’t adjacent?