{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PYNFGF3ZKEZD62M4DXFYWRDWCB","short_pith_number":"pith:PYNFGF3Z","schema_version":"1.0","canonical_sha256":"7e1a53177951323f699c1dcb8b4476106cb26f0cd096d16cf8ccd2b606a7f3b1","source":{"kind":"arxiv","id":"1506.04216","version":1},"attestation_state":"computed","paper":{"title":"DSA: Decentralized Double Stochastic Averaging Gradient Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Aryan Mokhtari","submitted_at":"2015-06-13T03:46:40Z","abstract_excerpt":"This paper considers convex optimization problems where nodes of a network have access to summands of a global objective. Each of these local objectives is further assumed to be an average of a finite set of functions. The motivation for this setup is to solve large scale machine learning problems where elements of the training set are distributed to multiple computational elements. The decentralized double stochastic averaging gradient (DSA) algorithm is proposed as a solution alternative that relies on: (i) The use of local stochastic averaging gradients. (ii) Determination of descent steps "},"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":"1506.04216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-13T03:46:40Z","cross_cats_sorted":[],"title_canon_sha256":"b9a7e8df6859ab4eb63ebd0b9edf67067f4e3d431f3770223210023212987224","abstract_canon_sha256":"546f32f44a3fe0e88b8a6e0fdd359c0261f2ff35c0ddca968348df4f861f61ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:55.259043Z","signature_b64":"1BzYlKq7IxQ/2v0L3QR1ZzwyzriMDuJyCYllUMBq2crFc0Do9NLV8CUjMx+OR00JCi9SgJSD01fIvqaTwqEmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e1a53177951323f699c1dcb8b4476106cb26f0cd096d16cf8ccd2b606a7f3b1","last_reissued_at":"2026-05-18T01:49:55.258646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:55.258646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DSA: Decentralized Double Stochastic Averaging Gradient Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Aryan Mokhtari","submitted_at":"2015-06-13T03:46:40Z","abstract_excerpt":"This paper considers convex optimization problems where nodes of a network have access to summands of a global objective. Each of these local objectives is further assumed to be an average of a finite set of functions. The motivation for this setup is to solve large scale machine learning problems where elements of the training set are distributed to multiple computational elements. The decentralized double stochastic averaging gradient (DSA) algorithm is proposed as a solution alternative that relies on: (i) The use of local stochastic averaging gradients. (ii) Determination of descent steps "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04216","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":"1506.04216","created_at":"2026-05-18T01:49:55.258705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04216v1","created_at":"2026-05-18T01:49:55.258705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04216","created_at":"2026-05-18T01:49:55.258705+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYNFGF3ZKEZD","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYNFGF3ZKEZD62M4","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYNFGF3Z","created_at":"2026-05-18T12:29:37.295048+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/PYNFGF3ZKEZD62M4DXFYWRDWCB","json":"https://pith.science/pith/PYNFGF3ZKEZD62M4DXFYWRDWCB.json","graph_json":"https://pith.science/api/pith-number/PYNFGF3ZKEZD62M4DXFYWRDWCB/graph.json","events_json":"https://pith.science/api/pith-number/PYNFGF3ZKEZD62M4DXFYWRDWCB/events.json","paper":"https://pith.science/paper/PYNFGF3Z"},"agent_actions":{"view_html":"https://pith.science/pith/PYNFGF3ZKEZD62M4DXFYWRDWCB","download_json":"https://pith.science/pith/PYNFGF3ZKEZD62M4DXFYWRDWCB.json","view_paper":"https://pith.science/paper/PYNFGF3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04216&json=true","fetch_graph":"https://pith.science/api/pith-number/PYNFGF3ZKEZD62M4DXFYWRDWCB/graph.json","fetch_events":"https://pith.science/api/pith-number/PYNFGF3ZKEZD62M4DXFYWRDWCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYNFGF3ZKEZD62M4DXFYWRDWCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYNFGF3ZKEZD62M4DXFYWRDWCB/action/storage_attestation","attest_author":"https://pith.science/pith/PYNFGF3ZKEZD62M4DXFYWRDWCB/action/author_attestation","sign_citation":"https://pith.science/pith/PYNFGF3ZKEZD62M4DXFYWRDWCB/action/citation_signature","submit_replication":"https://pith.science/pith/PYNFGF3ZKEZD62M4DXFYWRDWCB/action/replication_record"}},"created_at":"2026-05-18T01:49:55.258705+00:00","updated_at":"2026-05-18T01:49:55.258705+00:00"}