{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6G6YEIN2K5VCZ3GJOFZBO32UMJ","short_pith_number":"pith:6G6YEIN2","schema_version":"1.0","canonical_sha256":"f1bd8221ba576a2cecc97172176f54625c2033d62249328e97a02fb8b0d92832","source":{"kind":"arxiv","id":"2307.01403","version":3},"attestation_state":"computed","paper":{"title":"Learning Multi-Agent Communication with Contrastive Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Biswa Sengupta, Jakob Foerster, Michael Noukhovitch, Yat Long Lo","submitted_at":"2023-07-03T23:51:05Z","abstract_excerpt":"Communication is a powerful tool for coordination in multi-agent RL. But inducing an effective, common language is a difficult challenge, particularly in the decentralized setting. In this work, we introduce an alternative perspective where communicative messages sent between agents are considered as different incomplete views of the environment state. By examining the relationship between messages sent and received, we propose to learn to communicate using contrastive learning to maximize the mutual information between messages of a given trajectory. In communication-essential environments, o"},"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":"2307.01403","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-07-03T23:51:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"734de287a1525ceec088b8fa635904829f9348669d269ea5bf40e19c73c4635f","abstract_canon_sha256":"455adc91efdf0e96dc066d3e185a0bc2022cfdf068aad4b49ccb95467417bc0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:22.035073Z","signature_b64":"AuIyoPKSIX+/v1yv03nFy8unl17kmnTExmn8QCltZvwGHQxlrwNWavuFe5zA35Itjytp9MDiJ3XvB+eWuLIwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1bd8221ba576a2cecc97172176f54625c2033d62249328e97a02fb8b0d92832","last_reissued_at":"2026-07-05T07:40:22.034595Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:22.034595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Multi-Agent Communication with Contrastive Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Biswa Sengupta, Jakob Foerster, Michael Noukhovitch, Yat Long Lo","submitted_at":"2023-07-03T23:51:05Z","abstract_excerpt":"Communication is a powerful tool for coordination in multi-agent RL. But inducing an effective, common language is a difficult challenge, particularly in the decentralized setting. In this work, we introduce an alternative perspective where communicative messages sent between agents are considered as different incomplete views of the environment state. By examining the relationship between messages sent and received, we propose to learn to communicate using contrastive learning to maximize the mutual information between messages of a given trajectory. In communication-essential environments, o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01403","kind":"arxiv","version":3},"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/2307.01403/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":"2307.01403","created_at":"2026-07-05T07:40:22.034653+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.01403v3","created_at":"2026-07-05T07:40:22.034653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01403","created_at":"2026-07-05T07:40:22.034653+00:00"},{"alias_kind":"pith_short_12","alias_value":"6G6YEIN2K5VC","created_at":"2026-07-05T07:40:22.034653+00:00"},{"alias_kind":"pith_short_16","alias_value":"6G6YEIN2K5VCZ3GJ","created_at":"2026-07-05T07:40:22.034653+00:00"},{"alias_kind":"pith_short_8","alias_value":"6G6YEIN2","created_at":"2026-07-05T07:40:22.034653+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27532","citing_title":"SCALE-COMM: Shared, Contrastively-Aligned Latent Embeddings for MARL Communication","ref_index":12,"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":19,"is_internal_anchor":false},{"citing_arxiv_id":"2511.13193","citing_title":"Cost-Effective Communication: An Auction-based Method for Language Agent Interaction","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6G6YEIN2K5VCZ3GJOFZBO32UMJ","json":"https://pith.science/pith/6G6YEIN2K5VCZ3GJOFZBO32UMJ.json","graph_json":"https://pith.science/api/pith-number/6G6YEIN2K5VCZ3GJOFZBO32UMJ/graph.json","events_json":"https://pith.science/api/pith-number/6G6YEIN2K5VCZ3GJOFZBO32UMJ/events.json","paper":"https://pith.science/paper/6G6YEIN2"},"agent_actions":{"view_html":"https://pith.science/pith/6G6YEIN2K5VCZ3GJOFZBO32UMJ","download_json":"https://pith.science/pith/6G6YEIN2K5VCZ3GJOFZBO32UMJ.json","view_paper":"https://pith.science/paper/6G6YEIN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.01403&json=true","fetch_graph":"https://pith.science/api/pith-number/6G6YEIN2K5VCZ3GJOFZBO32UMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6G6YEIN2K5VCZ3GJOFZBO32UMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6G6YEIN2K5VCZ3GJOFZBO32UMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6G6YEIN2K5VCZ3GJOFZBO32UMJ/action/storage_attestation","attest_author":"https://pith.science/pith/6G6YEIN2K5VCZ3GJOFZBO32UMJ/action/author_attestation","sign_citation":"https://pith.science/pith/6G6YEIN2K5VCZ3GJOFZBO32UMJ/action/citation_signature","submit_replication":"https://pith.science/pith/6G6YEIN2K5VCZ3GJOFZBO32UMJ/action/replication_record"}},"created_at":"2026-07-05T07:40:22.034653+00:00","updated_at":"2026-07-05T07:40:22.034653+00:00"}