{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NK2IJS3KMBLSKB3OFC5MC4MRSB","short_pith_number":"pith:NK2IJS3K","schema_version":"1.0","canonical_sha256":"6ab484cb6a605725076e28bac1719190622d2bae04c1f4ec78cb5e17a2f6414f","source":{"kind":"arxiv","id":"2112.10374","version":4},"attestation_state":"computed","paper":{"title":"CGIBNet: Bandwidth-constrained Communication with Graph Information Bottleneck in Multi-Agent Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Baoxiang Wang, Fei Wu, Furui Liu, Kun Kuang, Qi Tian","submitted_at":"2021-12-20T07:53:44Z","abstract_excerpt":"Communication is one of the core components for cooperative multi-agent reinforcement learning (MARL). The communication bandwidth, in many real applications, is always subject to certain constraints. To improve communication efficiency, in this article, we propose to simultaneously optimize whom to communicate with and what to communicate for each agent in MARL. By initiating the communication between agents with a directed complete graph, we propose a novel communication model, named Communicative Graph Information Bottleneck Network (CGIBNet), to simultaneously compress the graph structure "},"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":"2112.10374","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-12-20T07:53:44Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"1ee7f39bd295798b9a804124d09ed6edd7dd9530fb0943fa5b4ba4f73076c0e9","abstract_canon_sha256":"284f01e9c5c9c5ffbc0968465b82905afc8992737dd27c77c691362c444135bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:29:00.209458Z","signature_b64":"SMjDmZLIudbXyvddZ7fBy9EHjiIrVJtsgvZFocEPG66sLHCbRyh6mGhEAXby9ham0Ik4Gx017J/3N1pQ7LS4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ab484cb6a605725076e28bac1719190622d2bae04c1f4ec78cb5e17a2f6414f","last_reissued_at":"2026-07-05T05:29:00.209058Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:29:00.209058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CGIBNet: Bandwidth-constrained Communication with Graph Information Bottleneck in Multi-Agent Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Baoxiang Wang, Fei Wu, Furui Liu, Kun Kuang, Qi Tian","submitted_at":"2021-12-20T07:53:44Z","abstract_excerpt":"Communication is one of the core components for cooperative multi-agent reinforcement learning (MARL). The communication bandwidth, in many real applications, is always subject to certain constraints. To improve communication efficiency, in this article, we propose to simultaneously optimize whom to communicate with and what to communicate for each agent in MARL. By initiating the communication between agents with a directed complete graph, we propose a novel communication model, named Communicative Graph Information Bottleneck Network (CGIBNet), to simultaneously compress the graph structure "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.10374","kind":"arxiv","version":4},"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/2112.10374/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":"2112.10374","created_at":"2026-07-05T05:29:00.209111+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.10374v4","created_at":"2026-07-05T05:29:00.209111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.10374","created_at":"2026-07-05T05:29:00.209111+00:00"},{"alias_kind":"pith_short_12","alias_value":"NK2IJS3KMBLS","created_at":"2026-07-05T05:29:00.209111+00:00"},{"alias_kind":"pith_short_16","alias_value":"NK2IJS3KMBLSKB3O","created_at":"2026-07-05T05:29:00.209111+00:00"},{"alias_kind":"pith_short_8","alias_value":"NK2IJS3K","created_at":"2026-07-05T05:29:00.209111+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/NK2IJS3KMBLSKB3OFC5MC4MRSB","json":"https://pith.science/pith/NK2IJS3KMBLSKB3OFC5MC4MRSB.json","graph_json":"https://pith.science/api/pith-number/NK2IJS3KMBLSKB3OFC5MC4MRSB/graph.json","events_json":"https://pith.science/api/pith-number/NK2IJS3KMBLSKB3OFC5MC4MRSB/events.json","paper":"https://pith.science/paper/NK2IJS3K"},"agent_actions":{"view_html":"https://pith.science/pith/NK2IJS3KMBLSKB3OFC5MC4MRSB","download_json":"https://pith.science/pith/NK2IJS3KMBLSKB3OFC5MC4MRSB.json","view_paper":"https://pith.science/paper/NK2IJS3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.10374&json=true","fetch_graph":"https://pith.science/api/pith-number/NK2IJS3KMBLSKB3OFC5MC4MRSB/graph.json","fetch_events":"https://pith.science/api/pith-number/NK2IJS3KMBLSKB3OFC5MC4MRSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NK2IJS3KMBLSKB3OFC5MC4MRSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NK2IJS3KMBLSKB3OFC5MC4MRSB/action/storage_attestation","attest_author":"https://pith.science/pith/NK2IJS3KMBLSKB3OFC5MC4MRSB/action/author_attestation","sign_citation":"https://pith.science/pith/NK2IJS3KMBLSKB3OFC5MC4MRSB/action/citation_signature","submit_replication":"https://pith.science/pith/NK2IJS3KMBLSKB3OFC5MC4MRSB/action/replication_record"}},"created_at":"2026-07-05T05:29:00.209111+00:00","updated_at":"2026-07-05T05:29:00.209111+00:00"}