{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VYPWCHIA6IKD2KFITHE3TXM2JJ","short_pith_number":"pith:VYPWCHIA","schema_version":"1.0","canonical_sha256":"ae1f611d00f2143d28a899c9b9dd9a4a6a31cf2a065d46590d19e35c622cfb9c","source":{"kind":"arxiv","id":"2507.01827","version":5},"attestation_state":"computed","paper":{"title":"PSearch: Search-based Patch Generation in the Era of LLM-based Automated Program Repair","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Haichuan Hu, Quanjun Zhang, Weifeng Sun, Ye Shang","submitted_at":"2025-07-02T15:44:12Z","abstract_excerpt":"Large Language Models (LLMs) have substantially advanced Automated Program Repair (APR), yet most existing LLM-based APR methods still rely on trial-and-error to generate patches. Such a strategy explores candidate patches in a weakly structured manner, making it difficult to assess the future potential of search directions and allocate search budget effectively. To address this limitation, we propose Psearch, a search-based patch generation framework for LLM-based APR centered on iterative patch evaluation and refinement. Instead of treating patch generation as repeated independent sampling, "},"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.01827","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-07-02T15:44:12Z","cross_cats_sorted":[],"title_canon_sha256":"8f7ef5f912b74b04f55b6adfc7397daced836b71b55bdc08d395d0c57d72b7d2","abstract_canon_sha256":"4a01d9f6a580a6e318ad39e338037f5d003a10106ec37d7a65a8959101bc7493"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T03:18:47.540633Z","signature_b64":"yJbQHP7ilcwFxST/5D51eW4ZzYF5Ppr0RlIsVOhGMbBCYV+QmOSmd13Xr69xNinCU8WoKyQcl1dav3OVd460Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae1f611d00f2143d28a899c9b9dd9a4a6a31cf2a065d46590d19e35c622cfb9c","last_reissued_at":"2026-07-07T03:18:47.540130Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T03:18:47.540130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PSearch: Search-based Patch Generation in the Era of LLM-based Automated Program Repair","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Haichuan Hu, Quanjun Zhang, Weifeng Sun, Ye Shang","submitted_at":"2025-07-02T15:44:12Z","abstract_excerpt":"Large Language Models (LLMs) have substantially advanced Automated Program Repair (APR), yet most existing LLM-based APR methods still rely on trial-and-error to generate patches. Such a strategy explores candidate patches in a weakly structured manner, making it difficult to assess the future potential of search directions and allocate search budget effectively. To address this limitation, we propose Psearch, a search-based patch generation framework for LLM-based APR centered on iterative patch evaluation and refinement. Instead of treating patch generation as repeated independent sampling, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01827","kind":"arxiv","version":5},"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.01827/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.01827","created_at":"2026-07-07T03:18:47.540192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.01827v5","created_at":"2026-07-07T03:18:47.540192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01827","created_at":"2026-07-07T03:18:47.540192+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYPWCHIA6IKD","created_at":"2026-07-07T03:18:47.540192+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYPWCHIA6IKD2KFI","created_at":"2026-07-07T03:18:47.540192+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYPWCHIA","created_at":"2026-07-07T03:18:47.540192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2607.01213","citing_title":"RepoRescue: An Empirical Study of LLM Agents on Whole-Repository Compatibility Rescue","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2605.30105","citing_title":"EvoRepair: Enhancing Vulnerability Repair Agents Through Experience-Based Self-Evolution","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19305","citing_title":"DebugRepair: Enhancing LLM-Based Automated Program Repair via Self-Directed Debugging","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VYPWCHIA6IKD2KFITHE3TXM2JJ","json":"https://pith.science/pith/VYPWCHIA6IKD2KFITHE3TXM2JJ.json","graph_json":"https://pith.science/api/pith-number/VYPWCHIA6IKD2KFITHE3TXM2JJ/graph.json","events_json":"https://pith.science/api/pith-number/VYPWCHIA6IKD2KFITHE3TXM2JJ/events.json","paper":"https://pith.science/paper/VYPWCHIA"},"agent_actions":{"view_html":"https://pith.science/pith/VYPWCHIA6IKD2KFITHE3TXM2JJ","download_json":"https://pith.science/pith/VYPWCHIA6IKD2KFITHE3TXM2JJ.json","view_paper":"https://pith.science/paper/VYPWCHIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.01827&json=true","fetch_graph":"https://pith.science/api/pith-number/VYPWCHIA6IKD2KFITHE3TXM2JJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VYPWCHIA6IKD2KFITHE3TXM2JJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYPWCHIA6IKD2KFITHE3TXM2JJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYPWCHIA6IKD2KFITHE3TXM2JJ/action/storage_attestation","attest_author":"https://pith.science/pith/VYPWCHIA6IKD2KFITHE3TXM2JJ/action/author_attestation","sign_citation":"https://pith.science/pith/VYPWCHIA6IKD2KFITHE3TXM2JJ/action/citation_signature","submit_replication":"https://pith.science/pith/VYPWCHIA6IKD2KFITHE3TXM2JJ/action/replication_record"}},"created_at":"2026-07-07T03:18:47.540192+00:00","updated_at":"2026-07-07T03:18:47.540192+00:00"}