{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XLPXRSOF6YRIHXTMAEPAEF5RQX","short_pith_number":"pith:XLPXRSOF","schema_version":"1.0","canonical_sha256":"badf78c9c5f62283de6c011e0217b185ffe4702f97620e84adc7d198bef35bea","source":{"kind":"arxiv","id":"2101.10369","version":2},"attestation_state":"computed","paper":{"title":"Effective Communications: A Joint Learning and Communication Framework for Multi-Agent Reinforcement Learning over Noisy Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"eess.SP","authors_text":"Deniz Gunduz, Joan Roig Pujol, Szymon Kobus, Tze-Yang Tung","submitted_at":"2021-01-02T10:43:41Z","abstract_excerpt":"We propose a novel formulation of the \"effectiveness problem\" in communications, put forth by Shannon and Weaver in their seminal work [2], by considering multiple agents communicating over a noisy channel in order to achieve better coordination and cooperation in a multi-agent reinforcement learning (MARL) framework. Specifically, we consider a multi-agent partially observable Markov decision process (MA-POMDP), in which the agents, in addition to interacting with the environment can also communicate with each other over a noisy communication channel. The noisy communication channel is consid"},"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":"2101.10369","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2021-01-02T10:43:41Z","cross_cats_sorted":["cs.AI","cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"f545aea07542939f4b7809c16081ea2f6e74d6d57e6a7accc82e78d2882b06cb","abstract_canon_sha256":"e0d959ce4385769ec48c815d133847f5b061ec09124f9605f4a31fa6eb246954"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:19.920259Z","signature_b64":"7kH5fZ0PUnrZn0J1MFsDW1opyVmFcd9R8ehBKqnaP/vMil7wWfxhy/l9VzUlSQ1BZ5d7R1rijda6DFi2Sp5TCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"badf78c9c5f62283de6c011e0217b185ffe4702f97620e84adc7d198bef35bea","last_reissued_at":"2026-07-05T02:28:19.919771Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:19.919771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective Communications: A Joint Learning and Communication Framework for Multi-Agent Reinforcement Learning over Noisy Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"eess.SP","authors_text":"Deniz Gunduz, Joan Roig Pujol, Szymon Kobus, Tze-Yang Tung","submitted_at":"2021-01-02T10:43:41Z","abstract_excerpt":"We propose a novel formulation of the \"effectiveness problem\" in communications, put forth by Shannon and Weaver in their seminal work [2], by considering multiple agents communicating over a noisy channel in order to achieve better coordination and cooperation in a multi-agent reinforcement learning (MARL) framework. Specifically, we consider a multi-agent partially observable Markov decision process (MA-POMDP), in which the agents, in addition to interacting with the environment can also communicate with each other over a noisy communication channel. The noisy communication channel is consid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.10369","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/2101.10369/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":"2101.10369","created_at":"2026-07-05T02:28:19.919830+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.10369v2","created_at":"2026-07-05T02:28:19.919830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.10369","created_at":"2026-07-05T02:28:19.919830+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLPXRSOF6YRI","created_at":"2026-07-05T02:28:19.919830+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLPXRSOF6YRIHXTM","created_at":"2026-07-05T02:28:19.919830+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLPXRSOF","created_at":"2026-07-05T02:28:19.919830+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20962","citing_title":"Heterogeneous Policy Networks for Composite Robot Team Communication and Coordination","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XLPXRSOF6YRIHXTMAEPAEF5RQX","json":"https://pith.science/pith/XLPXRSOF6YRIHXTMAEPAEF5RQX.json","graph_json":"https://pith.science/api/pith-number/XLPXRSOF6YRIHXTMAEPAEF5RQX/graph.json","events_json":"https://pith.science/api/pith-number/XLPXRSOF6YRIHXTMAEPAEF5RQX/events.json","paper":"https://pith.science/paper/XLPXRSOF"},"agent_actions":{"view_html":"https://pith.science/pith/XLPXRSOF6YRIHXTMAEPAEF5RQX","download_json":"https://pith.science/pith/XLPXRSOF6YRIHXTMAEPAEF5RQX.json","view_paper":"https://pith.science/paper/XLPXRSOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.10369&json=true","fetch_graph":"https://pith.science/api/pith-number/XLPXRSOF6YRIHXTMAEPAEF5RQX/graph.json","fetch_events":"https://pith.science/api/pith-number/XLPXRSOF6YRIHXTMAEPAEF5RQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLPXRSOF6YRIHXTMAEPAEF5RQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLPXRSOF6YRIHXTMAEPAEF5RQX/action/storage_attestation","attest_author":"https://pith.science/pith/XLPXRSOF6YRIHXTMAEPAEF5RQX/action/author_attestation","sign_citation":"https://pith.science/pith/XLPXRSOF6YRIHXTMAEPAEF5RQX/action/citation_signature","submit_replication":"https://pith.science/pith/XLPXRSOF6YRIHXTMAEPAEF5RQX/action/replication_record"}},"created_at":"2026-07-05T02:28:19.919830+00:00","updated_at":"2026-07-05T02:28:19.919830+00:00"}