{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4DNRRTGFFNDFJQ6Y6KFNW7VFEH","short_pith_number":"pith:4DNRRTGF","schema_version":"1.0","canonical_sha256":"e0db18ccc52b4654c3d8f28adb7ea521e0411b225052d770122c56b1fa690503","source":{"kind":"arxiv","id":"1507.05136","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.05136","created_at":"2026-05-18T01:19:11.966592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05136v3","created_at":"2026-05-18T01:19:11.966592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05136","created_at":"2026-05-18T01:19:11.966592+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DNRRTGFFNDF","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DNRRTGFFNDFJQ6Y","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DNRRTGF","created_at":"2026-05-18T12:29:05.191682+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/4DNRRTGFFNDFJQ6Y6KFNW7VFEH","json":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH.json","graph_json":"https://pith.science/api/pith-number/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/graph.json","events_json":"https://pith.science/api/pith-number/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/events.json","paper":"https://pith.science/paper/4DNRRTGF"},"agent_actions":{"view_html":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH","download_json":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH.json","view_paper":"https://pith.science/paper/4DNRRTGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05136&json=true","fetch_graph":"https://pith.science/api/pith-number/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/graph.json","fetch_events":"https://pith.science/api/pith-number/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/action/storage_attestation","attest_author":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/action/author_attestation","sign_citation":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/action/citation_signature","submit_replication":"https://pith.science/pith/4DNRRTGFFNDFJQ6Y6KFNW7VFEH/action/replication_record"}},"created_at":"2026-05-18T01:19:11.966592+00:00","updated_at":"2026-05-18T01:19:11.966592+00:00"}