{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3POS4PPBUKAVV7GNL3JZHOVNCW","short_pith_number":"pith:3POS4PPB","schema_version":"1.0","canonical_sha256":"dbdd2e3de1a2815afccd5ed393baad1582056865a713a4a186cafcbc420b67b9","source":{"kind":"arxiv","id":"1903.11765","version":1},"attestation_state":"computed","paper":{"title":"Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Deepak Kapur, Stephanie Forrest, ThanhVu Nguyen, Westley Weimer","submitted_at":"2019-03-28T02:44:04Z","abstract_excerpt":"We prove that certain formulations of program synthesis and reachability are equivalent. Specifically, our constructive proof shows the reductions between the template-based synthesis problem, which generates a program in a pre-specified form, and the reachability problem, which decides the reachability of a program location. This establishes a link between the two research fields and allows for the transfer of techniques and results between them.\n  To demonstrate the equivalence, we develop a program repair prototype using reachability tools. We transform a buggy program and its required spec"},"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":"1903.11765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-03-28T02:44:04Z","cross_cats_sorted":[],"title_canon_sha256":"ad916158e0428f4553d204fabf5ead24c93fe7de092a9eb526531c9efd21a180","abstract_canon_sha256":"14acff5b756166e393660e03731edab0ed7f2b719a0422e1743192df59216128"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:01.850740Z","signature_b64":"6ifnhxfb6cuoyAx8wNNI/7Y/quyaoZ9H7qOLo9n4whewKut0E2+AhqJJZHURs8G1jU29jGJWp17xf+6NKaDACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbdd2e3de1a2815afccd5ed393baad1582056865a713a4a186cafcbc420b67b9","last_reissued_at":"2026-05-17T23:50:01.850299Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:01.850299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Deepak Kapur, Stephanie Forrest, ThanhVu Nguyen, Westley Weimer","submitted_at":"2019-03-28T02:44:04Z","abstract_excerpt":"We prove that certain formulations of program synthesis and reachability are equivalent. Specifically, our constructive proof shows the reductions between the template-based synthesis problem, which generates a program in a pre-specified form, and the reachability problem, which decides the reachability of a program location. This establishes a link between the two research fields and allows for the transfer of techniques and results between them.\n  To demonstrate the equivalence, we develop a program repair prototype using reachability tools. We transform a buggy program and its required spec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11765","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":"1903.11765","created_at":"2026-05-17T23:50:01.850365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11765v1","created_at":"2026-05-17T23:50:01.850365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11765","created_at":"2026-05-17T23:50:01.850365+00:00"},{"alias_kind":"pith_short_12","alias_value":"3POS4PPBUKAV","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3POS4PPBUKAVV7GN","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3POS4PPB","created_at":"2026-05-18T12:33:07.085635+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/3POS4PPBUKAVV7GNL3JZHOVNCW","json":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW.json","graph_json":"https://pith.science/api/pith-number/3POS4PPBUKAVV7GNL3JZHOVNCW/graph.json","events_json":"https://pith.science/api/pith-number/3POS4PPBUKAVV7GNL3JZHOVNCW/events.json","paper":"https://pith.science/paper/3POS4PPB"},"agent_actions":{"view_html":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW","download_json":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW.json","view_paper":"https://pith.science/paper/3POS4PPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11765&json=true","fetch_graph":"https://pith.science/api/pith-number/3POS4PPBUKAVV7GNL3JZHOVNCW/graph.json","fetch_events":"https://pith.science/api/pith-number/3POS4PPBUKAVV7GNL3JZHOVNCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW/action/storage_attestation","attest_author":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW/action/author_attestation","sign_citation":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW/action/citation_signature","submit_replication":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW/action/replication_record"}},"created_at":"2026-05-17T23:50:01.850365+00:00","updated_at":"2026-05-17T23:50:01.850365+00:00"}