{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XJTT3MU33CQ5U7SDOMTHTZSIC3","short_pith_number":"pith:XJTT3MU3","schema_version":"1.0","canonical_sha256":"ba673db29bd8a1da7e43732679e64816ecf5c72a522fa83eafac7aaa26ed6c3d","source":{"kind":"arxiv","id":"1903.02891","version":1},"attestation_state":"computed","paper":{"title":"Robust and Communication-Efficient Federated Learning from Non-IID Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Felix Sattler, Klaus-Robert M\\\"uller, Simon Wiedemann, Wojciech Samek","submitted_at":"2019-03-07T13:10:30Z","abstract_excerpt":"Federated Learning allows multiple parties to jointly train a deep learning model on their combined data, without any of the participants having to reveal their local data to a centralized server. This form of privacy-preserving collaborative learning however comes at the cost of a significant communication overhead during training. To address this problem, several compression methods have been proposed in the distributed training literature that can reduce the amount of required communication by up to three orders of magnitude. These existing methods however are only of limited utility in the"},"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":"1903.02891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-07T13:10:30Z","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"title_canon_sha256":"1ebe74bf73169df48d3e7fa4aed74099f2eaa58bc17689f4142fe2d553f6aa8f","abstract_canon_sha256":"3db4067cdaa79793accadcb48cd0f44f5c4f1b2e786fe8a16ee93452d84e6ee8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:50.847528Z","signature_b64":"SNSr5sSpXlrHILWXu6WS5MD+pCu9YKwddv2Qjh6nqArs/ur7sKOY5dfKYKELTIPOhUF+1WbAllq9BQQJDv3yAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba673db29bd8a1da7e43732679e64816ecf5c72a522fa83eafac7aaa26ed6c3d","last_reissued_at":"2026-05-17T23:51:50.846941Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:50.846941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and Communication-Efficient Federated Learning from Non-IID Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Felix Sattler, Klaus-Robert M\\\"uller, Simon Wiedemann, Wojciech Samek","submitted_at":"2019-03-07T13:10:30Z","abstract_excerpt":"Federated Learning allows multiple parties to jointly train a deep learning model on their combined data, without any of the participants having to reveal their local data to a centralized server. This form of privacy-preserving collaborative learning however comes at the cost of a significant communication overhead during training. To address this problem, several compression methods have been proposed in the distributed training literature that can reduce the amount of required communication by up to three orders of magnitude. These existing methods however are only of limited utility in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02891","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":""},"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":"1903.02891","created_at":"2026-05-17T23:51:50.847010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02891v1","created_at":"2026-05-17T23:51:50.847010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02891","created_at":"2026-05-17T23:51:50.847010+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJTT3MU33CQ5","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJTT3MU33CQ5U7SD","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJTT3MU3","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1909.06335","citing_title":"Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classification","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13434","citing_title":"Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity","ref_index":69,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3","json":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3.json","graph_json":"https://pith.science/api/pith-number/XJTT3MU33CQ5U7SDOMTHTZSIC3/graph.json","events_json":"https://pith.science/api/pith-number/XJTT3MU33CQ5U7SDOMTHTZSIC3/events.json","paper":"https://pith.science/paper/XJTT3MU3"},"agent_actions":{"view_html":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3","download_json":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3.json","view_paper":"https://pith.science/paper/XJTT3MU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02891&json=true","fetch_graph":"https://pith.science/api/pith-number/XJTT3MU33CQ5U7SDOMTHTZSIC3/graph.json","fetch_events":"https://pith.science/api/pith-number/XJTT3MU33CQ5U7SDOMTHTZSIC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3/action/storage_attestation","attest_author":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3/action/author_attestation","sign_citation":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3/action/citation_signature","submit_replication":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3/action/replication_record"}},"created_at":"2026-05-17T23:51:50.847010+00:00","updated_at":"2026-05-17T23:51:50.847010+00:00"}