Tag
This paper introduces Bounded Path Context (BPC), a method for LLM-based knowledge graph question answering that limits the visible path history in prompts, showing that bounded histories can match or exceed full-history prompting while reducing token usage.