Pith. sign in

REVIEW 12 cited by

LocAgent: Graph-Guided LLM Agents for Code Localization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.09089 v2 pith:GAIFV6HW submitted 2025-03-12 cs.SE cs.AIcs.CL

LocAgent: Graph-Guided LLM Agents for Code Localization

classification cs.SE cs.AIcs.CL
keywords codelocagentlocalizationaccuracyagentscodebasesdependenciesgithub
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Code localization--identifying precisely where in a codebase changes need to be made--is a fundamental yet challenging task in software maintenance. Existing approaches struggle to efficiently navigate complex codebases when identifying relevant code sections. The challenge lies in bridging natural language problem descriptions with the appropriate code elements, often requiring reasoning across hierarchical structures and multiple dependencies. We introduce LocAgent, a framework that addresses code localization through graph-based representation. By parsing codebases into directed heterogeneous graphs, LocAgent creates a lightweight representation that captures code structures (files, classes, functions) and their dependencies (imports, invocations, inheritance), enabling LLM agents to effectively search and locate relevant entities through powerful multi-hop reasoning. Experimental results on real-world benchmarks demonstrate that our approach significantly enhances accuracy in code localization. Notably, our method with the fine-tuned Qwen-2.5-Coder-Instruct-32B model achieves comparable results to SOTA proprietary models at greatly reduced cost (approximately 86% reduction), reaching up to 92.7% accuracy on file-level localization while improving downstream GitHub issue resolution success rates by 12% for multiple attempts (Pass@10). Our code is available at https://github.com/gersteinlab/LocAgent.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 12 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. LLM Agents Can See Code Repositories

    cs.SE 2026-06 unverdicted novelty 7.0

    Visual graphs of repository structure added to text inputs for multimodal LLM agents reduce token consumption by up to 26% while maintaining or improving issue-resolution accuracy.

  2. SWE-Explore: Benchmarking How Coding Agents Explore Repositories

    cs.SE 2026-06 unverdicted novelty 7.0

    SWE-Explore is a new benchmark evaluating repository exploration by coding agents on 848 issues across 203 repositories, using line-level ground truth from successful agent trajectories and showing agentic methods out...

  3. Libra: Training the Environment for Agentic Information Retrieval

    cs.IR 2026-05 unverdicted novelty 7.0

    Libra evolves repository catalogs via an LLM-driven loop of Prompter, Solver, and Healer, producing logarithmic gains in code localization accuracy that transfer zero-shot across LLMs and let a simple agent beat baselines.

  4. Can You Trust the Vectors in Your Vector Database? Black-Hole Attack from Embedding Space Defects

    cs.CR 2026-04 unverdicted novelty 7.0

    Injecting a few malicious vectors near the centroid exploits centrality-driven hubness in high-dimensional embeddings, causing them to dominate top-k retrievals in up to 99.85% of cases.

  5. Agent Retrieval Bench: Evaluating Repository Context Retrieval for Coding Agents

    cs.IR 2026-07 conditional novelty 6.0

    A 427-sample workflow-grounded benchmark finds complementary strengths across lexical, structural, and embedding retrieval for coding-agent context acquisition, with large residual miss rates and a selective-abstentio...

  6. What Context Does a Coding Agent Actually Need to Act?

    cs.LG 2026-06 accept novelty 6.0

    At oracle localization on SWE-bench Verified, the edited source itself carries the act signal; structured surrounding context resolves no more issues than dropping it, and compressed context matches whole files at one...

  7. LLM Agents Can See Code Repositories

    cs.SE 2026-06 conditional novelty 6.0

    Adding visual dependency-graph images to a text-based coding agent cuts token consumption by up to 26% while keeping issue-resolution accuracy roughly unchanged.

  8. On the Role of Fault Localization Context for LLM-Based Program Repair

    cs.SE 2026-04 unverdicted novelty 6.0

    More fault localization context does not consistently improve LLM-based program repair; file-level context gives 15-17x gains, optimal around 6-10 files, while line-level context often degrades performance from noise.

  9. Can You Trust the Vectors in Your Vector Database? Black-Hole Attack from Embedding Space Defects

    cs.CR 2026-04 unverdicted novelty 6.0

    Injecting a few vectors near the embedding-space centroid can make them appear in top-k results for up to 94.4% of queries via centrality-driven hubness.

  10. Can Old Tests Do New Tricks for Resolving SWE Issues?

    cs.SE 2025-10 conditional novelty 6.0

    TestPrune minimizes regression test suites to improve bug reproduction and patch validation in LLM-based agentic repair pipelines, delivering 6-13% relative gains on SWE-Bench benchmarks at low API cost.

  11. Code Isn't Memory: A Structural Codebase Index Inside a Coding Agent

    cs.AI 2026-06 unverdicted novelty 4.0

    Ablation study finds that a structural codebase index improves localization and resolve rates in coding agents on two SWE benchmarks without raising per-cell cost.

  12. From LLM Reasoning to Autonomous AI Agents: A Comprehensive Review

    cs.AI 2025-04 accept novelty 4.0

    A survey consolidating benchmarks, agent frameworks, real-world applications, and protocols for LLM-based autonomous agents into a proposed taxonomy with recommendations for future research.