{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RLNUOC63JXQHIX2YK2FZTYUHFV","short_pith_number":"pith:RLNUOC63","schema_version":"1.0","canonical_sha256":"8adb470bdb4de0745f58568b99e2872d62544112cd35465d1b55fa14fa6b31da","source":{"kind":"arxiv","id":"2203.03761","version":1},"attestation_state":"computed","paper":{"title":"The Fundamental Price of Secure Aggregation in Differentially Private Federated Learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ananda Theertha Suresh, Christopher A. Choquette-Choo, Peter Kairouz, Wei-Ning Chen","submitted_at":"2022-03-07T22:56:09Z","abstract_excerpt":"We consider the problem of training a $d$ dimensional model with distributed differential privacy (DP) where secure aggregation (SecAgg) is used to ensure that the server only sees the noisy sum of $n$ model updates in every training round. Taking into account the constraints imposed by SecAgg, we characterize the fundamental communication cost required to obtain the best accuracy achievable under $\\varepsilon$ central DP (i.e. under a fully trusted server and no communication constraints). Our results show that $\\tilde{O}\\left( \\min(n^2\\varepsilon^2, d) \\right)$ bits per client are both suffi"},"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":"2203.03761","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-07T22:56:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4edf34f8a466beb03d55f813252220b774161b5a20e46dc6a33c8315153caf86","abstract_canon_sha256":"0a341dab584483b03a6126c3fd02a29baa64174367907c52124ae170257fc1b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:02:43.272926Z","signature_b64":"E/zpQydTx8af+jMyqVj/rkmpyQNqn0wfTja8EoS7aPuPG70FznWEAe8bUix/shHlOiJCA2cFdSsc1Ln8KqN5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8adb470bdb4de0745f58568b99e2872d62544112cd35465d1b55fa14fa6b31da","last_reissued_at":"2026-07-05T04:02:43.272431Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:02:43.272431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Fundamental Price of Secure Aggregation in Differentially Private Federated Learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ananda Theertha Suresh, Christopher A. Choquette-Choo, Peter Kairouz, Wei-Ning Chen","submitted_at":"2022-03-07T22:56:09Z","abstract_excerpt":"We consider the problem of training a $d$ dimensional model with distributed differential privacy (DP) where secure aggregation (SecAgg) is used to ensure that the server only sees the noisy sum of $n$ model updates in every training round. Taking into account the constraints imposed by SecAgg, we characterize the fundamental communication cost required to obtain the best accuracy achievable under $\\varepsilon$ central DP (i.e. under a fully trusted server and no communication constraints). Our results show that $\\tilde{O}\\left( \\min(n^2\\varepsilon^2, d) \\right)$ bits per client are both suffi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.03761","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.03761/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":"2203.03761","created_at":"2026-07-05T04:02:43.272503+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.03761v1","created_at":"2026-07-05T04:02:43.272503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.03761","created_at":"2026-07-05T04:02:43.272503+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLNUOC63JXQH","created_at":"2026-07-05T04:02:43.272503+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLNUOC63JXQHIX2Y","created_at":"2026-07-05T04:02:43.272503+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLNUOC63","created_at":"2026-07-05T04:02:43.272503+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/RLNUOC63JXQHIX2YK2FZTYUHFV","json":"https://pith.science/pith/RLNUOC63JXQHIX2YK2FZTYUHFV.json","graph_json":"https://pith.science/api/pith-number/RLNUOC63JXQHIX2YK2FZTYUHFV/graph.json","events_json":"https://pith.science/api/pith-number/RLNUOC63JXQHIX2YK2FZTYUHFV/events.json","paper":"https://pith.science/paper/RLNUOC63"},"agent_actions":{"view_html":"https://pith.science/pith/RLNUOC63JXQHIX2YK2FZTYUHFV","download_json":"https://pith.science/pith/RLNUOC63JXQHIX2YK2FZTYUHFV.json","view_paper":"https://pith.science/paper/RLNUOC63","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.03761&json=true","fetch_graph":"https://pith.science/api/pith-number/RLNUOC63JXQHIX2YK2FZTYUHFV/graph.json","fetch_events":"https://pith.science/api/pith-number/RLNUOC63JXQHIX2YK2FZTYUHFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLNUOC63JXQHIX2YK2FZTYUHFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLNUOC63JXQHIX2YK2FZTYUHFV/action/storage_attestation","attest_author":"https://pith.science/pith/RLNUOC63JXQHIX2YK2FZTYUHFV/action/author_attestation","sign_citation":"https://pith.science/pith/RLNUOC63JXQHIX2YK2FZTYUHFV/action/citation_signature","submit_replication":"https://pith.science/pith/RLNUOC63JXQHIX2YK2FZTYUHFV/action/replication_record"}},"created_at":"2026-07-05T04:02:43.272503+00:00","updated_at":"2026-07-05T04:02:43.272503+00:00"}