{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3SAIUWXBAAFMDG75ZMI7CT4EQX","short_pith_number":"pith:3SAIUWXB","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"},"canonical_sha256":"dc808a5ae1000ac19bfdcb11f14f8485cfd10455a7c74c5670ca85336f938d9a","source":{"kind":"arxiv","id":"1407.2674","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2674","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2674v1","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2674","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"3SAIUWXBAAFM","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3SAIUWXBAAFMDG75","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3SAIUWXB","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3SAIUWXBAAFMDG75ZMI7CT4EQX","target":"record","payload":{"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"},"canonical_sha256":"dc808a5ae1000ac19bfdcb11f14f8485cfd10455a7c74c5670ca85336f938d9a","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"},"source_kind":"arxiv","source_id":"1407.2674","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-18T02:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GwJ5QNd8RPjspWpjtYpVjQg9SKL6HzNoN/75MdiAYYbn+hIMhIaiWLFt2lJ1ejZ0kdNNjsRAD6Km4Bj6yr0UBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:05:33.091963Z"},"content_sha256":"c8503a93f2dcee94b06a649ce7016288b36bb11b42570ae838a0c2366ab103ec","schema_version":"1.0","event_id":"sha256:c8503a93f2dcee94b06a649ce7016288b36bb11b42570ae838a0c2366ab103ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3SAIUWXBAAFMDG75ZMI7CT4EQX","target":"graph","payload":{"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"},"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-18T02:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HnyMK5Zxci09Nry0MESmJpX5WyOKZt+sPrANn1x8+rdPTccUsugZI+jH8GYXnk3QsB4TDykgWVCvwSR4lVjkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:05:33.092327Z"},"content_sha256":"ae8c2b69010dec2c2bae290df8e9e16c9e3e74b80b1b5b61340d6ffd4fa88908","schema_version":"1.0","event_id":"sha256:ae8c2b69010dec2c2bae290df8e9e16c9e3e74b80b1b5b61340d6ffd4fa88908"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX/bundle.json","state_url":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX/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-02T05:05:33Z","links":{"resolver":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX","bundle":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX/bundle.json","state":"https://pith.science/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SAIUWXBAAFMDG75ZMI7CT4EQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3SAIUWXBAAFMDG75ZMI7CT4EQX","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":"b6fdc095601385806c21248bca9686903b8ae0d2c73110b67f3f91969c45fae0","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-10T01:42:44Z","title_canon_sha256":"c7c3558501bc87267109f308bbfe2b2e5f89b85e8b6566eb8620f9f8ef5d79d9"},"schema_version":"1.0","source":{"id":"1407.2674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2674","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2674v1","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2674","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"3SAIUWXBAAFM","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3SAIUWXBAAFMDG75","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3SAIUWXB","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:ae8c2b69010dec2c2bae290df8e9e16c9e3e74b80b1b5b61340d6ffd4fa88908","target":"graph","created_at":"2026-05-18T02:47:53Z","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":"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","authors_text":"Amos Beimel, Kobbi Nissim, Uri Stemmer","cross_cats":["cs.CR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-10T01:42:44Z","title":"Private Learning and Sanitization: Pure vs. Approximate Differential Privacy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2674","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:c8503a93f2dcee94b06a649ce7016288b36bb11b42570ae838a0c2366ab103ec","target":"record","created_at":"2026-05-18T02:47:53Z","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":"b6fdc095601385806c21248bca9686903b8ae0d2c73110b67f3f91969c45fae0","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-10T01:42:44Z","title_canon_sha256":"c7c3558501bc87267109f308bbfe2b2e5f89b85e8b6566eb8620f9f8ef5d79d9"},"schema_version":"1.0","source":{"id":"1407.2674","kind":"arxiv","version":1}},"canonical_sha256":"dc808a5ae1000ac19bfdcb11f14f8485cfd10455a7c74c5670ca85336f938d9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc808a5ae1000ac19bfdcb11f14f8485cfd10455a7c74c5670ca85336f938d9a","first_computed_at":"2026-05-18T02:47:53.959985Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:53.959985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F/XQ/uVtPSaRC2Sh7PkSiZ0rNQEhkrIaIM2vRSHD4wMS6rSO5UIjYl7DXKmgmIRfGl2btI3MR6SHQtD6/D7ODA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:53.960606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8503a93f2dcee94b06a649ce7016288b36bb11b42570ae838a0c2366ab103ec","sha256:ae8c2b69010dec2c2bae290df8e9e16c9e3e74b80b1b5b61340d6ffd4fa88908"],"state_sha256":"92d1dc396d64420b3ba69fbdc39df8c81cb369a1b039d3c44234848221eade43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gM3DDnfR7whZJv4biPkTEA5dqpeiNfLh4s0+utFN+76FJw4vxBkPbq5aVOapsw7M3YQulqMt3wcffA3x9s5YAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:05:33.094730Z","bundle_sha256":"89efbf55e56cf2b318b30809b6fe01bc4dc105c0dfe08ad6cee9a5ec81634514"}}