{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HRZPNY3DLU7MJ3NB22VH7HRQQG","short_pith_number":"pith:HRZPNY3D","canonical_record":{"source":{"id":"1506.07512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-24T19:53:45Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"f69192872e1a3aef81fa7b7d56f6100be9671cb7f33c6fcee4e07195f41356b0","abstract_canon_sha256":"9953d27555fe3153730f7231bfc4bae22b32912fd144c2ce350ebf1b350bae56"},"schema_version":"1.0"},"canonical_sha256":"3c72f6e3635d3ec4eda1d6aa7f9e3081b8c53ed7983c374f7d4dbfa06f00ad73","source":{"kind":"arxiv","id":"1506.07512","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07512","created_at":"2026-05-18T01:39:53Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07512v1","created_at":"2026-05-18T01:39:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07512","created_at":"2026-05-18T01:39:53Z"},{"alias_kind":"pith_short_12","alias_value":"HRZPNY3DLU7M","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HRZPNY3DLU7MJ3NB","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HRZPNY3D","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HRZPNY3DLU7MJ3NB22VH7HRQQG","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-24T19:53:45Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"f69192872e1a3aef81fa7b7d56f6100be9671cb7f33c6fcee4e07195f41356b0","abstract_canon_sha256":"9953d27555fe3153730f7231bfc4bae22b32912fd144c2ce350ebf1b350bae56"},"schema_version":"1.0"},"canonical_sha256":"3c72f6e3635d3ec4eda1d6aa7f9e3081b8c53ed7983c374f7d4dbfa06f00ad73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:53.854800Z","signature_b64":"oEoq1IZwqBSMRSMiWUbTi6dx2kgY5NucRk0Wt1TJB4eD9NOMnsXTkOKyB+fVzj4QLoXo77PQyhRC4NH6ZvqRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c72f6e3635d3ec4eda1d6aa7f9e3081b8c53ed7983c374f7d4dbfa06f00ad73","last_reissued_at":"2026-05-18T01:39:53.854285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:53.854285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07512","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-18T01:39:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFHkKgKgMzOyh2g9iO8euid8ogP2Y7gFJAPDavYiNxgx1NgE+ywRULjyimgd0/SSshfXJ6pdjpm+skPqnT1yBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:42:01.245867Z"},"content_sha256":"2853325a97d6e5ee0defd189f78672cf0c7ff9d30c8e0398930fca23615c6f40","schema_version":"1.0","event_id":"sha256:2853325a97d6e5ee0defd189f78672cf0c7ff9d30c8e0398930fca23615c6f40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HRZPNY3DLU7MJ3NB22VH7HRQQG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Aaron Sidford, Rong Ge, Roy Frostig, Sham M. Kakade","submitted_at":"2015-06-24T19:53:45Z","abstract_excerpt":"We develop a family of accelerated stochastic algorithms that minimize sums of convex functions. Our algorithms improve upon the fastest running time for empirical risk minimization (ERM), and in particular linear least-squares regression, across a wide range of problem settings. To achieve this, we establish a framework based on the classical proximal point algorithm. Namely, we provide several algorithms that reduce the minimization of a strongly convex function to approximate minimizations of regularizations of the function. Using these results, we accelerate recent fast stochastic algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07512","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-18T01:39:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZTr9Hm3J2jQYWMkl8Dd8IxqB4+r/UR1I1NsfFVMeizm6rMhtxEXM9wrQQp5d4N3odVEjvFgR/EC39gzJVGizBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:42:01.246511Z"},"content_sha256":"0f4a588f2162fd8c813be476ad423fac932f0a5ae1b2e4ff08449dd2b98ebe75","schema_version":"1.0","event_id":"sha256:0f4a588f2162fd8c813be476ad423fac932f0a5ae1b2e4ff08449dd2b98ebe75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRZPNY3DLU7MJ3NB22VH7HRQQG/bundle.json","state_url":"https://pith.science/pith/HRZPNY3DLU7MJ3NB22VH7HRQQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRZPNY3DLU7MJ3NB22VH7HRQQG/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-25T23:42:01Z","links":{"resolver":"https://pith.science/pith/HRZPNY3DLU7MJ3NB22VH7HRQQG","bundle":"https://pith.science/pith/HRZPNY3DLU7MJ3NB22VH7HRQQG/bundle.json","state":"https://pith.science/pith/HRZPNY3DLU7MJ3NB22VH7HRQQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRZPNY3DLU7MJ3NB22VH7HRQQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HRZPNY3DLU7MJ3NB22VH7HRQQG","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":"9953d27555fe3153730f7231bfc4bae22b32912fd144c2ce350ebf1b350bae56","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-24T19:53:45Z","title_canon_sha256":"f69192872e1a3aef81fa7b7d56f6100be9671cb7f33c6fcee4e07195f41356b0"},"schema_version":"1.0","source":{"id":"1506.07512","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07512","created_at":"2026-05-18T01:39:53Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07512v1","created_at":"2026-05-18T01:39:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07512","created_at":"2026-05-18T01:39:53Z"},{"alias_kind":"pith_short_12","alias_value":"HRZPNY3DLU7M","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HRZPNY3DLU7MJ3NB","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HRZPNY3D","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:0f4a588f2162fd8c813be476ad423fac932f0a5ae1b2e4ff08449dd2b98ebe75","target":"graph","created_at":"2026-05-18T01:39: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 develop a family of accelerated stochastic algorithms that minimize sums of convex functions. Our algorithms improve upon the fastest running time for empirical risk minimization (ERM), and in particular linear least-squares regression, across a wide range of problem settings. To achieve this, we establish a framework based on the classical proximal point algorithm. Namely, we provide several algorithms that reduce the minimization of a strongly convex function to approximate minimizations of regularizations of the function. Using these results, we accelerate recent fast stochastic algorith","authors_text":"Aaron Sidford, Rong Ge, Roy Frostig, Sham M. Kakade","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-24T19:53:45Z","title":"Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07512","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:2853325a97d6e5ee0defd189f78672cf0c7ff9d30c8e0398930fca23615c6f40","target":"record","created_at":"2026-05-18T01:39: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":"9953d27555fe3153730f7231bfc4bae22b32912fd144c2ce350ebf1b350bae56","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-24T19:53:45Z","title_canon_sha256":"f69192872e1a3aef81fa7b7d56f6100be9671cb7f33c6fcee4e07195f41356b0"},"schema_version":"1.0","source":{"id":"1506.07512","kind":"arxiv","version":1}},"canonical_sha256":"3c72f6e3635d3ec4eda1d6aa7f9e3081b8c53ed7983c374f7d4dbfa06f00ad73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c72f6e3635d3ec4eda1d6aa7f9e3081b8c53ed7983c374f7d4dbfa06f00ad73","first_computed_at":"2026-05-18T01:39:53.854285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:39:53.854285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oEoq1IZwqBSMRSMiWUbTi6dx2kgY5NucRk0Wt1TJB4eD9NOMnsXTkOKyB+fVzj4QLoXo77PQyhRC4NH6ZvqRBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:39:53.854800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07512","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2853325a97d6e5ee0defd189f78672cf0c7ff9d30c8e0398930fca23615c6f40","sha256:0f4a588f2162fd8c813be476ad423fac932f0a5ae1b2e4ff08449dd2b98ebe75"],"state_sha256":"b5a482e89b6e6506ee1f498767b821494bd8bdf544dd2f24e71dd6dfdaa154f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7mNAgss+mOLb8hYVBuxmvJDHOmMZDArynfz+HPacmiXO60eui92WI8Gk3yGF1C4H2Y/5vNuWFj7jMWi5EwwwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:42:01.249284Z","bundle_sha256":"d87931f2912648b09b1547a37954be18ed22717ee8ac3d56ac43207c68e18cec"}}