{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LHQIWS7R67EDHPDMCSVDBMAN7C","short_pith_number":"pith:LHQIWS7R","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"},"canonical_sha256":"59e08b4bf1f7c833bc6c14aa30b00df8af1d7cc5c3b79a5b5249a890a0d704e4","source":{"kind":"arxiv","id":"1503.06447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06447","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06447v1","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06447","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"pith_short_12","alias_value":"LHQIWS7R67ED","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LHQIWS7R67EDHPDM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LHQIWS7R","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LHQIWS7R67EDHPDMCSVDBMAN7C","target":"record","payload":{"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"},"canonical_sha256":"59e08b4bf1f7c833bc6c14aa30b00df8af1d7cc5c3b79a5b5249a890a0d704e4","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"},"source_kind":"arxiv","source_id":"1503.06447","source_version":1,"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-18T02:20:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1A5E8GG3JfWIaxoWklD71qUfKeRgKrgRDPgJ6mW/439Mkqv1GmW73a2k4XNTLBYe2dCLXpQCWQqiX+QDaWRWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:24:37.783165Z"},"content_sha256":"a4f241e1d37858563172ed14818450045b966bacf9ac5e8d50ff15f6b5f7a4c6","schema_version":"1.0","event_id":"sha256:a4f241e1d37858563172ed14818450045b966bacf9ac5e8d50ff15f6b5f7a4c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LHQIWS7R67EDHPDMCSVDBMAN7C","target":"graph","payload":{"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"},"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-18T02:20:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGBDnL6Rf+t0GMFZNsHNC9qJ1OyYHm/qAiEveo2oI42gIMawoC0KLefh/v+R/Ug9ruGvLdu9Tjti+QSYfwJjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:24:37.783786Z"},"content_sha256":"5cf7f8e7d7611ffd9fc4aed7a1debfd804471674b99c0f74e5b29ec4a76a8c89","schema_version":"1.0","event_id":"sha256:5cf7f8e7d7611ffd9fc4aed7a1debfd804471674b99c0f74e5b29ec4a76a8c89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C/bundle.json","state_url":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LHQIWS7R67EDHPDMCSVDBMAN7C/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-28T07:24:37Z","links":{"resolver":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C","bundle":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C/bundle.json","state":"https://pith.science/pith/LHQIWS7R67EDHPDMCSVDBMAN7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LHQIWS7R67EDHPDMCSVDBMAN7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LHQIWS7R67EDHPDMCSVDBMAN7C","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":"8561bd6dd9d5b478b4b07fcf43a093f3df0759512b258e0ca88b8186b1baa930","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-22T17:48:28Z","title_canon_sha256":"02b94ad73d88c94eaf4d1fcb07f4d8a37bc8b4ecbac93648851c48de7abff36d"},"schema_version":"1.0","source":{"id":"1503.06447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06447","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06447v1","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06447","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"pith_short_12","alias_value":"LHQIWS7R67ED","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LHQIWS7R67EDHPDM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LHQIWS7R","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:5cf7f8e7d7611ffd9fc4aed7a1debfd804471674b99c0f74e5b29ec4a76a8c89","target":"graph","created_at":"2026-05-18T02:20:38Z","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 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 ","authors_text":"Aaron Potechin, 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":"2015-03-22T17:48:28Z","title":"Sum-of-squares lower bounds for planted clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06447","kind":"arxiv","version":1},"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:a4f241e1d37858563172ed14818450045b966bacf9ac5e8d50ff15f6b5f7a4c6","target":"record","created_at":"2026-05-18T02:20:38Z","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":"8561bd6dd9d5b478b4b07fcf43a093f3df0759512b258e0ca88b8186b1baa930","cross_cats_sorted":["cs.DS","math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-22T17:48:28Z","title_canon_sha256":"02b94ad73d88c94eaf4d1fcb07f4d8a37bc8b4ecbac93648851c48de7abff36d"},"schema_version":"1.0","source":{"id":"1503.06447","kind":"arxiv","version":1}},"canonical_sha256":"59e08b4bf1f7c833bc6c14aa30b00df8af1d7cc5c3b79a5b5249a890a0d704e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59e08b4bf1f7c833bc6c14aa30b00df8af1d7cc5c3b79a5b5249a890a0d704e4","first_computed_at":"2026-05-18T02:20:38.379790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:38.379790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g+W0uxWPdk9Aowp2fl1qCbowstYWY4o7axMTEHMRn8xBhxZg8wl9P2q09iI3Pl6AKYZQTtLN13K4K0BjZaDiBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:38.380606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4f241e1d37858563172ed14818450045b966bacf9ac5e8d50ff15f6b5f7a4c6","sha256:5cf7f8e7d7611ffd9fc4aed7a1debfd804471674b99c0f74e5b29ec4a76a8c89"],"state_sha256":"9dd678e1a28d88a3efbf754bf08ba002f6e7d28216ef4973037cb69958ba971d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8gmK88tvP6n79aEOnWA0u2CXVo3Ei7AXqA/7+zUgIv6ehm4qwaJBklyi/vrzOQld47MfWhWp3uhT/qYQhBywAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:24:37.786087Z","bundle_sha256":"41f41ede5558ed653a635ca9f1cfa582796830622652c995c898ae5f2d904cd3"}}