{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EDS2TQEUHAFYU4ZVOC4SYWIIP6","short_pith_number":"pith:EDS2TQEU","schema_version":"1.0","canonical_sha256":"20e5a9c094380b8a733570b92c59087fb6b59c35b07d61dc7dd31f5c690423d0","source":{"kind":"arxiv","id":"2111.05454","version":2},"attestation_state":"computed","paper":{"title":"DP-REC: Private & Communication-Efficient Federated Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aleksei Triastcyn, Christos Louizos, Matthias Reisser","submitted_at":"2021-11-09T23:33:11Z","abstract_excerpt":"Privacy and communication efficiency are important challenges in federated training of neural networks, and combining them is still an open problem. In this work, we develop a method that unifies highly compressed communication and differential privacy (DP). We introduce a compression technique based on Relative Entropy Coding (REC) to the federated setting. With a minor modification to REC, we obtain a provably differentially private learning algorithm, DP-REC, and show how to compute its privacy guarantees. Our experiments demonstrate that DP-REC drastically reduces communication costs while"},"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":"2111.05454","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-09T23:33:11Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"2d6486cd121869ee6ae6cd5b42d814e1653a67e28134be2e0262e9ccda69ea67","abstract_canon_sha256":"2d6ccd6cab2f23281f7f76ba58fc94aa29f3a2becb92f9260ba49f7435de5792"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:38:51.871312Z","signature_b64":"VFlX8RuY1Rlytk+u5kzVmGhcQOi9mHyMtb8xnSFeHOQcM1dc8VWyew7+thypXNJlnXS041PeDIbYw17/qhJaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20e5a9c094380b8a733570b92c59087fb6b59c35b07d61dc7dd31f5c690423d0","last_reissued_at":"2026-07-05T03:38:51.870892Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:38:51.870892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DP-REC: Private & Communication-Efficient Federated Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aleksei Triastcyn, Christos Louizos, Matthias Reisser","submitted_at":"2021-11-09T23:33:11Z","abstract_excerpt":"Privacy and communication efficiency are important challenges in federated training of neural networks, and combining them is still an open problem. In this work, we develop a method that unifies highly compressed communication and differential privacy (DP). We introduce a compression technique based on Relative Entropy Coding (REC) to the federated setting. With a minor modification to REC, we obtain a provably differentially private learning algorithm, DP-REC, and show how to compute its privacy guarantees. Our experiments demonstrate that DP-REC drastically reduces communication costs while"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.05454","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/2111.05454/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":"2111.05454","created_at":"2026-07-05T03:38:51.870943+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.05454v2","created_at":"2026-07-05T03:38:51.870943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.05454","created_at":"2026-07-05T03:38:51.870943+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDS2TQEUHAFY","created_at":"2026-07-05T03:38:51.870943+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDS2TQEUHAFYU4ZV","created_at":"2026-07-05T03:38:51.870943+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDS2TQEU","created_at":"2026-07-05T03:38:51.870943+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/EDS2TQEUHAFYU4ZVOC4SYWIIP6","json":"https://pith.science/pith/EDS2TQEUHAFYU4ZVOC4SYWIIP6.json","graph_json":"https://pith.science/api/pith-number/EDS2TQEUHAFYU4ZVOC4SYWIIP6/graph.json","events_json":"https://pith.science/api/pith-number/EDS2TQEUHAFYU4ZVOC4SYWIIP6/events.json","paper":"https://pith.science/paper/EDS2TQEU"},"agent_actions":{"view_html":"https://pith.science/pith/EDS2TQEUHAFYU4ZVOC4SYWIIP6","download_json":"https://pith.science/pith/EDS2TQEUHAFYU4ZVOC4SYWIIP6.json","view_paper":"https://pith.science/paper/EDS2TQEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.05454&json=true","fetch_graph":"https://pith.science/api/pith-number/EDS2TQEUHAFYU4ZVOC4SYWIIP6/graph.json","fetch_events":"https://pith.science/api/pith-number/EDS2TQEUHAFYU4ZVOC4SYWIIP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDS2TQEUHAFYU4ZVOC4SYWIIP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDS2TQEUHAFYU4ZVOC4SYWIIP6/action/storage_attestation","attest_author":"https://pith.science/pith/EDS2TQEUHAFYU4ZVOC4SYWIIP6/action/author_attestation","sign_citation":"https://pith.science/pith/EDS2TQEUHAFYU4ZVOC4SYWIIP6/action/citation_signature","submit_replication":"https://pith.science/pith/EDS2TQEUHAFYU4ZVOC4SYWIIP6/action/replication_record"}},"created_at":"2026-07-05T03:38:51.870943+00:00","updated_at":"2026-07-05T03:38:51.870943+00:00"}