{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3U3GNLCEV2WF5NPMBGY5WIY3OF","short_pith_number":"pith:3U3GNLCE","schema_version":"1.0","canonical_sha256":"dd3666ac44aeac5eb5ec09b1db231b7155cef599ac6e9f25f1874d844d2a08e2","source":{"kind":"arxiv","id":"2407.01202","version":2},"attestation_state":"computed","paper":{"title":"Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alex Delalande, L\\'ena\\\"ic Chizat, Tomas Va\\v{s}kevi\\v{c}ius","submitted_at":"2024-07-01T11:49:30Z","abstract_excerpt":"We study the convergence rate of Sinkhorn's algorithm for solving entropy-regularized optimal transport problems when at least one of the probability measures, $\\mu$, admits a density over $\\mathbb{R}^d$. For a semi-concave cost function bounded by $c_{\\infty}$ and a regularization parameter $\\lambda > 0$, we obtain exponential convergence guarantees on the dual sub-optimality gap with contraction rate polynomial in $\\lambda/c_{\\infty}$. This represents an exponential improvement over the known contraction rate $1 - \\Theta(\\exp(-c_{\\infty}/\\lambda))$ achievable via Hilbert's projective metric."},"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":"2407.01202","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-01T11:49:30Z","cross_cats_sorted":[],"title_canon_sha256":"1ccaabcc62bfe09160e7ae7b4305808886cc72b086be0db57352ab6ae8ec5026","abstract_canon_sha256":"3388e97e27ee081f3e2870d2b02cb8a71f7e106837baba01a9469608d8e9d4cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:03.473123Z","signature_b64":"iSnqRK++JLOWDFvnU+zoDDeH7S11/9Re0b/Bc29PgyXLOlOCnd/UZiJM6TGy4Ana/pygOz1RbOerqAFBqQgiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd3666ac44aeac5eb5ec09b1db231b7155cef599ac6e9f25f1874d844d2a08e2","last_reissued_at":"2026-07-05T11:39:03.472506Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:03.472506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alex Delalande, L\\'ena\\\"ic Chizat, Tomas Va\\v{s}kevi\\v{c}ius","submitted_at":"2024-07-01T11:49:30Z","abstract_excerpt":"We study the convergence rate of Sinkhorn's algorithm for solving entropy-regularized optimal transport problems when at least one of the probability measures, $\\mu$, admits a density over $\\mathbb{R}^d$. For a semi-concave cost function bounded by $c_{\\infty}$ and a regularization parameter $\\lambda > 0$, we obtain exponential convergence guarantees on the dual sub-optimality gap with contraction rate polynomial in $\\lambda/c_{\\infty}$. This represents an exponential improvement over the known contraction rate $1 - \\Theta(\\exp(-c_{\\infty}/\\lambda))$ achievable via Hilbert's projective metric."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.01202","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/2407.01202/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":"2407.01202","created_at":"2026-07-05T11:39:03.472565+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.01202v2","created_at":"2026-07-05T11:39:03.472565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.01202","created_at":"2026-07-05T11:39:03.472565+00:00"},{"alias_kind":"pith_short_12","alias_value":"3U3GNLCEV2WF","created_at":"2026-07-05T11:39:03.472565+00:00"},{"alias_kind":"pith_short_16","alias_value":"3U3GNLCEV2WF5NPM","created_at":"2026-07-05T11:39:03.472565+00:00"},{"alias_kind":"pith_short_8","alias_value":"3U3GNLCE","created_at":"2026-07-05T11:39:03.472565+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.12246","citing_title":"Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspective","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3U3GNLCEV2WF5NPMBGY5WIY3OF","json":"https://pith.science/pith/3U3GNLCEV2WF5NPMBGY5WIY3OF.json","graph_json":"https://pith.science/api/pith-number/3U3GNLCEV2WF5NPMBGY5WIY3OF/graph.json","events_json":"https://pith.science/api/pith-number/3U3GNLCEV2WF5NPMBGY5WIY3OF/events.json","paper":"https://pith.science/paper/3U3GNLCE"},"agent_actions":{"view_html":"https://pith.science/pith/3U3GNLCEV2WF5NPMBGY5WIY3OF","download_json":"https://pith.science/pith/3U3GNLCEV2WF5NPMBGY5WIY3OF.json","view_paper":"https://pith.science/paper/3U3GNLCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.01202&json=true","fetch_graph":"https://pith.science/api/pith-number/3U3GNLCEV2WF5NPMBGY5WIY3OF/graph.json","fetch_events":"https://pith.science/api/pith-number/3U3GNLCEV2WF5NPMBGY5WIY3OF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3U3GNLCEV2WF5NPMBGY5WIY3OF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3U3GNLCEV2WF5NPMBGY5WIY3OF/action/storage_attestation","attest_author":"https://pith.science/pith/3U3GNLCEV2WF5NPMBGY5WIY3OF/action/author_attestation","sign_citation":"https://pith.science/pith/3U3GNLCEV2WF5NPMBGY5WIY3OF/action/citation_signature","submit_replication":"https://pith.science/pith/3U3GNLCEV2WF5NPMBGY5WIY3OF/action/replication_record"}},"created_at":"2026-07-05T11:39:03.472565+00:00","updated_at":"2026-07-05T11:39:03.472565+00:00"}