{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TBRFRKLZULLIMMPWW4PXBQL32H","short_pith_number":"pith:TBRFRKLZ","schema_version":"1.0","canonical_sha256":"986258a979a2d68631f6b71f70c17bd1c6f0ff2324fc33df8e8de3b8372f857a","source":{"kind":"arxiv","id":"1811.09380","version":1},"attestation_state":"computed","paper":{"title":"High-Dimensional Robust Mean Estimation in Nearly-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Ilias Diakonikolas, Rong Ge, Yu Cheng","submitted_at":"2018-11-23T07:51:35Z","abstract_excerpt":"We study the fundamental problem of high-dimensional mean estimation in a robust model where a constant fraction of the samples are adversarially corrupted. Recent work gave the first polynomial time algorithms for this problem with dimension-independent error guarantees for several families of structured distributions.\n  In this work, we give the first nearly-linear time algorithms for high-dimensional robust mean estimation. Specifically, we focus on distributions with (i) known covariance and sub-gaussian tails, and (ii) unknown bounded covariance. Given $N$ samples on $\\mathbb{R}^d$, an $\\"},"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":"1811.09380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T07:51:35Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"bb308437651ae5ccc72ab0283a25844f67bb8e03e32ddd574dbe45fed5a5769c","abstract_canon_sha256":"9aae1f2231f99b51bdfc838dd3ff501e16c1d82facc7ba3615fb4a87a0d20a14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:03.541409Z","signature_b64":"p9PNbDh3F5IN13ZkLN91/mO2pqJDd1J0yNR5Rkp5kA8bARQUl3Sff9K+XGiY3bsBlF8UE87YBrya64AZAX84AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"986258a979a2d68631f6b71f70c17bd1c6f0ff2324fc33df8e8de3b8372f857a","last_reissued_at":"2026-05-18T00:00:03.540928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:03.540928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Dimensional Robust Mean Estimation in Nearly-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Ilias Diakonikolas, Rong Ge, Yu Cheng","submitted_at":"2018-11-23T07:51:35Z","abstract_excerpt":"We study the fundamental problem of high-dimensional mean estimation in a robust model where a constant fraction of the samples are adversarially corrupted. Recent work gave the first polynomial time algorithms for this problem with dimension-independent error guarantees for several families of structured distributions.\n  In this work, we give the first nearly-linear time algorithms for high-dimensional robust mean estimation. Specifically, we focus on distributions with (i) known covariance and sub-gaussian tails, and (ii) unknown bounded covariance. Given $N$ samples on $\\mathbb{R}^d$, an $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09380","kind":"arxiv","version":1},"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":"1811.09380","created_at":"2026-05-18T00:00:03.541019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.09380v1","created_at":"2026-05-18T00:00:03.541019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09380","created_at":"2026-05-18T00:00:03.541019+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBRFRKLZULLI","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBRFRKLZULLIMMPW","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBRFRKLZ","created_at":"2026-05-18T12:32:53.628368+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/TBRFRKLZULLIMMPWW4PXBQL32H","json":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H.json","graph_json":"https://pith.science/api/pith-number/TBRFRKLZULLIMMPWW4PXBQL32H/graph.json","events_json":"https://pith.science/api/pith-number/TBRFRKLZULLIMMPWW4PXBQL32H/events.json","paper":"https://pith.science/paper/TBRFRKLZ"},"agent_actions":{"view_html":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H","download_json":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H.json","view_paper":"https://pith.science/paper/TBRFRKLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.09380&json=true","fetch_graph":"https://pith.science/api/pith-number/TBRFRKLZULLIMMPWW4PXBQL32H/graph.json","fetch_events":"https://pith.science/api/pith-number/TBRFRKLZULLIMMPWW4PXBQL32H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H/action/storage_attestation","attest_author":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H/action/author_attestation","sign_citation":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H/action/citation_signature","submit_replication":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H/action/replication_record"}},"created_at":"2026-05-18T00:00:03.541019+00:00","updated_at":"2026-05-18T00:00:03.541019+00:00"}