{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZUB2YOHYY5L3E7B7GTBGYPTZW7","short_pith_number":"pith:ZUB2YOHY","schema_version":"1.0","canonical_sha256":"cd03ac38f8c757b27c3f34c26c3e79b7d0dc125363991b80f03d8d0720ddecfd","source":{"kind":"arxiv","id":"1812.04356","version":3},"attestation_state":"computed","paper":{"title":"Robust Bregman Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Aur\\'elie Fischer (LPSM (UMR\\_8001)), Claire Br\\'echeteau (ECN, Cl\\'ement Levrard (DATASHAPE, DATASHAPE), LMJL, LPSM (UMR\\_8001))","submitted_at":"2018-12-11T12:35:36Z","abstract_excerpt":"Using a trimming approach, we investigate a k-means type method based on Bregman divergences for clustering data possibly corrupted with clutter noise. The main interest of Bregman divergences is that the standard Lloyd algorithm adapts to these distortion measures, and they are well-suited for clustering data sampled according to mixture models from exponential families. We prove that there exists an optimal codebook, and that an empirically optimal codebook converges a.s. to an optimal codebook in the distortion sense. Moreover, we obtain the sub-Gaussian rate of convergence for k-means 1 $\\"},"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":"1812.04356","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-12-11T12:35:36Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"3f0301542331eb2230c8583e70867514d0ee4ae7bd569fb22fcc2f85e5d2863d","abstract_canon_sha256":"53b3185cfe134b86dd19d46b31c56c80a9f636b6d16f52b3068dbc7ab8af8835"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:34:03.815914Z","signature_b64":"iumEdNtEa4rIxDcoH3yO2ghctqAWn0GjaafmORb59JUVqlia3QKW9dEbo/vKKRsGmsbdyNIhyynnKlXkVYi2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd03ac38f8c757b27c3f34c26c3e79b7d0dc125363991b80f03d8d0720ddecfd","last_reissued_at":"2026-07-05T01:34:03.815513Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:34:03.815513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Bregman Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Aur\\'elie Fischer (LPSM (UMR\\_8001)), Claire Br\\'echeteau (ECN, Cl\\'ement Levrard (DATASHAPE, DATASHAPE), LMJL, LPSM (UMR\\_8001))","submitted_at":"2018-12-11T12:35:36Z","abstract_excerpt":"Using a trimming approach, we investigate a k-means type method based on Bregman divergences for clustering data possibly corrupted with clutter noise. The main interest of Bregman divergences is that the standard Lloyd algorithm adapts to these distortion measures, and they are well-suited for clustering data sampled according to mixture models from exponential families. We prove that there exists an optimal codebook, and that an empirically optimal codebook converges a.s. to an optimal codebook in the distortion sense. Moreover, we obtain the sub-Gaussian rate of convergence for k-means 1 $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04356","kind":"arxiv","version":3},"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/1812.04356/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":"1812.04356","created_at":"2026-07-05T01:34:03.815580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.04356v3","created_at":"2026-07-05T01:34:03.815580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04356","created_at":"2026-07-05T01:34:03.815580+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUB2YOHYY5L3","created_at":"2026-07-05T01:34:03.815580+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUB2YOHYY5L3E7B7","created_at":"2026-07-05T01:34:03.815580+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUB2YOHY","created_at":"2026-07-05T01:34:03.815580+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/ZUB2YOHYY5L3E7B7GTBGYPTZW7","json":"https://pith.science/pith/ZUB2YOHYY5L3E7B7GTBGYPTZW7.json","graph_json":"https://pith.science/api/pith-number/ZUB2YOHYY5L3E7B7GTBGYPTZW7/graph.json","events_json":"https://pith.science/api/pith-number/ZUB2YOHYY5L3E7B7GTBGYPTZW7/events.json","paper":"https://pith.science/paper/ZUB2YOHY"},"agent_actions":{"view_html":"https://pith.science/pith/ZUB2YOHYY5L3E7B7GTBGYPTZW7","download_json":"https://pith.science/pith/ZUB2YOHYY5L3E7B7GTBGYPTZW7.json","view_paper":"https://pith.science/paper/ZUB2YOHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.04356&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUB2YOHYY5L3E7B7GTBGYPTZW7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUB2YOHYY5L3E7B7GTBGYPTZW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUB2YOHYY5L3E7B7GTBGYPTZW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUB2YOHYY5L3E7B7GTBGYPTZW7/action/storage_attestation","attest_author":"https://pith.science/pith/ZUB2YOHYY5L3E7B7GTBGYPTZW7/action/author_attestation","sign_citation":"https://pith.science/pith/ZUB2YOHYY5L3E7B7GTBGYPTZW7/action/citation_signature","submit_replication":"https://pith.science/pith/ZUB2YOHYY5L3E7B7GTBGYPTZW7/action/replication_record"}},"created_at":"2026-07-05T01:34:03.815580+00:00","updated_at":"2026-07-05T01:34:03.815580+00:00"}