{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AHO2DXBACH4U2PNR4U4JLDDF43","short_pith_number":"pith:AHO2DXBA","schema_version":"1.0","canonical_sha256":"01dda1dc2011f94d3db1e538958c65e6dfb8763fbd095271a7e9d2d57bfd37e4","source":{"kind":"arxiv","id":"2109.05413","version":2},"attestation_state":"computed","paper":{"title":"Learning Selective Communication for Multi-Agent Path Finding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Jia Pan, Yudong Luo, Ziyuan Ma","submitted_at":"2021-09-12T03:07:20Z","abstract_excerpt":"Learning communication via deep reinforcement learning (RL) or imitation learning (IL) has recently been shown to be an effective way to solve Multi-Agent Path Finding (MAPF). However, existing communication based MAPF solvers focus on broadcast communication, where an agent broadcasts its message to all other or predefined agents. It is not only impractical but also leads to redundant information that could even impair the multi-agent cooperation. A succinct communication scheme should learn which information is relevant and influential to each agent's decision making process. To address this"},"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":"2109.05413","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-09-12T03:07:20Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"4a35445053e74d663411f780b410e15cb6dc449f0be11edf11bbc73457bd5e72","abstract_canon_sha256":"9e6aa7e703472b7d5f4021762f525f741311705e3949c7b7cee299a33e9f36d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:43:25.947007Z","signature_b64":"cW4xzJ4GAz8TW/dTgoKOe3zEPDaiLKQYk65dP/h/ShHM0es7BzMzsURjwDu5941WgkkXcdZNGRDEiYu5XBArCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01dda1dc2011f94d3db1e538958c65e6dfb8763fbd095271a7e9d2d57bfd37e4","last_reissued_at":"2026-07-05T03:43:25.946627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:43:25.946627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Selective Communication for Multi-Agent Path Finding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Jia Pan, Yudong Luo, Ziyuan Ma","submitted_at":"2021-09-12T03:07:20Z","abstract_excerpt":"Learning communication via deep reinforcement learning (RL) or imitation learning (IL) has recently been shown to be an effective way to solve Multi-Agent Path Finding (MAPF). However, existing communication based MAPF solvers focus on broadcast communication, where an agent broadcasts its message to all other or predefined agents. It is not only impractical but also leads to redundant information that could even impair the multi-agent cooperation. A succinct communication scheme should learn which information is relevant and influential to each agent's decision making process. To address this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.05413","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/2109.05413/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":"2109.05413","created_at":"2026-07-05T03:43:25.946682+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.05413v2","created_at":"2026-07-05T03:43:25.946682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.05413","created_at":"2026-07-05T03:43:25.946682+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHO2DXBACH4U","created_at":"2026-07-05T03:43:25.946682+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHO2DXBACH4U2PNR","created_at":"2026-07-05T03:43:25.946682+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHO2DXBA","created_at":"2026-07-05T03:43:25.946682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AHO2DXBACH4U2PNR4U4JLDDF43","json":"https://pith.science/pith/AHO2DXBACH4U2PNR4U4JLDDF43.json","graph_json":"https://pith.science/api/pith-number/AHO2DXBACH4U2PNR4U4JLDDF43/graph.json","events_json":"https://pith.science/api/pith-number/AHO2DXBACH4U2PNR4U4JLDDF43/events.json","paper":"https://pith.science/paper/AHO2DXBA"},"agent_actions":{"view_html":"https://pith.science/pith/AHO2DXBACH4U2PNR4U4JLDDF43","download_json":"https://pith.science/pith/AHO2DXBACH4U2PNR4U4JLDDF43.json","view_paper":"https://pith.science/paper/AHO2DXBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.05413&json=true","fetch_graph":"https://pith.science/api/pith-number/AHO2DXBACH4U2PNR4U4JLDDF43/graph.json","fetch_events":"https://pith.science/api/pith-number/AHO2DXBACH4U2PNR4U4JLDDF43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHO2DXBACH4U2PNR4U4JLDDF43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHO2DXBACH4U2PNR4U4JLDDF43/action/storage_attestation","attest_author":"https://pith.science/pith/AHO2DXBACH4U2PNR4U4JLDDF43/action/author_attestation","sign_citation":"https://pith.science/pith/AHO2DXBACH4U2PNR4U4JLDDF43/action/citation_signature","submit_replication":"https://pith.science/pith/AHO2DXBACH4U2PNR4U4JLDDF43/action/replication_record"}},"created_at":"2026-07-05T03:43:25.946682+00:00","updated_at":"2026-07-05T03:43:25.946682+00:00"}