{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GRWYILFXVUUP4MHF4ENVO64KOI","short_pith_number":"pith:GRWYILFX","schema_version":"1.0","canonical_sha256":"346d842cb7ad28fe30e5e11b577b8a723485c087fbf4a66a2b2a22d1cf995480","source":{"kind":"arxiv","id":"1505.04383","version":3},"attestation_state":"computed","paper":{"title":"How to refute a random CSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"David Witmer, Ryan O'Donnell, Sarah R. Allen","submitted_at":"2015-05-17T11:35:12Z","abstract_excerpt":"Let $P$ be a $k$-ary predicate over a finite alphabet. Consider a random CSP$(P)$ instance $I$ over $n$ variables with $m$ constraints. When $m \\gg n$ the instance $I$ will be unsatisfiable with high probability, and we want to find a refutation - i.e., a certificate of unsatisfiability. When $P$ is the $3$-ary OR predicate, this is the well studied problem of refuting random $3$-SAT formulas, and an efficient algorithm is known only when $m \\gg n^{3/2}$. Understanding the density required for refutation of other predicates is important in cryptography, proof complexity, and learning theory. P"},"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":"1505.04383","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-17T11:35:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac00ba866f5daf7a2a59cc8eee7ddd682072c1324d4eabacdc3a3736087af31b","abstract_canon_sha256":"14bd3d338fe0db438ca1d5e0cc5d593daad16f132a5b2c148eff3ecae04e7df3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:17.943548Z","signature_b64":"C49JY1gcXUybs5uLCEqcj+MWg0//l0fdqMnM2klsoqNxQi4NRUW+VkdxOjchy0VisMwtFkDmgB6k8eX7HvcHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"346d842cb7ad28fe30e5e11b577b8a723485c087fbf4a66a2b2a22d1cf995480","last_reissued_at":"2026-05-18T01:36:17.943067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:17.943067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to refute a random CSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"David Witmer, Ryan O'Donnell, Sarah R. Allen","submitted_at":"2015-05-17T11:35:12Z","abstract_excerpt":"Let $P$ be a $k$-ary predicate over a finite alphabet. Consider a random CSP$(P)$ instance $I$ over $n$ variables with $m$ constraints. When $m \\gg n$ the instance $I$ will be unsatisfiable with high probability, and we want to find a refutation - i.e., a certificate of unsatisfiability. When $P$ is the $3$-ary OR predicate, this is the well studied problem of refuting random $3$-SAT formulas, and an efficient algorithm is known only when $m \\gg n^{3/2}$. Understanding the density required for refutation of other predicates is important in cryptography, proof complexity, and learning theory. P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04383","kind":"arxiv","version":3},"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":"1505.04383","created_at":"2026-05-18T01:36:17.943134+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04383v3","created_at":"2026-05-18T01:36:17.943134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04383","created_at":"2026-05-18T01:36:17.943134+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRWYILFXVUUP","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRWYILFXVUUP4MHF","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRWYILFX","created_at":"2026-05-18T12:29:22.688609+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/GRWYILFXVUUP4MHF4ENVO64KOI","json":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI.json","graph_json":"https://pith.science/api/pith-number/GRWYILFXVUUP4MHF4ENVO64KOI/graph.json","events_json":"https://pith.science/api/pith-number/GRWYILFXVUUP4MHF4ENVO64KOI/events.json","paper":"https://pith.science/paper/GRWYILFX"},"agent_actions":{"view_html":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI","download_json":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI.json","view_paper":"https://pith.science/paper/GRWYILFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04383&json=true","fetch_graph":"https://pith.science/api/pith-number/GRWYILFXVUUP4MHF4ENVO64KOI/graph.json","fetch_events":"https://pith.science/api/pith-number/GRWYILFXVUUP4MHF4ENVO64KOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI/action/storage_attestation","attest_author":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI/action/author_attestation","sign_citation":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI/action/citation_signature","submit_replication":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI/action/replication_record"}},"created_at":"2026-05-18T01:36:17.943134+00:00","updated_at":"2026-05-18T01:36:17.943134+00:00"}