{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3POS4PPBUKAVV7GNL3JZHOVNCW","short_pith_number":"pith:3POS4PPB","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"},"canonical_sha256":"dbdd2e3de1a2815afccd5ed393baad1582056865a713a4a186cafcbc420b67b9","source":{"kind":"arxiv","id":"1903.11765","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11765","created_at":"2026-05-17T23:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11765v1","created_at":"2026-05-17T23:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11765","created_at":"2026-05-17T23:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"3POS4PPBUKAV","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3POS4PPBUKAVV7GN","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3POS4PPB","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3POS4PPBUKAVV7GNL3JZHOVNCW","target":"record","payload":{"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"},"canonical_sha256":"dbdd2e3de1a2815afccd5ed393baad1582056865a713a4a186cafcbc420b67b9","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"},"source_kind":"arxiv","source_id":"1903.11765","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/8WZv1twFOGE7WTnuioy46cKe192MxmgN9GY9XYq7K348I7TjXZSWNhjTBAc7rHhx6oqGMvKeORThI+O/MwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T07:44:10.819885Z"},"content_sha256":"c90339f7779b26166243da1ac55b5ae934369eee6e2c00d6f57cb09a431e4209","schema_version":"1.0","event_id":"sha256:c90339f7779b26166243da1ac55b5ae934369eee6e2c00d6f57cb09a431e4209"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3POS4PPBUKAVV7GNL3JZHOVNCW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISFHfWlqINiDV4pFYmf5GhNNTBhrFi1AtY6/uwWVp/OjYq1BNmvL57yCLWSBISq0ES5q/zi9bMFircrnKOPqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T07:44:10.820255Z"},"content_sha256":"723b043fa3159f763457e0d4ca472884bbc745e8a18d743f3db6127a2f136cc6","schema_version":"1.0","event_id":"sha256:723b043fa3159f763457e0d4ca472884bbc745e8a18d743f3db6127a2f136cc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW/bundle.json","state_url":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3POS4PPBUKAVV7GNL3JZHOVNCW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T07:44:10Z","links":{"resolver":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW","bundle":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW/bundle.json","state":"https://pith.science/pith/3POS4PPBUKAVV7GNL3JZHOVNCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3POS4PPBUKAVV7GNL3JZHOVNCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3POS4PPBUKAVV7GNL3JZHOVNCW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"14acff5b756166e393660e03731edab0ed7f2b719a0422e1743192df59216128","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-03-28T02:44:04Z","title_canon_sha256":"ad916158e0428f4553d204fabf5ead24c93fe7de092a9eb526531c9efd21a180"},"schema_version":"1.0","source":{"id":"1903.11765","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11765","created_at":"2026-05-17T23:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11765v1","created_at":"2026-05-17T23:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11765","created_at":"2026-05-17T23:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"3POS4PPBUKAV","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3POS4PPBUKAVV7GN","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3POS4PPB","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:723b043fa3159f763457e0d4ca472884bbc745e8a18d743f3db6127a2f136cc6","target":"graph","created_at":"2026-05-17T23:50:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Deepak Kapur, Stephanie Forrest, ThanhVu Nguyen, Westley Weimer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-03-28T02:44:04Z","title":"Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11765","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c90339f7779b26166243da1ac55b5ae934369eee6e2c00d6f57cb09a431e4209","target":"record","created_at":"2026-05-17T23:50:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"14acff5b756166e393660e03731edab0ed7f2b719a0422e1743192df59216128","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-03-28T02:44:04Z","title_canon_sha256":"ad916158e0428f4553d204fabf5ead24c93fe7de092a9eb526531c9efd21a180"},"schema_version":"1.0","source":{"id":"1903.11765","kind":"arxiv","version":1}},"canonical_sha256":"dbdd2e3de1a2815afccd5ed393baad1582056865a713a4a186cafcbc420b67b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbdd2e3de1a2815afccd5ed393baad1582056865a713a4a186cafcbc420b67b9","first_computed_at":"2026-05-17T23:50:01.850299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:01.850299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ifnhxfb6cuoyAx8wNNI/7Y/quyaoZ9H7qOLo9n4whewKut0E2+AhqJJZHURs8G1jU29jGJWp17xf+6NKaDACw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:01.850740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11765","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c90339f7779b26166243da1ac55b5ae934369eee6e2c00d6f57cb09a431e4209","sha256:723b043fa3159f763457e0d4ca472884bbc745e8a18d743f3db6127a2f136cc6"],"state_sha256":"5a16ba3e32b63c91a3c85847633de815d5982833dfcd76a455207b999adb4919"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NITSlGDdlNb35eH6kH9MZlpwarpkWvwmkp5hlYqjNNmOZxtGU9hZ6QYoCADLJWYBQ4DT5xUgEiA1+ZVcS9mPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T07:44:10.823657Z","bundle_sha256":"64dc6f137cf3c8aebc8c78c5a8798b1603d4f18f85c3d7b997410cf1b9ea4270"}}