{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GAIFV6HWBHEB4EHAEGAOFIU5CM","short_pith_number":"pith:GAIFV6HW","schema_version":"1.0","canonical_sha256":"30105af8f609c81e10e02180e2a29d133ce71aacc9dc8ce6372c83550d10a032","source":{"kind":"arxiv","id":"2503.09089","version":2},"attestation_state":"computed","paper":{"title":"LocAgent: Graph-Guided LLM Agents for Code Localization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.SE","authors_text":"Arman Cohan, Fang Wu, Gangda Deng, Jialong Wu, Viktor Prasanna, Xiangru Tang, Xingyao Wang, Zhaoling Chen, Zhiwei Jiang","submitted_at":"2025-03-12T05:55:01Z","abstract_excerpt":"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 heterogeneo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2503.09089","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-03-12T05:55:01Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"33383290af82edf5977851a6986892270ef73fb75993388ba2592576ea67801c","abstract_canon_sha256":"4425aa85d7ec2c252975373f6662ea2d09952a0f691c0c84e6a284fa5f1396f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:32.184854Z","signature_b64":"8nojw7JnyAcUK/gVPulykfaUrPkaO0VN/rWzmLC1xS+8ILo8mPL3Bk+cuyszlGJJt09/aku5Av8W9eIhE6S6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30105af8f609c81e10e02180e2a29d133ce71aacc9dc8ce6372c83550d10a032","last_reissued_at":"2026-07-05T10:55:32.184369Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:32.184369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LocAgent: Graph-Guided LLM Agents for Code Localization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.SE","authors_text":"Arman Cohan, Fang Wu, Gangda Deng, Jialong Wu, Viktor Prasanna, Xiangru Tang, Xingyao Wang, Zhaoling Chen, Zhiwei Jiang","submitted_at":"2025-03-12T05:55:01Z","abstract_excerpt":"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 heterogeneo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.09089","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.09089/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2503.09089","created_at":"2026-07-05T10:55:32.184423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.09089v2","created_at":"2026-07-05T10:55:32.184423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.09089","created_at":"2026-07-05T10:55:32.184423+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAIFV6HWBHEB","created_at":"2026-07-05T10:55:32.184423+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAIFV6HWBHEB4EHA","created_at":"2026-07-05T10:55:32.184423+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAIFV6HW","created_at":"2026-07-05T10:55:32.184423+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22417","citing_title":"Code Isn't Memory: A Structural Codebase Index Inside a Coding Agent","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00016","citing_title":"Libra: Training the Environment for Agentic Information Retrieval","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07297","citing_title":"SWE-Explore: Benchmarking How Coding Agents Explore Repositories","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.14061","citing_title":"LLM Agents Can See Code Repositories","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2510.18270","citing_title":"Can Old Tests Do New Tricks for Resolving SWE Issues?","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2504.19678","citing_title":"From LLM Reasoning to Autonomous AI Agents: A Comprehensive Review","ref_index":182,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05481","citing_title":"On the Role of Fault Localization Context for LLM-Based Program Repair","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GAIFV6HWBHEB4EHAEGAOFIU5CM","json":"https://pith.science/pith/GAIFV6HWBHEB4EHAEGAOFIU5CM.json","graph_json":"https://pith.science/api/pith-number/GAIFV6HWBHEB4EHAEGAOFIU5CM/graph.json","events_json":"https://pith.science/api/pith-number/GAIFV6HWBHEB4EHAEGAOFIU5CM/events.json","paper":"https://pith.science/paper/GAIFV6HW"},"agent_actions":{"view_html":"https://pith.science/pith/GAIFV6HWBHEB4EHAEGAOFIU5CM","download_json":"https://pith.science/pith/GAIFV6HWBHEB4EHAEGAOFIU5CM.json","view_paper":"https://pith.science/paper/GAIFV6HW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.09089&json=true","fetch_graph":"https://pith.science/api/pith-number/GAIFV6HWBHEB4EHAEGAOFIU5CM/graph.json","fetch_events":"https://pith.science/api/pith-number/GAIFV6HWBHEB4EHAEGAOFIU5CM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAIFV6HWBHEB4EHAEGAOFIU5CM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAIFV6HWBHEB4EHAEGAOFIU5CM/action/storage_attestation","attest_author":"https://pith.science/pith/GAIFV6HWBHEB4EHAEGAOFIU5CM/action/author_attestation","sign_citation":"https://pith.science/pith/GAIFV6HWBHEB4EHAEGAOFIU5CM/action/citation_signature","submit_replication":"https://pith.science/pith/GAIFV6HWBHEB4EHAEGAOFIU5CM/action/replication_record"}},"created_at":"2026-07-05T10:55:32.184423+00:00","updated_at":"2026-07-05T10:55:32.184423+00:00"}