{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JCABYPN5EYXAK22SHOQV7WSET4","short_pith_number":"pith:JCABYPN5","schema_version":"1.0","canonical_sha256":"48801c3dbd262e056b523ba15fda449f18cae3496af6e10b977c976d17f5d36a","source":{"kind":"arxiv","id":"1803.07836","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.07836","created_at":"2026-05-18T00:20:28.774340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.07836v1","created_at":"2026-05-18T00:20:28.774340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07836","created_at":"2026-05-18T00:20:28.774340+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCABYPN5EYXA","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCABYPN5EYXAK22S","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCABYPN5","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4","json":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4.json","graph_json":"https://pith.science/api/pith-number/JCABYPN5EYXAK22SHOQV7WSET4/graph.json","events_json":"https://pith.science/api/pith-number/JCABYPN5EYXAK22SHOQV7WSET4/events.json","paper":"https://pith.science/paper/JCABYPN5"},"agent_actions":{"view_html":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4","download_json":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4.json","view_paper":"https://pith.science/paper/JCABYPN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.07836&json=true","fetch_graph":"https://pith.science/api/pith-number/JCABYPN5EYXAK22SHOQV7WSET4/graph.json","fetch_events":"https://pith.science/api/pith-number/JCABYPN5EYXAK22SHOQV7WSET4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4/action/storage_attestation","attest_author":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4/action/author_attestation","sign_citation":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4/action/citation_signature","submit_replication":"https://pith.science/pith/JCABYPN5EYXAK22SHOQV7WSET4/action/replication_record"}},"created_at":"2026-05-18T00:20:28.774340+00:00","updated_at":"2026-05-18T00:20:28.774340+00:00"}