{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:QFI3QCSRS4G2SYF5TALE7ENVDV","short_pith_number":"pith:QFI3QCSR","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"},"canonical_sha256":"8151b80a51970da960bd98164f91b51d5b1ab6baed8ffdedc2ee159949688d09","source":{"kind":"arxiv","id":"0910.3127","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.3127","created_at":"2026-05-18T01:04:59Z"},{"alias_kind":"arxiv_version","alias_value":"0910.3127v2","created_at":"2026-05-18T01:04:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.3127","created_at":"2026-05-18T01:04:59Z"},{"alias_kind":"pith_short_12","alias_value":"QFI3QCSRS4G2","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QFI3QCSRS4G2SYF5","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QFI3QCSR","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:QFI3QCSRS4G2SYF5TALE7ENVDV","target":"record","payload":{"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"},"canonical_sha256":"8151b80a51970da960bd98164f91b51d5b1ab6baed8ffdedc2ee159949688d09","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"},"source_kind":"arxiv","source_id":"0910.3127","source_version":2,"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-18T01:04:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CWkqYMSlFSHZXis70zHVfJdrra/ZFYlSZazp1RqalAbnitJz7imO9zXgkt+NrThcRe5g+dWYjh+FHH2q64NJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:13:52.338836Z"},"content_sha256":"0484cdec6a5ba716353804446e44d9d2058807e160972e0c6887bd435fd170b2","schema_version":"1.0","event_id":"sha256:0484cdec6a5ba716353804446e44d9d2058807e160972e0c6887bd435fd170b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:QFI3QCSRS4G2SYF5TALE7ENVDV","target":"graph","payload":{"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"},"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-18T01:04:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lEpuxMoF2zlNyGq3L0EVL8RCWWRLdFo9j5lRU5Jtd4ZHLNzIpN/2vwuqg0Cimf0tZ3Ae0xyOd5b7zb2pv4qfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:13:52.339552Z"},"content_sha256":"e5908e5f00c9f74c76008c85c4999fc04564c440f7b2522ce410104dc4378bc6","schema_version":"1.0","event_id":"sha256:e5908e5f00c9f74c76008c85c4999fc04564c440f7b2522ce410104dc4378bc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV/bundle.json","state_url":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFI3QCSRS4G2SYF5TALE7ENVDV/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-06-09T06:13:52Z","links":{"resolver":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV","bundle":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV/bundle.json","state":"https://pith.science/pith/QFI3QCSRS4G2SYF5TALE7ENVDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFI3QCSRS4G2SYF5TALE7ENVDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:QFI3QCSRS4G2SYF5TALE7ENVDV","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":"1e32fda0e60cd52cc076b1bd5e6da7deb8cfb194d1b54a290aa2f7cb0ae37665","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-10-16T14:33:58Z","title_canon_sha256":"ace1b72a67bd92c2ffd92bd50f8272ff7ee34b9f6508b0295ed5c95f9e05e20a"},"schema_version":"1.0","source":{"id":"0910.3127","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.3127","created_at":"2026-05-18T01:04:59Z"},{"alias_kind":"arxiv_version","alias_value":"0910.3127v2","created_at":"2026-05-18T01:04:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.3127","created_at":"2026-05-18T01:04:59Z"},{"alias_kind":"pith_short_12","alias_value":"QFI3QCSRS4G2","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QFI3QCSRS4G2SYF5","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QFI3QCSR","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:e5908e5f00c9f74c76008c85c4999fc04564c440f7b2522ce410104dc4378bc6","target":"graph","created_at":"2026-05-18T01:04:59Z","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":"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","authors_text":"Alexander Razborov, Jakob Nordstr\\\"om","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-10-16T14:33:58Z","title":"On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.3127","kind":"arxiv","version":2},"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:0484cdec6a5ba716353804446e44d9d2058807e160972e0c6887bd435fd170b2","target":"record","created_at":"2026-05-18T01:04:59Z","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":"1e32fda0e60cd52cc076b1bd5e6da7deb8cfb194d1b54a290aa2f7cb0ae37665","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-10-16T14:33:58Z","title_canon_sha256":"ace1b72a67bd92c2ffd92bd50f8272ff7ee34b9f6508b0295ed5c95f9e05e20a"},"schema_version":"1.0","source":{"id":"0910.3127","kind":"arxiv","version":2}},"canonical_sha256":"8151b80a51970da960bd98164f91b51d5b1ab6baed8ffdedc2ee159949688d09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8151b80a51970da960bd98164f91b51d5b1ab6baed8ffdedc2ee159949688d09","first_computed_at":"2026-05-18T01:04:59.624377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:59.624377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AoCoeBMvihv8eigO5lEWK46ejVm2RH8uldBsiE3z3Y1oRcYHvhWZpy8nulG0iI7W0o2XbMlINMypHw+cBmqXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:59.624807Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.3127","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0484cdec6a5ba716353804446e44d9d2058807e160972e0c6887bd435fd170b2","sha256:e5908e5f00c9f74c76008c85c4999fc04564c440f7b2522ce410104dc4378bc6"],"state_sha256":"87991e8269942e96e70caee4d561f9a1e0f42c3ba5f5c5130c1582081973df01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCitZBdIrsJylb7+KHQasVzbYT9EKlVYv2o0l91cCA2RAeJxnlCyIR9FzlT8pfFz5VwbRVA/4TT2HB0ADTDpAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:13:52.343454Z","bundle_sha256":"2bfcb5ea2726a8cc493c56c78967200d83bf251e8ac99558c121f4f26dd9f2af"}}