{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LBYHKZIFBC3NFDMIJCWCR3OEE7","short_pith_number":"pith:LBYHKZIF","canonical_record":{"source":{"id":"2511.19513","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-11-24T02:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"7f36bbc78e23d25b3faf514c734e5938d7fc62e19cdf81b459838812fc9819ca","abstract_canon_sha256":"e954eb4601c01dbdbba7a830b24a85367764ce34a926bf558bab17547e27c15a"},"schema_version":"1.0"},"canonical_sha256":"587075650508b6d28d8848ac28edc427d22e74088bdea84fb06de791e033ab91","source":{"kind":"arxiv","id":"2511.19513","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.19513","created_at":"2026-06-01T01:02:26Z"},{"alias_kind":"arxiv_version","alias_value":"2511.19513v3","created_at":"2026-06-01T01:02:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.19513","created_at":"2026-06-01T01:02:26Z"},{"alias_kind":"pith_short_12","alias_value":"LBYHKZIFBC3N","created_at":"2026-06-01T01:02:26Z"},{"alias_kind":"pith_short_16","alias_value":"LBYHKZIFBC3NFDMI","created_at":"2026-06-01T01:02:26Z"},{"alias_kind":"pith_short_8","alias_value":"LBYHKZIF","created_at":"2026-06-01T01:02:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LBYHKZIFBC3NFDMIJCWCR3OEE7","target":"record","payload":{"canonical_record":{"source":{"id":"2511.19513","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-11-24T02:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"7f36bbc78e23d25b3faf514c734e5938d7fc62e19cdf81b459838812fc9819ca","abstract_canon_sha256":"e954eb4601c01dbdbba7a830b24a85367764ce34a926bf558bab17547e27c15a"},"schema_version":"1.0"},"canonical_sha256":"587075650508b6d28d8848ac28edc427d22e74088bdea84fb06de791e033ab91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:02:26.013171Z","signature_b64":"obZiPGNm1JZJsBC5cWUfiq2wBQ5p4BF4069GnKy9iCqU5qUt1HAcZf8+eilGsXIpusqla0f6KTwiKWCkBHphAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"587075650508b6d28d8848ac28edc427d22e74088bdea84fb06de791e033ab91","last_reissued_at":"2026-06-01T01:02:26.012014Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:02:26.012014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.19513","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-01T01:02:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxrZRlPFIDLQLKU08ALrOjInkgDaUXkYFSDwC6srFvG4A9LgGdKrv729AyCmEx4ra1/ZbQO+9wVEjpjwZQPvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:49:17.969506Z"},"content_sha256":"5dbc5af7768bfd96639e676e3ea541d53b13e14628e54fdc731e3cfaf7825030","schema_version":"1.0","event_id":"sha256:5dbc5af7768bfd96639e676e3ea541d53b13e14628e54fdc731e3cfaf7825030"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LBYHKZIFBC3NFDMIJCWCR3OEE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Row-Stochastic Matrices Can Provably Outperform Doubly Stochastic Matrices in Decentralized Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Row-stochastic matrices can converge faster than doubly stochastic matrices in decentralized learning by avoiding extra consensus penalties in weighted geometry.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bing Liu, Boao Kong, Chengcheng Zhao, Kun Yuan, Limin Lu","submitted_at":"2025-11-24T02:58:38Z","abstract_excerpt":"Decentralized learning often involves a weighted global loss with heterogeneous node weights $\\lambda$. We revisit two natural strategies for incorporating these weights: (i) embedding them into the local losses to retain a uniform weight (and thus a doubly stochastic matrix), and (ii) keeping the original losses while employing a $\\lambda$-induced row-stochastic matrix. Although prior work shows that both strategies target the same $\\lambda$-weighted global loss, it remains unclear whether the Euclidean-space guarantees are tight and what fundamentally differentiates their behaviors. To clari"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"In this geometry, the row-stochastic matrix becomes self-adjoint whereas the doubly stochastic one does not, creating additional penalty terms that amplify consensus error, thereby slowing convergence. We then derive sufficient conditions under which the row-stochastic design converges faster even with a smaller spectral gap.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the weighted Hilbert-space framework L^2(λ; ℝ^d) is the appropriate geometry for revealing the true convergence behavior and that the identified penalty terms are the dominant differentiator rather than other unmodeled dynamics in the optimization process.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Row-stochastic matrices can provably outperform doubly stochastic matrices in convergence speed for weighted decentralized learning by becoming self-adjoint in a custom L^2(λ; ℝ^d) geometry, eliminating penalty terms that slow consensus.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Row-stochastic matrices can converge faster than doubly stochastic matrices in decentralized learning by avoiding extra consensus penalties in weighted geometry.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1dfb0cf275064df2ab30bfd781d69d55e540cae2d9bb4c573f51e05e8840895d"},"source":{"id":"2511.19513","kind":"arxiv","version":3},"verdict":{"id":"37ff062d-beaa-4ee5-bcae-ccf9ad554c1a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T05:34:41.572457Z","strongest_claim":"In this geometry, the row-stochastic matrix becomes self-adjoint whereas the doubly stochastic one does not, creating additional penalty terms that amplify consensus error, thereby slowing convergence. We then derive sufficient conditions under which the row-stochastic design converges faster even with a smaller spectral gap.","one_line_summary":"Row-stochastic matrices can provably outperform doubly stochastic matrices in convergence speed for weighted decentralized learning by becoming self-adjoint in a custom L^2(λ; ℝ^d) geometry, eliminating penalty terms that slow consensus.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the weighted Hilbert-space framework L^2(λ; ℝ^d) is the appropriate geometry for revealing the true convergence behavior and that the identified penalty terms are the dominant differentiator rather than other unmodeled dynamics in the optimization process.","pith_extraction_headline":"Row-stochastic matrices can converge faster than doubly stochastic matrices in decentralized learning by avoiding extra consensus penalties in weighted geometry."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.19513/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":1,"snapshot_sha256":"ee28d4fc6c1698e20b2b23c718c8e1ea1e342da67c506ee99f9bff3d92d31970"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"37ff062d-beaa-4ee5-bcae-ccf9ad554c1a"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T01:02:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M6VXMy1yhpE7UFX1Geh8+p9/JYrMp9Y0dEvcZ5x6JfNJceiocm3sSnjyr5iVU/MqZRj58xYRWWPVWW97Uv9PCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:49:17.970055Z"},"content_sha256":"36d00f6c9403091d44e631ad46a4cdf22c37d6e0a5ea0085ddc1eac477bd80ed","schema_version":"1.0","event_id":"sha256:36d00f6c9403091d44e631ad46a4cdf22c37d6e0a5ea0085ddc1eac477bd80ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBYHKZIFBC3NFDMIJCWCR3OEE7/bundle.json","state_url":"https://pith.science/pith/LBYHKZIFBC3NFDMIJCWCR3OEE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBYHKZIFBC3NFDMIJCWCR3OEE7/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-06-21T23:49:17Z","links":{"resolver":"https://pith.science/pith/LBYHKZIFBC3NFDMIJCWCR3OEE7","bundle":"https://pith.science/pith/LBYHKZIFBC3NFDMIJCWCR3OEE7/bundle.json","state":"https://pith.science/pith/LBYHKZIFBC3NFDMIJCWCR3OEE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBYHKZIFBC3NFDMIJCWCR3OEE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LBYHKZIFBC3NFDMIJCWCR3OEE7","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":"e954eb4601c01dbdbba7a830b24a85367764ce34a926bf558bab17547e27c15a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-11-24T02:58:38Z","title_canon_sha256":"7f36bbc78e23d25b3faf514c734e5938d7fc62e19cdf81b459838812fc9819ca"},"schema_version":"1.0","source":{"id":"2511.19513","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.19513","created_at":"2026-06-01T01:02:26Z"},{"alias_kind":"arxiv_version","alias_value":"2511.19513v3","created_at":"2026-06-01T01:02:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.19513","created_at":"2026-06-01T01:02:26Z"},{"alias_kind":"pith_short_12","alias_value":"LBYHKZIFBC3N","created_at":"2026-06-01T01:02:26Z"},{"alias_kind":"pith_short_16","alias_value":"LBYHKZIFBC3NFDMI","created_at":"2026-06-01T01:02:26Z"},{"alias_kind":"pith_short_8","alias_value":"LBYHKZIF","created_at":"2026-06-01T01:02:26Z"}],"graph_snapshots":[{"event_id":"sha256:36d00f6c9403091d44e631ad46a4cdf22c37d6e0a5ea0085ddc1eac477bd80ed","target":"graph","created_at":"2026-06-01T01:02:26Z","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":"In this geometry, the row-stochastic matrix becomes self-adjoint whereas the doubly stochastic one does not, creating additional penalty terms that amplify consensus error, thereby slowing convergence. We then derive sufficient conditions under which the row-stochastic design converges faster even with a smaller spectral gap."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the weighted Hilbert-space framework L^2(λ; ℝ^d) is the appropriate geometry for revealing the true convergence behavior and that the identified penalty terms are the dominant differentiator rather than other unmodeled dynamics in the optimization process."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Row-stochastic matrices can provably outperform doubly stochastic matrices in convergence speed for weighted decentralized learning by becoming self-adjoint in a custom L^2(λ; ℝ^d) geometry, eliminating penalty terms that slow consensus."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Row-stochastic matrices can converge faster than doubly stochastic matrices in decentralized learning by avoiding extra consensus penalties in weighted geometry."}],"snapshot_sha256":"1dfb0cf275064df2ab30bfd781d69d55e540cae2d9bb4c573f51e05e8840895d"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"ee28d4fc6c1698e20b2b23c718c8e1ea1e342da67c506ee99f9bff3d92d31970"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2511.19513/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decentralized learning often involves a weighted global loss with heterogeneous node weights $\\lambda$. We revisit two natural strategies for incorporating these weights: (i) embedding them into the local losses to retain a uniform weight (and thus a doubly stochastic matrix), and (ii) keeping the original losses while employing a $\\lambda$-induced row-stochastic matrix. Although prior work shows that both strategies target the same $\\lambda$-weighted global loss, it remains unclear whether the Euclidean-space guarantees are tight and what fundamentally differentiates their behaviors. To clari","authors_text":"Bing Liu, Boao Kong, Chengcheng Zhao, Kun Yuan, Limin Lu","cross_cats":[],"headline":"Row-stochastic matrices can converge faster than doubly stochastic matrices in decentralized learning by avoiding extra consensus penalties in weighted geometry.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-11-24T02:58:38Z","title":"Row-Stochastic Matrices Can Provably Outperform Doubly Stochastic Matrices in Decentralized Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.19513","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-17T05:34:41.572457Z","id":"37ff062d-beaa-4ee5-bcae-ccf9ad554c1a","model_set":{"reader":"grok-4.3"},"one_line_summary":"Row-stochastic matrices can provably outperform doubly stochastic matrices in convergence speed for weighted decentralized learning by becoming self-adjoint in a custom L^2(λ; ℝ^d) geometry, eliminating penalty terms that slow consensus.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Row-stochastic matrices can converge faster than doubly stochastic matrices in decentralized learning by avoiding extra consensus penalties in weighted geometry.","strongest_claim":"In this geometry, the row-stochastic matrix becomes self-adjoint whereas the doubly stochastic one does not, creating additional penalty terms that amplify consensus error, thereby slowing convergence. We then derive sufficient conditions under which the row-stochastic design converges faster even with a smaller spectral gap.","weakest_assumption":"That the weighted Hilbert-space framework L^2(λ; ℝ^d) is the appropriate geometry for revealing the true convergence behavior and that the identified penalty terms are the dominant differentiator rather than other unmodeled dynamics in the optimization process."}},"verdict_id":"37ff062d-beaa-4ee5-bcae-ccf9ad554c1a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5dbc5af7768bfd96639e676e3ea541d53b13e14628e54fdc731e3cfaf7825030","target":"record","created_at":"2026-06-01T01:02:26Z","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":"e954eb4601c01dbdbba7a830b24a85367764ce34a926bf558bab17547e27c15a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-11-24T02:58:38Z","title_canon_sha256":"7f36bbc78e23d25b3faf514c734e5938d7fc62e19cdf81b459838812fc9819ca"},"schema_version":"1.0","source":{"id":"2511.19513","kind":"arxiv","version":3}},"canonical_sha256":"587075650508b6d28d8848ac28edc427d22e74088bdea84fb06de791e033ab91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"587075650508b6d28d8848ac28edc427d22e74088bdea84fb06de791e033ab91","first_computed_at":"2026-06-01T01:02:26.012014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:02:26.012014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"obZiPGNm1JZJsBC5cWUfiq2wBQ5p4BF4069GnKy9iCqU5qUt1HAcZf8+eilGsXIpusqla0f6KTwiKWCkBHphAg==","signature_status":"signed_v1","signed_at":"2026-06-01T01:02:26.013171Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.19513","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dbc5af7768bfd96639e676e3ea541d53b13e14628e54fdc731e3cfaf7825030","sha256:36d00f6c9403091d44e631ad46a4cdf22c37d6e0a5ea0085ddc1eac477bd80ed"],"state_sha256":"0eab5bf735f8c08060ef2a585a0a7428f02b376d63df932f0c5b20188096d3fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8WO/3Hx3kd+xaiL3qrIR5UpcVGfFUw/T06yPsIckIvaLCJeilmWCkdQ+YDdSkzzZs7b+uKxAmUl4Dox/5PLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:49:17.972588Z","bundle_sha256":"78f95c42dc9af87db0309f73d6bca873d502f749c43cbe35d4adba682fbd8f6f"}}