{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NNRRANJ3YJU3LYAB3QHSBKB232","short_pith_number":"pith:NNRRANJ3","canonical_record":{"source":{"id":"1805.05189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-11T04:05:34Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"0546c858ef332ca1802ce92048bb481e2d73a1965995cef1a3c8e2f22925de81","abstract_canon_sha256":"e20e39b3de4f88f01c9c5b355a71fceb76fbb06e48e9b510ecc0e7f2d4b1e0d1"},"schema_version":"1.0"},"canonical_sha256":"6b6310353bc269b5e001dc0f20a83adeb1b0dae63ffac14121304d7561e76d5a","source":{"kind":"arxiv","id":"1805.05189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05189","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05189v1","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05189","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"NNRRANJ3YJU3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NNRRANJ3YJU3LYAB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NNRRANJ3","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NNRRANJ3YJU3LYAB3QHSBKB232","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-11T04:05:34Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"0546c858ef332ca1802ce92048bb481e2d73a1965995cef1a3c8e2f22925de81","abstract_canon_sha256":"e20e39b3de4f88f01c9c5b355a71fceb76fbb06e48e9b510ecc0e7f2d4b1e0d1"},"schema_version":"1.0"},"canonical_sha256":"6b6310353bc269b5e001dc0f20a83adeb1b0dae63ffac14121304d7561e76d5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:41.507989Z","signature_b64":"6dx9/e32QPhC6UpbVxfVw74JZjjNR/zcmxOS7QtCHV4MoObM1vAhJi3Ijw/sXku5nW2/2F6tJmj9IXk1w2D5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b6310353bc269b5e001dc0f20a83adeb1b0dae63ffac14121304d7561e76d5a","last_reissued_at":"2026-05-18T00:15:41.507359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:41.507359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05189","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-18T00:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Imf6A9xXT3h7EJX47N8N5P9GQ2fJ7GweaEFlzIQ1F6RVAVsB/ElpxmUNXRWJurax3/BtzQBO9MGUkiqx5TZoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T11:09:32.491644Z"},"content_sha256":"91269f99641e7d0626c88777b7780b8a5b2d8b788a6f664f555d67eb1a600ce7","schema_version":"1.0","event_id":"sha256:91269f99641e7d0626c88777b7780b8a5b2d8b788a6f664f555d67eb1a600ce7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NNRRANJ3YJU3LYAB3QHSBKB232","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Smoothing SVRG for Large-scale Nonsmooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Wenjie Huang","submitted_at":"2018-05-11T04:05:34Z","abstract_excerpt":"In this paper, we consider the problem of minimizing the average of a large number of nonsmooth and convex functions. Such problems often arise in typical machine learning problems as empirical risk minimization, but are computationally very challenging. We develop and analyze a new algorithm that achieves robust linear convergence rate, and both its time complexity and gradient complexity are superior than state-of-art nonsmooth algorithms and subgradient-based schemes. Besides, our algorithm works without any extra error bound conditions on the objective function as well as the common strong"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05189","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-18T00:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7R/U9qYbQu3GTCG9x18JdDTLAqp+m6cpAM/MznaT+oZ/Ru/Qq1qHXoGn2lys5c/ERacBC5sEyBtgm5R7CF4EAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T11:09:32.492015Z"},"content_sha256":"7fd380126aca995c92d63dfa31553a90d5c72e31a6d1aec8b8dea30a5781032d","schema_version":"1.0","event_id":"sha256:7fd380126aca995c92d63dfa31553a90d5c72e31a6d1aec8b8dea30a5781032d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232/bundle.json","state_url":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNRRANJ3YJU3LYAB3QHSBKB232/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-07-01T11:09:32Z","links":{"resolver":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232","bundle":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232/bundle.json","state":"https://pith.science/pith/NNRRANJ3YJU3LYAB3QHSBKB232/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNRRANJ3YJU3LYAB3QHSBKB232/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NNRRANJ3YJU3LYAB3QHSBKB232","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":"e20e39b3de4f88f01c9c5b355a71fceb76fbb06e48e9b510ecc0e7f2d4b1e0d1","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-11T04:05:34Z","title_canon_sha256":"0546c858ef332ca1802ce92048bb481e2d73a1965995cef1a3c8e2f22925de81"},"schema_version":"1.0","source":{"id":"1805.05189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05189","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05189v1","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05189","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"NNRRANJ3YJU3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NNRRANJ3YJU3LYAB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NNRRANJ3","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:7fd380126aca995c92d63dfa31553a90d5c72e31a6d1aec8b8dea30a5781032d","target":"graph","created_at":"2026-05-18T00:15:41Z","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 the problem of minimizing the average of a large number of nonsmooth and convex functions. Such problems often arise in typical machine learning problems as empirical risk minimization, but are computationally very challenging. We develop and analyze a new algorithm that achieves robust linear convergence rate, and both its time complexity and gradient complexity are superior than state-of-art nonsmooth algorithms and subgradient-based schemes. Besides, our algorithm works without any extra error bound conditions on the objective function as well as the common strong","authors_text":"Wenjie Huang","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-11T04:05:34Z","title":"Randomized Smoothing SVRG for Large-scale Nonsmooth Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05189","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:91269f99641e7d0626c88777b7780b8a5b2d8b788a6f664f555d67eb1a600ce7","target":"record","created_at":"2026-05-18T00:15:41Z","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":"e20e39b3de4f88f01c9c5b355a71fceb76fbb06e48e9b510ecc0e7f2d4b1e0d1","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-11T04:05:34Z","title_canon_sha256":"0546c858ef332ca1802ce92048bb481e2d73a1965995cef1a3c8e2f22925de81"},"schema_version":"1.0","source":{"id":"1805.05189","kind":"arxiv","version":1}},"canonical_sha256":"6b6310353bc269b5e001dc0f20a83adeb1b0dae63ffac14121304d7561e76d5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b6310353bc269b5e001dc0f20a83adeb1b0dae63ffac14121304d7561e76d5a","first_computed_at":"2026-05-18T00:15:41.507359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:41.507359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6dx9/e32QPhC6UpbVxfVw74JZjjNR/zcmxOS7QtCHV4MoObM1vAhJi3Ijw/sXku5nW2/2F6tJmj9IXk1w2D5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:41.507989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91269f99641e7d0626c88777b7780b8a5b2d8b788a6f664f555d67eb1a600ce7","sha256:7fd380126aca995c92d63dfa31553a90d5c72e31a6d1aec8b8dea30a5781032d"],"state_sha256":"fbee7cc5b4346ce7c137103ea5cef16c29c55a74df9911bba0bd3741d5d4bf38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZvULG6PjdvBwOW0WfZEIshG/rodXcD/oKtCHKQhCyHDwjtsDbQFJqESuJUTTZd7Zxfo4IOkM5KwErX+XwlHcBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T11:09:32.494262Z","bundle_sha256":"bbfdb60c9654c4add1a78d85a3517663874f84d9968c9ab6518bc35029c2ff38"}}