{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MLFYXBF3DCKEFOPUQRKZ4UTRSH","short_pith_number":"pith:MLFYXBF3","schema_version":"1.0","canonical_sha256":"62cb8b84bb189442b9f484559e527191e94004ed0c6a3907167bdc14e6a03bae","source":{"kind":"arxiv","id":"1202.4910","version":3},"attestation_state":"computed","paper":{"title":"Distributed Private Heavy Hitters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DB"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Justin Hsu, Sanjeev Khanna","submitted_at":"2012-02-22T14:01:57Z","abstract_excerpt":"In this paper, we give efficient algorithms and lower bounds for solving the heavy hitters problem while preserving differential privacy in the fully distributed local model. In this model, there are n parties, each of which possesses a single element from a universe of size N. The heavy hitters problem is to find the identity of the most common element shared amongst the n parties. In the local model, there is no trusted database administrator, and so the algorithm must interact with each of the $n$ parties separately, using a differentially private protocol. We give tight information-theoret"},"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":"1202.4910","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-22T14:01:57Z","cross_cats_sorted":["cs.CR","cs.DB"],"title_canon_sha256":"f0f7b5e8d2f540662187058ebb1e0fa0f81cb4ec7b44cb0d137455fec9f42b30","abstract_canon_sha256":"2fe2260cf38595c76a9096479006e657965f986bfeb6a104d046606e64b54c6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:01.137832Z","signature_b64":"72FwfWXTx4T94HPJQBmMRQCcVFarhgovTkmowtFmd+0oQr3q47okUPLdslrqPYS3VxJbYNYoBQu3/zP9OAoKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62cb8b84bb189442b9f484559e527191e94004ed0c6a3907167bdc14e6a03bae","last_reissued_at":"2026-05-18T00:21:01.137256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:01.137256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Private Heavy Hitters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DB"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Justin Hsu, Sanjeev Khanna","submitted_at":"2012-02-22T14:01:57Z","abstract_excerpt":"In this paper, we give efficient algorithms and lower bounds for solving the heavy hitters problem while preserving differential privacy in the fully distributed local model. In this model, there are n parties, each of which possesses a single element from a universe of size N. The heavy hitters problem is to find the identity of the most common element shared amongst the n parties. In the local model, there is no trusted database administrator, and so the algorithm must interact with each of the $n$ parties separately, using a differentially private protocol. We give tight information-theoret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4910","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":""},"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":"1202.4910","created_at":"2026-05-18T00:21:01.137370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4910v3","created_at":"2026-05-18T00:21:01.137370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4910","created_at":"2026-05-18T00:21:01.137370+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLFYXBF3DCKE","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLFYXBF3DCKEFOPU","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLFYXBF3","created_at":"2026-05-18T12:27:14.488303+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/MLFYXBF3DCKEFOPUQRKZ4UTRSH","json":"https://pith.science/pith/MLFYXBF3DCKEFOPUQRKZ4UTRSH.json","graph_json":"https://pith.science/api/pith-number/MLFYXBF3DCKEFOPUQRKZ4UTRSH/graph.json","events_json":"https://pith.science/api/pith-number/MLFYXBF3DCKEFOPUQRKZ4UTRSH/events.json","paper":"https://pith.science/paper/MLFYXBF3"},"agent_actions":{"view_html":"https://pith.science/pith/MLFYXBF3DCKEFOPUQRKZ4UTRSH","download_json":"https://pith.science/pith/MLFYXBF3DCKEFOPUQRKZ4UTRSH.json","view_paper":"https://pith.science/paper/MLFYXBF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4910&json=true","fetch_graph":"https://pith.science/api/pith-number/MLFYXBF3DCKEFOPUQRKZ4UTRSH/graph.json","fetch_events":"https://pith.science/api/pith-number/MLFYXBF3DCKEFOPUQRKZ4UTRSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLFYXBF3DCKEFOPUQRKZ4UTRSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLFYXBF3DCKEFOPUQRKZ4UTRSH/action/storage_attestation","attest_author":"https://pith.science/pith/MLFYXBF3DCKEFOPUQRKZ4UTRSH/action/author_attestation","sign_citation":"https://pith.science/pith/MLFYXBF3DCKEFOPUQRKZ4UTRSH/action/citation_signature","submit_replication":"https://pith.science/pith/MLFYXBF3DCKEFOPUQRKZ4UTRSH/action/replication_record"}},"created_at":"2026-05-18T00:21:01.137370+00:00","updated_at":"2026-05-18T00:21:01.137370+00:00"}