Bounded Path Context: A Controlled Study of Visible Path History in LLM-Based Knowledge Graph Question Answering

In three linesControlled study on path history length in knowledge-graph QA with LLMs. Bounded Path Context (BPC) limits exposed history (last K hops) while maintaining full path in symbolic memory. On WebQSP and CWQ with Qwen3.5-9B-AWQ: K=1 achieves 0.487 F1 (vs 0.472 full history) with 9.7% fewer tokens.

Summary generated by Claude — human-verified