{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5BOU4AZQAL6HQWV4SUPHKWS5SR","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":"4e17df5ea3d55e85d94c0757797f774ddbd6223093ed585d07e00b69e1f78996","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-02-09T06:03:36Z","title_canon_sha256":"51095f8018b73145b84e73a3c86d137dcb75c22368be2ea61ce0728a924a984b"},"schema_version":"1.0","source":{"id":"2002.03293","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.03293","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"2002.03293v2","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03293","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"5BOU4AZQAL6H","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"pith_short_16","alias_value":"5BOU4AZQAL6HQWV4","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"pith_short_8","alias_value":"5BOU4AZQ","created_at":"2026-07-05T01:52:45Z"}],"graph_snapshots":[{"event_id":"sha256:3706c7e519d626c4e1a9ac5220025ef659eae7d41fc1220c2459b97037f783ac","target":"graph","created_at":"2026-07-05T01:52:45Z","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/2002.03293/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide a computational complexity analysis for the Sinkhorn algorithm that solves the entropic regularized Unbalanced Optimal Transport (UOT) problem between two measures of possibly different masses with at most $n$ components. We show that the complexity of the Sinkhorn algorithm for finding an $\\varepsilon$-approximate solution to the UOT problem is of order $\\widetilde{\\mathcal{O}}(n^2/ \\varepsilon)$, which is near-linear time. To the best of our knowledge, this complexity is better than the complexity of the Sinkhorn algorithm for solving the Optimal Transport (OT) problem, which is o","authors_text":"Hung Bui, Khang Le, Khiem Pham, Nhat Ho, Tung Pham","cross_cats":["cs.DS","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-02-09T06:03:36Z","title":"On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03293","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:b3042af6538dac65a6299bb44f86011aa944cf5304e2bffa167a79e62bde0888","target":"record","created_at":"2026-07-05T01:52:45Z","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":"4e17df5ea3d55e85d94c0757797f774ddbd6223093ed585d07e00b69e1f78996","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-02-09T06:03:36Z","title_canon_sha256":"51095f8018b73145b84e73a3c86d137dcb75c22368be2ea61ce0728a924a984b"},"schema_version":"1.0","source":{"id":"2002.03293","kind":"arxiv","version":2}},"canonical_sha256":"e85d4e033002fc785abc951e755a5d9466028fe12dd3d5dce2761c6783f56e08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e85d4e033002fc785abc951e755a5d9466028fe12dd3d5dce2761c6783f56e08","first_computed_at":"2026-07-05T01:52:45.792311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:52:45.792311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"auAphnFvzhchr+gR6NtRsHiTtKXA8S2DwCGC0GQq5k5XKOmxavB4ujTn0iIxMDKLRVTcQSCn8NoAQSxV8QCgAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:52:45.792807Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.03293","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3042af6538dac65a6299bb44f86011aa944cf5304e2bffa167a79e62bde0888","sha256:3706c7e519d626c4e1a9ac5220025ef659eae7d41fc1220c2459b97037f783ac"],"state_sha256":"8466f7fb1ebae368a4dc4d0d305dd51b3d561d94bf352d94136b1e8d2f18fbe6"}