{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TL3635T3IZGXQKGKLITVI552T2","short_pith_number":"pith:TL3635T3","schema_version":"1.0","canonical_sha256":"9af7edf67b464d7828ca5a275477ba9e94f2a27d4f4d84564abdf96d40214b5d","source":{"kind":"arxiv","id":"2009.09604","version":1},"attestation_state":"computed","paper":{"title":"On Distributed Differential Privacy and Counting Distinct Elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML"],"primary_cat":"cs.CR","authors_text":"Badih Ghazi, Lijie Chen, Pasin Manurangsi, Ravi Kumar","submitted_at":"2020-09-21T04:13:34Z","abstract_excerpt":"We study the setup where each of $n$ users holds an element from a discrete set, and the goal is to count the number of distinct elements across all users, under the constraint of $(\\epsilon, \\delta)$-differentially privacy:\n  - In the non-interactive local setting, we prove that the additive error of any protocol is $\\Omega(n)$ for any constant $\\epsilon$ and for any $\\delta$ inverse polynomial in $n$.\n  - In the single-message shuffle setting, we prove a lower bound of $\\Omega(n)$ on the error for any constant $\\epsilon$ and for some $\\delta$ inverse quasi-polynomial in $n$. We do so by buil"},"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":"2009.09604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-09-21T04:13:34Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"4f5225adc21e05f918202076e8a9747e0bd583f7be90c445b440f73569b7acec","abstract_canon_sha256":"ed6c467fb1a7e0d209986cff5358e3b83e918c09d7fb28ed163b7f1e26398354"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:36:42.476515Z","signature_b64":"w+SIUiPx0Jlmkn2sbRV7NHeKtukKxf5ORBs6bCQZCmNKlPtIA+67WK+PrHGL2/bhUmfSToqfcyJz6fj6SKEACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9af7edf67b464d7828ca5a275477ba9e94f2a27d4f4d84564abdf96d40214b5d","last_reissued_at":"2026-07-05T01:36:42.475981Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:36:42.475981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Distributed Differential Privacy and Counting Distinct Elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML"],"primary_cat":"cs.CR","authors_text":"Badih Ghazi, Lijie Chen, Pasin Manurangsi, Ravi Kumar","submitted_at":"2020-09-21T04:13:34Z","abstract_excerpt":"We study the setup where each of $n$ users holds an element from a discrete set, and the goal is to count the number of distinct elements across all users, under the constraint of $(\\epsilon, \\delta)$-differentially privacy:\n  - In the non-interactive local setting, we prove that the additive error of any protocol is $\\Omega(n)$ for any constant $\\epsilon$ and for any $\\delta$ inverse polynomial in $n$.\n  - In the single-message shuffle setting, we prove a lower bound of $\\Omega(n)$ on the error for any constant $\\epsilon$ and for some $\\delta$ inverse quasi-polynomial in $n$. We do so by buil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.09604","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/2009.09604/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":"2009.09604","created_at":"2026-07-05T01:36:42.476041+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.09604v1","created_at":"2026-07-05T01:36:42.476041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.09604","created_at":"2026-07-05T01:36:42.476041+00:00"},{"alias_kind":"pith_short_12","alias_value":"TL3635T3IZGX","created_at":"2026-07-05T01:36:42.476041+00:00"},{"alias_kind":"pith_short_16","alias_value":"TL3635T3IZGXQKGK","created_at":"2026-07-05T01:36:42.476041+00:00"},{"alias_kind":"pith_short_8","alias_value":"TL3635T3","created_at":"2026-07-05T01:36:42.476041+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/TL3635T3IZGXQKGKLITVI552T2","json":"https://pith.science/pith/TL3635T3IZGXQKGKLITVI552T2.json","graph_json":"https://pith.science/api/pith-number/TL3635T3IZGXQKGKLITVI552T2/graph.json","events_json":"https://pith.science/api/pith-number/TL3635T3IZGXQKGKLITVI552T2/events.json","paper":"https://pith.science/paper/TL3635T3"},"agent_actions":{"view_html":"https://pith.science/pith/TL3635T3IZGXQKGKLITVI552T2","download_json":"https://pith.science/pith/TL3635T3IZGXQKGKLITVI552T2.json","view_paper":"https://pith.science/paper/TL3635T3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.09604&json=true","fetch_graph":"https://pith.science/api/pith-number/TL3635T3IZGXQKGKLITVI552T2/graph.json","fetch_events":"https://pith.science/api/pith-number/TL3635T3IZGXQKGKLITVI552T2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TL3635T3IZGXQKGKLITVI552T2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TL3635T3IZGXQKGKLITVI552T2/action/storage_attestation","attest_author":"https://pith.science/pith/TL3635T3IZGXQKGKLITVI552T2/action/author_attestation","sign_citation":"https://pith.science/pith/TL3635T3IZGXQKGKLITVI552T2/action/citation_signature","submit_replication":"https://pith.science/pith/TL3635T3IZGXQKGKLITVI552T2/action/replication_record"}},"created_at":"2026-07-05T01:36:42.476041+00:00","updated_at":"2026-07-05T01:36:42.476041+00:00"}