{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7DCB3AEZNKZ5P3VSZ2IC2H7AHS","short_pith_number":"pith:7DCB3AEZ","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"},"canonical_sha256":"f8c41d80996ab3d7eeb2ce902d1fe03c81187b67d4438c7d17f6043f90586447","source":{"kind":"arxiv","id":"1703.02469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02469","created_at":"2026-05-18T00:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02469v1","created_at":"2026-05-18T00:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02469","created_at":"2026-05-18T00:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"7DCB3AEZNKZ5","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7DCB3AEZNKZ5P3VS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7DCB3AEZ","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7DCB3AEZNKZ5P3VSZ2IC2H7AHS","target":"record","payload":{"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"},"canonical_sha256":"f8c41d80996ab3d7eeb2ce902d1fe03c81187b67d4438c7d17f6043f90586447","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"},"source_kind":"arxiv","source_id":"1703.02469","source_version":1,"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-18T00:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lo3ibTpVasSqpuYiOcCidDTKrry6nDpyMuhYJDBi7hbaUIguCgXLBx7NHcKlQCBTnKL8EqQgNYKpqPa0A2S9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:02:25.914523Z"},"content_sha256":"3be2752665f7da0e4e373d21a6a182386f77dca47a31a28d1d6b7a36805dfeb5","schema_version":"1.0","event_id":"sha256:3be2752665f7da0e4e373d21a6a182386f77dca47a31a28d1d6b7a36805dfeb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7DCB3AEZNKZ5P3VSZ2IC2H7AHS","target":"graph","payload":{"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"},"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-18T00:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8NfsQSWZCQaOuplKaD520yNaYLFw6Cg8Mg+UQH2T9zKAgd1mDxM2daexFNzigLFVe+MfAuHQb7PHOY7lThNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:02:25.914868Z"},"content_sha256":"6c6288d9c4c0cd33114bff77e9bdb3059c813219f76a11d1f8e138a533172d67","schema_version":"1.0","event_id":"sha256:6c6288d9c4c0cd33114bff77e9bdb3059c813219f76a11d1f8e138a533172d67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/bundle.json","state_url":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/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-02T18:02:25Z","links":{"resolver":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS","bundle":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/bundle.json","state":"https://pith.science/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DCB3AEZNKZ5P3VSZ2IC2H7AHS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7DCB3AEZNKZ5P3VSZ2IC2H7AHS","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":"3481a173faaede56128194993f3238fc5fbaf19b37002665f35bc48657b28a8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-07T16:50:43Z","title_canon_sha256":"0a5c97036ab5392e6d9b057a404293473fd53d49b996c278f1213560ab414f94"},"schema_version":"1.0","source":{"id":"1703.02469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02469","created_at":"2026-05-18T00:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02469v1","created_at":"2026-05-18T00:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02469","created_at":"2026-05-18T00:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"7DCB3AEZNKZ5","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7DCB3AEZNKZ5P3VS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7DCB3AEZ","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:6c6288d9c4c0cd33114bff77e9bdb3059c813219f76a11d1f8e138a533172d67","target":"graph","created_at":"2026-05-18T00:49:19Z","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":"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.","authors_text":"Denis Pankratov, Noah Fleming, Robert Robere, Toniann Pitassi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-07T16:50:43Z","title":"Random CNFs are Hard for Cutting Planes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02469","kind":"arxiv","version":1},"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:3be2752665f7da0e4e373d21a6a182386f77dca47a31a28d1d6b7a36805dfeb5","target":"record","created_at":"2026-05-18T00:49:19Z","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":"3481a173faaede56128194993f3238fc5fbaf19b37002665f35bc48657b28a8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-07T16:50:43Z","title_canon_sha256":"0a5c97036ab5392e6d9b057a404293473fd53d49b996c278f1213560ab414f94"},"schema_version":"1.0","source":{"id":"1703.02469","kind":"arxiv","version":1}},"canonical_sha256":"f8c41d80996ab3d7eeb2ce902d1fe03c81187b67d4438c7d17f6043f90586447","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8c41d80996ab3d7eeb2ce902d1fe03c81187b67d4438c7d17f6043f90586447","first_computed_at":"2026-05-18T00:49:19.870561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:19.870561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"opmvd/x3tWnDwsvc79l8KWsbqAVezKGM0ORAy/X5rtbIxIv0Mgsz/kZ2el0jV45BhPNKDGWPDwkJWEYPuLApAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:19.870909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3be2752665f7da0e4e373d21a6a182386f77dca47a31a28d1d6b7a36805dfeb5","sha256:6c6288d9c4c0cd33114bff77e9bdb3059c813219f76a11d1f8e138a533172d67"],"state_sha256":"07efd580b2a6631e7a06153fbdb6278cd5674eefb9c808f4be647981537b7675"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Um4cTIuxRjAq9+zyyjv1EfeTCI0K+C80H2Clb+qn0CCwEqd2MMiu8H5sk6zEFQWAQT0d8Wen3R396VNpldLZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:02:25.916884Z","bundle_sha256":"d431893488314ff00a2fceb77cb9277da25fe2bbe05b58487702fc186173dad6"}}