{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7V5C53ZDWPAKQJA65AXKDAMPUX","short_pith_number":"pith:7V5C53ZD","schema_version":"1.0","canonical_sha256":"fd7a2eef23b3c0a8241ee82ea1818fa5f1bd56289d58ff4fde19a71b072f42d7","source":{"kind":"arxiv","id":"1503.04914","version":1},"attestation_state":"computed","paper":{"title":"Path-Based Program Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"G\\\"orschwin Fey, Heinz Riener, R\\\"udiger Ehlers","submitted_at":"2015-03-17T03:59:53Z","abstract_excerpt":"We propose a path-based approach to program repair for imperative programs. Our repair framework takes as input a faulty program, a logic specification that is refuted, and a hint where the fault may be located. An iterative abstraction refinement loop is then used to repair the program: in each iteration, the faulty program part is re-synthesized considering a symbolic counterexample, where the control-flow is kept concrete but the data-flow is symbolic. The appeal of the idea is two-fold: 1) the approach lazily considers candidate repairs and 2) the repairs are directly derived from the logi"},"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":"1503.04914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-03-17T03:59:53Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"e8a7c638d2f15088c2c860320839c7949a6501b2d49b802a931cc78a1a9bbf67","abstract_canon_sha256":"6f56596dc42123c25d5628fb8339b0fc15628f7bf8e7502fda5d8c9c9f317ea1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:21.161371Z","signature_b64":"G22325gcW4pZvPlLyXF6TEkTV9GmEpTnwj/ScDNchhEMnOWTj6UFU2JSewhPHikd/HsnZr6A+GLSdSjdgGoNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd7a2eef23b3c0a8241ee82ea1818fa5f1bd56289d58ff4fde19a71b072f42d7","last_reissued_at":"2026-05-18T02:22:21.160795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:21.160795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path-Based Program Repair","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"G\\\"orschwin Fey, Heinz Riener, R\\\"udiger Ehlers","submitted_at":"2015-03-17T03:59:53Z","abstract_excerpt":"We propose a path-based approach to program repair for imperative programs. Our repair framework takes as input a faulty program, a logic specification that is refuted, and a hint where the fault may be located. An iterative abstraction refinement loop is then used to repair the program: in each iteration, the faulty program part is re-synthesized considering a symbolic counterexample, where the control-flow is kept concrete but the data-flow is symbolic. The appeal of the idea is two-fold: 1) the approach lazily considers candidate repairs and 2) the repairs are directly derived from the logi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04914","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":""},"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":"1503.04914","created_at":"2026-05-18T02:22:21.160886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04914v1","created_at":"2026-05-18T02:22:21.160886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04914","created_at":"2026-05-18T02:22:21.160886+00:00"},{"alias_kind":"pith_short_12","alias_value":"7V5C53ZDWPAK","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7V5C53ZDWPAKQJA6","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7V5C53ZD","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7V5C53ZDWPAKQJA65AXKDAMPUX","json":"https://pith.science/pith/7V5C53ZDWPAKQJA65AXKDAMPUX.json","graph_json":"https://pith.science/api/pith-number/7V5C53ZDWPAKQJA65AXKDAMPUX/graph.json","events_json":"https://pith.science/api/pith-number/7V5C53ZDWPAKQJA65AXKDAMPUX/events.json","paper":"https://pith.science/paper/7V5C53ZD"},"agent_actions":{"view_html":"https://pith.science/pith/7V5C53ZDWPAKQJA65AXKDAMPUX","download_json":"https://pith.science/pith/7V5C53ZDWPAKQJA65AXKDAMPUX.json","view_paper":"https://pith.science/paper/7V5C53ZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04914&json=true","fetch_graph":"https://pith.science/api/pith-number/7V5C53ZDWPAKQJA65AXKDAMPUX/graph.json","fetch_events":"https://pith.science/api/pith-number/7V5C53ZDWPAKQJA65AXKDAMPUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7V5C53ZDWPAKQJA65AXKDAMPUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7V5C53ZDWPAKQJA65AXKDAMPUX/action/storage_attestation","attest_author":"https://pith.science/pith/7V5C53ZDWPAKQJA65AXKDAMPUX/action/author_attestation","sign_citation":"https://pith.science/pith/7V5C53ZDWPAKQJA65AXKDAMPUX/action/citation_signature","submit_replication":"https://pith.science/pith/7V5C53ZDWPAKQJA65AXKDAMPUX/action/replication_record"}},"created_at":"2026-05-18T02:22:21.160886+00:00","updated_at":"2026-05-18T02:22:21.160886+00:00"}