{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:7REZL5UMMV3DRLWXH2YXA4WPYY","short_pith_number":"pith:7REZL5UM","canonical_record":{"source":{"id":"2002.03269","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-09T02:57:58Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"3c9f5eff697394300917dac48441c455240b72ba0914c0789ba03f434b87f60e","abstract_canon_sha256":"8be96db26a752b38771c9b522603feb1843ae4320664149595d66a8f9710ad3e"},"schema_version":"1.0"},"canonical_sha256":"fc4995f68c657638aed73eb17072cfc62fb55f6047dca4cacd3cd1e9a998e03e","source":{"kind":"arxiv","id":"2002.03269","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.03269","created_at":"2026-07-05T00:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"2002.03269v2","created_at":"2026-07-05T00:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03269","created_at":"2026-07-05T00:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"7REZL5UMMV3D","created_at":"2026-07-05T00:40:46Z"},{"alias_kind":"pith_short_16","alias_value":"7REZL5UMMV3DRLWX","created_at":"2026-07-05T00:40:46Z"},{"alias_kind":"pith_short_8","alias_value":"7REZL5UM","created_at":"2026-07-05T00:40:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:7REZL5UMMV3DRLWXH2YXA4WPYY","target":"record","payload":{"canonical_record":{"source":{"id":"2002.03269","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-09T02:57:58Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"3c9f5eff697394300917dac48441c455240b72ba0914c0789ba03f434b87f60e","abstract_canon_sha256":"8be96db26a752b38771c9b522603feb1843ae4320664149595d66a8f9710ad3e"},"schema_version":"1.0"},"canonical_sha256":"fc4995f68c657638aed73eb17072cfc62fb55f6047dca4cacd3cd1e9a998e03e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:46.719546Z","signature_b64":"GhOUDzMEWfOWpYnO0qAn3TG8DDYk7s9SHej8vC/20dpingpaEZDS4g8PGiaIfg5ey1cUWDVWj6PO+aGohlD9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc4995f68c657638aed73eb17072cfc62fb55f6047dca4cacd3cd1e9a998e03e","last_reissued_at":"2026-07-05T00:40:46.719061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:46.719061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.03269","source_version":2,"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-05T00:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJ9n8gtQywc9XXIJhspS/9hakd1uxVBqtv63xCrR1Xx9s6XBGwi3d3zrMkAY4Ldh2UyBwB6TigVL3CqbeKZ9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:49:05.029294Z"},"content_sha256":"c738c81edf53e6b69597e6f10f4e258939a065ec3da548f43b7a0bab31ca3ecc","schema_version":"1.0","event_id":"sha256:c738c81edf53e6b69597e6f10f4e258939a065ec3da548f43b7a0bab31ca3ecc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:7REZL5UMMV3DRLWXH2YXA4WPYY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linearly Convergent Algorithm with Variance Reduction for Distributed Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Jie Chen, Jinlong Lei, Peng Yi, Yiguang Hong","submitted_at":"2020-02-09T02:57:58Z","abstract_excerpt":"This paper considers a distributed stochastic strongly convex optimization, where agents connected over a network aim to cooperatively minimize the average of all agents' local cost functions. Due to the stochasticity of gradient estimation and distributedness of local objective, fast linearly convergent distributed algorithms have not been achieved yet. This work proposes a novel distributed stochastic gradient tracking algorithm with variance reduction, where the local gradients are estimated by an increasing batch-size of sampled gradients. With an undirected connected communication graph a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03269","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.03269/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-05T00:40:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHyNS6bRz0DWAU7RbDhVq8+4y84A0ggCFTtiTdGWmEq0NP/EIrAG3GWxo6t2KF28rDM2YNMgZLo8sh6c8CB5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:49:05.030233Z"},"content_sha256":"0ccb57f02053a42ec3f1f0dbe74d69e58bdc273b646f37a6cc069ede9667421f","schema_version":"1.0","event_id":"sha256:0ccb57f02053a42ec3f1f0dbe74d69e58bdc273b646f37a6cc069ede9667421f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7REZL5UMMV3DRLWXH2YXA4WPYY/bundle.json","state_url":"https://pith.science/pith/7REZL5UMMV3DRLWXH2YXA4WPYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7REZL5UMMV3DRLWXH2YXA4WPYY/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-10T12:49:05Z","links":{"resolver":"https://pith.science/pith/7REZL5UMMV3DRLWXH2YXA4WPYY","bundle":"https://pith.science/pith/7REZL5UMMV3DRLWXH2YXA4WPYY/bundle.json","state":"https://pith.science/pith/7REZL5UMMV3DRLWXH2YXA4WPYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7REZL5UMMV3DRLWXH2YXA4WPYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:7REZL5UMMV3DRLWXH2YXA4WPYY","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":"8be96db26a752b38771c9b522603feb1843ae4320664149595d66a8f9710ad3e","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-09T02:57:58Z","title_canon_sha256":"3c9f5eff697394300917dac48441c455240b72ba0914c0789ba03f434b87f60e"},"schema_version":"1.0","source":{"id":"2002.03269","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.03269","created_at":"2026-07-05T00:40:46Z"},{"alias_kind":"arxiv_version","alias_value":"2002.03269v2","created_at":"2026-07-05T00:40:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03269","created_at":"2026-07-05T00:40:46Z"},{"alias_kind":"pith_short_12","alias_value":"7REZL5UMMV3D","created_at":"2026-07-05T00:40:46Z"},{"alias_kind":"pith_short_16","alias_value":"7REZL5UMMV3DRLWX","created_at":"2026-07-05T00:40:46Z"},{"alias_kind":"pith_short_8","alias_value":"7REZL5UM","created_at":"2026-07-05T00:40:46Z"}],"graph_snapshots":[{"event_id":"sha256:0ccb57f02053a42ec3f1f0dbe74d69e58bdc273b646f37a6cc069ede9667421f","target":"graph","created_at":"2026-07-05T00:40:46Z","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/2002.03269/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers a distributed stochastic strongly convex optimization, where agents connected over a network aim to cooperatively minimize the average of all agents' local cost functions. Due to the stochasticity of gradient estimation and distributedness of local objective, fast linearly convergent distributed algorithms have not been achieved yet. This work proposes a novel distributed stochastic gradient tracking algorithm with variance reduction, where the local gradients are estimated by an increasing batch-size of sampled gradients. With an undirected connected communication graph a","authors_text":"Jie Chen, Jinlong Lei, Peng Yi, Yiguang Hong","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-09T02:57:58Z","title":"Linearly Convergent Algorithm with Variance Reduction for Distributed Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03269","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:c738c81edf53e6b69597e6f10f4e258939a065ec3da548f43b7a0bab31ca3ecc","target":"record","created_at":"2026-07-05T00:40:46Z","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":"8be96db26a752b38771c9b522603feb1843ae4320664149595d66a8f9710ad3e","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-02-09T02:57:58Z","title_canon_sha256":"3c9f5eff697394300917dac48441c455240b72ba0914c0789ba03f434b87f60e"},"schema_version":"1.0","source":{"id":"2002.03269","kind":"arxiv","version":2}},"canonical_sha256":"fc4995f68c657638aed73eb17072cfc62fb55f6047dca4cacd3cd1e9a998e03e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc4995f68c657638aed73eb17072cfc62fb55f6047dca4cacd3cd1e9a998e03e","first_computed_at":"2026-07-05T00:40:46.719061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:40:46.719061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GhOUDzMEWfOWpYnO0qAn3TG8DDYk7s9SHej8vC/20dpingpaEZDS4g8PGiaIfg5ey1cUWDVWj6PO+aGohlD9CA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:40:46.719546Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.03269","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c738c81edf53e6b69597e6f10f4e258939a065ec3da548f43b7a0bab31ca3ecc","sha256:0ccb57f02053a42ec3f1f0dbe74d69e58bdc273b646f37a6cc069ede9667421f"],"state_sha256":"3dc0669d85e6cf9cab925cd73e9cbb4a1d7f7d2a454a8475b8ff6a7870cc2bb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KC5xYt2duOPrpNoBC44xs7Xb1Nh1Ad1Bvuekd6Z6eMIwWhV9CtA6nSvWBL5dIV5DNXDiEOJFHU/s0vNNGFrqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T12:49:05.102328Z","bundle_sha256":"0c5b2c57a6d8d393a4bc24e081426e82d43545f61724ee997b64fdee6a7b42a5"}}