{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BKK3YHXY2CQERSLV4MZXRQ3Y6Q","short_pith_number":"pith:BKK3YHXY","canonical_record":{"source":{"id":"1512.06633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-12-21T14:10:10Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"af9d75a31f0a0333cf2a04d8e5e397c52eeb8bb5331aa66db4c4906584658e0a","abstract_canon_sha256":"c62c12ae0c2ec75eed72556a3f287ff5fa1465fadc9402bca68737fb192f7db7"},"schema_version":"1.0"},"canonical_sha256":"0a95bc1ef8d0a048c975e33378c378f41e6dcdcc172b0579476fe155d0aa1d10","source":{"kind":"arxiv","id":"1512.06633","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06633","created_at":"2026-05-18T01:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06633v1","created_at":"2026-05-18T01:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06633","created_at":"2026-05-18T01:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"BKK3YHXY2CQE","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BKK3YHXY2CQERSLV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BKK3YHXY","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BKK3YHXY2CQERSLV4MZXRQ3Y6Q","target":"record","payload":{"canonical_record":{"source":{"id":"1512.06633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-12-21T14:10:10Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"af9d75a31f0a0333cf2a04d8e5e397c52eeb8bb5331aa66db4c4906584658e0a","abstract_canon_sha256":"c62c12ae0c2ec75eed72556a3f287ff5fa1465fadc9402bca68737fb192f7db7"},"schema_version":"1.0"},"canonical_sha256":"0a95bc1ef8d0a048c975e33378c378f41e6dcdcc172b0579476fe155d0aa1d10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:59.996291Z","signature_b64":"/PK0gamaljzeCeDgHJMqrXDFFfkj4m7J0L1fDVerAhU5V/Ha9BbB1JuN+b5aROzlmn5ecmhInMl7fHy3358rCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a95bc1ef8d0a048c975e33378c378f41e6dcdcc172b0579476fe155d0aa1d10","last_reissued_at":"2026-05-18T01:23:59.995569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:59.995569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.06633","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-18T01:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fg5EitQpKgC8/DClIiUe6KoQOH8A2RNZXaq0YYWX6qRDmDWgzJc1nUB++OMEQBaJdcQUKI0lk0LKC+sZA8MKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:42:49.498489Z"},"content_sha256":"3fb36aaee7b90ccacff09b6ec472193ed84698c39e06d1b95c4b3e5007f3cf29","schema_version":"1.0","event_id":"sha256:3fb36aaee7b90ccacff09b6ec472193ed84698c39e06d1b95c4b3e5007f3cf29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BKK3YHXY2CQERSLV4MZXRQ3Y6Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Sampling and Counting: Universal Hashing Meets SAT Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Alexander Ivrii, Daniel J. Fremont, Dror Fried, Kuldeep S. Meel, Moshe Vardi, Sanjit A. Seshia, Sharad Malik, Supratik Chakraborty","submitted_at":"2015-12-21T14:10:10Z","abstract_excerpt":"Constrained sampling and counting are two fundamental problems in artificial intelligence with a diverse range of applications, spanning probabilistic reasoning and planning to constrained-random verification. While the theory of these problems was thoroughly investigated in the 1980s, prior work either did not scale to industrial size instances or gave up correctness guarantees to achieve scalability. Recently, we proposed a novel approach that combines universal hashing and SAT solving and scales to formulas with hundreds of thousands of variables without giving up correctness guarantees. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06633","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-18T01:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6dAlipb7XfnIApWCsVu0Vft700vG13XqwuXSoTX9zUTiQDtq3027+cU09ovDt8uC26ZT9t+/OJQnzrvpDylDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:42:49.499175Z"},"content_sha256":"88f636c28966d02ba511f5a6a63e6fa6547e5ed3367b690b86f3feaba528e309","schema_version":"1.0","event_id":"sha256:88f636c28966d02ba511f5a6a63e6fa6547e5ed3367b690b86f3feaba528e309"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BKK3YHXY2CQERSLV4MZXRQ3Y6Q/bundle.json","state_url":"https://pith.science/pith/BKK3YHXY2CQERSLV4MZXRQ3Y6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BKK3YHXY2CQERSLV4MZXRQ3Y6Q/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-06-06T08:42:49Z","links":{"resolver":"https://pith.science/pith/BKK3YHXY2CQERSLV4MZXRQ3Y6Q","bundle":"https://pith.science/pith/BKK3YHXY2CQERSLV4MZXRQ3Y6Q/bundle.json","state":"https://pith.science/pith/BKK3YHXY2CQERSLV4MZXRQ3Y6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BKK3YHXY2CQERSLV4MZXRQ3Y6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BKK3YHXY2CQERSLV4MZXRQ3Y6Q","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":"c62c12ae0c2ec75eed72556a3f287ff5fa1465fadc9402bca68737fb192f7db7","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-12-21T14:10:10Z","title_canon_sha256":"af9d75a31f0a0333cf2a04d8e5e397c52eeb8bb5331aa66db4c4906584658e0a"},"schema_version":"1.0","source":{"id":"1512.06633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06633","created_at":"2026-05-18T01:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06633v1","created_at":"2026-05-18T01:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06633","created_at":"2026-05-18T01:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"BKK3YHXY2CQE","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BKK3YHXY2CQERSLV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BKK3YHXY","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:88f636c28966d02ba511f5a6a63e6fa6547e5ed3367b690b86f3feaba528e309","target":"graph","created_at":"2026-05-18T01:23:59Z","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":"Constrained sampling and counting are two fundamental problems in artificial intelligence with a diverse range of applications, spanning probabilistic reasoning and planning to constrained-random verification. While the theory of these problems was thoroughly investigated in the 1980s, prior work either did not scale to industrial size instances or gave up correctness guarantees to achieve scalability. Recently, we proposed a novel approach that combines universal hashing and SAT solving and scales to formulas with hundreds of thousands of variables without giving up correctness guarantees. Th","authors_text":"Alexander Ivrii, Daniel J. Fremont, Dror Fried, Kuldeep S. Meel, Moshe Vardi, Sanjit A. Seshia, Sharad Malik, Supratik Chakraborty","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-12-21T14:10:10Z","title":"Constrained Sampling and Counting: Universal Hashing Meets SAT Solving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06633","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:3fb36aaee7b90ccacff09b6ec472193ed84698c39e06d1b95c4b3e5007f3cf29","target":"record","created_at":"2026-05-18T01:23:59Z","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":"c62c12ae0c2ec75eed72556a3f287ff5fa1465fadc9402bca68737fb192f7db7","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-12-21T14:10:10Z","title_canon_sha256":"af9d75a31f0a0333cf2a04d8e5e397c52eeb8bb5331aa66db4c4906584658e0a"},"schema_version":"1.0","source":{"id":"1512.06633","kind":"arxiv","version":1}},"canonical_sha256":"0a95bc1ef8d0a048c975e33378c378f41e6dcdcc172b0579476fe155d0aa1d10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a95bc1ef8d0a048c975e33378c378f41e6dcdcc172b0579476fe155d0aa1d10","first_computed_at":"2026-05-18T01:23:59.995569Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:59.995569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/PK0gamaljzeCeDgHJMqrXDFFfkj4m7J0L1fDVerAhU5V/Ha9BbB1JuN+b5aROzlmn5ecmhInMl7fHy3358rCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:59.996291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fb36aaee7b90ccacff09b6ec472193ed84698c39e06d1b95c4b3e5007f3cf29","sha256:88f636c28966d02ba511f5a6a63e6fa6547e5ed3367b690b86f3feaba528e309"],"state_sha256":"f0a743111ca8ebd80e461b4b61cf1acdf4be0f4b4a34d14c39a3920d417040ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ejZ92Oi7u/EjpYI9k4twX158bQinxBUDRVFb6Ny5YoL69jdJWlIKjgzMaVZDvJrZh7+9Yu3dSGqLKyAmYu+JDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:42:49.503227Z","bundle_sha256":"f55e2bc54214fff0e957d8018e00a233eddef768bb9cd27258a7e634a7e55b79"}}