{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6EXVHJ3SMWAZJ3NQDRMFATOVJY","short_pith_number":"pith:6EXVHJ3S","canonical_record":{"source":{"id":"1903.07266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-18T06:29:08Z","cross_cats_sorted":["cs.DC","cs.MA","cs.SY","stat.ML"],"title_canon_sha256":"e22ecccfe80904003c9922d35c0b17acdb74aae6b61313bccffea56a179b4d5d","abstract_canon_sha256":"1da02a01d879482ee951c9cc47633b101ca60b0230756f07f9b388fd897ed550"},"schema_version":"1.0"},"canonical_sha256":"f12f53a772658194edb01c58504dd54e182d17ebde9ae93ff8e38afd518298bf","source":{"kind":"arxiv","id":"1903.07266","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07266","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07266v2","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07266","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"pith_short_12","alias_value":"6EXVHJ3SMWAZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6EXVHJ3SMWAZJ3NQ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6EXVHJ3S","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6EXVHJ3SMWAZJ3NQDRMFATOVJY","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-18T06:29:08Z","cross_cats_sorted":["cs.DC","cs.MA","cs.SY","stat.ML"],"title_canon_sha256":"e22ecccfe80904003c9922d35c0b17acdb74aae6b61313bccffea56a179b4d5d","abstract_canon_sha256":"1da02a01d879482ee951c9cc47633b101ca60b0230756f07f9b388fd897ed550"},"schema_version":"1.0"},"canonical_sha256":"f12f53a772658194edb01c58504dd54e182d17ebde9ae93ff8e38afd518298bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:57.898739Z","signature_b64":"i626oXVFyTdKyJAWJ4bUsiMdgFGp9EP9lZaWN4hzDnZrXaFhvOGQDeNPjwoCmnzUimRavfNS19CvoyQz+tvRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f12f53a772658194edb01c58504dd54e182d17ebde9ae93ff8e38afd518298bf","last_reissued_at":"2026-05-17T23:48:57.898348Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:57.898348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07266","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-05-17T23:48:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+NVSobtWh2ENNgHV3UzV13pHJPV6lqxeblAdkzxvDBlyC6evHr7Wt0Z4qETxYKGyR9UR+tghWBFhdZO2E07CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:08:33.095298Z"},"content_sha256":"c423d4e8c72581403ee8f5b562517060c0c856fe47ccd9597feedc0b8f3fabdd","schema_version":"1.0","event_id":"sha256:c423d4e8c72581403ee8f5b562517060c0c856fe47ccd9597feedc0b8f3fabdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6EXVHJ3SMWAZJ3NQDRMFATOVJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed stochastic optimization with gradient tracking over strongly-connected networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA","cs.SY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anit Kumar Sahu, Ran Xin, Soummya Kar, Usman A. Khan","submitted_at":"2019-03-18T06:29:08Z","abstract_excerpt":"In this paper, we study distributed stochastic optimization to minimize a sum of smooth and strongly-convex local cost functions over a network of agents, communicating over a strongly-connected graph. Assuming that each agent has access to a stochastic first-order oracle ($\\mathcal{SFO}$), we propose a novel distributed method, called $\\mathcal{S}$-$\\mathcal{AB}$, where each agent uses an auxiliary variable to asymptotically track the gradient of the global cost in expectation. The $\\mathcal{S}$-$\\mathcal{AB}$ algorithm employs row- and column-stochastic weights simultaneously to ensure both "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07266","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":""},"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-17T23:48:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"40+gaudNAnA9m7nuJsMEfOq7hggZwmp/1HWXKIx2iWC9Wedilywf18/yfR1dEQsoBDR8jFgfSiWUauNldSdCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:08:33.096102Z"},"content_sha256":"639708290a34fd57de54ef3ce4a9bd58f60a2a8f94d71e872e3ec61a363463d0","schema_version":"1.0","event_id":"sha256:639708290a34fd57de54ef3ce4a9bd58f60a2a8f94d71e872e3ec61a363463d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6EXVHJ3SMWAZJ3NQDRMFATOVJY/bundle.json","state_url":"https://pith.science/pith/6EXVHJ3SMWAZJ3NQDRMFATOVJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6EXVHJ3SMWAZJ3NQDRMFATOVJY/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-25T20:08:33Z","links":{"resolver":"https://pith.science/pith/6EXVHJ3SMWAZJ3NQDRMFATOVJY","bundle":"https://pith.science/pith/6EXVHJ3SMWAZJ3NQDRMFATOVJY/bundle.json","state":"https://pith.science/pith/6EXVHJ3SMWAZJ3NQDRMFATOVJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6EXVHJ3SMWAZJ3NQDRMFATOVJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6EXVHJ3SMWAZJ3NQDRMFATOVJY","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":"1da02a01d879482ee951c9cc47633b101ca60b0230756f07f9b388fd897ed550","cross_cats_sorted":["cs.DC","cs.MA","cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-18T06:29:08Z","title_canon_sha256":"e22ecccfe80904003c9922d35c0b17acdb74aae6b61313bccffea56a179b4d5d"},"schema_version":"1.0","source":{"id":"1903.07266","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07266","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07266v2","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07266","created_at":"2026-05-17T23:48:57Z"},{"alias_kind":"pith_short_12","alias_value":"6EXVHJ3SMWAZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6EXVHJ3SMWAZJ3NQ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6EXVHJ3S","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:639708290a34fd57de54ef3ce4a9bd58f60a2a8f94d71e872e3ec61a363463d0","target":"graph","created_at":"2026-05-17T23:48:57Z","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":"In this paper, we study distributed stochastic optimization to minimize a sum of smooth and strongly-convex local cost functions over a network of agents, communicating over a strongly-connected graph. Assuming that each agent has access to a stochastic first-order oracle ($\\mathcal{SFO}$), we propose a novel distributed method, called $\\mathcal{S}$-$\\mathcal{AB}$, where each agent uses an auxiliary variable to asymptotically track the gradient of the global cost in expectation. The $\\mathcal{S}$-$\\mathcal{AB}$ algorithm employs row- and column-stochastic weights simultaneously to ensure both ","authors_text":"Anit Kumar Sahu, Ran Xin, Soummya Kar, Usman A. Khan","cross_cats":["cs.DC","cs.MA","cs.SY","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-18T06:29:08Z","title":"Distributed stochastic optimization with gradient tracking over strongly-connected networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07266","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:c423d4e8c72581403ee8f5b562517060c0c856fe47ccd9597feedc0b8f3fabdd","target":"record","created_at":"2026-05-17T23:48:57Z","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":"1da02a01d879482ee951c9cc47633b101ca60b0230756f07f9b388fd897ed550","cross_cats_sorted":["cs.DC","cs.MA","cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-18T06:29:08Z","title_canon_sha256":"e22ecccfe80904003c9922d35c0b17acdb74aae6b61313bccffea56a179b4d5d"},"schema_version":"1.0","source":{"id":"1903.07266","kind":"arxiv","version":2}},"canonical_sha256":"f12f53a772658194edb01c58504dd54e182d17ebde9ae93ff8e38afd518298bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f12f53a772658194edb01c58504dd54e182d17ebde9ae93ff8e38afd518298bf","first_computed_at":"2026-05-17T23:48:57.898348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:57.898348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i626oXVFyTdKyJAWJ4bUsiMdgFGp9EP9lZaWN4hzDnZrXaFhvOGQDeNPjwoCmnzUimRavfNS19CvoyQz+tvRAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:57.898739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07266","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c423d4e8c72581403ee8f5b562517060c0c856fe47ccd9597feedc0b8f3fabdd","sha256:639708290a34fd57de54ef3ce4a9bd58f60a2a8f94d71e872e3ec61a363463d0"],"state_sha256":"2f6485060032ea053899124ae59102fb1e372a587d56a0ede485a27b88731e67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aVegAOUY2EFxh6IjqqiYR8RnbPr/Cl/id4Go/nUJTXXkCeiKteY7TzvgyjvFn+KAXlzzsfGNkJ+CNaxhlxokBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:08:33.100142Z","bundle_sha256":"3b3027dba5b5ddbf1c7fc5965b113d0c031fc16f820d58bad2c11976c3f5ab39"}}