{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4VDKGPLCRXSTJRSTVHXKAD7Y72","short_pith_number":"pith:4VDKGPLC","schema_version":"1.0","canonical_sha256":"e546a33d628de534c653a9eea00ff8fe81172e03af5965cc8b0ba7c2a63e5ebb","source":{"kind":"arxiv","id":"1101.3970","version":2},"attestation_state":"computed","paper":{"title":"Short Propositional Refutations for Dense Random 3CNF Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Iddo Tzameret, Sebastian M\\\"uller","submitted_at":"2011-01-20T17:09:14Z","abstract_excerpt":"Random 3CNF formulas constitute an important distribution for measuring the average-case behavior of propositional proof systems. Lower bounds for random 3CNF refutations in many propositional proof systems are known. Most notably are the exponential-size resolution refutation lower bounds for random 3CNF formulas with $\\Omega(n^{1.5-\\epsilon}) $ clauses [Chvatal and Szemeredi (1988), Ben-Sasson and Wigderson (2001)]. On the other hand, the only known non-trivial upper bound on the size of random 3CNF refutations in a non-abstract propositional proof system is for resolution with $\\Omega(n^{2}"},"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":"1101.3970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-01-20T17:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"3d1dbf50ec088b0989c80b46bba84f32dcd0e2f3a0919a12ee3c850ae407b0e0","abstract_canon_sha256":"4aeb4545119b2bd7f68ba2435efdad91efa4ee00ee590f2bfbab0d343a434ec6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:49.637401Z","signature_b64":"WQdVN8jXCUBjcMAMNs6mKYt5d1mroRd2Qsyyr6IEw3sit762Pyy7sIGjVAMTy1ELirNf/mJ3y9HEuzGEZVHaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e546a33d628de534c653a9eea00ff8fe81172e03af5965cc8b0ba7c2a63e5ebb","last_reissued_at":"2026-05-18T04:20:49.636817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:49.636817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short Propositional Refutations for Dense Random 3CNF Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Iddo Tzameret, Sebastian M\\\"uller","submitted_at":"2011-01-20T17:09:14Z","abstract_excerpt":"Random 3CNF formulas constitute an important distribution for measuring the average-case behavior of propositional proof systems. Lower bounds for random 3CNF refutations in many propositional proof systems are known. Most notably are the exponential-size resolution refutation lower bounds for random 3CNF formulas with $\\Omega(n^{1.5-\\epsilon}) $ clauses [Chvatal and Szemeredi (1988), Ben-Sasson and Wigderson (2001)]. On the other hand, the only known non-trivial upper bound on the size of random 3CNF refutations in a non-abstract propositional proof system is for resolution with $\\Omega(n^{2}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3970","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":"1101.3970","created_at":"2026-05-18T04:20:49.636907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.3970v2","created_at":"2026-05-18T04:20:49.636907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3970","created_at":"2026-05-18T04:20:49.636907+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VDKGPLCRXST","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VDKGPLCRXSTJRST","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VDKGPLC","created_at":"2026-05-18T12:26:20.644004+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/4VDKGPLCRXSTJRSTVHXKAD7Y72","json":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72.json","graph_json":"https://pith.science/api/pith-number/4VDKGPLCRXSTJRSTVHXKAD7Y72/graph.json","events_json":"https://pith.science/api/pith-number/4VDKGPLCRXSTJRSTVHXKAD7Y72/events.json","paper":"https://pith.science/paper/4VDKGPLC"},"agent_actions":{"view_html":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72","download_json":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72.json","view_paper":"https://pith.science/paper/4VDKGPLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.3970&json=true","fetch_graph":"https://pith.science/api/pith-number/4VDKGPLCRXSTJRSTVHXKAD7Y72/graph.json","fetch_events":"https://pith.science/api/pith-number/4VDKGPLCRXSTJRSTVHXKAD7Y72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72/action/storage_attestation","attest_author":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72/action/author_attestation","sign_citation":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72/action/citation_signature","submit_replication":"https://pith.science/pith/4VDKGPLCRXSTJRSTVHXKAD7Y72/action/replication_record"}},"created_at":"2026-05-18T04:20:49.636907+00:00","updated_at":"2026-05-18T04:20:49.636907+00:00"}