{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3OJYS3TMNOIQPFBCGYM6E5K7IQ","short_pith_number":"pith:3OJYS3TM","schema_version":"1.0","canonical_sha256":"db93896e6c6b910794223619e2755f440e0f6176ff10245b9d2b1f6b7ed85626","source":{"kind":"arxiv","id":"1112.3914","version":1},"attestation_state":"computed","paper":{"title":"Robust empirical mean Estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"M. Lerasle, R. I. Oliveira","submitted_at":"2011-12-16T18:36:11Z","abstract_excerpt":"We study robust estimators of the mean of a probability measure $P$, called robust empirical mean estimators. This elementary construction is then used to revisit a problem of aggregation and a problem of estimator selection, extending these methods to not necessarily bounded collections of previous estimators. We consider then the problem of robust $M$-estimation. We propose a slightly more complicated construction to handle this problem and, as examples of applications, we apply our general approach to least-squares density estimation, to density estimation with K\\\"ullback loss and to a non-"},"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":"1112.3914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-12-16T18:36:11Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"04a34beb91169716fe5d719e6bad0cf0fd11264764985ee53889a4bf36ee176a","abstract_canon_sha256":"f791fff65e63d92ba56d1fba2ec05a4524a46f8f0263747aa1998b5b1d07a56a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:26.914255Z","signature_b64":"HRf8D83V81KVwJBbR1qTGEI//olpUQcJJyAlUNw55bNdVvJydGtjru4kdx2bVP+Bnx3GnEdEwmr/LUmayDZPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db93896e6c6b910794223619e2755f440e0f6176ff10245b9d2b1f6b7ed85626","last_reissued_at":"2026-07-05T02:54:26.913836Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:26.913836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust empirical mean Estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"M. Lerasle, R. I. Oliveira","submitted_at":"2011-12-16T18:36:11Z","abstract_excerpt":"We study robust estimators of the mean of a probability measure $P$, called robust empirical mean estimators. This elementary construction is then used to revisit a problem of aggregation and a problem of estimator selection, extending these methods to not necessarily bounded collections of previous estimators. We consider then the problem of robust $M$-estimation. We propose a slightly more complicated construction to handle this problem and, as examples of applications, we apply our general approach to least-squares density estimation, to density estimation with K\\\"ullback loss and to a non-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3914","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1112.3914/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1112.3914","created_at":"2026-07-05T02:54:26.913892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.3914v1","created_at":"2026-07-05T02:54:26.913892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3914","created_at":"2026-07-05T02:54:26.913892+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OJYS3TMNOIQ","created_at":"2026-07-05T02:54:26.913892+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OJYS3TMNOIQPFBC","created_at":"2026-07-05T02:54:26.913892+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OJYS3TM","created_at":"2026-07-05T02:54:26.913892+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09737","citing_title":"Online change point detection under heavy-tailedness and contamination","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00233","citing_title":"Density Evolution: A Multiscale View of Density Estimation","ref_index":140,"is_internal_anchor":false},{"citing_arxiv_id":"2606.19148","citing_title":"Fast Computation of Free-Support Wasserstein Medians","ref_index":182,"is_internal_anchor":false},{"citing_arxiv_id":"1906.10300","citing_title":"Distribution-robust mean estimation via smoothed random perturbations","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"1907.02707","citing_title":"Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2409.03410","citing_title":"Error bounds of Median-of-means estimators with VC-dimension","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2410.10704","citing_title":"Estimation beyond Missing (Completely) at Random","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20681","citing_title":"Scale-Calibrated Median-of-Means for Robust Distributed Principal Component Analysis","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04317","citing_title":"The Threshold Breakdown Point","ref_index":85,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04317","citing_title":"The Threshold Breakdown Point","ref_index":85,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3OJYS3TMNOIQPFBCGYM6E5K7IQ","json":"https://pith.science/pith/3OJYS3TMNOIQPFBCGYM6E5K7IQ.json","graph_json":"https://pith.science/api/pith-number/3OJYS3TMNOIQPFBCGYM6E5K7IQ/graph.json","events_json":"https://pith.science/api/pith-number/3OJYS3TMNOIQPFBCGYM6E5K7IQ/events.json","paper":"https://pith.science/paper/3OJYS3TM"},"agent_actions":{"view_html":"https://pith.science/pith/3OJYS3TMNOIQPFBCGYM6E5K7IQ","download_json":"https://pith.science/pith/3OJYS3TMNOIQPFBCGYM6E5K7IQ.json","view_paper":"https://pith.science/paper/3OJYS3TM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.3914&json=true","fetch_graph":"https://pith.science/api/pith-number/3OJYS3TMNOIQPFBCGYM6E5K7IQ/graph.json","fetch_events":"https://pith.science/api/pith-number/3OJYS3TMNOIQPFBCGYM6E5K7IQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OJYS3TMNOIQPFBCGYM6E5K7IQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OJYS3TMNOIQPFBCGYM6E5K7IQ/action/storage_attestation","attest_author":"https://pith.science/pith/3OJYS3TMNOIQPFBCGYM6E5K7IQ/action/author_attestation","sign_citation":"https://pith.science/pith/3OJYS3TMNOIQPFBCGYM6E5K7IQ/action/citation_signature","submit_replication":"https://pith.science/pith/3OJYS3TMNOIQPFBCGYM6E5K7IQ/action/replication_record"}},"created_at":"2026-07-05T02:54:26.913892+00:00","updated_at":"2026-07-05T02:54:26.913892+00:00"}