{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J2WIYOA6OZ42YEZXLWFK5UAIMK","short_pith_number":"pith:J2WIYOA6","schema_version":"1.0","canonical_sha256":"4eac8c381e7679ac13375d8aaed00862a5e89c447f09f09353a4a80bfd470ee8","source":{"kind":"arxiv","id":"1802.04367","version":2},"attestation_state":"computed","paper":{"title":"Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Alexander Gasnikov, Alexey Kroshnin, Pavel Dvurechensky","submitted_at":"2018-02-12T21:33:39Z","abstract_excerpt":"We analyze two algorithms for approximating the general optimal transport (OT) distance between two discrete distributions of size $n$, up to accuracy $\\varepsilon$. For the first algorithm, which is based on the celebrated Sinkhorn's algorithm, we prove the complexity bound $\\widetilde{O}\\left({n^2/\\varepsilon^2}\\right)$ arithmetic operations. For the second one, which is based on our novel Adaptive Primal-Dual Accelerated Gradient Descent (APDAGD) algorithm, we prove the complexity bound $\\widetilde{O}\\left(\\min\\left\\{n^{9/4}/\\varepsilon, n^{2}/\\varepsilon^2 \\right\\}\\right)$ arithmetic opera"},"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":"1802.04367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-12T21:33:39Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f81dab1cf6abb970d45c40cc00ef4474d3db426308fed02d5ddfda4eb551dcaf","abstract_canon_sha256":"149c841ac2a8630f22726d7481b088b55d75950469b905d5c9882f3bbd214516"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:00.294434Z","signature_b64":"6pGHIJtI5RJWx7Rsgi5r0Kp7R4FeD2yJQTOT/4O3tKLQcwiIk/KThn1qkRLkm0ltQV6Ax5ATx4wQ2H2Bv8y0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eac8c381e7679ac13375d8aaed00862a5e89c447f09f09353a4a80bfd470ee8","last_reissued_at":"2026-05-18T00:14:00.293802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:00.293802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Alexander Gasnikov, Alexey Kroshnin, Pavel Dvurechensky","submitted_at":"2018-02-12T21:33:39Z","abstract_excerpt":"We analyze two algorithms for approximating the general optimal transport (OT) distance between two discrete distributions of size $n$, up to accuracy $\\varepsilon$. For the first algorithm, which is based on the celebrated Sinkhorn's algorithm, we prove the complexity bound $\\widetilde{O}\\left({n^2/\\varepsilon^2}\\right)$ arithmetic operations. For the second one, which is based on our novel Adaptive Primal-Dual Accelerated Gradient Descent (APDAGD) algorithm, we prove the complexity bound $\\widetilde{O}\\left(\\min\\left\\{n^{9/4}/\\varepsilon, n^{2}/\\varepsilon^2 \\right\\}\\right)$ arithmetic opera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04367","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":""},"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":"1802.04367","created_at":"2026-05-18T00:14:00.293895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04367v2","created_at":"2026-05-18T00:14:00.293895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04367","created_at":"2026-05-18T00:14:00.293895+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2WIYOA6OZ42","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2WIYOA6OZ42YEZX","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2WIYOA6","created_at":"2026-05-18T12:32:31.084164+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/J2WIYOA6OZ42YEZXLWFK5UAIMK","json":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK.json","graph_json":"https://pith.science/api/pith-number/J2WIYOA6OZ42YEZXLWFK5UAIMK/graph.json","events_json":"https://pith.science/api/pith-number/J2WIYOA6OZ42YEZXLWFK5UAIMK/events.json","paper":"https://pith.science/paper/J2WIYOA6"},"agent_actions":{"view_html":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK","download_json":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK.json","view_paper":"https://pith.science/paper/J2WIYOA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04367&json=true","fetch_graph":"https://pith.science/api/pith-number/J2WIYOA6OZ42YEZXLWFK5UAIMK/graph.json","fetch_events":"https://pith.science/api/pith-number/J2WIYOA6OZ42YEZXLWFK5UAIMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK/action/storage_attestation","attest_author":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK/action/author_attestation","sign_citation":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK/action/citation_signature","submit_replication":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK/action/replication_record"}},"created_at":"2026-05-18T00:14:00.293895+00:00","updated_at":"2026-05-18T00:14:00.293895+00:00"}