{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:C3SJUJBMU4PP4PKTIPHSOR25HO","short_pith_number":"pith:C3SJUJBM","canonical_record":{"source":{"id":"1906.00618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-03T07:58:09Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO","stat.ML"],"title_canon_sha256":"85d76d33ea110afa09739083d8cd8d705c0bb87b7dd1fdc646f0ffc59c1d7633","abstract_canon_sha256":"6546f0d7c0308a10a9e8f660f24fce8e80f1308be788a04f83e58105da35a5f1"},"schema_version":"1.0"},"canonical_sha256":"16e49a242ca71efe3d5343cf27475d3bae270c942ed79ebf93f90d9b3c0ac2a4","source":{"kind":"arxiv","id":"1906.00618","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00618","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00618v1","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00618","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"C3SJUJBMU4PP","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"C3SJUJBMU4PP4PKT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"C3SJUJBM","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:C3SJUJBMU4PP4PKTIPHSOR25HO","target":"record","payload":{"canonical_record":{"source":{"id":"1906.00618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-03T07:58:09Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO","stat.ML"],"title_canon_sha256":"85d76d33ea110afa09739083d8cd8d705c0bb87b7dd1fdc646f0ffc59c1d7633","abstract_canon_sha256":"6546f0d7c0308a10a9e8f660f24fce8e80f1308be788a04f83e58105da35a5f1"},"schema_version":"1.0"},"canonical_sha256":"16e49a242ca71efe3d5343cf27475d3bae270c942ed79ebf93f90d9b3c0ac2a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:24.345757Z","signature_b64":"WMZaTJpAdkyTpxNbce9FEDLr5LqMo8etN1YRwFgcBOlIjTgc9G1GDWNITj7m7HObU3EDOHmqqCy7M7pimQ6LBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16e49a242ca71efe3d5343cf27475d3bae270c942ed79ebf93f90d9b3c0ac2a4","last_reissued_at":"2026-05-17T23:44:24.345002Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:24.345002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.00618","source_version":1,"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-17T23:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LxKZP9C6yS7vbBXtZ6U83BEAhanaU41bsschpDrScbGieIv9+9winvzuX+Q8z2ZsAUFcCgB1gn2j4b1B9RjoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:21:48.565596Z"},"content_sha256":"535b3bed2e54186a807144fedf789136f6b621064468e5a176f1e19a92f6e0c4","schema_version":"1.0","event_id":"sha256:535b3bed2e54186a807144fedf789136f6b621064468e5a176f1e19a92f6e0c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:C3SJUJBMU4PP4PKTIPHSOR25HO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Direct $\\tilde{O}(1/\\epsilon)$ Iteration Parallel Algorithm for Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO","stat.ML"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Arun Jambulapati, Kevin Tian","submitted_at":"2019-06-03T07:58:09Z","abstract_excerpt":"Optimal transportation, or computing the Wasserstein or ``earth mover's'' distance between two distributions, is a fundamental primitive which arises in many learning and statistical settings. We give an algorithm which solves this problem to additive $\\epsilon$ with $\\tilde{O}(1/\\epsilon)$ parallel depth, and $\\tilde{O}\\left(n^2/\\epsilon\\right)$ work. Barring a breakthrough on a long-standing algorithmic open problem, this is optimal for first-order methods. Blanchet et. al. '18, Quanrud '19 obtained similar runtimes through reductions to positive linear programming and matrix scaling. Howeve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00618","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":""},"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-17T23:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IcGaq5XzKFtVd/NShe5twtOqM6Kk8zYx3UAVpPcaIusxxwLhMePyOgs/WXkArruz4KvqrRSqtk0+bGHtx6I8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:21:48.565949Z"},"content_sha256":"5ef37b3feff6bafc21567e2b71626cf30973e4e54182b31875fa6d36c1252d5e","schema_version":"1.0","event_id":"sha256:5ef37b3feff6bafc21567e2b71626cf30973e4e54182b31875fa6d36c1252d5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO/bundle.json","state_url":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C3SJUJBMU4PP4PKTIPHSOR25HO/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-21T19:21:48Z","links":{"resolver":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO","bundle":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO/bundle.json","state":"https://pith.science/pith/C3SJUJBMU4PP4PKTIPHSOR25HO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C3SJUJBMU4PP4PKTIPHSOR25HO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:C3SJUJBMU4PP4PKTIPHSOR25HO","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":"6546f0d7c0308a10a9e8f660f24fce8e80f1308be788a04f83e58105da35a5f1","cross_cats_sorted":["cs.LG","math.OC","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-03T07:58:09Z","title_canon_sha256":"85d76d33ea110afa09739083d8cd8d705c0bb87b7dd1fdc646f0ffc59c1d7633"},"schema_version":"1.0","source":{"id":"1906.00618","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00618","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00618v1","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00618","created_at":"2026-05-17T23:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"C3SJUJBMU4PP","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"C3SJUJBMU4PP4PKT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"C3SJUJBM","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:5ef37b3feff6bafc21567e2b71626cf30973e4e54182b31875fa6d36c1252d5e","target":"graph","created_at":"2026-05-17T23:44:24Z","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":"Optimal transportation, or computing the Wasserstein or ``earth mover's'' distance between two distributions, is a fundamental primitive which arises in many learning and statistical settings. We give an algorithm which solves this problem to additive $\\epsilon$ with $\\tilde{O}(1/\\epsilon)$ parallel depth, and $\\tilde{O}\\left(n^2/\\epsilon\\right)$ work. Barring a breakthrough on a long-standing algorithmic open problem, this is optimal for first-order methods. Blanchet et. al. '18, Quanrud '19 obtained similar runtimes through reductions to positive linear programming and matrix scaling. Howeve","authors_text":"Aaron Sidford, Arun Jambulapati, Kevin Tian","cross_cats":["cs.LG","math.OC","stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-03T07:58:09Z","title":"A Direct $\\tilde{O}(1/\\epsilon)$ Iteration Parallel Algorithm for Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00618","kind":"arxiv","version":1},"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:535b3bed2e54186a807144fedf789136f6b621064468e5a176f1e19a92f6e0c4","target":"record","created_at":"2026-05-17T23:44:24Z","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":"6546f0d7c0308a10a9e8f660f24fce8e80f1308be788a04f83e58105da35a5f1","cross_cats_sorted":["cs.LG","math.OC","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-03T07:58:09Z","title_canon_sha256":"85d76d33ea110afa09739083d8cd8d705c0bb87b7dd1fdc646f0ffc59c1d7633"},"schema_version":"1.0","source":{"id":"1906.00618","kind":"arxiv","version":1}},"canonical_sha256":"16e49a242ca71efe3d5343cf27475d3bae270c942ed79ebf93f90d9b3c0ac2a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16e49a242ca71efe3d5343cf27475d3bae270c942ed79ebf93f90d9b3c0ac2a4","first_computed_at":"2026-05-17T23:44:24.345002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:24.345002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WMZaTJpAdkyTpxNbce9FEDLr5LqMo8etN1YRwFgcBOlIjTgc9G1GDWNITj7m7HObU3EDOHmqqCy7M7pimQ6LBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:24.345757Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00618","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:535b3bed2e54186a807144fedf789136f6b621064468e5a176f1e19a92f6e0c4","sha256:5ef37b3feff6bafc21567e2b71626cf30973e4e54182b31875fa6d36c1252d5e"],"state_sha256":"38400e51edadf1c223b4fbbbab304d5c85d0d77f5d40f0f4bb86f50684bb2bc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6MEuk63LP6Y/Gme0IZoxoHE+38JZpojZKlZXVB9IPp9Y5ZDpbUahkf5v57K6GZG3ux7w8h4Qy1hljLEkdGYNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T19:21:48.567931Z","bundle_sha256":"1313fd680a4bdf5d11096f5541f25b6f7c9d15855ec5ef28b09830dcfacb0487"}}