{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:56SWTRMZAIWO2DLJ2IPFV4I3TV","short_pith_number":"pith:56SWTRMZ","schema_version":"1.0","canonical_sha256":"efa569c599022ced0d69d21e5af11b9d4d9c63ae1b2a1ba89fca87938b5bceec","source":{"kind":"arxiv","id":"2212.01619","version":1},"attestation_state":"computed","paper":{"title":"DACOM: Learning Delay-Aware Communication for Multi-Agent Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NI"],"primary_cat":"cs.MA","authors_text":"Hwei-Ming Chung, Jie Yuan, Tingting Yuan, Xiaoming Fu","submitted_at":"2022-12-03T14:20:59Z","abstract_excerpt":"Communication is supposed to improve multi-agent collaboration and overall performance in cooperative Multi-agent reinforcement learning (MARL). However, such improvements are prevalently limited in practice since most existing communication schemes ignore communication overheads (e.g., communication delays). In this paper, we demonstrate that ignoring communication delays has detrimental effects on collaborations, especially in delay-sensitive tasks such as autonomous driving. To mitigate this impact, we design a delay-aware multi-agent communication model (DACOM) to adapt communication to de"},"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":"2212.01619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2022-12-03T14:20:59Z","cross_cats_sorted":["cs.LG","cs.NI"],"title_canon_sha256":"7f8ffa7fca71670a47610dd323f202f00d13205d98d91453246d4b15b8f3ecc2","abstract_canon_sha256":"e83b8e6478267aceb8f8e7f3d49079dc8d763e5010da89e41770433dcc7e56f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:22:14.233465Z","signature_b64":"6FhFo+fOcqaXPHXeMfHY94PIpKsWnOVqYqcP+kRM5nF90sMS3kFLD283bMzV1nsScToVIRoA7LbgGnP1D3E6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efa569c599022ced0d69d21e5af11b9d4d9c63ae1b2a1ba89fca87938b5bceec","last_reissued_at":"2026-07-05T05:22:14.233025Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:22:14.233025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DACOM: Learning Delay-Aware Communication for Multi-Agent Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NI"],"primary_cat":"cs.MA","authors_text":"Hwei-Ming Chung, Jie Yuan, Tingting Yuan, Xiaoming Fu","submitted_at":"2022-12-03T14:20:59Z","abstract_excerpt":"Communication is supposed to improve multi-agent collaboration and overall performance in cooperative Multi-agent reinforcement learning (MARL). However, such improvements are prevalently limited in practice since most existing communication schemes ignore communication overheads (e.g., communication delays). In this paper, we demonstrate that ignoring communication delays has detrimental effects on collaborations, especially in delay-sensitive tasks such as autonomous driving. To mitigate this impact, we design a delay-aware multi-agent communication model (DACOM) to adapt communication to de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.01619","kind":"arxiv","version":1},"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/2212.01619/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":"2212.01619","created_at":"2026-07-05T05:22:14.233081+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.01619v1","created_at":"2026-07-05T05:22:14.233081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.01619","created_at":"2026-07-05T05:22:14.233081+00:00"},{"alias_kind":"pith_short_12","alias_value":"56SWTRMZAIWO","created_at":"2026-07-05T05:22:14.233081+00:00"},{"alias_kind":"pith_short_16","alias_value":"56SWTRMZAIWO2DLJ","created_at":"2026-07-05T05:22:14.233081+00:00"},{"alias_kind":"pith_short_8","alias_value":"56SWTRMZ","created_at":"2026-07-05T05:22:14.233081+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.26286","citing_title":"Decoupled Delay Compensation: Enhancing Pre-trained MARL Policies via Learned Dynamics Filtering","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2510.07799","citing_title":"Dynamic Generation of Multi-LLM Agents Communication Topologies with Graph Diffusion Models","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/56SWTRMZAIWO2DLJ2IPFV4I3TV","json":"https://pith.science/pith/56SWTRMZAIWO2DLJ2IPFV4I3TV.json","graph_json":"https://pith.science/api/pith-number/56SWTRMZAIWO2DLJ2IPFV4I3TV/graph.json","events_json":"https://pith.science/api/pith-number/56SWTRMZAIWO2DLJ2IPFV4I3TV/events.json","paper":"https://pith.science/paper/56SWTRMZ"},"agent_actions":{"view_html":"https://pith.science/pith/56SWTRMZAIWO2DLJ2IPFV4I3TV","download_json":"https://pith.science/pith/56SWTRMZAIWO2DLJ2IPFV4I3TV.json","view_paper":"https://pith.science/paper/56SWTRMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.01619&json=true","fetch_graph":"https://pith.science/api/pith-number/56SWTRMZAIWO2DLJ2IPFV4I3TV/graph.json","fetch_events":"https://pith.science/api/pith-number/56SWTRMZAIWO2DLJ2IPFV4I3TV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56SWTRMZAIWO2DLJ2IPFV4I3TV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56SWTRMZAIWO2DLJ2IPFV4I3TV/action/storage_attestation","attest_author":"https://pith.science/pith/56SWTRMZAIWO2DLJ2IPFV4I3TV/action/author_attestation","sign_citation":"https://pith.science/pith/56SWTRMZAIWO2DLJ2IPFV4I3TV/action/citation_signature","submit_replication":"https://pith.science/pith/56SWTRMZAIWO2DLJ2IPFV4I3TV/action/replication_record"}},"created_at":"2026-07-05T05:22:14.233081+00:00","updated_at":"2026-07-05T05:22:14.233081+00:00"}