{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:L6XYRLU57GEB4WUEHQMSFCJLGK","short_pith_number":"pith:L6XYRLU5","schema_version":"1.0","canonical_sha256":"5faf88ae9df9881e5a843c1922892b3282629f6e45932c3ab8ddb2c9bbf1ff38","source":{"kind":"arxiv","id":"2306.16504","version":3},"attestation_state":"computed","paper":{"title":"Momentum Benefits Non-IID Federated Learning Simply and Provably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Kun Yuan, Pengfei Wu, Xinmeng Huang, Ziheng Cheng","submitted_at":"2023-06-28T18:52:27Z","abstract_excerpt":"Federated learning is a powerful paradigm for large-scale machine learning, but it faces significant challenges due to unreliable network connections, slow communication, and substantial data heterogeneity across clients. FedAvg and SCAFFOLD are two prominent algorithms to address these challenges. In particular, FedAvg employs multiple local updates before communicating with a central server, while SCAFFOLD maintains a control variable on each client to compensate for ``client drift'' in its local updates. Various methods have been proposed to enhance the convergence of these two algorithms, "},"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":"2306.16504","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-28T18:52:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b3f9d34af2883e2ce6017ac825c3e576193d03a8a45488520eec3ea01c128625","abstract_canon_sha256":"e71e3a5d8bbe131c12a3546fcc7bf074b4fdb7b663c06f3e6e3339f024164c1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:10.644044Z","signature_b64":"C5jciCNHf6Az6OffYkrlPzT+6Bjk/uSFRHLSAYBuTe1jZ0zHXK0s1iSSORG4j6qVd2s4/oPPQ4VQQbKOZ2LiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5faf88ae9df9881e5a843c1922892b3282629f6e45932c3ab8ddb2c9bbf1ff38","last_reissued_at":"2026-07-05T07:52:10.643557Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:10.643557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Momentum Benefits Non-IID Federated Learning Simply and Provably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Kun Yuan, Pengfei Wu, Xinmeng Huang, Ziheng Cheng","submitted_at":"2023-06-28T18:52:27Z","abstract_excerpt":"Federated learning is a powerful paradigm for large-scale machine learning, but it faces significant challenges due to unreliable network connections, slow communication, and substantial data heterogeneity across clients. FedAvg and SCAFFOLD are two prominent algorithms to address these challenges. In particular, FedAvg employs multiple local updates before communicating with a central server, while SCAFFOLD maintains a control variable on each client to compensate for ``client drift'' in its local updates. Various methods have been proposed to enhance the convergence of these two algorithms, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.16504","kind":"arxiv","version":3},"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/2306.16504/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":"2306.16504","created_at":"2026-07-05T07:52:10.643617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.16504v3","created_at":"2026-07-05T07:52:10.643617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.16504","created_at":"2026-07-05T07:52:10.643617+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6XYRLU57GEB","created_at":"2026-07-05T07:52:10.643617+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6XYRLU57GEB4WUE","created_at":"2026-07-05T07:52:10.643617+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6XYRLU5","created_at":"2026-07-05T07:52:10.643617+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01128","citing_title":"Local MixVR: Breaking the Communication-Sample Dependence in Distributed Learning","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24012","citing_title":"FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24012","citing_title":"FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19518","citing_title":"Accelerating Optimization and Machine Learning through Decentralization","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L6XYRLU57GEB4WUEHQMSFCJLGK","json":"https://pith.science/pith/L6XYRLU57GEB4WUEHQMSFCJLGK.json","graph_json":"https://pith.science/api/pith-number/L6XYRLU57GEB4WUEHQMSFCJLGK/graph.json","events_json":"https://pith.science/api/pith-number/L6XYRLU57GEB4WUEHQMSFCJLGK/events.json","paper":"https://pith.science/paper/L6XYRLU5"},"agent_actions":{"view_html":"https://pith.science/pith/L6XYRLU57GEB4WUEHQMSFCJLGK","download_json":"https://pith.science/pith/L6XYRLU57GEB4WUEHQMSFCJLGK.json","view_paper":"https://pith.science/paper/L6XYRLU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.16504&json=true","fetch_graph":"https://pith.science/api/pith-number/L6XYRLU57GEB4WUEHQMSFCJLGK/graph.json","fetch_events":"https://pith.science/api/pith-number/L6XYRLU57GEB4WUEHQMSFCJLGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6XYRLU57GEB4WUEHQMSFCJLGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6XYRLU57GEB4WUEHQMSFCJLGK/action/storage_attestation","attest_author":"https://pith.science/pith/L6XYRLU57GEB4WUEHQMSFCJLGK/action/author_attestation","sign_citation":"https://pith.science/pith/L6XYRLU57GEB4WUEHQMSFCJLGK/action/citation_signature","submit_replication":"https://pith.science/pith/L6XYRLU57GEB4WUEHQMSFCJLGK/action/replication_record"}},"created_at":"2026-07-05T07:52:10.643617+00:00","updated_at":"2026-07-05T07:52:10.643617+00:00"}