{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L7BUZCBZNLU2F6AXONSBTUJFPO","short_pith_number":"pith:L7BUZCBZ","schema_version":"1.0","canonical_sha256":"5fc34c88396ae9a2f817736419d1257b9a81f39ea3fa9fc52d0d02cb26baa2f5","source":{"kind":"arxiv","id":"1905.08364","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.08364","created_at":"2026-05-17T23:45:43.491591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08364v1","created_at":"2026-05-17T23:45:43.491591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08364","created_at":"2026-05-17T23:45:43.491591+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7BUZCBZNLU2","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7BUZCBZNLU2F6AX","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7BUZCBZ","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO","json":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO.json","graph_json":"https://pith.science/api/pith-number/L7BUZCBZNLU2F6AXONSBTUJFPO/graph.json","events_json":"https://pith.science/api/pith-number/L7BUZCBZNLU2F6AXONSBTUJFPO/events.json","paper":"https://pith.science/paper/L7BUZCBZ"},"agent_actions":{"view_html":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO","download_json":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO.json","view_paper":"https://pith.science/paper/L7BUZCBZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08364&json=true","fetch_graph":"https://pith.science/api/pith-number/L7BUZCBZNLU2F6AXONSBTUJFPO/graph.json","fetch_events":"https://pith.science/api/pith-number/L7BUZCBZNLU2F6AXONSBTUJFPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO/action/storage_attestation","attest_author":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO/action/author_attestation","sign_citation":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO/action/citation_signature","submit_replication":"https://pith.science/pith/L7BUZCBZNLU2F6AXONSBTUJFPO/action/replication_record"}},"created_at":"2026-05-17T23:45:43.491591+00:00","updated_at":"2026-05-17T23:45:43.491591+00:00"}