{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EYOWYD6LEYFUGVD6ZYXDPNWKFV","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":"2a38ca20b83d7165ceac9cf7be7eb0a7e49c3e5927b81585392242e1229f934b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-05T19:48:01Z","title_canon_sha256":"cfd37ce5cc83d2797711e9179e2f8f237a6f98b769c54d3c3b40748c38dbcf4d"},"schema_version":"1.0","source":{"id":"1701.01461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01461","created_at":"2026-05-18T00:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01461v1","created_at":"2026-05-18T00:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01461","created_at":"2026-05-18T00:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"EYOWYD6LEYFU","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EYOWYD6LEYFUGVD6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EYOWYD6L","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:48a8ff9023293b30e4bfaba9f35c0c93dfa80cd3cae1ad9a52a90f3e2088c980","target":"graph","created_at":"2026-05-18T00:53:16Z","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":"Two main techniques have been used so far to solve the #P-hard problem #SAT. The first one, used in practice, is based on an extension of DPLL for model counting called exhaustive DPLL. The second approach, more theoretical, exploits the structure of the input to compute the number of satisfying assignments by usually using a dynamic programming scheme on a decomposition of the formula. In this paper, we make a first step toward the separation of these two techniques by exhibiting a family of formulas that can be solved in polynomial time with the first technique but needs an exponential time ","authors_text":"Florent Capelli","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-05T19:48:01Z","title":"Understanding the complexity of #SAT using knowledge compilation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01461","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:14d17466f12b8f5f6db90c775e96558df86f5f011c976768bbdf1720ed80cec7","target":"record","created_at":"2026-05-18T00:53:16Z","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":"2a38ca20b83d7165ceac9cf7be7eb0a7e49c3e5927b81585392242e1229f934b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-05T19:48:01Z","title_canon_sha256":"cfd37ce5cc83d2797711e9179e2f8f237a6f98b769c54d3c3b40748c38dbcf4d"},"schema_version":"1.0","source":{"id":"1701.01461","kind":"arxiv","version":1}},"canonical_sha256":"261d6c0fcb260b43547ece2e37b6ca2d4e7e69288fc7f2f8db5979fa851f1614","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"261d6c0fcb260b43547ece2e37b6ca2d4e7e69288fc7f2f8db5979fa851f1614","first_computed_at":"2026-05-18T00:53:16.769489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:16.769489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"clo0GmXWen7/QQkIk8eONvgodXyZTdX9ARw4giWuuNJj75V8msamT6JMsrVIVcOLC9y71LsMhyCr5oIOhq58Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:16.769931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.01461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14d17466f12b8f5f6db90c775e96558df86f5f011c976768bbdf1720ed80cec7","sha256:48a8ff9023293b30e4bfaba9f35c0c93dfa80cd3cae1ad9a52a90f3e2088c980"],"state_sha256":"91d62c8acf2418fd2e950dd90b107f28e5c628ef297d11104b4f41fa32bea87b"}