{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4ALTJVN7VRJY455CF5UUCGSZ73","short_pith_number":"pith:4ALTJVN7","canonical_record":{"source":{"id":"1603.06159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-19T23:28:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"82b252e89724a67ea4ac3ba87febfc2f4dd602767bb409b44a1e0bf066d281f5","abstract_canon_sha256":"fb99d45eaf3cfa2e840e1b269214203265601d469423bb4f65da374c39bdcfe0"},"schema_version":"1.0"},"canonical_sha256":"e01734d5bfac538e77a22f69411a59fee74d70aff2b6c72e3f2021cd4ff0314f","source":{"kind":"arxiv","id":"1603.06159","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06159","created_at":"2026-05-18T01:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06159v1","created_at":"2026-05-18T01:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06159","created_at":"2026-05-18T01:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"4ALTJVN7VRJY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4ALTJVN7VRJY455C","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4ALTJVN7","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4ALTJVN7VRJY455CF5UUCGSZ73","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-19T23:28:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"82b252e89724a67ea4ac3ba87febfc2f4dd602767bb409b44a1e0bf066d281f5","abstract_canon_sha256":"fb99d45eaf3cfa2e840e1b269214203265601d469423bb4f65da374c39bdcfe0"},"schema_version":"1.0"},"canonical_sha256":"e01734d5bfac538e77a22f69411a59fee74d70aff2b6c72e3f2021cd4ff0314f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:50.162597Z","signature_b64":"rMehbBCjTHSgeJ3tbsDKPRJA9109cyOqsucYwTKMZ7hUkwWYbkexvd4g9BL4/HnKKR/fkrVPswYtk0DofRr3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e01734d5bfac538e77a22f69411a59fee74d70aff2b6c72e3f2021cd4ff0314f","last_reissued_at":"2026-05-18T01:18:50.161932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:50.161932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06159","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:18:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4wcSrW5x6xdSW7xiGPPLQATR6PW2pirK7iw9HAHi7kJdma3rabXl95z4SrNJe62FD1tTbkFTrebPNnHeUflAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:10:11.424704Z"},"content_sha256":"e4a26e939dce9cba670f4ae6d8cd80e134b4ac27051e023f4d4f9ff670b055cf","schema_version":"1.0","event_id":"sha256:e4a26e939dce9cba670f4ae6d8cd80e134b4ac27051e023f4d4f9ff670b055cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4ALTJVN7VRJY455CF5UUCGSZ73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Incremental Method for Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Alex Smola, Barnabas Poczos, Sashank J. Reddi, Suvrit Sra","submitted_at":"2016-03-19T23:28:44Z","abstract_excerpt":"We analyze a fast incremental aggregated gradient method for optimizing nonconvex problems of the form $\\min_x \\sum_i f_i(x)$. Specifically, we analyze the SAGA algorithm within an Incremental First-order Oracle framework, and show that it converges to a stationary point provably faster than both gradient descent and stochastic gradient descent. We also discuss a Polyak's special class of nonconvex problems for which SAGA converges at a linear rate to the global optimum. Finally, we analyze the practically valuable regularized and minibatch variants of SAGA. To our knowledge, this paper presen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06159","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:18:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RKVOFaVgOqbOcXu8c1yPN5Q1z1cwgQuZ2G4D74TvB1BMmrfzg9378AJdxgmmqCZp9u2yTzmuaMTPknqAiD7JDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:10:11.425093Z"},"content_sha256":"0d27bd6fbb05fe8f25e7c4b739278d38c06e1e0ec1a938540823bb9de16d80f0","schema_version":"1.0","event_id":"sha256:0d27bd6fbb05fe8f25e7c4b739278d38c06e1e0ec1a938540823bb9de16d80f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ALTJVN7VRJY455CF5UUCGSZ73/bundle.json","state_url":"https://pith.science/pith/4ALTJVN7VRJY455CF5UUCGSZ73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ALTJVN7VRJY455CF5UUCGSZ73/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-25T11:10:11Z","links":{"resolver":"https://pith.science/pith/4ALTJVN7VRJY455CF5UUCGSZ73","bundle":"https://pith.science/pith/4ALTJVN7VRJY455CF5UUCGSZ73/bundle.json","state":"https://pith.science/pith/4ALTJVN7VRJY455CF5UUCGSZ73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ALTJVN7VRJY455CF5UUCGSZ73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4ALTJVN7VRJY455CF5UUCGSZ73","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":"fb99d45eaf3cfa2e840e1b269214203265601d469423bb4f65da374c39bdcfe0","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-19T23:28:44Z","title_canon_sha256":"82b252e89724a67ea4ac3ba87febfc2f4dd602767bb409b44a1e0bf066d281f5"},"schema_version":"1.0","source":{"id":"1603.06159","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06159","created_at":"2026-05-18T01:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06159v1","created_at":"2026-05-18T01:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06159","created_at":"2026-05-18T01:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"4ALTJVN7VRJY","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4ALTJVN7VRJY455C","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4ALTJVN7","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:0d27bd6fbb05fe8f25e7c4b739278d38c06e1e0ec1a938540823bb9de16d80f0","target":"graph","created_at":"2026-05-18T01:18:50Z","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 analyze a fast incremental aggregated gradient method for optimizing nonconvex problems of the form $\\min_x \\sum_i f_i(x)$. Specifically, we analyze the SAGA algorithm within an Incremental First-order Oracle framework, and show that it converges to a stationary point provably faster than both gradient descent and stochastic gradient descent. We also discuss a Polyak's special class of nonconvex problems for which SAGA converges at a linear rate to the global optimum. Finally, we analyze the practically valuable regularized and minibatch variants of SAGA. To our knowledge, this paper presen","authors_text":"Alex Smola, Barnabas Poczos, Sashank J. Reddi, Suvrit Sra","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-19T23:28:44Z","title":"Fast Incremental Method for Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06159","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:e4a26e939dce9cba670f4ae6d8cd80e134b4ac27051e023f4d4f9ff670b055cf","target":"record","created_at":"2026-05-18T01:18:50Z","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":"fb99d45eaf3cfa2e840e1b269214203265601d469423bb4f65da374c39bdcfe0","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-19T23:28:44Z","title_canon_sha256":"82b252e89724a67ea4ac3ba87febfc2f4dd602767bb409b44a1e0bf066d281f5"},"schema_version":"1.0","source":{"id":"1603.06159","kind":"arxiv","version":1}},"canonical_sha256":"e01734d5bfac538e77a22f69411a59fee74d70aff2b6c72e3f2021cd4ff0314f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e01734d5bfac538e77a22f69411a59fee74d70aff2b6c72e3f2021cd4ff0314f","first_computed_at":"2026-05-18T01:18:50.161932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:50.161932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rMehbBCjTHSgeJ3tbsDKPRJA9109cyOqsucYwTKMZ7hUkwWYbkexvd4g9BL4/HnKKR/fkrVPswYtk0DofRr3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:50.162597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06159","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4a26e939dce9cba670f4ae6d8cd80e134b4ac27051e023f4d4f9ff670b055cf","sha256:0d27bd6fbb05fe8f25e7c4b739278d38c06e1e0ec1a938540823bb9de16d80f0"],"state_sha256":"e046acc844100c0126cf53ac5feff9b355dd006609c3fd59f1f460c809681928"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TCvErlqvVVupBQLI0WP1kZ5jCv75ziMSyrjY9B8blUTZ7dPK58lj0XTzyAwq/fBz7po3nmYyDkosyDi0js3rBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:10:11.427972Z","bundle_sha256":"79103d605a14bda3195b94f5aeded0efa3e8d1db85fc3687134ce709045fba79"}}