{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LDQQ4753UAR4CONPPP3NSJVIDP","short_pith_number":"pith:LDQQ4753","schema_version":"1.0","canonical_sha256":"58e10e7fbba023c139af7bf6d926a81be4e576b084563e7c34a798ab7fbd7d31","source":{"kind":"arxiv","id":"2007.14861","version":3},"attestation_state":"computed","paper":{"title":"Efficient Sparse Secure Aggregation for Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Constance Beguier, Eric W. Tramel, Mathieu Andreux","submitted_at":"2020-07-29T14:28:30Z","abstract_excerpt":"Federated Learning enables one to jointly train a machine learning model across distributed clients holding sensitive datasets. In real-world settings, this approach is hindered by expensive communication and privacy concerns. Both of these challenges have already been addressed individually, resulting in competing optimisations. In this article, we tackle them simultaneously for one of the first times. More precisely, we adapt compression-based federated techniques to additive secret sharing, leading to an efficient secure aggregation protocol, with an adaptable security level. We prove its p"},"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":"2007.14861","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-07-29T14:28:30Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"74164bb2571bb571d133dd18b84fe5d9d2f0e0cd41f73808b66d7f2b74b0ee83","abstract_canon_sha256":"07c5a77e96b99615d8cf56c69d88f86a2df8d514a6353bdd3017f91a981830b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:05.084204Z","signature_b64":"D8qsNk5QUvwtiRDNe3I5mcWmKh3dJKucZZS0OpcwN7Bnrly2HfTxRwVA9XG50cuxgsdGwYDooGPf4TKDS4YkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58e10e7fbba023c139af7bf6d926a81be4e576b084563e7c34a798ab7fbd7d31","last_reissued_at":"2026-07-05T03:23:05.083767Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:05.083767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Sparse Secure Aggregation for Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Constance Beguier, Eric W. Tramel, Mathieu Andreux","submitted_at":"2020-07-29T14:28:30Z","abstract_excerpt":"Federated Learning enables one to jointly train a machine learning model across distributed clients holding sensitive datasets. In real-world settings, this approach is hindered by expensive communication and privacy concerns. Both of these challenges have already been addressed individually, resulting in competing optimisations. In this article, we tackle them simultaneously for one of the first times. More precisely, we adapt compression-based federated techniques to additive secret sharing, leading to an efficient secure aggregation protocol, with an adaptable security level. We prove its p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.14861","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/2007.14861/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":"2007.14861","created_at":"2026-07-05T03:23:05.083830+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.14861v3","created_at":"2026-07-05T03:23:05.083830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.14861","created_at":"2026-07-05T03:23:05.083830+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDQQ4753UAR4","created_at":"2026-07-05T03:23:05.083830+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDQQ4753UAR4CONP","created_at":"2026-07-05T03:23:05.083830+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDQQ4753","created_at":"2026-07-05T03:23:05.083830+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/LDQQ4753UAR4CONPPP3NSJVIDP","json":"https://pith.science/pith/LDQQ4753UAR4CONPPP3NSJVIDP.json","graph_json":"https://pith.science/api/pith-number/LDQQ4753UAR4CONPPP3NSJVIDP/graph.json","events_json":"https://pith.science/api/pith-number/LDQQ4753UAR4CONPPP3NSJVIDP/events.json","paper":"https://pith.science/paper/LDQQ4753"},"agent_actions":{"view_html":"https://pith.science/pith/LDQQ4753UAR4CONPPP3NSJVIDP","download_json":"https://pith.science/pith/LDQQ4753UAR4CONPPP3NSJVIDP.json","view_paper":"https://pith.science/paper/LDQQ4753","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.14861&json=true","fetch_graph":"https://pith.science/api/pith-number/LDQQ4753UAR4CONPPP3NSJVIDP/graph.json","fetch_events":"https://pith.science/api/pith-number/LDQQ4753UAR4CONPPP3NSJVIDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDQQ4753UAR4CONPPP3NSJVIDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDQQ4753UAR4CONPPP3NSJVIDP/action/storage_attestation","attest_author":"https://pith.science/pith/LDQQ4753UAR4CONPPP3NSJVIDP/action/author_attestation","sign_citation":"https://pith.science/pith/LDQQ4753UAR4CONPPP3NSJVIDP/action/citation_signature","submit_replication":"https://pith.science/pith/LDQQ4753UAR4CONPPP3NSJVIDP/action/replication_record"}},"created_at":"2026-07-05T03:23:05.083830+00:00","updated_at":"2026-07-05T03:23:05.083830+00:00"}