{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:E3S7XXK6EEM23CXVPCX27S3ZNY","short_pith_number":"pith:E3S7XXK6","schema_version":"1.0","canonical_sha256":"26e5fbdd5e2119ad8af578afafcb796e0bf88e4c9ebf97e5e69601189982b50e","source":{"kind":"arxiv","id":"2407.19689","version":1},"attestation_state":"computed","paper":{"title":"PDOT: a Practical Primal-Dual Algorithm and a GPU-Based Solver for Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haihao Lu, Jinwen Yang","submitted_at":"2024-07-29T04:20:22Z","abstract_excerpt":"In this paper, we propose a practical primal-dual algorithm with theoretical guarantees and develop a GPU-based solver, which we dub PDOT, for solving large-scale optimal transport problems. Compared to Sinkhorn algorithm or classic LP algorithms, PDOT can achieve high-accuracy solution while efficiently taking advantage of modern computing architecture, i.e., GPUs. On the theoretical side, we show that PDOT has a data-independent $\\widetilde O(mn(m+n)^{1.5}\\log(\\frac{1}{\\epsilon}))$ local flop complexity where $\\epsilon$ is the desired accuracy, and $m$ and $n$ are the dimension of the origin"},"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.19689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-29T04:20:22Z","cross_cats_sorted":[],"title_canon_sha256":"0b2cdd7850bc5858fb80a4814268530080f786ccb9a1ca7ed6ee0367ce67daa7","abstract_canon_sha256":"fc567e9e5f4aad8e9e20ccfce6a4534274b02b0ca268a4b9fdf621dbd0cf7dc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:43.313523Z","signature_b64":"FdIKdW2pTH6L/dUmOTSXgIWQ+1cpc3dP+05exSvKfVlqA59DTf21YFKRImo4cBeu4gpu7rxD1mtp7dXDnt55CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26e5fbdd5e2119ad8af578afafcb796e0bf88e4c9ebf97e5e69601189982b50e","last_reissued_at":"2026-07-05T08:49:43.313076Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:43.313076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PDOT: a Practical Primal-Dual Algorithm and a GPU-Based Solver for Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haihao Lu, Jinwen Yang","submitted_at":"2024-07-29T04:20:22Z","abstract_excerpt":"In this paper, we propose a practical primal-dual algorithm with theoretical guarantees and develop a GPU-based solver, which we dub PDOT, for solving large-scale optimal transport problems. Compared to Sinkhorn algorithm or classic LP algorithms, PDOT can achieve high-accuracy solution while efficiently taking advantage of modern computing architecture, i.e., GPUs. On the theoretical side, we show that PDOT has a data-independent $\\widetilde O(mn(m+n)^{1.5}\\log(\\frac{1}{\\epsilon}))$ local flop complexity where $\\epsilon$ is the desired accuracy, and $m$ and $n$ are the dimension of the origin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.19689","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.19689/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.19689","created_at":"2026-07-05T08:49:43.313145+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.19689v1","created_at":"2026-07-05T08:49:43.313145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.19689","created_at":"2026-07-05T08:49:43.313145+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3S7XXK6EEM2","created_at":"2026-07-05T08:49:43.313145+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3S7XXK6EEM23CXV","created_at":"2026-07-05T08:49:43.313145+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3S7XXK6","created_at":"2026-07-05T08:49:43.313145+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.04043","citing_title":"Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17883","citing_title":"On the convergence of doubly stochastic Primal-Dual Hybrid Gradient Method","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2511.11359","citing_title":"Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08793","citing_title":"cuRegOT: A GPU-Accelerated Solver for Entropic-Regularized Optimal Transport","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04175","citing_title":"A Provably Convergent and Practical Algorithm for Gromov--Wasserstein Optimal Transport","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E3S7XXK6EEM23CXVPCX27S3ZNY","json":"https://pith.science/pith/E3S7XXK6EEM23CXVPCX27S3ZNY.json","graph_json":"https://pith.science/api/pith-number/E3S7XXK6EEM23CXVPCX27S3ZNY/graph.json","events_json":"https://pith.science/api/pith-number/E3S7XXK6EEM23CXVPCX27S3ZNY/events.json","paper":"https://pith.science/paper/E3S7XXK6"},"agent_actions":{"view_html":"https://pith.science/pith/E3S7XXK6EEM23CXVPCX27S3ZNY","download_json":"https://pith.science/pith/E3S7XXK6EEM23CXVPCX27S3ZNY.json","view_paper":"https://pith.science/paper/E3S7XXK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.19689&json=true","fetch_graph":"https://pith.science/api/pith-number/E3S7XXK6EEM23CXVPCX27S3ZNY/graph.json","fetch_events":"https://pith.science/api/pith-number/E3S7XXK6EEM23CXVPCX27S3ZNY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3S7XXK6EEM23CXVPCX27S3ZNY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3S7XXK6EEM23CXVPCX27S3ZNY/action/storage_attestation","attest_author":"https://pith.science/pith/E3S7XXK6EEM23CXVPCX27S3ZNY/action/author_attestation","sign_citation":"https://pith.science/pith/E3S7XXK6EEM23CXVPCX27S3ZNY/action/citation_signature","submit_replication":"https://pith.science/pith/E3S7XXK6EEM23CXVPCX27S3ZNY/action/replication_record"}},"created_at":"2026-07-05T08:49:43.313145+00:00","updated_at":"2026-07-05T08:49:43.313145+00:00"}