{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MDUCTYK2V3PFVO4LHXVNRMBPHB","short_pith_number":"pith:MDUCTYK2","schema_version":"1.0","canonical_sha256":"60e829e15aaede5abb8b3dead8b02f384f53ac28bc04d4924f3d82e506306396","source":{"kind":"arxiv","id":"1309.6815","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for Exact Model Counting and Applications in Probabilistic Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Jerry Li, Paul Beame, Sudeepa Roy","submitted_at":"2013-09-26T12:29:56Z","abstract_excerpt":"The best current methods for exactly computing the number of satisfying assignments, or the satisfying probability, of Boolean formulas can be seen, either directly or indirectly, as building 'decision-DNNF' (decision decomposable negation normal form) representations of the input Boolean formulas. Decision-DNNFs are a special case of 'd-DNNF's where 'd' stands for 'deterministic'. We show that any decision-DNNF can be converted into an equivalent 'FBDD' (free binary decision diagram) -- also known as a 'read-once branching program' (ROBP or 1-BP) -- with only a quasipolynomial increase in rep"},"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":"1309.6815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-09-26T12:29:56Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"2fc04a5b846aa232c9241f011236233a7ae19d37b1726fc6cf3b967af14f3946","abstract_canon_sha256":"f6b2e3a2fe547585217af0b873231e6f5d8c6c4ed99f924c186dbe46daf99842"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.403004Z","signature_b64":"lTVJ1gJCtBfX62O4dX218ZyonltiOXbDZWYmbhUNN2y/qw1HHFDYFPDu82x9aEm8mzz9GAT/v1vM7c+7y+IXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60e829e15aaede5abb8b3dead8b02f384f53ac28bc04d4924f3d82e506306396","last_reissued_at":"2026-05-18T03:12:10.402236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.402236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Exact Model Counting and Applications in Probabilistic Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Jerry Li, Paul Beame, Sudeepa Roy","submitted_at":"2013-09-26T12:29:56Z","abstract_excerpt":"The best current methods for exactly computing the number of satisfying assignments, or the satisfying probability, of Boolean formulas can be seen, either directly or indirectly, as building 'decision-DNNF' (decision decomposable negation normal form) representations of the input Boolean formulas. Decision-DNNFs are a special case of 'd-DNNF's where 'd' stands for 'deterministic'. We show that any decision-DNNF can be converted into an equivalent 'FBDD' (free binary decision diagram) -- also known as a 'read-once branching program' (ROBP or 1-BP) -- with only a quasipolynomial increase in rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6815","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":"1309.6815","created_at":"2026-05-18T03:12:10.402370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6815v1","created_at":"2026-05-18T03:12:10.402370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6815","created_at":"2026-05-18T03:12:10.402370+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDUCTYK2V3PF","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDUCTYK2V3PFVO4L","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDUCTYK2","created_at":"2026-05-18T12:27:52.871228+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/MDUCTYK2V3PFVO4LHXVNRMBPHB","json":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB.json","graph_json":"https://pith.science/api/pith-number/MDUCTYK2V3PFVO4LHXVNRMBPHB/graph.json","events_json":"https://pith.science/api/pith-number/MDUCTYK2V3PFVO4LHXVNRMBPHB/events.json","paper":"https://pith.science/paper/MDUCTYK2"},"agent_actions":{"view_html":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB","download_json":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB.json","view_paper":"https://pith.science/paper/MDUCTYK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6815&json=true","fetch_graph":"https://pith.science/api/pith-number/MDUCTYK2V3PFVO4LHXVNRMBPHB/graph.json","fetch_events":"https://pith.science/api/pith-number/MDUCTYK2V3PFVO4LHXVNRMBPHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB/action/storage_attestation","attest_author":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB/action/author_attestation","sign_citation":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB/action/citation_signature","submit_replication":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB/action/replication_record"}},"created_at":"2026-05-18T03:12:10.402370+00:00","updated_at":"2026-05-18T03:12:10.402370+00:00"}