{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EYDO7AKYSKAIIBSJ6APWMBXLLA","short_pith_number":"pith:EYDO7AKY","canonical_record":{"source":{"id":"1707.04982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T02:34:55Z","cross_cats_sorted":[],"title_canon_sha256":"4f379b0470d3d8dbf902651cc82166290df9bb5aa65b14b0c2c16b7723c02f46","abstract_canon_sha256":"151eada1dea96689769713ac2d2b4fea35024fb8f8e7ec9d16c085dd33c9f6c3"},"schema_version":"1.0"},"canonical_sha256":"2606ef81589280840649f01f6606eb5830259bc701f694467847f5a960df96b0","source":{"kind":"arxiv","id":"1707.04982","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04982","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04982v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04982","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"EYDO7AKYSKAI","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EYDO7AKYSKAIIBSJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EYDO7AKY","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EYDO7AKYSKAIIBSJ6APWMBXLLA","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T02:34:55Z","cross_cats_sorted":[],"title_canon_sha256":"4f379b0470d3d8dbf902651cc82166290df9bb5aa65b14b0c2c16b7723c02f46","abstract_canon_sha256":"151eada1dea96689769713ac2d2b4fea35024fb8f8e7ec9d16c085dd33c9f6c3"},"schema_version":"1.0"},"canonical_sha256":"2606ef81589280840649f01f6606eb5830259bc701f694467847f5a960df96b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:11.683703Z","signature_b64":"dBEkYQ6QjMswRB+owFqTepvuwES1mF4OVHDwlXrrUfgMsGRF+fp4xX8eIAGFc48RjZkn3SGjhTvyEo9eQtNgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2606ef81589280840649f01f6606eb5830259bc701f694467847f5a960df96b0","last_reissued_at":"2026-05-18T00:40:11.683058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:11.683058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04982","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xDiOwuT6Yzli8q12osdIFmvLKJqCPprYYUpufVCxVdjOdUGNhxf7I/UP0cM9i57qaTX5YWHvHAwowQfSN9ThDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:41:54.981332Z"},"content_sha256":"b8352981d3e2a49fec782db4f0bb5564153ed8beea18b1ece213e490cb57a144","schema_version":"1.0","event_id":"sha256:b8352981d3e2a49fec782db4f0bb5564153ed8beea18b1ece213e490cb57a144"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EYDO7AKYSKAIIBSJ6APWMBXLLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Locally Private Heavy Hitters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abhradeep Thakurta, Kobbi Nissim, Raef Bassily, Uri Stemmer","submitted_at":"2017-07-17T02:34:55Z","abstract_excerpt":"We present new practical local differentially private heavy hitters algorithms achieving optimal or near-optimal worst-case error and running time -- TreeHist and Bitstogram. In both algorithms, server running time is $\\tilde O(n)$ and user running time is $\\tilde O(1)$, hence improving on the prior state-of-the-art result of Bassily and Smith [STOC 2015] requiring $O(n^{5/2})$ server time and $O(n^{3/2})$ user time. With a typically large number of participants in local algorithms ($n$ in the millions), this reduction in time complexity, in particular at the user side, is crucial for making l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04982","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VuvMqbwlxWojgYhA2+ZYurW2hdF4y/XVqoUq5qtXhk+YY1XfpWXu4QTYbEuXBC+wBNp7GpmNHlB7zFdtpLOmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:41:54.982012Z"},"content_sha256":"6d417fb228526509a4f7d69537700b693c065d74935e541169be1a26fa3714a3","schema_version":"1.0","event_id":"sha256:6d417fb228526509a4f7d69537700b693c065d74935e541169be1a26fa3714a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EYDO7AKYSKAIIBSJ6APWMBXLLA/bundle.json","state_url":"https://pith.science/pith/EYDO7AKYSKAIIBSJ6APWMBXLLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EYDO7AKYSKAIIBSJ6APWMBXLLA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T18:41:54Z","links":{"resolver":"https://pith.science/pith/EYDO7AKYSKAIIBSJ6APWMBXLLA","bundle":"https://pith.science/pith/EYDO7AKYSKAIIBSJ6APWMBXLLA/bundle.json","state":"https://pith.science/pith/EYDO7AKYSKAIIBSJ6APWMBXLLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EYDO7AKYSKAIIBSJ6APWMBXLLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EYDO7AKYSKAIIBSJ6APWMBXLLA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"151eada1dea96689769713ac2d2b4fea35024fb8f8e7ec9d16c085dd33c9f6c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T02:34:55Z","title_canon_sha256":"4f379b0470d3d8dbf902651cc82166290df9bb5aa65b14b0c2c16b7723c02f46"},"schema_version":"1.0","source":{"id":"1707.04982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04982","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04982v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04982","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"EYDO7AKYSKAI","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EYDO7AKYSKAIIBSJ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EYDO7AKY","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:6d417fb228526509a4f7d69537700b693c065d74935e541169be1a26fa3714a3","target":"graph","created_at":"2026-05-18T00:40:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We present new practical local differentially private heavy hitters algorithms achieving optimal or near-optimal worst-case error and running time -- TreeHist and Bitstogram. In both algorithms, server running time is $\\tilde O(n)$ and user running time is $\\tilde O(1)$, hence improving on the prior state-of-the-art result of Bassily and Smith [STOC 2015] requiring $O(n^{5/2})$ server time and $O(n^{3/2})$ user time. With a typically large number of participants in local algorithms ($n$ in the millions), this reduction in time complexity, in particular at the user side, is crucial for making l","authors_text":"Abhradeep Thakurta, Kobbi Nissim, Raef Bassily, Uri Stemmer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T02:34:55Z","title":"Practical Locally Private Heavy Hitters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04982","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b8352981d3e2a49fec782db4f0bb5564153ed8beea18b1ece213e490cb57a144","target":"record","created_at":"2026-05-18T00:40:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"151eada1dea96689769713ac2d2b4fea35024fb8f8e7ec9d16c085dd33c9f6c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T02:34:55Z","title_canon_sha256":"4f379b0470d3d8dbf902651cc82166290df9bb5aa65b14b0c2c16b7723c02f46"},"schema_version":"1.0","source":{"id":"1707.04982","kind":"arxiv","version":1}},"canonical_sha256":"2606ef81589280840649f01f6606eb5830259bc701f694467847f5a960df96b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2606ef81589280840649f01f6606eb5830259bc701f694467847f5a960df96b0","first_computed_at":"2026-05-18T00:40:11.683058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:11.683058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dBEkYQ6QjMswRB+owFqTepvuwES1mF4OVHDwlXrrUfgMsGRF+fp4xX8eIAGFc48RjZkn3SGjhTvyEo9eQtNgDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:11.683703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8352981d3e2a49fec782db4f0bb5564153ed8beea18b1ece213e490cb57a144","sha256:6d417fb228526509a4f7d69537700b693c065d74935e541169be1a26fa3714a3"],"state_sha256":"21ecbac2b8bee4bb9fb93947dbe00a5f522a18e107eeefd99796234d5c56d9f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J/oJQcxOK8R4r3hs+Tyo6REvLtGetnFwtaIrO3pG+CnqpUGZwEmkdSvfBVHuNGdKfs1hArNhQdcMMclRBH8uCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:41:54.985840Z","bundle_sha256":"a0be0d280cc5637b4aa199c6bdb2692e98350bdd4304663d9720bd08effa520e"}}