{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JA66AEK5HNLOIVXEGY5RL3YXHY","short_pith_number":"pith:JA66AEK5","schema_version":"1.0","canonical_sha256":"483de0115d3b56e456e4363b15ef173e1d1ece4615466636a1b77e4e485668ea","source":{"kind":"arxiv","id":"2512.20957","version":6},"attestation_state":"computed","paper":{"title":"One Tool Is Enough: Reinforcement Learning for Repository-Level LLM Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Deguo Xia, Jiahui Liang, Jiyan He, Jizhou Huang, Kun Liang, Weikang Li, Yanzhi Zhang, Yiming Xu, Yitong Duan, Yunfang Wu, Zhaoxi Zhang, Zhixiang Wang","submitted_at":"2025-12-24T05:27:53Z","abstract_excerpt":"Locating files and functions requiring modification in large software repositories is challenging due to their scale and structural complexity. Existing LLM-based methods typically treat this as a repository-level retrieval task and rely on multiple auxiliary tools, which often overlook code execution logic and complicate model control. We propose RepoNavigator, an LLM agent equipped with a single execution-aware tool: jumping to the definition of an invoked symbol. This unified design reflects the actual flow of code execution while simplifying tool manipulation. RepoNavigator is trained end-"},"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":"2512.20957","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-12-24T05:27:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4aacbf35f9cc4ebcdef44294164e5429dca8fc8ecc22ac2235b52599b9eb314e","abstract_canon_sha256":"905d56be7bad724a7c052bdcdeb882fec9b73f2c06b18b91859f596636ebb2ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:04:54.128360Z","signature_b64":"QMqVYbQ4ND3lkrCFc5gYZgoxeAaJg7DCzzFD0SnSjoWE/b/uYwBpEx/LQL9/0hENb7Rbpc2/z0nYyu3GC5FuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"483de0115d3b56e456e4363b15ef173e1d1ece4615466636a1b77e4e485668ea","last_reissued_at":"2026-05-27T01:04:54.127698Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:04:54.127698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One Tool Is Enough: Reinforcement Learning for Repository-Level LLM Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Deguo Xia, Jiahui Liang, Jiyan He, Jizhou Huang, Kun Liang, Weikang Li, Yanzhi Zhang, Yiming Xu, Yitong Duan, Yunfang Wu, Zhaoxi Zhang, Zhixiang Wang","submitted_at":"2025-12-24T05:27:53Z","abstract_excerpt":"Locating files and functions requiring modification in large software repositories is challenging due to their scale and structural complexity. Existing LLM-based methods typically treat this as a repository-level retrieval task and rely on multiple auxiliary tools, which often overlook code execution logic and complicate model control. We propose RepoNavigator, an LLM agent equipped with a single execution-aware tool: jumping to the definition of an invoked symbol. This unified design reflects the actual flow of code execution while simplifying tool manipulation. RepoNavigator is trained end-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.20957","kind":"arxiv","version":6},"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/2512.20957/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":"2512.20957","created_at":"2026-05-27T01:04:54.127781+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.20957v6","created_at":"2026-05-27T01:04:54.127781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.20957","created_at":"2026-05-27T01:04:54.127781+00:00"},{"alias_kind":"pith_short_12","alias_value":"JA66AEK5HNLO","created_at":"2026-05-27T01:04:54.127781+00:00"},{"alias_kind":"pith_short_16","alias_value":"JA66AEK5HNLOIVXE","created_at":"2026-05-27T01:04:54.127781+00:00"},{"alias_kind":"pith_short_8","alias_value":"JA66AEK5","created_at":"2026-05-27T01:04:54.127781+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.16352","citing_title":"LARGER: Lexically Anchored Repository Graph Exploration and Retrieval","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02913","citing_title":"Generate, Filter, Control, Replay: A Comprehensive Survey of Rollout Strategies for LLM Reinforcement Learning","ref_index":178,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JA66AEK5HNLOIVXEGY5RL3YXHY","json":"https://pith.science/pith/JA66AEK5HNLOIVXEGY5RL3YXHY.json","graph_json":"https://pith.science/api/pith-number/JA66AEK5HNLOIVXEGY5RL3YXHY/graph.json","events_json":"https://pith.science/api/pith-number/JA66AEK5HNLOIVXEGY5RL3YXHY/events.json","paper":"https://pith.science/paper/JA66AEK5"},"agent_actions":{"view_html":"https://pith.science/pith/JA66AEK5HNLOIVXEGY5RL3YXHY","download_json":"https://pith.science/pith/JA66AEK5HNLOIVXEGY5RL3YXHY.json","view_paper":"https://pith.science/paper/JA66AEK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.20957&json=true","fetch_graph":"https://pith.science/api/pith-number/JA66AEK5HNLOIVXEGY5RL3YXHY/graph.json","fetch_events":"https://pith.science/api/pith-number/JA66AEK5HNLOIVXEGY5RL3YXHY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JA66AEK5HNLOIVXEGY5RL3YXHY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JA66AEK5HNLOIVXEGY5RL3YXHY/action/storage_attestation","attest_author":"https://pith.science/pith/JA66AEK5HNLOIVXEGY5RL3YXHY/action/author_attestation","sign_citation":"https://pith.science/pith/JA66AEK5HNLOIVXEGY5RL3YXHY/action/citation_signature","submit_replication":"https://pith.science/pith/JA66AEK5HNLOIVXEGY5RL3YXHY/action/replication_record"}},"created_at":"2026-05-27T01:04:54.127781+00:00","updated_at":"2026-05-27T01:04:54.127781+00:00"}