{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JP6FP6Z25KOENJ5YBQADFTLS6R","short_pith_number":"pith:JP6FP6Z2","canonical_record":{"source":{"id":"2606.30703","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-06-29T13:15:35Z","cross_cats_sorted":[],"title_canon_sha256":"1afe13bb05cfe645c088df195d6b6b85c87c03c9a5125f6e6b9b12529d0ba3e3","abstract_canon_sha256":"dd7d2c6b9f1e77be35b609e9b7b052ac0fe70c3f3f17b8a961e80a1cbe4dded0"},"schema_version":"1.0"},"canonical_sha256":"4bfc57fb3aea9c46a7b80c0032cd72f4447658fcab9cbcaab5d8c29521474a7a","source":{"kind":"arxiv","id":"2606.30703","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.30703","created_at":"2026-07-01T00:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"2606.30703v1","created_at":"2026-07-01T00:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30703","created_at":"2026-07-01T00:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"JP6FP6Z25KOE","created_at":"2026-07-01T00:17:13Z"},{"alias_kind":"pith_short_16","alias_value":"JP6FP6Z25KOENJ5Y","created_at":"2026-07-01T00:17:13Z"},{"alias_kind":"pith_short_8","alias_value":"JP6FP6Z2","created_at":"2026-07-01T00:17:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JP6FP6Z25KOENJ5YBQADFTLS6R","target":"record","payload":{"canonical_record":{"source":{"id":"2606.30703","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-06-29T13:15:35Z","cross_cats_sorted":[],"title_canon_sha256":"1afe13bb05cfe645c088df195d6b6b85c87c03c9a5125f6e6b9b12529d0ba3e3","abstract_canon_sha256":"dd7d2c6b9f1e77be35b609e9b7b052ac0fe70c3f3f17b8a961e80a1cbe4dded0"},"schema_version":"1.0"},"canonical_sha256":"4bfc57fb3aea9c46a7b80c0032cd72f4447658fcab9cbcaab5d8c29521474a7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T00:17:13.956849Z","signature_b64":"1ujbIl70lxdIcv69ssvqFewlq4Fnlnbx3NhrNIh2MTtsnDUE9TYIdHfAidZojnsECUMSFTVyLOhiaN88JeJlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bfc57fb3aea9c46a7b80c0032cd72f4447658fcab9cbcaab5d8c29521474a7a","last_reissued_at":"2026-07-01T00:17:13.956441Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T00:17:13.956441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.30703","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-07-01T00:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dYv45XGkZZysD7odFMlvUAzxA41AUYdwBWkSjQa/OZ0v87XQy32w3YO7tWGsLgXerZS4A71TkPndfxUw9VvEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:19:31.011106Z"},"content_sha256":"12d032862796099a2361318d8eb8281775c2cea88fc25a3f768fcd0d0b6104d2","schema_version":"1.0","event_id":"sha256:12d032862796099a2361318d8eb8281775c2cea88fc25a3f768fcd0d0b6104d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JP6FP6Z25KOENJ5YBQADFTLS6R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NSynC: Normalised Synthesis of Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Edinburgh, Elizabeth Polgreen (1) ((1) University of Edinburgh, Ohad Kammar (1), UK), Zoey Shepherd (1)","submitted_at":"2026-06-29T13:15:35Z","abstract_excerpt":"Inductive program synthesis algorithms search a space of programs to find one that meets some specification. Enumerating according to the syntax of a programming language leads to a large search space, and hence slow synthesis, due in large part to semantic duplication. A synthesiser may have to evaluate -- and reject -- multiple semantically identical but syntactically different programs, wasting resources.\n  To avoid this duplication, we present NSynC, a synthesis-by-semantics approach. By enumerating the semantics of the target language directly, we guarantee that each candidate program is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30703","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.30703/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"},"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-07-01T00:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hCNTXrmcApEp6GQKaR/cUp9ZDn13HOi7EzRFR41E6hLYmYgMv/2a5tT4a8qaeHFm7FNQS74/nj6Wz+uRRp9+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:19:31.011498Z"},"content_sha256":"c297ded88fa3b14018d8805475cf6676fa0018027c26f2264142fd61a8ae3f74","schema_version":"1.0","event_id":"sha256:c297ded88fa3b14018d8805475cf6676fa0018027c26f2264142fd61a8ae3f74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JP6FP6Z25KOENJ5YBQADFTLS6R/bundle.json","state_url":"https://pith.science/pith/JP6FP6Z25KOENJ5YBQADFTLS6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JP6FP6Z25KOENJ5YBQADFTLS6R/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-07-04T07:19:31Z","links":{"resolver":"https://pith.science/pith/JP6FP6Z25KOENJ5YBQADFTLS6R","bundle":"https://pith.science/pith/JP6FP6Z25KOENJ5YBQADFTLS6R/bundle.json","state":"https://pith.science/pith/JP6FP6Z25KOENJ5YBQADFTLS6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JP6FP6Z25KOENJ5YBQADFTLS6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JP6FP6Z25KOENJ5YBQADFTLS6R","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":"dd7d2c6b9f1e77be35b609e9b7b052ac0fe70c3f3f17b8a961e80a1cbe4dded0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-06-29T13:15:35Z","title_canon_sha256":"1afe13bb05cfe645c088df195d6b6b85c87c03c9a5125f6e6b9b12529d0ba3e3"},"schema_version":"1.0","source":{"id":"2606.30703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.30703","created_at":"2026-07-01T00:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"2606.30703v1","created_at":"2026-07-01T00:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30703","created_at":"2026-07-01T00:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"JP6FP6Z25KOE","created_at":"2026-07-01T00:17:13Z"},{"alias_kind":"pith_short_16","alias_value":"JP6FP6Z25KOENJ5Y","created_at":"2026-07-01T00:17:13Z"},{"alias_kind":"pith_short_8","alias_value":"JP6FP6Z2","created_at":"2026-07-01T00:17:13Z"}],"graph_snapshots":[{"event_id":"sha256:c297ded88fa3b14018d8805475cf6676fa0018027c26f2264142fd61a8ae3f74","target":"graph","created_at":"2026-07-01T00:17:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.30703/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Inductive program synthesis algorithms search a space of programs to find one that meets some specification. Enumerating according to the syntax of a programming language leads to a large search space, and hence slow synthesis, due in large part to semantic duplication. A synthesiser may have to evaluate -- and reject -- multiple semantically identical but syntactically different programs, wasting resources.\n  To avoid this duplication, we present NSynC, a synthesis-by-semantics approach. By enumerating the semantics of the target language directly, we guarantee that each candidate program is ","authors_text":"Edinburgh, Elizabeth Polgreen (1) ((1) University of Edinburgh, Ohad Kammar (1), UK), Zoey Shepherd (1)","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-06-29T13:15:35Z","title":"NSynC: Normalised Synthesis of Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30703","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:12d032862796099a2361318d8eb8281775c2cea88fc25a3f768fcd0d0b6104d2","target":"record","created_at":"2026-07-01T00:17:13Z","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":"dd7d2c6b9f1e77be35b609e9b7b052ac0fe70c3f3f17b8a961e80a1cbe4dded0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-06-29T13:15:35Z","title_canon_sha256":"1afe13bb05cfe645c088df195d6b6b85c87c03c9a5125f6e6b9b12529d0ba3e3"},"schema_version":"1.0","source":{"id":"2606.30703","kind":"arxiv","version":1}},"canonical_sha256":"4bfc57fb3aea9c46a7b80c0032cd72f4447658fcab9cbcaab5d8c29521474a7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bfc57fb3aea9c46a7b80c0032cd72f4447658fcab9cbcaab5d8c29521474a7a","first_computed_at":"2026-07-01T00:17:13.956441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T00:17:13.956441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ujbIl70lxdIcv69ssvqFewlq4Fnlnbx3NhrNIh2MTtsnDUE9TYIdHfAidZojnsECUMSFTVyLOhiaN88JeJlCg==","signature_status":"signed_v1","signed_at":"2026-07-01T00:17:13.956849Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.30703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12d032862796099a2361318d8eb8281775c2cea88fc25a3f768fcd0d0b6104d2","sha256:c297ded88fa3b14018d8805475cf6676fa0018027c26f2264142fd61a8ae3f74"],"state_sha256":"cd65111b0ff89b4d56d94080e8c9401a2c2f496885e39f39948c21083acd9fa1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lRaWytCpUak5arbTFCzngFESYA8VtAPLTTppDlKrkuoCeDp0Dtl6BixNnFtDoDZ9ouzXasK3VdqV/FuZs7MlBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T07:19:31.013465Z","bundle_sha256":"9abd4f6619caf492a8f48c33bb8c6864fc4b915420c34f22252a2f14aee390fc"}}