{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XBUNRDITI3POB5GUNKMIDXZMHD","short_pith_number":"pith:XBUNRDIT","canonical_record":{"source":{"id":"2011.03853","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-07T21:30:42Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY","stat.ML"],"title_canon_sha256":"a8e3126ba40abf753e8598a5ae5b6eb3862f696fc30c7cae1bf34f0c384c0795","abstract_canon_sha256":"838fe2900a5d70cc865883cf50d9ed2f86ce74fe799967b995849d59fe93698b"},"schema_version":"1.0"},"canonical_sha256":"b868d88d1346dee0f4d46a9881df2c38ef594dd470452febab0195ad1ad239e5","source":{"kind":"arxiv","id":"2011.03853","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XBUNRDITI3POB5GUNKMIDXZMHD","target":"record","payload":{"canonical_record":{"source":{"id":"2011.03853","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-07T21:30:42Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY","stat.ML"],"title_canon_sha256":"a8e3126ba40abf753e8598a5ae5b6eb3862f696fc30c7cae1bf34f0c384c0795","abstract_canon_sha256":"838fe2900a5d70cc865883cf50d9ed2f86ce74fe799967b995849d59fe93698b"},"schema_version":"1.0"},"canonical_sha256":"b868d88d1346dee0f4d46a9881df2c38ef594dd470452febab0195ad1ad239e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:02.545370Z","signature_b64":"Skpp8owIUNCXn2Q91XBpw1urpuPHD8JTnczimgJmOJElHyVcp3mMwfQMIHbECumcjgjMMJhkmqMIRxI90YjvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b868d88d1346dee0f4d46a9881df2c38ef594dd470452febab0195ad1ad239e5","last_reissued_at":"2026-07-05T03:19:02.544962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:02.544962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.03853","source_version":3,"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-07-05T03:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1Gu5YhE6sx1RGWhpP9pA0WxDdg4NZjwPuyaJoRvPXvuseCMGsZiLTW/7dCMGfpsWASu6QX8gTGDfCgsThQDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:42:13.950715Z"},"content_sha256":"712b8cdd766559efc56b89a323ee46ac1cdca06233b0f8be4168bfd935c2bf69","schema_version":"1.0","event_id":"sha256:712b8cdd766559efc56b89a323ee46ac1cdca06233b0f8be4168bfd935c2bf69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XBUNRDITI3POB5GUNKMIDXZMHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A fast randomized incremental gradient method for decentralized non-convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY","stat.ML"],"primary_cat":"math.OC","authors_text":"Ran Xin, Soummya Kar, Usman A. Khan","submitted_at":"2020-11-07T21:30:42Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03853","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.03853/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDRmoFrk3NnPabw4m/SeE+pOs5ceV/Dc1dqYSZ6+UoV0cInbhpeoH3EFpWFNNG/jxJ7wc8Lo1ZNpjkDJ2fWpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:42:14.005938Z"},"content_sha256":"24f466d2decd6afc4a18bc331f26b6294b44255e831f77016e18bad83db53965","schema_version":"1.0","event_id":"sha256:24f466d2decd6afc4a18bc331f26b6294b44255e831f77016e18bad83db53965"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD/bundle.json","state_url":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XBUNRDITI3POB5GUNKMIDXZMHD/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-08-03T19:42:14Z","links":{"resolver":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD","bundle":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD/bundle.json","state":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XBUNRDITI3POB5GUNKMIDXZMHD/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yn+o3R6/mN057+sH/Rks6vAVVECzPcldyYhmqv0KbQtSItynSgDdSj9VC46ucUFpBqbRydzhUjaaPlw/ox+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:42:14.011905Z","bundle_sha256":"9e2ac6acb476fcf3abc9de07fa338191097ce1c57da0562aa7b41e5ad03214c7"}}