{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GRWYILFXVUUP4MHF4ENVO64KOI","short_pith_number":"pith:GRWYILFX","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"},"canonical_sha256":"346d842cb7ad28fe30e5e11b577b8a723485c087fbf4a66a2b2a22d1cf995480","source":{"kind":"arxiv","id":"1505.04383","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04383","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04383v3","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04383","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"pith_short_12","alias_value":"GRWYILFXVUUP","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GRWYILFXVUUP4MHF","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GRWYILFX","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GRWYILFXVUUP4MHF4ENVO64KOI","target":"record","payload":{"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"},"canonical_sha256":"346d842cb7ad28fe30e5e11b577b8a723485c087fbf4a66a2b2a22d1cf995480","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"},"source_kind":"arxiv","source_id":"1505.04383","source_version":3,"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:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VG5I3xWsul49ktcK6P5DVmWw6Ct/BuPW5cMSo2zmu5w4wJYFA+eR4d2Z/CyclHVbFTN28+lSk5VsvkZRaQN8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:51:20.330740Z"},"content_sha256":"9619c183e518d114eba3e7ab3989a5f0839ea69c793c144d80355ef54620a6c7","schema_version":"1.0","event_id":"sha256:9619c183e518d114eba3e7ab3989a5f0839ea69c793c144d80355ef54620a6c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GRWYILFXVUUP4MHF4ENVO64KOI","target":"graph","payload":{"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"},"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:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8EHDKFJpwLMd7awETLHnUaj3P6tDpocZIKqiXD+nprCbKEXJrdpA62tL+gsbZmYHGww3tWa5Sgk0pDSPrOSEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:51:20.331404Z"},"content_sha256":"01b22aecc4249d630ee5e2d19ebbc859b6a3febebb80c7232b4122b827f8a85a","schema_version":"1.0","event_id":"sha256:01b22aecc4249d630ee5e2d19ebbc859b6a3febebb80c7232b4122b827f8a85a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI/bundle.json","state_url":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRWYILFXVUUP4MHF4ENVO64KOI/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-05-30T07:51:20Z","links":{"resolver":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI","bundle":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI/bundle.json","state":"https://pith.science/pith/GRWYILFXVUUP4MHF4ENVO64KOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRWYILFXVUUP4MHF4ENVO64KOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GRWYILFXVUUP4MHF4ENVO64KOI","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":"14bd3d338fe0db438ca1d5e0cc5d593daad16f132a5b2c148eff3ecae04e7df3","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-17T11:35:12Z","title_canon_sha256":"ac00ba866f5daf7a2a59cc8eee7ddd682072c1324d4eabacdc3a3736087af31b"},"schema_version":"1.0","source":{"id":"1505.04383","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04383","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04383v3","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04383","created_at":"2026-05-18T01:36:17Z"},{"alias_kind":"pith_short_12","alias_value":"GRWYILFXVUUP","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GRWYILFXVUUP4MHF","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GRWYILFX","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:01b22aecc4249d630ee5e2d19ebbc859b6a3febebb80c7232b4122b827f8a85a","target":"graph","created_at":"2026-05-18T01:36:17Z","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":"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","authors_text":"David Witmer, Ryan O'Donnell, Sarah R. Allen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-17T11:35:12Z","title":"How to refute a random CSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04383","kind":"arxiv","version":3},"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:9619c183e518d114eba3e7ab3989a5f0839ea69c793c144d80355ef54620a6c7","target":"record","created_at":"2026-05-18T01:36:17Z","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":"14bd3d338fe0db438ca1d5e0cc5d593daad16f132a5b2c148eff3ecae04e7df3","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-17T11:35:12Z","title_canon_sha256":"ac00ba866f5daf7a2a59cc8eee7ddd682072c1324d4eabacdc3a3736087af31b"},"schema_version":"1.0","source":{"id":"1505.04383","kind":"arxiv","version":3}},"canonical_sha256":"346d842cb7ad28fe30e5e11b577b8a723485c087fbf4a66a2b2a22d1cf995480","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"346d842cb7ad28fe30e5e11b577b8a723485c087fbf4a66a2b2a22d1cf995480","first_computed_at":"2026-05-18T01:36:17.943067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:17.943067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C49JY1gcXUybs5uLCEqcj+MWg0//l0fdqMnM2klsoqNxQi4NRUW+VkdxOjchy0VisMwtFkDmgB6k8eX7HvcHBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:17.943548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04383","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9619c183e518d114eba3e7ab3989a5f0839ea69c793c144d80355ef54620a6c7","sha256:01b22aecc4249d630ee5e2d19ebbc859b6a3febebb80c7232b4122b827f8a85a"],"state_sha256":"87af2bd4c345e17bb8a31b19756612acb865eacaa33284f5f00172a41bb1e514"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ta8hkB/ucUGIqsIorPG8itF2luq68vsQ1/cL/hwgRghlvvdHG28DdIQJsWbT3bAJGckB/chTddIQOW3ZoXc7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:51:20.334711Z","bundle_sha256":"cddf78d38bf3400d83e444aa8778093b96f5f7f275f4c74764963664b7c66b29"}}