{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:PPWPA4SRMEM4PXZFOBC6KZXF62","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":"db1db64047d3213e4da0850cfec22d528d1109c883940b16c5516e2ae8614866","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-19T17:21:37Z","title_canon_sha256":"a4553448d6ff642ce1002c69d497489d28aaf2ed8a612bd55b4289685e3e1f7b"},"schema_version":"1.0","source":{"id":"2011.09973","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.09973","created_at":"2026-07-05T01:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"2011.09973v1","created_at":"2026-07-05T01:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09973","created_at":"2026-07-05T01:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"PPWPA4SRMEM4","created_at":"2026-07-05T01:53:03Z"},{"alias_kind":"pith_short_16","alias_value":"PPWPA4SRMEM4PXZF","created_at":"2026-07-05T01:53:03Z"},{"alias_kind":"pith_short_8","alias_value":"PPWPA4SR","created_at":"2026-07-05T01:53:03Z"}],"graph_snapshots":[{"event_id":"sha256:772355741160a62b86737efe81c6bb9df26033be86323dd5f8331b450beeb453","target":"graph","created_at":"2026-07-05T01:53: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.09973/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Traditionally, robust statistics has focused on designing estimators tolerant to a minority of contaminated data. Robust list-decodable learning focuses on the more challenging regime where only a minority $\\frac 1 k$ fraction of the dataset is drawn from the distribution of interest, and no assumptions are made on the remaining data. We study the fundamental task of list-decodable mean estimation in high dimensions. Our main result is a new list-decodable mean estimation algorithm for bounded covariance distributions with optimal sample complexity and error rate, running in nearly-PCA time. A","authors_text":"Daniel Kongsgaard, Daniel M. Kane, Ilias Diakonikolas, Jerry Li, Kevin Tian","cross_cats":["cs.LG","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-19T17:21:37Z","title":"List-Decodable Mean Estimation in Nearly-PCA Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09973","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:2327931c98cdcbe05eb6b30e5245a752e0fbbc6c39fa193052996c3a3820cacc","target":"record","created_at":"2026-07-05T01:53: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":"db1db64047d3213e4da0850cfec22d528d1109c883940b16c5516e2ae8614866","cross_cats_sorted":["cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-19T17:21:37Z","title_canon_sha256":"a4553448d6ff642ce1002c69d497489d28aaf2ed8a612bd55b4289685e3e1f7b"},"schema_version":"1.0","source":{"id":"2011.09973","kind":"arxiv","version":1}},"canonical_sha256":"7becf072516119c7df257045e566e5f6bc83342173fed5c07c74754108cb19e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7becf072516119c7df257045e566e5f6bc83342173fed5c07c74754108cb19e3","first_computed_at":"2026-07-05T01:53:03.112127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:53:03.112127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZiooVQ0c/766+C5I8jwNjjhSLw5SOJ4z3xEL+ikZZnVRhyp7jk8orblEnLEJKoNRfforfcs7WTNNmdp0S9wmDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:53:03.112532Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.09973","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2327931c98cdcbe05eb6b30e5245a752e0fbbc6c39fa193052996c3a3820cacc","sha256:772355741160a62b86737efe81c6bb9df26033be86323dd5f8331b450beeb453"],"state_sha256":"3a8b6206979797ee26a9b09c6f65a2a468244d2a24c6d95ec3a8e0acbd6ab63a"}