{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:USFEVKS3CNENQXACWRM7HCID3U","short_pith_number":"pith:USFEVKS3","canonical_record":{"source":{"id":"1904.07174","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-04-15T16:44:00Z","cross_cats_sorted":["cs.DS","cs.LG","math.OC","math.PR","stat.TH"],"title_canon_sha256":"55b244658d5ff4c1e3e505498efb2e77e84b89f885554a08259c90f62f0b7a5b","abstract_canon_sha256":"120fd602b6bf6741a153dae136f715fa4249598c7e54615d66efd02369a9faad"},"schema_version":"1.0"},"canonical_sha256":"a48a4aaa5b1348d85c02b459f38903dd126ce4724631f43115a1881c5bbd2264","source":{"kind":"arxiv","id":"1904.07174","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07174","created_at":"2026-07-05T00:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07174v2","created_at":"2026-07-05T00:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07174","created_at":"2026-07-05T00:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"USFEVKS3CNEN","created_at":"2026-07-05T00:28:47Z"},{"alias_kind":"pith_short_16","alias_value":"USFEVKS3CNENQXAC","created_at":"2026-07-05T00:28:47Z"},{"alias_kind":"pith_short_8","alias_value":"USFEVKS3","created_at":"2026-07-05T00:28:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:USFEVKS3CNENQXACWRM7HCID3U","target":"record","payload":{"canonical_record":{"source":{"id":"1904.07174","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-04-15T16:44:00Z","cross_cats_sorted":["cs.DS","cs.LG","math.OC","math.PR","stat.TH"],"title_canon_sha256":"55b244658d5ff4c1e3e505498efb2e77e84b89f885554a08259c90f62f0b7a5b","abstract_canon_sha256":"120fd602b6bf6741a153dae136f715fa4249598c7e54615d66efd02369a9faad"},"schema_version":"1.0"},"canonical_sha256":"a48a4aaa5b1348d85c02b459f38903dd126ce4724631f43115a1881c5bbd2264","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:28:47.994876Z","signature_b64":"BUxEnO++Vck1xXHVVh0JYYHfzsJBHMcxESADVUPOvZtD4BRQxlHNqtilGDF+Hhj3hbUljemoHEQu3FLW8YU0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a48a4aaa5b1348d85c02b459f38903dd126ce4724631f43115a1881c5bbd2264","last_reissued_at":"2026-07-05T00:28:47.994371Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:28:47.994371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.07174","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-07-05T00:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jcFDxhRG0p7xxaQF6lNYOC+2jjBYM/jEot9oIAl1c3hH0GUlvgd/9wRHwzA7nKCLBG+BEHi13TjifLTo3ml/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:01:42.820412Z"},"content_sha256":"11d9e7335b1e5162c5a30d4e2d0800434d3cbb617d6b470506aaf565103b9b14","schema_version":"1.0","event_id":"sha256:11d9e7335b1e5162c5a30d4e2d0800434d3cbb617d6b470506aaf565103b9b14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:USFEVKS3CNENQXACWRM7HCID3U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.OC","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"David Gamarnik, Ilias Zadik","submitted_at":"2019-04-15T16:44:00Z","abstract_excerpt":"In this paper we study the computational-statistical gap of the planted clique problem, where a clique of size $k$ is planted in an Erdos Renyi graph $G(n,\\frac{1}{2})$ resulting in a graph $G\\left(n,\\frac{1}{2},k\\right)$. The goal is to recover the planted clique vertices by observing $G\\left(n,\\frac{1}{2},k\\right)$ . It is known that the clique can be recovered as long as $k \\geq \\left(2+\\epsilon\\right)\\log n $ for any $\\epsilon>0$, but no polynomial-time algorithm is known for this task unless $k=\\Omega\\left(\\sqrt{n} \\right)$. Following a statistical-physics inspired point of view as an att"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07174","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1904.07174/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yj46iD71WL7o6I325QlL2TYgCK+ethTtnwtMnYLdrYIk1X/GwfcDhZHmsHTtAa6JCAnA7J8xKLn3hqBGdXN3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:01:42.820986Z"},"content_sha256":"fb6ed0f255545e6547d0f685850fec5e5a66179238a785f04063177bccf56cc1","schema_version":"1.0","event_id":"sha256:fb6ed0f255545e6547d0f685850fec5e5a66179238a785f04063177bccf56cc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USFEVKS3CNENQXACWRM7HCID3U/bundle.json","state_url":"https://pith.science/pith/USFEVKS3CNENQXACWRM7HCID3U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USFEVKS3CNENQXACWRM7HCID3U/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-08-15T15:01:42Z","links":{"resolver":"https://pith.science/pith/USFEVKS3CNENQXACWRM7HCID3U","bundle":"https://pith.science/pith/USFEVKS3CNENQXACWRM7HCID3U/bundle.json","state":"https://pith.science/pith/USFEVKS3CNENQXACWRM7HCID3U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USFEVKS3CNENQXACWRM7HCID3U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:USFEVKS3CNENQXACWRM7HCID3U","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":"120fd602b6bf6741a153dae136f715fa4249598c7e54615d66efd02369a9faad","cross_cats_sorted":["cs.DS","cs.LG","math.OC","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-04-15T16:44:00Z","title_canon_sha256":"55b244658d5ff4c1e3e505498efb2e77e84b89f885554a08259c90f62f0b7a5b"},"schema_version":"1.0","source":{"id":"1904.07174","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07174","created_at":"2026-07-05T00:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07174v2","created_at":"2026-07-05T00:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07174","created_at":"2026-07-05T00:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"USFEVKS3CNEN","created_at":"2026-07-05T00:28:47Z"},{"alias_kind":"pith_short_16","alias_value":"USFEVKS3CNENQXAC","created_at":"2026-07-05T00:28:47Z"},{"alias_kind":"pith_short_8","alias_value":"USFEVKS3","created_at":"2026-07-05T00:28:47Z"}],"graph_snapshots":[{"event_id":"sha256:fb6ed0f255545e6547d0f685850fec5e5a66179238a785f04063177bccf56cc1","target":"graph","created_at":"2026-07-05T00:28:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1904.07174/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we study the computational-statistical gap of the planted clique problem, where a clique of size $k$ is planted in an Erdos Renyi graph $G(n,\\frac{1}{2})$ resulting in a graph $G\\left(n,\\frac{1}{2},k\\right)$. The goal is to recover the planted clique vertices by observing $G\\left(n,\\frac{1}{2},k\\right)$ . It is known that the clique can be recovered as long as $k \\geq \\left(2+\\epsilon\\right)\\log n $ for any $\\epsilon>0$, but no polynomial-time algorithm is known for this task unless $k=\\Omega\\left(\\sqrt{n} \\right)$. Following a statistical-physics inspired point of view as an att","authors_text":"David Gamarnik, Ilias Zadik","cross_cats":["cs.DS","cs.LG","math.OC","math.PR","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-04-15T16:44:00Z","title":"The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07174","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:11d9e7335b1e5162c5a30d4e2d0800434d3cbb617d6b470506aaf565103b9b14","target":"record","created_at":"2026-07-05T00:28:47Z","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":"120fd602b6bf6741a153dae136f715fa4249598c7e54615d66efd02369a9faad","cross_cats_sorted":["cs.DS","cs.LG","math.OC","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-04-15T16:44:00Z","title_canon_sha256":"55b244658d5ff4c1e3e505498efb2e77e84b89f885554a08259c90f62f0b7a5b"},"schema_version":"1.0","source":{"id":"1904.07174","kind":"arxiv","version":2}},"canonical_sha256":"a48a4aaa5b1348d85c02b459f38903dd126ce4724631f43115a1881c5bbd2264","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a48a4aaa5b1348d85c02b459f38903dd126ce4724631f43115a1881c5bbd2264","first_computed_at":"2026-07-05T00:28:47.994371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:28:47.994371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BUxEnO++Vck1xXHVVh0JYYHfzsJBHMcxESADVUPOvZtD4BRQxlHNqtilGDF+Hhj3hbUljemoHEQu3FLW8YU0BA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:28:47.994876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07174","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11d9e7335b1e5162c5a30d4e2d0800434d3cbb617d6b470506aaf565103b9b14","sha256:fb6ed0f255545e6547d0f685850fec5e5a66179238a785f04063177bccf56cc1"],"state_sha256":"e2bf9f919313fc532f7ec5e1698a49b5ce971926b2323cee3773f708db7124c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9SmRd08Ms1M0VGuz9xE2K5coKCSyqh4PdWzWtDVywzOLzdjrRkajOh+YR079wThL5WLHBIA94VyaBHA+EnxICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T15:01:42.826960Z","bundle_sha256":"4f0cd97e3f05393d6ec08ef7751d072cb42f106ca495138ae088976616b0cd72"}}