{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:C5HWRRIV66MGOAD363WSJNXRRC","short_pith_number":"pith:C5HWRRIV","canonical_record":{"source":{"id":"1905.05800","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-14T19:18:54Z","cross_cats_sorted":[],"title_canon_sha256":"f2d126d7728242b0ceba8f96a56fe6308c5a0ae3a02a8860c6f3447be2f260d0","abstract_canon_sha256":"36a3cfcdb7dc8eca208147a7a47b96e1b44a9f2ed25e05d3be67a739d2606c5b"},"schema_version":"1.0"},"canonical_sha256":"174f68c515f79867007bf6ed24b6f188aced4defc229f8ac549b0540e6856266","source":{"kind":"arxiv","id":"1905.05800","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05800","created_at":"2026-05-17T23:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05800v3","created_at":"2026-05-17T23:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05800","created_at":"2026-05-17T23:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"C5HWRRIV66MG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"C5HWRRIV66MGOAD3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"C5HWRRIV","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:C5HWRRIV66MGOAD363WSJNXRRC","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05800","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-14T19:18:54Z","cross_cats_sorted":[],"title_canon_sha256":"f2d126d7728242b0ceba8f96a56fe6308c5a0ae3a02a8860c6f3447be2f260d0","abstract_canon_sha256":"36a3cfcdb7dc8eca208147a7a47b96e1b44a9f2ed25e05d3be67a739d2606c5b"},"schema_version":"1.0"},"canonical_sha256":"174f68c515f79867007bf6ed24b6f188aced4defc229f8ac549b0540e6856266","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:39.487599Z","signature_b64":"5pRFBqKr+KgdDd7fDPOsmA/jPRQK9K7xfI2niFOpy3gj8mCqWGwo2x4wsYicuLvWhQoLIgYW2rSYmoSz56JMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"174f68c515f79867007bf6ed24b6f188aced4defc229f8ac549b0540e6856266","last_reissued_at":"2026-05-17T23:39:39.486834Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:39.486834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05800","source_version":3,"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:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YbV1xpT2kAh7JdKwSbmEkX6Ra6KcSGV2lr3yXn4qGgWmJR8mtDtwfEecRbnO+ifbvF9sBRr6bSnaMEIcxLqGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:54:14.014973Z"},"content_sha256":"d274f42911ff67d9dd0f459051dae748762bd5dc76ba02cfb4fcd55c27205747","schema_version":"1.0","event_id":"sha256:d274f42911ff67d9dd0f459051dae748762bd5dc76ba02cfb4fcd55c27205747"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:C5HWRRIV66MGOAD363WSJNXRRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proving Unrealizability for Syntax-Guided Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jason Breck, John Cyphert, Loris D'Antoni, Qinheping Hu, Thomas Reps","submitted_at":"2019-05-14T19:18:54Z","abstract_excerpt":"Proving Unrealizability for Syntax-Guided Synthesis\n  We consider the problem of automatically establishing that a given syntax-guided-synthesis (SyGuS) problem is unrealizable (i.e., has no solution). Existing techniques have quite limited ability to establish unrealizability for general SyGuS instances in which the grammar describing the search space contains infinitely many programs. By encoding the synthesis problem's grammar G as a nondeterministic program P_G, we reduce the unrealizability problem to a reachability problem such that, if a standard program-analysis tool can establish that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05800","kind":"arxiv","version":3},"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:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j0CLb/fkrVEhGTKriaepd0Y1BXcfiqxh9kUf+33eHqTiH5/XeSSdl6rmm7HRS15jNttaG6wEsVFgWSGFLbUSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:54:14.015643Z"},"content_sha256":"3aa4a944e1d7bbcf5ca385347573a237eca0040a310a3d32c7a4f581ff072290","schema_version":"1.0","event_id":"sha256:3aa4a944e1d7bbcf5ca385347573a237eca0040a310a3d32c7a4f581ff072290"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5HWRRIV66MGOAD363WSJNXRRC/bundle.json","state_url":"https://pith.science/pith/C5HWRRIV66MGOAD363WSJNXRRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5HWRRIV66MGOAD363WSJNXRRC/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-26T17:54:14Z","links":{"resolver":"https://pith.science/pith/C5HWRRIV66MGOAD363WSJNXRRC","bundle":"https://pith.science/pith/C5HWRRIV66MGOAD363WSJNXRRC/bundle.json","state":"https://pith.science/pith/C5HWRRIV66MGOAD363WSJNXRRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5HWRRIV66MGOAD363WSJNXRRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:C5HWRRIV66MGOAD363WSJNXRRC","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":"36a3cfcdb7dc8eca208147a7a47b96e1b44a9f2ed25e05d3be67a739d2606c5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-14T19:18:54Z","title_canon_sha256":"f2d126d7728242b0ceba8f96a56fe6308c5a0ae3a02a8860c6f3447be2f260d0"},"schema_version":"1.0","source":{"id":"1905.05800","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05800","created_at":"2026-05-17T23:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05800v3","created_at":"2026-05-17T23:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05800","created_at":"2026-05-17T23:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"C5HWRRIV66MG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"C5HWRRIV66MGOAD3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"C5HWRRIV","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:3aa4a944e1d7bbcf5ca385347573a237eca0040a310a3d32c7a4f581ff072290","target":"graph","created_at":"2026-05-17T23:39:39Z","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":"Proving Unrealizability for Syntax-Guided Synthesis\n  We consider the problem of automatically establishing that a given syntax-guided-synthesis (SyGuS) problem is unrealizable (i.e., has no solution). Existing techniques have quite limited ability to establish unrealizability for general SyGuS instances in which the grammar describing the search space contains infinitely many programs. By encoding the synthesis problem's grammar G as a nondeterministic program P_G, we reduce the unrealizability problem to a reachability problem such that, if a standard program-analysis tool can establish that","authors_text":"Jason Breck, John Cyphert, Loris D'Antoni, Qinheping Hu, Thomas Reps","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-14T19:18:54Z","title":"Proving Unrealizability for Syntax-Guided Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05800","kind":"arxiv","version":3},"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:d274f42911ff67d9dd0f459051dae748762bd5dc76ba02cfb4fcd55c27205747","target":"record","created_at":"2026-05-17T23:39:39Z","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":"36a3cfcdb7dc8eca208147a7a47b96e1b44a9f2ed25e05d3be67a739d2606c5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-14T19:18:54Z","title_canon_sha256":"f2d126d7728242b0ceba8f96a56fe6308c5a0ae3a02a8860c6f3447be2f260d0"},"schema_version":"1.0","source":{"id":"1905.05800","kind":"arxiv","version":3}},"canonical_sha256":"174f68c515f79867007bf6ed24b6f188aced4defc229f8ac549b0540e6856266","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"174f68c515f79867007bf6ed24b6f188aced4defc229f8ac549b0540e6856266","first_computed_at":"2026-05-17T23:39:39.486834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:39.486834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5pRFBqKr+KgdDd7fDPOsmA/jPRQK9K7xfI2niFOpy3gj8mCqWGwo2x4wsYicuLvWhQoLIgYW2rSYmoSz56JMAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:39.487599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05800","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d274f42911ff67d9dd0f459051dae748762bd5dc76ba02cfb4fcd55c27205747","sha256:3aa4a944e1d7bbcf5ca385347573a237eca0040a310a3d32c7a4f581ff072290"],"state_sha256":"f164f9d8b585fb36cfc83846f3c2918ad87ff52097902841358774d579d87719"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OHFjy0S+XF1iXScrj/mTMLjS5zb+AJiILDHIWOU1j6oDbFCIMXdXC76/Yi4rQ35eC8Fq90JAsK/sU6djsEhXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:54:14.018845Z","bundle_sha256":"73f9d3aeedef8998d1a9e3309c03307d7b72c222e2793a609858f698c5e17b36"}}