{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JSO5HCTOCV6O6OHH7AMXIZCTL6","short_pith_number":"pith:JSO5HCTO","schema_version":"1.0","canonical_sha256":"4c9dd38a6e157cef38e7f8197464535fb3736804aae3bf13d821b1fcf8ad0090","source":{"kind":"arxiv","id":"1905.12206","version":2},"attestation_state":"computed","paper":{"title":"On the difference between entropic cost and the optimal transport cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Soumik Pal","submitted_at":"2019-05-29T04:15:03Z","abstract_excerpt":"Consider the Monge-Kantorovich problem of transporting densities $\\rho_0$ to $\\rho_1$ on $\\mathbb{R}^d$ with a strictly convex cost function. A popular relaxation of the problem is the one-parameter family called the entropic cost problem. The entropic cost $K_h$, $h>0$, is significantly faster to compute and $h K_h$ is known to converge to the optimal transport cost as $h$ goes to zero. We are interested the rate of convergence. We show that the difference between $K_h$ and $1/h$ times the optimal cost of transport has a pointwise limit when transporting a compactly supported density to anoth"},"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":"1905.12206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-29T04:15:03Z","cross_cats_sorted":[],"title_canon_sha256":"b48945d313451c00a4d0f013bd88cb1e3743811d0dba5b19fdcccfd4a7ea845c","abstract_canon_sha256":"c0633af4cead9b1d64b8c623a56238507ca71343ec898a913280c35e556d37cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:11:20.780900Z","signature_b64":"fuG/j1QSd6jJ63UoMVNtlUZgJZZkcMWpY3QAqGHSZ8i/PbqNtVZma4MgJ1sk15hjbmK73SijYC6GwiOw9sbrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c9dd38a6e157cef38e7f8197464535fb3736804aae3bf13d821b1fcf8ad0090","last_reissued_at":"2026-07-05T00:11:20.780475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:11:20.780475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the difference between entropic cost and the optimal transport cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Soumik Pal","submitted_at":"2019-05-29T04:15:03Z","abstract_excerpt":"Consider the Monge-Kantorovich problem of transporting densities $\\rho_0$ to $\\rho_1$ on $\\mathbb{R}^d$ with a strictly convex cost function. A popular relaxation of the problem is the one-parameter family called the entropic cost problem. The entropic cost $K_h$, $h>0$, is significantly faster to compute and $h K_h$ is known to converge to the optimal transport cost as $h$ goes to zero. We are interested the rate of convergence. We show that the difference between $K_h$ and $1/h$ times the optimal cost of transport has a pointwise limit when transporting a compactly supported density to anoth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12206","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/1905.12206/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":"1905.12206","created_at":"2026-07-05T00:11:20.780536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12206v2","created_at":"2026-07-05T00:11:20.780536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12206","created_at":"2026-07-05T00:11:20.780536+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSO5HCTOCV6O","created_at":"2026-07-05T00:11:20.780536+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSO5HCTOCV6O6OHH","created_at":"2026-07-05T00:11:20.780536+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSO5HCTO","created_at":"2026-07-05T00:11:20.780536+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2307.16421","citing_title":"Wasserstein Mirror Gradient Flow as the limit of the Sinkhorn Algorithm","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JSO5HCTOCV6O6OHH7AMXIZCTL6","json":"https://pith.science/pith/JSO5HCTOCV6O6OHH7AMXIZCTL6.json","graph_json":"https://pith.science/api/pith-number/JSO5HCTOCV6O6OHH7AMXIZCTL6/graph.json","events_json":"https://pith.science/api/pith-number/JSO5HCTOCV6O6OHH7AMXIZCTL6/events.json","paper":"https://pith.science/paper/JSO5HCTO"},"agent_actions":{"view_html":"https://pith.science/pith/JSO5HCTOCV6O6OHH7AMXIZCTL6","download_json":"https://pith.science/pith/JSO5HCTOCV6O6OHH7AMXIZCTL6.json","view_paper":"https://pith.science/paper/JSO5HCTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12206&json=true","fetch_graph":"https://pith.science/api/pith-number/JSO5HCTOCV6O6OHH7AMXIZCTL6/graph.json","fetch_events":"https://pith.science/api/pith-number/JSO5HCTOCV6O6OHH7AMXIZCTL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSO5HCTOCV6O6OHH7AMXIZCTL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSO5HCTOCV6O6OHH7AMXIZCTL6/action/storage_attestation","attest_author":"https://pith.science/pith/JSO5HCTOCV6O6OHH7AMXIZCTL6/action/author_attestation","sign_citation":"https://pith.science/pith/JSO5HCTOCV6O6OHH7AMXIZCTL6/action/citation_signature","submit_replication":"https://pith.science/pith/JSO5HCTOCV6O6OHH7AMXIZCTL6/action/replication_record"}},"created_at":"2026-07-05T00:11:20.780536+00:00","updated_at":"2026-07-05T00:11:20.780536+00:00"}