{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BLSOYEZTB7MZOKWUOILFJGE5QI","short_pith_number":"pith:BLSOYEZT","schema_version":"1.0","canonical_sha256":"0ae4ec13330fd9972ad4721654989d823681a6a3a4f92674e065e5e5adab03d9","source":{"kind":"arxiv","id":"2507.23348","version":1},"attestation_state":"computed","paper":{"title":"SWE-Debate: Competitive Multi-Agent Debate for Software Issue Resolution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.SE","authors_text":"Han Li, Heng Lian, Qianxiang Wang, Shaoxin Lin, Tao Huang, Xiaodong Gu, Xin Wang, Yantao Jia, Yuling Shi","submitted_at":"2025-07-31T08:54:46Z","abstract_excerpt":"Issue resolution has made remarkable progress thanks to the advanced reasoning capabilities of large language models (LLMs). Recently, agent-based frameworks such as SWE-agent have further advanced this progress by enabling autonomous, tool-using agents to tackle complex software engineering tasks. While existing agent-based issue resolution approaches are primarily based on agents' independent explorations, they often get stuck in local solutions and fail to identify issue patterns that span across different parts of the codebase. To address this limitation, we propose SWE-Debate, a competiti"},"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":"2507.23348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-07-31T08:54:46Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"1fe9ef9f2ff2678d8d2d35b154a758e9cb1cd1daa45f8803bc23d7671008851b","abstract_canon_sha256":"701b1214d4a65598580bd60668567fe529424b179bb638d350072184b5859238"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:10.548724Z","signature_b64":"LtgC9ezMLheojMNTaVQikjRSC92sZkbHktuAMg9hvNuuRvMGZHMD8w4bvOoXryx1Prtb9gh+HvLpPNM8BH+MBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ae4ec13330fd9972ad4721654989d823681a6a3a4f92674e065e5e5adab03d9","last_reissued_at":"2026-07-05T11:46:10.547952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:10.547952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SWE-Debate: Competitive Multi-Agent Debate for Software Issue Resolution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.SE","authors_text":"Han Li, Heng Lian, Qianxiang Wang, Shaoxin Lin, Tao Huang, Xiaodong Gu, Xin Wang, Yantao Jia, Yuling Shi","submitted_at":"2025-07-31T08:54:46Z","abstract_excerpt":"Issue resolution has made remarkable progress thanks to the advanced reasoning capabilities of large language models (LLMs). Recently, agent-based frameworks such as SWE-agent have further advanced this progress by enabling autonomous, tool-using agents to tackle complex software engineering tasks. While existing agent-based issue resolution approaches are primarily based on agents' independent explorations, they often get stuck in local solutions and fail to identify issue patterns that span across different parts of the codebase. To address this limitation, we propose SWE-Debate, a competiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.23348","kind":"arxiv","version":1},"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/2507.23348/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":"2507.23348","created_at":"2026-07-05T11:46:10.548046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.23348v1","created_at":"2026-07-05T11:46:10.548046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.23348","created_at":"2026-07-05T11:46:10.548046+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLSOYEZTB7MZ","created_at":"2026-07-05T11:46:10.548046+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLSOYEZTB7MZOKWU","created_at":"2026-07-05T11:46:10.548046+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLSOYEZT","created_at":"2026-07-05T11:46:10.548046+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":19,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24820","citing_title":"SHERLOC: Structured Diagnostic Localization for Code Repair Agents","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09577","citing_title":"Code Is More Than Text: Uncertainty Estimation for Code Generation","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07297","citing_title":"SWE-Explore: Benchmarking How Coding Agents Explore Repositories","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02866","citing_title":"When Helping Hurts and How to Fix It: Multi-Agent Debate for Data Cleaning","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28436","citing_title":"Dockerless: Environment-Free Program Verifier for Coding Agents","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28690","citing_title":"Formal Security Analysis of Agent Protocol Composition","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28434","citing_title":"SWE-MeM: Learning Adaptive Memory Management for Long-Horizon Coding Agents","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2606.14061","citing_title":"LLM Agents Can See Code Repositories","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18747","citing_title":"Code as Agent Harness","ref_index":212,"is_internal_anchor":false},{"citing_arxiv_id":"2509.14635","citing_title":"SWE-QA: Can Language Models Answer Repository-level Code Questions?","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2601.00376","citing_title":"In Line with Context: Repository-Level Code Generation via Context Inlining","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2601.05110","citing_title":"GlimpRouter: Efficient Collaborative Inference by Glimpsing One Token of Thoughts","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2602.01785","citing_title":"Seeing is Coding: On the Effectiveness of Vision Language Models in Code Understanding","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2603.22048","citing_title":"Dynamic analysis enhances issue resolution","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09278","citing_title":"EquiMem: Calibrating Shared Memory in Multi-Agent Debate via Game-Theoretic Equilibrium","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25847","citing_title":"From Soliloquy to Agora: Memory-Enhanced LLM Agents with Decentralized Debate for Optimization Modeling","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08089","citing_title":"GALA: Multimodal Graph Alignment for Bug Localization in Automated Program Repair","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04580","citing_title":"Beyond Fixed Tests: Repository-Level Issue Resolution as Coevolution of Code and Behavioral Constraints","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19049","citing_title":"Refute-or-Promote: An Adversarial Stage-Gated Multi-Agent Review Methodology for High-Precision LLM-Assisted Defect Discovery","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BLSOYEZTB7MZOKWUOILFJGE5QI","json":"https://pith.science/pith/BLSOYEZTB7MZOKWUOILFJGE5QI.json","graph_json":"https://pith.science/api/pith-number/BLSOYEZTB7MZOKWUOILFJGE5QI/graph.json","events_json":"https://pith.science/api/pith-number/BLSOYEZTB7MZOKWUOILFJGE5QI/events.json","paper":"https://pith.science/paper/BLSOYEZT"},"agent_actions":{"view_html":"https://pith.science/pith/BLSOYEZTB7MZOKWUOILFJGE5QI","download_json":"https://pith.science/pith/BLSOYEZTB7MZOKWUOILFJGE5QI.json","view_paper":"https://pith.science/paper/BLSOYEZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.23348&json=true","fetch_graph":"https://pith.science/api/pith-number/BLSOYEZTB7MZOKWUOILFJGE5QI/graph.json","fetch_events":"https://pith.science/api/pith-number/BLSOYEZTB7MZOKWUOILFJGE5QI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLSOYEZTB7MZOKWUOILFJGE5QI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLSOYEZTB7MZOKWUOILFJGE5QI/action/storage_attestation","attest_author":"https://pith.science/pith/BLSOYEZTB7MZOKWUOILFJGE5QI/action/author_attestation","sign_citation":"https://pith.science/pith/BLSOYEZTB7MZOKWUOILFJGE5QI/action/citation_signature","submit_replication":"https://pith.science/pith/BLSOYEZTB7MZOKWUOILFJGE5QI/action/replication_record"}},"created_at":"2026-07-05T11:46:10.548046+00:00","updated_at":"2026-07-05T11:46:10.548046+00:00"}