{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RIHYCJFTXLESUAV2W5M42JR55W","short_pith_number":"pith:RIHYCJFT","schema_version":"1.0","canonical_sha256":"8a0f8124b3bac92a02bab759cd263ded864952de9fedc07be4c17d6784a6512e","source":{"kind":"arxiv","id":"1902.01998","version":1},"attestation_state":"computed","paper":{"title":"Fast Mean Estimation with Sub-Gaussian Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Nicolas Flammarion, Peter L. Bartlett, Yeshwanth Cherapanamjeri","submitted_at":"2019-02-06T01:33:05Z","abstract_excerpt":"We propose an estimator for the mean of a random vector in $\\mathbb{R}^d$ that can be computed in time $O(n^4+n^2d)$ for $n$ i.i.d.~samples and that has error bounds matching the sub-Gaussian case. The only assumptions we make about the data distribution are that it has finite mean and covariance; in particular, we make no assumptions about higher-order moments. Like the polynomial time estimator introduced by Hopkins, 2018, which is based on the sum-of-squares hierarchy, our estimator achieves optimal statistical efficiency in this challenging setting, but it has a significantly faster runtim"},"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":"1902.01998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-02-06T01:33:05Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"4fb3f90616ed3e5468171a64caa28aa8cf171be39e0e6925f485d562a609ec7a","abstract_canon_sha256":"115344f8f7090df6382fea0d2c2b7e0b08a35c49c513cf2de18b2e84652527d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:38.129734Z","signature_b64":"LiM2jZWb3lLMz8/3VmeV/Y1Eb7h18QbiFW+oIY+w//yguVU6RQw1qvf7oeGF275uW6XtGBUJdATV6sWcjB2NDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a0f8124b3bac92a02bab759cd263ded864952de9fedc07be4c17d6784a6512e","last_reissued_at":"2026-05-17T23:54:38.129205Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:38.129205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Mean Estimation with Sub-Gaussian Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Nicolas Flammarion, Peter L. Bartlett, Yeshwanth Cherapanamjeri","submitted_at":"2019-02-06T01:33:05Z","abstract_excerpt":"We propose an estimator for the mean of a random vector in $\\mathbb{R}^d$ that can be computed in time $O(n^4+n^2d)$ for $n$ i.i.d.~samples and that has error bounds matching the sub-Gaussian case. The only assumptions we make about the data distribution are that it has finite mean and covariance; in particular, we make no assumptions about higher-order moments. Like the polynomial time estimator introduced by Hopkins, 2018, which is based on the sum-of-squares hierarchy, our estimator achieves optimal statistical efficiency in this challenging setting, but it has a significantly faster runtim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01998","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":"1902.01998","created_at":"2026-05-17T23:54:38.129280+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01998v1","created_at":"2026-05-17T23:54:38.129280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01998","created_at":"2026-05-17T23:54:38.129280+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIHYCJFTXLES","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIHYCJFTXLESUAV2","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIHYCJFT","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00927","citing_title":"A Unified Approach to Robust Mean Estimation","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RIHYCJFTXLESUAV2W5M42JR55W","json":"https://pith.science/pith/RIHYCJFTXLESUAV2W5M42JR55W.json","graph_json":"https://pith.science/api/pith-number/RIHYCJFTXLESUAV2W5M42JR55W/graph.json","events_json":"https://pith.science/api/pith-number/RIHYCJFTXLESUAV2W5M42JR55W/events.json","paper":"https://pith.science/paper/RIHYCJFT"},"agent_actions":{"view_html":"https://pith.science/pith/RIHYCJFTXLESUAV2W5M42JR55W","download_json":"https://pith.science/pith/RIHYCJFTXLESUAV2W5M42JR55W.json","view_paper":"https://pith.science/paper/RIHYCJFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01998&json=true","fetch_graph":"https://pith.science/api/pith-number/RIHYCJFTXLESUAV2W5M42JR55W/graph.json","fetch_events":"https://pith.science/api/pith-number/RIHYCJFTXLESUAV2W5M42JR55W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIHYCJFTXLESUAV2W5M42JR55W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIHYCJFTXLESUAV2W5M42JR55W/action/storage_attestation","attest_author":"https://pith.science/pith/RIHYCJFTXLESUAV2W5M42JR55W/action/author_attestation","sign_citation":"https://pith.science/pith/RIHYCJFTXLESUAV2W5M42JR55W/action/citation_signature","submit_replication":"https://pith.science/pith/RIHYCJFTXLESUAV2W5M42JR55W/action/replication_record"}},"created_at":"2026-05-17T23:54:38.129280+00:00","updated_at":"2026-05-17T23:54:38.129280+00:00"}