{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:QFI3QCSRS4G2SYF5TALE7ENVDV","short_pith_number":"pith:QFI3QCSR","schema_version":"1.0","canonical_sha256":"8151b80a51970da960bd98164f91b51d5b1ab6baed8ffdedc2ee159949688d09","source":{"kind":"arxiv","id":"0910.3127","version":2},"attestation_state":"computed","paper":{"title":"On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DM","authors_text":"Alexander Razborov, Jakob Nordstr\\\"om","submitted_at":"2009-10-16T14:33:58Z","abstract_excerpt":"In the context of proving lower bounds on proof space in k-DNF resolution, [Ben-Sasson and Nordstrom 2009] introduced the concept of minimally unsatisfiable sets of k-DNF formulas and proved that a minimally unsatisfiable k-DNF set with m formulas can have at most O((mk)^(k+1)) variables. They also gave an example of such sets with Omega(mk^2) variables.\n  In this paper we significantly improve the lower bound to Omega(m)^k, which almost matches the upper bound above. Furthermore, we show that this implies that the analysis of their technique for proving time-space separations and trade-offs f"},"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":"0910.3127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-10-16T14:33:58Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"ace1b72a67bd92c2ffd92bd50f8272ff7ee34b9f6508b0295ed5c95f9e05e20a","abstract_canon_sha256":"1e32fda0e60cd52cc076b1bd5e6da7deb8cfb194d1b54a290aa2f7cb0ae37665"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:59.624807Z","signature_b64":"AoCoeBMvihv8eigO5lEWK46ejVm2RH8uldBsiE3z3Y1oRcYHvhWZpy8nulG0iI7W0o2XbMlINMypHw+cBmqXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8151b80a51970da960bd98164f91b51d5b1ab6baed8ffdedc2ee159949688d09","last_reissued_at":"2026-05-18T01:04:59.624377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:59.624377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DM","authors_text":"Alexander Razborov, Jakob Nordstr\\\"om","submitted_at":"2009-10-16T14:33:58Z","abstract_excerpt":"In the context of proving lower bounds on proof space in k-DNF resolution, [Ben-Sasson and Nordstrom 2009] introduced the concept of minimally unsatisfiable sets of k-DNF formulas and proved that a minimally unsatisfiable k-DNF set with m formulas can have at most O((mk)^(k+1)) variables. They also gave an example of such sets with Omega(mk^2) variables.\n  In this paper we significantly improve the lower bound to Omega(m)^k, which almost matches the upper bound above. Furthermore, we show that this implies that the analysis of their technique for proving time-space separations and trade-offs f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.3127","kind":"arxiv","version":2},"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":"0910.3127","created_at":"2026-05-18T01:04:59.624438+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.3127v2","created_at":"2026-05-18T01:04:59.624438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.3127","created_at":"2026-05-18T01:04:59.624438+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFI3QCSRS4G2","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFI3QCSRS4G2SYF5","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFI3QCSR","created_at":"2026-05-18T12:26:01.383474+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/QFI3QCSRS4G2SYF5TALE7ENVDV","json":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV.json","graph_json":"https://pith.science/api/pith-number/QFI3QCSRS4G2SYF5TALE7ENVDV/graph.json","events_json":"https://pith.science/api/pith-number/QFI3QCSRS4G2SYF5TALE7ENVDV/events.json","paper":"https://pith.science/paper/QFI3QCSR"},"agent_actions":{"view_html":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV","download_json":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV.json","view_paper":"https://pith.science/paper/QFI3QCSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.3127&json=true","fetch_graph":"https://pith.science/api/pith-number/QFI3QCSRS4G2SYF5TALE7ENVDV/graph.json","fetch_events":"https://pith.science/api/pith-number/QFI3QCSRS4G2SYF5TALE7ENVDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV/action/storage_attestation","attest_author":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV/action/author_attestation","sign_citation":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV/action/citation_signature","submit_replication":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV/action/replication_record"}},"created_at":"2026-05-18T01:04:59.624438+00:00","updated_at":"2026-05-18T01:04:59.624438+00:00"}