{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZVMPXQL3VEXMA5YUZMHPFNWZTZ","short_pith_number":"pith:ZVMPXQL3","canonical_record":{"source":{"id":"2305.14939","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-05-24T09:23:33Z","cross_cats_sorted":[],"title_canon_sha256":"8e3f56f3c0db270fc60a70bf0a77f9a1d8eeef78d01178281ab1b00623e6852a","abstract_canon_sha256":"4b08e63e2e2c995f5737e9ea972ea678c4031a52122e84c1dd4b55c462f53bb7"},"schema_version":"1.0"},"canonical_sha256":"cd58fbc17ba92ec07714cb0ef2b6d99e529243205df25d51ba8103fb3eb97cc3","source":{"kind":"arxiv","id":"2305.14939","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.14939","created_at":"2026-07-05T07:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"2305.14939v2","created_at":"2026-07-05T07:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.14939","created_at":"2026-07-05T07:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZVMPXQL3VEXM","created_at":"2026-07-05T07:02:29Z"},{"alias_kind":"pith_short_16","alias_value":"ZVMPXQL3VEXMA5YU","created_at":"2026-07-05T07:02:29Z"},{"alias_kind":"pith_short_8","alias_value":"ZVMPXQL3","created_at":"2026-07-05T07:02:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZVMPXQL3VEXMA5YUZMHPFNWZTZ","target":"record","payload":{"canonical_record":{"source":{"id":"2305.14939","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-05-24T09:23:33Z","cross_cats_sorted":[],"title_canon_sha256":"8e3f56f3c0db270fc60a70bf0a77f9a1d8eeef78d01178281ab1b00623e6852a","abstract_canon_sha256":"4b08e63e2e2c995f5737e9ea972ea678c4031a52122e84c1dd4b55c462f53bb7"},"schema_version":"1.0"},"canonical_sha256":"cd58fbc17ba92ec07714cb0ef2b6d99e529243205df25d51ba8103fb3eb97cc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:02:29.427156Z","signature_b64":"yurbp3gQbRPRykXUb5qU0JAHe90Y7mx18zZWdPim54TlU1pkU9yFsKE9vnCujnbonP75CozgcHsgT0ma+YOcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd58fbc17ba92ec07714cb0ef2b6d99e529243205df25d51ba8103fb3eb97cc3","last_reissued_at":"2026-07-05T07:02:29.426618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:02:29.426618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.14939","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-07-05T07:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhb/QJ0X071IgcVTErRrhEhaPf4bHvmdWXXcMnc8eDhC2fwCKRsweq5C3c+1khbsCqQfxvqXJwcMO8/1yxptCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:04:16.530056Z"},"content_sha256":"c02ad0a3b0d410f139b8950471ce3384e32475546199c55913ca16c688588156","schema_version":"1.0","event_id":"sha256:c02ad0a3b0d410f139b8950471ce3384e32475546199c55913ca16c688588156"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZVMPXQL3VEXMA5YUZMHPFNWZTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dingchuan Yang, Jianzhou Luo, Ke Wei","submitted_at":"2023-05-24T09:23:33Z","abstract_excerpt":"The Sinkhorn algorithm is a widely used method for solving the optimal transport problem, and the Greenkhorn algorithm is one of its variants. While there are modified versions of these two algorithms whose computational complexities are $O({n^2\\|C\\|_\\infty^2\\log n}/{\\varepsilon^2})$ to achieve an $\\varepsilon$-accuracy, to the best of our knowledge, the existing complexities for the vanilla versions are $O({n^2\\|C\\|_\\infty^3\\log n}/{\\varepsilon^3})$. In this paper we fill this gap and show that the complexities of the vanilla Sinkhorn and Greenkhorn algorithms are indeed $O({n^2\\|C\\|_\\infty^2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.14939","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.14939/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-05T07:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IKIMegQ1hX6Tix9UkW6IriWWfXaW72HaIDmjSehcOWC9paBLlZ2ivX3in+THycJCzw9PtUUz0/STMcGADAabDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:04:16.530560Z"},"content_sha256":"3550ca9fc038dc4244dd4994829916b64e3462b1c746cdc2a9f18ebf0b32a716","schema_version":"1.0","event_id":"sha256:3550ca9fc038dc4244dd4994829916b64e3462b1c746cdc2a9f18ebf0b32a716"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/bundle.json","state_url":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/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-08-08T07:04:16Z","links":{"resolver":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ","bundle":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/bundle.json","state":"https://pith.science/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVMPXQL3VEXMA5YUZMHPFNWZTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZVMPXQL3VEXMA5YUZMHPFNWZTZ","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":"4b08e63e2e2c995f5737e9ea972ea678c4031a52122e84c1dd4b55c462f53bb7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-05-24T09:23:33Z","title_canon_sha256":"8e3f56f3c0db270fc60a70bf0a77f9a1d8eeef78d01178281ab1b00623e6852a"},"schema_version":"1.0","source":{"id":"2305.14939","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.14939","created_at":"2026-07-05T07:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"2305.14939v2","created_at":"2026-07-05T07:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.14939","created_at":"2026-07-05T07:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZVMPXQL3VEXM","created_at":"2026-07-05T07:02:29Z"},{"alias_kind":"pith_short_16","alias_value":"ZVMPXQL3VEXMA5YU","created_at":"2026-07-05T07:02:29Z"},{"alias_kind":"pith_short_8","alias_value":"ZVMPXQL3","created_at":"2026-07-05T07:02:29Z"}],"graph_snapshots":[{"event_id":"sha256:3550ca9fc038dc4244dd4994829916b64e3462b1c746cdc2a9f18ebf0b32a716","target":"graph","created_at":"2026-07-05T07:02:29Z","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/2305.14939/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Sinkhorn algorithm is a widely used method for solving the optimal transport problem, and the Greenkhorn algorithm is one of its variants. While there are modified versions of these two algorithms whose computational complexities are $O({n^2\\|C\\|_\\infty^2\\log n}/{\\varepsilon^2})$ to achieve an $\\varepsilon$-accuracy, to the best of our knowledge, the existing complexities for the vanilla versions are $O({n^2\\|C\\|_\\infty^3\\log n}/{\\varepsilon^3})$. In this paper we fill this gap and show that the complexities of the vanilla Sinkhorn and Greenkhorn algorithms are indeed $O({n^2\\|C\\|_\\infty^2","authors_text":"Dingchuan Yang, Jianzhou Luo, Ke Wei","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-05-24T09:23:33Z","title":"Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.14939","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:c02ad0a3b0d410f139b8950471ce3384e32475546199c55913ca16c688588156","target":"record","created_at":"2026-07-05T07:02:29Z","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":"4b08e63e2e2c995f5737e9ea972ea678c4031a52122e84c1dd4b55c462f53bb7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-05-24T09:23:33Z","title_canon_sha256":"8e3f56f3c0db270fc60a70bf0a77f9a1d8eeef78d01178281ab1b00623e6852a"},"schema_version":"1.0","source":{"id":"2305.14939","kind":"arxiv","version":2}},"canonical_sha256":"cd58fbc17ba92ec07714cb0ef2b6d99e529243205df25d51ba8103fb3eb97cc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd58fbc17ba92ec07714cb0ef2b6d99e529243205df25d51ba8103fb3eb97cc3","first_computed_at":"2026-07-05T07:02:29.426618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:02:29.426618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yurbp3gQbRPRykXUb5qU0JAHe90Y7mx18zZWdPim54TlU1pkU9yFsKE9vnCujnbonP75CozgcHsgT0ma+YOcAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:02:29.427156Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.14939","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c02ad0a3b0d410f139b8950471ce3384e32475546199c55913ca16c688588156","sha256:3550ca9fc038dc4244dd4994829916b64e3462b1c746cdc2a9f18ebf0b32a716"],"state_sha256":"f592879a45458972b65dd53e18629b94d9c16bc34bfeb6456b95400e3769a370"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y+4Zg5hqb6G6NI5/so3oIIA6mPqbtSJQwAe4cUHvjplaFHWm8a+HHTN3+9sAe0Bt+a2FmmcY60mKn36F0Q4jAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T07:04:16.535460Z","bundle_sha256":"15a0e26de94b3568e373926810b106588f6d1a80209d2d3af2ead5162792264b"}}