{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EMUHTMAWCY5AUWTMYMXSMVBFW7","short_pith_number":"pith:EMUHTMAW","schema_version":"1.0","canonical_sha256":"232879b016163a0a5a6cc32f265425b7c5a071462ac1c2debd260f21860b2412","source":{"kind":"arxiv","id":"2108.09568","version":2},"attestation_state":"computed","paper":{"title":"Heterogeneous Graph Attention Networks for Learning Diverse Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Anirudh Patel, Esmaeil Seraj, Matthew Gombolay, Matthew Sklar, Rohan Paleja, Zheyuan Wang","submitted_at":"2021-08-21T19:35:30Z","abstract_excerpt":"Multi-agent teaming achieves better performance when there is communication among participating agents allowing them to coordinate their actions for maximizing shared utility. However, when collaborating a team of agents with different action and observation spaces, information sharing is not straightforward and requires customized communication protocols, depending on sender and receiver types. Without properly modeling such heterogeneity in agents, communication becomes less helpful and could even deteriorate the multi-agent cooperation performance. We propose heterogeneous graph attention n"},"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":"2108.09568","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2021-08-21T19:35:30Z","cross_cats_sorted":[],"title_canon_sha256":"80e654077c04fdb02e0d14ebcba745dd9111e58941a5b9d75432f88bbd119d6a","abstract_canon_sha256":"36928056315c214647993c71cfea3bf4d083e50311859a68c1a32268f453e6ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:04.404049Z","signature_b64":"z661ghTXCdwqrlUOXX9OCfsjvMYxt4MHvlt+BkypGKN75AWGSEDxxJaGYI+u1FNlMay7fXZDP+stm89+deImBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"232879b016163a0a5a6cc32f265425b7c5a071462ac1c2debd260f21860b2412","last_reissued_at":"2026-07-05T03:27:04.403564Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:04.403564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heterogeneous Graph Attention Networks for Learning Diverse Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Anirudh Patel, Esmaeil Seraj, Matthew Gombolay, Matthew Sklar, Rohan Paleja, Zheyuan Wang","submitted_at":"2021-08-21T19:35:30Z","abstract_excerpt":"Multi-agent teaming achieves better performance when there is communication among participating agents allowing them to coordinate their actions for maximizing shared utility. However, when collaborating a team of agents with different action and observation spaces, information sharing is not straightforward and requires customized communication protocols, depending on sender and receiver types. Without properly modeling such heterogeneity in agents, communication becomes less helpful and could even deteriorate the multi-agent cooperation performance. We propose heterogeneous graph attention n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.09568","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/2108.09568/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":"2108.09568","created_at":"2026-07-05T03:27:04.403624+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.09568v2","created_at":"2026-07-05T03:27:04.403624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.09568","created_at":"2026-07-05T03:27:04.403624+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMUHTMAWCY5A","created_at":"2026-07-05T03:27:04.403624+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMUHTMAWCY5AUWTM","created_at":"2026-07-05T03:27:04.403624+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMUHTMAW","created_at":"2026-07-05T03:27:04.403624+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":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EMUHTMAWCY5AUWTMYMXSMVBFW7","json":"https://pith.science/pith/EMUHTMAWCY5AUWTMYMXSMVBFW7.json","graph_json":"https://pith.science/api/pith-number/EMUHTMAWCY5AUWTMYMXSMVBFW7/graph.json","events_json":"https://pith.science/api/pith-number/EMUHTMAWCY5AUWTMYMXSMVBFW7/events.json","paper":"https://pith.science/paper/EMUHTMAW"},"agent_actions":{"view_html":"https://pith.science/pith/EMUHTMAWCY5AUWTMYMXSMVBFW7","download_json":"https://pith.science/pith/EMUHTMAWCY5AUWTMYMXSMVBFW7.json","view_paper":"https://pith.science/paper/EMUHTMAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.09568&json=true","fetch_graph":"https://pith.science/api/pith-number/EMUHTMAWCY5AUWTMYMXSMVBFW7/graph.json","fetch_events":"https://pith.science/api/pith-number/EMUHTMAWCY5AUWTMYMXSMVBFW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMUHTMAWCY5AUWTMYMXSMVBFW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMUHTMAWCY5AUWTMYMXSMVBFW7/action/storage_attestation","attest_author":"https://pith.science/pith/EMUHTMAWCY5AUWTMYMXSMVBFW7/action/author_attestation","sign_citation":"https://pith.science/pith/EMUHTMAWCY5AUWTMYMXSMVBFW7/action/citation_signature","submit_replication":"https://pith.science/pith/EMUHTMAWCY5AUWTMYMXSMVBFW7/action/replication_record"}},"created_at":"2026-07-05T03:27:04.403624+00:00","updated_at":"2026-07-05T03:27:04.403624+00:00"}