{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NEL5K2KUTE6WSJPFNY723DCNA4","short_pith_number":"pith:NEL5K2KU","canonical_record":{"source":{"id":"2104.13315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-04-27T16:45:11Z","cross_cats_sorted":["cs.FL","cs.LG"],"title_canon_sha256":"3d64b647f64efb6d08cb64dc4f3ed5afa3b5a68c73420640bea7ba458bc0d5d7","abstract_canon_sha256":"d9a3e7250921ec0f3abf232d8f10db262aa3efd6e02e66ca19aea4047476c150"},"schema_version":"1.0"},"canonical_sha256":"6917d56954993d6925e56e3fad8c4d072fba569f43711d28c004490d536bdc31","source":{"kind":"arxiv","id":"2104.13315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.13315","created_at":"2026-07-05T02:35:47Z"},{"alias_kind":"arxiv_version","alias_value":"2104.13315v1","created_at":"2026-07-05T02:35:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.13315","created_at":"2026-07-05T02:35:47Z"},{"alias_kind":"pith_short_12","alias_value":"NEL5K2KUTE6W","created_at":"2026-07-05T02:35:47Z"},{"alias_kind":"pith_short_16","alias_value":"NEL5K2KUTE6WSJPF","created_at":"2026-07-05T02:35:47Z"},{"alias_kind":"pith_short_8","alias_value":"NEL5K2KU","created_at":"2026-07-05T02:35:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NEL5K2KUTE6WSJPFNY723DCNA4","target":"record","payload":{"canonical_record":{"source":{"id":"2104.13315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-04-27T16:45:11Z","cross_cats_sorted":["cs.FL","cs.LG"],"title_canon_sha256":"3d64b647f64efb6d08cb64dc4f3ed5afa3b5a68c73420640bea7ba458bc0d5d7","abstract_canon_sha256":"d9a3e7250921ec0f3abf232d8f10db262aa3efd6e02e66ca19aea4047476c150"},"schema_version":"1.0"},"canonical_sha256":"6917d56954993d6925e56e3fad8c4d072fba569f43711d28c004490d536bdc31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:35:47.453459Z","signature_b64":"F1jwynXRzdELgIVKDP6Mm4YWgttQ+lVHz2EjOYH2qfZCvRpEs3weYDckjHTMLPEIhyjqblSaU5YX5ChbqAqsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6917d56954993d6925e56e3fad8c4d072fba569f43711d28c004490d536bdc31","last_reissued_at":"2026-07-05T02:35:47.452967Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:35:47.452967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.13315","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-05T02:35:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y+Ae9G4W/GC94G7r9ED2v2srWSDGMl5vkBcQ5kwS8TAc2crjgshpSmqCfrDa6wl7VNS8LPWnEAY3g1uAQonHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T17:37:49.555438Z"},"content_sha256":"f163622294a194c30a391e6f59a7ee08820c197482922df80531608d16438767","schema_version":"1.0","event_id":"sha256:f163622294a194c30a391e6f59a7ee08820c197482922df80531608d16438767"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NEL5K2KUTE6WSJPFNY723DCNA4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inductive Program Synthesis over Noisy Datasets using Abstraction Refinement Based Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LG"],"primary_cat":"cs.PL","authors_text":"Martin Rinard, Shivam Handa","submitted_at":"2021-04-27T16:45:11Z","abstract_excerpt":"We present a new synthesis algorithm to solve program synthesis over noisy datasets, i.e., data that may contain incorrect/corrupted input-output examples. Our algorithm uses an abstraction refinement based optimization process to synthesize programs which optimize the tradeoff between the loss over the noisy dataset and the complexity of the synthesized program. The algorithm uses abstractions to divide the search space of programs into subspaces by computing an abstract value that represents outputs for all programs in a subspace. The abstract value allows our algorithm to compute, for each "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.13315","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/2104.13315/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:35:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YlbOWZBxZEXfb0u0/CSvWgq/jzOtPkgMqrvZNNm5SODeVzv689+UB1pA6/kCaEVBtTk0mZr72HsSh9IS6PAmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T17:37:49.555819Z"},"content_sha256":"f0b9b25f529c9549ecee91c17296472d352c36478aeadbcf9dfeecbcacda474b","schema_version":"1.0","event_id":"sha256:f0b9b25f529c9549ecee91c17296472d352c36478aeadbcf9dfeecbcacda474b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEL5K2KUTE6WSJPFNY723DCNA4/bundle.json","state_url":"https://pith.science/pith/NEL5K2KUTE6WSJPFNY723DCNA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEL5K2KUTE6WSJPFNY723DCNA4/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-25T17:37:49Z","links":{"resolver":"https://pith.science/pith/NEL5K2KUTE6WSJPFNY723DCNA4","bundle":"https://pith.science/pith/NEL5K2KUTE6WSJPFNY723DCNA4/bundle.json","state":"https://pith.science/pith/NEL5K2KUTE6WSJPFNY723DCNA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEL5K2KUTE6WSJPFNY723DCNA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NEL5K2KUTE6WSJPFNY723DCNA4","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":"d9a3e7250921ec0f3abf232d8f10db262aa3efd6e02e66ca19aea4047476c150","cross_cats_sorted":["cs.FL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-04-27T16:45:11Z","title_canon_sha256":"3d64b647f64efb6d08cb64dc4f3ed5afa3b5a68c73420640bea7ba458bc0d5d7"},"schema_version":"1.0","source":{"id":"2104.13315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.13315","created_at":"2026-07-05T02:35:47Z"},{"alias_kind":"arxiv_version","alias_value":"2104.13315v1","created_at":"2026-07-05T02:35:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.13315","created_at":"2026-07-05T02:35:47Z"},{"alias_kind":"pith_short_12","alias_value":"NEL5K2KUTE6W","created_at":"2026-07-05T02:35:47Z"},{"alias_kind":"pith_short_16","alias_value":"NEL5K2KUTE6WSJPF","created_at":"2026-07-05T02:35:47Z"},{"alias_kind":"pith_short_8","alias_value":"NEL5K2KU","created_at":"2026-07-05T02:35:47Z"}],"graph_snapshots":[{"event_id":"sha256:f0b9b25f529c9549ecee91c17296472d352c36478aeadbcf9dfeecbcacda474b","target":"graph","created_at":"2026-07-05T02:35:47Z","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/2104.13315/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new synthesis algorithm to solve program synthesis over noisy datasets, i.e., data that may contain incorrect/corrupted input-output examples. Our algorithm uses an abstraction refinement based optimization process to synthesize programs which optimize the tradeoff between the loss over the noisy dataset and the complexity of the synthesized program. The algorithm uses abstractions to divide the search space of programs into subspaces by computing an abstract value that represents outputs for all programs in a subspace. The abstract value allows our algorithm to compute, for each ","authors_text":"Martin Rinard, Shivam Handa","cross_cats":["cs.FL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-04-27T16:45:11Z","title":"Inductive Program Synthesis over Noisy Datasets using Abstraction Refinement Based Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.13315","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:f163622294a194c30a391e6f59a7ee08820c197482922df80531608d16438767","target":"record","created_at":"2026-07-05T02:35:47Z","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":"d9a3e7250921ec0f3abf232d8f10db262aa3efd6e02e66ca19aea4047476c150","cross_cats_sorted":["cs.FL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-04-27T16:45:11Z","title_canon_sha256":"3d64b647f64efb6d08cb64dc4f3ed5afa3b5a68c73420640bea7ba458bc0d5d7"},"schema_version":"1.0","source":{"id":"2104.13315","kind":"arxiv","version":1}},"canonical_sha256":"6917d56954993d6925e56e3fad8c4d072fba569f43711d28c004490d536bdc31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6917d56954993d6925e56e3fad8c4d072fba569f43711d28c004490d536bdc31","first_computed_at":"2026-07-05T02:35:47.452967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:35:47.452967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F1jwynXRzdELgIVKDP6Mm4YWgttQ+lVHz2EjOYH2qfZCvRpEs3weYDckjHTMLPEIhyjqblSaU5YX5ChbqAqsCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:35:47.453459Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.13315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f163622294a194c30a391e6f59a7ee08820c197482922df80531608d16438767","sha256:f0b9b25f529c9549ecee91c17296472d352c36478aeadbcf9dfeecbcacda474b"],"state_sha256":"54631552cbb2faa6ea2d38213767da41bb4ed35466b0782364fcc086fb29749b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fG60nlUyr+H7DYWQefceyFSD4240LrvIjyyU2MCf70/euFaxqwok5StYM/ehSB/lTMfcPo46ry471HuqcZB/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-25T17:37:49.557994Z","bundle_sha256":"bfa59e6e3ad87aeda67f738f0c9f878002c2d3aee842b063f3d844c8da5ad771"}}