{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:S5HC5IEUBWHRVMFXOOJAHOU6QO","short_pith_number":"pith:S5HC5IEU","canonical_record":{"source":{"id":"2009.10272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-09-22T01:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"00407f9456f0460d65316681ec49c4e424720a0bc2da3e0727229f2f3e4c8e8e","abstract_canon_sha256":"31c7ef9adf5b3cd4fcf48ff90007e88956b5881b0152665903fce05677bdcde9"},"schema_version":"1.0"},"canonical_sha256":"974e2ea0940d8f1ab0b7739203ba9e839416d2d3b36d46535d0b85a3327e3530","source":{"kind":"arxiv","id":"2009.10272","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.10272","created_at":"2026-07-05T02:22:23Z"},{"alias_kind":"arxiv_version","alias_value":"2009.10272v2","created_at":"2026-07-05T02:22:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.10272","created_at":"2026-07-05T02:22:23Z"},{"alias_kind":"pith_short_12","alias_value":"S5HC5IEUBWHR","created_at":"2026-07-05T02:22:23Z"},{"alias_kind":"pith_short_16","alias_value":"S5HC5IEUBWHRVMFX","created_at":"2026-07-05T02:22:23Z"},{"alias_kind":"pith_short_8","alias_value":"S5HC5IEU","created_at":"2026-07-05T02:22:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:S5HC5IEUBWHRVMFXOOJAHOU6QO","target":"record","payload":{"canonical_record":{"source":{"id":"2009.10272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-09-22T01:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"00407f9456f0460d65316681ec49c4e424720a0bc2da3e0727229f2f3e4c8e8e","abstract_canon_sha256":"31c7ef9adf5b3cd4fcf48ff90007e88956b5881b0152665903fce05677bdcde9"},"schema_version":"1.0"},"canonical_sha256":"974e2ea0940d8f1ab0b7739203ba9e839416d2d3b36d46535d0b85a3327e3530","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:22:23.711971Z","signature_b64":"2PLXIQEkN5VAzaLRntJ3O5+O/36h6POsTy6n89ny6by+qxsw+lEW5gOGljHEBh/Sy4tlJFmbRU92sUQxVEJBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"974e2ea0940d8f1ab0b7739203ba9e839416d2d3b36d46535d0b85a3327e3530","last_reissued_at":"2026-07-05T02:22:23.711620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:22:23.711620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.10272","source_version":2,"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-05T02:22:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVjnnzCuRs5pUPeS4vLp1kNOxKSERPktcuKCdnXD8KYCH2Pt65qK0e7A5Bvarw1w9S4iL5evGqakfIPkoxcSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T22:29:31.137303Z"},"content_sha256":"7a61c9bd6ee8498991dd4f68a2810acf89c9c6ff62fee8ea424a0893bfdd8d35","schema_version":"1.0","event_id":"sha256:7a61c9bd6ee8498991dd4f68a2810acf89c9c6ff62fee8ea424a0893bfdd8d35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:S5HC5IEUBWHRVMFXOOJAHOU6QO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inductive Program Synthesis Over Noisy Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Martin Rinard, Shivam Handa","submitted_at":"2020-09-22T01:57:48Z","abstract_excerpt":"We present a new framework and associated synthesis algorithms for program synthesis over noisy data, i.e., data that may contain incorrect/corrupted input-output examples. This framework is based on an extension of finite tree automata called {\\em weighted finite tree automata}. We show how to apply this framework to formulate and solve a variety of program synthesis problems over noisy data. Results from our implemented system running on problems from the SyGuS 2018 benchmark suite highlight its ability to successfully synthesize programs in the face of noisy data sets, including the ability"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.10272","kind":"arxiv","version":2},"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/2009.10272/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-05T02:22:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHG1vXkrSzT17LpSYi74o4Di7wcOvoRxtp7JYU6NPo23cBCrYtnmyOrNJ32fcs44aoAjdDnC/gaX5pL/hyw+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T22:29:31.137586Z"},"content_sha256":"2634dab02d43e397c7b6ccc1306a8e69667078c68c324e261400bd64b1967ba0","schema_version":"1.0","event_id":"sha256:2634dab02d43e397c7b6ccc1306a8e69667078c68c324e261400bd64b1967ba0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5HC5IEUBWHRVMFXOOJAHOU6QO/bundle.json","state_url":"https://pith.science/pith/S5HC5IEUBWHRVMFXOOJAHOU6QO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5HC5IEUBWHRVMFXOOJAHOU6QO/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-31T22:29:31Z","links":{"resolver":"https://pith.science/pith/S5HC5IEUBWHRVMFXOOJAHOU6QO","bundle":"https://pith.science/pith/S5HC5IEUBWHRVMFXOOJAHOU6QO/bundle.json","state":"https://pith.science/pith/S5HC5IEUBWHRVMFXOOJAHOU6QO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5HC5IEUBWHRVMFXOOJAHOU6QO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:S5HC5IEUBWHRVMFXOOJAHOU6QO","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":"31c7ef9adf5b3cd4fcf48ff90007e88956b5881b0152665903fce05677bdcde9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-09-22T01:57:48Z","title_canon_sha256":"00407f9456f0460d65316681ec49c4e424720a0bc2da3e0727229f2f3e4c8e8e"},"schema_version":"1.0","source":{"id":"2009.10272","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.10272","created_at":"2026-07-05T02:22:23Z"},{"alias_kind":"arxiv_version","alias_value":"2009.10272v2","created_at":"2026-07-05T02:22:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.10272","created_at":"2026-07-05T02:22:23Z"},{"alias_kind":"pith_short_12","alias_value":"S5HC5IEUBWHR","created_at":"2026-07-05T02:22:23Z"},{"alias_kind":"pith_short_16","alias_value":"S5HC5IEUBWHRVMFX","created_at":"2026-07-05T02:22:23Z"},{"alias_kind":"pith_short_8","alias_value":"S5HC5IEU","created_at":"2026-07-05T02:22:23Z"}],"graph_snapshots":[{"event_id":"sha256:2634dab02d43e397c7b6ccc1306a8e69667078c68c324e261400bd64b1967ba0","target":"graph","created_at":"2026-07-05T02:22:23Z","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/2009.10272/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new framework and associated synthesis algorithms for program synthesis over noisy data, i.e., data that may contain incorrect/corrupted input-output examples. This framework is based on an extension of finite tree automata called {\\em weighted finite tree automata}. We show how to apply this framework to formulate and solve a variety of program synthesis problems over noisy data. Results from our implemented system running on problems from the SyGuS 2018 benchmark suite highlight its ability to successfully synthesize programs in the face of noisy data sets, including the ability","authors_text":"Martin Rinard, Shivam Handa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-09-22T01:57:48Z","title":"Inductive Program Synthesis Over Noisy Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.10272","kind":"arxiv","version":2},"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:7a61c9bd6ee8498991dd4f68a2810acf89c9c6ff62fee8ea424a0893bfdd8d35","target":"record","created_at":"2026-07-05T02:22:23Z","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":"31c7ef9adf5b3cd4fcf48ff90007e88956b5881b0152665903fce05677bdcde9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-09-22T01:57:48Z","title_canon_sha256":"00407f9456f0460d65316681ec49c4e424720a0bc2da3e0727229f2f3e4c8e8e"},"schema_version":"1.0","source":{"id":"2009.10272","kind":"arxiv","version":2}},"canonical_sha256":"974e2ea0940d8f1ab0b7739203ba9e839416d2d3b36d46535d0b85a3327e3530","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"974e2ea0940d8f1ab0b7739203ba9e839416d2d3b36d46535d0b85a3327e3530","first_computed_at":"2026-07-05T02:22:23.711620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:22:23.711620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2PLXIQEkN5VAzaLRntJ3O5+O/36h6POsTy6n89ny6by+qxsw+lEW5gOGljHEBh/Sy4tlJFmbRU92sUQxVEJBBA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:22:23.711971Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.10272","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a61c9bd6ee8498991dd4f68a2810acf89c9c6ff62fee8ea424a0893bfdd8d35","sha256:2634dab02d43e397c7b6ccc1306a8e69667078c68c324e261400bd64b1967ba0"],"state_sha256":"f11d016ac4acedf8d89b847537aa75a609eb4ec956e0d178a0330a7bda2ce3fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v3/TrU2hi1aAD+qTr/kavz2d4SiTejC3Vt6wTPxVyonNJFlBaBLvixJJdZjlXUhYiXrAQlT9X+wQKqbA8l9OAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T22:29:31.140056Z","bundle_sha256":"0253b97f3055a7ff9390ab055bba93ee405c9ea2690ac45d3fb8f39e68aa73fd"}}