{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RA4JBC73M3O2C2BFQRULDBLAFQ","short_pith_number":"pith:RA4JBC73","canonical_record":{"source":{"id":"2506.04600","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-05T03:37:41Z","cross_cats_sorted":[],"title_canon_sha256":"f556e138438b9ce230047e79fee3a2463548ca3680a3cefac62d2743986542b8","abstract_canon_sha256":"ed89a1bf15a711f1eca58a23b115685ee15fd91af5556ca62284af56ce2e036a"},"schema_version":"1.0"},"canonical_sha256":"8838908bfb66dda168258468b185602c3be50e963404e6d5050b580acc9ccc7f","source":{"kind":"arxiv","id":"2506.04600","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04600","created_at":"2026-07-05T11:16:17Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04600v1","created_at":"2026-07-05T11:16:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04600","created_at":"2026-07-05T11:16:17Z"},{"alias_kind":"pith_short_12","alias_value":"RA4JBC73M3O2","created_at":"2026-07-05T11:16:17Z"},{"alias_kind":"pith_short_16","alias_value":"RA4JBC73M3O2C2BF","created_at":"2026-07-05T11:16:17Z"},{"alias_kind":"pith_short_8","alias_value":"RA4JBC73","created_at":"2026-07-05T11:16:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RA4JBC73M3O2C2BFQRULDBLAFQ","target":"record","payload":{"canonical_record":{"source":{"id":"2506.04600","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-05T03:37:41Z","cross_cats_sorted":[],"title_canon_sha256":"f556e138438b9ce230047e79fee3a2463548ca3680a3cefac62d2743986542b8","abstract_canon_sha256":"ed89a1bf15a711f1eca58a23b115685ee15fd91af5556ca62284af56ce2e036a"},"schema_version":"1.0"},"canonical_sha256":"8838908bfb66dda168258468b185602c3be50e963404e6d5050b580acc9ccc7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:17.592671Z","signature_b64":"PAP2aDLSBZYhhfFu9GV1IWLCsNOZ/BjUNKNEiI+ESjcATEJQ32XqD7fXYHGiP4Y3Va1mREOlD/CWCzbU8MCzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8838908bfb66dda168258468b185602c3be50e963404e6d5050b580acc9ccc7f","last_reissued_at":"2026-07-05T11:16:17.592191Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:17.592191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.04600","source_version":1,"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-07-05T11:16:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qwla0/LhW0qi5tVbjFxaibQwRtYMy0sEZIowNXNpV7aTR9rOIkSofWZ7Lub7cUbLjYrGwBEUfimJgzBkwXoBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:19:42.899381Z"},"content_sha256":"55cc5fce81017a2f7c0db00983ceb6ac0d7e0b22ec901c29e4f92f90b1618c11","schema_version":"1.0","event_id":"sha256:55cc5fce81017a2f7c0db00983ceb6ac0d7e0b22ec901c29e4f92f90b1618c11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RA4JBC73M3O2C2BFQRULDBLAFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gan Luo, Kun Yuan, Liyuan Liang, Xinyi Chen","submitted_at":"2025-06-05T03:37:41Z","abstract_excerpt":"A key challenge in decentralized optimization is determining the optimal convergence rate and designing algorithms to achieve it. While this problem has been extensively addressed for doubly-stochastic and column-stochastic mixing matrices, the row-stochastic scenario remains unexplored. This paper bridges this gap by introducing effective metrics to capture the influence of row-stochastic mixing matrices and establishing the first convergence lower bound for decentralized learning over row-stochastic networks. However, existing algorithms fail to attain this lower bound due to two key issues:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04600","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.04600/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":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:16:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TNzdfFZQ/uS235zuNOnkyLpuwe2ZI1xQPSv62vQx7imk5xYczxfHvA37WMTKz1VEOngls5FwYMAia2C5UiplCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:19:42.899915Z"},"content_sha256":"119f5e0a4c01b62e2a92b693da3b9be140a91e39e719443e8aee2369aa8cbc1a","schema_version":"1.0","event_id":"sha256:119f5e0a4c01b62e2a92b693da3b9be140a91e39e719443e8aee2369aa8cbc1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ/bundle.json","state_url":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RA4JBC73M3O2C2BFQRULDBLAFQ/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-08T05:19:42Z","links":{"resolver":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ","bundle":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ/bundle.json","state":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RA4JBC73M3O2C2BFQRULDBLAFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RA4JBC73M3O2C2BFQRULDBLAFQ","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":"ed89a1bf15a711f1eca58a23b115685ee15fd91af5556ca62284af56ce2e036a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-05T03:37:41Z","title_canon_sha256":"f556e138438b9ce230047e79fee3a2463548ca3680a3cefac62d2743986542b8"},"schema_version":"1.0","source":{"id":"2506.04600","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04600","created_at":"2026-07-05T11:16:17Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04600v1","created_at":"2026-07-05T11:16:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04600","created_at":"2026-07-05T11:16:17Z"},{"alias_kind":"pith_short_12","alias_value":"RA4JBC73M3O2","created_at":"2026-07-05T11:16:17Z"},{"alias_kind":"pith_short_16","alias_value":"RA4JBC73M3O2C2BF","created_at":"2026-07-05T11:16:17Z"},{"alias_kind":"pith_short_8","alias_value":"RA4JBC73","created_at":"2026-07-05T11:16:17Z"}],"graph_snapshots":[{"event_id":"sha256:119f5e0a4c01b62e2a92b693da3b9be140a91e39e719443e8aee2369aa8cbc1a","target":"graph","created_at":"2026-07-05T11:16:17Z","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/2506.04600/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A key challenge in decentralized optimization is determining the optimal convergence rate and designing algorithms to achieve it. While this problem has been extensively addressed for doubly-stochastic and column-stochastic mixing matrices, the row-stochastic scenario remains unexplored. This paper bridges this gap by introducing effective metrics to capture the influence of row-stochastic mixing matrices and establishing the first convergence lower bound for decentralized learning over row-stochastic networks. However, existing algorithms fail to attain this lower bound due to two key issues:","authors_text":"Gan Luo, Kun Yuan, Liyuan Liang, Xinyi Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-05T03:37:41Z","title":"Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04600","kind":"arxiv","version":1},"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:55cc5fce81017a2f7c0db00983ceb6ac0d7e0b22ec901c29e4f92f90b1618c11","target":"record","created_at":"2026-07-05T11:16:17Z","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":"ed89a1bf15a711f1eca58a23b115685ee15fd91af5556ca62284af56ce2e036a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-05T03:37:41Z","title_canon_sha256":"f556e138438b9ce230047e79fee3a2463548ca3680a3cefac62d2743986542b8"},"schema_version":"1.0","source":{"id":"2506.04600","kind":"arxiv","version":1}},"canonical_sha256":"8838908bfb66dda168258468b185602c3be50e963404e6d5050b580acc9ccc7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8838908bfb66dda168258468b185602c3be50e963404e6d5050b580acc9ccc7f","first_computed_at":"2026-07-05T11:16:17.592191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:17.592191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PAP2aDLSBZYhhfFu9GV1IWLCsNOZ/BjUNKNEiI+ESjcATEJQ32XqD7fXYHGiP4Y3Va1mREOlD/CWCzbU8MCzAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:17.592671Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.04600","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55cc5fce81017a2f7c0db00983ceb6ac0d7e0b22ec901c29e4f92f90b1618c11","sha256:119f5e0a4c01b62e2a92b693da3b9be140a91e39e719443e8aee2369aa8cbc1a"],"state_sha256":"68de38dd5b8cc7871d55af5b4b3801a0c243a412cf98189f13035d605cbafe4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpzMFd53d9S9QhYw2vVkrUmKm56E1aepvc4RLfB7npjHXMdp9APq2Jq2h49Y1LSmTyLSVZ0QJzqe81NNtf2XBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T05:19:42.904744Z","bundle_sha256":"d4988fe86bbbf138f8d589ca990313c069dcb847e0543e59a72d8189fd64dd12"}}