{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EE23OEEQ645XTJ4AKEGDDKZTHM","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":"61417c37145fbc2e9685c5a9fda51784fbc98845617cc8fd7f734a61b383b8a6","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-29T15:25:24Z","title_canon_sha256":"0cfb35913a772fd22fd0ef0abc97b53bbb45f3e63112709764aaba45d0effeec"},"schema_version":"1.0","source":{"id":"1307.7615","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7615","created_at":"2026-05-18T03:07:13Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7615v3","created_at":"2026-05-18T03:07:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7615","created_at":"2026-05-18T03:07:13Z"},{"alias_kind":"pith_short_12","alias_value":"EE23OEEQ645X","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EE23OEEQ645XTJ4A","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EE23OEEQ","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:f546ee6227d71a1920c9ceedee17e28d742494c24a13711826c2e7047b5bda0c","target":"graph","created_at":"2026-05-18T03:07:13Z","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":"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","authors_text":"Avi Wigderson, Raghu Meka","cross_cats":["cs.DS","math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-29T15:25:24Z","title":"Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7615","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:39484f2b1481aaa45cce5dde03dc41f02ef74d79c58152ae87e3712a5574b8ac","target":"record","created_at":"2026-05-18T03:07:13Z","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":"61417c37145fbc2e9685c5a9fda51784fbc98845617cc8fd7f734a61b383b8a6","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-07-29T15:25:24Z","title_canon_sha256":"0cfb35913a772fd22fd0ef0abc97b53bbb45f3e63112709764aaba45d0effeec"},"schema_version":"1.0","source":{"id":"1307.7615","kind":"arxiv","version":3}},"canonical_sha256":"2135b71090f73b79a780510c31ab333b04dcca98fd89f032205df05176784001","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2135b71090f73b79a780510c31ab333b04dcca98fd89f032205df05176784001","first_computed_at":"2026-05-18T03:07:13.919449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:13.919449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+gYYqfAbLXCemKCjB1mMD+YjpDb5t6ixCn6Xty5TCl/adhJA2sjjwPrwU8rJI1PWlS1EjhV7XfFGpkRy6lsYDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:13.919903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7615","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39484f2b1481aaa45cce5dde03dc41f02ef74d79c58152ae87e3712a5574b8ac","sha256:f546ee6227d71a1920c9ceedee17e28d742494c24a13711826c2e7047b5bda0c"],"state_sha256":"aa425e5393043d69b2b3142a23ea3d6294ae0882d97443e3ef134aae4c6ea145"}