{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IN6A65VJBHT5R52WXI2IILQMJG","short_pith_number":"pith:IN6A65VJ","schema_version":"1.0","canonical_sha256":"437c0f76a909e7d8f756ba34842e0c49bc9b410c83d7f3464fddc2cba9535e57","source":{"kind":"arxiv","id":"1511.08905","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Proximal Gradient Consensus Over Random Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Mingyi Hong, Tsung-Hui Chang","submitted_at":"2015-11-28T15:35:23Z","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"},"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":"1511.08905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-28T15:35:23Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ec3a2fdbbd8aabbd8414f7394676a45463039e0870a3a12e2dfe51a1a1be6f67","abstract_canon_sha256":"3c83239d1aefdc3d69460f11ca561d3d5603f24638af870f5dfa216e5249e29d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:38.108462Z","signature_b64":"l0rkL4fHr26DnQr8Mo5QjpmRzeYOiAHJzdX6VaATJiskby7ScghCSfkHTpcLa3XzsGxIfCU/7B3YgqRuo0yoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"437c0f76a909e7d8f756ba34842e0c49bc9b410c83d7f3464fddc2cba9535e57","last_reissued_at":"2026-05-18T00:56:38.107798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:38.107798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Proximal Gradient Consensus Over Random Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Mingyi Hong, Tsung-Hui Chang","submitted_at":"2015-11-28T15:35:23Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08905","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.08905","created_at":"2026-05-18T00:56:38.107898+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08905v2","created_at":"2026-05-18T00:56:38.107898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08905","created_at":"2026-05-18T00:56:38.107898+00:00"},{"alias_kind":"pith_short_12","alias_value":"IN6A65VJBHT5","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IN6A65VJBHT5R52W","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IN6A65VJ","created_at":"2026-05-18T12:29:25.134429+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/IN6A65VJBHT5R52WXI2IILQMJG","json":"https://pith.science/pith/IN6A65VJBHT5R52WXI2IILQMJG.json","graph_json":"https://pith.science/api/pith-number/IN6A65VJBHT5R52WXI2IILQMJG/graph.json","events_json":"https://pith.science/api/pith-number/IN6A65VJBHT5R52WXI2IILQMJG/events.json","paper":"https://pith.science/paper/IN6A65VJ"},"agent_actions":{"view_html":"https://pith.science/pith/IN6A65VJBHT5R52WXI2IILQMJG","download_json":"https://pith.science/pith/IN6A65VJBHT5R52WXI2IILQMJG.json","view_paper":"https://pith.science/paper/IN6A65VJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08905&json=true","fetch_graph":"https://pith.science/api/pith-number/IN6A65VJBHT5R52WXI2IILQMJG/graph.json","fetch_events":"https://pith.science/api/pith-number/IN6A65VJBHT5R52WXI2IILQMJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IN6A65VJBHT5R52WXI2IILQMJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IN6A65VJBHT5R52WXI2IILQMJG/action/storage_attestation","attest_author":"https://pith.science/pith/IN6A65VJBHT5R52WXI2IILQMJG/action/author_attestation","sign_citation":"https://pith.science/pith/IN6A65VJBHT5R52WXI2IILQMJG/action/citation_signature","submit_replication":"https://pith.science/pith/IN6A65VJBHT5R52WXI2IILQMJG/action/replication_record"}},"created_at":"2026-05-18T00:56:38.107898+00:00","updated_at":"2026-05-18T00:56:38.107898+00:00"}