{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:43Q2E2SCME7MHVAFYHE4PSQU3W","short_pith_number":"pith:43Q2E2SC","canonical_record":{"source":{"id":"1506.02186","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-06T19:49:48Z","cross_cats_sorted":[],"title_canon_sha256":"03bf3a61670d3357d750af462697bd3adc043162391195f03d7bfa6d20cf03e5","abstract_canon_sha256":"d4f446bef75b9108192f35e18db0e8fbf17aadba2d569561f330b90b1350991a"},"schema_version":"1.0"},"canonical_sha256":"e6e1a26a42613ec3d405c1c9c7ca14ddb72cbbbced92aa958dd2dee4c286f7e2","source":{"kind":"arxiv","id":"1506.02186","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02186","created_at":"2026-05-18T01:29:20Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02186v2","created_at":"2026-05-18T01:29:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02186","created_at":"2026-05-18T01:29:20Z"},{"alias_kind":"pith_short_12","alias_value":"43Q2E2SCME7M","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"43Q2E2SCME7MHVAF","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"43Q2E2SC","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:43Q2E2SCME7MHVAFYHE4PSQU3W","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02186","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-06T19:49:48Z","cross_cats_sorted":[],"title_canon_sha256":"03bf3a61670d3357d750af462697bd3adc043162391195f03d7bfa6d20cf03e5","abstract_canon_sha256":"d4f446bef75b9108192f35e18db0e8fbf17aadba2d569561f330b90b1350991a"},"schema_version":"1.0"},"canonical_sha256":"e6e1a26a42613ec3d405c1c9c7ca14ddb72cbbbced92aa958dd2dee4c286f7e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:20.871654Z","signature_b64":"Z09DympKcKg09MrzdwZ0l5liRq6mEfur+X5LrfCsyk2vH9RNrS2+ijWs2aiK8ICxlf2FXLdEBNMcF5nzDAOJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6e1a26a42613ec3d405c1c9c7ca14ddb72cbbbced92aa958dd2dee4c286f7e2","last_reissued_at":"2026-05-18T01:29:20.871015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:20.871015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02186","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-18T01:29:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXUUYFWhrratFmxMxwxmPTqNnOBbJitB2gc7zTV3U9XyETxeQxR32Oo+SDwaHP+IaqmK8riMVS8ePLZu7TAdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:31:09.174538Z"},"content_sha256":"50cefcc61ef7f2267178f6e6612fb26200367305eedb294fc9c404fd7852a14b","schema_version":"1.0","event_id":"sha256:50cefcc61ef7f2267178f6e6612fb26200367305eedb294fc9c404fd7852a14b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:43Q2E2SCME7MHVAFYHE4PSQU3W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Universal Catalyst for First-Order Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongzhou Lin, Julien Mairal, Zaid Harchaoui","submitted_at":"2015-06-06T19:49:48Z","abstract_excerpt":"We introduce a generic scheme for accelerating first-order optimization methods in the sense of Nesterov, which builds upon a new analysis of the accelerated proximal point algorithm. Our approach consists of minimizing a convex objective by approximately solving a sequence of well-chosen auxiliary problems, leading to faster convergence. This strategy applies to a large class of algorithms, including gradient descent, block coordinate descent, SAG, SAGA, SDCA, SVRG, Finito/MISO, and their proximal variants. For all of these methods, we provide acceleration and explicit support for non-strongl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02186","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-18T01:29:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhsW7QayzUWiTYT8aYCKVnse7MxgZ0hJ44xurjZ/j//v1r1WmreUn6pnhJrGv0wXnKIOEg5YXBF5TutvKvL0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:31:09.174914Z"},"content_sha256":"4f2af5f496dab0e9de1f5845a5501879176dad2e1ce8ee57b727c3e58331bf60","schema_version":"1.0","event_id":"sha256:4f2af5f496dab0e9de1f5845a5501879176dad2e1ce8ee57b727c3e58331bf60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43Q2E2SCME7MHVAFYHE4PSQU3W/bundle.json","state_url":"https://pith.science/pith/43Q2E2SCME7MHVAFYHE4PSQU3W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43Q2E2SCME7MHVAFYHE4PSQU3W/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-25T03:31:09Z","links":{"resolver":"https://pith.science/pith/43Q2E2SCME7MHVAFYHE4PSQU3W","bundle":"https://pith.science/pith/43Q2E2SCME7MHVAFYHE4PSQU3W/bundle.json","state":"https://pith.science/pith/43Q2E2SCME7MHVAFYHE4PSQU3W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43Q2E2SCME7MHVAFYHE4PSQU3W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:43Q2E2SCME7MHVAFYHE4PSQU3W","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":"d4f446bef75b9108192f35e18db0e8fbf17aadba2d569561f330b90b1350991a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-06T19:49:48Z","title_canon_sha256":"03bf3a61670d3357d750af462697bd3adc043162391195f03d7bfa6d20cf03e5"},"schema_version":"1.0","source":{"id":"1506.02186","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02186","created_at":"2026-05-18T01:29:20Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02186v2","created_at":"2026-05-18T01:29:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02186","created_at":"2026-05-18T01:29:20Z"},{"alias_kind":"pith_short_12","alias_value":"43Q2E2SCME7M","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"43Q2E2SCME7MHVAF","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"43Q2E2SC","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:4f2af5f496dab0e9de1f5845a5501879176dad2e1ce8ee57b727c3e58331bf60","target":"graph","created_at":"2026-05-18T01:29:20Z","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 introduce a generic scheme for accelerating first-order optimization methods in the sense of Nesterov, which builds upon a new analysis of the accelerated proximal point algorithm. Our approach consists of minimizing a convex objective by approximately solving a sequence of well-chosen auxiliary problems, leading to faster convergence. This strategy applies to a large class of algorithms, including gradient descent, block coordinate descent, SAG, SAGA, SDCA, SVRG, Finito/MISO, and their proximal variants. For all of these methods, we provide acceleration and explicit support for non-strongl","authors_text":"Hongzhou Lin, Julien Mairal, Zaid Harchaoui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-06T19:49:48Z","title":"A Universal Catalyst for First-Order Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02186","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:50cefcc61ef7f2267178f6e6612fb26200367305eedb294fc9c404fd7852a14b","target":"record","created_at":"2026-05-18T01:29:20Z","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":"d4f446bef75b9108192f35e18db0e8fbf17aadba2d569561f330b90b1350991a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-06T19:49:48Z","title_canon_sha256":"03bf3a61670d3357d750af462697bd3adc043162391195f03d7bfa6d20cf03e5"},"schema_version":"1.0","source":{"id":"1506.02186","kind":"arxiv","version":2}},"canonical_sha256":"e6e1a26a42613ec3d405c1c9c7ca14ddb72cbbbced92aa958dd2dee4c286f7e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6e1a26a42613ec3d405c1c9c7ca14ddb72cbbbced92aa958dd2dee4c286f7e2","first_computed_at":"2026-05-18T01:29:20.871015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:20.871015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z09DympKcKg09MrzdwZ0l5liRq6mEfur+X5LrfCsyk2vH9RNrS2+ijWs2aiK8ICxlf2FXLdEBNMcF5nzDAOJBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:20.871654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02186","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50cefcc61ef7f2267178f6e6612fb26200367305eedb294fc9c404fd7852a14b","sha256:4f2af5f496dab0e9de1f5845a5501879176dad2e1ce8ee57b727c3e58331bf60"],"state_sha256":"0debf09760c49be112c8cad1200fc32c2a06734f28097b881474a804262e051d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FfQIli1OOtLxRRP8vqKx8lDMUFM2OyFRse47+YuBhXLOfUmg5SDclxPtgo6DjmsK9YQoZtbtZ/KPoRP3OOpgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:31:09.177200Z","bundle_sha256":"36062e6d2fb80cb7aee19f3f27d5f4e15c972280c39d202ed46d34468228601d"}}