{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZVMPXQL3VEXMA5YUZMHPFNWZTZ","short_pith_number":"pith:ZVMPXQL3","schema_version":"1.0","canonical_sha256":"cd58fbc17ba92ec07714cb0ef2b6d99e529243205df25d51ba8103fb3eb97cc3","source":{"kind":"arxiv","id":"2305.14939","version":2},"attestation_state":"computed","paper":{"title":"Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dingchuan Yang, Jianzhou Luo, Ke Wei","submitted_at":"2023-05-24T09:23:33Z","abstract_excerpt":"The Sinkhorn algorithm is a widely used method for solving the optimal transport problem, and the Greenkhorn algorithm is one of its variants. While there are modified versions of these two algorithms whose computational complexities are $O({n^2\\|C\\|_\\infty^2\\log n}/{\\varepsilon^2})$ to achieve an $\\varepsilon$-accuracy, to the best of our knowledge, the existing complexities for the vanilla versions are $O({n^2\\|C\\|_\\infty^3\\log n}/{\\varepsilon^3})$. In this paper we fill this gap and show that the complexities of the vanilla Sinkhorn and Greenkhorn algorithms are indeed $O({n^2\\|C\\|_\\infty^2"},"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":"2305.14939","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-05-24T09:23:33Z","cross_cats_sorted":[],"title_canon_sha256":"8e3f56f3c0db270fc60a70bf0a77f9a1d8eeef78d01178281ab1b00623e6852a","abstract_canon_sha256":"4b08e63e2e2c995f5737e9ea972ea678c4031a52122e84c1dd4b55c462f53bb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:02:29.427156Z","signature_b64":"yurbp3gQbRPRykXUb5qU0JAHe90Y7mx18zZWdPim54TlU1pkU9yFsKE9vnCujnbonP75CozgcHsgT0ma+YOcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd58fbc17ba92ec07714cb0ef2b6d99e529243205df25d51ba8103fb3eb97cc3","last_reissued_at":"2026-07-05T07:02:29.426618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:02:29.426618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dingchuan Yang, Jianzhou Luo, Ke Wei","submitted_at":"2023-05-24T09:23:33Z","abstract_excerpt":"The Sinkhorn algorithm is a widely used method for solving the optimal transport problem, and the Greenkhorn algorithm is one of its variants. While there are modified versions of these two algorithms whose computational complexities are $O({n^2\\|C\\|_\\infty^2\\log n}/{\\varepsilon^2})$ to achieve an $\\varepsilon$-accuracy, to the best of our knowledge, the existing complexities for the vanilla versions are $O({n^2\\|C\\|_\\infty^3\\log n}/{\\varepsilon^3})$. In this paper we fill this gap and show that the complexities of the vanilla Sinkhorn and Greenkhorn algorithms are indeed $O({n^2\\|C\\|_\\infty^2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.14939","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/2305.14939/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":"2305.14939","created_at":"2026-07-05T07:02:29.426674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.14939v2","created_at":"2026-07-05T07:02:29.426674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.14939","created_at":"2026-07-05T07:02:29.426674+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVMPXQL3VEXM","created_at":"2026-07-05T07:02:29.426674+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVMPXQL3VEXMA5YU","created_at":"2026-07-05T07:02:29.426674+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVMPXQL3","created_at":"2026-07-05T07:02:29.426674+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00665","citing_title":"Effective dynamics of the Sinkhorn algorithm in the regime of low entropy regularization","ref_index":63,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28973","citing_title":"Sharp $O(1/k)$ convergence rate for the Sinkhorn algorithm via a local analysis","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03787","citing_title":"On the Efficiency of Sinkhorn-Knopp for Entropically Regularized Optimal Transport","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ","json":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ.json","graph_json":"https://pith.science/api/pith-number/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/graph.json","events_json":"https://pith.science/api/pith-number/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/events.json","paper":"https://pith.science/paper/ZVMPXQL3"},"agent_actions":{"view_html":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ","download_json":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ.json","view_paper":"https://pith.science/paper/ZVMPXQL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.14939&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/action/replication_record"}},"created_at":"2026-07-05T07:02:29.426674+00:00","updated_at":"2026-07-05T07:02:29.426674+00:00"}