{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XBUNRDITI3POB5GUNKMIDXZMHD","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":"838fe2900a5d70cc865883cf50d9ed2f86ce74fe799967b995849d59fe93698b","cross_cats_sorted":["cs.LG","cs.SY","eess.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-07T21:30:42Z","title_canon_sha256":"a8e3126ba40abf753e8598a5ae5b6eb3862f696fc30c7cae1bf34f0c384c0795"},"schema_version":"1.0","source":{"id":"2011.03853","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.03853","created_at":"2026-07-05T03:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"2011.03853v3","created_at":"2026-07-05T03:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03853","created_at":"2026-07-05T03:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"XBUNRDITI3PO","created_at":"2026-07-05T03:19:02Z"},{"alias_kind":"pith_short_16","alias_value":"XBUNRDITI3POB5GU","created_at":"2026-07-05T03:19:02Z"},{"alias_kind":"pith_short_8","alias_value":"XBUNRDIT","created_at":"2026-07-05T03:19:02Z"}],"graph_snapshots":[{"event_id":"sha256:24f466d2decd6afc4a18bc331f26b6294b44255e831f77016e18bad83db53965","target":"graph","created_at":"2026-07-05T03:19:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.03853/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study decentralized non-convex finite-sum minimization problems described over a network of nodes, where each node possesses a local batch of data samples. In this context, we analyze a single-timescale randomized incremental gradient method, called GT-SAGA. GT-SAGA is computationally efficient as it evaluates one component gradient per node per iteration and achieves provably fast and robust performance by leveraging node-level variance reduction and network-level gradient tracking. For general smooth non-convex problems, we show the almost sure and mean-squared convergence of GT-SAGA to a","authors_text":"Ran Xin, Soummya Kar, Usman A. Khan","cross_cats":["cs.LG","cs.SY","eess.SY","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-07T21:30:42Z","title":"A fast randomized incremental gradient method for decentralized non-convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03853","kind":"arxiv","version":3},"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:712b8cdd766559efc56b89a323ee46ac1cdca06233b0f8be4168bfd935c2bf69","target":"record","created_at":"2026-07-05T03:19:02Z","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":"838fe2900a5d70cc865883cf50d9ed2f86ce74fe799967b995849d59fe93698b","cross_cats_sorted":["cs.LG","cs.SY","eess.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-07T21:30:42Z","title_canon_sha256":"a8e3126ba40abf753e8598a5ae5b6eb3862f696fc30c7cae1bf34f0c384c0795"},"schema_version":"1.0","source":{"id":"2011.03853","kind":"arxiv","version":3}},"canonical_sha256":"b868d88d1346dee0f4d46a9881df2c38ef594dd470452febab0195ad1ad239e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b868d88d1346dee0f4d46a9881df2c38ef594dd470452febab0195ad1ad239e5","first_computed_at":"2026-07-05T03:19:02.544962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:19:02.544962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Skpp8owIUNCXn2Q91XBpw1urpuPHD8JTnczimgJmOJElHyVcp3mMwfQMIHbECumcjgjMMJhkmqMIRxI90YjvBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:19:02.545370Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.03853","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:712b8cdd766559efc56b89a323ee46ac1cdca06233b0f8be4168bfd935c2bf69","sha256:24f466d2decd6afc4a18bc331f26b6294b44255e831f77016e18bad83db53965"],"state_sha256":"ec092ca39feb04e531ff4f1957a9dbeb62e79d89e565dada325a9e0c74cb1b39"}