{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Q7FC3DACJYXJLFLQYUJNP65RTO","short_pith_number":"pith:Q7FC3DAC","schema_version":"1.0","canonical_sha256":"87ca2d8c024e2e959570c512d7fbb19ba85e5eca73306a86cba98c6109f6d96d","source":{"kind":"arxiv","id":"1411.0659","version":2},"attestation_state":"computed","paper":{"title":"Approximate Counting in SMT and Value Estimation for Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar","submitted_at":"2014-11-03T20:59:19Z","abstract_excerpt":"#SMT, or model counting for logical theories, is a well-known hard problem that generalizes such tasks as counting the number of satisfying assignments to a Boolean formula and computing the volume of a polytope. In the realm of satisfiability modulo theories (SMT) there is a growing need for model counting solvers, coming from several application domains (quantitative information flow, static analysis of probabilistic programs). In this paper, we show a reduction from an approximate version of #SMT to SMT.\n  We focus on the theories of integer arithmetic and linear real arithmetic. We propose"},"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":"1411.0659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-03T20:59:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4cc27f1cfcba5c23599f0efb378783b1b662f3883c8174ecbfac35916335d1bb","abstract_canon_sha256":"f622402fc95c19744a6ca869c20b0fb5bfb74cfc7a89440be0aacfcb492c703a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:34.690430Z","signature_b64":"ex9T00VOnxOOwbubqk/pYUYq2v35Sgiz+Px804MJk6fKhvkFc3wK00kxU33egwpOov0WNlJfw87WOxFCWUILDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87ca2d8c024e2e959570c512d7fbb19ba85e5eca73306a86cba98c6109f6d96d","last_reissued_at":"2026-05-18T01:28:34.689961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:34.689961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Counting in SMT and Value Estimation for Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar","submitted_at":"2014-11-03T20:59:19Z","abstract_excerpt":"#SMT, or model counting for logical theories, is a well-known hard problem that generalizes such tasks as counting the number of satisfying assignments to a Boolean formula and computing the volume of a polytope. In the realm of satisfiability modulo theories (SMT) there is a growing need for model counting solvers, coming from several application domains (quantitative information flow, static analysis of probabilistic programs). In this paper, we show a reduction from an approximate version of #SMT to SMT.\n  We focus on the theories of integer arithmetic and linear real arithmetic. We propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0659","kind":"arxiv","version":2},"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":"1411.0659","created_at":"2026-05-18T01:28:34.690027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0659v2","created_at":"2026-05-18T01:28:34.690027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0659","created_at":"2026-05-18T01:28:34.690027+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7FC3DACJYXJ","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7FC3DACJYXJLFLQ","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7FC3DAC","created_at":"2026-05-18T12:28:43.426989+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/Q7FC3DACJYXJLFLQYUJNP65RTO","json":"https://pith.science/pith/Q7FC3DACJYXJLFLQYUJNP65RTO.json","graph_json":"https://pith.science/api/pith-number/Q7FC3DACJYXJLFLQYUJNP65RTO/graph.json","events_json":"https://pith.science/api/pith-number/Q7FC3DACJYXJLFLQYUJNP65RTO/events.json","paper":"https://pith.science/paper/Q7FC3DAC"},"agent_actions":{"view_html":"https://pith.science/pith/Q7FC3DACJYXJLFLQYUJNP65RTO","download_json":"https://pith.science/pith/Q7FC3DACJYXJLFLQYUJNP65RTO.json","view_paper":"https://pith.science/paper/Q7FC3DAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0659&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7FC3DACJYXJLFLQYUJNP65RTO/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7FC3DACJYXJLFLQYUJNP65RTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7FC3DACJYXJLFLQYUJNP65RTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7FC3DACJYXJLFLQYUJNP65RTO/action/storage_attestation","attest_author":"https://pith.science/pith/Q7FC3DACJYXJLFLQYUJNP65RTO/action/author_attestation","sign_citation":"https://pith.science/pith/Q7FC3DACJYXJLFLQYUJNP65RTO/action/citation_signature","submit_replication":"https://pith.science/pith/Q7FC3DACJYXJLFLQYUJNP65RTO/action/replication_record"}},"created_at":"2026-05-18T01:28:34.690027+00:00","updated_at":"2026-05-18T01:28:34.690027+00:00"}