{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AU2BQFDIRA4HCJA7PMMPJIWXOG","short_pith_number":"pith:AU2BQFDI","schema_version":"1.0","canonical_sha256":"0534181468883871241f7b18f4a2d7719d81b011169e67a29f48cf29ab5316c4","source":{"kind":"arxiv","id":"1610.06447","version":4},"attestation_state":"computed","paper":{"title":"Regularized Optimal Transport and the Rot Mover's Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Arnaud Dessein, Jean-Luc Rouas, Nicolas Papadakis","submitted_at":"2016-10-20T14:49:36Z","abstract_excerpt":"This paper presents a unified framework for smooth convex regularization of discrete optimal transport problems. In this context, the regularized optimal transport turns out to be equivalent to a matrix nearness problem with respect to Bregman divergences. Our framework thus naturally generalizes a previously proposed regularization based on the Boltzmann-Shannon entropy related to the Kullback-Leibler divergence, and solved with the Sinkhorn-Knopp algorithm. We call the regularized optimal transport distance the rot mover's distance in reference to the classical earth mover's distance. We dev"},"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":"1610.06447","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-20T14:49:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e1fa6a2de57a66e05d45bac0cd1db022c4fea9b313eee6d29ee54727ad3195d5","abstract_canon_sha256":"c8812f3daa0cff0ceff24ce3a1ac14637ff3571a5efd764a23424bbb5ad35efe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:48.030770Z","signature_b64":"HlfaKndxVAwo9ErPaj3reL8ziTlqXOkPTyQaDFATvacIWwq6j81PzLBjDwa5RxHpswtOpu1IsuS6V+VCBO0fDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0534181468883871241f7b18f4a2d7719d81b011169e67a29f48cf29ab5316c4","last_reissued_at":"2026-05-18T00:10:48.030182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:48.030182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularized Optimal Transport and the Rot Mover's Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Arnaud Dessein, Jean-Luc Rouas, Nicolas Papadakis","submitted_at":"2016-10-20T14:49:36Z","abstract_excerpt":"This paper presents a unified framework for smooth convex regularization of discrete optimal transport problems. In this context, the regularized optimal transport turns out to be equivalent to a matrix nearness problem with respect to Bregman divergences. Our framework thus naturally generalizes a previously proposed regularization based on the Boltzmann-Shannon entropy related to the Kullback-Leibler divergence, and solved with the Sinkhorn-Knopp algorithm. We call the regularized optimal transport distance the rot mover's distance in reference to the classical earth mover's distance. We dev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06447","kind":"arxiv","version":4},"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":"1610.06447","created_at":"2026-05-18T00:10:48.030279+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06447v4","created_at":"2026-05-18T00:10:48.030279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06447","created_at":"2026-05-18T00:10:48.030279+00:00"},{"alias_kind":"pith_short_12","alias_value":"AU2BQFDIRA4H","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AU2BQFDIRA4HCJA7","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AU2BQFDI","created_at":"2026-05-18T12:30:07.202191+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/AU2BQFDIRA4HCJA7PMMPJIWXOG","json":"https://pith.science/pith/AU2BQFDIRA4HCJA7PMMPJIWXOG.json","graph_json":"https://pith.science/api/pith-number/AU2BQFDIRA4HCJA7PMMPJIWXOG/graph.json","events_json":"https://pith.science/api/pith-number/AU2BQFDIRA4HCJA7PMMPJIWXOG/events.json","paper":"https://pith.science/paper/AU2BQFDI"},"agent_actions":{"view_html":"https://pith.science/pith/AU2BQFDIRA4HCJA7PMMPJIWXOG","download_json":"https://pith.science/pith/AU2BQFDIRA4HCJA7PMMPJIWXOG.json","view_paper":"https://pith.science/paper/AU2BQFDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06447&json=true","fetch_graph":"https://pith.science/api/pith-number/AU2BQFDIRA4HCJA7PMMPJIWXOG/graph.json","fetch_events":"https://pith.science/api/pith-number/AU2BQFDIRA4HCJA7PMMPJIWXOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AU2BQFDIRA4HCJA7PMMPJIWXOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AU2BQFDIRA4HCJA7PMMPJIWXOG/action/storage_attestation","attest_author":"https://pith.science/pith/AU2BQFDIRA4HCJA7PMMPJIWXOG/action/author_attestation","sign_citation":"https://pith.science/pith/AU2BQFDIRA4HCJA7PMMPJIWXOG/action/citation_signature","submit_replication":"https://pith.science/pith/AU2BQFDIRA4HCJA7PMMPJIWXOG/action/replication_record"}},"created_at":"2026-05-18T00:10:48.030279+00:00","updated_at":"2026-05-18T00:10:48.030279+00:00"}