{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3U3GNLCEV2WF5NPMBGY5WIY3OF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3388e97e27ee081f3e2870d2b02cb8a71f7e106837baba01a9469608d8e9d4cf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-01T11:49:30Z","title_canon_sha256":"1ccaabcc62bfe09160e7ae7b4305808886cc72b086be0db57352ab6ae8ec5026"},"schema_version":"1.0","source":{"id":"2407.01202","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.01202","created_at":"2026-07-05T11:39:03Z"},{"alias_kind":"arxiv_version","alias_value":"2407.01202v2","created_at":"2026-07-05T11:39:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.01202","created_at":"2026-07-05T11:39:03Z"},{"alias_kind":"pith_short_12","alias_value":"3U3GNLCEV2WF","created_at":"2026-07-05T11:39:03Z"},{"alias_kind":"pith_short_16","alias_value":"3U3GNLCEV2WF5NPM","created_at":"2026-07-05T11:39:03Z"},{"alias_kind":"pith_short_8","alias_value":"3U3GNLCE","created_at":"2026-07-05T11:39:03Z"}],"graph_snapshots":[{"event_id":"sha256:794dc10c0fe0541f71362afb25f779300add4eb8ed5ee0f4548e73711653b1a5","target":"graph","created_at":"2026-07-05T11:39:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.01202/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Alex Delalande, L\\'ena\\\"ic Chizat, Tomas Va\\v{s}kevi\\v{c}ius","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-01T11:49:30Z","title":"Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.01202","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3f0485b3a91a22882565290b684a00d995c451834476ac1f16d0c8da809daf8c","target":"record","created_at":"2026-07-05T11:39:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3388e97e27ee081f3e2870d2b02cb8a71f7e106837baba01a9469608d8e9d4cf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-07-01T11:49:30Z","title_canon_sha256":"1ccaabcc62bfe09160e7ae7b4305808886cc72b086be0db57352ab6ae8ec5026"},"schema_version":"1.0","source":{"id":"2407.01202","kind":"arxiv","version":2}},"canonical_sha256":"dd3666ac44aeac5eb5ec09b1db231b7155cef599ac6e9f25f1874d844d2a08e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd3666ac44aeac5eb5ec09b1db231b7155cef599ac6e9f25f1874d844d2a08e2","first_computed_at":"2026-07-05T11:39:03.472506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:39:03.472506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iSnqRK++JLOWDFvnU+zoDDeH7S11/9Re0b/Bc29PgyXLOlOCnd/UZiJM6TGy4Ana/pygOz1RbOerqAFBqQgiCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:39:03.473123Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.01202","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f0485b3a91a22882565290b684a00d995c451834476ac1f16d0c8da809daf8c","sha256:794dc10c0fe0541f71362afb25f779300add4eb8ed5ee0f4548e73711653b1a5"],"state_sha256":"0e2167e85aed4b988530765298d377a7b873e545d43e714e743047622b54db21"}