{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TH6UZUYXS6R5JI4I2ICMMMPKPY","short_pith_number":"pith:TH6UZUYX","canonical_record":{"source":{"id":"2604.26265","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-29T03:48:58Z","cross_cats_sorted":[],"title_canon_sha256":"e49e128194bfaeade319541a85f4cdb338aa413fd56792cfab87a8851af9100e","abstract_canon_sha256":"c21083ce87169f1c07174107917e1032fbeb439bae7345321bbccf896c231d70"},"schema_version":"1.0"},"canonical_sha256":"99fd4cd31797a3d4a388d204c631ea7e1cf55cc9395ec1db724c55ad653df7f9","source":{"kind":"arxiv","id":"2604.26265","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TH6UZUYXS6R5JI4I2ICMMMPKPY","target":"record","payload":{"canonical_record":{"source":{"id":"2604.26265","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-29T03:48:58Z","cross_cats_sorted":[],"title_canon_sha256":"e49e128194bfaeade319541a85f4cdb338aa413fd56792cfab87a8851af9100e","abstract_canon_sha256":"c21083ce87169f1c07174107917e1032fbeb439bae7345321bbccf896c231d70"},"schema_version":"1.0"},"canonical_sha256":"99fd4cd31797a3d4a388d204c631ea7e1cf55cc9395ec1db724c55ad653df7f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:38.783531Z","signature_b64":"FypohrqaLgpUIsmEbRfKPe3nwPLLw21adjPDi5UwrCOQnFIjoDrsNwo5fEYEUkgabqWMc9BCg1vGHoegVZAECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99fd4cd31797a3d4a388d204c631ea7e1cf55cc9395ec1db724c55ad653df7f9","last_reissued_at":"2026-06-30T01:17:38.782775Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:38.782775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.26265","source_version":3,"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-06-30T01:17:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5i7imSuXDWo44Lle/Vvy5+y7xa0BHDr8ZuFJhGHrWlzzpknVzWGPzyBuL7astN5UuNhJhPUWuLZvaSSBLujCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:57:24.207135Z"},"content_sha256":"07364c6a60e0098a9ae3420d1a530e4ade2090a37a15b1529e65a08730aad0d1","schema_version":"1.0","event_id":"sha256:07364c6a60e0098a9ae3420d1a530e4ade2090a37a15b1529e65a08730aad0d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TH6UZUYXS6R5JI4I2ICMMMPKPY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost-sharp $O(k^{-1} \\log k)$ convergence rate for the Sinkhorn algorithm in the asymptotically scalable case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The Sinkhorn algorithm converges at an O(k^{-1} log k) rate in ell_1 marginal error under the asymptotically scalable condition.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guillaume Wang","submitted_at":"2026-04-29T03:48:58Z","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)."},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The Sinkhorn algorithm converges at an O(k^{-1} log k) rate in ell_1 marginal error under the asymptotically scalable condition.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"689a69cf3fee158144717973c86c9c833c773c804a23c398ea2e79813b506bab"},"source":{"id":"2604.26265","kind":"arxiv","version":3},"verdict":{"id":"feb59d09-a159-492f-ba68-337413c68b9e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T07:20:22.218857Z","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.","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","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.","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."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.26265/integrity.json","findings":[],"available":true,"detectors_run":[{"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","findings_count":0}],"snapshot_sha256":"1d080667156a60c48796233569ca9422f2e687e48625f193c836749a34039cf5"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"589c41523f29a4c6bf6b11f8be66d22fbaca80dc5e285d4cb5c93c38f0a32887"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"feb59d09-a159-492f-ba68-337413c68b9e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-30T01:17:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BxBnOgVOaZ3ZziIpTZQIjDtmq1TrDf4txJQ+O4XpOtExWniCOAMnjEbEDFEQzpEzdGFYFTUBwT1IlQZJX1pTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:57:24.207637Z"},"content_sha256":"7bdaa9a2ee0de50e4eeb7f2c321edacdce4dd3f7038c6d1b42a051523d51aca1","schema_version":"1.0","event_id":"sha256:7bdaa9a2ee0de50e4eeb7f2c321edacdce4dd3f7038c6d1b42a051523d51aca1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TH6UZUYXS6R5JI4I2ICMMMPKPY/bundle.json","state_url":"https://pith.science/pith/TH6UZUYXS6R5JI4I2ICMMMPKPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TH6UZUYXS6R5JI4I2ICMMMPKPY/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-03T22:57:24Z","links":{"resolver":"https://pith.science/pith/TH6UZUYXS6R5JI4I2ICMMMPKPY","bundle":"https://pith.science/pith/TH6UZUYXS6R5JI4I2ICMMMPKPY/bundle.json","state":"https://pith.science/pith/TH6UZUYXS6R5JI4I2ICMMMPKPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TH6UZUYXS6R5JI4I2ICMMMPKPY/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nx/9C52+XTHBb8MM8omxB5bh1XuWTPT/aM5GVFCdzZGPoqRKg8FldO9zo3KncbesbmIVNmZdkd7TrGmLhSmZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T22:57:24.210655Z","bundle_sha256":"6ba02e472430e9d5d9277f8ba7eff7ff7a7e978ff9b508b0f7c37728c8c21e99"}}