{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3SAIUWXBAAFMDG75ZMI7CT4EQX","short_pith_number":"pith:3SAIUWXB","schema_version":"1.0","canonical_sha256":"dc808a5ae1000ac19bfdcb11f14f8485cfd10455a7c74c5670ca85336f938d9a","source":{"kind":"arxiv","id":"1407.2674","version":1},"attestation_state":"computed","paper":{"title":"Private Learning and Sanitization: Pure vs. Approximate Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amos Beimel, Kobbi Nissim, Uri Stemmer","submitted_at":"2014-07-10T01:42:44Z","abstract_excerpt":"We compare the sample complexity of private learning [Kasiviswanathan et al. 2008] and sanitization~[Blum et al. 2008] under pure $\\epsilon$-differential privacy [Dwork et al. TCC 2006] and approximate $(\\epsilon,\\delta)$-differential privacy [Dwork et al. Eurocrypt 2006]. We show that the sample complexity of these tasks under approximate differential privacy can be significantly lower than that under pure differential privacy.\n  We define a family of optimization problems, which we call Quasi-Concave Promise Problems, that generalizes some of our considered tasks. We observe that a quasi-con"},"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":"1407.2674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-10T01:42:44Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"c7c3558501bc87267109f308bbfe2b2e5f89b85e8b6566eb8620f9f8ef5d79d9","abstract_canon_sha256":"b6fdc095601385806c21248bca9686903b8ae0d2c73110b67f3f91969c45fae0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:53.960606Z","signature_b64":"F/XQ/uVtPSaRC2Sh7PkSiZ0rNQEhkrIaIM2vRSHD4wMS6rSO5UIjYl7DXKmgmIRfGl2btI3MR6SHQtD6/D7ODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc808a5ae1000ac19bfdcb11f14f8485cfd10455a7c74c5670ca85336f938d9a","last_reissued_at":"2026-05-18T02:47:53.959985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:53.959985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Learning and Sanitization: Pure vs. Approximate Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amos Beimel, Kobbi Nissim, Uri Stemmer","submitted_at":"2014-07-10T01:42:44Z","abstract_excerpt":"We compare the sample complexity of private learning [Kasiviswanathan et al. 2008] and sanitization~[Blum et al. 2008] under pure $\\epsilon$-differential privacy [Dwork et al. TCC 2006] and approximate $(\\epsilon,\\delta)$-differential privacy [Dwork et al. Eurocrypt 2006]. We show that the sample complexity of these tasks under approximate differential privacy can be significantly lower than that under pure differential privacy.\n  We define a family of optimization problems, which we call Quasi-Concave Promise Problems, that generalizes some of our considered tasks. We observe that a quasi-con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2674","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":"1407.2674","created_at":"2026-05-18T02:47:53.960075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2674v1","created_at":"2026-05-18T02:47:53.960075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2674","created_at":"2026-05-18T02:47:53.960075+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SAIUWXBAAFM","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SAIUWXBAAFMDG75","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SAIUWXB","created_at":"2026-05-18T12:28:11.866339+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/3SAIUWXBAAFMDG75ZMI7CT4EQX","json":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX.json","graph_json":"https://pith.science/api/pith-number/3SAIUWXBAAFMDG75ZMI7CT4EQX/graph.json","events_json":"https://pith.science/api/pith-number/3SAIUWXBAAFMDG75ZMI7CT4EQX/events.json","paper":"https://pith.science/paper/3SAIUWXB"},"agent_actions":{"view_html":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX","download_json":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX.json","view_paper":"https://pith.science/paper/3SAIUWXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2674&json=true","fetch_graph":"https://pith.science/api/pith-number/3SAIUWXBAAFMDG75ZMI7CT4EQX/graph.json","fetch_events":"https://pith.science/api/pith-number/3SAIUWXBAAFMDG75ZMI7CT4EQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX/action/storage_attestation","attest_author":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX/action/author_attestation","sign_citation":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX/action/citation_signature","submit_replication":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX/action/replication_record"}},"created_at":"2026-05-18T02:47:53.960075+00:00","updated_at":"2026-05-18T02:47:53.960075+00:00"}