{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5NJWK2VCL6ARRYCR6JRDQZHTEP","short_pith_number":"pith:5NJWK2VC","schema_version":"1.0","canonical_sha256":"eb53656aa25f8118e051f2623864f323f4e7e66c8984e87e1ba1478aa7c28d1b","source":{"kind":"arxiv","id":"1311.3158","version":3},"attestation_state":"computed","paper":{"title":"Fingerprinting Codes and the Price of Approximate Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jonathan Ullman, Mark Bun, Salil Vadhan","submitted_at":"2013-11-13T15:09:48Z","abstract_excerpt":"We show new lower bounds on the sample complexity of $(\\varepsilon, \\delta)$-differentially private algorithms that accurately answer large sets of counting queries. A counting query on a database $D \\in (\\{0,1\\}^d)^n$ has the form \"What fraction of the individual records in the database satisfy the property $q$?\" We show that in order to answer an arbitrary set $\\mathcal{Q}$ of $\\gg nd$ counting queries on $D$ to within error $\\pm \\alpha$ it is necessary that $$ n \\geq \\tilde{\\Omega}\\Bigg(\\frac{\\sqrt{d} \\log |\\mathcal{Q}|}{\\alpha^2 \\varepsilon} \\Bigg). $$ This bound is optimal up to poly-loga"},"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":"1311.3158","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-11-13T15:09:48Z","cross_cats_sorted":[],"title_canon_sha256":"70714cb7ddf026dc4118b1e21cbd6343e1d5dc2cb8e87cae5079f53ea0095f2a","abstract_canon_sha256":"17e518f108c9c0c70d48f25b0aeefe18f87093c1dbd1896e8404590b3362bd96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:28.581612Z","signature_b64":"tMJZmrpNF0qVkgbznnjsdLfTrEhfDuteTHRg8ZQRow6UTWrWkC1V7Wv2jIvh2LqAib7gJNxxjbdQk6P10pwBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb53656aa25f8118e051f2623864f323f4e7e66c8984e87e1ba1478aa7c28d1b","last_reissued_at":"2026-05-18T00:02:28.580993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:28.580993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fingerprinting Codes and the Price of Approximate Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jonathan Ullman, Mark Bun, Salil Vadhan","submitted_at":"2013-11-13T15:09:48Z","abstract_excerpt":"We show new lower bounds on the sample complexity of $(\\varepsilon, \\delta)$-differentially private algorithms that accurately answer large sets of counting queries. A counting query on a database $D \\in (\\{0,1\\}^d)^n$ has the form \"What fraction of the individual records in the database satisfy the property $q$?\" We show that in order to answer an arbitrary set $\\mathcal{Q}$ of $\\gg nd$ counting queries on $D$ to within error $\\pm \\alpha$ it is necessary that $$ n \\geq \\tilde{\\Omega}\\Bigg(\\frac{\\sqrt{d} \\log |\\mathcal{Q}|}{\\alpha^2 \\varepsilon} \\Bigg). $$ This bound is optimal up to poly-loga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3158","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":"1311.3158","created_at":"2026-05-18T00:02:28.581081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3158v3","created_at":"2026-05-18T00:02:28.581081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3158","created_at":"2026-05-18T00:02:28.581081+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NJWK2VCL6AR","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NJWK2VCL6ARRYCR","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NJWK2VC","created_at":"2026-05-18T12:27:34.582898+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/5NJWK2VCL6ARRYCR6JRDQZHTEP","json":"https://pith.science/pith/5NJWK2VCL6ARRYCR6JRDQZHTEP.json","graph_json":"https://pith.science/api/pith-number/5NJWK2VCL6ARRYCR6JRDQZHTEP/graph.json","events_json":"https://pith.science/api/pith-number/5NJWK2VCL6ARRYCR6JRDQZHTEP/events.json","paper":"https://pith.science/paper/5NJWK2VC"},"agent_actions":{"view_html":"https://pith.science/pith/5NJWK2VCL6ARRYCR6JRDQZHTEP","download_json":"https://pith.science/pith/5NJWK2VCL6ARRYCR6JRDQZHTEP.json","view_paper":"https://pith.science/paper/5NJWK2VC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3158&json=true","fetch_graph":"https://pith.science/api/pith-number/5NJWK2VCL6ARRYCR6JRDQZHTEP/graph.json","fetch_events":"https://pith.science/api/pith-number/5NJWK2VCL6ARRYCR6JRDQZHTEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NJWK2VCL6ARRYCR6JRDQZHTEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NJWK2VCL6ARRYCR6JRDQZHTEP/action/storage_attestation","attest_author":"https://pith.science/pith/5NJWK2VCL6ARRYCR6JRDQZHTEP/action/author_attestation","sign_citation":"https://pith.science/pith/5NJWK2VCL6ARRYCR6JRDQZHTEP/action/citation_signature","submit_replication":"https://pith.science/pith/5NJWK2VCL6ARRYCR6JRDQZHTEP/action/replication_record"}},"created_at":"2026-05-18T00:02:28.581081+00:00","updated_at":"2026-05-18T00:02:28.581081+00:00"}