{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MUGOHFLV2XGKW53BR5LI3RN34O","short_pith_number":"pith:MUGOHFLV","schema_version":"1.0","canonical_sha256":"650ce39575d5ccab77618f568dc5bbe3aa0e30237fcaeaf5144e2db982cfa87d","source":{"kind":"arxiv","id":"2312.15698","version":6},"attestation_state":"computed","paper":{"title":"RepairLLaMA: Efficient Representations and Fine-Tuned Adapters for Program Repair","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SE","authors_text":"Andr\\'e Silva, Martin Monperrus, Sen Fang","submitted_at":"2023-12-25T11:39:46Z","abstract_excerpt":"Automated Program Repair (APR) has evolved significantly with the advent of Large Language Models (LLMs). Fine-tuning LLMs for program repair is a recent avenue of research, with many dimensions which have not been explored. Existing work mostly fine-tune LLMs with naive code representations and does not scale to frontier models. To address this problem, we propose RepairLLaMA, a novel program repair approach that 1) identifies optimal code representations for APR with fine-tuned models, and 2) pioneers state-of-the-art parameter-efficient fine-tuning technique (PEFT) for program repair. This "},"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":"2312.15698","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2023-12-25T11:39:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7c60c212de02383fb95d85a7a7745870fcd6ed5554793b3e0547a1014e595498","abstract_canon_sha256":"a00eeec46bb66d891181ce7f4f5a6a019ee2c3eb51652f27936ebc1254ab05b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:05:06.910614Z","signature_b64":"s0oqKMm4Jd669WveHnuoetFHqdOtUPK2mV7vX63BUcqkF8tiTNQy6RzHnC29NFJmcPF+0ernm2ehqw8lgDkcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650ce39575d5ccab77618f568dc5bbe3aa0e30237fcaeaf5144e2db982cfa87d","last_reissued_at":"2026-07-05T12:05:06.910162Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:05:06.910162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RepairLLaMA: Efficient Representations and Fine-Tuned Adapters for Program Repair","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SE","authors_text":"Andr\\'e Silva, Martin Monperrus, Sen Fang","submitted_at":"2023-12-25T11:39:46Z","abstract_excerpt":"Automated Program Repair (APR) has evolved significantly with the advent of Large Language Models (LLMs). Fine-tuning LLMs for program repair is a recent avenue of research, with many dimensions which have not been explored. Existing work mostly fine-tune LLMs with naive code representations and does not scale to frontier models. To address this problem, we propose RepairLLaMA, a novel program repair approach that 1) identifies optimal code representations for APR with fine-tuned models, and 2) pioneers state-of-the-art parameter-efficient fine-tuning technique (PEFT) for program repair. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15698","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/2312.15698/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":"2312.15698","created_at":"2026-07-05T12:05:06.910218+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.15698v6","created_at":"2026-07-05T12:05:06.910218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15698","created_at":"2026-07-05T12:05:06.910218+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUGOHFLV2XGK","created_at":"2026-07-05T12:05:06.910218+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUGOHFLV2XGKW53B","created_at":"2026-07-05T12:05:06.910218+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUGOHFLV","created_at":"2026-07-05T12:05:06.910218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.10484","citing_title":"EXPEREPAIR: Dual-Memory Enhanced LLM-based Repository-Level Program Repair","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2509.11787","citing_title":"CodeCureAgent: Automatic Classification and Repair of Static Analysis Warnings","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2603.07520","citing_title":"On the Effectiveness of Code Representation in Deep Learning-Based Automated Patch Correctness Assessment","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27487","citing_title":"Low Rank Adaptation for Adversarial Perturbation","ref_index":89,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23940","citing_title":"Constraint-Guided Multi-Agent Decompilation for Executable Binary Recovery","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MUGOHFLV2XGKW53BR5LI3RN34O","json":"https://pith.science/pith/MUGOHFLV2XGKW53BR5LI3RN34O.json","graph_json":"https://pith.science/api/pith-number/MUGOHFLV2XGKW53BR5LI3RN34O/graph.json","events_json":"https://pith.science/api/pith-number/MUGOHFLV2XGKW53BR5LI3RN34O/events.json","paper":"https://pith.science/paper/MUGOHFLV"},"agent_actions":{"view_html":"https://pith.science/pith/MUGOHFLV2XGKW53BR5LI3RN34O","download_json":"https://pith.science/pith/MUGOHFLV2XGKW53BR5LI3RN34O.json","view_paper":"https://pith.science/paper/MUGOHFLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.15698&json=true","fetch_graph":"https://pith.science/api/pith-number/MUGOHFLV2XGKW53BR5LI3RN34O/graph.json","fetch_events":"https://pith.science/api/pith-number/MUGOHFLV2XGKW53BR5LI3RN34O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUGOHFLV2XGKW53BR5LI3RN34O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUGOHFLV2XGKW53BR5LI3RN34O/action/storage_attestation","attest_author":"https://pith.science/pith/MUGOHFLV2XGKW53BR5LI3RN34O/action/author_attestation","sign_citation":"https://pith.science/pith/MUGOHFLV2XGKW53BR5LI3RN34O/action/citation_signature","submit_replication":"https://pith.science/pith/MUGOHFLV2XGKW53BR5LI3RN34O/action/replication_record"}},"created_at":"2026-07-05T12:05:06.910218+00:00","updated_at":"2026-07-05T12:05:06.910218+00:00"}