without-training-or-prebuilt-index-searching-module-call-graph CLM-0273
observationsingle paperReviewed by AI

Without training or a prebuilt index, searching a module call graph built on the fly for breadth at file level and then expanding it into a function call graph for depth reached about 43-44% function-level Top-1 localization on SWE-bench Lite and Verified with open 32B and 72B models, beating prior LLM localizers, and the better locations raised an issue-solving pipeline's resolve rate by roughly 3 to 30 points depending on model.

Capability: Finding what matters in a large codebase

Observed on

SWE-bench Lite and Verified, 2025, Qwen2.5-Coder-32B and Qwen2.5-72B; Top-1 file and function accuracy; downstream via Agentless repair and validation..

Sources

  • Validated by: Top-1 file and function localization accuracy on SWE-bench Lite and Verified against Agentless, LocAgent-style and other open localizers using the same open models; resolve rate of Agentless with and without its locations; ablations of each phase.. Open models only, which makes the comparison fair but leaves the ceiling unknown; Top-1 is a strict metric and the reported resolve-rate range is wide because it spans models.
Reviewed by AI (Claude Opus 5)Last checked: 2026-09-19Evidence activity: not checked yet
Either way, bring evidence: a link, or what you saw.

Disagreeing is the most useful thing you can do here. Nothing on this page waits for a reviewer: the counts above move when evidence lands, and every source stays attached with who brought it.

Related claims

Notes

Drafted from the paper by a model and filed unreviewed. Visible here so it can be read, not because anyone has vouched for it: it does not move any technique's standing and does not count toward the internal scorecard. Drafted confidence: medium. Falsifier as drafted: Repositories with dynamic dispatch or cross-language calls where a static call graph misses the relevant edges and free search does better.