{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MRQ3VIWNX7EB6LBLEW3BWBV76D","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":"d264d95b4060ae9dcffaf598cee0f1d9978fb8d42b74a28f0bd1973dc9998444","cross_cats_sorted":["cs.MA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-06T00:20:50Z","title_canon_sha256":"9211e11584d521f8294ea5fb8fa1be3a72d4253e7cbf534f580ff16de57db6d3"},"schema_version":"1.0","source":{"id":"1907.03053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03053","created_at":"2026-05-17T23:41:19Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03053v1","created_at":"2026-05-17T23:41:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03053","created_at":"2026-05-17T23:41:19Z"},{"alias_kind":"pith_short_12","alias_value":"MRQ3VIWNX7EB","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MRQ3VIWNX7EB6LBL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MRQ3VIWN","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:95bb62c1e5c19839c7c98a3b520e465f187cf271b754700546ba562245ae6316","target":"graph","created_at":"2026-05-17T23:41:19Z","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":"This paper considers a distributed reinforcement learning problem in which a network of multiple agents aim to cooperatively maximize the globally averaged return through communication with only local neighbors. A randomized communication-efficient multi-agent actor-critic algorithm is proposed for possibly unidirectional communication relationships depicted by a directed graph. It is shown that the algorithm can solve the problem for strongly connected graphs by allowing each agent to transmit only two scalar-valued variables at one time.","authors_text":"Ji Liu, Kaiqing Zhang, Romeil Sandhu, Tamer Ba\\c{s}ar, Yixuan Lin, Zhaoran Wang, Zhuoran Yang","cross_cats":["cs.MA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-06T00:20:50Z","title":"A Communication-Efficient Multi-Agent Actor-Critic Algorithm for Distributed Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03053","kind":"arxiv","version":1},"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:5296cf1e109b19f9da7d6114e9ff4b92be51d9a59799c9813d7289fc835b8531","target":"record","created_at":"2026-05-17T23:41:19Z","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":"d264d95b4060ae9dcffaf598cee0f1d9978fb8d42b74a28f0bd1973dc9998444","cross_cats_sorted":["cs.MA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-06T00:20:50Z","title_canon_sha256":"9211e11584d521f8294ea5fb8fa1be3a72d4253e7cbf534f580ff16de57db6d3"},"schema_version":"1.0","source":{"id":"1907.03053","kind":"arxiv","version":1}},"canonical_sha256":"6461baa2cdbfc81f2c2b25b61b06bff0e86bc00bf03cb8706165b10349ef82c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6461baa2cdbfc81f2c2b25b61b06bff0e86bc00bf03cb8706165b10349ef82c9","first_computed_at":"2026-05-17T23:41:19.048336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:19.048336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WgM53iaRsZjqVyrQz7xreFyDzInAsYWaCgvA6XMaMPTpqUeOCmeCef2Rdb7pyszmGP8LnhDrwLyLnZZ08/0KAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:19.048874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5296cf1e109b19f9da7d6114e9ff4b92be51d9a59799c9813d7289fc835b8531","sha256:95bb62c1e5c19839c7c98a3b520e465f187cf271b754700546ba562245ae6316"],"state_sha256":"ad3c8b4f792d0968da1a4a281b106702702a066f8550b7fc07e66709154b01ef"}