{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:C3SJUJBMU4PP4PKTIPHSOR25HO","short_pith_number":"pith:C3SJUJBM","schema_version":"1.0","canonical_sha256":"16e49a242ca71efe3d5343cf27475d3bae270c942ed79ebf93f90d9b3c0ac2a4","source":{"kind":"arxiv","id":"1906.00618","version":1},"attestation_state":"computed","paper":{"title":"A Direct $\\tilde{O}(1/\\epsilon)$ Iteration Parallel Algorithm for Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO","stat.ML"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Arun Jambulapati, Kevin Tian","submitted_at":"2019-06-03T07:58:09Z","abstract_excerpt":"Optimal transportation, or computing the Wasserstein or ``earth mover's'' distance between two distributions, is a fundamental primitive which arises in many learning and statistical settings. We give an algorithm which solves this problem to additive $\\epsilon$ with $\\tilde{O}(1/\\epsilon)$ parallel depth, and $\\tilde{O}\\left(n^2/\\epsilon\\right)$ work. Barring a breakthrough on a long-standing algorithmic open problem, this is optimal for first-order methods. Blanchet et. al. '18, Quanrud '19 obtained similar runtimes through reductions to positive linear programming and matrix scaling. Howeve"},"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":"1906.00618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-03T07:58:09Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO","stat.ML"],"title_canon_sha256":"85d76d33ea110afa09739083d8cd8d705c0bb87b7dd1fdc646f0ffc59c1d7633","abstract_canon_sha256":"6546f0d7c0308a10a9e8f660f24fce8e80f1308be788a04f83e58105da35a5f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:24.345757Z","signature_b64":"WMZaTJpAdkyTpxNbce9FEDLr5LqMo8etN1YRwFgcBOlIjTgc9G1GDWNITj7m7HObU3EDOHmqqCy7M7pimQ6LBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16e49a242ca71efe3d5343cf27475d3bae270c942ed79ebf93f90d9b3c0ac2a4","last_reissued_at":"2026-05-17T23:44:24.345002Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:24.345002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Direct $\\tilde{O}(1/\\epsilon)$ Iteration Parallel Algorithm for Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO","stat.ML"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Arun Jambulapati, Kevin Tian","submitted_at":"2019-06-03T07:58:09Z","abstract_excerpt":"Optimal transportation, or computing the Wasserstein or ``earth mover's'' distance between two distributions, is a fundamental primitive which arises in many learning and statistical settings. We give an algorithm which solves this problem to additive $\\epsilon$ with $\\tilde{O}(1/\\epsilon)$ parallel depth, and $\\tilde{O}\\left(n^2/\\epsilon\\right)$ work. Barring a breakthrough on a long-standing algorithmic open problem, this is optimal for first-order methods. Blanchet et. al. '18, Quanrud '19 obtained similar runtimes through reductions to positive linear programming and matrix scaling. Howeve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00618","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":"1906.00618","created_at":"2026-05-17T23:44:24.345103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00618v1","created_at":"2026-05-17T23:44:24.345103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00618","created_at":"2026-05-17T23:44:24.345103+00:00"},{"alias_kind":"pith_short_12","alias_value":"C3SJUJBMU4PP","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"C3SJUJBMU4PP4PKT","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"C3SJUJBM","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO","json":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO.json","graph_json":"https://pith.science/api/pith-number/C3SJUJBMU4PP4PKTIPHSOR25HO/graph.json","events_json":"https://pith.science/api/pith-number/C3SJUJBMU4PP4PKTIPHSOR25HO/events.json","paper":"https://pith.science/paper/C3SJUJBM"},"agent_actions":{"view_html":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO","download_json":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO.json","view_paper":"https://pith.science/paper/C3SJUJBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00618&json=true","fetch_graph":"https://pith.science/api/pith-number/C3SJUJBMU4PP4PKTIPHSOR25HO/graph.json","fetch_events":"https://pith.science/api/pith-number/C3SJUJBMU4PP4PKTIPHSOR25HO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO/action/storage_attestation","attest_author":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO/action/author_attestation","sign_citation":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO/action/citation_signature","submit_replication":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO/action/replication_record"}},"created_at":"2026-05-17T23:44:24.345103+00:00","updated_at":"2026-05-17T23:44:24.345103+00:00"}