{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MD342BVCXDGCARV6S3XQFSCG3V","short_pith_number":"pith:MD342BVC","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"},"canonical_sha256":"60f7cd06a2b8cc2046be96ef02c846dd5b0971bc9e848038429679f2577f4b0a","source":{"kind":"arxiv","id":"1411.1995","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1995","created_at":"2026-05-18T02:26:46Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1995v3","created_at":"2026-05-18T02:26:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1995","created_at":"2026-05-18T02:26:46Z"},{"alias_kind":"pith_short_12","alias_value":"MD342BVCXDGC","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MD342BVCXDGCARV6","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MD342BVC","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MD342BVCXDGCARV6S3XQFSCG3V","target":"record","payload":{"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"},"canonical_sha256":"60f7cd06a2b8cc2046be96ef02c846dd5b0971bc9e848038429679f2577f4b0a","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"},"source_kind":"arxiv","source_id":"1411.1995","source_version":3,"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-18T02:26:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4vrgrnrG/SEd/vkfiGBXLF74xNdYvF0JVohnrmMlavcjwmKjEoVD9+JOFiNj+teaBkTibs6mPo9O47pF1wLpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:04:39.202065Z"},"content_sha256":"97f549d3217ba62458727895977ae403e41480d7595aae96a0e432054919b4d8","schema_version":"1.0","event_id":"sha256:97f549d3217ba62458727895977ae403e41480d7595aae96a0e432054919b4d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MD342BVCXDGCARV6S3XQFSCG3V","target":"graph","payload":{"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"},"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-18T02:26:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XLfV1TyXauB/xwBRrZr8rTR1xD1AZS2RBhKsH8qzFoh7FzgjI46jwYs7qas5d/0ETFPoM2oK37SrlGAPsb7tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:04:39.202806Z"},"content_sha256":"43b17264cab20d624680f09e377e50cedae283c0bad4f8120a85af3fabbe5790","schema_version":"1.0","event_id":"sha256:43b17264cab20d624680f09e377e50cedae283c0bad4f8120a85af3fabbe5790"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V/bundle.json","state_url":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MD342BVCXDGCARV6S3XQFSCG3V/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-26T07:04:39Z","links":{"resolver":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V","bundle":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V/bundle.json","state":"https://pith.science/pith/MD342BVCXDGCARV6S3XQFSCG3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MD342BVCXDGCARV6S3XQFSCG3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MD342BVCXDGCARV6S3XQFSCG3V","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":"0ba3999d593acace89a2b19b756841a4801d07b2a8eba4b08d95ed5f2ffb401a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-07T17:43:33Z","title_canon_sha256":"eb40802f6b13aa4d1dcce9a8e6e31c195d3336c60877b269920c91e4deba3de3"},"schema_version":"1.0","source":{"id":"1411.1995","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1995","created_at":"2026-05-18T02:26:46Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1995v3","created_at":"2026-05-18T02:26:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1995","created_at":"2026-05-18T02:26:46Z"},{"alias_kind":"pith_short_12","alias_value":"MD342BVCXDGC","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MD342BVCXDGCARV6","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MD342BVC","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:43b17264cab20d624680f09e377e50cedae283c0bad4f8120a85af3fabbe5790","target":"graph","created_at":"2026-05-18T02:26:46Z","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":"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).","authors_text":"Florent Capelli, Friedrich Slivovsky, Simone Bova, Stefan Mengel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-07T17:43:33Z","title":"A Strongly Exponential Separation of DNNFs from CNF Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1995","kind":"arxiv","version":3},"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:97f549d3217ba62458727895977ae403e41480d7595aae96a0e432054919b4d8","target":"record","created_at":"2026-05-18T02:26:46Z","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":"0ba3999d593acace89a2b19b756841a4801d07b2a8eba4b08d95ed5f2ffb401a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-07T17:43:33Z","title_canon_sha256":"eb40802f6b13aa4d1dcce9a8e6e31c195d3336c60877b269920c91e4deba3de3"},"schema_version":"1.0","source":{"id":"1411.1995","kind":"arxiv","version":3}},"canonical_sha256":"60f7cd06a2b8cc2046be96ef02c846dd5b0971bc9e848038429679f2577f4b0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60f7cd06a2b8cc2046be96ef02c846dd5b0971bc9e848038429679f2577f4b0a","first_computed_at":"2026-05-18T02:26:46.808232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:46.808232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hLYB/mlVRTxqE6ptddh6KFXpTKV0pibzIlmpzTerGbtBxoYGgynJy9jE9G3w4HeNHYP+s3ZgtfTg0BgZWRdaDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:46.808639Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1995","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97f549d3217ba62458727895977ae403e41480d7595aae96a0e432054919b4d8","sha256:43b17264cab20d624680f09e377e50cedae283c0bad4f8120a85af3fabbe5790"],"state_sha256":"487fbd01679b55b7a066c8effbb13c93e5a2a228d0971e840211ec8cdbda92f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D4lBcKDJUQhfPwGqcBxtUCmbnc9nlYyfxQJsLjUQzjJBfAQ2vDNJ1jc79E2Xt+NYRP5+6kUhZ4m73ZkJccDKDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:04:39.207149Z","bundle_sha256":"1b7a63f7fd1d53fee327c1e8918144b1b5997ecb91d00517ee04d7d55377d4e3"}}