{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PVL73UARRWCSSXRC4R552DG7M6","short_pith_number":"pith:PVL73UAR","canonical_record":{"source":{"id":"1806.02239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-06T15:16:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eaff3186986ac5764095d7b12031ab188b3f9f07e8b5f115d5f861005aef4711","abstract_canon_sha256":"502f5da29442e77a7ed7eeadeede364781f7fead78992593145e97a03ead792a"},"schema_version":"1.0"},"canonical_sha256":"7d57fdd0118d85295e22e47bdd0cdf679a165891f56d6548d707dd3cdf606116","source":{"kind":"arxiv","id":"1806.02239","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02239","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02239v1","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02239","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"PVL73UARRWCS","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PVL73UARRWCSSXRC","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PVL73UAR","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PVL73UARRWCSSXRC4R552DG7M6","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-06T15:16:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eaff3186986ac5764095d7b12031ab188b3f9f07e8b5f115d5f861005aef4711","abstract_canon_sha256":"502f5da29442e77a7ed7eeadeede364781f7fead78992593145e97a03ead792a"},"schema_version":"1.0"},"canonical_sha256":"7d57fdd0118d85295e22e47bdd0cdf679a165891f56d6548d707dd3cdf606116","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:02.163600Z","signature_b64":"C0D22zdouqwIork9OhWVWddiEElq8eD03N89stOAoKKFyhQliwyVZq03TPJmkPTYGDpHV8Ij83CHEgaN9fxzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d57fdd0118d85295e22e47bdd0cdf679a165891f56d6548d707dd3cdf606116","last_reissued_at":"2026-05-18T00:14:02.162839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:02.162839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02239","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-18T00:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZlAHs/BQWDhspR53eAnQ53enBDNJWXL32Mx/OVukJvGZtydWwiPk5XauJzoN++G+k0uoyjTmuFYlrrJZC49aDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T05:27:33.719555Z"},"content_sha256":"8efc9d80038618aed5f75fa378a38ec822e7b0f0d64c02ee333fd12b75f073a0","schema_version":"1.0","event_id":"sha256:8efc9d80038618aed5f75fa378a38ec822e7b0f0d64c02ee333fd12b75f073a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PVL73UARRWCSSXRC4R552DG7M6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Counting and Sampling: Bridging the Gap between Theory and Practice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Kuldeep S. Meel","submitted_at":"2018-06-06T15:16:32Z","abstract_excerpt":"Constrained counting and sampling are two fundamental problems in Computer Science with numerous applications, including network reliability, privacy, probabilistic reasoning, and constrained-random verification. In constrained counting, the task is to compute the total weight, subject to a given weighting function, of the set of solutions of the given constraints. In constrained sampling, the task is to sample randomly, subject to a given weighting function, from the set of solutions to a set of given constraints. Consequently, constrained counting and sampling have been subject to intense th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02239","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-18T00:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B70g9LASRuKQ+q7QvrGHVt3MpG4NCWC9+yi0+/GP23pe9vPz1UZH0ODyZqgV/D66cUjbhWQUKE1zT9m/HPQHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T05:27:33.720220Z"},"content_sha256":"4260c536379aa7012fd63b4200878354a39b8185f067ff868a70be72c75700ac","schema_version":"1.0","event_id":"sha256:4260c536379aa7012fd63b4200878354a39b8185f067ff868a70be72c75700ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVL73UARRWCSSXRC4R552DG7M6/bundle.json","state_url":"https://pith.science/pith/PVL73UARRWCSSXRC4R552DG7M6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVL73UARRWCSSXRC4R552DG7M6/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-24T05:27:33Z","links":{"resolver":"https://pith.science/pith/PVL73UARRWCSSXRC4R552DG7M6","bundle":"https://pith.science/pith/PVL73UARRWCSSXRC4R552DG7M6/bundle.json","state":"https://pith.science/pith/PVL73UARRWCSSXRC4R552DG7M6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVL73UARRWCSSXRC4R552DG7M6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PVL73UARRWCSSXRC4R552DG7M6","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":"502f5da29442e77a7ed7eeadeede364781f7fead78992593145e97a03ead792a","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-06T15:16:32Z","title_canon_sha256":"eaff3186986ac5764095d7b12031ab188b3f9f07e8b5f115d5f861005aef4711"},"schema_version":"1.0","source":{"id":"1806.02239","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02239","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02239v1","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02239","created_at":"2026-05-18T00:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"PVL73UARRWCS","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PVL73UARRWCSSXRC","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PVL73UAR","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:4260c536379aa7012fd63b4200878354a39b8185f067ff868a70be72c75700ac","target":"graph","created_at":"2026-05-18T00:14:02Z","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 counting and sampling are two fundamental problems in Computer Science with numerous applications, including network reliability, privacy, probabilistic reasoning, and constrained-random verification. In constrained counting, the task is to compute the total weight, subject to a given weighting function, of the set of solutions of the given constraints. In constrained sampling, the task is to sample randomly, subject to a given weighting function, from the set of solutions to a set of given constraints. Consequently, constrained counting and sampling have been subject to intense th","authors_text":"Kuldeep S. Meel","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-06T15:16:32Z","title":"Constrained Counting and Sampling: Bridging the Gap between Theory and Practice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02239","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:8efc9d80038618aed5f75fa378a38ec822e7b0f0d64c02ee333fd12b75f073a0","target":"record","created_at":"2026-05-18T00:14:02Z","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":"502f5da29442e77a7ed7eeadeede364781f7fead78992593145e97a03ead792a","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-06-06T15:16:32Z","title_canon_sha256":"eaff3186986ac5764095d7b12031ab188b3f9f07e8b5f115d5f861005aef4711"},"schema_version":"1.0","source":{"id":"1806.02239","kind":"arxiv","version":1}},"canonical_sha256":"7d57fdd0118d85295e22e47bdd0cdf679a165891f56d6548d707dd3cdf606116","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d57fdd0118d85295e22e47bdd0cdf679a165891f56d6548d707dd3cdf606116","first_computed_at":"2026-05-18T00:14:02.162839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:02.162839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C0D22zdouqwIork9OhWVWddiEElq8eD03N89stOAoKKFyhQliwyVZq03TPJmkPTYGDpHV8Ij83CHEgaN9fxzAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:02.163600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02239","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8efc9d80038618aed5f75fa378a38ec822e7b0f0d64c02ee333fd12b75f073a0","sha256:4260c536379aa7012fd63b4200878354a39b8185f067ff868a70be72c75700ac"],"state_sha256":"6e86d720b58da6c824d53e3af351085e2484546747d6775923bf0a23d34bbe4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EN86iPwPpcrPFEp++vm2wSq+6xZXWEuKE/Vn2yRKgFf5cS3xybcMGit9g1auX3SoyUehOz3lH85uu2Nn6Ml5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T05:27:33.723977Z","bundle_sha256":"94b30f0dd9ef6b3210ad119eb2a06e45f10d47c0c12e18ac7bce6507ea2a1c26"}}