{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:32T6SPOGEI532SYEXYAZFIUHIV","short_pith_number":"pith:32T6SPOG","canonical_record":{"source":{"id":"1604.03084","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-11T19:49:03Z","cross_cats_sorted":[],"title_canon_sha256":"292f8b6cc16b27ffe0199c437dae07c4e9a581e2c2b76a51423fc5af5ca8d185","abstract_canon_sha256":"608baa23ea45dd773f9c60d09413821b0145e68bcdbabde54a648ef1b494cfa2"},"schema_version":"1.0"},"canonical_sha256":"dea7e93dc6223bbd4b04be0192a287456a673c10264db2c87910d553705be9c9","source":{"kind":"arxiv","id":"1604.03084","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03084","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03084v2","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03084","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"32T6SPOGEI53","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"32T6SPOGEI532SYE","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"32T6SPOG","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:32T6SPOGEI532SYEXYAZFIUHIV","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03084","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-11T19:49:03Z","cross_cats_sorted":[],"title_canon_sha256":"292f8b6cc16b27ffe0199c437dae07c4e9a581e2c2b76a51423fc5af5ca8d185","abstract_canon_sha256":"608baa23ea45dd773f9c60d09413821b0145e68bcdbabde54a648ef1b494cfa2"},"schema_version":"1.0"},"canonical_sha256":"dea7e93dc6223bbd4b04be0192a287456a673c10264db2c87910d553705be9c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:16.499480Z","signature_b64":"/k8WCWvviJG0iUeTJ/r7pRlGxTuWJ1U+eeGXXMa5RG22qMB/nX661upoM49caJulz2AXSXMHUYfSCHE7dkXVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dea7e93dc6223bbd4b04be0192a287456a673c10264db2c87910d553705be9c9","last_reissued_at":"2026-05-18T01:17:16.498387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:16.498387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03084","source_version":2,"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:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aVU99WXGAnjCHqY8RMTpKchFh8Np9edCnoVLGsHYndkIA+0noLDrloLqaAsOYwmG7PhJssmqOZuJ/v9IBqSoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:33:07.640584Z"},"content_sha256":"87a8e0897bb5a93319e0377ccddc5caf0c533c77d27f08bd3f6716a8ad3e8e7a","schema_version":"1.0","event_id":"sha256:87a8e0897bb5a93319e0377ccddc5caf0c533c77d27f08bd3f6716a8ad3e8e7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:32T6SPOGEI532SYEXYAZFIUHIV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aaron Potechin, Ankur Moitra, Boaz Barak, Jonathan Kelner, Pravesh K. Kothari, Samuel B. Hopkins","submitted_at":"2016-04-11T19:49:03Z","abstract_excerpt":"We prove that with high probability over the choice of a random graph $G$ from the Erd\\H{o}s-R\\'enyi distribution $G(n,1/2)$, the $n^{O(d)}$-time degree $d$ Sum-of-Squares semidefinite programming relaxation for the clique problem will give a value of at least $n^{1/2-c(d/\\log n)^{1/2}}$ for some constant $c>0$. This yields a nearly tight $n^{1/2 - o(1)}$ bound on the value of this program for any degree $d = o(\\log n)$. Moreover we introduce a new framework that we call \\emph{pseudo-calibration} to construct Sum of Squares lower bounds. This framework is inspired by taking a computational ana"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03084","kind":"arxiv","version":2},"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:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhK/yIZGblO7YjwZw7JZp7e3h2kzM/6ssbXZe7kMiE1yfE2nuMsh3qDp1Vvbh3TM9UJNFqHa7OtF1USQveJqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:33:07.641272Z"},"content_sha256":"0ee8cf856aa1cd328a8f4270cc881c9c200f64bb995ce59958bff6215b1e4fa7","schema_version":"1.0","event_id":"sha256:0ee8cf856aa1cd328a8f4270cc881c9c200f64bb995ce59958bff6215b1e4fa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32T6SPOGEI532SYEXYAZFIUHIV/bundle.json","state_url":"https://pith.science/pith/32T6SPOGEI532SYEXYAZFIUHIV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32T6SPOGEI532SYEXYAZFIUHIV/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-07T18:33:07Z","links":{"resolver":"https://pith.science/pith/32T6SPOGEI532SYEXYAZFIUHIV","bundle":"https://pith.science/pith/32T6SPOGEI532SYEXYAZFIUHIV/bundle.json","state":"https://pith.science/pith/32T6SPOGEI532SYEXYAZFIUHIV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32T6SPOGEI532SYEXYAZFIUHIV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:32T6SPOGEI532SYEXYAZFIUHIV","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":"608baa23ea45dd773f9c60d09413821b0145e68bcdbabde54a648ef1b494cfa2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-11T19:49:03Z","title_canon_sha256":"292f8b6cc16b27ffe0199c437dae07c4e9a581e2c2b76a51423fc5af5ca8d185"},"schema_version":"1.0","source":{"id":"1604.03084","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03084","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03084v2","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03084","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"32T6SPOGEI53","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"32T6SPOGEI532SYE","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"32T6SPOG","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:0ee8cf856aa1cd328a8f4270cc881c9c200f64bb995ce59958bff6215b1e4fa7","target":"graph","created_at":"2026-05-18T01:17:16Z","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 prove that with high probability over the choice of a random graph $G$ from the Erd\\H{o}s-R\\'enyi distribution $G(n,1/2)$, the $n^{O(d)}$-time degree $d$ Sum-of-Squares semidefinite programming relaxation for the clique problem will give a value of at least $n^{1/2-c(d/\\log n)^{1/2}}$ for some constant $c>0$. This yields a nearly tight $n^{1/2 - o(1)}$ bound on the value of this program for any degree $d = o(\\log n)$. Moreover we introduce a new framework that we call \\emph{pseudo-calibration} to construct Sum of Squares lower bounds. This framework is inspired by taking a computational ana","authors_text":"Aaron Potechin, Ankur Moitra, Boaz Barak, Jonathan Kelner, Pravesh K. Kothari, Samuel B. Hopkins","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-11T19:49:03Z","title":"A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03084","kind":"arxiv","version":2},"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:87a8e0897bb5a93319e0377ccddc5caf0c533c77d27f08bd3f6716a8ad3e8e7a","target":"record","created_at":"2026-05-18T01:17:16Z","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":"608baa23ea45dd773f9c60d09413821b0145e68bcdbabde54a648ef1b494cfa2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-11T19:49:03Z","title_canon_sha256":"292f8b6cc16b27ffe0199c437dae07c4e9a581e2c2b76a51423fc5af5ca8d185"},"schema_version":"1.0","source":{"id":"1604.03084","kind":"arxiv","version":2}},"canonical_sha256":"dea7e93dc6223bbd4b04be0192a287456a673c10264db2c87910d553705be9c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dea7e93dc6223bbd4b04be0192a287456a673c10264db2c87910d553705be9c9","first_computed_at":"2026-05-18T01:17:16.498387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:16.498387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/k8WCWvviJG0iUeTJ/r7pRlGxTuWJ1U+eeGXXMa5RG22qMB/nX661upoM49caJulz2AXSXMHUYfSCHE7dkXVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:16.499480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03084","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87a8e0897bb5a93319e0377ccddc5caf0c533c77d27f08bd3f6716a8ad3e8e7a","sha256:0ee8cf856aa1cd328a8f4270cc881c9c200f64bb995ce59958bff6215b1e4fa7"],"state_sha256":"55d8fd744c1db52fa2c1d8a19ff3a74a4131bebdbc4016f30f2802002060a15d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9701VDhpQHvW2G13AfJ3X+uWNWFMSpSAqaBO7wyPkD6A1rlLmo5JkPD+crF9FlsXz41MCHfzhtAOuPms4fgUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:33:07.644856Z","bundle_sha256":"9f39afff4d2ac8efd461a42207ef658d4c26e3df8927071c57348a602784d6fa"}}