{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TH6UZUYXS6R5JI4I2ICMMMPKPY","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":"c21083ce87169f1c07174107917e1032fbeb439bae7345321bbccf896c231d70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-29T03:48:58Z","title_canon_sha256":"e49e128194bfaeade319541a85f4cdb338aa413fd56792cfab87a8851af9100e"},"schema_version":"1.0","source":{"id":"2604.26265","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.26265","created_at":"2026-06-30T01:17:38Z"},{"alias_kind":"arxiv_version","alias_value":"2604.26265v3","created_at":"2026-06-30T01:17:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26265","created_at":"2026-06-30T01:17:38Z"},{"alias_kind":"pith_short_12","alias_value":"TH6UZUYXS6R5","created_at":"2026-06-30T01:17:38Z"},{"alias_kind":"pith_short_16","alias_value":"TH6UZUYXS6R5JI4I","created_at":"2026-06-30T01:17:38Z"},{"alias_kind":"pith_short_8","alias_value":"TH6UZUYX","created_at":"2026-06-30T01:17:38Z"}],"graph_snapshots":[{"event_id":"sha256:7bdaa9a2ee0de50e4eeb7f2c321edacdce4dd3f7038c6d1b42a051523d51aca1","target":"graph","created_at":"2026-06-30T01:17:38Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that the Sinkhorn algorithm converges at a rate of O(k^{-1} log k) in ℓ1-norm marginal error, in the asymptotically scalable case."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The analysis requires the problem to be in the asymptotically scalable case, whose precise definition and verification conditions are not detailed in the abstract."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Sinkhorn algorithm converges at O(k^{-1} log k) rate in l1-norm marginal error for asymptotically scalable instances, nearly matching the Omega(k^{-1}) lower bound."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The Sinkhorn algorithm converges at an O(k^{-1} log k) rate in ell_1 marginal error under the asymptotically scalable condition."}],"snapshot_sha256":"689a69cf3fee158144717973c86c9c833c773c804a23c398ea2e79813b506bab"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"589c41523f29a4c6bf6b11f8be66d22fbaca80dc5e285d4cb5c93c38f0a32887"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T00:39:43.981308Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:22:50.664095Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.26265/integrity.json","findings":[],"snapshot_sha256":"1d080667156a60c48796233569ca9422f2e687e48625f193c836749a34039cf5","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that the Sinkhorn algorithm converges at a rate of $O(k^{-1} \\log k)$ in $\\ell_1$-norm marginal error, in the asymptotically scalable case. This almost closes the gap between the lower bound $\\Omega(k^{-1})$ (Qu et al., 2025) and the previously best known upper bound $O(k^{-1/2})$ (L\\'eger, 2021), and generalizes the analysis for the positive case by Dvurechensky et al. (2018).","authors_text":"Guillaume Wang","cross_cats":[],"headline":"The Sinkhorn algorithm converges at an O(k^{-1} log k) rate in ell_1 marginal error under the asymptotically scalable condition.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-29T03:48:58Z","title":"Almost-sharp $O(k^{-1} \\log k)$ convergence rate for the Sinkhorn algorithm in the asymptotically scalable case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.26265","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-15T07:20:22.218857Z","id":"feb59d09-a159-492f-ba68-337413c68b9e","model_set":{"reader":"grok-4.3"},"one_line_summary":"Sinkhorn algorithm converges at O(k^{-1} log k) rate in l1-norm marginal error for asymptotically scalable instances, nearly matching the Omega(k^{-1}) lower bound.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The Sinkhorn algorithm converges at an O(k^{-1} log k) rate in ell_1 marginal error under the asymptotically scalable condition.","strongest_claim":"We prove that the Sinkhorn algorithm converges at a rate of O(k^{-1} log k) in ℓ1-norm marginal error, in the asymptotically scalable case.","weakest_assumption":"The analysis requires the problem to be in the asymptotically scalable case, whose precise definition and verification conditions are not detailed in the abstract."}},"verdict_id":"feb59d09-a159-492f-ba68-337413c68b9e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:07364c6a60e0098a9ae3420d1a530e4ade2090a37a15b1529e65a08730aad0d1","target":"record","created_at":"2026-06-30T01:17:38Z","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":"c21083ce87169f1c07174107917e1032fbeb439bae7345321bbccf896c231d70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-29T03:48:58Z","title_canon_sha256":"e49e128194bfaeade319541a85f4cdb338aa413fd56792cfab87a8851af9100e"},"schema_version":"1.0","source":{"id":"2604.26265","kind":"arxiv","version":3}},"canonical_sha256":"99fd4cd31797a3d4a388d204c631ea7e1cf55cc9395ec1db724c55ad653df7f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99fd4cd31797a3d4a388d204c631ea7e1cf55cc9395ec1db724c55ad653df7f9","first_computed_at":"2026-06-30T01:17:38.782775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:17:38.782775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FypohrqaLgpUIsmEbRfKPe3nwPLLw21adjPDi5UwrCOQnFIjoDrsNwo5fEYEUkgabqWMc9BCg1vGHoegVZAECQ==","signature_status":"signed_v1","signed_at":"2026-06-30T01:17:38.783531Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.26265","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07364c6a60e0098a9ae3420d1a530e4ade2090a37a15b1529e65a08730aad0d1","sha256:7bdaa9a2ee0de50e4eeb7f2c321edacdce4dd3f7038c6d1b42a051523d51aca1"],"state_sha256":"1158812b6237d2c2e02a835e2c0e6b09372427571c22c11cacbf0aec7b25b665"}