{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QQBEVYXKVVX33HYQDMX6AETXYF","short_pith_number":"pith:QQBEVYXK","schema_version":"1.0","canonical_sha256":"84024ae2eaad6fbd9f101b2fe01277c16b7fdaea7fc132ea41b7170930f1ae36","source":{"kind":"arxiv","id":"2302.12515","version":2},"attestation_state":"computed","paper":{"title":"AC2C: Adaptively Controlled Two-Hop Communication for Multi-Agent Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Jiawei Shao, Jun Zhang, Xinran Li, Xuefeng Wang","submitted_at":"2023-02-24T09:00:34Z","abstract_excerpt":"Learning communication strategies in cooperative multi-agent reinforcement learning (MARL) has recently attracted intensive attention. Early studies typically assumed a fully-connected communication topology among agents, which induces high communication costs and may not be feasible. Some recent works have developed adaptive communication strategies to reduce communication overhead, but these methods cannot effectively obtain valuable information from agents that are beyond the communication range. In this paper, we consider a realistic communication model where each agent has a limited commu"},"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":"2302.12515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2023-02-24T09:00:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7781cb6912057b3ee8d5e242a1e9fc17a998e250268723e8e98c35470b48d7da","abstract_canon_sha256":"0a9e466cfc98d310b922231d71cd73b59780643ac4a16d9849a4ad075fc769b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:12:44.965284Z","signature_b64":"vp5mz/Mdhau3HKqsHAhQ+tYp11oorabsFBPyx6hYvNQh6P6odbhz9xzm0vXxEijoBth3G/pVMENx8SfGj2nMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84024ae2eaad6fbd9f101b2fe01277c16b7fdaea7fc132ea41b7170930f1ae36","last_reissued_at":"2026-07-05T06:12:44.964860Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:12:44.964860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AC2C: Adaptively Controlled Two-Hop Communication for Multi-Agent Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Jiawei Shao, Jun Zhang, Xinran Li, Xuefeng Wang","submitted_at":"2023-02-24T09:00:34Z","abstract_excerpt":"Learning communication strategies in cooperative multi-agent reinforcement learning (MARL) has recently attracted intensive attention. Early studies typically assumed a fully-connected communication topology among agents, which induces high communication costs and may not be feasible. Some recent works have developed adaptive communication strategies to reduce communication overhead, but these methods cannot effectively obtain valuable information from agents that are beyond the communication range. In this paper, we consider a realistic communication model where each agent has a limited commu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.12515","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/2302.12515/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":"2302.12515","created_at":"2026-07-05T06:12:44.964915+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.12515v2","created_at":"2026-07-05T06:12:44.964915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12515","created_at":"2026-07-05T06:12:44.964915+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQBEVYXKVVX3","created_at":"2026-07-05T06:12:44.964915+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQBEVYXKVVX33HYQ","created_at":"2026-07-05T06:12:44.964915+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQBEVYXK","created_at":"2026-07-05T06:12:44.964915+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00165","citing_title":"Dynamic Graph Communication for Decentralised Multi-Agent Reinforcement Learning","ref_index":83,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QQBEVYXKVVX33HYQDMX6AETXYF","json":"https://pith.science/pith/QQBEVYXKVVX33HYQDMX6AETXYF.json","graph_json":"https://pith.science/api/pith-number/QQBEVYXKVVX33HYQDMX6AETXYF/graph.json","events_json":"https://pith.science/api/pith-number/QQBEVYXKVVX33HYQDMX6AETXYF/events.json","paper":"https://pith.science/paper/QQBEVYXK"},"agent_actions":{"view_html":"https://pith.science/pith/QQBEVYXKVVX33HYQDMX6AETXYF","download_json":"https://pith.science/pith/QQBEVYXKVVX33HYQDMX6AETXYF.json","view_paper":"https://pith.science/paper/QQBEVYXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.12515&json=true","fetch_graph":"https://pith.science/api/pith-number/QQBEVYXKVVX33HYQDMX6AETXYF/graph.json","fetch_events":"https://pith.science/api/pith-number/QQBEVYXKVVX33HYQDMX6AETXYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQBEVYXKVVX33HYQDMX6AETXYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQBEVYXKVVX33HYQDMX6AETXYF/action/storage_attestation","attest_author":"https://pith.science/pith/QQBEVYXKVVX33HYQDMX6AETXYF/action/author_attestation","sign_citation":"https://pith.science/pith/QQBEVYXKVVX33HYQDMX6AETXYF/action/citation_signature","submit_replication":"https://pith.science/pith/QQBEVYXKVVX33HYQDMX6AETXYF/action/replication_record"}},"created_at":"2026-07-05T06:12:44.964915+00:00","updated_at":"2026-07-05T06:12:44.964915+00:00"}