{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LHQIWS7R67EDHPDMCSVDBMAN7C","short_pith_number":"pith:LHQIWS7R","schema_version":"1.0","canonical_sha256":"59e08b4bf1f7c833bc6c14aa30b00df8af1d7cc5c3b79a5b5249a890a0d704e4","source":{"kind":"arxiv","id":"1503.06447","version":1},"attestation_state":"computed","paper":{"title":"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":"Aaron Potechin, Avi Wigderson, Raghu Meka","submitted_at":"2015-03-22T17:48:28Z","abstract_excerpt":"Finding cliques in random graphs and the closely related \"planted\" clique variant, where a clique of size k 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 k ~ sqrt(n).\n  In this paper we study the complexity of the planted clique problem under algorithms from the Sum-of-squares hierarchy. We prove the first average case lower bound for this model: for almost all graphs in G(n,1/2), r rounds of the SOS hierarchy cannot find a planted k-clique unless k "},"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":"1503.06447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-22T17:48:28Z","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"title_canon_sha256":"02b94ad73d88c94eaf4d1fcb07f4d8a37bc8b4ecbac93648851c48de7abff36d","abstract_canon_sha256":"8561bd6dd9d5b478b4b07fcf43a093f3df0759512b258e0ca88b8186b1baa930"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:38.380606Z","signature_b64":"g+W0uxWPdk9Aowp2fl1qCbowstYWY4o7axMTEHMRn8xBhxZg8wl9P2q09iI3Pl6AKYZQTtLN13K4K0BjZaDiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59e08b4bf1f7c833bc6c14aa30b00df8af1d7cc5c3b79a5b5249a890a0d704e4","last_reissued_at":"2026-05-18T02:20:38.379790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:38.379790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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":"Aaron Potechin, Avi Wigderson, Raghu Meka","submitted_at":"2015-03-22T17:48:28Z","abstract_excerpt":"Finding cliques in random graphs and the closely related \"planted\" clique variant, where a clique of size k 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 k ~ sqrt(n).\n  In this paper we study the complexity of the planted clique problem under algorithms from the Sum-of-squares hierarchy. We prove the first average case lower bound for this model: for almost all graphs in G(n,1/2), r rounds of the SOS hierarchy cannot find a planted k-clique unless k "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06447","kind":"arxiv","version":1},"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":"1503.06447","created_at":"2026-05-18T02:20:38.379920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06447v1","created_at":"2026-05-18T02:20:38.379920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06447","created_at":"2026-05-18T02:20:38.379920+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHQIWS7R67ED","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHQIWS7R67EDHPDM","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHQIWS7R","created_at":"2026-05-18T12:29:29.992203+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/LHQIWS7R67EDHPDMCSVDBMAN7C","json":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C.json","graph_json":"https://pith.science/api/pith-number/LHQIWS7R67EDHPDMCSVDBMAN7C/graph.json","events_json":"https://pith.science/api/pith-number/LHQIWS7R67EDHPDMCSVDBMAN7C/events.json","paper":"https://pith.science/paper/LHQIWS7R"},"agent_actions":{"view_html":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C","download_json":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C.json","view_paper":"https://pith.science/paper/LHQIWS7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06447&json=true","fetch_graph":"https://pith.science/api/pith-number/LHQIWS7R67EDHPDMCSVDBMAN7C/graph.json","fetch_events":"https://pith.science/api/pith-number/LHQIWS7R67EDHPDMCSVDBMAN7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C/action/storage_attestation","attest_author":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C/action/author_attestation","sign_citation":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C/action/citation_signature","submit_replication":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C/action/replication_record"}},"created_at":"2026-05-18T02:20:38.379920+00:00","updated_at":"2026-05-18T02:20:38.379920+00:00"}