{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MCLZER5RPZBINPHOCHE6HXQFDO","short_pith_number":"pith:MCLZER5R","canonical_record":{"source":{"id":"1501.00734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-04T23:27:12Z","cross_cats_sorted":[],"title_canon_sha256":"b6ccee5c0c279513748022cd172e9b887ab32cf1a4d86f80a62d1b02bcbcc143","abstract_canon_sha256":"b520abf252bbbaa02b82122c1ac90ac80edc8941ff72989821289da87a9030b1"},"schema_version":"1.0"},"canonical_sha256":"60979247b17e4286bcee11c9e3de051b97e8a344eb03e25fd6e057e5c8f966dc","source":{"kind":"arxiv","id":"1501.00734","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00734","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00734v2","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00734","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"MCLZER5RPZBI","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MCLZER5RPZBINPHO","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MCLZER5R","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MCLZER5RPZBINPHOCHE6HXQFDO","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-04T23:27:12Z","cross_cats_sorted":[],"title_canon_sha256":"b6ccee5c0c279513748022cd172e9b887ab32cf1a4d86f80a62d1b02bcbcc143","abstract_canon_sha256":"b520abf252bbbaa02b82122c1ac90ac80edc8941ff72989821289da87a9030b1"},"schema_version":"1.0"},"canonical_sha256":"60979247b17e4286bcee11c9e3de051b97e8a344eb03e25fd6e057e5c8f966dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:12.292607Z","signature_b64":"Q/lnW0bBZhG8hkm4EZiUB6DvZr3GXypvBZPaEMZKyElR4WIaFncYvxBq3wJoVWAMEBmkbjK7Iw6Ix4om3XO+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60979247b17e4286bcee11c9e3de051b97e8a344eb03e25fd6e057e5c8f966dc","last_reissued_at":"2026-05-18T02:20:12.292132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:12.292132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00734","source_version":2,"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-18T02:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8YOWVfaQ219FgC4zoBbDj9y4vGYD6uzbSPluMFoU24gz1lbfMsWvUTdAhj2rCmBOqlYL8QlCzjhY+xWbl3TMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:00:30.522743Z"},"content_sha256":"e899a194558fe95a9fc3d9362842faec4d9dd839154ab423815f4e32e8f0d41f","schema_version":"1.0","event_id":"sha256:e899a194558fe95a9fc3d9362842faec4d9dd839154ab423815f4e32e8f0d41f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MCLZER5RPZBINPHOCHE6HXQFDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sum of Squares Lower Bounds from Pairwise Independence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Boaz Barak, Pravesh Kothari, Siu On Chan","submitted_at":"2015-01-04T23:27:12Z","abstract_excerpt":"We prove that for every $\\epsilon>0$ and predicate $P:\\{0,1\\}^k\\rightarrow \\{0,1\\}$ that supports a pairwise independent distribution, there exists an instance $\\mathcal{I}$ of the $\\mathsf{Max}P$ constraint satisfaction problem on $n$ variables such that no assignment can satisfy more than a $\\tfrac{|P^{-1}(1)|}{2^k}+\\epsilon$ fraction of $\\mathcal{I}$'s constraints but the degree $\\Omega(n)$ Sum of Squares semidefinite programming hierarchy cannot certify that $\\mathcal{I}$ is unsatisfiable. Similar results were previously only known for weaker hierarchies."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00734","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"},"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-18T02:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L4FXJTaYnqqVjcK7EJRH0EIJwV01MvQpwI7jurLqo10H38OpBzFJh1lLqXvXi7HaJsWaqBNhMvlsHrKgUQVwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:00:30.523491Z"},"content_sha256":"4fdb5dc0a8cff124d82eaf1a3b53eb6ce4b6309f9704525671c4db7818b44550","schema_version":"1.0","event_id":"sha256:4fdb5dc0a8cff124d82eaf1a3b53eb6ce4b6309f9704525671c4db7818b44550"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO/bundle.json","state_url":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MCLZER5RPZBINPHOCHE6HXQFDO/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-09T05:00:30Z","links":{"resolver":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO","bundle":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO/bundle.json","state":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MCLZER5RPZBINPHOCHE6HXQFDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MCLZER5RPZBINPHOCHE6HXQFDO","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":"b520abf252bbbaa02b82122c1ac90ac80edc8941ff72989821289da87a9030b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-04T23:27:12Z","title_canon_sha256":"b6ccee5c0c279513748022cd172e9b887ab32cf1a4d86f80a62d1b02bcbcc143"},"schema_version":"1.0","source":{"id":"1501.00734","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00734","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00734v2","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00734","created_at":"2026-05-18T02:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"MCLZER5RPZBI","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MCLZER5RPZBINPHO","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MCLZER5R","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:4fdb5dc0a8cff124d82eaf1a3b53eb6ce4b6309f9704525671c4db7818b44550","target":"graph","created_at":"2026-05-18T02:20:12Z","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":"We prove that for every $\\epsilon>0$ and predicate $P:\\{0,1\\}^k\\rightarrow \\{0,1\\}$ that supports a pairwise independent distribution, there exists an instance $\\mathcal{I}$ of the $\\mathsf{Max}P$ constraint satisfaction problem on $n$ variables such that no assignment can satisfy more than a $\\tfrac{|P^{-1}(1)|}{2^k}+\\epsilon$ fraction of $\\mathcal{I}$'s constraints but the degree $\\Omega(n)$ Sum of Squares semidefinite programming hierarchy cannot certify that $\\mathcal{I}$ is unsatisfiable. Similar results were previously only known for weaker hierarchies.","authors_text":"Boaz Barak, Pravesh Kothari, Siu On Chan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-04T23:27:12Z","title":"Sum of Squares Lower Bounds from Pairwise Independence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00734","kind":"arxiv","version":2},"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:e899a194558fe95a9fc3d9362842faec4d9dd839154ab423815f4e32e8f0d41f","target":"record","created_at":"2026-05-18T02:20:12Z","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":"b520abf252bbbaa02b82122c1ac90ac80edc8941ff72989821289da87a9030b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-04T23:27:12Z","title_canon_sha256":"b6ccee5c0c279513748022cd172e9b887ab32cf1a4d86f80a62d1b02bcbcc143"},"schema_version":"1.0","source":{"id":"1501.00734","kind":"arxiv","version":2}},"canonical_sha256":"60979247b17e4286bcee11c9e3de051b97e8a344eb03e25fd6e057e5c8f966dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60979247b17e4286bcee11c9e3de051b97e8a344eb03e25fd6e057e5c8f966dc","first_computed_at":"2026-05-18T02:20:12.292132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:12.292132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q/lnW0bBZhG8hkm4EZiUB6DvZr3GXypvBZPaEMZKyElR4WIaFncYvxBq3wJoVWAMEBmkbjK7Iw6Ix4om3XO+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:12.292607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00734","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e899a194558fe95a9fc3d9362842faec4d9dd839154ab423815f4e32e8f0d41f","sha256:4fdb5dc0a8cff124d82eaf1a3b53eb6ce4b6309f9704525671c4db7818b44550"],"state_sha256":"57e53b1355a1abf3e85533e6bd029716a06a56f768b1ba991dfac3c0490bc386"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0tJNQm6PdpbwXQNEuQV2jVtsbacMHcGE1N/JQ3opa5lZq7tvZJn1slWhzhyr9ZyTxOTT8bdzDwNMSETVh7ZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:00:30.527333Z","bundle_sha256":"ea513521403188dfa2fa05e5053122d467134f32116dfeae429adbd4c7c2f06b"}}