{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AGVW3XLP45GQWUDOIXXDIYQDVO","short_pith_number":"pith:AGVW3XLP","schema_version":"1.0","canonical_sha256":"01ab6ddd6fe74d0b506e45ee346203ab88c962cc77c8a4cd7cede576c4025492","source":{"kind":"arxiv","id":"2106.01963","version":1},"attestation_state":"computed","paper":{"title":"A Survey on Optimal Transport for Machine Learning: Theory and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Luis Caicedo Torres, Luiz Manella Pereira, M. Hadi Amini","submitted_at":"2021-06-03T16:10:42Z","abstract_excerpt":"Optimal Transport (OT) theory has seen an increasing amount of attention from the computer science community due to its potency and relevance in modeling and machine learning. It introduces means that serve as powerful ways to compare probability distributions with each other, as well as producing optimal mappings to minimize cost functions. In this survey, we present a brief introduction and history, a survey of previous work and propose directions of future study. We will begin by looking at the history of optimal transport and introducing the founders of this field. We then give a brief gla"},"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":"2106.01963","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-03T16:10:42Z","cross_cats_sorted":[],"title_canon_sha256":"285cca1ecc6223cb3187799ee1704a6f09c11200463a000e906a887277e0783b","abstract_canon_sha256":"a4f8b98b99d6595720a6d8a736781acb8b08637c99bccf777d6e15a9f107b10d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:06.133799Z","signature_b64":"me0suKatPQnhArRb3EGErDFnhb+QInIZdMYptfSYh6uk643cTmkBDmhkhKStvzRqkMQjIAtyO8+BjwOP+LMkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01ab6ddd6fe74d0b506e45ee346203ab88c962cc77c8a4cd7cede576c4025492","last_reissued_at":"2026-07-05T02:46:06.133265Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:06.133265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey on Optimal Transport for Machine Learning: Theory and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Luis Caicedo Torres, Luiz Manella Pereira, M. Hadi Amini","submitted_at":"2021-06-03T16:10:42Z","abstract_excerpt":"Optimal Transport (OT) theory has seen an increasing amount of attention from the computer science community due to its potency and relevance in modeling and machine learning. It introduces means that serve as powerful ways to compare probability distributions with each other, as well as producing optimal mappings to minimize cost functions. In this survey, we present a brief introduction and history, a survey of previous work and propose directions of future study. We will begin by looking at the history of optimal transport and introducing the founders of this field. We then give a brief gla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.01963","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/2106.01963/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":"2106.01963","created_at":"2026-07-05T02:46:06.133330+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.01963v1","created_at":"2026-07-05T02:46:06.133330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.01963","created_at":"2026-07-05T02:46:06.133330+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGVW3XLP45GQ","created_at":"2026-07-05T02:46:06.133330+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGVW3XLP45GQWUDO","created_at":"2026-07-05T02:46:06.133330+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGVW3XLP","created_at":"2026-07-05T02:46:06.133330+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.03749","citing_title":"PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2509.14521","citing_title":"Geometry-Aware Decentralized Sinkhorn for Wasserstein Barycenters","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AGVW3XLP45GQWUDOIXXDIYQDVO","json":"https://pith.science/pith/AGVW3XLP45GQWUDOIXXDIYQDVO.json","graph_json":"https://pith.science/api/pith-number/AGVW3XLP45GQWUDOIXXDIYQDVO/graph.json","events_json":"https://pith.science/api/pith-number/AGVW3XLP45GQWUDOIXXDIYQDVO/events.json","paper":"https://pith.science/paper/AGVW3XLP"},"agent_actions":{"view_html":"https://pith.science/pith/AGVW3XLP45GQWUDOIXXDIYQDVO","download_json":"https://pith.science/pith/AGVW3XLP45GQWUDOIXXDIYQDVO.json","view_paper":"https://pith.science/paper/AGVW3XLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.01963&json=true","fetch_graph":"https://pith.science/api/pith-number/AGVW3XLP45GQWUDOIXXDIYQDVO/graph.json","fetch_events":"https://pith.science/api/pith-number/AGVW3XLP45GQWUDOIXXDIYQDVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGVW3XLP45GQWUDOIXXDIYQDVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGVW3XLP45GQWUDOIXXDIYQDVO/action/storage_attestation","attest_author":"https://pith.science/pith/AGVW3XLP45GQWUDOIXXDIYQDVO/action/author_attestation","sign_citation":"https://pith.science/pith/AGVW3XLP45GQWUDOIXXDIYQDVO/action/citation_signature","submit_replication":"https://pith.science/pith/AGVW3XLP45GQWUDOIXXDIYQDVO/action/replication_record"}},"created_at":"2026-07-05T02:46:06.133330+00:00","updated_at":"2026-07-05T02:46:06.133330+00:00"}