{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2DDS6GMQGQM76WRKVN73RI2XNF","short_pith_number":"pith:2DDS6GMQ","schema_version":"1.0","canonical_sha256":"d0c72f19903419ff5a2aab7fb8a357696c8905048c36968678da2ec43f8ad0cf","source":{"kind":"arxiv","id":"1810.07717","version":3},"attestation_state":"computed","paper":{"title":"Towards Optimal Running Times for Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Arun Jambulapati, Carson Kent, Jose Blanchet","submitted_at":"2018-10-17T18:08:30Z","abstract_excerpt":"In this work, we provide faster algorithms for approximating the optimal transport distance, e.g. earth mover's distance, between two discrete probability distributions $\\mu, \\nu \\in \\Delta^n$. Given a cost function $C : [n] \\times [n] \\to \\mathbb{R}_{\\geq 0}$ where $C(i,j) \\leq 1$ quantifies the penalty of transporting a unit of mass from $i$ to $j$, we show how to compute a coupling $X$ between $r$ and $c$ in time $\\widetilde{O}\\left(n^2 /\\epsilon \\right)$ whose expected transportation cost is within an additive $\\epsilon$ of optimal. This improves upon the previously best known running time"},"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":"1810.07717","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-17T18:08:30Z","cross_cats_sorted":[],"title_canon_sha256":"c4ac3536c05cc6570bf570bd222994e4076cfa12fbcccb49fd7d62e4cba8c724","abstract_canon_sha256":"9b5cee1d3cf50f74e7adbc2df74ef64f13cbe964cd5560088d55eb4ae03d85b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:36:16.601329Z","signature_b64":"pL1ggAxwgx85Eiosz5sFEfPUtGq/Dh4w8/pxMO6stBpAJm0ia3C0Pn2j9lN8oxEojn4227/VXzzBW7MbDe8sDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0c72f19903419ff5a2aab7fb8a357696c8905048c36968678da2ec43f8ad0cf","last_reissued_at":"2026-07-05T00:36:16.600812Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:36:16.600812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Optimal Running Times for Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Arun Jambulapati, Carson Kent, Jose Blanchet","submitted_at":"2018-10-17T18:08:30Z","abstract_excerpt":"In this work, we provide faster algorithms for approximating the optimal transport distance, e.g. earth mover's distance, between two discrete probability distributions $\\mu, \\nu \\in \\Delta^n$. Given a cost function $C : [n] \\times [n] \\to \\mathbb{R}_{\\geq 0}$ where $C(i,j) \\leq 1$ quantifies the penalty of transporting a unit of mass from $i$ to $j$, we show how to compute a coupling $X$ between $r$ and $c$ in time $\\widetilde{O}\\left(n^2 /\\epsilon \\right)$ whose expected transportation cost is within an additive $\\epsilon$ of optimal. This improves upon the previously best known running time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07717","kind":"arxiv","version":3},"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/1810.07717/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":"1810.07717","created_at":"2026-07-05T00:36:16.600873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07717v3","created_at":"2026-07-05T00:36:16.600873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07717","created_at":"2026-07-05T00:36:16.600873+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DDS6GMQGQM7","created_at":"2026-07-05T00:36:16.600873+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DDS6GMQGQM76WRK","created_at":"2026-07-05T00:36:16.600873+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DDS6GMQ","created_at":"2026-07-05T00:36:16.600873+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.11760","citing_title":"Tight Nonasymptotic Local Convergence of Sinkhorn-Knopp","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF","json":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF.json","graph_json":"https://pith.science/api/pith-number/2DDS6GMQGQM76WRKVN73RI2XNF/graph.json","events_json":"https://pith.science/api/pith-number/2DDS6GMQGQM76WRKVN73RI2XNF/events.json","paper":"https://pith.science/paper/2DDS6GMQ"},"agent_actions":{"view_html":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF","download_json":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF.json","view_paper":"https://pith.science/paper/2DDS6GMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07717&json=true","fetch_graph":"https://pith.science/api/pith-number/2DDS6GMQGQM76WRKVN73RI2XNF/graph.json","fetch_events":"https://pith.science/api/pith-number/2DDS6GMQGQM76WRKVN73RI2XNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF/action/storage_attestation","attest_author":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF/action/author_attestation","sign_citation":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF/action/citation_signature","submit_replication":"https://pith.science/pith/2DDS6GMQGQM76WRKVN73RI2XNF/action/replication_record"}},"created_at":"2026-07-05T00:36:16.600873+00:00","updated_at":"2026-07-05T00:36:16.600873+00:00"}