{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SKPAMXTO4BYNXPA7EFWKJQNJ3E","short_pith_number":"pith:SKPAMXTO","canonical_record":{"source":{"id":"1403.4699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-19T06:02:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bafc6114978a51a7c3a00e86f34146c93998fada64f4fb9802b109dd8475bd98","abstract_canon_sha256":"267c95ade032d9df9df40106c0e9c2b033d5f4241450ece45ce6cf8ae539e660"},"schema_version":"1.0"},"canonical_sha256":"929e065e6ee070dbbc1f216ca4c1a9d93cf419ad19e044c8be503db9dc75469d","source":{"kind":"arxiv","id":"1403.4699","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4699","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4699v1","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4699","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"SKPAMXTO4BYN","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SKPAMXTO4BYNXPA7","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SKPAMXTO","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SKPAMXTO4BYNXPA7EFWKJQNJ3E","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-19T06:02:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bafc6114978a51a7c3a00e86f34146c93998fada64f4fb9802b109dd8475bd98","abstract_canon_sha256":"267c95ade032d9df9df40106c0e9c2b033d5f4241450ece45ce6cf8ae539e660"},"schema_version":"1.0"},"canonical_sha256":"929e065e6ee070dbbc1f216ca4c1a9d93cf419ad19e044c8be503db9dc75469d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:04.669034Z","signature_b64":"xGJ1RebwGwRoJefYKlInc/kuXbgb9KUOXkMTTWbOWrzp9maZyZ1PzFs4GVM3unQDzTi6/qJep/RxErFPZY8YAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"929e065e6ee070dbbc1f216ca4c1a9d93cf419ad19e044c8be503db9dc75469d","last_reissued_at":"2026-05-18T02:56:04.668633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:04.668633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4699","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:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p7YkRmn4YY3GK8Jzwh+58IUDoa1xBsZtLvo/wZxPrMLVhGgoLSyBScJXX4y82j2msTKTEIRtDIYiAWgmDUtqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:22:42.105037Z"},"content_sha256":"75e513ecd13bebaf078fdb88b50aae5eea9aecd792feaed126557ed82125ebfa","schema_version":"1.0","event_id":"sha256:75e513ecd13bebaf078fdb88b50aae5eea9aecd792feaed126557ed82125ebfa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SKPAMXTO4BYNXPA7EFWKJQNJ3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Proximal Stochastic Gradient Method with Progressive Variance Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Lin Xiao, Tong Zhang","submitted_at":"2014-03-19T06:02:55Z","abstract_excerpt":"We consider the problem of minimizing the sum of two convex functions: one is the average of a large number of smooth component functions, and the other is a general convex function that admits a simple proximal mapping. We assume the whole objective function is strongly convex. Such problems often arise in machine learning, known as regularized empirical risk minimization. We propose and analyze a new proximal stochastic gradient method, which uses a multi-stage scheme to progressively reduce the variance of the stochastic gradient. While each iteration of this algorithm has similar cost as t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4699","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:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qXBqb6prKz8ITUjFRxD13PudUUnUSf4bCh8ua3yxMNnNrzEQiXVHiEg1gMQGqpb+9H/hQ+5ZjTKCB4T/j0qVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:22:42.105687Z"},"content_sha256":"4012961de92a5b3b5a4e02c73ba0c5b579e93d65badd83c3af0433938788c870","schema_version":"1.0","event_id":"sha256:4012961de92a5b3b5a4e02c73ba0c5b579e93d65badd83c3af0433938788c870"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKPAMXTO4BYNXPA7EFWKJQNJ3E/bundle.json","state_url":"https://pith.science/pith/SKPAMXTO4BYNXPA7EFWKJQNJ3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKPAMXTO4BYNXPA7EFWKJQNJ3E/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-12T02:22:42Z","links":{"resolver":"https://pith.science/pith/SKPAMXTO4BYNXPA7EFWKJQNJ3E","bundle":"https://pith.science/pith/SKPAMXTO4BYNXPA7EFWKJQNJ3E/bundle.json","state":"https://pith.science/pith/SKPAMXTO4BYNXPA7EFWKJQNJ3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKPAMXTO4BYNXPA7EFWKJQNJ3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SKPAMXTO4BYNXPA7EFWKJQNJ3E","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":"267c95ade032d9df9df40106c0e9c2b033d5f4241450ece45ce6cf8ae539e660","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-19T06:02:55Z","title_canon_sha256":"bafc6114978a51a7c3a00e86f34146c93998fada64f4fb9802b109dd8475bd98"},"schema_version":"1.0","source":{"id":"1403.4699","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4699","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4699v1","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4699","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"SKPAMXTO4BYN","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SKPAMXTO4BYNXPA7","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SKPAMXTO","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:4012961de92a5b3b5a4e02c73ba0c5b579e93d65badd83c3af0433938788c870","target":"graph","created_at":"2026-05-18T02:56:04Z","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 consider the problem of minimizing the sum of two convex functions: one is the average of a large number of smooth component functions, and the other is a general convex function that admits a simple proximal mapping. We assume the whole objective function is strongly convex. Such problems often arise in machine learning, known as regularized empirical risk minimization. We propose and analyze a new proximal stochastic gradient method, which uses a multi-stage scheme to progressively reduce the variance of the stochastic gradient. While each iteration of this algorithm has similar cost as t","authors_text":"Lin Xiao, Tong Zhang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-19T06:02:55Z","title":"A Proximal Stochastic Gradient Method with Progressive Variance Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4699","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:75e513ecd13bebaf078fdb88b50aae5eea9aecd792feaed126557ed82125ebfa","target":"record","created_at":"2026-05-18T02:56:04Z","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":"267c95ade032d9df9df40106c0e9c2b033d5f4241450ece45ce6cf8ae539e660","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-19T06:02:55Z","title_canon_sha256":"bafc6114978a51a7c3a00e86f34146c93998fada64f4fb9802b109dd8475bd98"},"schema_version":"1.0","source":{"id":"1403.4699","kind":"arxiv","version":1}},"canonical_sha256":"929e065e6ee070dbbc1f216ca4c1a9d93cf419ad19e044c8be503db9dc75469d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"929e065e6ee070dbbc1f216ca4c1a9d93cf419ad19e044c8be503db9dc75469d","first_computed_at":"2026-05-18T02:56:04.668633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:04.668633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xGJ1RebwGwRoJefYKlInc/kuXbgb9KUOXkMTTWbOWrzp9maZyZ1PzFs4GVM3unQDzTi6/qJep/RxErFPZY8YAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:04.669034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4699","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75e513ecd13bebaf078fdb88b50aae5eea9aecd792feaed126557ed82125ebfa","sha256:4012961de92a5b3b5a4e02c73ba0c5b579e93d65badd83c3af0433938788c870"],"state_sha256":"8e784cb83c7c5ac1610b56f3641fa9d2933f22cc11ec269f03b597bf56b7028a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KG88g5yJrtINfKroLpbB1rJO+p1JqQxm3NcjZ/5DMVqnLNs/uyn2vc4zf5QR7pGdsmkZZCV5WDYNolgeIJTzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:22:42.109460Z","bundle_sha256":"eea22657e764ec6e3aa0215f6ca73335a74c10559d376b3132aa1f8352c88e45"}}