{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MIK3OBMCP6PMWQR5VERNVTN5OI","short_pith_number":"pith:MIK3OBMC","schema_version":"1.0","canonical_sha256":"6215b705827f9ecb423da922dacdbd723603f4119696a0b562004863940c3f7b","source":{"kind":"arxiv","id":"1708.06674","version":1},"attestation_state":"computed","paper":{"title":"Locally Differentially Private Heavy Hitter Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ninghui Li, Somesh Jha, Tianhao Wang","submitted_at":"2017-08-22T15:27:58Z","abstract_excerpt":"The notion of Local Differential Privacy (LDP) enables users to answer sensitive questions while preserving their privacy. The basic LDP frequent oracle protocol enables the aggregator to estimate the frequency of any value. But when the domain of input values is large, finding the most frequent values, also known as the heavy hitters, by estimating the frequencies of all possible values, is computationally infeasible. In this paper, we propose an LDP protocol for identifying heavy hitters. In our proposed protocol, which we call Prefix Extending Method (PEM), users are divided into groups, wi"},"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":"1708.06674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-22T15:27:58Z","cross_cats_sorted":[],"title_canon_sha256":"fcbbc44643fd75d0b8babced1a28a963df3d72ae63d4c5430cfdd9ed82cd3fc2","abstract_canon_sha256":"0e549e21436622a9c65fe3d61b3bd8fff4a6e85fdb5cdfd08f9a8f26122e8af7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:32.938756Z","signature_b64":"X13AswqHIEj1vb8isc/Jieziw8yF5kO8dx0OG9qSUYDRbE5nca6KSrnQGMsgtLI0Mzpk2dhi+1S0lYg8M4+2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6215b705827f9ecb423da922dacdbd723603f4119696a0b562004863940c3f7b","last_reissued_at":"2026-05-18T00:37:32.938300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:32.938300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locally Differentially Private Heavy Hitter Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ninghui Li, Somesh Jha, Tianhao Wang","submitted_at":"2017-08-22T15:27:58Z","abstract_excerpt":"The notion of Local Differential Privacy (LDP) enables users to answer sensitive questions while preserving their privacy. The basic LDP frequent oracle protocol enables the aggregator to estimate the frequency of any value. But when the domain of input values is large, finding the most frequent values, also known as the heavy hitters, by estimating the frequencies of all possible values, is computationally infeasible. In this paper, we propose an LDP protocol for identifying heavy hitters. In our proposed protocol, which we call Prefix Extending Method (PEM), users are divided into groups, wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06674","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":""},"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":"1708.06674","created_at":"2026-05-18T00:37:32.938372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06674v1","created_at":"2026-05-18T00:37:32.938372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06674","created_at":"2026-05-18T00:37:32.938372+00:00"},{"alias_kind":"pith_short_12","alias_value":"MIK3OBMCP6PM","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MIK3OBMCP6PMWQR5","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MIK3OBMC","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00782","citing_title":"Collecting and Analyzing Multidimensional Data with Local Differential Privacy","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MIK3OBMCP6PMWQR5VERNVTN5OI","json":"https://pith.science/pith/MIK3OBMCP6PMWQR5VERNVTN5OI.json","graph_json":"https://pith.science/api/pith-number/MIK3OBMCP6PMWQR5VERNVTN5OI/graph.json","events_json":"https://pith.science/api/pith-number/MIK3OBMCP6PMWQR5VERNVTN5OI/events.json","paper":"https://pith.science/paper/MIK3OBMC"},"agent_actions":{"view_html":"https://pith.science/pith/MIK3OBMCP6PMWQR5VERNVTN5OI","download_json":"https://pith.science/pith/MIK3OBMCP6PMWQR5VERNVTN5OI.json","view_paper":"https://pith.science/paper/MIK3OBMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06674&json=true","fetch_graph":"https://pith.science/api/pith-number/MIK3OBMCP6PMWQR5VERNVTN5OI/graph.json","fetch_events":"https://pith.science/api/pith-number/MIK3OBMCP6PMWQR5VERNVTN5OI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MIK3OBMCP6PMWQR5VERNVTN5OI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MIK3OBMCP6PMWQR5VERNVTN5OI/action/storage_attestation","attest_author":"https://pith.science/pith/MIK3OBMCP6PMWQR5VERNVTN5OI/action/author_attestation","sign_citation":"https://pith.science/pith/MIK3OBMCP6PMWQR5VERNVTN5OI/action/citation_signature","submit_replication":"https://pith.science/pith/MIK3OBMCP6PMWQR5VERNVTN5OI/action/replication_record"}},"created_at":"2026-05-18T00:37:32.938372+00:00","updated_at":"2026-05-18T00:37:32.938372+00:00"}