{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:H5ZOSK2CVCDXTHGNYN4ULUIBEV","short_pith_number":"pith:H5ZOSK2C","schema_version":"1.0","canonical_sha256":"3f72e92b42a887799ccdc37945d101255c1986c59bd1df492cd59022343612f4","source":{"kind":"arxiv","id":"2507.22853","version":1},"attestation_state":"computed","paper":{"title":"Repair-R1: Better Test Before Repair","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Haichuan Hu, Quanjun Zhang, Xiaochen Xie","submitted_at":"2025-07-30T17:24:05Z","abstract_excerpt":"APR (Automated Program Repair) aims to automatically locate program defects, generate patches and validate the repairs. Existing techniques for APR are often combined with LLMs (Large Language Models), which leverages the code-related knowledge of LLMs to improve repair effectiveness. Current LLM-based APR methods typically utilize test cases only during the inference stage, adopting an iterative approach that performs repair first and validates it through test execution afterward. This conventional paradigm neglects two important aspects: the potential contribution of test cases in the traini"},"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.22853","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2025-07-30T17:24:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5bc7e95306b15dc5388dd3f173b99b5b45f3f76ca29fd076bdaa40803c01a082","abstract_canon_sha256":"52fff43b7116af070ee57944392adce5183ed87b0a1f1ee4a720838f3c0395cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:50.442053Z","signature_b64":"MuZxw5EuTgP1d+Kw7AndHz3zBafT3fHOZsqZgqMypV9q/Hc1fQGmqVglDKMgBOJZM/DjeY5j+COPLWJCXL1CCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f72e92b42a887799ccdc37945d101255c1986c59bd1df492cd59022343612f4","last_reissued_at":"2026-07-05T11:45:50.441486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:50.441486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repair-R1: Better Test Before Repair","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Haichuan Hu, Quanjun Zhang, Xiaochen Xie","submitted_at":"2025-07-30T17:24:05Z","abstract_excerpt":"APR (Automated Program Repair) aims to automatically locate program defects, generate patches and validate the repairs. Existing techniques for APR are often combined with LLMs (Large Language Models), which leverages the code-related knowledge of LLMs to improve repair effectiveness. Current LLM-based APR methods typically utilize test cases only during the inference stage, adopting an iterative approach that performs repair first and validates it through test execution afterward. This conventional paradigm neglects two important aspects: the potential contribution of test cases in the traini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22853","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.22853/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.22853","created_at":"2026-07-05T11:45:50.441562+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.22853v1","created_at":"2026-07-05T11:45:50.441562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22853","created_at":"2026-07-05T11:45:50.441562+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5ZOSK2CVCDX","created_at":"2026-07-05T11:45:50.441562+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5ZOSK2CVCDXTHGN","created_at":"2026-07-05T11:45:50.441562+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5ZOSK2C","created_at":"2026-07-05T11:45:50.441562+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.08827","citing_title":"A Survey of Reinforcement Learning for Large Reasoning Models","ref_index":199,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H5ZOSK2CVCDXTHGNYN4ULUIBEV","json":"https://pith.science/pith/H5ZOSK2CVCDXTHGNYN4ULUIBEV.json","graph_json":"https://pith.science/api/pith-number/H5ZOSK2CVCDXTHGNYN4ULUIBEV/graph.json","events_json":"https://pith.science/api/pith-number/H5ZOSK2CVCDXTHGNYN4ULUIBEV/events.json","paper":"https://pith.science/paper/H5ZOSK2C"},"agent_actions":{"view_html":"https://pith.science/pith/H5ZOSK2CVCDXTHGNYN4ULUIBEV","download_json":"https://pith.science/pith/H5ZOSK2CVCDXTHGNYN4ULUIBEV.json","view_paper":"https://pith.science/paper/H5ZOSK2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.22853&json=true","fetch_graph":"https://pith.science/api/pith-number/H5ZOSK2CVCDXTHGNYN4ULUIBEV/graph.json","fetch_events":"https://pith.science/api/pith-number/H5ZOSK2CVCDXTHGNYN4ULUIBEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5ZOSK2CVCDXTHGNYN4ULUIBEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5ZOSK2CVCDXTHGNYN4ULUIBEV/action/storage_attestation","attest_author":"https://pith.science/pith/H5ZOSK2CVCDXTHGNYN4ULUIBEV/action/author_attestation","sign_citation":"https://pith.science/pith/H5ZOSK2CVCDXTHGNYN4ULUIBEV/action/citation_signature","submit_replication":"https://pith.science/pith/H5ZOSK2CVCDXTHGNYN4ULUIBEV/action/replication_record"}},"created_at":"2026-07-05T11:45:50.441562+00:00","updated_at":"2026-07-05T11:45:50.441562+00:00"}