{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4DNRRTGFFNDFJQ6Y6KFNW7VFEH","short_pith_number":"pith:4DNRRTGF","canonical_record":{"source":{"id":"1507.05136","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-18T00:32:28Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"00cd18146462292a6511fcb337f07029fb010dadf2f8e47560328991ecc7b06b","abstract_canon_sha256":"00a6a097f3575c4cffec366d931eb8abb1daed878740e86294d8877759ef648d"},"schema_version":"1.0"},"canonical_sha256":"e0db18ccc52b4654c3d8f28adb7ea521e0411b225052d770122c56b1fa690503","source":{"kind":"arxiv","id":"1507.05136","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05136","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05136v3","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05136","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"pith_short_12","alias_value":"4DNRRTGFFNDF","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4DNRRTGFFNDFJQ6Y","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4DNRRTGF","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4DNRRTGFFNDFJQ6Y6KFNW7VFEH","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05136","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-18T00:32:28Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"00cd18146462292a6511fcb337f07029fb010dadf2f8e47560328991ecc7b06b","abstract_canon_sha256":"00a6a097f3575c4cffec366d931eb8abb1daed878740e86294d8877759ef648d"},"schema_version":"1.0"},"canonical_sha256":"e0db18ccc52b4654c3d8f28adb7ea521e0411b225052d770122c56b1fa690503","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:11.967132Z","signature_b64":"3N/VLvQrEzxJ9OJPFrj7uZ5wo1K7SOypj1wcpujQQvucQ+A3IWl1KU/XEJGIMR62n7bJa+jIiCdudrIuLkCPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0db18ccc52b4654c3d8f28adb7ea521e0411b225052d770122c56b1fa690503","last_reissued_at":"2026-05-18T01:19:11.966508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:11.966508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05136","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-18T01:19:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXolKGw3waRwDnfvmaJO88BEcO0S8bqwn8fMMA7G3J1480QClp09t0hx6SaOtEtijg07lZotl2xko/K8YV67Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:29:35.523803Z"},"content_sha256":"d44efe746fb2c6781d7b6ccacdd2186d3f1cf4f1b83be7205433b1740e01ddce","schema_version":"1.0","event_id":"sha256:d44efe746fb2c6781d7b6ccacdd2186d3f1cf4f1b83be7205433b1740e01ddce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4DNRRTGFFNDFJQ6Y6KFNW7VFEH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Prasad Raghavendra, Tselil Schramm","submitted_at":"2015-07-18T00:32:28Z","abstract_excerpt":"We give a lower bound of $\\tilde{\\Omega}(\\sqrt{n})$ for the degree-4 Sum-of-Squares SDP relaxation for the planted clique problem. Specifically, we show that on an Erd\\\"os-R\\'enyi graph $G(n,\\tfrac{1}{2})$, with high probability there is a feasible point for the degree-4 SOS relaxation of the clique problem with an objective value of $\\tilde{\\Omega}(\\sqrt{n})$, so that the program cannot distinguish between a random graph and a random graph with a planted clique of size $\\tilde{O}(\\sqrt{n})$. This bound is tight.\n  We build on the works of Deshpande and Montanari and Meka et al., who give lowe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05136","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-18T01:19:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NjGfDJLJlXQVtESc4MU6yuLK3Gya31YtppTzFRSKqgZR3S8LTWQpN+1qX8WLv3UZ93FpyXqdJpRkSKM3P+HhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:29:35.524593Z"},"content_sha256":"14c44dc6fd32d4b91bf5a34153730e8a8e7786254fe9a559ea7c42c7eeec3f50","schema_version":"1.0","event_id":"sha256:14c44dc6fd32d4b91bf5a34153730e8a8e7786254fe9a559ea7c42c7eeec3f50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/bundle.json","state_url":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/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-06-05T00:29:35Z","links":{"resolver":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH","bundle":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/bundle.json","state":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4DNRRTGFFNDFJQ6Y6KFNW7VFEH","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":"00a6a097f3575c4cffec366d931eb8abb1daed878740e86294d8877759ef648d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-18T00:32:28Z","title_canon_sha256":"00cd18146462292a6511fcb337f07029fb010dadf2f8e47560328991ecc7b06b"},"schema_version":"1.0","source":{"id":"1507.05136","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05136","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05136v3","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05136","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"pith_short_12","alias_value":"4DNRRTGFFNDF","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4DNRRTGFFNDFJQ6Y","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4DNRRTGF","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:14c44dc6fd32d4b91bf5a34153730e8a8e7786254fe9a559ea7c42c7eeec3f50","target":"graph","created_at":"2026-05-18T01:19:11Z","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":"We give a lower bound of $\\tilde{\\Omega}(\\sqrt{n})$ for the degree-4 Sum-of-Squares SDP relaxation for the planted clique problem. Specifically, we show that on an Erd\\\"os-R\\'enyi graph $G(n,\\tfrac{1}{2})$, with high probability there is a feasible point for the degree-4 SOS relaxation of the clique problem with an objective value of $\\tilde{\\Omega}(\\sqrt{n})$, so that the program cannot distinguish between a random graph and a random graph with a planted clique of size $\\tilde{O}(\\sqrt{n})$. This bound is tight.\n  We build on the works of Deshpande and Montanari and Meka et al., who give lowe","authors_text":"Prasad Raghavendra, Tselil Schramm","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-18T00:32:28Z","title":"Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05136","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:d44efe746fb2c6781d7b6ccacdd2186d3f1cf4f1b83be7205433b1740e01ddce","target":"record","created_at":"2026-05-18T01:19:11Z","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":"00a6a097f3575c4cffec366d931eb8abb1daed878740e86294d8877759ef648d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-18T00:32:28Z","title_canon_sha256":"00cd18146462292a6511fcb337f07029fb010dadf2f8e47560328991ecc7b06b"},"schema_version":"1.0","source":{"id":"1507.05136","kind":"arxiv","version":3}},"canonical_sha256":"e0db18ccc52b4654c3d8f28adb7ea521e0411b225052d770122c56b1fa690503","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0db18ccc52b4654c3d8f28adb7ea521e0411b225052d770122c56b1fa690503","first_computed_at":"2026-05-18T01:19:11.966508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:11.966508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3N/VLvQrEzxJ9OJPFrj7uZ5wo1K7SOypj1wcpujQQvucQ+A3IWl1KU/XEJGIMR62n7bJa+jIiCdudrIuLkCPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:11.967132Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05136","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d44efe746fb2c6781d7b6ccacdd2186d3f1cf4f1b83be7205433b1740e01ddce","sha256:14c44dc6fd32d4b91bf5a34153730e8a8e7786254fe9a559ea7c42c7eeec3f50"],"state_sha256":"1da0ca1aeda5b579e763dcc72811be7988e546a414fde982c195d4fcef70cdc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ZqcYT6XobPSXktrhTI/Nggw0BRyrwhZ/JPiMI45iihWAn98Jxv/UsYpGceFYmBE3t+OXZ1kFp8n8dnpC5bGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:29:35.528380Z","bundle_sha256":"016aa90689874238e1bfdb7fd5fd85c2f30effdd0f7efd6539f21c9da2da3b84"}}