{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MD342BVCXDGCARV6S3XQFSCG3V","short_pith_number":"pith:MD342BVC","schema_version":"1.0","canonical_sha256":"60f7cd06a2b8cc2046be96ef02c846dd5b0971bc9e848038429679f2577f4b0a","source":{"kind":"arxiv","id":"1411.1995","version":3},"attestation_state":"computed","paper":{"title":"A Strongly Exponential Separation of DNNFs from CNF Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Florent Capelli, Friedrich Slivovsky, Simone Bova, Stefan Mengel","submitted_at":"2014-11-07T17:43:33Z","abstract_excerpt":"Decomposable Negation Normal Forms (DNNFs) are Boolean circuits in negation normal form where the subcircuits leading into each AND gate are defined on disjoint sets of variables. We prove a strongly exponential lower bound on the size of DNNFs for a class of CNF formulas built from expander graphs. As a corollary, we obtain a strongly exponential separation between DNNFs and CNF formulas in prime implicates form. This settles an open problem in the area of knowledge compilation (Darwiche and Marquis, 2002)."},"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":"1411.1995","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-07T17:43:33Z","cross_cats_sorted":[],"title_canon_sha256":"eb40802f6b13aa4d1dcce9a8e6e31c195d3336c60877b269920c91e4deba3de3","abstract_canon_sha256":"0ba3999d593acace89a2b19b756841a4801d07b2a8eba4b08d95ed5f2ffb401a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:46.808639Z","signature_b64":"hLYB/mlVRTxqE6ptddh6KFXpTKV0pibzIlmpzTerGbtBxoYGgynJy9jE9G3w4HeNHYP+s3ZgtfTg0BgZWRdaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60f7cd06a2b8cc2046be96ef02c846dd5b0971bc9e848038429679f2577f4b0a","last_reissued_at":"2026-05-18T02:26:46.808232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:46.808232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Strongly Exponential Separation of DNNFs from CNF Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Florent Capelli, Friedrich Slivovsky, Simone Bova, Stefan Mengel","submitted_at":"2014-11-07T17:43:33Z","abstract_excerpt":"Decomposable Negation Normal Forms (DNNFs) are Boolean circuits in negation normal form where the subcircuits leading into each AND gate are defined on disjoint sets of variables. We prove a strongly exponential lower bound on the size of DNNFs for a class of CNF formulas built from expander graphs. As a corollary, we obtain a strongly exponential separation between DNNFs and CNF formulas in prime implicates form. This settles an open problem in the area of knowledge compilation (Darwiche and Marquis, 2002)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1995","kind":"arxiv","version":3},"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":"1411.1995","created_at":"2026-05-18T02:26:46.808301+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1995v3","created_at":"2026-05-18T02:26:46.808301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1995","created_at":"2026-05-18T02:26:46.808301+00:00"},{"alias_kind":"pith_short_12","alias_value":"MD342BVCXDGC","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MD342BVCXDGCARV6","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MD342BVC","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12378","citing_title":"Proof Systems Based on Structured Circuits","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V","json":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V.json","graph_json":"https://pith.science/api/pith-number/MD342BVCXDGCARV6S3XQFSCG3V/graph.json","events_json":"https://pith.science/api/pith-number/MD342BVCXDGCARV6S3XQFSCG3V/events.json","paper":"https://pith.science/paper/MD342BVC"},"agent_actions":{"view_html":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V","download_json":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V.json","view_paper":"https://pith.science/paper/MD342BVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1995&json=true","fetch_graph":"https://pith.science/api/pith-number/MD342BVCXDGCARV6S3XQFSCG3V/graph.json","fetch_events":"https://pith.science/api/pith-number/MD342BVCXDGCARV6S3XQFSCG3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V/action/storage_attestation","attest_author":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V/action/author_attestation","sign_citation":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V/action/citation_signature","submit_replication":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V/action/replication_record"}},"created_at":"2026-05-18T02:26:46.808301+00:00","updated_at":"2026-05-18T02:26:46.808301+00:00"}