{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DX2ROIB7GIVYJZ45WK2OEKPKJC","short_pith_number":"pith:DX2ROIB7","schema_version":"1.0","canonical_sha256":"1df517203f322b84e79db2b4e229ea488079837af63679565498c1723d7d521a","source":{"kind":"arxiv","id":"1306.0895","version":1},"attestation_state":"computed","paper":{"title":"Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Marco Cuturi","submitted_at":"2013-06-04T14:45:10Z","abstract_excerpt":"Optimal transportation distances are a fundamental family of parameterized distances for histograms. Despite their appealing theoretical properties, excellent performance in retrieval tasks and intuitive formulation, their computation involves the resolution of a linear program whose cost is prohibitive whenever the histograms' dimension exceeds a few hundreds. We propose in this work a new family of optimal transportation distances that look at transportation problems from a maximum-entropy perspective. We smooth the classical optimal transportation problem with an entropic regularization ter"},"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":"1306.0895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-04T14:45:10Z","cross_cats_sorted":[],"title_canon_sha256":"9e597d7ca5a7988024bd877174764c086cee0e99abba47bda78740f0cf9f79d8","abstract_canon_sha256":"b8a544e29d97a3c68f3136392307886c4ad43c64e41f8dff6b3cc0c7641585fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:49.878415Z","signature_b64":"BN7G0hwDdR30/iNVgRIo7BOAgWpntJakFWN4Ca7v3Sc2GRWhLB9SsJ5fiSmEH/KD6kIIxhOXHpY9rbcQ9JPfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1df517203f322b84e79db2b4e229ea488079837af63679565498c1723d7d521a","last_reissued_at":"2026-05-18T02:55:49.877874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:49.877874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Marco Cuturi","submitted_at":"2013-06-04T14:45:10Z","abstract_excerpt":"Optimal transportation distances are a fundamental family of parameterized distances for histograms. Despite their appealing theoretical properties, excellent performance in retrieval tasks and intuitive formulation, their computation involves the resolution of a linear program whose cost is prohibitive whenever the histograms' dimension exceeds a few hundreds. We propose in this work a new family of optimal transportation distances that look at transportation problems from a maximum-entropy perspective. We smooth the classical optimal transportation problem with an entropic regularization ter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0895","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":""},"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":"1306.0895","created_at":"2026-05-18T02:55:49.877949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0895v1","created_at":"2026-05-18T02:55:49.877949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0895","created_at":"2026-05-18T02:55:49.877949+00:00"},{"alias_kind":"pith_short_12","alias_value":"DX2ROIB7GIVY","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DX2ROIB7GIVYJZ45","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DX2ROIB7","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19944","citing_title":"A Measure-Theoretic Analysis of Reasoning: Structural Generalization and Approximation Limits","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DX2ROIB7GIVYJZ45WK2OEKPKJC","json":"https://pith.science/pith/DX2ROIB7GIVYJZ45WK2OEKPKJC.json","graph_json":"https://pith.science/api/pith-number/DX2ROIB7GIVYJZ45WK2OEKPKJC/graph.json","events_json":"https://pith.science/api/pith-number/DX2ROIB7GIVYJZ45WK2OEKPKJC/events.json","paper":"https://pith.science/paper/DX2ROIB7"},"agent_actions":{"view_html":"https://pith.science/pith/DX2ROIB7GIVYJZ45WK2OEKPKJC","download_json":"https://pith.science/pith/DX2ROIB7GIVYJZ45WK2OEKPKJC.json","view_paper":"https://pith.science/paper/DX2ROIB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0895&json=true","fetch_graph":"https://pith.science/api/pith-number/DX2ROIB7GIVYJZ45WK2OEKPKJC/graph.json","fetch_events":"https://pith.science/api/pith-number/DX2ROIB7GIVYJZ45WK2OEKPKJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DX2ROIB7GIVYJZ45WK2OEKPKJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DX2ROIB7GIVYJZ45WK2OEKPKJC/action/storage_attestation","attest_author":"https://pith.science/pith/DX2ROIB7GIVYJZ45WK2OEKPKJC/action/author_attestation","sign_citation":"https://pith.science/pith/DX2ROIB7GIVYJZ45WK2OEKPKJC/action/citation_signature","submit_replication":"https://pith.science/pith/DX2ROIB7GIVYJZ45WK2OEKPKJC/action/replication_record"}},"created_at":"2026-05-18T02:55:49.877949+00:00","updated_at":"2026-05-18T02:55:49.877949+00:00"}