{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HVYENIBVEM7WYQIHUOKFSJ2Z27","short_pith_number":"pith:HVYENIBV","schema_version":"1.0","canonical_sha256":"3d7046a035233f6c4107a394592759d7e0feee53c5915545062f2bfebeb3d6af","source":{"kind":"arxiv","id":"1706.03906","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.03906","created_at":"2026-05-18T00:42:28.040996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03906v1","created_at":"2026-05-18T00:42:28.040996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03906","created_at":"2026-05-18T00:42:28.040996+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVYENIBVEM7W","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVYENIBVEM7WYQIH","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVYENIBV","created_at":"2026-05-18T12:31:21.493067+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/HVYENIBVEM7WYQIHUOKFSJ2Z27","json":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27.json","graph_json":"https://pith.science/api/pith-number/HVYENIBVEM7WYQIHUOKFSJ2Z27/graph.json","events_json":"https://pith.science/api/pith-number/HVYENIBVEM7WYQIHUOKFSJ2Z27/events.json","paper":"https://pith.science/paper/HVYENIBV"},"agent_actions":{"view_html":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27","download_json":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27.json","view_paper":"https://pith.science/paper/HVYENIBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03906&json=true","fetch_graph":"https://pith.science/api/pith-number/HVYENIBVEM7WYQIHUOKFSJ2Z27/graph.json","fetch_events":"https://pith.science/api/pith-number/HVYENIBVEM7WYQIHUOKFSJ2Z27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27/action/storage_attestation","attest_author":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27/action/author_attestation","sign_citation":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27/action/citation_signature","submit_replication":"https://pith.science/pith/HVYENIBVEM7WYQIHUOKFSJ2Z27/action/replication_record"}},"created_at":"2026-05-18T00:42:28.040996+00:00","updated_at":"2026-05-18T00:42:28.040996+00:00"}