{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HWLJK7PDRYAM4MM7TFJF4Y4XXZ","short_pith_number":"pith:HWLJK7PD","schema_version":"1.0","canonical_sha256":"3d96957de38e00ce319f99525e6397be400537c15201b8a0cd06d0edcf86c916","source":{"kind":"arxiv","id":"2402.05027","version":3},"attestation_state":"computed","paper":{"title":"Towards Generalizability of Multi-Agent Reinforcement Learning in Graphs with Recurrent Message Passing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Jannis Weil, Osama Abboud, Tobias Meuser, Zhenghua Bao","submitted_at":"2024-02-07T16:53:09Z","abstract_excerpt":"Graph-based environments pose unique challenges to multi-agent reinforcement learning. In decentralized approaches, agents operate within a given graph and make decisions based on partial or outdated observations. The size of the observed neighborhood limits the generalizability to different graphs and affects the reactivity of agents, the quality of the selected actions, and the communication overhead. This work focuses on generalizability and resolves the trade-off in observed neighborhood size with a continuous information flow in the whole graph. We propose a recurrent message-passing mode"},"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":"2402.05027","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2024-02-07T16:53:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"18e43399205e2e3d963ae7a1e8401efd9990e54395b78a975ade70501f2e1eaa","abstract_canon_sha256":"82adea9ecffa26b751f246f4046fa1eda88b3113f0e79deb728a35c0d4ff6dd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:03.370939Z","signature_b64":"n4S8lHJ/DXq4NQqMOOW8N1lguQ9kuJkGn+7pte1X3eciJFoIym3M6tQyqifnp2ph2HhBB4w1pWDWwOiSDB1sCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d96957de38e00ce319f99525e6397be400537c15201b8a0cd06d0edcf86c916","last_reissued_at":"2026-07-05T08:27:03.370489Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:03.370489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Generalizability of Multi-Agent Reinforcement Learning in Graphs with Recurrent Message Passing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Jannis Weil, Osama Abboud, Tobias Meuser, Zhenghua Bao","submitted_at":"2024-02-07T16:53:09Z","abstract_excerpt":"Graph-based environments pose unique challenges to multi-agent reinforcement learning. In decentralized approaches, agents operate within a given graph and make decisions based on partial or outdated observations. The size of the observed neighborhood limits the generalizability to different graphs and affects the reactivity of agents, the quality of the selected actions, and the communication overhead. This work focuses on generalizability and resolves the trade-off in observed neighborhood size with a continuous information flow in the whole graph. We propose a recurrent message-passing mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05027","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/2402.05027/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":"2402.05027","created_at":"2026-07-05T08:27:03.370546+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.05027v3","created_at":"2026-07-05T08:27:03.370546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05027","created_at":"2026-07-05T08:27:03.370546+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWLJK7PDRYAM","created_at":"2026-07-05T08:27:03.370546+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWLJK7PDRYAM4MM7","created_at":"2026-07-05T08:27:03.370546+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWLJK7PD","created_at":"2026-07-05T08:27:03.370546+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.06665","citing_title":"TrajAware: Graph Cross-Attention and Trajectory-Aware for Generalisable VANETs under Partial Observations","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HWLJK7PDRYAM4MM7TFJF4Y4XXZ","json":"https://pith.science/pith/HWLJK7PDRYAM4MM7TFJF4Y4XXZ.json","graph_json":"https://pith.science/api/pith-number/HWLJK7PDRYAM4MM7TFJF4Y4XXZ/graph.json","events_json":"https://pith.science/api/pith-number/HWLJK7PDRYAM4MM7TFJF4Y4XXZ/events.json","paper":"https://pith.science/paper/HWLJK7PD"},"agent_actions":{"view_html":"https://pith.science/pith/HWLJK7PDRYAM4MM7TFJF4Y4XXZ","download_json":"https://pith.science/pith/HWLJK7PDRYAM4MM7TFJF4Y4XXZ.json","view_paper":"https://pith.science/paper/HWLJK7PD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.05027&json=true","fetch_graph":"https://pith.science/api/pith-number/HWLJK7PDRYAM4MM7TFJF4Y4XXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/HWLJK7PDRYAM4MM7TFJF4Y4XXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWLJK7PDRYAM4MM7TFJF4Y4XXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWLJK7PDRYAM4MM7TFJF4Y4XXZ/action/storage_attestation","attest_author":"https://pith.science/pith/HWLJK7PDRYAM4MM7TFJF4Y4XXZ/action/author_attestation","sign_citation":"https://pith.science/pith/HWLJK7PDRYAM4MM7TFJF4Y4XXZ/action/citation_signature","submit_replication":"https://pith.science/pith/HWLJK7PDRYAM4MM7TFJF4Y4XXZ/action/replication_record"}},"created_at":"2026-07-05T08:27:03.370546+00:00","updated_at":"2026-07-05T08:27:03.370546+00:00"}