{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PNBMXCEZ65VOSDD5XDT4QBO2AU","short_pith_number":"pith:PNBMXCEZ","schema_version":"1.0","canonical_sha256":"7b42cb8899f76ae90c7db8e7c805da0510b8b9bc579e81f6b9152b4c70f1525b","source":{"kind":"arxiv","id":"1501.06095","version":1},"attestation_state":"computed","paper":{"title":"Between Pure and Approximate Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Jonathan Ullman, Thomas Steinke","submitted_at":"2015-01-24T23:26:21Z","abstract_excerpt":"We show a new lower bound on the sample complexity of $(\\varepsilon, \\delta)$-differentially private algorithms that accurately answer statistical queries on high-dimensional databases. The novelty of our bound is that it depends optimally on the parameter $\\delta$, which loosely corresponds to the probability that the algorithm fails to be private, and is the first to smoothly interpolate between approximate differential privacy ($\\delta > 0$) and pure differential privacy ($\\delta = 0$).\n  Specifically, we consider a database $D \\in \\{\\pm1\\}^{n \\times d}$ and its \\emph{one-way marginals}, wh"},"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":"1501.06095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-24T23:26:21Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"e5b1878f69a973771bd603dae94ad08d8b6e49120ba750db4f6f73785bcbe5c8","abstract_canon_sha256":"f7bcac8dc472f7f6743a47a3e91ec81848397594f6ca6e303591b106da69305c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:46.878990Z","signature_b64":"/ribv3kdx/8pkF/3M5MPwELxHljJjeiuwsWE+yyTyKGejtLoVQJwitgYMT8+bgvQUMnSWGGPflYkYEo4v6sJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b42cb8899f76ae90c7db8e7c805da0510b8b9bc579e81f6b9152b4c70f1525b","last_reissued_at":"2026-05-18T02:28:46.878466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:46.878466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Between Pure and Approximate Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Jonathan Ullman, Thomas Steinke","submitted_at":"2015-01-24T23:26:21Z","abstract_excerpt":"We show a new lower bound on the sample complexity of $(\\varepsilon, \\delta)$-differentially private algorithms that accurately answer statistical queries on high-dimensional databases. The novelty of our bound is that it depends optimally on the parameter $\\delta$, which loosely corresponds to the probability that the algorithm fails to be private, and is the first to smoothly interpolate between approximate differential privacy ($\\delta > 0$) and pure differential privacy ($\\delta = 0$).\n  Specifically, we consider a database $D \\in \\{\\pm1\\}^{n \\times d}$ and its \\emph{one-way marginals}, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06095","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.06095","created_at":"2026-05-18T02:28:46.878541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06095v1","created_at":"2026-05-18T02:28:46.878541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06095","created_at":"2026-05-18T02:28:46.878541+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNBMXCEZ65VO","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNBMXCEZ65VOSDD5","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNBMXCEZ","created_at":"2026-05-18T12:29:37.295048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.23131","citing_title":"When Determinants Are Not Enough: Private Rare Switching","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PNBMXCEZ65VOSDD5XDT4QBO2AU","json":"https://pith.science/pith/PNBMXCEZ65VOSDD5XDT4QBO2AU.json","graph_json":"https://pith.science/api/pith-number/PNBMXCEZ65VOSDD5XDT4QBO2AU/graph.json","events_json":"https://pith.science/api/pith-number/PNBMXCEZ65VOSDD5XDT4QBO2AU/events.json","paper":"https://pith.science/paper/PNBMXCEZ"},"agent_actions":{"view_html":"https://pith.science/pith/PNBMXCEZ65VOSDD5XDT4QBO2AU","download_json":"https://pith.science/pith/PNBMXCEZ65VOSDD5XDT4QBO2AU.json","view_paper":"https://pith.science/paper/PNBMXCEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06095&json=true","fetch_graph":"https://pith.science/api/pith-number/PNBMXCEZ65VOSDD5XDT4QBO2AU/graph.json","fetch_events":"https://pith.science/api/pith-number/PNBMXCEZ65VOSDD5XDT4QBO2AU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNBMXCEZ65VOSDD5XDT4QBO2AU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNBMXCEZ65VOSDD5XDT4QBO2AU/action/storage_attestation","attest_author":"https://pith.science/pith/PNBMXCEZ65VOSDD5XDT4QBO2AU/action/author_attestation","sign_citation":"https://pith.science/pith/PNBMXCEZ65VOSDD5XDT4QBO2AU/action/citation_signature","submit_replication":"https://pith.science/pith/PNBMXCEZ65VOSDD5XDT4QBO2AU/action/replication_record"}},"created_at":"2026-05-18T02:28:46.878541+00:00","updated_at":"2026-05-18T02:28:46.878541+00:00"}