{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SHPTKS2QSYZNWCZ7CFE7AEJVL6","short_pith_number":"pith:SHPTKS2Q","canonical_record":{"source":{"id":"1704.05120","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-17T20:53:18Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"fea0a30c598dcb3fb7fa3a20862d07aef97817c9677e72d50afb2aa564a8b0e0","abstract_canon_sha256":"1383a1007d786202bbe75a8d84aa05dc240981bc8c3640a6897d6f6fd0db8698"},"schema_version":"1.0"},"canonical_sha256":"91df354b509632db0b3f1149f011355fa95c316a6f9a6b70721b08a3d14b8da2","source":{"kind":"arxiv","id":"1704.05120","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05120","created_at":"2026-05-18T00:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05120v2","created_at":"2026-05-18T00:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05120","created_at":"2026-05-18T00:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"SHPTKS2QSYZN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SHPTKS2QSYZNWCZ7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SHPTKS2Q","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SHPTKS2QSYZNWCZ7CFE7AEJVL6","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05120","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-17T20:53:18Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"fea0a30c598dcb3fb7fa3a20862d07aef97817c9677e72d50afb2aa564a8b0e0","abstract_canon_sha256":"1383a1007d786202bbe75a8d84aa05dc240981bc8c3640a6897d6f6fd0db8698"},"schema_version":"1.0"},"canonical_sha256":"91df354b509632db0b3f1149f011355fa95c316a6f9a6b70721b08a3d14b8da2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:31.072593Z","signature_b64":"ucg+jYNJ8HmxojKQJ4n0J34a0dLHangIdJvDRxj0NClLkQdgCj6ZkaxzVmdOgi3oOOIIX9gpzjve5Cboy5sZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91df354b509632db0b3f1149f011355fa95c316a6f9a6b70721b08a3d14b8da2","last_reissued_at":"2026-05-18T00:06:31.072216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:31.072216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05120","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-18T00:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0YilPFHbsfkAS1ip6JqdAkBxR8dWzbDddfP0GVekZ0+Ako3+6PnH8lkldU0AR2qmgNz40wgfnudZRfjikE9pBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:57:23.739641Z"},"content_sha256":"5554e7d4c60ef932edddfe9c7b55b86d2f5be1b0b9976b5033e7decde8899bf3","schema_version":"1.0","event_id":"sha256:5554e7d4c60ef932edddfe9c7b55b86d2f5be1b0b9976b5033e7decde8899bf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SHPTKS2QSYZNWCZ7CFE7AEJVL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Does robustness imply tractability? A lower bound for planted clique in the semi-random model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.CC","authors_text":"Jacob Steinhardt","submitted_at":"2017-04-17T20:53:18Z","abstract_excerpt":"We consider a robust analog of the planted clique problem. In this analog, a set $S$ of vertices is chosen and all edges in $S$ are included; then, edges between $S$ and the rest of the graph are included with probability $\\frac{1}{2}$, while edges not touching $S$ are allowed to vary arbitrarily. For this semi-random model, we show that the information-theoretic threshold for recovery is $\\tilde{\\Theta}(\\sqrt{n})$, in sharp contrast to the classical information-theoretic threshold of $\\Theta(\\log(n))$. This matches the conjectured computational threshold for the classical planted clique probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05120","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-18T00:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mzq6TjuWNLKyDTS8aAjgZK/GdwmQ9pJTs9SYsN7fUM5AGA8aq8BLSgwYP0EpcDmOxrKvpqTagzpS4YfSOgw0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:57:23.739988Z"},"content_sha256":"8f05cbf65d8a37dd32f80f0a04e10eed9160afeff255a7922321d1174731f33f","schema_version":"1.0","event_id":"sha256:8f05cbf65d8a37dd32f80f0a04e10eed9160afeff255a7922321d1174731f33f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHPTKS2QSYZNWCZ7CFE7AEJVL6/bundle.json","state_url":"https://pith.science/pith/SHPTKS2QSYZNWCZ7CFE7AEJVL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHPTKS2QSYZNWCZ7CFE7AEJVL6/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-30T03:57:23Z","links":{"resolver":"https://pith.science/pith/SHPTKS2QSYZNWCZ7CFE7AEJVL6","bundle":"https://pith.science/pith/SHPTKS2QSYZNWCZ7CFE7AEJVL6/bundle.json","state":"https://pith.science/pith/SHPTKS2QSYZNWCZ7CFE7AEJVL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHPTKS2QSYZNWCZ7CFE7AEJVL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SHPTKS2QSYZNWCZ7CFE7AEJVL6","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":"1383a1007d786202bbe75a8d84aa05dc240981bc8c3640a6897d6f6fd0db8698","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-17T20:53:18Z","title_canon_sha256":"fea0a30c598dcb3fb7fa3a20862d07aef97817c9677e72d50afb2aa564a8b0e0"},"schema_version":"1.0","source":{"id":"1704.05120","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05120","created_at":"2026-05-18T00:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05120v2","created_at":"2026-05-18T00:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05120","created_at":"2026-05-18T00:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"SHPTKS2QSYZN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SHPTKS2QSYZNWCZ7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SHPTKS2Q","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:8f05cbf65d8a37dd32f80f0a04e10eed9160afeff255a7922321d1174731f33f","target":"graph","created_at":"2026-05-18T00:06:31Z","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 consider a robust analog of the planted clique problem. In this analog, a set $S$ of vertices is chosen and all edges in $S$ are included; then, edges between $S$ and the rest of the graph are included with probability $\\frac{1}{2}$, while edges not touching $S$ are allowed to vary arbitrarily. For this semi-random model, we show that the information-theoretic threshold for recovery is $\\tilde{\\Theta}(\\sqrt{n})$, in sharp contrast to the classical information-theoretic threshold of $\\Theta(\\log(n))$. This matches the conjectured computational threshold for the classical planted clique probl","authors_text":"Jacob Steinhardt","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-17T20:53:18Z","title":"Does robustness imply tractability? A lower bound for planted clique in the semi-random model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05120","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:5554e7d4c60ef932edddfe9c7b55b86d2f5be1b0b9976b5033e7decde8899bf3","target":"record","created_at":"2026-05-18T00:06:31Z","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":"1383a1007d786202bbe75a8d84aa05dc240981bc8c3640a6897d6f6fd0db8698","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-17T20:53:18Z","title_canon_sha256":"fea0a30c598dcb3fb7fa3a20862d07aef97817c9677e72d50afb2aa564a8b0e0"},"schema_version":"1.0","source":{"id":"1704.05120","kind":"arxiv","version":2}},"canonical_sha256":"91df354b509632db0b3f1149f011355fa95c316a6f9a6b70721b08a3d14b8da2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91df354b509632db0b3f1149f011355fa95c316a6f9a6b70721b08a3d14b8da2","first_computed_at":"2026-05-18T00:06:31.072216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:31.072216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ucg+jYNJ8HmxojKQJ4n0J34a0dLHangIdJvDRxj0NClLkQdgCj6ZkaxzVmdOgi3oOOIIX9gpzjve5Cboy5sZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:31.072593Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05120","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5554e7d4c60ef932edddfe9c7b55b86d2f5be1b0b9976b5033e7decde8899bf3","sha256:8f05cbf65d8a37dd32f80f0a04e10eed9160afeff255a7922321d1174731f33f"],"state_sha256":"5c24b3667b083dda10f62c51eb7b924b880eb54d5a44bc84bf99f464b57db443"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7V8sDuKqAzSWcm4tLPgypU56LleQUhadKJh+NwgIZ3H6fi0iV3q8VrAEDHc7AjRWPs5tQ9YClyLB8D460KPaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:57:23.742176Z","bundle_sha256":"73d8bfd163c0eca4dc5d4a39e1bb3e046a2ab94c6b2ca725c78a5c3dc8039b25"}}