{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RA4JBC73M3O2C2BFQRULDBLAFQ","short_pith_number":"pith:RA4JBC73","schema_version":"1.0","canonical_sha256":"8838908bfb66dda168258468b185602c3be50e963404e6d5050b580acc9ccc7f","source":{"kind":"arxiv","id":"2506.04600","version":1},"attestation_state":"computed","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:"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.04600","created_at":"2026-07-05T11:16:17.592240+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.04600v1","created_at":"2026-07-05T11:16:17.592240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04600","created_at":"2026-07-05T11:16:17.592240+00:00"},{"alias_kind":"pith_short_12","alias_value":"RA4JBC73M3O2","created_at":"2026-07-05T11:16:17.592240+00:00"},{"alias_kind":"pith_short_16","alias_value":"RA4JBC73M3O2C2BF","created_at":"2026-07-05T11:16:17.592240+00:00"},{"alias_kind":"pith_short_8","alias_value":"RA4JBC73","created_at":"2026-07-05T11:16:17.592240+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ","json":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ.json","graph_json":"https://pith.science/api/pith-number/RA4JBC73M3O2C2BFQRULDBLAFQ/graph.json","events_json":"https://pith.science/api/pith-number/RA4JBC73M3O2C2BFQRULDBLAFQ/events.json","paper":"https://pith.science/paper/RA4JBC73"},"agent_actions":{"view_html":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ","download_json":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ.json","view_paper":"https://pith.science/paper/RA4JBC73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.04600&json=true","fetch_graph":"https://pith.science/api/pith-number/RA4JBC73M3O2C2BFQRULDBLAFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RA4JBC73M3O2C2BFQRULDBLAFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ/action/storage_attestation","attest_author":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ/action/author_attestation","sign_citation":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ/action/citation_signature","submit_replication":"https://pith.science/pith/RA4JBC73M3O2C2BFQRULDBLAFQ/action/replication_record"}},"created_at":"2026-07-05T11:16:17.592240+00:00","updated_at":"2026-07-05T11:16:17.592240+00:00"}