{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MCLZER5RPZBINPHOCHE6HXQFDO","short_pith_number":"pith:MCLZER5R","schema_version":"1.0","canonical_sha256":"60979247b17e4286bcee11c9e3de051b97e8a344eb03e25fd6e057e5c8f966dc","source":{"kind":"arxiv","id":"1501.00734","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.00734","created_at":"2026-05-18T02:20:12.292209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00734v2","created_at":"2026-05-18T02:20:12.292209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00734","created_at":"2026-05-18T02:20:12.292209+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCLZER5RPZBI","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCLZER5RPZBINPHO","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCLZER5R","created_at":"2026-05-18T12:29:32.376354+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/MCLZER5RPZBINPHOCHE6HXQFDO","json":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO.json","graph_json":"https://pith.science/api/pith-number/MCLZER5RPZBINPHOCHE6HXQFDO/graph.json","events_json":"https://pith.science/api/pith-number/MCLZER5RPZBINPHOCHE6HXQFDO/events.json","paper":"https://pith.science/paper/MCLZER5R"},"agent_actions":{"view_html":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO","download_json":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO.json","view_paper":"https://pith.science/paper/MCLZER5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00734&json=true","fetch_graph":"https://pith.science/api/pith-number/MCLZER5RPZBINPHOCHE6HXQFDO/graph.json","fetch_events":"https://pith.science/api/pith-number/MCLZER5RPZBINPHOCHE6HXQFDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO/action/storage_attestation","attest_author":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO/action/author_attestation","sign_citation":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO/action/citation_signature","submit_replication":"https://pith.science/pith/MCLZER5RPZBINPHOCHE6HXQFDO/action/replication_record"}},"created_at":"2026-05-18T02:20:12.292209+00:00","updated_at":"2026-05-18T02:20:12.292209+00:00"}