{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JCABYPN5EYXAK22SHOQV7WSET4","short_pith_number":"pith:JCABYPN5","canonical_record":{"source":{"id":"1803.07836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-21T10:27:36Z","cross_cats_sorted":[],"title_canon_sha256":"08d78b878b193d121e9c728f805bf31d3415686a2b54ea575ded43679a5d04f2","abstract_canon_sha256":"6624b1c1e46b250aaba994d759ec34ec616ad1c610fec400f1a54c366eb83213"},"schema_version":"1.0"},"canonical_sha256":"48801c3dbd262e056b523ba15fda449f18cae3496af6e10b977c976d17f5d36a","source":{"kind":"arxiv","id":"1803.07836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07836","created_at":"2026-05-18T00:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07836v1","created_at":"2026-05-18T00:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07836","created_at":"2026-05-18T00:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"JCABYPN5EYXA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JCABYPN5EYXAK22S","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JCABYPN5","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JCABYPN5EYXAK22SHOQV7WSET4","target":"record","payload":{"canonical_record":{"source":{"id":"1803.07836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-21T10:27:36Z","cross_cats_sorted":[],"title_canon_sha256":"08d78b878b193d121e9c728f805bf31d3415686a2b54ea575ded43679a5d04f2","abstract_canon_sha256":"6624b1c1e46b250aaba994d759ec34ec616ad1c610fec400f1a54c366eb83213"},"schema_version":"1.0"},"canonical_sha256":"48801c3dbd262e056b523ba15fda449f18cae3496af6e10b977c976d17f5d36a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:28.774752Z","signature_b64":"VhsdhBHsGGZXBWlwPiQS8gg9PuBleM3bsIeVzUtqi0FUv/YNS1uQeFeN4y3rdBSk2n0iqNk82+nSMgWuL/RTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48801c3dbd262e056b523ba15fda449f18cae3496af6e10b977c976d17f5d36a","last_reissued_at":"2026-05-18T00:20:28.774271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:28.774271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.07836","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-18T00:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ejdFf7fBIVJzBkaTkcwtP2k53UEvYv3sIL9eKVzP//PZnYkRTLmxR8R1rW3NUMzKkVaNmOAo2fewvjTr0QXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:30:05.446954Z"},"content_sha256":"7e9908d5161de044ec46ded5276c74b5a8c97120f3f18619f40ea65906f49261","schema_version":"1.0","event_id":"sha256:7e9908d5161de044ec46ded5276c74b5a8c97120f3f18619f40ea65906f49261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JCABYPN5EYXAK22SHOQV7WSET4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence rates for distributed stochastic optimization over random networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anit Kumar Sahu, Dragana Bajovic, Dusan Jakovetic, Soummya Kar","submitted_at":"2018-03-21T10:27:36Z","abstract_excerpt":"We establish the O($\\frac{1}{k}$) convergence rate for distributed stochastic gradient methods that operate over strongly convex costs and random networks. The considered class of methods is standard each node performs a weighted average of its own and its neighbors solution estimates (consensus), and takes a negative step with respect to a noisy version of its local functions gradient (innovation). The underlying communication network is modeled through a sequence of temporally independent identically distributed (i.i.d.) Laplacian matrices connected on average, while the local gradient noise"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07836","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-18T00:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iU5y939PtgZkHwGSNgDbFVeUlJHjzjXjyvflk8fLr0MwR6SANLLDiyCpq3TLe08ot4OhcFBXMdB0o+6uxo5oBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:30:05.447651Z"},"content_sha256":"92fa7b938fdcbb938a8f6f1ae0008329fc0cfde0f1d235c2c8d542f120f4853e","schema_version":"1.0","event_id":"sha256:92fa7b938fdcbb938a8f6f1ae0008329fc0cfde0f1d235c2c8d542f120f4853e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4/bundle.json","state_url":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCABYPN5EYXAK22SHOQV7WSET4/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-26T04:30:05Z","links":{"resolver":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4","bundle":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4/bundle.json","state":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCABYPN5EYXAK22SHOQV7WSET4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JCABYPN5EYXAK22SHOQV7WSET4","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":"6624b1c1e46b250aaba994d759ec34ec616ad1c610fec400f1a54c366eb83213","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-21T10:27:36Z","title_canon_sha256":"08d78b878b193d121e9c728f805bf31d3415686a2b54ea575ded43679a5d04f2"},"schema_version":"1.0","source":{"id":"1803.07836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07836","created_at":"2026-05-18T00:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07836v1","created_at":"2026-05-18T00:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07836","created_at":"2026-05-18T00:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"JCABYPN5EYXA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JCABYPN5EYXAK22S","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JCABYPN5","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:92fa7b938fdcbb938a8f6f1ae0008329fc0cfde0f1d235c2c8d542f120f4853e","target":"graph","created_at":"2026-05-18T00:20:28Z","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 establish the O($\\frac{1}{k}$) convergence rate for distributed stochastic gradient methods that operate over strongly convex costs and random networks. The considered class of methods is standard each node performs a weighted average of its own and its neighbors solution estimates (consensus), and takes a negative step with respect to a noisy version of its local functions gradient (innovation). The underlying communication network is modeled through a sequence of temporally independent identically distributed (i.i.d.) Laplacian matrices connected on average, while the local gradient noise","authors_text":"Anit Kumar Sahu, Dragana Bajovic, Dusan Jakovetic, Soummya Kar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-21T10:27:36Z","title":"Convergence rates for distributed stochastic optimization over random networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07836","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:7e9908d5161de044ec46ded5276c74b5a8c97120f3f18619f40ea65906f49261","target":"record","created_at":"2026-05-18T00:20:28Z","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":"6624b1c1e46b250aaba994d759ec34ec616ad1c610fec400f1a54c366eb83213","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-21T10:27:36Z","title_canon_sha256":"08d78b878b193d121e9c728f805bf31d3415686a2b54ea575ded43679a5d04f2"},"schema_version":"1.0","source":{"id":"1803.07836","kind":"arxiv","version":1}},"canonical_sha256":"48801c3dbd262e056b523ba15fda449f18cae3496af6e10b977c976d17f5d36a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48801c3dbd262e056b523ba15fda449f18cae3496af6e10b977c976d17f5d36a","first_computed_at":"2026-05-18T00:20:28.774271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:28.774271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VhsdhBHsGGZXBWlwPiQS8gg9PuBleM3bsIeVzUtqi0FUv/YNS1uQeFeN4y3rdBSk2n0iqNk82+nSMgWuL/RTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:28.774752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.07836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e9908d5161de044ec46ded5276c74b5a8c97120f3f18619f40ea65906f49261","sha256:92fa7b938fdcbb938a8f6f1ae0008329fc0cfde0f1d235c2c8d542f120f4853e"],"state_sha256":"df5c2f036a34d38b9d1bdc32d2e83966a72d298d3dd72bea1d1503a6d0ab7aa0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Wmznvt5mU6BerDbVmAD1Z/mcN3qUvIHoqx9thFX22DAfspwmTw+aSbKdEJU//8Tj389zF/eQKuDM/AiVcYrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:30:05.451120Z","bundle_sha256":"76a04422a406f78e8729663ddd24086f55449f382608c3cbff140b5b07067123"}}