{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZE2J2ZWRCRI2ZP6CFHJMSYBH5H","short_pith_number":"pith:ZE2J2ZWR","schema_version":"1.0","canonical_sha256":"c9349d66d11451acbfc229d2c96027e9d70ba5280775b77a7d695ef468d5fdf4","source":{"kind":"arxiv","id":"2005.03982","version":2},"attestation_state":"computed","paper":{"title":"Distributed Stochastic Constrained Composite Optimization over Time-Varying Network with a Class of Communication Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Daniel W. C. Ho, Deming Yuan, Jie Liu, Zhan Yu","submitted_at":"2020-05-08T12:29:51Z","abstract_excerpt":"This paper is concerned with distributed stochastic multi-agent constrained optimization problem over time-varying network with a class of communication noise. This paper considers the problem in composite optimization setting which is more general in the literature of noisy network optimization. It is noteworthy that the mainstream existing methods for noisy network optimization are Euclidean projection based. Based on Bregman projection-based mirror descent scheme, we present a non-Euclidean method and investigate their convergence behavior. This method is the distributed stochastic composit"},"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":"2005.03982","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-08T12:29:51Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"fd653bce327ea5ee8e8435e478d3f1c023f0dc351a3f29559fe162c8eab26f2f","abstract_canon_sha256":"8c0e0e3df702baabb22989c66b424f15d210aa0a81c1b098b8748d38f4ef35d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:26:00.532263Z","signature_b64":"zUP0QIFlZo8oAgSWGkRPNdp4KMe1XZZYNt2GvkNhZpoflEvpvizzSnoiaV/+KqnYQGjf3RWe1k8IUL6/PYbLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9349d66d11451acbfc229d2c96027e9d70ba5280775b77a7d695ef468d5fdf4","last_reissued_at":"2026-07-05T05:26:00.531864Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:26:00.531864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Stochastic Constrained Composite Optimization over Time-Varying Network with a Class of Communication Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Daniel W. C. Ho, Deming Yuan, Jie Liu, Zhan Yu","submitted_at":"2020-05-08T12:29:51Z","abstract_excerpt":"This paper is concerned with distributed stochastic multi-agent constrained optimization problem over time-varying network with a class of communication noise. This paper considers the problem in composite optimization setting which is more general in the literature of noisy network optimization. It is noteworthy that the mainstream existing methods for noisy network optimization are Euclidean projection based. Based on Bregman projection-based mirror descent scheme, we present a non-Euclidean method and investigate their convergence behavior. This method is the distributed stochastic composit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.03982","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.03982/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2005.03982","created_at":"2026-07-05T05:26:00.531926+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.03982v2","created_at":"2026-07-05T05:26:00.531926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.03982","created_at":"2026-07-05T05:26:00.531926+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZE2J2ZWRCRI2","created_at":"2026-07-05T05:26:00.531926+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZE2J2ZWRCRI2ZP6C","created_at":"2026-07-05T05:26:00.531926+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZE2J2ZWR","created_at":"2026-07-05T05:26:00.531926+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/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H","json":"https://pith.science/pith/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H.json","graph_json":"https://pith.science/api/pith-number/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H/graph.json","events_json":"https://pith.science/api/pith-number/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H/events.json","paper":"https://pith.science/paper/ZE2J2ZWR"},"agent_actions":{"view_html":"https://pith.science/pith/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H","download_json":"https://pith.science/pith/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H.json","view_paper":"https://pith.science/paper/ZE2J2ZWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.03982&json=true","fetch_graph":"https://pith.science/api/pith-number/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H/graph.json","fetch_events":"https://pith.science/api/pith-number/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H/action/storage_attestation","attest_author":"https://pith.science/pith/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H/action/author_attestation","sign_citation":"https://pith.science/pith/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H/action/citation_signature","submit_replication":"https://pith.science/pith/ZE2J2ZWRCRI2ZP6CFHJMSYBH5H/action/replication_record"}},"created_at":"2026-07-05T05:26:00.531926+00:00","updated_at":"2026-07-05T05:26:00.531926+00:00"}