{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HVYENIBVEM7WYQIHUOKFSJ2Z27","short_pith_number":"pith:HVYENIBV","canonical_record":{"source":{"id":"1706.03906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-13T05:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"a523f71311b9e86abf3f319ef938c5456b6c3cf67e88a44f300e17dc3dd11a09","abstract_canon_sha256":"5f4e451e1a8cbfdb95f110151c0b057de4441398776074ffaaf300c4fbb89b72"},"schema_version":"1.0"},"canonical_sha256":"3d7046a035233f6c4107a394592759d7e0feee53c5915545062f2bfebeb3d6af","source":{"kind":"arxiv","id":"1706.03906","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03906","created_at":"2026-05-18T00:42:28Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03906v1","created_at":"2026-05-18T00:42:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03906","created_at":"2026-05-18T00:42:28Z"},{"alias_kind":"pith_short_12","alias_value":"HVYENIBVEM7W","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HVYENIBVEM7WYQIH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HVYENIBV","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HVYENIBVEM7WYQIHUOKFSJ2Z27","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-13T05:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"a523f71311b9e86abf3f319ef938c5456b6c3cf67e88a44f300e17dc3dd11a09","abstract_canon_sha256":"5f4e451e1a8cbfdb95f110151c0b057de4441398776074ffaaf300c4fbb89b72"},"schema_version":"1.0"},"canonical_sha256":"3d7046a035233f6c4107a394592759d7e0feee53c5915545062f2bfebeb3d6af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:28.041493Z","signature_b64":"HHMhE8fjSgxkbIU3jCgfxEnBNHoK1VHHO0nSVdf0PVWZCLlc3db+ecOqIPIoy7sKOfsGZ2if89s/uJqaXXflAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d7046a035233f6c4107a394592759d7e0feee53c5915545062f2bfebeb3d6af","last_reissued_at":"2026-05-18T00:42:28.040911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:28.040911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03906","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:42:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2BZXOurQ6LzY5fL3xRwqj+VZ3pTYv67gEb0S8cGd2McKcSuaBV7mrV9P35xOA3tHymziauIdfLFW+7yn7VMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:50:45.208281Z"},"content_sha256":"0ddcc0cc761a8fae43e93d8e0ebb23babfb76fa8fd7b9bd5815aa54b13005d05","schema_version":"1.0","event_id":"sha256:0ddcc0cc761a8fae43e93d8e0ebb23babfb76fa8fd7b9bd5815aa54b13005d05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HVYENIBVEM7WYQIHUOKFSJ2Z27","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Probabilistic Algorithm for Approximate Model Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Cunjing Ge, Feifei Ma, Jian Zhang, Tian Liu","submitted_at":"2017-06-13T05:26:02Z","abstract_excerpt":"Constrained counting is important in domains ranging from artificial intelligence to software analysis. There are already a few approaches for counting models over various types of constraints. Recently, hashing-based approaches achieve both theoretical guarantees and scalability, but still rely on solution enumeration. In this paper, a new probabilistic polynomial time approximate model counter is proposed, which is also a hashing-based universal framework, but with only satisfiability queries. A variant with a dynamic stopping criterion is also presented. Empirical evaluation over benchmarks"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03906","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:42:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMIr64EkuwxP5ZJkUl5PC95FrrZmFZrZBAurAluhG57JFwL2r8XtS3FnyVAWgYScXCIzHEgdi0/eq1LawjPcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:50:45.208932Z"},"content_sha256":"d4d0233bc512afb32ff353805865eae682a39f6b0f179af13c16197dbdfed31f","schema_version":"1.0","event_id":"sha256:d4d0233bc512afb32ff353805865eae682a39f6b0f179af13c16197dbdfed31f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27/bundle.json","state_url":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27/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-31T11:50:45Z","links":{"resolver":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27","bundle":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27/bundle.json","state":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HVYENIBVEM7WYQIHUOKFSJ2Z27","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":"5f4e451e1a8cbfdb95f110151c0b057de4441398776074ffaaf300c4fbb89b72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-13T05:26:02Z","title_canon_sha256":"a523f71311b9e86abf3f319ef938c5456b6c3cf67e88a44f300e17dc3dd11a09"},"schema_version":"1.0","source":{"id":"1706.03906","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03906","created_at":"2026-05-18T00:42:28Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03906v1","created_at":"2026-05-18T00:42:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03906","created_at":"2026-05-18T00:42:28Z"},{"alias_kind":"pith_short_12","alias_value":"HVYENIBVEM7W","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HVYENIBVEM7WYQIH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HVYENIBV","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:d4d0233bc512afb32ff353805865eae682a39f6b0f179af13c16197dbdfed31f","target":"graph","created_at":"2026-05-18T00:42:28Z","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 is important in domains ranging from artificial intelligence to software analysis. There are already a few approaches for counting models over various types of constraints. Recently, hashing-based approaches achieve both theoretical guarantees and scalability, but still rely on solution enumeration. In this paper, a new probabilistic polynomial time approximate model counter is proposed, which is also a hashing-based universal framework, but with only satisfiability queries. A variant with a dynamic stopping criterion is also presented. Empirical evaluation over benchmarks","authors_text":"Cunjing Ge, Feifei Ma, Jian Zhang, Tian Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-13T05:26:02Z","title":"A New Probabilistic Algorithm for Approximate Model Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03906","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:0ddcc0cc761a8fae43e93d8e0ebb23babfb76fa8fd7b9bd5815aa54b13005d05","target":"record","created_at":"2026-05-18T00:42:28Z","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":"5f4e451e1a8cbfdb95f110151c0b057de4441398776074ffaaf300c4fbb89b72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-13T05:26:02Z","title_canon_sha256":"a523f71311b9e86abf3f319ef938c5456b6c3cf67e88a44f300e17dc3dd11a09"},"schema_version":"1.0","source":{"id":"1706.03906","kind":"arxiv","version":1}},"canonical_sha256":"3d7046a035233f6c4107a394592759d7e0feee53c5915545062f2bfebeb3d6af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d7046a035233f6c4107a394592759d7e0feee53c5915545062f2bfebeb3d6af","first_computed_at":"2026-05-18T00:42:28.040911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:28.040911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HHMhE8fjSgxkbIU3jCgfxEnBNHoK1VHHO0nSVdf0PVWZCLlc3db+ecOqIPIoy7sKOfsGZ2if89s/uJqaXXflAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:28.041493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03906","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ddcc0cc761a8fae43e93d8e0ebb23babfb76fa8fd7b9bd5815aa54b13005d05","sha256:d4d0233bc512afb32ff353805865eae682a39f6b0f179af13c16197dbdfed31f"],"state_sha256":"9d4cbf3d8d6593506950c8d7b7f55d61df3a9e0bb302b0d0917f3e7873917474"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tb32bi+oqvfS5s8WYW0HNXxeP1PsxNTslRDAZO6LuESHS1i8kHtdBzA3VYw9rjJtS7tsOLaSeS26+xVwUyVgBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:50:45.212531Z","bundle_sha256":"1f1f102554272a644295e661b323cd2fadd12306c8d106e6dbdc7ad69bf930d7"}}