{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HGYX2XCEYWSJZQPLBZRUG5I3CM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"247e5e61f7c24290b08a96f8b9e3629dc605472d095c72930ab81bb4e9ee9dbb","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T21:52:54Z","title_canon_sha256":"8f60ec44d5d94c27e12ffbb1b5d7eead715b08a8546754af6e31323fecc1764c"},"schema_version":"1.0","source":{"id":"1711.04366","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04366","created_at":"2026-07-05T07:53:27Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04366v2","created_at":"2026-07-05T07:53:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04366","created_at":"2026-07-05T07:53:27Z"},{"alias_kind":"pith_short_12","alias_value":"HGYX2XCEYWSJ","created_at":"2026-07-05T07:53:27Z"},{"alias_kind":"pith_short_16","alias_value":"HGYX2XCEYWSJZQPL","created_at":"2026-07-05T07:53:27Z"},{"alias_kind":"pith_short_8","alias_value":"HGYX2XCE","created_at":"2026-07-05T07:53:27Z"}],"graph_snapshots":[{"event_id":"sha256:f83e643bfe333fecc40aa08969648222bfff1ab7eee703a129cd982fea2d3890","target":"graph","created_at":"2026-07-05T07:53:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1711.04366/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we formulate the problem of inferring a Finite Mixture Model from discrete data as an optimal transport problem with entropic regularization of parameter $\\lambda\\geq 0$. Our method unifies hard and soft clustering, the Expectation-Maximization (EM) algorithm being exactly recovered for $\\lambda=1$. The family of clustering algorithm we propose rely on the resolution of nonconvex problems using alternating minimization. We study the convergence property of our generalized $\\lambda-$EM algorithms and show that each step in the minimization process has a closed form solution when ","authors_text":"Arnaud Dessein, Charles-Alban Deledalle, Jean-Fr\\'ed\\'eric Diebold, Nicolas Papadakis","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T21:52:54Z","title":"A unified framework for hard and soft clustering with regularized optimal transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04366","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e5c9f84a43205ae439d0d06398498b04d2e909d13a2ce248a9672da703eb053f","target":"record","created_at":"2026-07-05T07:53:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"247e5e61f7c24290b08a96f8b9e3629dc605472d095c72930ab81bb4e9ee9dbb","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T21:52:54Z","title_canon_sha256":"8f60ec44d5d94c27e12ffbb1b5d7eead715b08a8546754af6e31323fecc1764c"},"schema_version":"1.0","source":{"id":"1711.04366","kind":"arxiv","version":2}},"canonical_sha256":"39b17d5c44c5a49cc1eb0e6343751b130f09a9a3a912aa5c24ae5ba924145aaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39b17d5c44c5a49cc1eb0e6343751b130f09a9a3a912aa5c24ae5ba924145aaa","first_computed_at":"2026-07-05T07:53:27.802623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:53:27.802623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ezMYFKZVwYvCsX4dZLq7Ot8tFTY7o7+FaM6dzk2RHGWXyco5MnwGhgR94EV1meIwoIUdCIZuLBozO3f4a8dbDg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:53:27.803187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04366","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5c9f84a43205ae439d0d06398498b04d2e909d13a2ce248a9672da703eb053f","sha256:f83e643bfe333fecc40aa08969648222bfff1ab7eee703a129cd982fea2d3890"],"state_sha256":"eea71cfa4e750ac2f6ae558de464a0782cf823e517de18b21ac77d5dac68ce16"}