{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RHKYIEBFHQEEJPY5MFJPYTM6DO","short_pith_number":"pith:RHKYIEBF","schema_version":"1.0","canonical_sha256":"89d58410253c0844bf1d6152fc4d9e1b8129f4511df7842679a1cd447dcc79a7","source":{"kind":"arxiv","id":"1607.01179","version":2},"attestation_state":"computed","paper":{"title":"Robust clustering tools based on optimal transportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"A. Mayo-\\'Iscar, C. Matr\\'an, E. del Barrio, J.A. Cuesta-Albertos","submitted_at":"2016-07-05T10:23:29Z","abstract_excerpt":"A robust clustering method for probabilities in Wasserstein space is introduced. This new \"trimmed $k$-barycenters\" approach relies on recent results on barycenters in Wasserstein space that allow intensive computation, as required by clustering algorithms. The possibility of trimming the most discrepant distributions results in a gain in stability and robustness, highly convenient in this setting. As a remarkable application we consider a parallelized estimation setup in which each of $m$ units processes a portion of the data, producing an estimate of $k$-features, encoded as $k$ probabilitie"},"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":"1607.01179","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-07-05T10:23:29Z","cross_cats_sorted":[],"title_canon_sha256":"6a062b44da0439f4af10ad49daced18d7081166e35482345347b7fa0ecaf832b","abstract_canon_sha256":"452b88d00b886aa70b20f5fc15f7be85ef11ccdb9f8431d5f9b164ca2e13cd89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:48.856432Z","signature_b64":"/avp5odxwWATdYVAvTlsQSGXvkiiZrPLcmOaLPZGscZy1MJvome7iLwfzmFAt8Rg7wbLfEWRfzETme5IgxViAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89d58410253c0844bf1d6152fc4d9e1b8129f4511df7842679a1cd447dcc79a7","last_reissued_at":"2026-05-17T23:54:48.855735Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:48.855735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust clustering tools based on optimal transportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"A. Mayo-\\'Iscar, C. Matr\\'an, E. del Barrio, J.A. Cuesta-Albertos","submitted_at":"2016-07-05T10:23:29Z","abstract_excerpt":"A robust clustering method for probabilities in Wasserstein space is introduced. This new \"trimmed $k$-barycenters\" approach relies on recent results on barycenters in Wasserstein space that allow intensive computation, as required by clustering algorithms. The possibility of trimming the most discrepant distributions results in a gain in stability and robustness, highly convenient in this setting. As a remarkable application we consider a parallelized estimation setup in which each of $m$ units processes a portion of the data, producing an estimate of $k$-features, encoded as $k$ probabilitie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01179","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":"1607.01179","created_at":"2026-05-17T23:54:48.855868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01179v2","created_at":"2026-05-17T23:54:48.855868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01179","created_at":"2026-05-17T23:54:48.855868+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHKYIEBFHQEE","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHKYIEBFHQEEJPY5","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHKYIEBF","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RHKYIEBFHQEEJPY5MFJPYTM6DO","json":"https://pith.science/pith/RHKYIEBFHQEEJPY5MFJPYTM6DO.json","graph_json":"https://pith.science/api/pith-number/RHKYIEBFHQEEJPY5MFJPYTM6DO/graph.json","events_json":"https://pith.science/api/pith-number/RHKYIEBFHQEEJPY5MFJPYTM6DO/events.json","paper":"https://pith.science/paper/RHKYIEBF"},"agent_actions":{"view_html":"https://pith.science/pith/RHKYIEBFHQEEJPY5MFJPYTM6DO","download_json":"https://pith.science/pith/RHKYIEBFHQEEJPY5MFJPYTM6DO.json","view_paper":"https://pith.science/paper/RHKYIEBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01179&json=true","fetch_graph":"https://pith.science/api/pith-number/RHKYIEBFHQEEJPY5MFJPYTM6DO/graph.json","fetch_events":"https://pith.science/api/pith-number/RHKYIEBFHQEEJPY5MFJPYTM6DO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHKYIEBFHQEEJPY5MFJPYTM6DO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHKYIEBFHQEEJPY5MFJPYTM6DO/action/storage_attestation","attest_author":"https://pith.science/pith/RHKYIEBFHQEEJPY5MFJPYTM6DO/action/author_attestation","sign_citation":"https://pith.science/pith/RHKYIEBFHQEEJPY5MFJPYTM6DO/action/citation_signature","submit_replication":"https://pith.science/pith/RHKYIEBFHQEEJPY5MFJPYTM6DO/action/replication_record"}},"created_at":"2026-05-17T23:54:48.855868+00:00","updated_at":"2026-05-17T23:54:48.855868+00:00"}