{"as_of":"2026-08-11T13:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:25c33be6a97d7454aef10ab7432436d053d1e84f99012ed23a2b1b885fa4cf4f","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:20:18.987183Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-23T02:03:47.244209Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T02:05:19.509866Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"cited_work":{"arxiv_id":"2505.19219","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.19219","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Where paths collide: A comprehensive survey of classic and learning-based multi-agent pathfinding","venue":null,"work_id":"d34adc0a-23ad-41a1-943f-59b97c551b95","year":2025},"citing_paper":{"arxiv_id":"2503.04798","last_updated":"2026-04-19T14:14:33Z","snapshot_observed_at":"2026-08-03T18:45:27.919056Z","submitted_at":"2025-03-03T05:26:59Z","title":"Advancing MAPF Toward the Real World: A Scalable Multi-Agent Realistic Testbed (SMART)","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-23T02:03:47.244209Z"},"links":{"cited_paper":"/paper/2505.19219","citing_paper":"/paper/2503.04798"},"observation_digest":"sha256:0edc0f1cd730184e2c35439919e694af8db55a44189beb061994c2f38f33bb40","observation_id":"6a6d821e-f344-472a-9214-c2edb4757088","resolution":{"observed_at":"2026-05-23T02:05:19.514246Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.19219/citation-record","integrity":"/paper/2505.19219/integrity","json":"/paper/2505.19219/citation-record.json","paper":"/paper/2505.19219"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:20:21.790188Z","title":"Odrm* optimal multirobot path plan- ning in low dimensional search spaces","venue":null,"work_id":"ca716668-e01c-4697-810c-04dc88be25b2","year":2013},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:16.837612Z"},"links":{"citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:a8319802d293943ea3cb4fa6748d1ff2ece82d2d0703c478329c30b0f19fe8b3","observation_id":"dfb277bb-8cd6-40e1-b17b-682d376615bd","resolution":{"observed_at":"2026-08-07T14:20:21.995003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03063","last_updated":"2024-08-06T09:34:54Z","snapshot_observed_at":"2026-08-09T23:45:08.099544Z","submitted_at":"2024-08-06T09:34:54Z","title":"Social Behavior as a Key to Learning-based Multi-Agent Pathfinding Dilemmas","version":1},"cited_work":{"arxiv_id":"2408.03063","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.03063","snapshot_observed_at":"2026-08-07T14:20:20.887048Z","title":"Social Behavior as a Key to Learning-based Multi-Agent Pathfinding Dilemmas","venue":"cs.RO","work_id":"7fb69deb-f185-4249-8683-17ec0c710cad","year":2024},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:16.985547Z"},"links":{"cited_paper":"/paper/2408.03063","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:3d62f1940be597e0b899fc98335b4dcd1df5b31f42cf9c2b431aa86363317662","observation_id":"b78f58d8-3e88-4e50-b540-3083e5adb3fa","resolution":{"observed_at":"2026-08-07T14:20:21.020894Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.18821","last_updated":"2025-03-24T16:00:59Z","snapshot_observed_at":"2026-08-07T16:40:46.555440Z","submitted_at":"2025-03-24T16:00:59Z","title":"Formalization of Optimality Conditions for Smooth Constrained Optimization Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.18821","snapshot_observed_at":"2026-08-07T14:20:17.064529Z","title":"Formalization of optimality conditions for smooth constrained optimization problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.064529Z"},"links":{"cited_paper":"/paper/2503.18821","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:f10d7217307addc2062b296edff9de2bc302c8dfb47b1aaab272b7b561b4f155","observation_id":"58361718-96d4-4821-a2cc-317fb00c7498","resolution":{"observed_at":"2026-08-07T14:20:17.064529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13750","last_updated":"2024-10-27T09:09:58Z","snapshot_observed_at":"2026-08-01T22:31:05.698611Z","submitted_at":"2024-08-25T07:32:58Z","title":"Multi-Agent Target Assignment and Path Finding for Intelligent Warehouse: A Cooperative Multi-Agent Deep Reinforcement Learning Perspective","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13750","snapshot_observed_at":"2026-08-07T14:20:17.394115Z","title":"Evolution of heuristics: Towards efficient automatic algorithm design using large language model","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.394115Z"},"links":{"cited_paper":"/paper/2408.13750","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:8bc0af2d1b0845b59cc0352a38851d8d6e6ebdbd54ef677ffa30e443a44265cb","observation_id":"9c2142cb-a13d-493c-a3f5-33d1cd687e0d","resolution":{"observed_at":"2026-08-07T14:20:17.394115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.10868","last_updated":"2017-05-30T21:08:16Z","snapshot_observed_at":"2026-07-06T05:44:54.771849Z","submitted_at":"2017-05-30T21:08:16Z","title":"Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.10868","snapshot_observed_at":"2026-08-07T14:20:17.490938Z","title":"Lifelong multi-agent path finding for online pickup and delivery tasks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.490938Z"},"links":{"cited_paper":"/paper/1705.10868","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:773724d90e34bcce73888ec9d93c56d3a67393f35be6766e16a73f7629da2756","observation_id":"1683716c-45e9-40d5-94c4-add1a99b62ae","resolution":{"observed_at":"2026-08-07T14:20:17.490938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.05893","last_updated":"2020-12-11T14:51:22Z","snapshot_observed_at":"2026-08-09T15:02:49.560936Z","submitted_at":"2020-12-10T18:54:27Z","title":"Flatland-RL : Multi-Agent Reinforcement Learning on Trains","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.05893","snapshot_observed_at":"2026-08-07T14:20:17.624351Z","title":"Flatland-RL: Multi-agent reinforcement learning on trains","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.624351Z"},"links":{"cited_paper":"/paper/2012.05893","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:f1051f3ff8c6e9ddbc0fee8dac5fe7fe0e84041dccd21164548e32ad8a00160a","observation_id":"a634e927-9015-4928-9217-6413656ac55b","resolution":{"observed_at":"2026-08-07T14:20:17.624351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03632","last_updated":"2023-05-05T15:43:20Z","snapshot_observed_at":"2026-08-09T20:59:40.254472Z","submitted_at":"2023-05-05T15:43:20Z","title":"Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding","version":1},"cited_work":{"arxiv_id":"2305.03632","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.03632","snapshot_observed_at":"2026-08-07T14:20:20.665236Z","title":"Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding","venue":"cs.AI","work_id":"a95fe4d0-1dd4-43c1-a82b-89a14a02d80b","year":2023},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.723877Z"},"links":{"cited_paper":"/paper/2305.03632","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:55c13e27b656cb2168e382db3ca818afb25c194e804cb756abff9b1c2f3a535b","observation_id":"928d5bad-3f1c-457f-a701-9dee3a73c0ae","resolution":{"observed_at":"2026-08-07T14:20:20.710669Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10149","last_updated":"2020-12-14T05:19:36Z","snapshot_observed_at":"2026-08-09T21:00:03.836541Z","submitted_at":"2019-05-24T11:12:25Z","title":"winPIBT: Extended Prioritized Algorithm for Iterative Multi-agent Path Finding","version":5},"cited_work":{"arxiv_id":"1905.10149","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.10149","snapshot_observed_at":"2026-08-07T14:20:20.525674Z","title":"winPIBT: Extended Prioritized Algorithm for Iterative Multi-agent Path Finding","venue":"cs.MA","work_id":"bc879eab-9e2c-40c7-a6f7-231c6333111b","year":2019},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.819213Z"},"links":{"cited_paper":"/paper/1905.10149","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:9812c29867d20885e4f75a5d800ab2c61f1a26fe7d9b976e6d082a8e6908467b","observation_id":"5299c64e-8d16-4d58-b320-80cd5ad0b5c6","resolution":{"observed_at":"2026-08-07T14:20:20.579937Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.02010","last_updated":"2022-12-05T03:46:06Z","snapshot_observed_at":"2026-08-10T21:00:02.343903Z","submitted_at":"2022-12-05T03:46:06Z","title":"Multi Agent Path Finding using Evolutionary Game Theory","version":1},"cited_work":{"arxiv_id":"2212.02010","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.02010","snapshot_observed_at":"2026-08-07T14:20:20.267939Z","title":"Multi Agent Path Finding using Evolutionary Game Theory","venue":"cs.MA","work_id":"5e668bed-0fb5-49b0-9c31-5ac05632388f","year":2022},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.012983Z"},"links":{"cited_paper":"/paper/2212.02010","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:75833c9f5cfbacf8f982b93e074322df82f029e894d81e015448bc93c5db857a","observation_id":"7e006c41-b4bd-44d5-99d4-23e6e9723200","resolution":{"observed_at":"2026-08-07T14:20:20.320352Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.05860","last_updated":"2024-02-10T14:35:44Z","snapshot_observed_at":"2026-07-06T17:14:15.453464Z","submitted_at":"2024-01-11T12:11:24Z","title":"Confidence-Based Curriculum Learning for Multi-Agent Path Finding","version":2},"cited_work":{"arxiv_id":"2401.05860","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.05860","snapshot_observed_at":"2026-08-07T14:20:20.119315Z","title":"Confidence-Based Curriculum Learning for Multi-Agent Path Finding","venue":"cs.MA","work_id":"56f43032-ab2d-4465-9478-b514e55a8d17","year":2024},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.108613Z"},"links":{"cited_paper":"/paper/2401.05860","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:3b29b2a6ff2f13d0d645d7c68275db847a33667d19f4358f2bee1d11dd0005e4","observation_id":"6a867521-a2df-44b0-b4b2-a0956c7f4129","resolution":{"observed_at":"2026-08-07T14:20:20.173975Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09134","last_updated":"2020-12-05T08:56:58Z","snapshot_observed_at":"2026-07-06T10:25:07.893937Z","submitted_at":"2020-12-05T08:56:58Z","title":"Multi-agent navigation based on deep reinforcement learning and traditional pathfinding algorithm","version":1},"cited_work":{"arxiv_id":"2012.09134","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.09134","snapshot_observed_at":"2026-08-07T14:20:19.982900Z","title":"Multi-agent navigation based on deep reinforcement learning and traditional pathfinding algorithm","venue":"cs.MA","work_id":"e283a67d-ff57-4bfc-9f2f-0ffbaaebb70e","year":2020},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.185373Z"},"links":{"cited_paper":"/paper/2012.09134","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:03a51640f15d024dd071f1ad0e120e262b814b20dafe55a806954de0e935836e","observation_id":"9ede09fa-f5a9-4aff-8cf1-62b209db12c9","resolution":{"observed_at":"2026-08-07T14:20:20.032582Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.12461","last_updated":"2024-12-19T11:16:44Z","snapshot_observed_at":"2026-08-11T10:27:19.059201Z","submitted_at":"2021-02-24T18:41:37Z","title":"MAPFAST: A Deep Algorithm Selector for Multi Agent Path Finding using Shortest Path Embeddings","version":2},"cited_work":{"arxiv_id":"2102.12461","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.12461","snapshot_observed_at":"2026-08-07T14:20:19.865821Z","title":"MAPFAST: A Deep Algorithm Selector for Multi Agent Path Finding using Shortest Path Embeddings","venue":"cs.MA","work_id":"a2192948-c810-40c0-b526-495f9cb87ed3","year":2021},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.259433Z"},"links":{"cited_paper":"/paper/2102.12461","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:ad57faffb3819375772681bf9a8e434c3c5a507755f3d5faddc8b8454d6c26f8","observation_id":"0e395897-4864-47a2-b562-63e671047807","resolution":{"observed_at":"2026-08-07T14:20:19.913009Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.00717","last_updated":"2025-03-02T03:49:15Z","snapshot_observed_at":"2026-08-07T17:36:32.297751Z","submitted_at":"2025-03-02T03:49:15Z","title":"LLMDR: LLM-Driven Deadlock Detection and Resolution in Multi-Agent Pathfinding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.00717","snapshot_observed_at":"2026-08-07T14:20:18.362271Z","title":"Llmdr: Llm-driven dead- lock detection and resolution in multi-agent pathfinding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.362271Z"},"links":{"cited_paper":"/paper/2503.00717","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:94e141b5bb9b59eec532a733fa03078694b77498f791aa6d1be4540bbc069ca6","observation_id":"4293428d-4f2f-4acc-a09e-a32d35bdd65f","resolution":{"observed_at":"2026-08-07T14:20:18.362271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.03992","last_updated":"2019-06-15T13:55:12Z","snapshot_observed_at":"2026-07-06T07:59:14.602642Z","submitted_at":"2019-06-10T14:10:49Z","title":"Automatic Algorithm Selection In Multi-agent Pathfinding","version":2},"cited_work":{"arxiv_id":"1906.03992","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.03992","snapshot_observed_at":"2026-08-07T14:20:19.699211Z","title":"Automatic Algorithm Selection In Multi-agent Pathfinding","venue":"cs.AI","work_id":"5548f717-bb80-480e-92b1-a373800e9272","year":2019},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.454334Z"},"links":{"cited_paper":"/paper/1906.03992","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:bdba7e35afdf6a6421e8118bb5d66d3d8dba0244ae175c7117123662d61d76f8","observation_id":"24fde042-6bf6-4a0d-b6a4-a22220d28497","resolution":{"observed_at":"2026-08-07T14:20:19.745297Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.14931","last_updated":"2025-04-08T08:14:39Z","snapshot_observed_at":"2026-08-10T06:27:36.826396Z","submitted_at":"2024-07-20T16:37:21Z","title":"POGEMA: A Benchmark Platform for Cooperative Multi-Agent Pathfinding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.14931","snapshot_observed_at":"2026-08-07T14:20:18.526685Z","title":"POGEMA: A benchmark platform for cooperative multi-agent navigation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.526685Z"},"links":{"cited_paper":"/paper/2407.14931","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:761abb41d9fc93276db86e81581665bc62f972107be7cd1ef47104c333aa730e","observation_id":"96f940d7-249e-4ec9-a9f1-011e2d5fadee","resolution":{"observed_at":"2026-08-07T14:20:18.526685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.09451","last_updated":"2025-05-28T18:16:51Z","snapshot_observed_at":"2026-08-11T10:45:33.808697Z","submitted_at":"2024-07-12T17:34:45Z","title":"Reevaluation of Large Neighborhood Search for MAPF: Findings and Opportunities","version":2},"cited_work":{"arxiv_id":"2407.09451","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.09451","snapshot_observed_at":"2026-08-07T14:20:19.318357Z","title":"Reevaluation of Large Neighborhood Search for MAPF: Findings and Opportunities","venue":"cs.RO","work_id":"63fbc137-af89-45a6-99d9-8e36b4613c68","year":2024},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.686763Z"},"links":{"cited_paper":"/paper/2407.09451","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:113c41ed1be53e34f9bbe99a3f60c1a87d34ef0813c5781eb5bd5712a260121d","observation_id":"20663c9a-4c9f-4936-beb9-82b8afad35db","resolution":{"observed_at":"2026-08-07T14:20:19.399604Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07559","last_updated":"2024-07-10T08:36:48Z","snapshot_observed_at":"2026-08-10T18:22:50.099695Z","submitted_at":"2024-03-12T11:47:12Z","title":"Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07559","snapshot_observed_at":"2026-08-07T14:20:18.775994Z","title":"Ensembling prioritized hybrid policies for multi-agent pathfinding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.775994Z"},"links":{"cited_paper":"/paper/2403.07559","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:191a4fc90fd940c72e6196cdc83803dbb8bd456a55c17688e25c196d90611c91","observation_id":"7e9a7097-30a1-45b8-8d1a-1d6d2ba52413","resolution":{"observed_at":"2026-08-07T14:20:18.775994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:20:21.262824Z","title":"M*: A complete multirobot path planning algorithm with performance bounds","venue":null,"work_id":"0367215d-7e70-4a62-95d8-e4c6973055cd","year":2011},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.830412Z"},"links":{"citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:8292a8304c01fbf776f2e160d99d53249409b6ae05c90ea610993561d73719b2","observation_id":"7629778c-1ebc-4642-9c78-d6a525aa491a","resolution":{"observed_at":"2026-08-07T14:20:21.394136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17794","last_updated":"2025-01-31T12:54:03Z","snapshot_observed_at":"2026-08-02T04:25:25.889409Z","submitted_at":"2024-05-28T03:45:32Z","title":"LNS2+RL: Combining Multi-Agent Reinforcement Learning with Large Neighborhood Search in Multi-Agent Path Finding","version":3},"cited_work":{"arxiv_id":"2405.17794","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.17794","snapshot_observed_at":"2026-08-07T14:20:19.132754Z","title":"LNS2+RL: Combining Multi-Agent Reinforcement Learning with Large Neighborhood Search in Multi-Agent Path Finding","venue":"cs.RO","work_id":"6f87c039-c48a-42f2-a73e-d8841bc4fed0","year":2024},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.909676Z"},"links":{"cited_paper":"/paper/2405.17794","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:8c473f0e60ad3f64a7dc3508394e5a0eeeb0ef669ded563711cce66c0bf4b4ab","observation_id":"decdae40-8fa6-4c67-ba2d-f7112c8a436e","resolution":{"observed_at":"2026-08-07T14:20:19.207331Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.04168","last_updated":"2024-10-17T06:43:13Z","snapshot_observed_at":"2026-07-06T18:58:09.650413Z","submitted_at":"2024-08-08T02:28:43Z","title":"Perceive, Reflect, and Plan: Designing LLM Agent for Goal-Directed City Navigation without Instructions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.04168","snapshot_observed_at":"2026-08-07T14:20:18.987183Z","title":"Perceive, reflect, and plan: Designing llm agent for goal-directed city navigation without instructions","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.987183Z"},"links":{"cited_paper":"/paper/2408.04168","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:49ae71c7135c705f4d15cf01a8bb02e020e11c18260b7d30744edbf629ef2109","observation_id":"7a2ac8c6-6b36-48a7-9eb3-9d4fba257dd4","resolution":{"observed_at":"2026-08-07T14:20:18.987183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:20:22.136438Z","title":"Formal verification of piece-wise linear feed-forward neural networks","venue":null,"work_id":"2e57238c-a898-4d0e-b5c8-db6f21c071b5","year":2017},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:16.688404Z"},"links":{"citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:519b1b70e018541c6a90fa2bbd0b3ecb976c9ece41979e6d7135b7c4bd3ff9c0","observation_id":"c03aa72e-6554-4b21-b2a1-d82aa71eebbf","resolution":{"observed_at":"2026-08-07T14:20:22.212145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:20:16.915874Z","title":"Scalable mechanism design for multi-agent path finding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:16.915874Z"},"links":{"citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:86fa4dcedf41cec101c5d9390a85101e14c47337896e40afd5fb07058e169a90","observation_id":"6a67b3f0-0759-4470-869d-400fc974abd9","resolution":{"observed_at":"2026-08-07T14:20:16.915874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.09820","last_updated":"2019-03-23T13:27:32Z","snapshot_observed_at":"2026-07-06T07:41:09.018277Z","submitted_at":"2019-03-23T13:27:32Z","title":"Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT)","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.09820","snapshot_observed_at":"2026-08-07T14:20:18.615429Z","title":"Conflict handling framework in generalized multi-agent path finding: Advantages and shortcomings of satisfiability modulo approach","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:18.615429Z"},"links":{"cited_paper":"/paper/1903.09820","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:8a56671aa56632f299aa7b0c4083beed14dd8d465fb119399d2f7e2df4117ec7","observation_id":"ff82c637-eb77-4dc8-a463-e8c0ecfea60f","resolution":{"observed_at":"2026-08-07T14:20:18.615429Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.07132","last_updated":"2023-04-08T08:00:00Z","snapshot_observed_at":"2026-07-06T11:09:41.435966Z","submitted_at":"2021-05-15T04:05:01Z","title":"Offline Time-Independent Multi-Agent Path Planning","version":3},"cited_work":{"arxiv_id":"2105.07132","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.07132","snapshot_observed_at":"2026-08-07T14:20:20.407148Z","title":"Offline Time-Independent Multi-Agent Path Planning","venue":"cs.MA","work_id":"e8cfd04b-ddc0-44c9-a507-c800641c879c","year":2021},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.917831Z"},"links":{"cited_paper":"/paper/2105.07132","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:505394223a57a3b2c40a58aa59cafce21923a57f7b23fd94d8bfe955bb78c37e","observation_id":"b0964045-ac46-478c-ab61-438d5c8a7697","resolution":{"observed_at":"2026-08-07T14:20:20.449584Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:20:21.525972Z","title":"Anytime multi- agent path finding via large neighborhood search","venue":null,"work_id":"b01523c6-6ab8-47e3-9cef-1ac3b65817f3","year":2020},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.164612Z"},"links":{"citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:41621a63a6741e9839fb5ded0c7190942d35b54912f87fb198812b2f9880ee1d","observation_id":"a5ce5b98-f0c5-4eec-ac24-032c1b1d8d5f","resolution":{"observed_at":"2026-08-07T14:20:21.635207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:20:22.228304Z","title":"Accessed: 2024-12-03","venue":null,"work_id":"fa992393-9954-4d7c-924a-4a87fd6b4a69","year":2024},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:16.478315Z"},"links":{"citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:1e46850ee155496a2ec571c470ede8945c5425d69d78b48afa159dd99aa0a50f","observation_id":"76b0651f-42ae-4715-990e-e9fd5eb80e1a","resolution":{"observed_at":"2026-08-07T14:20:22.285935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.03630","last_updated":"2024-02-09T17:48:19Z","snapshot_observed_at":"2026-07-06T17:12:34.262376Z","submitted_at":"2024-01-08T02:22:04Z","title":"Why Solving Multi-agent Path Finding with Large Language Model has not Succeeded Yet","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.03630","snapshot_observed_at":"2026-08-07T14:20:16.605756Z","title":"Towards deployment-efficient and collision-free multi-agent path finding (student abstract)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:16.605756Z"},"links":{"cited_paper":"/paper/2401.03630","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:a1204b55cbe79684fbfc96a47e6012ad88399b1e6d2f7732c0e96132a72c1878","observation_id":"8f72e3f5-ef28-4dca-985c-ba1c71128c81","resolution":{"observed_at":"2026-08-07T14:20:16.605756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.17993","last_updated":"2024-12-23T21:27:19Z","snapshot_observed_at":"2026-08-11T05:06:01.836939Z","submitted_at":"2024-12-23T21:27:19Z","title":"Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.17993","snapshot_observed_at":"2026-08-07T14:20:17.296657Z","title":"Multi-agent path finding in continuous spaces with projected diffusion models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.296657Z"},"links":{"cited_paper":"/paper/2412.17993","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:6417e85161948e6a7428442f1a70ecf74d2fba644790cc67673cb613a6c0d7c7","observation_id":"951789c2-afc1-435d-bc43-18f6214094f2","resolution":{"observed_at":"2026-08-07T14:20:17.296657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:20:22.428478Z","title":"Mapfaster: A faster and simpler take on multi-agent path finding algorithm selection","venue":null,"work_id":"6b2b4099-d859-475f-9f98-b733fb0c071e","year":2022},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:16.416386Z"},"links":{"citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:42c94e51e685c476b7772c510fcb36cb222a44f7cc12bbd6677e354c45724f95","observation_id":"1aa2af82-e184-4e40-92f6-d61bd00085c1","resolution":{"observed_at":"2026-08-07T14:20:22.482261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":11,"verified_fuzzy":6},"total_outbound_references":29},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 1 inbound Pith citation observation for arXiv:2505.19219."}