{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IN6A65VJBHT5R52WXI2IILQMJG","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":"3c83239d1aefdc3d69460f11ca561d3d5603f24638af870f5dfa216e5249e29d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-28T15:35:23Z","title_canon_sha256":"ec3a2fdbbd8aabbd8414f7394676a45463039e0870a3a12e2dfe51a1a1be6f67"},"schema_version":"1.0","source":{"id":"1511.08905","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08905","created_at":"2026-05-18T00:56:38Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08905v2","created_at":"2026-05-18T00:56:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08905","created_at":"2026-05-18T00:56:38Z"},{"alias_kind":"pith_short_12","alias_value":"IN6A65VJBHT5","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IN6A65VJBHT5R52W","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IN6A65VJ","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:2e05ef1c9da8c9d5b5909343de71d5976ed2400ea09c83983b3e0e3eba8250a2","target":"graph","created_at":"2026-05-18T00:56:38Z","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 consider solving a convex, possibly stochastic optimization problem over a randomly time-varying multi-agent network. Each agent has access to some local objective function, and it only has unbiased estimates of the gradients of the smooth component. We develop a dynamic stochastic proximal-gradient consensus (DySPGC) algorithm, with the following key features: i) it works for both the static and certain randomly time-varying networks, ii) it allows the agents to utilize either the exact or stochastic gradient information, iii) it is convergent with provable rate. In particular, we show tha","authors_text":"Mingyi Hong, Tsung-Hui Chang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-28T15:35:23Z","title":"Stochastic Proximal Gradient Consensus Over Random Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08905","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:f233702fe10c47f52689f8287aa1866760fb4a697d8dd84220788eebc500c244","target":"record","created_at":"2026-05-18T00:56:38Z","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":"3c83239d1aefdc3d69460f11ca561d3d5603f24638af870f5dfa216e5249e29d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-28T15:35:23Z","title_canon_sha256":"ec3a2fdbbd8aabbd8414f7394676a45463039e0870a3a12e2dfe51a1a1be6f67"},"schema_version":"1.0","source":{"id":"1511.08905","kind":"arxiv","version":2}},"canonical_sha256":"437c0f76a909e7d8f756ba34842e0c49bc9b410c83d7f3464fddc2cba9535e57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"437c0f76a909e7d8f756ba34842e0c49bc9b410c83d7f3464fddc2cba9535e57","first_computed_at":"2026-05-18T00:56:38.107798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:38.107798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l0rkL4fHr26DnQr8Mo5QjpmRzeYOiAHJzdX6VaATJiskby7ScghCSfkHTpcLa3XzsGxIfCU/7B3YgqRuo0yoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:38.108462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08905","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f233702fe10c47f52689f8287aa1866760fb4a697d8dd84220788eebc500c244","sha256:2e05ef1c9da8c9d5b5909343de71d5976ed2400ea09c83983b3e0e3eba8250a2"],"state_sha256":"2b06d513f0c4601a67d56d03988f40c1a0ec95dc95b512d8900d88485ea4e2bb"}