{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HGYX2XCEYWSJZQPLBZRUG5I3CM","short_pith_number":"pith:HGYX2XCE","canonical_record":{"source":{"id":"1711.04366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T21:52:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8f60ec44d5d94c27e12ffbb1b5d7eead715b08a8546754af6e31323fecc1764c","abstract_canon_sha256":"247e5e61f7c24290b08a96f8b9e3629dc605472d095c72930ab81bb4e9ee9dbb"},"schema_version":"1.0"},"canonical_sha256":"39b17d5c44c5a49cc1eb0e6343751b130f09a9a3a912aa5c24ae5ba924145aaa","source":{"kind":"arxiv","id":"1711.04366","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HGYX2XCEYWSJZQPLBZRUG5I3CM","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-12T21:52:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8f60ec44d5d94c27e12ffbb1b5d7eead715b08a8546754af6e31323fecc1764c","abstract_canon_sha256":"247e5e61f7c24290b08a96f8b9e3629dc605472d095c72930ab81bb4e9ee9dbb"},"schema_version":"1.0"},"canonical_sha256":"39b17d5c44c5a49cc1eb0e6343751b130f09a9a3a912aa5c24ae5ba924145aaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:53:27.803187Z","signature_b64":"ezMYFKZVwYvCsX4dZLq7Ot8tFTY7o7+FaM6dzk2RHGWXyco5MnwGhgR94EV1meIwoIUdCIZuLBozO3f4a8dbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39b17d5c44c5a49cc1eb0e6343751b130f09a9a3a912aa5c24ae5ba924145aaa","last_reissued_at":"2026-07-05T07:53:27.802623Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:53:27.802623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04366","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:53:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DUcK2XnpUPZWcnuOLt+DLfDgGPVNnNSEyb1W86F+2wOIAQxOkjd1x12H86CWXfzdk4meK9a7nYejtme4EXFACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:30:32.120935Z"},"content_sha256":"e5c9f84a43205ae439d0d06398498b04d2e909d13a2ce248a9672da703eb053f","schema_version":"1.0","event_id":"sha256:e5c9f84a43205ae439d0d06398498b04d2e909d13a2ce248a9672da703eb053f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HGYX2XCEYWSJZQPLBZRUG5I3CM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A unified framework for hard and soft clustering with regularized optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Arnaud Dessein, Charles-Alban Deledalle, Jean-Fr\\'ed\\'eric Diebold, Nicolas Papadakis","submitted_at":"2017-11-12T21:52:54Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04366","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/1711.04366/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:53:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dJEqTJOR5NOxFWtT+jdS+xMN+MbBuHKc7Flp6sH0A9SuQchi4J6p6pfe2rZWw/8zyI+k8nSa+OmBo+K08v9cCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:30:32.121994Z"},"content_sha256":"f83e643bfe333fecc40aa08969648222bfff1ab7eee703a129cd982fea2d3890","schema_version":"1.0","event_id":"sha256:f83e643bfe333fecc40aa08969648222bfff1ab7eee703a129cd982fea2d3890"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGYX2XCEYWSJZQPLBZRUG5I3CM/bundle.json","state_url":"https://pith.science/pith/HGYX2XCEYWSJZQPLBZRUG5I3CM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGYX2XCEYWSJZQPLBZRUG5I3CM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T06:30:32Z","links":{"resolver":"https://pith.science/pith/HGYX2XCEYWSJZQPLBZRUG5I3CM","bundle":"https://pith.science/pith/HGYX2XCEYWSJZQPLBZRUG5I3CM/bundle.json","state":"https://pith.science/pith/HGYX2XCEYWSJZQPLBZRUG5I3CM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGYX2XCEYWSJZQPLBZRUG5I3CM/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STlRe0y02F7nCO5K8R50eHWq8xigiTv5+PyhDEQHFoqbO8xIKyfIcDaH0jQtmamqlqshNOw1nfCcy3pMG8OCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:30:32.126494Z","bundle_sha256":"ae8557f8787678dec4ff3fe329a1b04b898918805f381969634c5c315f759f73"}}