arXiv:2605. 17965v2 Announce Type: replace-cross Abstract: Bug localization remains a key bottleneck for large language model (LLM)-based software maintenance, where accurately identifying faulty code is essential for debugging, root cause analysis, triage, and automated program repair (APR).
By Md Afif Al Mamun, Gias Uddin
arXiv:2608.29675v1 Announce Type: cross
Abstract: Repository exploration is a distinct and costly stage of coding-agent pipelines: before generating a patch, an agent must identify which repository f...
By Mohammad Nour Al Awad, Sergey Ivanov
arXiv:2606. 11976v1 Announce Type: cross Abstract: Software engineering tools increasingly rely on LLM based agents to localize files to change to resolve a software issue.
By Akeela Darryl Fattha, Kia Ying Chua, Lingxiao Jiang, Laura Wynter
arXiv:2606.24820v2 Announce Type: replace
Abstract: LLM agents solve repository-level coding tasks through multi-turn tool use, but utilize half their budget on locating faults before editing. Dedica...
By Hovhannes Tamoyan, Sean Narenthiran, Erik Arakelyan, Mira Mezini, Boris Ginsburg
arXiv:2607. 19653v1 Announce Type: cross Abstract: Large language model (LLM) agents now perform well on correctness-oriented repository-level tasks, including SWE-Bench issue resolution and feature implementation in real codebases.
By Ryan Deng, Yuanzhe Liu, Bastian Lipka, Yao Ma, Xuhao Chen, Tim Kaler, Jatin Ganhotra
Software engineering tools increasingly rely on LLM based agents to localize files to change to resolve a software issue. Most AI agents explore repositories linearly, that is, visiting one directory or file per step.
arXiv:2607. 00016v1 Announce Type: cross Abstract: Information localization within massive repositories is a cornerstone of agentic LLM systems.
By Xuan Zhao, Andy Chiu, Gengyu Wang
SpIDER is a dense retrieval method that combines LLM reasoning with graph-based exploration of codebases to locate relevant functions, classes, or files for user queries. It introduces a graph-structured benchmark, SpIDER-Bench, covering multiple programming languages and demonstrates significant recall improvements over traditional BM25 and dense approaches. The method’s graph-based candidate expansion provides auditable structural reasons for each retrieved item while keeping the retrieval budget fixed.
By Shravan Chaudhari, Rahul Thomas Jacob, Jiajun Cao, Shihab Rashid, Mononito Goswami, Christian Bock
arXiv:2606. 03852v1 Announce Type: cross Abstract: Large language models often generate code with bugs.
By Yinsheng Yao, Hongxiang Zhang, Weixi Tong, Tianyi Zhang
arXiv:2609. 31176v1 Announce Type: new Abstract: Repository-level issue localization aims to identify and rank the files and functions relevant to resolving a reported issue.
By Yunxiang Wei, Zhenyu Lei, Jundong Li
arXiv:2608. 05886v1 Announce Type: cross Abstract: Modern LLM coding agents such as Claude Code and OpenHands share a common inefficiency: they spend much of their token budget finding the file to patch, rather than patching it.
By Wuya Chen, Yihao yang, Yang Cao, Yue Lin
arXiv:2507. 22580v2 Announce Type: replace-cross Abstract: Automated Program Repair (APR) seeks to automatically correct software bugs without requiring human intervention.
By Marcos Fuster-Pena, David de-Fitero-Dominguez, Antonio Garcia-Cabot, Eva Garcia-Lopez