{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:L7BUZCBZNLU2F6AXONSBTUJFPO","short_pith_number":"pith:L7BUZCBZ","canonical_record":{"source":{"id":"1905.08364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-20T22:10:47Z","cross_cats_sorted":[],"title_canon_sha256":"4895675b4822ca7edd21a633485913039bc177bb39fc075c7ec0ec08b892d6df","abstract_canon_sha256":"e7dcc08650b32a730bea1a9baa73ba2c46aac8c50b0bbf6d0defde87316724d9"},"schema_version":"1.0"},"canonical_sha256":"5fc34c88396ae9a2f817736419d1257b9a81f39ea3fa9fc52d0d02cb26baa2f5","source":{"kind":"arxiv","id":"1905.08364","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08364","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08364v1","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08364","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"L7BUZCBZNLU2","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L7BUZCBZNLU2F6AX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L7BUZCBZ","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:L7BUZCBZNLU2F6AXONSBTUJFPO","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-20T22:10:47Z","cross_cats_sorted":[],"title_canon_sha256":"4895675b4822ca7edd21a633485913039bc177bb39fc075c7ec0ec08b892d6df","abstract_canon_sha256":"e7dcc08650b32a730bea1a9baa73ba2c46aac8c50b0bbf6d0defde87316724d9"},"schema_version":"1.0"},"canonical_sha256":"5fc34c88396ae9a2f817736419d1257b9a81f39ea3fa9fc52d0d02cb26baa2f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:43.492100Z","signature_b64":"2rLr2IMyHZxKNrk7+hljRMpDcWF/cAxc9m0XLb6Dwx7ixs1UEsfWH+s1si+J5HQdF+vFuEF3+jJy5bnqpvjaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fc34c88396ae9a2f817736419d1257b9a81f39ea3fa9fc52d0d02cb26baa2f5","last_reissued_at":"2026-05-17T23:45:43.491491Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:43.491491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08364","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:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XuOwQwTgpuG+P2e83YFcmREwFopWfbzKVXNKcLBkidhKK0U5hRXd7GZTKzrr4QQZRRRCdPe0G4DgbL4l0eOQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:12:37.463877Z"},"content_sha256":"bcdc8329e623a7369f3040ac9bfce86fb838d16917e7f92ecfd11b554efb614b","schema_version":"1.0","event_id":"sha256:bcdc8329e623a7369f3040ac9bfce86fb838d16917e7f92ecfd11b554efb614b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:L7BUZCBZNLU2F6AXONSBTUJFPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Synthesis with Probabilistic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aws Albarghouthi, Loris D'Antoni, Samuel Drews","submitted_at":"2019-05-20T22:10:47Z","abstract_excerpt":"We consider the problem of synthesizing a program given a probabilistic specification of its desired behavior. Specifically, we study the recent paradigm of distribution-guided inductive synthesis (DIGITS), which iteratively calls a synthesizer on finite sample sets from a given distribution. We make theoretical and algorithmic contributions: (i) We prove the surprising result that DIGITS only requires a polynomial number of synthesizer calls in the size of the sample set, despite its ostensibly exponential behavior. (ii) We present a property-directed version of DIGITS that further reduces th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08364","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:45:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aCPyr/8t4Vx6wp5nocm7FEH5AaslJUFf4DU8xk6bPKUcpEsaeN0+5gumq2UNLSKm4kaA2OQi/SUoG5qYvR81BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:12:37.464285Z"},"content_sha256":"46f24f15281de6da1627b9955bd4ab5258458fea7bcfd347dbab3f3adde5c8d1","schema_version":"1.0","event_id":"sha256:46f24f15281de6da1627b9955bd4ab5258458fea7bcfd347dbab3f3adde5c8d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO/bundle.json","state_url":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7BUZCBZNLU2F6AXONSBTUJFPO/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-29T21:12:37Z","links":{"resolver":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO","bundle":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO/bundle.json","state":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7BUZCBZNLU2F6AXONSBTUJFPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:L7BUZCBZNLU2F6AXONSBTUJFPO","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":"e7dcc08650b32a730bea1a9baa73ba2c46aac8c50b0bbf6d0defde87316724d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-20T22:10:47Z","title_canon_sha256":"4895675b4822ca7edd21a633485913039bc177bb39fc075c7ec0ec08b892d6df"},"schema_version":"1.0","source":{"id":"1905.08364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08364","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08364v1","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08364","created_at":"2026-05-17T23:45:43Z"},{"alias_kind":"pith_short_12","alias_value":"L7BUZCBZNLU2","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L7BUZCBZNLU2F6AX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L7BUZCBZ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:46f24f15281de6da1627b9955bd4ab5258458fea7bcfd347dbab3f3adde5c8d1","target":"graph","created_at":"2026-05-17T23:45:43Z","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 consider the problem of synthesizing a program given a probabilistic specification of its desired behavior. Specifically, we study the recent paradigm of distribution-guided inductive synthesis (DIGITS), which iteratively calls a synthesizer on finite sample sets from a given distribution. We make theoretical and algorithmic contributions: (i) We prove the surprising result that DIGITS only requires a polynomial number of synthesizer calls in the size of the sample set, despite its ostensibly exponential behavior. (ii) We present a property-directed version of DIGITS that further reduces th","authors_text":"Aws Albarghouthi, Loris D'Antoni, Samuel Drews","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-20T22:10:47Z","title":"Efficient Synthesis with Probabilistic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08364","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:bcdc8329e623a7369f3040ac9bfce86fb838d16917e7f92ecfd11b554efb614b","target":"record","created_at":"2026-05-17T23:45:43Z","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":"e7dcc08650b32a730bea1a9baa73ba2c46aac8c50b0bbf6d0defde87316724d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-20T22:10:47Z","title_canon_sha256":"4895675b4822ca7edd21a633485913039bc177bb39fc075c7ec0ec08b892d6df"},"schema_version":"1.0","source":{"id":"1905.08364","kind":"arxiv","version":1}},"canonical_sha256":"5fc34c88396ae9a2f817736419d1257b9a81f39ea3fa9fc52d0d02cb26baa2f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fc34c88396ae9a2f817736419d1257b9a81f39ea3fa9fc52d0d02cb26baa2f5","first_computed_at":"2026-05-17T23:45:43.491491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:43.491491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2rLr2IMyHZxKNrk7+hljRMpDcWF/cAxc9m0XLb6Dwx7ixs1UEsfWH+s1si+J5HQdF+vFuEF3+jJy5bnqpvjaBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:43.492100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcdc8329e623a7369f3040ac9bfce86fb838d16917e7f92ecfd11b554efb614b","sha256:46f24f15281de6da1627b9955bd4ab5258458fea7bcfd347dbab3f3adde5c8d1"],"state_sha256":"b3f10827f1c030abecf199b67e8fa7be09af231e0dae628655648a191a4c2008"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fieHYjqcK/67il1Nydws8DWYjndn9uJqnsK025XhGuNqFQqBFE7Hx7y2YC9IeZdzwn9L7vGn+095Y+pIJRxtBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:12:37.466885Z","bundle_sha256":"abd4b25af8f26e1abc8da1c896d95391134b39871993e2b91fad0ef7667d4c83"}}