{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3PD77YTLAL3NUEE2XDH5GWOPQN","short_pith_number":"pith:3PD77YTL","schema_version":"1.0","canonical_sha256":"dbc7ffe26b02f6da109ab8cfd359cf837fc54c5d93f9e7322271af94758343bf","source":{"kind":"arxiv","id":"2307.08507","version":4},"attestation_state":"computed","paper":{"title":"Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Allan D. Jepson, Amir-massoud Farahmand, Mete Kemertas","submitted_at":"2023-07-17T14:09:43Z","abstract_excerpt":"We propose Mirror Descent Optimal Transport (MDOT), a novel method for solving discrete optimal transport (OT) problems with high precision, by unifying temperature annealing in entropic-regularized OT (EOT) with mirror descent techniques. In this framework, temperature annealing produces a sequence of EOT dual problems, whose solution gradually gets closer to the solution of the original OT problem. We solve each problem efficiently using a GPU-parallel nonlinear conjugate gradients algorithm (PNCG) that outperforms traditional Sinkhorn iterations under weak regularization. Moreover, our inve"},"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":"2307.08507","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-17T14:09:43Z","cross_cats_sorted":[],"title_canon_sha256":"a22ee3075b9173e011d84b6654dbe66a7d621b0542ea3aa1f62f82b758c2d075","abstract_canon_sha256":"e6b3dee9f277d9737cf58c07e744a92179dbf0d3e2f4900ee4eb03c34230fcf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:45.756685Z","signature_b64":"fqTK7bjmQuTV52rdZt0kzjNTsytbLIU0Od2mQSS8daiKShypGl1zilAJsFTjvDVjY00axqgD194MqpXzsbhKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbc7ffe26b02f6da109ab8cfd359cf837fc54c5d93f9e7322271af94758343bf","last_reissued_at":"2026-07-05T11:14:45.756247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:45.756247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Allan D. Jepson, Amir-massoud Farahmand, Mete Kemertas","submitted_at":"2023-07-17T14:09:43Z","abstract_excerpt":"We propose Mirror Descent Optimal Transport (MDOT), a novel method for solving discrete optimal transport (OT) problems with high precision, by unifying temperature annealing in entropic-regularized OT (EOT) with mirror descent techniques. In this framework, temperature annealing produces a sequence of EOT dual problems, whose solution gradually gets closer to the solution of the original OT problem. We solve each problem efficiently using a GPU-parallel nonlinear conjugate gradients algorithm (PNCG) that outperforms traditional Sinkhorn iterations under weak regularization. Moreover, our inve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08507","kind":"arxiv","version":4},"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/2307.08507/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":"2307.08507","created_at":"2026-07-05T11:14:45.756304+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.08507v4","created_at":"2026-07-05T11:14:45.756304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08507","created_at":"2026-07-05T11:14:45.756304+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PD77YTLAL3N","created_at":"2026-07-05T11:14:45.756304+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PD77YTLAL3NUEE2","created_at":"2026-07-05T11:14:45.756304+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PD77YTL","created_at":"2026-07-05T11:14:45.756304+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"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":46,"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":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3PD77YTLAL3NUEE2XDH5GWOPQN","json":"https://pith.science/pith/3PD77YTLAL3NUEE2XDH5GWOPQN.json","graph_json":"https://pith.science/api/pith-number/3PD77YTLAL3NUEE2XDH5GWOPQN/graph.json","events_json":"https://pith.science/api/pith-number/3PD77YTLAL3NUEE2XDH5GWOPQN/events.json","paper":"https://pith.science/paper/3PD77YTL"},"agent_actions":{"view_html":"https://pith.science/pith/3PD77YTLAL3NUEE2XDH5GWOPQN","download_json":"https://pith.science/pith/3PD77YTLAL3NUEE2XDH5GWOPQN.json","view_paper":"https://pith.science/paper/3PD77YTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.08507&json=true","fetch_graph":"https://pith.science/api/pith-number/3PD77YTLAL3NUEE2XDH5GWOPQN/graph.json","fetch_events":"https://pith.science/api/pith-number/3PD77YTLAL3NUEE2XDH5GWOPQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PD77YTLAL3NUEE2XDH5GWOPQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PD77YTLAL3NUEE2XDH5GWOPQN/action/storage_attestation","attest_author":"https://pith.science/pith/3PD77YTLAL3NUEE2XDH5GWOPQN/action/author_attestation","sign_citation":"https://pith.science/pith/3PD77YTLAL3NUEE2XDH5GWOPQN/action/citation_signature","submit_replication":"https://pith.science/pith/3PD77YTLAL3NUEE2XDH5GWOPQN/action/replication_record"}},"created_at":"2026-07-05T11:14:45.756304+00:00","updated_at":"2026-07-05T11:14:45.756304+00:00"}