{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J2WIYOA6OZ42YEZXLWFK5UAIMK","short_pith_number":"pith:J2WIYOA6","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"},"canonical_sha256":"4eac8c381e7679ac13375d8aaed00862a5e89c447f09f09353a4a80bfd470ee8","source":{"kind":"arxiv","id":"1802.04367","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04367","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04367v2","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04367","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"J2WIYOA6OZ42","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J2WIYOA6OZ42YEZX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J2WIYOA6","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J2WIYOA6OZ42YEZXLWFK5UAIMK","target":"record","payload":{"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"},"canonical_sha256":"4eac8c381e7679ac13375d8aaed00862a5e89c447f09f09353a4a80bfd470ee8","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"},"source_kind":"arxiv","source_id":"1802.04367","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnZh0/csq0gWjA6mMj8v+dkwkQ+EgJbLA/TWUoIeCvxn5bExLw5ezSMXS6QyJU0Enzw//hsT2xg8aGC2x34ACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:11:55.976180Z"},"content_sha256":"1bd35b4b834eb23a1385f2ab56f8429c27b78f0968290efd131216595f913b27","schema_version":"1.0","event_id":"sha256:1bd35b4b834eb23a1385f2ab56f8429c27b78f0968290efd131216595f913b27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J2WIYOA6OZ42YEZXLWFK5UAIMK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l2GThGrdfmbQYhkPMQRjfRHoefq5hZUfN4MJc3IAA4454TGnlg4HueELCGQ8YQm0qtp3TobQHqcvLOs2g0ieCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:11:55.976537Z"},"content_sha256":"9af4a3ccf984ce1d0977ba24e80a462c92148e391c18fb523d7842d79c46d15d","schema_version":"1.0","event_id":"sha256:9af4a3ccf984ce1d0977ba24e80a462c92148e391c18fb523d7842d79c46d15d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK/bundle.json","state_url":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T08:11:55Z","links":{"resolver":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK","bundle":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK/bundle.json","state":"https://pith.science/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2WIYOA6OZ42YEZXLWFK5UAIMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J2WIYOA6OZ42YEZXLWFK5UAIMK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"149c841ac2a8630f22726d7481b088b55d75950469b905d5c9882f3bbd214516","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-12T21:33:39Z","title_canon_sha256":"f81dab1cf6abb970d45c40cc00ef4474d3db426308fed02d5ddfda4eb551dcaf"},"schema_version":"1.0","source":{"id":"1802.04367","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04367","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04367v2","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04367","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"J2WIYOA6OZ42","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J2WIYOA6OZ42YEZX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J2WIYOA6","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:9af4a3ccf984ce1d0977ba24e80a462c92148e391c18fb523d7842d79c46d15d","target":"graph","created_at":"2026-05-18T00:14:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexander Gasnikov, Alexey Kroshnin, Pavel Dvurechensky","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-12T21:33:39Z","title":"Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04367","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1bd35b4b834eb23a1385f2ab56f8429c27b78f0968290efd131216595f913b27","target":"record","created_at":"2026-05-18T00:14:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"149c841ac2a8630f22726d7481b088b55d75950469b905d5c9882f3bbd214516","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-12T21:33:39Z","title_canon_sha256":"f81dab1cf6abb970d45c40cc00ef4474d3db426308fed02d5ddfda4eb551dcaf"},"schema_version":"1.0","source":{"id":"1802.04367","kind":"arxiv","version":2}},"canonical_sha256":"4eac8c381e7679ac13375d8aaed00862a5e89c447f09f09353a4a80bfd470ee8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4eac8c381e7679ac13375d8aaed00862a5e89c447f09f09353a4a80bfd470ee8","first_computed_at":"2026-05-18T00:14:00.293802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:00.293802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6pGHIJtI5RJWx7Rsgi5r0Kp7R4FeD2yJQTOT/4O3tKLQcwiIk/KThn1qkRLkm0ltQV6Ax5ATx4wQ2H2Bv8y0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:00.294434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04367","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bd35b4b834eb23a1385f2ab56f8429c27b78f0968290efd131216595f913b27","sha256:9af4a3ccf984ce1d0977ba24e80a462c92148e391c18fb523d7842d79c46d15d"],"state_sha256":"2c8210b5e0071e3cedb9fd7723c0f630d84062f2706fd3984fe9818e0de947ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjsqNzgn2TUSCcG7WXm3Dcx2ZfbgP9Y1pgPpe8DuqjzTmx2iK1ihL7bLt2RifjwZ8DHfnUmX8SBlDZbnMp31Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:11:55.978482Z","bundle_sha256":"174caf146545f7fee7d2e74d6acc5701b981e0548790d202bc88da6aed4ee2a9"}}