{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SP3GSVJMP24PQRELJQE6TC5MNF","short_pith_number":"pith:SP3GSVJM","schema_version":"1.0","canonical_sha256":"93f669552c7eb8f8448b4c09e98bac697d76dadb436b6832f52f9aaeee2e93ca","source":{"kind":"arxiv","id":"1106.4247","version":1},"attestation_state":"computed","paper":{"title":"On the gap between ess(f) and cnf_size(f)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Devorah Kletenik, Lisa Hellerstein","submitted_at":"2011-06-21T16:02:37Z","abstract_excerpt":"Given a Boolean function f, the quantity ess(f) denotes the largest set of assignments that falsify f, no two of which falsify a common implicate of f. Although ess(f)$ is clearly a lower bound on cnf_size(f) (the minimum number of clauses in a CNF formula for f), Cepek et al. showed that it is not, in general, a tight lower bound. They gave examples of functions f for which there is a small gap between ess(f) and cnf_size(f). We demonstrate significantly larger gaps. We show that the gap can be exponential in n for arbitrary Boolean functions, and Theta(sqrt{n}) for Horn functions, where n is"},"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":"1106.4247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-06-21T16:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"5f718f358347a131f0d7bafeaa9a55c70c0e7f6b4e918bbe0703bdccf81e34bc","abstract_canon_sha256":"9221ed83c97f13e383234c7bfd4df476096dff1803dcd16084d98b722a9a90f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:33.830658Z","signature_b64":"c+/mlqLC3S2l1o+DdobJojvS1TVib9yugaP9L7hFCgv2WF/k96JWzg34xCCdL3VZtNPgrh6pVwXGzwOMOv6VAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93f669552c7eb8f8448b4c09e98bac697d76dadb436b6832f52f9aaeee2e93ca","last_reissued_at":"2026-05-18T04:19:33.830198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:33.830198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the gap between ess(f) and cnf_size(f)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Devorah Kletenik, Lisa Hellerstein","submitted_at":"2011-06-21T16:02:37Z","abstract_excerpt":"Given a Boolean function f, the quantity ess(f) denotes the largest set of assignments that falsify f, no two of which falsify a common implicate of f. Although ess(f)$ is clearly a lower bound on cnf_size(f) (the minimum number of clauses in a CNF formula for f), Cepek et al. showed that it is not, in general, a tight lower bound. They gave examples of functions f for which there is a small gap between ess(f) and cnf_size(f). We demonstrate significantly larger gaps. We show that the gap can be exponential in n for arbitrary Boolean functions, and Theta(sqrt{n}) for Horn functions, where n is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4247","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1106.4247","created_at":"2026-05-18T04:19:33.830265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.4247v1","created_at":"2026-05-18T04:19:33.830265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4247","created_at":"2026-05-18T04:19:33.830265+00:00"},{"alias_kind":"pith_short_12","alias_value":"SP3GSVJMP24P","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SP3GSVJMP24PQREL","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SP3GSVJM","created_at":"2026-05-18T12:26:41.206345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SP3GSVJMP24PQRELJQE6TC5MNF","json":"https://pith.science/pith/SP3GSVJMP24PQRELJQE6TC5MNF.json","graph_json":"https://pith.science/api/pith-number/SP3GSVJMP24PQRELJQE6TC5MNF/graph.json","events_json":"https://pith.science/api/pith-number/SP3GSVJMP24PQRELJQE6TC5MNF/events.json","paper":"https://pith.science/paper/SP3GSVJM"},"agent_actions":{"view_html":"https://pith.science/pith/SP3GSVJMP24PQRELJQE6TC5MNF","download_json":"https://pith.science/pith/SP3GSVJMP24PQRELJQE6TC5MNF.json","view_paper":"https://pith.science/paper/SP3GSVJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.4247&json=true","fetch_graph":"https://pith.science/api/pith-number/SP3GSVJMP24PQRELJQE6TC5MNF/graph.json","fetch_events":"https://pith.science/api/pith-number/SP3GSVJMP24PQRELJQE6TC5MNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SP3GSVJMP24PQRELJQE6TC5MNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SP3GSVJMP24PQRELJQE6TC5MNF/action/storage_attestation","attest_author":"https://pith.science/pith/SP3GSVJMP24PQRELJQE6TC5MNF/action/author_attestation","sign_citation":"https://pith.science/pith/SP3GSVJMP24PQRELJQE6TC5MNF/action/citation_signature","submit_replication":"https://pith.science/pith/SP3GSVJMP24PQRELJQE6TC5MNF/action/replication_record"}},"created_at":"2026-05-18T04:19:33.830265+00:00","updated_at":"2026-05-18T04:19:33.830265+00:00"}