{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SNVUXCT3H7S5DXND45JU7CLWKR","short_pith_number":"pith:SNVUXCT3","schema_version":"1.0","canonical_sha256":"936b4b8a7b3fe5d1dda3e7534f8976545ec6377bd8b96622c65e33104d2b718e","source":{"kind":"arxiv","id":"2302.01237","version":2},"attestation_state":"computed","paper":{"title":"Robust Estimation under the Wasserstein Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Rachel Cummings, Sloan Nietert, Ziv Goldfeld","submitted_at":"2023-02-02T17:20:25Z","abstract_excerpt":"We study the problem of robust distribution estimation under the Wasserstein distance, a popular discrepancy measure between probability distributions rooted in optimal transport (OT) theory. Given $n$ samples from an unknown distribution $\\mu$, of which $\\varepsilon n$ are adversarially corrupted, we seek an estimate for $\\mu$ with minimal Wasserstein error. To address this task, we draw upon two frameworks from OT and robust statistics: partial OT (POT) and minimum distance estimation (MDE). We prove new structural properties for POT and use them to show that MDE under a partial Wasserstein "},"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":"2302.01237","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-02-02T17:20:25Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"822ed3b81b225d7253ff1a6d3560741ab15a9c95624c50d6ba510add21bd8937","abstract_canon_sha256":"08b8bccdc5146eafe5ba00a389673f216c7600745f4c24109bf7211d13224a3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:40.696239Z","signature_b64":"Gt4TGoWqmP4Y3t19rqrWSDcYC4bJ2rpvlbRhyzIOc2Jp0/Ck540Qp1TwYvzYVfFVANUkPbNiLxh0J2a0dP+mBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"936b4b8a7b3fe5d1dda3e7534f8976545ec6377bd8b96622c65e33104d2b718e","last_reissued_at":"2026-07-05T09:10:40.695788Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:40.695788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Estimation under the Wasserstein Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Rachel Cummings, Sloan Nietert, Ziv Goldfeld","submitted_at":"2023-02-02T17:20:25Z","abstract_excerpt":"We study the problem of robust distribution estimation under the Wasserstein distance, a popular discrepancy measure between probability distributions rooted in optimal transport (OT) theory. Given $n$ samples from an unknown distribution $\\mu$, of which $\\varepsilon n$ are adversarially corrupted, we seek an estimate for $\\mu$ with minimal Wasserstein error. To address this task, we draw upon two frameworks from OT and robust statistics: partial OT (POT) and minimum distance estimation (MDE). We prove new structural properties for POT and use them to show that MDE under a partial Wasserstein "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.01237","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.01237/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":"2302.01237","created_at":"2026-07-05T09:10:40.695846+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.01237v2","created_at":"2026-07-05T09:10:40.695846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.01237","created_at":"2026-07-05T09:10:40.695846+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNVUXCT3H7S5","created_at":"2026-07-05T09:10:40.695846+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNVUXCT3H7S5DXND","created_at":"2026-07-05T09:10:40.695846+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNVUXCT3","created_at":"2026-07-05T09:10:40.695846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.18741","citing_title":"Robust Simulation Based Inference Through Robust Optimal Transport","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18741","citing_title":"Robust Simulation Based Inference Through Robust Optimal Transport","ref_index":129,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SNVUXCT3H7S5DXND45JU7CLWKR","json":"https://pith.science/pith/SNVUXCT3H7S5DXND45JU7CLWKR.json","graph_json":"https://pith.science/api/pith-number/SNVUXCT3H7S5DXND45JU7CLWKR/graph.json","events_json":"https://pith.science/api/pith-number/SNVUXCT3H7S5DXND45JU7CLWKR/events.json","paper":"https://pith.science/paper/SNVUXCT3"},"agent_actions":{"view_html":"https://pith.science/pith/SNVUXCT3H7S5DXND45JU7CLWKR","download_json":"https://pith.science/pith/SNVUXCT3H7S5DXND45JU7CLWKR.json","view_paper":"https://pith.science/paper/SNVUXCT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.01237&json=true","fetch_graph":"https://pith.science/api/pith-number/SNVUXCT3H7S5DXND45JU7CLWKR/graph.json","fetch_events":"https://pith.science/api/pith-number/SNVUXCT3H7S5DXND45JU7CLWKR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNVUXCT3H7S5DXND45JU7CLWKR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNVUXCT3H7S5DXND45JU7CLWKR/action/storage_attestation","attest_author":"https://pith.science/pith/SNVUXCT3H7S5DXND45JU7CLWKR/action/author_attestation","sign_citation":"https://pith.science/pith/SNVUXCT3H7S5DXND45JU7CLWKR/action/citation_signature","submit_replication":"https://pith.science/pith/SNVUXCT3H7S5DXND45JU7CLWKR/action/replication_record"}},"created_at":"2026-07-05T09:10:40.695846+00:00","updated_at":"2026-07-05T09:10:40.695846+00:00"}