{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Q7FC3DACJYXJLFLQYUJNP65RTO","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":"f622402fc95c19744a6ca869c20b0fb5bfb74cfc7a89440be0aacfcb492c703a","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-03T20:59:19Z","title_canon_sha256":"4cc27f1cfcba5c23599f0efb378783b1b662f3883c8174ecbfac35916335d1bb"},"schema_version":"1.0","source":{"id":"1411.0659","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0659","created_at":"2026-05-18T01:28:34Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0659v2","created_at":"2026-05-18T01:28:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0659","created_at":"2026-05-18T01:28:34Z"},{"alias_kind":"pith_short_12","alias_value":"Q7FC3DACJYXJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q7FC3DACJYXJLFLQ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q7FC3DAC","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:a67ba8fccf5eb3e2d160b3f66bdbaef17f4bd332240125e21c20bcfaf9d7062f","target":"graph","created_at":"2026-05-18T01:28:34Z","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":"#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","authors_text":"Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-03T20:59:19Z","title":"Approximate Counting in SMT and Value Estimation for Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0659","kind":"arxiv","version":2},"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:80c100c08f4fed1e715e62620597ac932867bc99d7430b0bd8691b5f65754d1d","target":"record","created_at":"2026-05-18T01:28:34Z","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":"f622402fc95c19744a6ca869c20b0fb5bfb74cfc7a89440be0aacfcb492c703a","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-03T20:59:19Z","title_canon_sha256":"4cc27f1cfcba5c23599f0efb378783b1b662f3883c8174ecbfac35916335d1bb"},"schema_version":"1.0","source":{"id":"1411.0659","kind":"arxiv","version":2}},"canonical_sha256":"87ca2d8c024e2e959570c512d7fbb19ba85e5eca73306a86cba98c6109f6d96d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87ca2d8c024e2e959570c512d7fbb19ba85e5eca73306a86cba98c6109f6d96d","first_computed_at":"2026-05-18T01:28:34.689961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:34.689961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ex9T00VOnxOOwbubqk/pYUYq2v35Sgiz+Px804MJk6fKhvkFc3wK00kxU33egwpOov0WNlJfw87WOxFCWUILDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:34.690430Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0659","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80c100c08f4fed1e715e62620597ac932867bc99d7430b0bd8691b5f65754d1d","sha256:a67ba8fccf5eb3e2d160b3f66bdbaef17f4bd332240125e21c20bcfaf9d7062f"],"state_sha256":"5cfc22957ee541e2b213771ee2d3525291a816c1235b742e6af173297f453170"}