{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XJTT3MU33CQ5U7SDOMTHTZSIC3","short_pith_number":"pith:XJTT3MU3","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"},"canonical_sha256":"ba673db29bd8a1da7e43732679e64816ecf5c72a522fa83eafac7aaa26ed6c3d","source":{"kind":"arxiv","id":"1903.02891","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02891","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02891v1","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02891","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"XJTT3MU33CQ5","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XJTT3MU33CQ5U7SD","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XJTT3MU3","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XJTT3MU33CQ5U7SDOMTHTZSIC3","target":"record","payload":{"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"},"canonical_sha256":"ba673db29bd8a1da7e43732679e64816ecf5c72a522fa83eafac7aaa26ed6c3d","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"},"source_kind":"arxiv","source_id":"1903.02891","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-05-17T23:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PX8EBpNGpt6GGDhcg1mv2iFnDFCbDr4bis+Qp8g5jRcpDmAxtDw24RJ4PDv6Qk8QClMBsT+m6yBmIV4m0w50Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:55:41.269515Z"},"content_sha256":"42fac483130ab336e9a22108a2db9cdc225c3f8ab792a154584ce854a1e177cc","schema_version":"1.0","event_id":"sha256:42fac483130ab336e9a22108a2db9cdc225c3f8ab792a154584ce854a1e177cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XJTT3MU33CQ5U7SDOMTHTZSIC3","target":"graph","payload":{"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"},"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-05-17T23:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zOmeedYW+9z8z5jDe0XCnNCES7inn0HUHTQI5UYU36bx7sD1/TNtvYfPY5UxloOcZymNvQdIHqeCfxLJpFoYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:55:41.269863Z"},"content_sha256":"c226eb4008d31a9b6dfa2f9134f6b9e80f6b4aee216b3e5d3910cbabb71c3d05","schema_version":"1.0","event_id":"sha256:c226eb4008d31a9b6dfa2f9134f6b9e80f6b4aee216b3e5d3910cbabb71c3d05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3/bundle.json","state_url":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3/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-05-31T03:55:41Z","links":{"resolver":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3","bundle":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3/bundle.json","state":"https://pith.science/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJTT3MU33CQ5U7SDOMTHTZSIC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XJTT3MU33CQ5U7SDOMTHTZSIC3","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":"3db4067cdaa79793accadcb48cd0f44f5c4f1b2e786fe8a16ee93452d84e6ee8","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-07T13:10:30Z","title_canon_sha256":"1ebe74bf73169df48d3e7fa4aed74099f2eaa58bc17689f4142fe2d553f6aa8f"},"schema_version":"1.0","source":{"id":"1903.02891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02891","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02891v1","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02891","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"XJTT3MU33CQ5","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XJTT3MU33CQ5U7SD","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XJTT3MU3","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:c226eb4008d31a9b6dfa2f9134f6b9e80f6b4aee216b3e5d3910cbabb71c3d05","target":"graph","created_at":"2026-05-17T23:51:50Z","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"},"paper":{"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","authors_text":"Felix Sattler, Klaus-Robert M\\\"uller, Simon Wiedemann, Wojciech Samek","cross_cats":["cs.AI","cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-07T13:10:30Z","title":"Robust and Communication-Efficient Federated Learning from Non-IID Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02891","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:42fac483130ab336e9a22108a2db9cdc225c3f8ab792a154584ce854a1e177cc","target":"record","created_at":"2026-05-17T23:51:50Z","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":"3db4067cdaa79793accadcb48cd0f44f5c4f1b2e786fe8a16ee93452d84e6ee8","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-07T13:10:30Z","title_canon_sha256":"1ebe74bf73169df48d3e7fa4aed74099f2eaa58bc17689f4142fe2d553f6aa8f"},"schema_version":"1.0","source":{"id":"1903.02891","kind":"arxiv","version":1}},"canonical_sha256":"ba673db29bd8a1da7e43732679e64816ecf5c72a522fa83eafac7aaa26ed6c3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba673db29bd8a1da7e43732679e64816ecf5c72a522fa83eafac7aaa26ed6c3d","first_computed_at":"2026-05-17T23:51:50.846941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:50.846941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SNSr5sSpXlrHILWXu6WS5MD+pCu9YKwddv2Qjh6nqArs/ur7sKOY5dfKYKELTIPOhUF+1WbAllq9BQQJDv3yAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:50.847528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42fac483130ab336e9a22108a2db9cdc225c3f8ab792a154584ce854a1e177cc","sha256:c226eb4008d31a9b6dfa2f9134f6b9e80f6b4aee216b3e5d3910cbabb71c3d05"],"state_sha256":"de9f654827e7c66343b8c0606f7bcbba6ccc6fe21fdfe0835c4ad1d4f116c484"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FzGW7+CfCVXG2GsY/rpnWZ639DqUgCL5pBOCU/K1JFERmIFH4VN74H6KO8ApXAn1gPmx/q7NX3/S/rMffp7LAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:55:41.271878Z","bundle_sha256":"ffc3a6a63130f0b09c8f93afe9409aa131b5d688067eb04da59e41d5dd581c10"}}