{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:A4BMAK5TAHHWH7JRS5IUR5W6YS","short_pith_number":"pith:A4BMAK5T","canonical_record":{"source":{"id":"2106.11365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-06-21T18:50:58Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"408e4e3f756db9ef07ce983a81cd8b2713d0e977a5bf3e4a2fe85dace1ac7ec3","abstract_canon_sha256":"b229a07cf6c1969f04081cc154ab99e66ec5e6bf6dde10de96b39728263a77df"},"schema_version":"1.0"},"canonical_sha256":"0702c02bb301cf63fd31975148f6dec4abe131263d02f2e7bcfa0948acf24f5c","source":{"kind":"arxiv","id":"2106.11365","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.11365","created_at":"2026-07-05T02:51:28Z"},{"alias_kind":"arxiv_version","alias_value":"2106.11365v1","created_at":"2026-07-05T02:51:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.11365","created_at":"2026-07-05T02:51:28Z"},{"alias_kind":"pith_short_12","alias_value":"A4BMAK5TAHHW","created_at":"2026-07-05T02:51:28Z"},{"alias_kind":"pith_short_16","alias_value":"A4BMAK5TAHHWH7JR","created_at":"2026-07-05T02:51:28Z"},{"alias_kind":"pith_short_8","alias_value":"A4BMAK5T","created_at":"2026-07-05T02:51:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:A4BMAK5TAHHWH7JRS5IUR5W6YS","target":"record","payload":{"canonical_record":{"source":{"id":"2106.11365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-06-21T18:50:58Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"408e4e3f756db9ef07ce983a81cd8b2713d0e977a5bf3e4a2fe85dace1ac7ec3","abstract_canon_sha256":"b229a07cf6c1969f04081cc154ab99e66ec5e6bf6dde10de96b39728263a77df"},"schema_version":"1.0"},"canonical_sha256":"0702c02bb301cf63fd31975148f6dec4abe131263d02f2e7bcfa0948acf24f5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:28.543696Z","signature_b64":"g5aLLGWyqOcFyD+WjXOzhnySgXbulnmr8o3yUObpVnuX9fJ7K8znUQ2VRMQ1QJMVXRHNRmv4lQneojOaciH/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0702c02bb301cf63fd31975148f6dec4abe131263d02f2e7bcfa0948acf24f5c","last_reissued_at":"2026-07-05T02:51:28.543221Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:28.543221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.11365","source_version":1,"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-07-05T02:51:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jd7C6INxt/9l/svysBYfDvsKNpvnkNCiU4sqoA7fb2HKm8nrpMJovJA/f5CAH2Icra3JC30PJpAwIfOU23ClBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:45:46.428156Z"},"content_sha256":"029c73bf2c03b7814106eeab7ff86a3e48fd968fa81e65b22db5cc223b721402","schema_version":"1.0","event_id":"sha256:029c73bf2c03b7814106eeab7ff86a3e48fd968fa81e65b22db5cc223b721402"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:A4BMAK5TAHHWH7JRS5IUR5W6YS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Heuristic Multi-Agent Path Finding with Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"Hang Ma, Yudong Luo, Ziyuan Ma","submitted_at":"2021-06-21T18:50:58Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is essential to large-scale robotic systems. Recent methods have applied reinforcement learning (RL) to learn decentralized polices in partially observable environments. A fundamental challenge of obtaining collision-free policy is that agents need to learn cooperation to handle congested situations. This paper combines communication with deep Q-learning to provide a novel learning based method for MAPF, where agents achieve cooperation via graph convolution. To guide RL algorithm on long-horizon goal-oriented tasks, we embed the potential choices of shortest pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.11365","kind":"arxiv","version":1},"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/2106.11365/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"},"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-07-05T02:51:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KrtcZXLhqZxhHCTj2Za2HSxc5b3XZkJHu2XVvIN41Ra/oX2zW3ItZyy0TlXNN4HQFMEDRK1mIcgkLXDkZri/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:45:46.428705Z"},"content_sha256":"f182fdcab20cb4bbe2e0189116cfd9a944566f964b26a54e66f047765c8f1c51","schema_version":"1.0","event_id":"sha256:f182fdcab20cb4bbe2e0189116cfd9a944566f964b26a54e66f047765c8f1c51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4BMAK5TAHHWH7JRS5IUR5W6YS/bundle.json","state_url":"https://pith.science/pith/A4BMAK5TAHHWH7JRS5IUR5W6YS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4BMAK5TAHHWH7JRS5IUR5W6YS/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-08-03T17:45:46Z","links":{"resolver":"https://pith.science/pith/A4BMAK5TAHHWH7JRS5IUR5W6YS","bundle":"https://pith.science/pith/A4BMAK5TAHHWH7JRS5IUR5W6YS/bundle.json","state":"https://pith.science/pith/A4BMAK5TAHHWH7JRS5IUR5W6YS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4BMAK5TAHHWH7JRS5IUR5W6YS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:A4BMAK5TAHHWH7JRS5IUR5W6YS","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":"b229a07cf6c1969f04081cc154ab99e66ec5e6bf6dde10de96b39728263a77df","cross_cats_sorted":["cs.AI","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-06-21T18:50:58Z","title_canon_sha256":"408e4e3f756db9ef07ce983a81cd8b2713d0e977a5bf3e4a2fe85dace1ac7ec3"},"schema_version":"1.0","source":{"id":"2106.11365","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.11365","created_at":"2026-07-05T02:51:28Z"},{"alias_kind":"arxiv_version","alias_value":"2106.11365v1","created_at":"2026-07-05T02:51:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.11365","created_at":"2026-07-05T02:51:28Z"},{"alias_kind":"pith_short_12","alias_value":"A4BMAK5TAHHW","created_at":"2026-07-05T02:51:28Z"},{"alias_kind":"pith_short_16","alias_value":"A4BMAK5TAHHWH7JR","created_at":"2026-07-05T02:51:28Z"},{"alias_kind":"pith_short_8","alias_value":"A4BMAK5T","created_at":"2026-07-05T02:51:28Z"}],"graph_snapshots":[{"event_id":"sha256:f182fdcab20cb4bbe2e0189116cfd9a944566f964b26a54e66f047765c8f1c51","target":"graph","created_at":"2026-07-05T02:51:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.11365/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-Agent Path Finding (MAPF) is essential to large-scale robotic systems. Recent methods have applied reinforcement learning (RL) to learn decentralized polices in partially observable environments. A fundamental challenge of obtaining collision-free policy is that agents need to learn cooperation to handle congested situations. This paper combines communication with deep Q-learning to provide a novel learning based method for MAPF, where agents achieve cooperation via graph convolution. To guide RL algorithm on long-horizon goal-oriented tasks, we embed the potential choices of shortest pa","authors_text":"Hang Ma, Yudong Luo, Ziyuan Ma","cross_cats":["cs.AI","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-06-21T18:50:58Z","title":"Distributed Heuristic Multi-Agent Path Finding with Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.11365","kind":"arxiv","version":1},"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:029c73bf2c03b7814106eeab7ff86a3e48fd968fa81e65b22db5cc223b721402","target":"record","created_at":"2026-07-05T02:51:28Z","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":"b229a07cf6c1969f04081cc154ab99e66ec5e6bf6dde10de96b39728263a77df","cross_cats_sorted":["cs.AI","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-06-21T18:50:58Z","title_canon_sha256":"408e4e3f756db9ef07ce983a81cd8b2713d0e977a5bf3e4a2fe85dace1ac7ec3"},"schema_version":"1.0","source":{"id":"2106.11365","kind":"arxiv","version":1}},"canonical_sha256":"0702c02bb301cf63fd31975148f6dec4abe131263d02f2e7bcfa0948acf24f5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0702c02bb301cf63fd31975148f6dec4abe131263d02f2e7bcfa0948acf24f5c","first_computed_at":"2026-07-05T02:51:28.543221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:51:28.543221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g5aLLGWyqOcFyD+WjXOzhnySgXbulnmr8o3yUObpVnuX9fJ7K8znUQ2VRMQ1QJMVXRHNRmv4lQneojOaciH/Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:51:28.543696Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.11365","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:029c73bf2c03b7814106eeab7ff86a3e48fd968fa81e65b22db5cc223b721402","sha256:f182fdcab20cb4bbe2e0189116cfd9a944566f964b26a54e66f047765c8f1c51"],"state_sha256":"8685b3d52286a09339f08a64bc028566b11245501ad3f5c9a136d02d370373ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pQzupE1Wb5N6mLvvvzd3lcOOrS5HWjwqIpHOhcEOm3SZeV8ZZDGaw4PvCjoAcFbwWttg3BpnZAU0sKXkThN+AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:45:46.433644Z","bundle_sha256":"4709ae4e007f91e103e2bd4eacab063d9ae2a7d751c4c05582b93cf880a5500c"}}