{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EE23OEEQ645XTJ4AKEGDDKZTHM","short_pith_number":"pith:EE23OEEQ","schema_version":"1.0","canonical_sha256":"2135b71090f73b79a780510c31ab333b04dcca98fd89f032205df05176784001","source":{"kind":"arxiv","id":"1307.7615","version":3},"attestation_state":"computed","paper":{"title":"Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.PR"],"primary_cat":"cs.CC","authors_text":"Avi Wigderson, Raghu Meka","submitted_at":"2013-07-29T15:25:24Z","abstract_excerpt":"Finding cliques in random graphs and the closely related \"planted\" clique variant, where a clique of size t is planted in a random G(n,1/2) graph, have been the focus of substantial study in algorithm design. Despite much effort, the best known polynomial-time algorithms only solve the problem for t = Theta(sqrt(n)). Here we show that beating sqrt(n) would require substantially new algorithmic ideas, by proving a lower bound for the problem in the sum-of-squares (or Lasserre) hierarchy, the most powerful class of semi-definite programming algorithms we know of: r rounds of the sum-of-squares h"},"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":"1307.7615","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-29T15:25:24Z","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"title_canon_sha256":"0cfb35913a772fd22fd0ef0abc97b53bbb45f3e63112709764aaba45d0effeec","abstract_canon_sha256":"61417c37145fbc2e9685c5a9fda51784fbc98845617cc8fd7f734a61b383b8a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:13.919903Z","signature_b64":"+gYYqfAbLXCemKCjB1mMD+YjpDb5t6ixCn6Xty5TCl/adhJA2sjjwPrwU8rJI1PWlS1EjhV7XfFGpkRy6lsYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2135b71090f73b79a780510c31ab333b04dcca98fd89f032205df05176784001","last_reissued_at":"2026-05-18T03:07:13.919449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:13.919449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","math.PR"],"primary_cat":"cs.CC","authors_text":"Avi Wigderson, Raghu Meka","submitted_at":"2013-07-29T15:25:24Z","abstract_excerpt":"Finding cliques in random graphs and the closely related \"planted\" clique variant, where a clique of size t is planted in a random G(n,1/2) graph, have been the focus of substantial study in algorithm design. Despite much effort, the best known polynomial-time algorithms only solve the problem for t = Theta(sqrt(n)). Here we show that beating sqrt(n) would require substantially new algorithmic ideas, by proving a lower bound for the problem in the sum-of-squares (or Lasserre) hierarchy, the most powerful class of semi-definite programming algorithms we know of: r rounds of the sum-of-squares h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7615","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":"1307.7615","created_at":"2026-05-18T03:07:13.919514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7615v3","created_at":"2026-05-18T03:07:13.919514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7615","created_at":"2026-05-18T03:07:13.919514+00:00"},{"alias_kind":"pith_short_12","alias_value":"EE23OEEQ645X","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EE23OEEQ645XTJ4A","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EE23OEEQ","created_at":"2026-05-18T12:27:43.054852+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/EE23OEEQ645XTJ4AKEGDDKZTHM","json":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM.json","graph_json":"https://pith.science/api/pith-number/EE23OEEQ645XTJ4AKEGDDKZTHM/graph.json","events_json":"https://pith.science/api/pith-number/EE23OEEQ645XTJ4AKEGDDKZTHM/events.json","paper":"https://pith.science/paper/EE23OEEQ"},"agent_actions":{"view_html":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM","download_json":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM.json","view_paper":"https://pith.science/paper/EE23OEEQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7615&json=true","fetch_graph":"https://pith.science/api/pith-number/EE23OEEQ645XTJ4AKEGDDKZTHM/graph.json","fetch_events":"https://pith.science/api/pith-number/EE23OEEQ645XTJ4AKEGDDKZTHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM/action/storage_attestation","attest_author":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM/action/author_attestation","sign_citation":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM/action/citation_signature","submit_replication":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM/action/replication_record"}},"created_at":"2026-05-18T03:07:13.919514+00:00","updated_at":"2026-05-18T03:07:13.919514+00:00"}