{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LXY3WPCOCWVSDVCKKW6T7MOUFO","short_pith_number":"pith:LXY3WPCO","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"},"canonical_sha256":"5df1bb3c4e15ab21d44a55bd3fb1d42bb37e1ccbf9623bb34373efa244414821","source":{"kind":"arxiv","id":"1207.6945","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6945","created_at":"2026-05-18T03:11:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6945v3","created_at":"2026-05-18T03:11:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6945","created_at":"2026-05-18T03:11:47Z"},{"alias_kind":"pith_short_12","alias_value":"LXY3WPCOCWVS","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LXY3WPCOCWVSDVCK","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LXY3WPCO","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LXY3WPCOCWVSDVCKKW6T7MOUFO","target":"record","payload":{"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"},"canonical_sha256":"5df1bb3c4e15ab21d44a55bd3fb1d42bb37e1ccbf9623bb34373efa244414821","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"},"source_kind":"arxiv","source_id":"1207.6945","source_version":3,"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-18T03:11:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gtVLA5Vjgt9FSxXai40G31cOnrcU5Fxcb71EwREpCNU5Lq2bMZrJHXPmjQTX2jdIjMwWW3Du79F2IfNQr8muDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:18:37.662967Z"},"content_sha256":"5492a9e356a167e268ec71b7a932de08ebaf38a2996b2928349bf4ef0472ac2a","schema_version":"1.0","event_id":"sha256:5492a9e356a167e268ec71b7a932de08ebaf38a2996b2928349bf4ef0472ac2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LXY3WPCOCWVSDVCKKW6T7MOUFO","target":"graph","payload":{"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"},"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-18T03:11:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvNXkE1TLmiTfvHUZJCB7/BrQ9drfoSmO52s9rL66NeITKAm4OgSPT0rk+iDx+cPUmAO0MQRTR6p7lzRvttQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:18:37.663697Z"},"content_sha256":"2f34ff9c51b7b9ce21b8f0449aff76910a3d77ce8efe83704c4e7f88a89504a3","schema_version":"1.0","event_id":"sha256:2f34ff9c51b7b9ce21b8f0449aff76910a3d77ce8efe83704c4e7f88a89504a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO/bundle.json","state_url":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO/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-06-08T17:18:37Z","links":{"resolver":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO","bundle":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO/bundle.json","state":"https://pith.science/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXY3WPCOCWVSDVCKKW6T7MOUFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LXY3WPCOCWVSDVCKKW6T7MOUFO","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":"93dc05772d5113527823d1c54a2e834ccd8d312409b5d8fc21db6957a9d67e05","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-07-30T14:34:26Z","title_canon_sha256":"78137f6a0fef467b285e146c0e42f6a078b265c12c52c541c9ea27c1ab3629e9"},"schema_version":"1.0","source":{"id":"1207.6945","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6945","created_at":"2026-05-18T03:11:47Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6945v3","created_at":"2026-05-18T03:11:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6945","created_at":"2026-05-18T03:11:47Z"},{"alias_kind":"pith_short_12","alias_value":"LXY3WPCOCWVS","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LXY3WPCOCWVSDVCK","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LXY3WPCO","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:2f34ff9c51b7b9ce21b8f0449aff76910a3d77ce8efe83704c4e7f88a89504a3","target":"graph","created_at":"2026-05-18T03:11:47Z","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":"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","authors_text":"Jonathan Ullman","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-07-30T14:34:26Z","title":"Answering n^{2+o(1)} Counting Queries with Differential Privacy is Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6945","kind":"arxiv","version":3},"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:5492a9e356a167e268ec71b7a932de08ebaf38a2996b2928349bf4ef0472ac2a","target":"record","created_at":"2026-05-18T03:11:47Z","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":"93dc05772d5113527823d1c54a2e834ccd8d312409b5d8fc21db6957a9d67e05","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-07-30T14:34:26Z","title_canon_sha256":"78137f6a0fef467b285e146c0e42f6a078b265c12c52c541c9ea27c1ab3629e9"},"schema_version":"1.0","source":{"id":"1207.6945","kind":"arxiv","version":3}},"canonical_sha256":"5df1bb3c4e15ab21d44a55bd3fb1d42bb37e1ccbf9623bb34373efa244414821","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5df1bb3c4e15ab21d44a55bd3fb1d42bb37e1ccbf9623bb34373efa244414821","first_computed_at":"2026-05-18T03:11:47.159131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:47.159131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5RYxU4MTjaMtpJycs24qVKiaYcECQpbFh8K87b+VqrsypprUaOd61OiKtIbRwhVNjsf5hIz86SDE07RaDuU8Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:47.159912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6945","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5492a9e356a167e268ec71b7a932de08ebaf38a2996b2928349bf4ef0472ac2a","sha256:2f34ff9c51b7b9ce21b8f0449aff76910a3d77ce8efe83704c4e7f88a89504a3"],"state_sha256":"bebf06fc356b5d39e4aa3cfa770be87d23dae1fff3cb0b34431d345b1bcfe5b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9PterXVCTArSCn4UiwXAO/VK7CoHpygcsJolK1EgEiZPEk6rZqN2yM0CrFqe1QfaLAerZqLyiWtZcPCbn1HZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:18:37.667926Z","bundle_sha256":"07ae6bb3427d9c578cdcdcaba587c9d57a49aaba78c0fd9c8cf88bb8bc4ab639"}}