{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C75XNKVP4W2TBII5ZBYHYSIDND","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":"37ef75465013c1da932ea7652030424fd6e95f429f51a224f3268e45abe7c695","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-01T19:40:33Z","title_canon_sha256":"c876bf160f422cb7b1ff2ec566af7ece21d452b6c4bb4e37c4d0686b66fbcabe"},"schema_version":"1.0","source":{"id":"1611.00347","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00347","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00347v2","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00347","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"C75XNKVP4W2T","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C75XNKVP4W2TBII5","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C75XNKVP","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:9ba929f962078b9a26e9dc44cab12ab33105a5e48f419da23bb26fd5b2451cef","target":"graph","created_at":"2026-05-18T00:24: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":"Recently, there has been growing interest in developing optimization methods for solving large-scale machine learning problems. Most of these problems boil down to the problem of minimizing an average of a finite set of smooth and strongly convex functions where the number of functions $n$ is large. Gradient descent method (GD) is successful in minimizing convex problems at a fast linear rate; however, it is not applicable to the considered large-scale optimization setting because of the high computational complexity. Incremental methods resolve this drawback of gradient methods by replacing t","authors_text":"Alejandro Ribeiro, Aryan Mokhtari, Mert G\\\"urb\\\"uzbalaban","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-01T19:40:33Z","title":"Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00347","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:9b232ad876827d4883db84e81c9476d4fc7ad9e126839fe3bf547f581bbba1c7","target":"record","created_at":"2026-05-18T00:24: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":"37ef75465013c1da932ea7652030424fd6e95f429f51a224f3268e45abe7c695","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-01T19:40:33Z","title_canon_sha256":"c876bf160f422cb7b1ff2ec566af7ece21d452b6c4bb4e37c4d0686b66fbcabe"},"schema_version":"1.0","source":{"id":"1611.00347","kind":"arxiv","version":2}},"canonical_sha256":"17fb76aaafe5b530a11dc8707c490368e3595f394bb8cbe78b355b7db619ee15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17fb76aaafe5b530a11dc8707c490368e3595f394bb8cbe78b355b7db619ee15","first_computed_at":"2026-05-18T00:24:04.587524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:04.587524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tUYMxpfTILE2yNFMHlvrA7o1Ujw4BL+4Ff+lAK/HKFmTEu9Axt73bb2a5oCUMD6SUFtmY0NEzk+eEJ2K46NZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:04.587915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00347","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b232ad876827d4883db84e81c9476d4fc7ad9e126839fe3bf547f581bbba1c7","sha256:9ba929f962078b9a26e9dc44cab12ab33105a5e48f419da23bb26fd5b2451cef"],"state_sha256":"b37f1d524fdb018db2f8c579c5e7d0c3f8829ed8811fae59e049b381e6ca1c5c"}