Fixed-Depth Hierarchical Baseline in Strict-Parity Prerequisite Retrieval
The fixed-depth hierarchical baseline is a graph-aware comparator that traverses the prerequisite hierarchy with constant ancestor and descendant traversal depths (no per-query adaptation), in contrast to the paper's adaptive depth gating. It is included among the strict-parity baselines, so it shares the same encoder, budgets, split, and exact-ID matching rule as the other compared systems. Because traversal depth is the only structural difference from adaptive depth gating, the fixed-depth baseline isolates the contribution of per-query depth adaptation in headline comparisons.
0
1
Tags
Science
Auditable Strict-Parity Evaluation of Prerequisite-Graph Retrieval for RAG under Leakage Controls
Related
Graph-RAG Interface Drift Confound
Fixed Top-m Dense Seed Pool as a Strict-Parity Control
Strict-Parity Headline Invariants for Prerequisite Retrieval (m=100, k=10, Exact-ID Match)
Fixed-Depth Hierarchical Baseline in Strict-Parity Prerequisite Retrieval
Retrieval-Stage Constants Table for Hierarchical Prerequisite RAG Experiments
Flat Dense Retrieval Baseline in Strict-Parity Prerequisite Retrieval
Fixed-Depth Hierarchical Baseline in Strict-Parity Prerequisite Retrieval
GraphRAG-Style Baseline in Strict-Parity Prerequisite Retrieval
LightRAG-Style Baseline in Strict-Parity Prerequisite Retrieval
KAG-Style Structural Baseline in Strict-Parity Prerequisite Retrieval