{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LXY3WPCOCWVSDVCKKW6T7MOUFO","short_pith_number":"pith:LXY3WPCO","schema_version":"1.0","canonical_sha256":"5df1bb3c4e15ab21d44a55bd3fb1d42bb37e1ccbf9623bb34373efa244414821","source":{"kind":"arxiv","id":"1207.6945","version":3},"attestation_state":"computed","paper":{"title":"Answering n^{2+o(1)} Counting Queries with Differential Privacy is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CR","authors_text":"Jonathan Ullman","submitted_at":"2012-07-30T14:34:26Z","abstract_excerpt":"A central problem in differentially private data analysis is how to design efficient algorithms capable of answering large numbers of counting queries on a sensitive database. Counting queries of the form \"What fraction of individual records in the database satisfy the property q?\" We prove that if one-way functions exist, then there is no algorithm that takes as input a database D in ({0,1}^d)^n, and k = n^{2+o(1)} arbitrary efficiently computable counting queries, runs in time poly(d, n), and returns an approximate answer to each query, while satisfying differential privacy. We also consider"},"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":"1207.6945","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-07-30T14:34:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"78137f6a0fef467b285e146c0e42f6a078b265c12c52c541c9ea27c1ab3629e9","abstract_canon_sha256":"93dc05772d5113527823d1c54a2e834ccd8d312409b5d8fc21db6957a9d67e05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:47.159912Z","signature_b64":"5RYxU4MTjaMtpJycs24qVKiaYcECQpbFh8K87b+VqrsypprUaOd61OiKtIbRwhVNjsf5hIz86SDE07RaDuU8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5df1bb3c4e15ab21d44a55bd3fb1d42bb37e1ccbf9623bb34373efa244414821","last_reissued_at":"2026-05-18T03:11:47.159131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:47.159131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Answering n^{2+o(1)} Counting Queries with Differential Privacy is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CR","authors_text":"Jonathan Ullman","submitted_at":"2012-07-30T14:34:26Z","abstract_excerpt":"A central problem in differentially private data analysis is how to design efficient algorithms capable of answering large numbers of counting queries on a sensitive database. Counting queries of the form \"What fraction of individual records in the database satisfy the property q?\" We prove that if one-way functions exist, then there is no algorithm that takes as input a database D in ({0,1}^d)^n, and k = n^{2+o(1)} arbitrary efficiently computable counting queries, runs in time poly(d, n), and returns an approximate answer to each query, while satisfying differential privacy. We also consider"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6945","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":"1207.6945","created_at":"2026-05-18T03:11:47.159252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6945v3","created_at":"2026-05-18T03:11:47.159252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6945","created_at":"2026-05-18T03:11:47.159252+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXY3WPCOCWVS","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXY3WPCOCWVSDVCK","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXY3WPCO","created_at":"2026-05-18T12:27:14.488303+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/LXY3WPCOCWVSDVCKKW6T7MOUFO","json":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO.json","graph_json":"https://pith.science/api/pith-number/LXY3WPCOCWVSDVCKKW6T7MOUFO/graph.json","events_json":"https://pith.science/api/pith-number/LXY3WPCOCWVSDVCKKW6T7MOUFO/events.json","paper":"https://pith.science/paper/LXY3WPCO"},"agent_actions":{"view_html":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO","download_json":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO.json","view_paper":"https://pith.science/paper/LXY3WPCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6945&json=true","fetch_graph":"https://pith.science/api/pith-number/LXY3WPCOCWVSDVCKKW6T7MOUFO/graph.json","fetch_events":"https://pith.science/api/pith-number/LXY3WPCOCWVSDVCKKW6T7MOUFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO/action/storage_attestation","attest_author":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO/action/author_attestation","sign_citation":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO/action/citation_signature","submit_replication":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO/action/replication_record"}},"created_at":"2026-05-18T03:11:47.159252+00:00","updated_at":"2026-05-18T03:11:47.159252+00:00"}