{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AR6Q5PQEL4BIXHJOVKO2NAQCZ4","short_pith_number":"pith:AR6Q5PQE","canonical_record":{"source":{"id":"1805.07180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-18T12:51:48Z","cross_cats_sorted":[],"title_canon_sha256":"a80692962d65beb7c9813a967da823daf02a22b0610c3727080749ee0713373f","abstract_canon_sha256":"d7b3fc357fd52d1f2059e91a6927056f87dabb5f740ec8dc1eec61aef3a36437"},"schema_version":"1.0"},"canonical_sha256":"047d0ebe045f028b9d2eaa9da68202cf366b49915b8773e17eb4b9168e8b026d","source":{"kind":"arxiv","id":"1805.07180","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07180","created_at":"2026-05-18T00:15:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07180v1","created_at":"2026-05-18T00:15:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07180","created_at":"2026-05-18T00:15:39Z"},{"alias_kind":"pith_short_12","alias_value":"AR6Q5PQEL4BI","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AR6Q5PQEL4BIXHJO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AR6Q5PQE","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AR6Q5PQEL4BIXHJOVKO2NAQCZ4","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-18T12:51:48Z","cross_cats_sorted":[],"title_canon_sha256":"a80692962d65beb7c9813a967da823daf02a22b0610c3727080749ee0713373f","abstract_canon_sha256":"d7b3fc357fd52d1f2059e91a6927056f87dabb5f740ec8dc1eec61aef3a36437"},"schema_version":"1.0"},"canonical_sha256":"047d0ebe045f028b9d2eaa9da68202cf366b49915b8773e17eb4b9168e8b026d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:39.009332Z","signature_b64":"NvtEmNyDVrLwLG09SYGnbY+pp4y/lPsDI8mGN3DZtA7kFGUxW0OZHoOh6V4Xy4+W3Xu0UsxJsVIx+Msx5U1nAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"047d0ebe045f028b9d2eaa9da68202cf366b49915b8773e17eb4b9168e8b026d","last_reissued_at":"2026-05-18T00:15:39.008849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:39.008849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07180","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-18T00:15:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rt+FGfauAly6pwfd+oAo6o8gvyRCC1AeCBTCMf1WKFyTGr/K40zW9cZt/4ITB8GQIEn33036rvuWQKJFfJptBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:28:54.243668Z"},"content_sha256":"1591216d33e9469aaded3433889619ef1ea2c78861f8e06cceefb30df682b787","schema_version":"1.0","event_id":"sha256:1591216d33e9469aaded3433889619ef1ea2c78861f8e06cceefb30df682b787"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AR6Q5PQEL4BIXHJOVKO2NAQCZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Model Counting by Partial Knowledge Compilation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Yong Lai","submitted_at":"2018-05-18T12:51:48Z","abstract_excerpt":"Model counting is the problem of computing the number of satisfying assignments of a given propositional formula. Although exact model counters can be naturally furnished by most of the knowledge compilation (KC) methods, in practice, they fail to generate the compiled results for the exact counting of models for certain formulas due to the explosion in sizes. Decision-DNNF is an important KC language that captures most of the practical compilers. We propose a generalized Decision-DNNF (referred to as partial Decision-DNNF) via introducing a class of new leaf vertices (called unknown vertices)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07180","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-18T00:15:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OlesOhskAarGWrE1zOvYjc7eGyPySqVGJG9Hn6rHxbLIYQ9ZUH7sFlDv6lTm+9k+Rpcjz5clK9eDSI7qDjzFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:28:54.244384Z"},"content_sha256":"e345ccc8d28515093cd44aa4c36a368df2ca667891699c57fecc2337fc0162f5","schema_version":"1.0","event_id":"sha256:e345ccc8d28515093cd44aa4c36a368df2ca667891699c57fecc2337fc0162f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AR6Q5PQEL4BIXHJOVKO2NAQCZ4/bundle.json","state_url":"https://pith.science/pith/AR6Q5PQEL4BIXHJOVKO2NAQCZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AR6Q5PQEL4BIXHJOVKO2NAQCZ4/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-06-10T21:28:54Z","links":{"resolver":"https://pith.science/pith/AR6Q5PQEL4BIXHJOVKO2NAQCZ4","bundle":"https://pith.science/pith/AR6Q5PQEL4BIXHJOVKO2NAQCZ4/bundle.json","state":"https://pith.science/pith/AR6Q5PQEL4BIXHJOVKO2NAQCZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AR6Q5PQEL4BIXHJOVKO2NAQCZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AR6Q5PQEL4BIXHJOVKO2NAQCZ4","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":"d7b3fc357fd52d1f2059e91a6927056f87dabb5f740ec8dc1eec61aef3a36437","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-18T12:51:48Z","title_canon_sha256":"a80692962d65beb7c9813a967da823daf02a22b0610c3727080749ee0713373f"},"schema_version":"1.0","source":{"id":"1805.07180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07180","created_at":"2026-05-18T00:15:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07180v1","created_at":"2026-05-18T00:15:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07180","created_at":"2026-05-18T00:15:39Z"},{"alias_kind":"pith_short_12","alias_value":"AR6Q5PQEL4BI","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AR6Q5PQEL4BIXHJO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AR6Q5PQE","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:e345ccc8d28515093cd44aa4c36a368df2ca667891699c57fecc2337fc0162f5","target":"graph","created_at":"2026-05-18T00:15:39Z","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":"Model counting is the problem of computing the number of satisfying assignments of a given propositional formula. Although exact model counters can be naturally furnished by most of the knowledge compilation (KC) methods, in practice, they fail to generate the compiled results for the exact counting of models for certain formulas due to the explosion in sizes. Decision-DNNF is an important KC language that captures most of the practical compilers. We propose a generalized Decision-DNNF (referred to as partial Decision-DNNF) via introducing a class of new leaf vertices (called unknown vertices)","authors_text":"Yong Lai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-18T12:51:48Z","title":"Approximate Model Counting by Partial Knowledge Compilation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07180","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:1591216d33e9469aaded3433889619ef1ea2c78861f8e06cceefb30df682b787","target":"record","created_at":"2026-05-18T00:15:39Z","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":"d7b3fc357fd52d1f2059e91a6927056f87dabb5f740ec8dc1eec61aef3a36437","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-18T12:51:48Z","title_canon_sha256":"a80692962d65beb7c9813a967da823daf02a22b0610c3727080749ee0713373f"},"schema_version":"1.0","source":{"id":"1805.07180","kind":"arxiv","version":1}},"canonical_sha256":"047d0ebe045f028b9d2eaa9da68202cf366b49915b8773e17eb4b9168e8b026d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"047d0ebe045f028b9d2eaa9da68202cf366b49915b8773e17eb4b9168e8b026d","first_computed_at":"2026-05-18T00:15:39.008849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:39.008849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NvtEmNyDVrLwLG09SYGnbY+pp4y/lPsDI8mGN3DZtA7kFGUxW0OZHoOh6V4Xy4+W3Xu0UsxJsVIx+Msx5U1nAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:39.009332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1591216d33e9469aaded3433889619ef1ea2c78861f8e06cceefb30df682b787","sha256:e345ccc8d28515093cd44aa4c36a368df2ca667891699c57fecc2337fc0162f5"],"state_sha256":"462ee388813d4fb754e21f07527160905bd9366a17466b5f696a755d0f509bbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7KtPnx/13t4n+kvk5orwIOCVAOIPnCuL7Jz7ZtMgIJ/w8Z4UZM66Km4gdC7H60Q3P9CGbn6sAamyBlmGF/RuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:28:54.248937Z","bundle_sha256":"c95edd1fa617a22817b76a7d2a8848813f434a0edb37b9b23b3828ea53990661"}}