{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Z2RIVFFTVJWZOT4W6BMW4UO2OW","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":"570ca06b6f89adc42531daadb363dff9becb4fa44e1e21e362a0d08fe89acef6","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-04T08:39:45Z","title_canon_sha256":"9572f0b823c16018a2e9cff8c5962e3ea9ae50fee650fae7a75f918e05468545"},"schema_version":"1.0","source":{"id":"2412.03120","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03120","created_at":"2026-07-05T09:59:56Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03120v4","created_at":"2026-07-05T09:59:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03120","created_at":"2026-07-05T09:59:56Z"},{"alias_kind":"pith_short_12","alias_value":"Z2RIVFFTVJWZ","created_at":"2026-07-05T09:59:56Z"},{"alias_kind":"pith_short_16","alias_value":"Z2RIVFFTVJWZOT4W","created_at":"2026-07-05T09:59:56Z"},{"alias_kind":"pith_short_8","alias_value":"Z2RIVFFT","created_at":"2026-07-05T09:59:56Z"}],"graph_snapshots":[{"event_id":"sha256:c78996c6bf481e18380380be542e3107050d86f7ea8f95c14e6ae288b06f5430","target":"graph","created_at":"2026-07-05T09:59:56Z","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/2412.03120/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sinkhorn algorithm is the de-facto standard approximation algorithm for optimal transport, which has been applied to a variety of applications, including image processing and natural language processing. In theory, the proof of its convergence follows from the convergence of the Sinkhorn--Knopp algorithm for the matrix scaling problem, and Altschuler et al. show that its worst-case time complexity is in near-linear time. Very recently, sequentially composed optimal transports were proposed by Watanabe and Isobe as a hierarchical extension of optimal transports. In this paper, we present an eff","authors_text":"Kazuki Watanabe, Noboru Isobe","cross_cats":["cs.LG","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-04T08:39:45Z","title":"Sinkhorn Algorithm for Sequentially Composed Optimal Transports"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03120","kind":"arxiv","version":4},"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:92780867bf777cda4e741b1cd9a81ff0e361d896163aa9cc3a92d2f265062c6b","target":"record","created_at":"2026-07-05T09:59:56Z","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":"570ca06b6f89adc42531daadb363dff9becb4fa44e1e21e362a0d08fe89acef6","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-04T08:39:45Z","title_canon_sha256":"9572f0b823c16018a2e9cff8c5962e3ea9ae50fee650fae7a75f918e05468545"},"schema_version":"1.0","source":{"id":"2412.03120","kind":"arxiv","version":4}},"canonical_sha256":"cea28a94b3aa6d974f96f0596e51da75a92da06e51039d3baf5e7222976bc0d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cea28a94b3aa6d974f96f0596e51da75a92da06e51039d3baf5e7222976bc0d2","first_computed_at":"2026-07-05T09:59:56.520633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:59:56.520633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lwj8VgAm4rnPWxkD0cyp41DttF8wacaCoA0Ghg0dwZJBztZMHIQtevtOAOeLQ0JnVoEqWKL4p2RvZJsHNOFxCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:59:56.521011Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.03120","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92780867bf777cda4e741b1cd9a81ff0e361d896163aa9cc3a92d2f265062c6b","sha256:c78996c6bf481e18380380be542e3107050d86f7ea8f95c14e6ae288b06f5430"],"state_sha256":"17f0932530caacb59e7138b11d6d2cf97dc7fdeb31777905a7a76080b74e2b2d"}