{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3WRQSSJ4NWY6FRLBXJO6IOSVPQ","short_pith_number":"pith:3WRQSSJ4","schema_version":"1.0","canonical_sha256":"dda309493c6db1e2c561ba5de43a557c327cc26c73e778d2585a4b0875058bc7","source":{"kind":"arxiv","id":"2311.16062","version":1},"attestation_state":"computed","paper":{"title":"Local Differentially Private Heavy Hitter Detection in Data Streams with Bounded Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jian Lou, Kui Ren, Lei Zhang, Weiran Liu, Xiaochen LI, Yuan Hong, Zhan Qin","submitted_at":"2023-11-27T18:28:15Z","abstract_excerpt":"Top-$k$ frequent items detection is a fundamental task in data stream mining. Many promising solutions are proposed to improve memory efficiency while still maintaining high accuracy for detecting the Top-$k$ items. Despite the memory efficiency concern, the users could suffer from privacy loss if participating in the task without proper protection, since their contributed local data streams may continually leak sensitive individual information. However, most existing works solely focus on addressing either the memory-efficiency problem or the privacy concerns but seldom jointly, which cannot "},"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":"2311.16062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2023-11-27T18:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"452744b61e68c50646fa8907996ec30b60e57daeef34e7a6f22a25a32977a942","abstract_canon_sha256":"f37a8f3b9fd7cf226233ebcaddde38f4387c4a76a2a8196149277c7bf9100787"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:17:19.579907Z","signature_b64":"vQVTCugR5Hh0+nJUr1WtIa9g/G0Y9cqR1lvbv+8q36UAve4OJiqZoMvjMo/AqkItL2a4CJcg5/hDB7bib5IhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dda309493c6db1e2c561ba5de43a557c327cc26c73e778d2585a4b0875058bc7","last_reissued_at":"2026-07-05T07:17:19.579515Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:17:19.579515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Differentially Private Heavy Hitter Detection in Data Streams with Bounded Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jian Lou, Kui Ren, Lei Zhang, Weiran Liu, Xiaochen LI, Yuan Hong, Zhan Qin","submitted_at":"2023-11-27T18:28:15Z","abstract_excerpt":"Top-$k$ frequent items detection is a fundamental task in data stream mining. Many promising solutions are proposed to improve memory efficiency while still maintaining high accuracy for detecting the Top-$k$ items. Despite the memory efficiency concern, the users could suffer from privacy loss if participating in the task without proper protection, since their contributed local data streams may continually leak sensitive individual information. However, most existing works solely focus on addressing either the memory-efficiency problem or the privacy concerns but seldom jointly, which cannot "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.16062","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/2311.16062/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":"2311.16062","created_at":"2026-07-05T07:17:19.579567+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.16062v1","created_at":"2026-07-05T07:17:19.579567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.16062","created_at":"2026-07-05T07:17:19.579567+00:00"},{"alias_kind":"pith_short_12","alias_value":"3WRQSSJ4NWY6","created_at":"2026-07-05T07:17:19.579567+00:00"},{"alias_kind":"pith_short_16","alias_value":"3WRQSSJ4NWY6FRLB","created_at":"2026-07-05T07:17:19.579567+00:00"},{"alias_kind":"pith_short_8","alias_value":"3WRQSSJ4","created_at":"2026-07-05T07:17:19.579567+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19837","citing_title":"Data Poisoning Attacks to Local Differential Privacy Protocols for Graphs","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3WRQSSJ4NWY6FRLBXJO6IOSVPQ","json":"https://pith.science/pith/3WRQSSJ4NWY6FRLBXJO6IOSVPQ.json","graph_json":"https://pith.science/api/pith-number/3WRQSSJ4NWY6FRLBXJO6IOSVPQ/graph.json","events_json":"https://pith.science/api/pith-number/3WRQSSJ4NWY6FRLBXJO6IOSVPQ/events.json","paper":"https://pith.science/paper/3WRQSSJ4"},"agent_actions":{"view_html":"https://pith.science/pith/3WRQSSJ4NWY6FRLBXJO6IOSVPQ","download_json":"https://pith.science/pith/3WRQSSJ4NWY6FRLBXJO6IOSVPQ.json","view_paper":"https://pith.science/paper/3WRQSSJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.16062&json=true","fetch_graph":"https://pith.science/api/pith-number/3WRQSSJ4NWY6FRLBXJO6IOSVPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/3WRQSSJ4NWY6FRLBXJO6IOSVPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3WRQSSJ4NWY6FRLBXJO6IOSVPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3WRQSSJ4NWY6FRLBXJO6IOSVPQ/action/storage_attestation","attest_author":"https://pith.science/pith/3WRQSSJ4NWY6FRLBXJO6IOSVPQ/action/author_attestation","sign_citation":"https://pith.science/pith/3WRQSSJ4NWY6FRLBXJO6IOSVPQ/action/citation_signature","submit_replication":"https://pith.science/pith/3WRQSSJ4NWY6FRLBXJO6IOSVPQ/action/replication_record"}},"created_at":"2026-07-05T07:17:19.579567+00:00","updated_at":"2026-07-05T07:17:19.579567+00:00"}