{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UOZCXVAWJFK3CQYYFD6AF4WIZT","short_pith_number":"pith:UOZCXVAW","canonical_record":{"source":{"id":"1607.06141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-07-20T22:31:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"41ca7f9462f58d4f9c570006eb5829ad0099ad00e87bc9e683cb58d98d3c41d2","abstract_canon_sha256":"98d9943025b230ae2f33631ee54eb7c3b369d1913dc33f08473821d428bd0381"},"schema_version":"1.0"},"canonical_sha256":"a3b22bd4164955b1431828fc02f2c8ccdd9cb045a4bae9fabd67f82a2915a564","source":{"kind":"arxiv","id":"1607.06141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06141","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06141v1","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06141","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"pith_short_12","alias_value":"UOZCXVAWJFK3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UOZCXVAWJFK3CQYY","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UOZCXVAW","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UOZCXVAWJFK3CQYYFD6AF4WIZT","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-07-20T22:31:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"41ca7f9462f58d4f9c570006eb5829ad0099ad00e87bc9e683cb58d98d3c41d2","abstract_canon_sha256":"98d9943025b230ae2f33631ee54eb7c3b369d1913dc33f08473821d428bd0381"},"schema_version":"1.0"},"canonical_sha256":"a3b22bd4164955b1431828fc02f2c8ccdd9cb045a4bae9fabd67f82a2915a564","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:42.380716Z","signature_b64":"JlKHVvqT/Sk0RRRHbIE3m4GlXNpwnBpBmDjQ1uY+9JrEKx7pbb1vrOk4RpgzYYHsFq9abrMvR9qLs/OyMXsgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3b22bd4164955b1431828fc02f2c8ccdd9cb045a4bae9fabd67f82a2915a564","last_reissued_at":"2026-05-18T01:10:42.380151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:42.380151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06141","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-18T01:10:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xoKkOhtpWRW85vV9BhpXbMK7IgHISAgwhn+IC34BAL/eaNFV6AoZDzeHjARlgDM0wNeZqWTcRyyJKY7CYzYBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:28:33.777159Z"},"content_sha256":"21fe5e9009758398dc90e7155cc13bfec467d5723ac24e392d496451d220e3ca","schema_version":"1.0","event_id":"sha256:21fe5e9009758398dc90e7155cc13bfec467d5723ac24e392d496451d220e3ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UOZCXVAWJFK3CQYYFD6AF4WIZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Hardness of Privacy from Weak Traitor Tracing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Jonathan Ullman, Lucas Kowalczyk, Mark Zhandry, Tal Malkin","submitted_at":"2016-07-20T22:31:10Z","abstract_excerpt":"Despite much study, the computational complexity of differential privacy remains poorly understood. In this paper we consider the computational complexity of accurately answering a family $Q$ of statistical queries over a data universe $X$ under differential privacy. A statistical query on a dataset $D \\in X^n$ asks \"what fraction of the elements of $D$ satisfy a given predicate $p$ on $X$?\" Dwork et al. (STOC'09) and Boneh and Zhandry (CRYPTO'14) showed that if both $Q$ and $X$ are of polynomial size, then there is an efficient differentially private algorithm that accurately answers all the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06141","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-18T01:10:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bL+hblKwJ0ys78fk5D/6UESZiLe2Fb4tbiPG4WrMJUQgi3GBj8Jb05A4uSGdOiNgJJHhAx/w7VlJXPD+dK1DAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:28:33.777558Z"},"content_sha256":"4db5cedc4cf9db3edbd49540e215393c73099b2bc688e5f1f30b627fd825fc2c","schema_version":"1.0","event_id":"sha256:4db5cedc4cf9db3edbd49540e215393c73099b2bc688e5f1f30b627fd825fc2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UOZCXVAWJFK3CQYYFD6AF4WIZT/bundle.json","state_url":"https://pith.science/pith/UOZCXVAWJFK3CQYYFD6AF4WIZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UOZCXVAWJFK3CQYYFD6AF4WIZT/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-30T08:28:33Z","links":{"resolver":"https://pith.science/pith/UOZCXVAWJFK3CQYYFD6AF4WIZT","bundle":"https://pith.science/pith/UOZCXVAWJFK3CQYYFD6AF4WIZT/bundle.json","state":"https://pith.science/pith/UOZCXVAWJFK3CQYYFD6AF4WIZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UOZCXVAWJFK3CQYYFD6AF4WIZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UOZCXVAWJFK3CQYYFD6AF4WIZT","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":"98d9943025b230ae2f33631ee54eb7c3b369d1913dc33f08473821d428bd0381","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-07-20T22:31:10Z","title_canon_sha256":"41ca7f9462f58d4f9c570006eb5829ad0099ad00e87bc9e683cb58d98d3c41d2"},"schema_version":"1.0","source":{"id":"1607.06141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06141","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06141v1","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06141","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"pith_short_12","alias_value":"UOZCXVAWJFK3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UOZCXVAWJFK3CQYY","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UOZCXVAW","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:4db5cedc4cf9db3edbd49540e215393c73099b2bc688e5f1f30b627fd825fc2c","target":"graph","created_at":"2026-05-18T01:10:42Z","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":"Despite much study, the computational complexity of differential privacy remains poorly understood. In this paper we consider the computational complexity of accurately answering a family $Q$ of statistical queries over a data universe $X$ under differential privacy. A statistical query on a dataset $D \\in X^n$ asks \"what fraction of the elements of $D$ satisfy a given predicate $p$ on $X$?\" Dwork et al. (STOC'09) and Boneh and Zhandry (CRYPTO'14) showed that if both $Q$ and $X$ are of polynomial size, then there is an efficient differentially private algorithm that accurately answers all the ","authors_text":"Jonathan Ullman, Lucas Kowalczyk, Mark Zhandry, Tal Malkin","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-07-20T22:31:10Z","title":"Strong Hardness of Privacy from Weak Traitor Tracing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06141","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:21fe5e9009758398dc90e7155cc13bfec467d5723ac24e392d496451d220e3ca","target":"record","created_at":"2026-05-18T01:10:42Z","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":"98d9943025b230ae2f33631ee54eb7c3b369d1913dc33f08473821d428bd0381","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-07-20T22:31:10Z","title_canon_sha256":"41ca7f9462f58d4f9c570006eb5829ad0099ad00e87bc9e683cb58d98d3c41d2"},"schema_version":"1.0","source":{"id":"1607.06141","kind":"arxiv","version":1}},"canonical_sha256":"a3b22bd4164955b1431828fc02f2c8ccdd9cb045a4bae9fabd67f82a2915a564","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3b22bd4164955b1431828fc02f2c8ccdd9cb045a4bae9fabd67f82a2915a564","first_computed_at":"2026-05-18T01:10:42.380151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:42.380151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JlKHVvqT/Sk0RRRHbIE3m4GlXNpwnBpBmDjQ1uY+9JrEKx7pbb1vrOk4RpgzYYHsFq9abrMvR9qLs/OyMXsgCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:42.380716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21fe5e9009758398dc90e7155cc13bfec467d5723ac24e392d496451d220e3ca","sha256:4db5cedc4cf9db3edbd49540e215393c73099b2bc688e5f1f30b627fd825fc2c"],"state_sha256":"b30b7e3f13c3d59a87edaae5b1741b6896aed726fd87a0d4ed9166b8e21c0ee2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"irWcunKaArUIWqs4QwNhYAd5GKRX4b12I3t82GLAhDGwuwV+G2LXi51uGCKbvMwmyK6tySLSNKlpBYRWFuMMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:28:33.780567Z","bundle_sha256":"b24f1600c4c532e1d9f84f51ab58b3c13c5b34977a14dcc384450d645eabc306"}}