{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:C3MXMELCNLFJ3GES6Q6TBYQIGM","short_pith_number":"pith:C3MXMELC","canonical_record":{"source":{"id":"1405.7085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-27T22:58:26Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"41d401f2fc13c126f3615967a5054e8f56318239a42653aab0ea10e1a8faf309","abstract_canon_sha256":"c3848879ede652443ac9cb4e58a0b19b0f46530e0b7825a3267c8bb152e58bb3"},"schema_version":"1.0"},"canonical_sha256":"16d97611626aca9d9892f43d30e2083338b6a2a4bc7d32f51f77b8506dbb71a6","source":{"kind":"arxiv","id":"1405.7085","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7085","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7085v2","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7085","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"C3MXMELCNLFJ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C3MXMELCNLFJ3GES","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C3MXMELC","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:C3MXMELCNLFJ3GES6Q6TBYQIGM","target":"record","payload":{"canonical_record":{"source":{"id":"1405.7085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-27T22:58:26Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"41d401f2fc13c126f3615967a5054e8f56318239a42653aab0ea10e1a8faf309","abstract_canon_sha256":"c3848879ede652443ac9cb4e58a0b19b0f46530e0b7825a3267c8bb152e58bb3"},"schema_version":"1.0"},"canonical_sha256":"16d97611626aca9d9892f43d30e2083338b6a2a4bc7d32f51f77b8506dbb71a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:48.164459Z","signature_b64":"FMZn/rIwZIMdhKoxmXsXpcJfHtqXR5QDWqK9TnxYmYEA684gId6dhsSa1QJBC/xPWAhobNIUw2h3qryA74SzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16d97611626aca9d9892f43d30e2083338b6a2a4bc7d32f51f77b8506dbb71a6","last_reissued_at":"2026-05-18T02:39:48.163801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:48.163801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.7085","source_version":2,"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:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WztWFjeoJo3korHsAzDhK701AGFi7iaYDRhGk3gg/09JNYmmwjrQSBa0jEI/YWmFJ6hM1tcLz/NvQgkUm+9kDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:36:13.815999Z"},"content_sha256":"0428d481959588306d7a67816e8544348f7bb9260b2136ac80702664b81f484e","schema_version":"1.0","event_id":"sha256:0428d481959588306d7a67816e8544348f7bb9260b2136ac80702664b81f484e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:C3MXMELCNLFJ3GES6Q6TBYQIGM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentially Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhradeep Thakurta, Adam Smith, Raef Bassily","submitted_at":"2014-05-27T22:58:26Z","abstract_excerpt":"In this paper, we initiate a systematic investigation of differentially private algorithms for convex empirical risk minimization. Various instantiations of this problem have been studied before. We provide new algorithms and matching lower bounds for private ERM assuming only that each data point's contribution to the loss function is Lipschitz bounded and that the domain of optimization is bounded. We provide a separate set of algorithms and matching lower bounds for the setting in which the loss functions are known to also be strongly convex.\n  Our algorithms run in polynomial time, and in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7085","kind":"arxiv","version":2},"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:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1l+h4j2CVf21Vzf30KSCZ3T1rpNTTZfsPyELGSIT2rLlqJvfItrcKg78c2g0gptsngK6SRfna/8uBYo8sIGoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:36:13.816720Z"},"content_sha256":"170217ecc463c7da8dda31b6e6d9022755594a6ffb1cca6915769bb1fc68ba6e","schema_version":"1.0","event_id":"sha256:170217ecc463c7da8dda31b6e6d9022755594a6ffb1cca6915769bb1fc68ba6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C3MXMELCNLFJ3GES6Q6TBYQIGM/bundle.json","state_url":"https://pith.science/pith/C3MXMELCNLFJ3GES6Q6TBYQIGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C3MXMELCNLFJ3GES6Q6TBYQIGM/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-26T06:36:13Z","links":{"resolver":"https://pith.science/pith/C3MXMELCNLFJ3GES6Q6TBYQIGM","bundle":"https://pith.science/pith/C3MXMELCNLFJ3GES6Q6TBYQIGM/bundle.json","state":"https://pith.science/pith/C3MXMELCNLFJ3GES6Q6TBYQIGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C3MXMELCNLFJ3GES6Q6TBYQIGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:C3MXMELCNLFJ3GES6Q6TBYQIGM","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":"c3848879ede652443ac9cb4e58a0b19b0f46530e0b7825a3267c8bb152e58bb3","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-27T22:58:26Z","title_canon_sha256":"41d401f2fc13c126f3615967a5054e8f56318239a42653aab0ea10e1a8faf309"},"schema_version":"1.0","source":{"id":"1405.7085","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7085","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7085v2","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7085","created_at":"2026-05-18T02:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"C3MXMELCNLFJ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C3MXMELCNLFJ3GES","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C3MXMELC","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:170217ecc463c7da8dda31b6e6d9022755594a6ffb1cca6915769bb1fc68ba6e","target":"graph","created_at":"2026-05-18T02:39:48Z","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":"In this paper, we initiate a systematic investigation of differentially private algorithms for convex empirical risk minimization. Various instantiations of this problem have been studied before. We provide new algorithms and matching lower bounds for private ERM assuming only that each data point's contribution to the loss function is Lipschitz bounded and that the domain of optimization is bounded. We provide a separate set of algorithms and matching lower bounds for the setting in which the loss functions are known to also be strongly convex.\n  Our algorithms run in polynomial time, and in ","authors_text":"Abhradeep Thakurta, Adam Smith, Raef Bassily","cross_cats":["cs.CR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-27T22:58:26Z","title":"Differentially Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7085","kind":"arxiv","version":2},"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:0428d481959588306d7a67816e8544348f7bb9260b2136ac80702664b81f484e","target":"record","created_at":"2026-05-18T02:39:48Z","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":"c3848879ede652443ac9cb4e58a0b19b0f46530e0b7825a3267c8bb152e58bb3","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-27T22:58:26Z","title_canon_sha256":"41d401f2fc13c126f3615967a5054e8f56318239a42653aab0ea10e1a8faf309"},"schema_version":"1.0","source":{"id":"1405.7085","kind":"arxiv","version":2}},"canonical_sha256":"16d97611626aca9d9892f43d30e2083338b6a2a4bc7d32f51f77b8506dbb71a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16d97611626aca9d9892f43d30e2083338b6a2a4bc7d32f51f77b8506dbb71a6","first_computed_at":"2026-05-18T02:39:48.163801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:48.163801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FMZn/rIwZIMdhKoxmXsXpcJfHtqXR5QDWqK9TnxYmYEA684gId6dhsSa1QJBC/xPWAhobNIUw2h3qryA74SzCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:48.164459Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7085","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0428d481959588306d7a67816e8544348f7bb9260b2136ac80702664b81f484e","sha256:170217ecc463c7da8dda31b6e6d9022755594a6ffb1cca6915769bb1fc68ba6e"],"state_sha256":"51aa010257efb829502f6a253e14ffd8d9dab5fdaeffc325eeb4634f2fd3a743"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kDmd6qu9j5MG8wlmbz6RrEqR4CcCGlYhKMQmmEweue2hGMvzgvsC3bGIH7fZ2Z+vY9UYRs/Lau7k/tlI3K06Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:36:13.820383Z","bundle_sha256":"38d2f38e491217d02a5d8f3392a1e0b0b152a5ed425fcb367c4b8b6358c5a515"}}