CodeCompass: Navigating the Navigation Paradox in Agentic Code Intelligence
Tarakanath Paipuru

TL;DR
This paper introduces CodeCompass, a graph-based navigation tool that significantly improves agent performance in locating critical files in large codebases, highlighting the importance of structural context over lexical retrieval.
Contribution
It presents a novel structural navigation approach using dependency graphs, demonstrating substantial performance gains and addressing behavioral challenges in tool adoption.
Findings
Graph navigation achieves 99.4% success on hidden-dependency tasks.
Agents often fail to adopt graph tools without explicit prompt engineering.
Structural context outperforms lexical retrieval when dependencies lack lexical overlap.
Abstract
Modern code intelligence agents operate in contexts exceeding 1 million tokens--far beyond the scale where humans manually locate relevant files. Yet agents consistently fail to discover architecturally critical files when solving real-world coding tasks. We identify the Navigation Paradox: agents perform poorly not due to context limits, but because navigation and retrieval are fundamentally distinct problems. Through 258 automated trials across 30 benchmark tasks on a production FastAPI repository, we demonstrate that graph-based structural navigation via CodeCompass--a Model Context Protocol server exposing dependency graphs--achieves 99.4% task completion on hidden-dependency tasks, a 23.2 percentage-point improvement over vanilla agents (76.2%) and 21.2 points over BM25 retrieval (78.2%).However, we uncover a critical adoption gap: 58% of trials with graph access made zero tool…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware System Performance and Reliability · Advanced Graph Neural Networks · Graph Theory and Algorithms
