{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SOUKRNHVCJGLW3GYK4W26YI7UQ","short_pith_number":"pith:SOUKRNHV","canonical_record":{"source":{"id":"1703.09947","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-29T09:31:47Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"925516dc3f9649ff40672682be3322d5fda01ddb9f7602ca6e4e5462186c6b95","abstract_canon_sha256":"22a237c6d585027471a3207be5142b3e63fdcd7be6bee48cdfca105932d8faa1"},"schema_version":"1.0"},"canonical_sha256":"93a8a8b4f5124cbb6cd8572daf611fa434252815ccbc827006d7bed26605af4f","source":{"kind":"arxiv","id":"1703.09947","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09947","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09947v2","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09947","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"SOUKRNHVCJGL","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SOUKRNHVCJGLW3GY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SOUKRNHV","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SOUKRNHVCJGLW3GYK4W26YI7UQ","target":"record","payload":{"canonical_record":{"source":{"id":"1703.09947","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-29T09:31:47Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"925516dc3f9649ff40672682be3322d5fda01ddb9f7602ca6e4e5462186c6b95","abstract_canon_sha256":"22a237c6d585027471a3207be5142b3e63fdcd7be6bee48cdfca105932d8faa1"},"schema_version":"1.0"},"canonical_sha256":"93a8a8b4f5124cbb6cd8572daf611fa434252815ccbc827006d7bed26605af4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:44.904076Z","signature_b64":"lL1y7ZUpkTU91gwiiC7+grlAnT5V9cvyiUYzPmPzxWycBqA24gzh+E+Sw4hppnd5kRAhl5XvnwLp+v23F2raCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93a8a8b4f5124cbb6cd8572daf611fa434252815ccbc827006d7bed26605af4f","last_reissued_at":"2026-05-18T00:43:44.903526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:44.903526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.09947","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-18T00:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P153HNF+T/LAJFMycmyR4CIlUcedbkWR6eoueZ1RMWNnvSywW7VnczCJwyAKW3dgn6o5UV/hpp2QgQ+Yjl/SCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:30:08.141224Z"},"content_sha256":"781ceb8f455a8bfbde4c412429214dad6b13102a9e00fd28aea5807cc310b28f","schema_version":"1.0","event_id":"sha256:781ceb8f455a8bfbde4c412429214dad6b13102a9e00fd28aea5807cc310b28f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SOUKRNHVCJGLW3GYK4W26YI7UQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Private ERM for Smooth Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiaqi Zhang, Kai Zheng, Liwei Wang, Wenlong Mou","submitted_at":"2017-03-29T09:31:47Z","abstract_excerpt":"In this paper, we consider efficient differentially private empirical risk minimization from the viewpoint of optimization algorithms. For strongly convex and smooth objectives, we prove that gradient descent with output perturbation not only achieves nearly optimal utility, but also significantly improves the running time of previous state-of-the-art private optimization algorithms, for both $\\epsilon$-DP and $(\\epsilon, \\delta)$-DP. For non-convex but smooth objectives, we propose an RRPSGD (Random Round Private Stochastic Gradient Descent) algorithm, which provably converges to a stationary"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09947","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-18T00:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6rTOkIT/s56T5cFs1u4QxmLbtRVTyP4u/aSsQxp2ixfofIOXZxzC2P4PhcKxDwyagNjSpgeagOS2wnTgWPk8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:30:08.141591Z"},"content_sha256":"b280dcd85e042a2361488d2b9a45b2d4a15d40e96594773e62d69f16916e2bdc","schema_version":"1.0","event_id":"sha256:b280dcd85e042a2361488d2b9a45b2d4a15d40e96594773e62d69f16916e2bdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOUKRNHVCJGLW3GYK4W26YI7UQ/bundle.json","state_url":"https://pith.science/pith/SOUKRNHVCJGLW3GYK4W26YI7UQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOUKRNHVCJGLW3GYK4W26YI7UQ/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-21T15:30:08Z","links":{"resolver":"https://pith.science/pith/SOUKRNHVCJGLW3GYK4W26YI7UQ","bundle":"https://pith.science/pith/SOUKRNHVCJGLW3GYK4W26YI7UQ/bundle.json","state":"https://pith.science/pith/SOUKRNHVCJGLW3GYK4W26YI7UQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOUKRNHVCJGLW3GYK4W26YI7UQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SOUKRNHVCJGLW3GYK4W26YI7UQ","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":"22a237c6d585027471a3207be5142b3e63fdcd7be6bee48cdfca105932d8faa1","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-29T09:31:47Z","title_canon_sha256":"925516dc3f9649ff40672682be3322d5fda01ddb9f7602ca6e4e5462186c6b95"},"schema_version":"1.0","source":{"id":"1703.09947","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09947","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09947v2","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09947","created_at":"2026-05-18T00:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"SOUKRNHVCJGL","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SOUKRNHVCJGLW3GY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SOUKRNHV","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:b280dcd85e042a2361488d2b9a45b2d4a15d40e96594773e62d69f16916e2bdc","target":"graph","created_at":"2026-05-18T00:43:44Z","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 consider efficient differentially private empirical risk minimization from the viewpoint of optimization algorithms. For strongly convex and smooth objectives, we prove that gradient descent with output perturbation not only achieves nearly optimal utility, but also significantly improves the running time of previous state-of-the-art private optimization algorithms, for both $\\epsilon$-DP and $(\\epsilon, \\delta)$-DP. For non-convex but smooth objectives, we propose an RRPSGD (Random Round Private Stochastic Gradient Descent) algorithm, which provably converges to a stationary","authors_text":"Jiaqi Zhang, Kai Zheng, Liwei Wang, Wenlong Mou","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-29T09:31:47Z","title":"Efficient Private ERM for Smooth Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09947","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:781ceb8f455a8bfbde4c412429214dad6b13102a9e00fd28aea5807cc310b28f","target":"record","created_at":"2026-05-18T00:43:44Z","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":"22a237c6d585027471a3207be5142b3e63fdcd7be6bee48cdfca105932d8faa1","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-29T09:31:47Z","title_canon_sha256":"925516dc3f9649ff40672682be3322d5fda01ddb9f7602ca6e4e5462186c6b95"},"schema_version":"1.0","source":{"id":"1703.09947","kind":"arxiv","version":2}},"canonical_sha256":"93a8a8b4f5124cbb6cd8572daf611fa434252815ccbc827006d7bed26605af4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93a8a8b4f5124cbb6cd8572daf611fa434252815ccbc827006d7bed26605af4f","first_computed_at":"2026-05-18T00:43:44.903526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:44.903526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lL1y7ZUpkTU91gwiiC7+grlAnT5V9cvyiUYzPmPzxWycBqA24gzh+E+Sw4hppnd5kRAhl5XvnwLp+v23F2raCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:44.904076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09947","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:781ceb8f455a8bfbde4c412429214dad6b13102a9e00fd28aea5807cc310b28f","sha256:b280dcd85e042a2361488d2b9a45b2d4a15d40e96594773e62d69f16916e2bdc"],"state_sha256":"1c00d8065509eb292dcb44db35c2096ceecceb6f7b1bbe6d15fa5d7aecafb795"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDQHSH0Rk1mxVV1y6sLIi8pmoH/GDB7+3/aWZjn1gKjUScNYx2I5fSBOJ0HACF5fszxaYLDdfcnSLOXpwgzXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T15:30:08.143768Z","bundle_sha256":"90e74e1f0e48bc24289fe0e95290f12e17a9166ada48215bc114b4f27f44ed20"}}