{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TBRFRKLZULLIMMPWW4PXBQL32H","short_pith_number":"pith:TBRFRKLZ","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"},"canonical_sha256":"986258a979a2d68631f6b71f70c17bd1c6f0ff2324fc33df8e8de3b8372f857a","source":{"kind":"arxiv","id":"1811.09380","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09380","created_at":"2026-05-18T00:00:03Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09380v1","created_at":"2026-05-18T00:00:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09380","created_at":"2026-05-18T00:00:03Z"},{"alias_kind":"pith_short_12","alias_value":"TBRFRKLZULLI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TBRFRKLZULLIMMPW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TBRFRKLZ","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TBRFRKLZULLIMMPWW4PXBQL32H","target":"record","payload":{"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"},"canonical_sha256":"986258a979a2d68631f6b71f70c17bd1c6f0ff2324fc33df8e8de3b8372f857a","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"},"source_kind":"arxiv","source_id":"1811.09380","source_version":1,"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:00:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kOrS7NuCQ8mhLRTEKDdxNrWRZxLr4ePGMGVoo9smZ1aUR7MpfmpZcrKcmgFehrTnKK0oERc2cWDPjPVkhDVfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:59:44.100487Z"},"content_sha256":"484d763be3a630a10f0a41b666c607086ce8563ac7ed876e2fe4cf5c816e8e7c","schema_version":"1.0","event_id":"sha256:484d763be3a630a10f0a41b666c607086ce8563ac7ed876e2fe4cf5c816e8e7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TBRFRKLZULLIMMPWW4PXBQL32H","target":"graph","payload":{"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"},"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:00:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5ZcjOhOfcposdN9o4DE0oorS5jtH4rWO5eNSkcldHadGcU/AuFEcaB4vOsAUDjTQtPziMPUkBizLXWulXx1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:59:44.100837Z"},"content_sha256":"351f3779bed5205a441d1a09085cb928ccafc75350bd5cadbe54326573916b7b","schema_version":"1.0","event_id":"sha256:351f3779bed5205a441d1a09085cb928ccafc75350bd5cadbe54326573916b7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H/bundle.json","state_url":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TBRFRKLZULLIMMPWW4PXBQL32H/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-05T10:59:44Z","links":{"resolver":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H","bundle":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H/bundle.json","state":"https://pith.science/pith/TBRFRKLZULLIMMPWW4PXBQL32H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TBRFRKLZULLIMMPWW4PXBQL32H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TBRFRKLZULLIMMPWW4PXBQL32H","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":"9aae1f2231f99b51bdfc838dd3ff501e16c1d82facc7ba3615fb4a87a0d20a14","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T07:51:35Z","title_canon_sha256":"bb308437651ae5ccc72ab0283a25844f67bb8e03e32ddd574dbe45fed5a5769c"},"schema_version":"1.0","source":{"id":"1811.09380","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09380","created_at":"2026-05-18T00:00:03Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09380v1","created_at":"2026-05-18T00:00:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09380","created_at":"2026-05-18T00:00:03Z"},{"alias_kind":"pith_short_12","alias_value":"TBRFRKLZULLI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TBRFRKLZULLIMMPW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TBRFRKLZ","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:351f3779bed5205a441d1a09085cb928ccafc75350bd5cadbe54326573916b7b","target":"graph","created_at":"2026-05-18T00:00:03Z","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 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 $\\","authors_text":"Ilias Diakonikolas, Rong Ge, Yu Cheng","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T07:51:35Z","title":"High-Dimensional Robust Mean Estimation in Nearly-Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09380","kind":"arxiv","version":1},"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:484d763be3a630a10f0a41b666c607086ce8563ac7ed876e2fe4cf5c816e8e7c","target":"record","created_at":"2026-05-18T00:00:03Z","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":"9aae1f2231f99b51bdfc838dd3ff501e16c1d82facc7ba3615fb4a87a0d20a14","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T07:51:35Z","title_canon_sha256":"bb308437651ae5ccc72ab0283a25844f67bb8e03e32ddd574dbe45fed5a5769c"},"schema_version":"1.0","source":{"id":"1811.09380","kind":"arxiv","version":1}},"canonical_sha256":"986258a979a2d68631f6b71f70c17bd1c6f0ff2324fc33df8e8de3b8372f857a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"986258a979a2d68631f6b71f70c17bd1c6f0ff2324fc33df8e8de3b8372f857a","first_computed_at":"2026-05-18T00:00:03.540928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:03.540928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p9PNbDh3F5IN13ZkLN91/mO2pqJDd1J0yNR5Rkp5kA8bARQUl3Sff9K+XGiY3bsBlF8UE87YBrya64AZAX84AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:03.541409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.09380","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:484d763be3a630a10f0a41b666c607086ce8563ac7ed876e2fe4cf5c816e8e7c","sha256:351f3779bed5205a441d1a09085cb928ccafc75350bd5cadbe54326573916b7b"],"state_sha256":"88a5264d4e12ea49a181be27ffa13e3f8bd9c71313ede47f57d2d59dafd605c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a0PHSf0snWyPAJQIIMBMeos0N6zgVF+qaIrKxaH8NjWzAHIEYbH2cPBzHE2y03jvt2WckJ9e6jJlqRCFiOrQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:59:44.102833Z","bundle_sha256":"e1c875487ef4ecd30eec96f0ff96459816dd4480575579e1d754b3ccf064f296"}}