{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:APNXXUEGMZYA4TTUXSXZN6CFN2","short_pith_number":"pith:APNXXUEG","schema_version":"1.0","canonical_sha256":"03db7bd08666700e4e74bcaf96f8456eaa6712f3524e3c31392105ffcbb91f4c","source":{"kind":"arxiv","id":"1906.03058","version":4},"attestation_state":"computed","paper":{"title":"Robust subgaussian estimation of a mean vector in nearly linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.TH"],"primary_cat":"math.ST","authors_text":"Guillaume Lecu\\'e, Jules Depersin","submitted_at":"2019-06-07T13:09:43Z","abstract_excerpt":"We construct an algorithm, running in time $\\tilde{\\mathcal O}(N d + uK d)$, which is robust to outliers and heavy-tailed data and which achieves the subgaussian rate from [Lugosi, Mendelson] \\begin{equation}\\label{eq:intro_subgaus_rate} \\sqrt{\\frac{{\\rm Tr}(\\Sigma)}{N}}+\\sqrt{\\frac{||\\Sigma||_{op}K}{N}} \\end{equation}with probability at least $1-\\exp(-c_0K)-\\exp(-c_1 u)$ where $\\Sigma$ is the covariance matrix of the informative data, $K\\in\\{1, \\ldots, K\\}$ is some parameter (number of block means) and $u>0$ is another parameter of the algorithm. This rate is achieved when $K\\geq c_1 |\\mathca"},"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":"1906.03058","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-06-07T13:09:43Z","cross_cats_sorted":["math.OC","stat.TH"],"title_canon_sha256":"7bfdb18674b20537bc210fcc6f29172d47039eaf841a8cc67d79a6542f1b0647","abstract_canon_sha256":"660da3091c4fe088081a16d3bb897f612034b13590682a2996a7c30f5589219b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:07.841004Z","signature_b64":"hCFdk0W75ZSPoov6Cno6AqYtxQ2oVBR6sqMRXoJqK9GR4pWKg1V5/hg0B5hbCO/I3X4mO1MRjg9up5ob/PWUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03db7bd08666700e4e74bcaf96f8456eaa6712f3524e3c31392105ffcbb91f4c","last_reissued_at":"2026-05-17T23:42:07.840458Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:07.840458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust subgaussian estimation of a mean vector in nearly linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.TH"],"primary_cat":"math.ST","authors_text":"Guillaume Lecu\\'e, Jules Depersin","submitted_at":"2019-06-07T13:09:43Z","abstract_excerpt":"We construct an algorithm, running in time $\\tilde{\\mathcal O}(N d + uK d)$, which is robust to outliers and heavy-tailed data and which achieves the subgaussian rate from [Lugosi, Mendelson] \\begin{equation}\\label{eq:intro_subgaus_rate} \\sqrt{\\frac{{\\rm Tr}(\\Sigma)}{N}}+\\sqrt{\\frac{||\\Sigma||_{op}K}{N}} \\end{equation}with probability at least $1-\\exp(-c_0K)-\\exp(-c_1 u)$ where $\\Sigma$ is the covariance matrix of the informative data, $K\\in\\{1, \\ldots, K\\}$ is some parameter (number of block means) and $u>0$ is another parameter of the algorithm. This rate is achieved when $K\\geq c_1 |\\mathca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03058","kind":"arxiv","version":4},"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":"1906.03058","created_at":"2026-05-17T23:42:07.840561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.03058v4","created_at":"2026-05-17T23:42:07.840561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03058","created_at":"2026-05-17T23:42:07.840561+00:00"},{"alias_kind":"pith_short_12","alias_value":"APNXXUEGMZYA","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"APNXXUEGMZYA4TTU","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"APNXXUEG","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.11366","citing_title":"Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"1907.00927","citing_title":"A Unified Approach to Robust Mean Estimation","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/APNXXUEGMZYA4TTUXSXZN6CFN2","json":"https://pith.science/pith/APNXXUEGMZYA4TTUXSXZN6CFN2.json","graph_json":"https://pith.science/api/pith-number/APNXXUEGMZYA4TTUXSXZN6CFN2/graph.json","events_json":"https://pith.science/api/pith-number/APNXXUEGMZYA4TTUXSXZN6CFN2/events.json","paper":"https://pith.science/paper/APNXXUEG"},"agent_actions":{"view_html":"https://pith.science/pith/APNXXUEGMZYA4TTUXSXZN6CFN2","download_json":"https://pith.science/pith/APNXXUEGMZYA4TTUXSXZN6CFN2.json","view_paper":"https://pith.science/paper/APNXXUEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.03058&json=true","fetch_graph":"https://pith.science/api/pith-number/APNXXUEGMZYA4TTUXSXZN6CFN2/graph.json","fetch_events":"https://pith.science/api/pith-number/APNXXUEGMZYA4TTUXSXZN6CFN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APNXXUEGMZYA4TTUXSXZN6CFN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APNXXUEGMZYA4TTUXSXZN6CFN2/action/storage_attestation","attest_author":"https://pith.science/pith/APNXXUEGMZYA4TTUXSXZN6CFN2/action/author_attestation","sign_citation":"https://pith.science/pith/APNXXUEGMZYA4TTUXSXZN6CFN2/action/citation_signature","submit_replication":"https://pith.science/pith/APNXXUEGMZYA4TTUXSXZN6CFN2/action/replication_record"}},"created_at":"2026-05-17T23:42:07.840561+00:00","updated_at":"2026-05-17T23:42:07.840561+00:00"}