{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2SOEAB4AC7QY3V3QB4YM3ILRNU","short_pith_number":"pith:2SOEAB4A","canonical_record":{"source":{"id":"1705.09634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:14:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6c8a835ea6035263e6af30222a7ef44aca91ba19f3f0ecbf11e47fa41c0790d2","abstract_canon_sha256":"3efbd876a1b35115a8e64fa04b0a040eb6e156901c3646c040737bda289ed707"},"schema_version":"1.0"},"canonical_sha256":"d49c40078017e18dd7700f30cda1716d26383a29f0ec6227f1c98bd52af5e25f","source":{"kind":"arxiv","id":"1705.09634","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09634","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09634v2","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09634","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"2SOEAB4AC7QY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2SOEAB4AC7QY3V3Q","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2SOEAB4A","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2SOEAB4AC7QY3V3QB4YM3ILRNU","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:14:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6c8a835ea6035263e6af30222a7ef44aca91ba19f3f0ecbf11e47fa41c0790d2","abstract_canon_sha256":"3efbd876a1b35115a8e64fa04b0a040eb6e156901c3646c040737bda289ed707"},"schema_version":"1.0"},"canonical_sha256":"d49c40078017e18dd7700f30cda1716d26383a29f0ec6227f1c98bd52af5e25f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:10.204359Z","signature_b64":"Gj8dEVI69kI48KUcFBZmec0O/xDXJ3vpzzcOAMHGelIm7PoSjBwwP0R4A+JvGMaz+XRHd1lhdY/BC9VWYxMjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d49c40078017e18dd7700f30cda1716d26383a29f0ec6227f1c98bd52af5e25f","last_reissued_at":"2026-05-18T00:24:10.203733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:10.203733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09634","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:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8snnJfpUqKqwqWud321MvHEClOMf0DP3CsvGa4OPR6cK4T69oBR/0UpbjUAr4NtV4bh65GJmP72dE86zQWrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T06:38:47.720681Z"},"content_sha256":"319758ddd24ace1be4e6eaa856c98b0e6a2ba24f6df441ee9d66e65538c415d2","schema_version":"1.0","event_id":"sha256:319758ddd24ace1be4e6eaa856c98b0e6a2ba24f6df441ee9d66e65538c415d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2SOEAB4AC7QY3V3QB4YM3ILRNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DS","authors_text":"Jason Altschuler, Jonathan Weed, Philippe Rigollet","submitted_at":"2017-05-26T16:14:38Z","abstract_excerpt":"Computing optimal transport distances such as the earth mover's distance is a fundamental problem in machine learning, statistics, and computer vision. Despite the recent introduction of several algorithms with good empirical performance, it is unknown whether general optimal transport distances can be approximated in near-linear time. This paper demonstrates that this ambitious goal is in fact achieved by Cuturi's Sinkhorn Distances. This result relies on a new analysis of Sinkhorn iteration, which also directly suggests a new greedy coordinate descent algorithm, Greenkhorn, with the same the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09634","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:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"367HFOTWcRElz9tkimLukBMHnpYHLhNp5Uhu/43V3SPdXlrL1R6sMIfUueWuBqewpe+nLd/t+MsuMPphqYBwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T06:38:47.721022Z"},"content_sha256":"9fbfaf1337ac722c2aff06d5c949cd818d1ccf4984dc41e9fc1b6553c10e2ee9","schema_version":"1.0","event_id":"sha256:9fbfaf1337ac722c2aff06d5c949cd818d1ccf4984dc41e9fc1b6553c10e2ee9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SOEAB4AC7QY3V3QB4YM3ILRNU/bundle.json","state_url":"https://pith.science/pith/2SOEAB4AC7QY3V3QB4YM3ILRNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SOEAB4AC7QY3V3QB4YM3ILRNU/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-29T06:38:47Z","links":{"resolver":"https://pith.science/pith/2SOEAB4AC7QY3V3QB4YM3ILRNU","bundle":"https://pith.science/pith/2SOEAB4AC7QY3V3QB4YM3ILRNU/bundle.json","state":"https://pith.science/pith/2SOEAB4AC7QY3V3QB4YM3ILRNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SOEAB4AC7QY3V3QB4YM3ILRNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2SOEAB4AC7QY3V3QB4YM3ILRNU","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":"3efbd876a1b35115a8e64fa04b0a040eb6e156901c3646c040737bda289ed707","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:14:38Z","title_canon_sha256":"6c8a835ea6035263e6af30222a7ef44aca91ba19f3f0ecbf11e47fa41c0790d2"},"schema_version":"1.0","source":{"id":"1705.09634","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09634","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09634v2","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09634","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"2SOEAB4AC7QY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2SOEAB4AC7QY3V3Q","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2SOEAB4A","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:9fbfaf1337ac722c2aff06d5c949cd818d1ccf4984dc41e9fc1b6553c10e2ee9","target":"graph","created_at":"2026-05-18T00:24:10Z","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":"Computing optimal transport distances such as the earth mover's distance is a fundamental problem in machine learning, statistics, and computer vision. Despite the recent introduction of several algorithms with good empirical performance, it is unknown whether general optimal transport distances can be approximated in near-linear time. This paper demonstrates that this ambitious goal is in fact achieved by Cuturi's Sinkhorn Distances. This result relies on a new analysis of Sinkhorn iteration, which also directly suggests a new greedy coordinate descent algorithm, Greenkhorn, with the same the","authors_text":"Jason Altschuler, Jonathan Weed, Philippe Rigollet","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:14:38Z","title":"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09634","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:319758ddd24ace1be4e6eaa856c98b0e6a2ba24f6df441ee9d66e65538c415d2","target":"record","created_at":"2026-05-18T00:24:10Z","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":"3efbd876a1b35115a8e64fa04b0a040eb6e156901c3646c040737bda289ed707","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-26T16:14:38Z","title_canon_sha256":"6c8a835ea6035263e6af30222a7ef44aca91ba19f3f0ecbf11e47fa41c0790d2"},"schema_version":"1.0","source":{"id":"1705.09634","kind":"arxiv","version":2}},"canonical_sha256":"d49c40078017e18dd7700f30cda1716d26383a29f0ec6227f1c98bd52af5e25f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d49c40078017e18dd7700f30cda1716d26383a29f0ec6227f1c98bd52af5e25f","first_computed_at":"2026-05-18T00:24:10.203733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:10.203733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gj8dEVI69kI48KUcFBZmec0O/xDXJ3vpzzcOAMHGelIm7PoSjBwwP0R4A+JvGMaz+XRHd1lhdY/BC9VWYxMjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:10.204359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09634","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:319758ddd24ace1be4e6eaa856c98b0e6a2ba24f6df441ee9d66e65538c415d2","sha256:9fbfaf1337ac722c2aff06d5c949cd818d1ccf4984dc41e9fc1b6553c10e2ee9"],"state_sha256":"b592ef141969931924ed0ea57d4e91d649348bca65b84cf7954e8b0939e8cc1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EY0PDixN+R/vkfAPy1kLzb+iF2nKPahqrCsIFUZjk+oi7F17WLz8xW+x67f+7UT37KaI/AU/ISofIwji1KcPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T06:38:47.722901Z","bundle_sha256":"677792733a9a8a7f9ee001cf60cf46357fc58db9d96e288a5be08b2957dc5316"}}