{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7DCB3AEZNKZ5P3VSZ2IC2H7AHS","short_pith_number":"pith:7DCB3AEZ","schema_version":"1.0","canonical_sha256":"f8c41d80996ab3d7eeb2ce902d1fe03c81187b67d4438c7d17f6043f90586447","source":{"kind":"arxiv","id":"1703.02469","version":1},"attestation_state":"computed","paper":{"title":"Random CNFs are Hard for Cutting Planes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Denis Pankratov, Noah Fleming, Robert Robere, Toniann Pitassi","submitted_at":"2017-03-07T16:50:43Z","abstract_excerpt":"The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics; it is used as a testbench for satisfiability algorithms, and average-case hardness over this distribution has also been linked to hardness of approximation via Feige's hypothesis. We prove that any Cutting Planes refutation for random k-SAT requires exponential size, for k that is logarithmic in the number of variables, in the (interesting) regime where the number of clauses guarantees that the formula is unsatisfiable with high probability."},"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":"1703.02469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-07T16:50:43Z","cross_cats_sorted":[],"title_canon_sha256":"0a5c97036ab5392e6d9b057a404293473fd53d49b996c278f1213560ab414f94","abstract_canon_sha256":"3481a173faaede56128194993f3238fc5fbaf19b37002665f35bc48657b28a8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:19.870909Z","signature_b64":"opmvd/x3tWnDwsvc79l8KWsbqAVezKGM0ORAy/X5rtbIxIv0Mgsz/kZ2el0jV45BhPNKDGWPDwkJWEYPuLApAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8c41d80996ab3d7eeb2ce902d1fe03c81187b67d4438c7d17f6043f90586447","last_reissued_at":"2026-05-18T00:49:19.870561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:19.870561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random CNFs are Hard for Cutting Planes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Denis Pankratov, Noah Fleming, Robert Robere, Toniann Pitassi","submitted_at":"2017-03-07T16:50:43Z","abstract_excerpt":"The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics; it is used as a testbench for satisfiability algorithms, and average-case hardness over this distribution has also been linked to hardness of approximation via Feige's hypothesis. We prove that any Cutting Planes refutation for random k-SAT requires exponential size, for k that is logarithmic in the number of variables, in the (interesting) regime where the number of clauses guarantees that the formula is unsatisfiable with high probability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02469","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":"1703.02469","created_at":"2026-05-18T00:49:19.870618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.02469v1","created_at":"2026-05-18T00:49:19.870618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02469","created_at":"2026-05-18T00:49:19.870618+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DCB3AEZNKZ5","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DCB3AEZNKZ5P3VS","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DCB3AEZ","created_at":"2026-05-18T12:31:03.183658+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/7DCB3AEZNKZ5P3VSZ2IC2H7AHS","json":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS.json","graph_json":"https://pith.science/api/pith-number/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/graph.json","events_json":"https://pith.science/api/pith-number/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/events.json","paper":"https://pith.science/paper/7DCB3AEZ"},"agent_actions":{"view_html":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS","download_json":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS.json","view_paper":"https://pith.science/paper/7DCB3AEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.02469&json=true","fetch_graph":"https://pith.science/api/pith-number/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/graph.json","fetch_events":"https://pith.science/api/pith-number/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/action/storage_attestation","attest_author":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/action/author_attestation","sign_citation":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/action/citation_signature","submit_replication":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/action/replication_record"}},"created_at":"2026-05-18T00:49:19.870618+00:00","updated_at":"2026-05-18T00:49:19.870618+00:00"}