AI RESEARCH
Bounded Path Context: A Controlled Study of Visible Path History in LLM-Based Knowledge Graph Question Answering
arXiv CS.CL
•
ArXi:2605.26645v1 Announce Type: new LLM-based knowledge-graph question answering (KGQA) delegates graph traversal to language models, turning each question into a sequence of local relation-selection decisions repeated across beams and hops. A common but untested default is to serialize the complete partial path into every routing prompt, even though the controller already maintains this path as exact symbolic state.