{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NNCE2I6Z74DNDA7XECYB5QV2IO","short_pith_number":"pith:NNCE2I6Z","schema_version":"1.0","canonical_sha256":"6b444d23d9ff06d183f720b01ec2ba43a9605d3d827768a3959f0bf0fe840829","source":{"kind":"arxiv","id":"2102.07053","version":2},"attestation_state":"computed","paper":{"title":"Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse Gradients","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.SY","eess.SY","math.OC"],"primary_cat":"cs.LG","authors_text":"Aritra Mitra, George J. Pappas, Hamed Hassani, Rayana Jaafar","submitted_at":"2021-02-14T02:47:35Z","abstract_excerpt":"We consider a standard federated learning (FL) architecture where a group of clients periodically coordinate with a central server to train a statistical model. We develop a general algorithmic framework called FedLin to tackle some of the key challenges intrinsic to FL, namely objective heterogeneity, systems heterogeneity, and infrequent and imprecise communication. Our framework is motivated by the observation that under these challenges, various existing FL algorithms suffer from a fundamental speed-accuracy conflict: they either guarantee linear convergence but to an incorrect point, or c"},"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":"2102.07053","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-14T02:47:35Z","cross_cats_sorted":["cs.DC","cs.SY","eess.SY","math.OC"],"title_canon_sha256":"12c2b0183de54fa474edd2f08d4623a8ea224bd031bf9628bd67d5e2c2830c06","abstract_canon_sha256":"1cab95ccc9213162a56fa43fd2c3d80a4eb59255eecef1927a25928b0dd16abc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:10:02.446629Z","signature_b64":"gpBSGuxg3M/42V5Hwp1p+v92zO+Er4MdJmuLgjSZmy2sWqjFwAVE6dAoMUT/Jr8Up0h9ffHjuF0rV58C/e7GBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b444d23d9ff06d183f720b01ec2ba43a9605d3d827768a3959f0bf0fe840829","last_reissued_at":"2026-07-05T03:10:02.446096Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:10:02.446096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse Gradients","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.SY","eess.SY","math.OC"],"primary_cat":"cs.LG","authors_text":"Aritra Mitra, George J. Pappas, Hamed Hassani, Rayana Jaafar","submitted_at":"2021-02-14T02:47:35Z","abstract_excerpt":"We consider a standard federated learning (FL) architecture where a group of clients periodically coordinate with a central server to train a statistical model. We develop a general algorithmic framework called FedLin to tackle some of the key challenges intrinsic to FL, namely objective heterogeneity, systems heterogeneity, and infrequent and imprecise communication. Our framework is motivated by the observation that under these challenges, various existing FL algorithms suffer from a fundamental speed-accuracy conflict: they either guarantee linear convergence but to an incorrect point, or c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07053","kind":"arxiv","version":2},"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/2102.07053/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":"2102.07053","created_at":"2026-07-05T03:10:02.446165+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.07053v2","created_at":"2026-07-05T03:10:02.446165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07053","created_at":"2026-07-05T03:10:02.446165+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNCE2I6Z74DN","created_at":"2026-07-05T03:10:02.446165+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNCE2I6Z74DNDA7X","created_at":"2026-07-05T03:10:02.446165+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNCE2I6Z","created_at":"2026-07-05T03:10:02.446165+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13434","citing_title":"Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NNCE2I6Z74DNDA7XECYB5QV2IO","json":"https://pith.science/pith/NNCE2I6Z74DNDA7XECYB5QV2IO.json","graph_json":"https://pith.science/api/pith-number/NNCE2I6Z74DNDA7XECYB5QV2IO/graph.json","events_json":"https://pith.science/api/pith-number/NNCE2I6Z74DNDA7XECYB5QV2IO/events.json","paper":"https://pith.science/paper/NNCE2I6Z"},"agent_actions":{"view_html":"https://pith.science/pith/NNCE2I6Z74DNDA7XECYB5QV2IO","download_json":"https://pith.science/pith/NNCE2I6Z74DNDA7XECYB5QV2IO.json","view_paper":"https://pith.science/paper/NNCE2I6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.07053&json=true","fetch_graph":"https://pith.science/api/pith-number/NNCE2I6Z74DNDA7XECYB5QV2IO/graph.json","fetch_events":"https://pith.science/api/pith-number/NNCE2I6Z74DNDA7XECYB5QV2IO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNCE2I6Z74DNDA7XECYB5QV2IO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNCE2I6Z74DNDA7XECYB5QV2IO/action/storage_attestation","attest_author":"https://pith.science/pith/NNCE2I6Z74DNDA7XECYB5QV2IO/action/author_attestation","sign_citation":"https://pith.science/pith/NNCE2I6Z74DNDA7XECYB5QV2IO/action/citation_signature","submit_replication":"https://pith.science/pith/NNCE2I6Z74DNDA7XECYB5QV2IO/action/replication_record"}},"created_at":"2026-07-05T03:10:02.446165+00:00","updated_at":"2026-07-05T03:10:02.446165+00:00"}