- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper addresses the problem in multi-hop RAG where incorrectly selected intermediate entities lead subsequent retrieval down the wrong path. The proposed CLBR-RAG represents the combination of an intermediate entity and an unresolved information need as a tentative retrieval control state, and approves or retracts it through a pre-retrieval Evidence Gate and a post-retrieval support check. In the retrieval stage, it combines BM25 and E5 results with RRF, falls back to BROAD search when all branches of goal-directed retrieval fail, and provides compressed evidence and verified linking relations to the final reasoning stage. It reports the highest EM/F1 among comparison methods on the full development sets of four benchmarks, with especially notable gains of 5.0/6.5%p over STRIDE on MuSiQue. Ablation studies and retrieval-path diagnostics support the practical value of the design, but important supplementary evidence is needed regarding the specificity of the core verification rules, the scope of retractable states, and experiments that demonstrate the effectiveness of the closed-loop control itself.
Critical strengths
S1. Consistent performance improvement on various datasets. The paper shows higher EM/F1 scores than other baselines on four datasets. In particular, it is notable that the proposed method shows significant improvement (+5.0 pp for EM and +6.5 pp for F1) compared to the strongest baseline.
S2. Ablation studies. It shows the sufficient ablation studies in terms of retrieval, bridge control, and evidence organization. Furthermore, it provides the pass rate for each stage, rejection cause, etc. It is positive that the authors tried their best to analyze on which stage binding and branch are accepted or rejected.
Critical weaknesses
W1. Lack of implementation specification of core verification function. Evidence gate and post-target validation are the deterministic program check without additional model call. However, there is not sufficiently described implementation in terms of DependencyWitness, NoBindingConflict, and target relation or witness judgement of slot in Support.
W2. Narrow revocation scope in implementation side compared to author's claim. Algorithm 1 discards provisional branch failed validation after TARGETED retrieval. In contrast, it does not provide the procedure to remove the existed binding when contradictory evidence was found under the case that binding is accumulated ( ) after it passes validation and goes to the ledger. Therefore, the proposed method shows discard of validation-failed provisional branch, not general recovery that revokes the wrong bridge commitment that is already accepted. The authors should constraint the claim of this paper.
W3. The correctness of downstream evidence does not guarantee the validity of upstream bridge. The post-target validation in Eq. 12 confirms whether the returned evidence supports the bridge entity and target relation or slot. In terms of director, however, it can retrieve the exact birthplace evidence. With the fact that confirms the birthplace of corresponding entity, the upstream relation is hard to be justified that that entity the film director in the question.
W4. Contribution of recovery. In Table 5, the additional improvement by adding full control after pre-target Gate is +0.3 pp for EM and +0.5 pp for F1. In this comparison, there is no separation between post-target validation and the effect of BROAD recovery, so it is hard to show the contribution of recovery component. It requires comparison with three splitted configuration: (1) Only Pre-target Gate, (2) Pre-target Gate + post-target validation without BROAD recovery, (3) Pre-target Gate + post-target validation + BROAD recovery.
W5. Needs of comparison constraint with retrieval and entire inference cost. The proposed method utilized BM25-E5-RRF hybrid retrieval. Therefore, to show the additional contribution of bridge control, it should be applied to identical retrieval backend in the strong baselines.
Questions for authors
See the weaknesses, and I will write this section as minor comments.
1. Missing references. The authors missed the references such as datasets (TriviaQA, MuSiQue) and metrics (BM25, E5, RRF).
2. Location of figures and tables. Typically, figures and tables should be located at the top of the paper.
Executable Verification Rules
Response to WKYW — Executable Verification Rules
Thank you for requesting executable definitions. We clarify Eqs. (7)–(8), Eq. (12), and Appendix A.3.
1. Relation witnesses and semantic matching
Each expected dependency is a directed
(head, relation, tail)triple. Fixed active/passive/role frames match the predicate cue and both argument spans, not word co-occurrence. Fordeveloper(StreamKit, Orion Devices), the registered patterns include:The first two yield positive witnesses; the third yields a negative one. Source-backed aliases (e.g.,
Orion Devices (OD)) require an explicit supporting span. Each witness records its source ID, head/cue/tail spans, rule ID, and polarity. Conditional, uncertain, or non-asserted expressions cannot establish positive support.Evidence aggregation is: positive only →
SUPPORTED; negative only →REFUTED; both →CONFLICTED; neither →UNKNOWN. Unregistered paraphrases are not presumed equivalent.2. Executable decision logic
The following pseudocode specifies the core acceptance and rejection conditions:
replay_upstreamchecks rule version, receipt integrity, recorded source and relation witnesses, and re-executes the upstream test; a hash alone is not semantic proof. Direct identity is restricted to explicitly named subjects in direct-attribute questions, not unresolved intermediate bridges.3. Worked positive and negative examples
For “Where are the headquarters of the developer of StreamKit?”, source
d:s0:“Orion Devices (OD) is a company. StreamKit was developed by OD.”
This yields a positive
developer(StreamKit, Orion Devices)witness (developer:passive, head span[33,42], cue[47,59], tail[60,62]). ThusDW=SUPPORTED; with empty history,NBC=SUPPORTED.A same-branch source “Orion Devices is headquartered in Berlin” supports the required headquarters slot, giving
TSC=SUPPORTED.Conversely, “StreamKit was not developed by Orion Devices” yields
REFUTED; “Harbor Labs developed StreamKit; Orion Devices was mentioned separately” yieldsUNKNOWNfor the proposed dependency despite lexical co-occurrence.An overlapping negative historical binding yields
CONFLICTED; distinct positive developers conflict only under an explicit single-value constraint.Crucially, a correct birthplace fact for a candidate director cannot validate the film–director dependency without an independent upstream witness. Evidence from another branch or gap cannot satisfy the current target.
4. Validation scope
Only supported branches and their evidence enter the ledger. Failed provisional branches are discarded; all-branch failure triggers BROAD recovery.
Thus, a validated bridge satisfies explicit, source-traceable upstream and downstream conditions rather than guaranteeing unrestricted factual correctness. Semantic coverage is bounded by registered linguistic patterns and typed extractors; unrecognized cases conservatively return
UNKNOWN.