{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:AUSRM6ARZ7OE4WFDKLLDXDZVVK","short_pith_number":"pith:AUSRM6AR","canonical_record":{"source":{"id":"2005.01182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-03T20:37:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2953f29f8de5a8f4e4f0fff50cd91731dc47d7c8b775ea333611fcb57c59021c","abstract_canon_sha256":"f831ba0ca678112109adb13c8f951b236023ba0031aaf3c000fc33f24a842b57"},"schema_version":"1.0"},"canonical_sha256":"0525167811cfdc4e58a352d63b8f35aa987745aaef6fc000cbf01385ead4dbaf","source":{"kind":"arxiv","id":"2005.01182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.01182","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"arxiv_version","alias_value":"2005.01182v1","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.01182","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"pith_short_12","alias_value":"AUSRM6ARZ7OE","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"pith_short_16","alias_value":"AUSRM6ARZ7OE4WFD","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"pith_short_8","alias_value":"AUSRM6AR","created_at":"2026-07-05T01:16:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:AUSRM6ARZ7OE4WFDKLLDXDZVVK","target":"record","payload":{"canonical_record":{"source":{"id":"2005.01182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-03T20:37:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2953f29f8de5a8f4e4f0fff50cd91731dc47d7c8b775ea333611fcb57c59021c","abstract_canon_sha256":"f831ba0ca678112109adb13c8f951b236023ba0031aaf3c000fc33f24a842b57"},"schema_version":"1.0"},"canonical_sha256":"0525167811cfdc4e58a352d63b8f35aa987745aaef6fc000cbf01385ead4dbaf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:14.850338Z","signature_b64":"f9Dce531Oiuv2Ms89Z3jTxsvK8+Brq+yEHHMabmSC7e6DU9dtOkcRrUQ18VJYmeo494Yp/viSBaaUdtUQVU4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0525167811cfdc4e58a352d63b8f35aa987745aaef6fc000cbf01385ead4dbaf","last_reissued_at":"2026-07-05T01:16:14.849888Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:14.849888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.01182","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-07-05T01:16:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N1zE2Bxmmjx9bXfIh+RwHrVkLzCdDh/uP5Gxupum7MsdVMEBBwfOtKtEyVgODxjkQpZdesk7uMhL+t+HI4zlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T19:39:00.039583Z"},"content_sha256":"8695b67d22b55ff02f2bada583affc99405dabbb9b6d748555cfdd1a2d0626f2","schema_version":"1.0","event_id":"sha256:8695b67d22b55ff02f2bada583affc99405dabbb9b6d748555cfdd1a2d0626f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:AUSRM6ARZ7OE4WFDKLLDXDZVVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Study of Performance of Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ilya Razenshteyn, Richard Peng, Saurabh Sawlani, Yihe Dong, Yu Gao","submitted_at":"2020-05-03T20:37:05Z","abstract_excerpt":"We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph. We compare runtimes in computing OT distances on data from several domains, such as synthetic data of geometric shapes, embeddings of tokens in documents, and pixels in images. We show that in practice, combinatorial methods such as network simplex and augmenting path based algorithms can consistently outperform numerical matrix-scaling based methods such as Sinkhorn [Cuturi'13] and Greenkhorn [Altschuler et al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.01182","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.01182/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"},"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-07-05T01:16:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yoNEU2KUt/miCL7EJASprhnbdXogwsuyEU72ihXT215PRYNZJjOObN/H4DE/mery0WzwcLxFKLUuvFiZ6qLACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T19:39:00.039947Z"},"content_sha256":"d2439761cb1283aa8e5b7972c8672a5cb807899c63576b018b782ca057176f2d","schema_version":"1.0","event_id":"sha256:d2439761cb1283aa8e5b7972c8672a5cb807899c63576b018b782ca057176f2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AUSRM6ARZ7OE4WFDKLLDXDZVVK/bundle.json","state_url":"https://pith.science/pith/AUSRM6ARZ7OE4WFDKLLDXDZVVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AUSRM6ARZ7OE4WFDKLLDXDZVVK/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-07-13T19:39:00Z","links":{"resolver":"https://pith.science/pith/AUSRM6ARZ7OE4WFDKLLDXDZVVK","bundle":"https://pith.science/pith/AUSRM6ARZ7OE4WFDKLLDXDZVVK/bundle.json","state":"https://pith.science/pith/AUSRM6ARZ7OE4WFDKLLDXDZVVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AUSRM6ARZ7OE4WFDKLLDXDZVVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:AUSRM6ARZ7OE4WFDKLLDXDZVVK","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":"f831ba0ca678112109adb13c8f951b236023ba0031aaf3c000fc33f24a842b57","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-03T20:37:05Z","title_canon_sha256":"2953f29f8de5a8f4e4f0fff50cd91731dc47d7c8b775ea333611fcb57c59021c"},"schema_version":"1.0","source":{"id":"2005.01182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.01182","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"arxiv_version","alias_value":"2005.01182v1","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.01182","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"pith_short_12","alias_value":"AUSRM6ARZ7OE","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"pith_short_16","alias_value":"AUSRM6ARZ7OE4WFD","created_at":"2026-07-05T01:16:14Z"},{"alias_kind":"pith_short_8","alias_value":"AUSRM6AR","created_at":"2026-07-05T01:16:14Z"}],"graph_snapshots":[{"event_id":"sha256:d2439761cb1283aa8e5b7972c8672a5cb807899c63576b018b782ca057176f2d","target":"graph","created_at":"2026-07-05T01:16:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.01182/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph. We compare runtimes in computing OT distances on data from several domains, such as synthetic data of geometric shapes, embeddings of tokens in documents, and pixels in images. We show that in practice, combinatorial methods such as network simplex and augmenting path based algorithms can consistently outperform numerical matrix-scaling based methods such as Sinkhorn [Cuturi'13] and Greenkhorn [Altschuler et al","authors_text":"Ilya Razenshteyn, Richard Peng, Saurabh Sawlani, Yihe Dong, Yu Gao","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-03T20:37:05Z","title":"A Study of Performance of Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.01182","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:8695b67d22b55ff02f2bada583affc99405dabbb9b6d748555cfdd1a2d0626f2","target":"record","created_at":"2026-07-05T01:16:14Z","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":"f831ba0ca678112109adb13c8f951b236023ba0031aaf3c000fc33f24a842b57","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-03T20:37:05Z","title_canon_sha256":"2953f29f8de5a8f4e4f0fff50cd91731dc47d7c8b775ea333611fcb57c59021c"},"schema_version":"1.0","source":{"id":"2005.01182","kind":"arxiv","version":1}},"canonical_sha256":"0525167811cfdc4e58a352d63b8f35aa987745aaef6fc000cbf01385ead4dbaf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0525167811cfdc4e58a352d63b8f35aa987745aaef6fc000cbf01385ead4dbaf","first_computed_at":"2026-07-05T01:16:14.849888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:16:14.849888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f9Dce531Oiuv2Ms89Z3jTxsvK8+Brq+yEHHMabmSC7e6DU9dtOkcRrUQ18VJYmeo494Yp/viSBaaUdtUQVU4Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:16:14.850338Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.01182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8695b67d22b55ff02f2bada583affc99405dabbb9b6d748555cfdd1a2d0626f2","sha256:d2439761cb1283aa8e5b7972c8672a5cb807899c63576b018b782ca057176f2d"],"state_sha256":"c1ff1cebd501642334a9731a2112ada4e7af39c99e14915f29572606975c6f88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rh2e2q3Yl6fWyNX+6EKxZsl0Q+la+H96jJuC+adSGl/3jJfOQgzqsYYTcMVUXlay8eFQic+d608ecuH1lMTMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T19:39:00.042977Z","bundle_sha256":"fd415a1d1c4601ede1fe49559c942295610752e3ff8d57602b3eaa591d942914"}}