{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QRXJWB7FXTQXAOYDOJ34RQGLI3","short_pith_number":"pith:QRXJWB7F","schema_version":"1.0","canonical_sha256":"846e9b07e5bce1703b037277c8c0cb46c1a9b5d873244e1e879be58c57bfbe99","source":{"kind":"arxiv","id":"2211.10041","version":1},"attestation_state":"computed","paper":{"title":"The communication cost of security and privacy in federated frequency estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Akash Bharadwaj, Ayfer \\\"Ozg\\\"ur, Graham Cormode, Wei-Ning Chen","submitted_at":"2022-11-18T05:40:28Z","abstract_excerpt":"We consider the federated frequency estimation problem, where each user holds a private item $X_i$ from a size-$d$ domain and a server aims to estimate the empirical frequency (i.e., histogram) of $n$ items with $n \\ll d$. Without any security and privacy considerations, each user can communicate its item to the server by using $\\log d$ bits. A naive application of secure aggregation protocols would, however, require $d\\log n$ bits per user. Can we reduce the communication needed for secure aggregation, and does security come with a fundamental cost in communication?\n  In this paper, we develo"},"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":"2211.10041","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-11-18T05:40:28Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"a9f84279b1d12e2b56a54f3858acc40c98ec6d3d78497cad665271d85a85400b","abstract_canon_sha256":"f4283e8aefddd00b790dca038c9134eb8aa5010bcd1d96c2c6d0340dfc1de9aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:17.624525Z","signature_b64":"LAEfRPNYWYrKB9dXPtH6m6p7AJ0BrTcO9ExVhZo9iyCyB5/1wPS0hWBWhbrMesG8J3MY65SFo9jGjPGkxNs6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"846e9b07e5bce1703b037277c8c0cb46c1a9b5d873244e1e879be58c57bfbe99","last_reissued_at":"2026-07-05T05:17:17.624138Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:17.624138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The communication cost of security and privacy in federated frequency estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Akash Bharadwaj, Ayfer \\\"Ozg\\\"ur, Graham Cormode, Wei-Ning Chen","submitted_at":"2022-11-18T05:40:28Z","abstract_excerpt":"We consider the federated frequency estimation problem, where each user holds a private item $X_i$ from a size-$d$ domain and a server aims to estimate the empirical frequency (i.e., histogram) of $n$ items with $n \\ll d$. Without any security and privacy considerations, each user can communicate its item to the server by using $\\log d$ bits. A naive application of secure aggregation protocols would, however, require $d\\log n$ bits per user. Can we reduce the communication needed for secure aggregation, and does security come with a fundamental cost in communication?\n  In this paper, we develo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10041","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/2211.10041/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":"2211.10041","created_at":"2026-07-05T05:17:17.624193+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.10041v1","created_at":"2026-07-05T05:17:17.624193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10041","created_at":"2026-07-05T05:17:17.624193+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRXJWB7FXTQX","created_at":"2026-07-05T05:17:17.624193+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRXJWB7FXTQXAOYD","created_at":"2026-07-05T05:17:17.624193+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRXJWB7F","created_at":"2026-07-05T05:17:17.624193+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/QRXJWB7FXTQXAOYDOJ34RQGLI3","json":"https://pith.science/pith/QRXJWB7FXTQXAOYDOJ34RQGLI3.json","graph_json":"https://pith.science/api/pith-number/QRXJWB7FXTQXAOYDOJ34RQGLI3/graph.json","events_json":"https://pith.science/api/pith-number/QRXJWB7FXTQXAOYDOJ34RQGLI3/events.json","paper":"https://pith.science/paper/QRXJWB7F"},"agent_actions":{"view_html":"https://pith.science/pith/QRXJWB7FXTQXAOYDOJ34RQGLI3","download_json":"https://pith.science/pith/QRXJWB7FXTQXAOYDOJ34RQGLI3.json","view_paper":"https://pith.science/paper/QRXJWB7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.10041&json=true","fetch_graph":"https://pith.science/api/pith-number/QRXJWB7FXTQXAOYDOJ34RQGLI3/graph.json","fetch_events":"https://pith.science/api/pith-number/QRXJWB7FXTQXAOYDOJ34RQGLI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRXJWB7FXTQXAOYDOJ34RQGLI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRXJWB7FXTQXAOYDOJ34RQGLI3/action/storage_attestation","attest_author":"https://pith.science/pith/QRXJWB7FXTQXAOYDOJ34RQGLI3/action/author_attestation","sign_citation":"https://pith.science/pith/QRXJWB7FXTQXAOYDOJ34RQGLI3/action/citation_signature","submit_replication":"https://pith.science/pith/QRXJWB7FXTQXAOYDOJ34RQGLI3/action/replication_record"}},"created_at":"2026-07-05T05:17:17.624193+00:00","updated_at":"2026-07-05T05:17:17.624193+00:00"}