{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MDUCTYK2V3PFVO4LHXVNRMBPHB","short_pith_number":"pith:MDUCTYK2","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"},"canonical_sha256":"60e829e15aaede5abb8b3dead8b02f384f53ac28bc04d4924f3d82e506306396","source":{"kind":"arxiv","id":"1309.6815","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6815","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6815v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6815","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"MDUCTYK2V3PF","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MDUCTYK2V3PFVO4L","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MDUCTYK2","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MDUCTYK2V3PFVO4LHXVNRMBPHB","target":"record","payload":{"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"},"canonical_sha256":"60e829e15aaede5abb8b3dead8b02f384f53ac28bc04d4924f3d82e506306396","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"},"source_kind":"arxiv","source_id":"1309.6815","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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPLNiE+UIOUCK8rUylM8eZuV7ASzaRjG85w9BU87ZgCS0j2PX2ZuV71YK5gJG2oOVHqgMQKY8F0B9511/+JfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:31:06.929148Z"},"content_sha256":"99a35399f46145208c3b587514b334757f223b92bf9c839145a1117fc01d7aee","schema_version":"1.0","event_id":"sha256:99a35399f46145208c3b587514b334757f223b92bf9c839145a1117fc01d7aee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MDUCTYK2V3PFVO4LHXVNRMBPHB","target":"graph","payload":{"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"},"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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+v/NQMIT6Kw3S/xxNSdXa3FiQFXMmR9mep8+s4GrNbPtvO3UmMG/P4JjosGPohOcRY8DGYDUis9KtkPZ+DwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:31:06.929840Z"},"content_sha256":"fd1165dbd87a65b6f8ced2a80b74de9f2ed556ed2b1a07991db2bc3ed9677e69","schema_version":"1.0","event_id":"sha256:fd1165dbd87a65b6f8ced2a80b74de9f2ed556ed2b1a07991db2bc3ed9677e69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB/bundle.json","state_url":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB/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-26T13:31:06Z","links":{"resolver":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB","bundle":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB/bundle.json","state":"https://pith.science/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDUCTYK2V3PFVO4LHXVNRMBPHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MDUCTYK2V3PFVO4LHXVNRMBPHB","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":"f6b2e3a2fe547585217af0b873231e6f5d8c6c4ed99f924c186dbe46daf99842","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-09-26T12:29:56Z","title_canon_sha256":"2fc04a5b846aa232c9241f011236233a7ae19d37b1726fc6cf3b967af14f3946"},"schema_version":"1.0","source":{"id":"1309.6815","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6815","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6815v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6815","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"MDUCTYK2V3PF","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MDUCTYK2V3PFVO4L","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MDUCTYK2","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:fd1165dbd87a65b6f8ced2a80b74de9f2ed556ed2b1a07991db2bc3ed9677e69","target":"graph","created_at":"2026-05-18T03:12:10Z","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":"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","authors_text":"Dan Suciu, Jerry Li, Paul Beame, Sudeepa Roy","cross_cats":["cs.AI","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-09-26T12:29:56Z","title":"Lower Bounds for Exact Model Counting and Applications in Probabilistic Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6815","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:99a35399f46145208c3b587514b334757f223b92bf9c839145a1117fc01d7aee","target":"record","created_at":"2026-05-18T03:12:10Z","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":"f6b2e3a2fe547585217af0b873231e6f5d8c6c4ed99f924c186dbe46daf99842","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-09-26T12:29:56Z","title_canon_sha256":"2fc04a5b846aa232c9241f011236233a7ae19d37b1726fc6cf3b967af14f3946"},"schema_version":"1.0","source":{"id":"1309.6815","kind":"arxiv","version":1}},"canonical_sha256":"60e829e15aaede5abb8b3dead8b02f384f53ac28bc04d4924f3d82e506306396","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60e829e15aaede5abb8b3dead8b02f384f53ac28bc04d4924f3d82e506306396","first_computed_at":"2026-05-18T03:12:10.402236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.402236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lTVJ1gJCtBfX62O4dX218ZyonltiOXbDZWYmbhUNN2y/qw1HHFDYFPDu82x9aEm8mzz9GAT/v1vM7c+7y+IXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.403004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6815","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99a35399f46145208c3b587514b334757f223b92bf9c839145a1117fc01d7aee","sha256:fd1165dbd87a65b6f8ced2a80b74de9f2ed556ed2b1a07991db2bc3ed9677e69"],"state_sha256":"ace5f1d5d12be16c1978d5a6d0b469ff8601b6889ec8a073f7677c501b18769b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ar+yAom30bTrbkMS+fdIld+Cw6YebKNdtIpZZ/9rgDsrhbMBo4crdKprasQGwtFLYsWUwg41btYKHKZrjhTrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:31:06.933490Z","bundle_sha256":"8ccdd271dbcb9695ffb5b1b173cee2fe962b9bde52e4dd175b0cff641644f495"}}