{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EU7ASP2DPE4JVS4EFCZRMDILOY","short_pith_number":"pith:EU7ASP2D","schema_version":"1.0","canonical_sha256":"253e093f4379389acb8428b3160d0b763f08ba70c4f940e8ca00b22b0e76ba26","source":{"kind":"arxiv","id":"1903.07870","version":2},"attestation_state":"computed","paper":{"title":"How Hard Is Robust Mean Estimation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.TH"],"primary_cat":"cs.CC","authors_text":"Jerry Li, Samuel B. Hopkins","submitted_at":"2019-03-19T07:48:33Z","abstract_excerpt":"Robust mean estimation is the problem of estimating the mean $\\mu \\in \\mathbb{R}^d$ of a $d$-dimensional distribution $D$ from a list of independent samples, an $\\epsilon$-fraction of which have been arbitrarily corrupted by a malicious adversary. Recent algorithmic progress has resulted in the first polynomial-time algorithms which achieve \\emph{dimension-independent} rates of error: for instance, if $D$ has covariance $I$, in polynomial-time one may find $\\hat{\\mu}$ with $\\|\\mu - \\hat{\\mu}\\| \\leq O(\\sqrt{\\epsilon})$. However, error rates achieved by current polynomial-time algorithms, while "},"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":"1903.07870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-19T07:48:33Z","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"title_canon_sha256":"54a23dde3a10856138fa1f4de773c6e5064fccc85868e2b978718171388c9851","abstract_canon_sha256":"a2586726b7d6389ee5bc36de341461e4e379296e9765a2adb753cc962cb53404"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:21.460133Z","signature_b64":"/nEM21Rfe8tSRjqW1W0dTC6DMYHK+KusnLK0Tgoa7HlBLbjtg0m+0XlXXPHWinQhTwLk5VX8ynD1AK5/aYRdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"253e093f4379389acb8428b3160d0b763f08ba70c4f940e8ca00b22b0e76ba26","last_reissued_at":"2026-05-17T23:44:21.459591Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:21.459591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Hard Is Robust Mean Estimation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.TH"],"primary_cat":"cs.CC","authors_text":"Jerry Li, Samuel B. Hopkins","submitted_at":"2019-03-19T07:48:33Z","abstract_excerpt":"Robust mean estimation is the problem of estimating the mean $\\mu \\in \\mathbb{R}^d$ of a $d$-dimensional distribution $D$ from a list of independent samples, an $\\epsilon$-fraction of which have been arbitrarily corrupted by a malicious adversary. Recent algorithmic progress has resulted in the first polynomial-time algorithms which achieve \\emph{dimension-independent} rates of error: for instance, if $D$ has covariance $I$, in polynomial-time one may find $\\hat{\\mu}$ with $\\|\\mu - \\hat{\\mu}\\| \\leq O(\\sqrt{\\epsilon})$. However, error rates achieved by current polynomial-time algorithms, while "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07870","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.07870","created_at":"2026-05-17T23:44:21.459694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07870v2","created_at":"2026-05-17T23:44:21.459694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07870","created_at":"2026-05-17T23:44:21.459694+00:00"},{"alias_kind":"pith_short_12","alias_value":"EU7ASP2DPE4J","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EU7ASP2DPE4JVS4E","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EU7ASP2D","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11366","citing_title":"Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY","json":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY.json","graph_json":"https://pith.science/api/pith-number/EU7ASP2DPE4JVS4EFCZRMDILOY/graph.json","events_json":"https://pith.science/api/pith-number/EU7ASP2DPE4JVS4EFCZRMDILOY/events.json","paper":"https://pith.science/paper/EU7ASP2D"},"agent_actions":{"view_html":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY","download_json":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY.json","view_paper":"https://pith.science/paper/EU7ASP2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07870&json=true","fetch_graph":"https://pith.science/api/pith-number/EU7ASP2DPE4JVS4EFCZRMDILOY/graph.json","fetch_events":"https://pith.science/api/pith-number/EU7ASP2DPE4JVS4EFCZRMDILOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY/action/storage_attestation","attest_author":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY/action/author_attestation","sign_citation":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY/action/citation_signature","submit_replication":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY/action/replication_record"}},"created_at":"2026-05-17T23:44:21.459694+00:00","updated_at":"2026-05-17T23:44:21.459694+00:00"}