{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EE23OEEQ645XTJ4AKEGDDKZTHM","short_pith_number":"pith:EE23OEEQ","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"},"canonical_sha256":"2135b71090f73b79a780510c31ab333b04dcca98fd89f032205df05176784001","source":{"kind":"arxiv","id":"1307.7615","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EE23OEEQ645XTJ4AKEGDDKZTHM","target":"record","payload":{"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"},"canonical_sha256":"2135b71090f73b79a780510c31ab333b04dcca98fd89f032205df05176784001","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"},"source_kind":"arxiv","source_id":"1307.7615","source_version":3,"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-18T03:07:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6w1JQitHlNOXUFQQhUo0KZxYFU97/Go3zi0e10gkv6sMUrdNT1/t7ikwmC6WsdkK5ra22e7QpDbxaGZ1P8JCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:33:42.483682Z"},"content_sha256":"39484f2b1481aaa45cce5dde03dc41f02ef74d79c58152ae87e3712a5574b8ac","schema_version":"1.0","event_id":"sha256:39484f2b1481aaa45cce5dde03dc41f02ef74d79c58152ae87e3712a5574b8ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EE23OEEQ645XTJ4AKEGDDKZTHM","target":"graph","payload":{"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"},"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-18T03:07:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FTegA4LoRZ6lPDgNcIWB2qkgLjhwJjAQ/IFIt9dhQTHfoax04EzJzdIjkm5jUsz4acPsGwx8kGMTO9GoWFALAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:33:42.484029Z"},"content_sha256":"f546ee6227d71a1920c9ceedee17e28d742494c24a13711826c2e7047b5bda0c","schema_version":"1.0","event_id":"sha256:f546ee6227d71a1920c9ceedee17e28d742494c24a13711826c2e7047b5bda0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM/bundle.json","state_url":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EE23OEEQ645XTJ4AKEGDDKZTHM/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-05-28T22:33:42Z","links":{"resolver":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM","bundle":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM/bundle.json","state":"https://pith.science/pith/EE23OEEQ645XTJ4AKEGDDKZTHM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EE23OEEQ645XTJ4AKEGDDKZTHM/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4WH8++qoCRGDzNuW2GTCT6lCv57a+uavq21moAb5W5fF/xJF3F3U6UFFAAVNn5dRKjm8Kzxi5KV174oKYvDxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:33:42.485955Z","bundle_sha256":"c89aa125268f60771d1fafec939cd29cf4d93720ac8f4cfc54ed6036b4be7ceb"}}