{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WFPTHEGMYT53NUMURV5JTYKWPB","short_pith_number":"pith:WFPTHEGM","schema_version":"1.0","canonical_sha256":"b15f3390ccc4fbb6d1948d7a99e15678475ac23716ea9ba75d6eb9503851ebb9","source":{"kind":"arxiv","id":"2006.16548","version":1},"attestation_state":"computed","paper":{"title":"Sinkhorn EM: An Expectation-Maximization algorithm based on entropic optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"Amin Nejatbakhsh, Erdem Varol, Gonzalo Mena, Jonathan Niles-Weed","submitted_at":"2020-06-30T06:03:37Z","abstract_excerpt":"We study Sinkhorn EM (sEM), a variant of the expectation maximization (EM) algorithm for mixtures based on entropic optimal transport. sEM differs from the classic EM algorithm in the way responsibilities are computed during the expectation step: rather than assign data points to clusters independently, sEM uses optimal transport to compute responsibilities by incorporating prior information about mixing weights. Like EM, sEM has a natural interpretation as a coordinate ascent procedure, which iteratively constructs and optimizes a lower bound on the log-likelihood. However, we show theoretica"},"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":"2006.16548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-30T06:03:37Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"title_canon_sha256":"f33cb04160a3a2a35d8543b575ba3ccbbb2bf67d6c5d7225f35539a9e1023057","abstract_canon_sha256":"fe72ab670dc308fd9d4fd725b31d7d2f8c52bf053cd62129079f4477302c2d6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:14:56.154782Z","signature_b64":"FhU22QKL3EOFuMjxqW/YOZ2vAzVDWC73Lf/kQu0LmCzz3mg9hFttZKnr91SAvbTV5GnxHcaomuq8K1DCbmOQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b15f3390ccc4fbb6d1948d7a99e15678475ac23716ea9ba75d6eb9503851ebb9","last_reissued_at":"2026-07-05T01:14:56.154369Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:14:56.154369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sinkhorn EM: An Expectation-Maximization algorithm based on entropic optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"Amin Nejatbakhsh, Erdem Varol, Gonzalo Mena, Jonathan Niles-Weed","submitted_at":"2020-06-30T06:03:37Z","abstract_excerpt":"We study Sinkhorn EM (sEM), a variant of the expectation maximization (EM) algorithm for mixtures based on entropic optimal transport. sEM differs from the classic EM algorithm in the way responsibilities are computed during the expectation step: rather than assign data points to clusters independently, sEM uses optimal transport to compute responsibilities by incorporating prior information about mixing weights. Like EM, sEM has a natural interpretation as a coordinate ascent procedure, which iteratively constructs and optimizes a lower bound on the log-likelihood. However, we show theoretica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.16548","kind":"arxiv","version":1},"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/2006.16548/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":"2006.16548","created_at":"2026-07-05T01:14:56.154425+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.16548v1","created_at":"2026-07-05T01:14:56.154425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.16548","created_at":"2026-07-05T01:14:56.154425+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFPTHEGMYT53","created_at":"2026-07-05T01:14:56.154425+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFPTHEGMYT53NUMU","created_at":"2026-07-05T01:14:56.154425+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFPTHEGM","created_at":"2026-07-05T01:14:56.154425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08550","citing_title":"A Call to Lagrangian Action: Learning Population Mechanics from Temporal Snapshots","ref_index":179,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08550","citing_title":"A Call to Lagrangian Action: Learning Population Mechanics from Temporal Snapshots","ref_index":179,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08550","citing_title":"A Call to Lagrangian Action: Learning Population Mechanics from Temporal Snapshots","ref_index":179,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03240","citing_title":"On Model-Based Clustering With Entropic Optimal Transport","ref_index":152,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WFPTHEGMYT53NUMURV5JTYKWPB","json":"https://pith.science/pith/WFPTHEGMYT53NUMURV5JTYKWPB.json","graph_json":"https://pith.science/api/pith-number/WFPTHEGMYT53NUMURV5JTYKWPB/graph.json","events_json":"https://pith.science/api/pith-number/WFPTHEGMYT53NUMURV5JTYKWPB/events.json","paper":"https://pith.science/paper/WFPTHEGM"},"agent_actions":{"view_html":"https://pith.science/pith/WFPTHEGMYT53NUMURV5JTYKWPB","download_json":"https://pith.science/pith/WFPTHEGMYT53NUMURV5JTYKWPB.json","view_paper":"https://pith.science/paper/WFPTHEGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.16548&json=true","fetch_graph":"https://pith.science/api/pith-number/WFPTHEGMYT53NUMURV5JTYKWPB/graph.json","fetch_events":"https://pith.science/api/pith-number/WFPTHEGMYT53NUMURV5JTYKWPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFPTHEGMYT53NUMURV5JTYKWPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFPTHEGMYT53NUMURV5JTYKWPB/action/storage_attestation","attest_author":"https://pith.science/pith/WFPTHEGMYT53NUMURV5JTYKWPB/action/author_attestation","sign_citation":"https://pith.science/pith/WFPTHEGMYT53NUMURV5JTYKWPB/action/citation_signature","submit_replication":"https://pith.science/pith/WFPTHEGMYT53NUMURV5JTYKWPB/action/replication_record"}},"created_at":"2026-07-05T01:14:56.154425+00:00","updated_at":"2026-07-05T01:14:56.154425+00:00"}