On the QASC science-fact graph, the paper's conclusion is that reranking remains stronger than either hierarchical or adaptive graph traversal under strict-parity comparison. The adaptive heuristic is statistically tied with the fixed-depth hierarchical baseline ($\Delta\text{R}@10 = +0.5\,[-0.5, +1.5]$), so the paper presents the adaptive controller as an optional extension rather than the core result on QASC. Reranking (ColBERTv2/RePlug, SP+) sits above both graph traversal policies in the strict-parity ordering on this benchmark.