{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UPHJPS6CPUW5LQDC4PXSZ3544Q","short_pith_number":"pith:UPHJPS6C","canonical_record":{"source":{"id":"1605.07736","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-25T05:33:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"cbc8b1a99d83d995ba274801117a1264467a3f1d215052ebbde3209d9b9d5cf7","abstract_canon_sha256":"cace7472f516639c4746475575476f871fc148e2d529ee892ad191465e061142"},"schema_version":"1.0"},"canonical_sha256":"a3ce97cbc27d2dd5c062e3ef2cefbce42b4cbc9a713f9591d0b8222af87096ed","source":{"kind":"arxiv","id":"1605.07736","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07736","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07736v2","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07736","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"UPHJPS6CPUW5","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UPHJPS6CPUW5LQDC","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UPHJPS6C","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UPHJPS6CPUW5LQDC4PXSZ3544Q","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07736","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-25T05:33:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"cbc8b1a99d83d995ba274801117a1264467a3f1d215052ebbde3209d9b9d5cf7","abstract_canon_sha256":"cace7472f516639c4746475575476f871fc148e2d529ee892ad191465e061142"},"schema_version":"1.0"},"canonical_sha256":"a3ce97cbc27d2dd5c062e3ef2cefbce42b4cbc9a713f9591d0b8222af87096ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:52.989473Z","signature_b64":"zFZVt0Eky/HoEw61bmaAbWLzBmCW4MIbSJTrH2X1vLupKnelyQnF1BqtAMyBPi8NghJX/cHnLz4MNNsu217hAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3ce97cbc27d2dd5c062e3ef2cefbce42b4cbc9a713f9591d0b8222af87096ed","last_reissued_at":"2026-05-18T01:00:52.988873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:52.988873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07736","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k0KhEZq54V78TmRiUeCjd8GMAOoQj32FcdY5Gca9lB1XVWEVDmA6LpS6565ZThGPg/ZmzkZOZQogZVDTQ8yGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:00:54.488751Z"},"content_sha256":"ed7408d17977ce754f329794b70acd12a7dfcf6d48d6bee57d27c90aba1b37bc","schema_version":"1.0","event_id":"sha256:ed7408d17977ce754f329794b70acd12a7dfcf6d48d6bee57d27c90aba1b37bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UPHJPS6CPUW5LQDC4PXSZ3544Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Multiagent Communication with Backpropagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Arthur Szlam, Rob Fergus, Sainbayar Sukhbaatar","submitted_at":"2016-05-25T05:33:21Z","abstract_excerpt":"Many tasks in AI require the collaboration of multiple agents. Typically, the communication protocol between agents is manually specified and not altered during training. In this paper we explore a simple neural model, called CommNet, that uses continuous communication for fully cooperative tasks. The model consists of multiple agents and the communication between them is learned alongside their policy. We apply this model to a diverse set of tasks, demonstrating the ability of the agents to learn to communicate amongst themselves, yielding improved performance over non-communicative agents an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07736","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jl2HmE1yjmSdXareeQjLkTER7DN1yL6SzUS32TXEHk96gUjefdeFKtGLfGPgxOm08q0yluvd/Q3RRE+x0WMXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:00:54.489120Z"},"content_sha256":"2b345f1835907bc7e092d4de158b58dabade848d0e81e8b73076b52c9327fea0","schema_version":"1.0","event_id":"sha256:2b345f1835907bc7e092d4de158b58dabade848d0e81e8b73076b52c9327fea0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPHJPS6CPUW5LQDC4PXSZ3544Q/bundle.json","state_url":"https://pith.science/pith/UPHJPS6CPUW5LQDC4PXSZ3544Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPHJPS6CPUW5LQDC4PXSZ3544Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T17:00:54Z","links":{"resolver":"https://pith.science/pith/UPHJPS6CPUW5LQDC4PXSZ3544Q","bundle":"https://pith.science/pith/UPHJPS6CPUW5LQDC4PXSZ3544Q/bundle.json","state":"https://pith.science/pith/UPHJPS6CPUW5LQDC4PXSZ3544Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPHJPS6CPUW5LQDC4PXSZ3544Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UPHJPS6CPUW5LQDC4PXSZ3544Q","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cace7472f516639c4746475575476f871fc148e2d529ee892ad191465e061142","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-25T05:33:21Z","title_canon_sha256":"cbc8b1a99d83d995ba274801117a1264467a3f1d215052ebbde3209d9b9d5cf7"},"schema_version":"1.0","source":{"id":"1605.07736","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07736","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07736v2","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07736","created_at":"2026-05-18T01:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"UPHJPS6CPUW5","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UPHJPS6CPUW5LQDC","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UPHJPS6C","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:2b345f1835907bc7e092d4de158b58dabade848d0e81e8b73076b52c9327fea0","target":"graph","created_at":"2026-05-18T01:00:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Many tasks in AI require the collaboration of multiple agents. Typically, the communication protocol between agents is manually specified and not altered during training. In this paper we explore a simple neural model, called CommNet, that uses continuous communication for fully cooperative tasks. The model consists of multiple agents and the communication between them is learned alongside their policy. We apply this model to a diverse set of tasks, demonstrating the ability of the agents to learn to communicate amongst themselves, yielding improved performance over non-communicative agents an","authors_text":"Arthur Szlam, Rob Fergus, Sainbayar Sukhbaatar","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-25T05:33:21Z","title":"Learning Multiagent Communication with Backpropagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07736","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ed7408d17977ce754f329794b70acd12a7dfcf6d48d6bee57d27c90aba1b37bc","target":"record","created_at":"2026-05-18T01:00:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cace7472f516639c4746475575476f871fc148e2d529ee892ad191465e061142","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-25T05:33:21Z","title_canon_sha256":"cbc8b1a99d83d995ba274801117a1264467a3f1d215052ebbde3209d9b9d5cf7"},"schema_version":"1.0","source":{"id":"1605.07736","kind":"arxiv","version":2}},"canonical_sha256":"a3ce97cbc27d2dd5c062e3ef2cefbce42b4cbc9a713f9591d0b8222af87096ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3ce97cbc27d2dd5c062e3ef2cefbce42b4cbc9a713f9591d0b8222af87096ed","first_computed_at":"2026-05-18T01:00:52.988873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:52.988873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zFZVt0Eky/HoEw61bmaAbWLzBmCW4MIbSJTrH2X1vLupKnelyQnF1BqtAMyBPi8NghJX/cHnLz4MNNsu217hAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:52.989473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07736","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed7408d17977ce754f329794b70acd12a7dfcf6d48d6bee57d27c90aba1b37bc","sha256:2b345f1835907bc7e092d4de158b58dabade848d0e81e8b73076b52c9327fea0"],"state_sha256":"587a514b2ab2ed04378a12bfd243d54ddc32ea543e0b1220d32c861a5a7eb73e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2b4Y3JAiD8/ntS6JOxRmHJDv9X9lJIqgVsaZUQs5lPuTk+hmmfjahnDhHDHKIsb2CVHWTu+LBy4TRKsR/wwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T17:00:54.491926Z","bundle_sha256":"b851b52377c9f283f1570544778bdc2b86928e6cc111e696dc36fa88c2cd677f"}}