{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C75XNKVP4W2TBII5ZBYHYSIDND","short_pith_number":"pith:C75XNKVP","schema_version":"1.0","canonical_sha256":"17fb76aaafe5b530a11dc8707c490368e3595f394bb8cbe78b355b7db619ee15","source":{"kind":"arxiv","id":"1611.00347","version":2},"attestation_state":"computed","paper":{"title":"Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Aryan Mokhtari, Mert G\\\"urb\\\"uzbalaban","submitted_at":"2016-11-01T19:40:33Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1611.00347","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-01T19:40:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c876bf160f422cb7b1ff2ec566af7ece21d452b6c4bb4e37c4d0686b66fbcabe","abstract_canon_sha256":"37ef75465013c1da932ea7652030424fd6e95f429f51a224f3268e45abe7c695"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:04.587915Z","signature_b64":"tUYMxpfTILE2yNFMHlvrA7o1Ujw4BL+4Ff+lAK/HKFmTEu9Axt73bb2a5oCUMD6SUFtmY0NEzk+eEJ2K46NZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17fb76aaafe5b530a11dc8707c490368e3595f394bb8cbe78b355b7db619ee15","last_reissued_at":"2026-05-18T00:24:04.587524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:04.587524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Aryan Mokhtari, Mert G\\\"urb\\\"uzbalaban","submitted_at":"2016-11-01T19:40:33Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00347","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.00347","created_at":"2026-05-18T00:24:04.587586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00347v2","created_at":"2026-05-18T00:24:04.587586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00347","created_at":"2026-05-18T00:24:04.587586+00:00"},{"alias_kind":"pith_short_12","alias_value":"C75XNKVP4W2T","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C75XNKVP4W2TBII5","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C75XNKVP","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C75XNKVP4W2TBII5ZBYHYSIDND","json":"https://pith.science/pith/C75XNKVP4W2TBII5ZBYHYSIDND.json","graph_json":"https://pith.science/api/pith-number/C75XNKVP4W2TBII5ZBYHYSIDND/graph.json","events_json":"https://pith.science/api/pith-number/C75XNKVP4W2TBII5ZBYHYSIDND/events.json","paper":"https://pith.science/paper/C75XNKVP"},"agent_actions":{"view_html":"https://pith.science/pith/C75XNKVP4W2TBII5ZBYHYSIDND","download_json":"https://pith.science/pith/C75XNKVP4W2TBII5ZBYHYSIDND.json","view_paper":"https://pith.science/paper/C75XNKVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00347&json=true","fetch_graph":"https://pith.science/api/pith-number/C75XNKVP4W2TBII5ZBYHYSIDND/graph.json","fetch_events":"https://pith.science/api/pith-number/C75XNKVP4W2TBII5ZBYHYSIDND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C75XNKVP4W2TBII5ZBYHYSIDND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C75XNKVP4W2TBII5ZBYHYSIDND/action/storage_attestation","attest_author":"https://pith.science/pith/C75XNKVP4W2TBII5ZBYHYSIDND/action/author_attestation","sign_citation":"https://pith.science/pith/C75XNKVP4W2TBII5ZBYHYSIDND/action/citation_signature","submit_replication":"https://pith.science/pith/C75XNKVP4W2TBII5ZBYHYSIDND/action/replication_record"}},"created_at":"2026-05-18T00:24:04.587586+00:00","updated_at":"2026-05-18T00:24:04.587586+00:00"}