{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WHPQRK2JFPTC7NG7C3YTUKEW4Y","short_pith_number":"pith:WHPQRK2J","schema_version":"1.0","canonical_sha256":"b1df08ab492be62fb4df16f13a2896e6085f4f40fcd3d5986bdb92630bbc7493","source":{"kind":"arxiv","id":"2212.05619","version":2},"attestation_state":"computed","paper":{"title":"Algorithms approaching the threshold for semi-random planted clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Steurer, Pravesh K. Kothari, Rares-Darius Buhai","submitted_at":"2022-12-11T22:23:10Z","abstract_excerpt":"We design new polynomial-time algorithms for recovering planted cliques in the semi-random graph model introduced by Feige and Kilian 2001. The previous best algorithms for this model succeed if the planted clique has size at least $n^{2/3}$ in a graph with $n$ vertices (Mehta, Mckenzie, Trevisan 2019 and Charikar, Steinhardt, Valiant 2017). Our algorithms work for planted-clique sizes approaching $n^{1/2}$ -- the information-theoretic threshold in the semi-random model (Steinhardt 2017) and a conjectured computational threshold even in the easier fully-random model. This result comes close to"},"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":"2212.05619","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-12-11T22:23:10Z","cross_cats_sorted":[],"title_canon_sha256":"ed1b1bfc857d8a60830cc6180e7c9d36cea5e7d91832b7615af28d607fea7a5b","abstract_canon_sha256":"769e13a928b699930fb7aa5f49862a6ec448db535e0614b6f4c78cba635b9844"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:17:43.404776Z","signature_b64":"3LoFfO4JkfhYVfBA5DVfpkhM5PwLmgwiFpPZpagHZ/naghL8zIbPT6ectkputuPuov26F42X2x5EdCdRRESVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1df08ab492be62fb4df16f13a2896e6085f4f40fcd3d5986bdb92630bbc7493","last_reissued_at":"2026-07-05T06:17:43.404330Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:17:43.404330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms approaching the threshold for semi-random planted clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Steurer, Pravesh K. Kothari, Rares-Darius Buhai","submitted_at":"2022-12-11T22:23:10Z","abstract_excerpt":"We design new polynomial-time algorithms for recovering planted cliques in the semi-random graph model introduced by Feige and Kilian 2001. The previous best algorithms for this model succeed if the planted clique has size at least $n^{2/3}$ in a graph with $n$ vertices (Mehta, Mckenzie, Trevisan 2019 and Charikar, Steinhardt, Valiant 2017). Our algorithms work for planted-clique sizes approaching $n^{1/2}$ -- the information-theoretic threshold in the semi-random model (Steinhardt 2017) and a conjectured computational threshold even in the easier fully-random model. This result comes close to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.05619","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/2212.05619/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2212.05619","created_at":"2026-07-05T06:17:43.404386+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.05619v2","created_at":"2026-07-05T06:17:43.404386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.05619","created_at":"2026-07-05T06:17:43.404386+00:00"},{"alias_kind":"pith_short_12","alias_value":"WHPQRK2JFPTC","created_at":"2026-07-05T06:17:43.404386+00:00"},{"alias_kind":"pith_short_16","alias_value":"WHPQRK2JFPTC7NG7","created_at":"2026-07-05T06:17:43.404386+00:00"},{"alias_kind":"pith_short_8","alias_value":"WHPQRK2J","created_at":"2026-07-05T06:17:43.404386+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.16270","citing_title":"A Geometric Approach to Problems in Optimization and Data Science","ref_index":2023,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WHPQRK2JFPTC7NG7C3YTUKEW4Y","json":"https://pith.science/pith/WHPQRK2JFPTC7NG7C3YTUKEW4Y.json","graph_json":"https://pith.science/api/pith-number/WHPQRK2JFPTC7NG7C3YTUKEW4Y/graph.json","events_json":"https://pith.science/api/pith-number/WHPQRK2JFPTC7NG7C3YTUKEW4Y/events.json","paper":"https://pith.science/paper/WHPQRK2J"},"agent_actions":{"view_html":"https://pith.science/pith/WHPQRK2JFPTC7NG7C3YTUKEW4Y","download_json":"https://pith.science/pith/WHPQRK2JFPTC7NG7C3YTUKEW4Y.json","view_paper":"https://pith.science/paper/WHPQRK2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.05619&json=true","fetch_graph":"https://pith.science/api/pith-number/WHPQRK2JFPTC7NG7C3YTUKEW4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/WHPQRK2JFPTC7NG7C3YTUKEW4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WHPQRK2JFPTC7NG7C3YTUKEW4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WHPQRK2JFPTC7NG7C3YTUKEW4Y/action/storage_attestation","attest_author":"https://pith.science/pith/WHPQRK2JFPTC7NG7C3YTUKEW4Y/action/author_attestation","sign_citation":"https://pith.science/pith/WHPQRK2JFPTC7NG7C3YTUKEW4Y/action/citation_signature","submit_replication":"https://pith.science/pith/WHPQRK2JFPTC7NG7C3YTUKEW4Y/action/replication_record"}},"created_at":"2026-07-05T06:17:43.404386+00:00","updated_at":"2026-07-05T06:17:43.404386+00:00"}