{"as_of":"2026-08-09T10:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdb42e8b07c83f49d455a35e5c6a42074c473a76bcd0c204e55743c2bc33602a","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T00:03:10.927860Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T13:57:14.224655Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-02T18:47:16.862926Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"cited_work":{"arxiv_id":"2602.12024","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.12024","snapshot_observed_at":"2026-07-02T18:47:16.862926Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","venue":"cs.RO","work_id":"bb5981ac-724e-4530-8f45-9f9f8a34d0a1","year":2026},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"cited_paper":"/paper/2602.12024","citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:2e8ae71f47a3f65f15b647dfa661de226292c5ed8e17d4f9db3eb2f5dbd47c7f","observation_id":"64752cb5-d76e-42ef-bc93-b79410a3fd49","resolution":{"observed_at":"2026-07-02T18:47:16.864147Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.12024","snapshot_observed_at":"2026-08-06T13:57:14.224655Z","title":"Adaptive-horizon conflict- based search for closed-loop multi-agent path finding,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.04905","last_updated":"2026-08-05T14:33:59Z","snapshot_observed_at":"2026-08-08T23:13:25.259436Z","submitted_at":"2026-08-05T14:33:59Z","title":"PRIMAL3: Pathfinding via Reinforcement and Imitation Multi-Agent Learning - Leveraging LaCAM3","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T13:57:14.224655Z"},"links":{"cited_paper":"/paper/2602.12024","citing_paper":"/paper/2608.04905"},"observation_digest":"sha256:924ca36371165ff77ff27170115cb405799f7477c61b756a5f6853f69b8dcd17","observation_id":"5293ed49-9b86-43cc-8c0b-b966a55da970","resolution":{"observed_at":"2026-08-06T13:57:14.224655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2602.12024/citation-record","integrity":"/paper/2602.12024/integrity","json":"/paper/2602.12024/citation-record.json","paper":"/paper/2602.12024"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:07.187105Z","title":"Multi-agent pathfinding: Definitions, variants, and benchmarks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:07.187105Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:c0d9519d3962aa18021f95e4e5fb85a0c8ae9448f43e2d3c994f4a380652c264","observation_id":"9c45676f-c723-44f5-803f-4453d5c7d475","resolution":{"observed_at":"2026-08-03T00:03:07.187105Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:07.304221Z","title":"Guest editorial: A revolution in the warehouse: A retrospective on kiva systems and the grand challenges ahead,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:07.304221Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:dede0ecf4aca1057ab327adb4116e048be53e26a63701a25113979b86a5ed140","observation_id":"29f73e77-5b76-4492-bc49-effebac2c904","resolution":{"observed_at":"2026-08-03T00:03:07.304221Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:07.461767Z","title":"Accelerating search- based planning for multi-robot manipulation by leveraging online- generated experiences,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:07.461767Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:73accd66ebf376cc39b7266fa8cbf028b8354125907e4bbe646c8e56925c3139","observation_id":"1ef0eb4f-f931-47b3-83b2-ecb694515d61","resolution":{"observed_at":"2026-08-03T00:03:07.461767Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:07.664415Z","title":"Lns2+ rl: Combining multi-agent reinforcement learning with large neighborhood search in multi-agent path finding,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:07.664415Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:acb3e91611407f30c7f601e65dcc5f348f094814bedba8e448a6d6799ba780cc","observation_id":"e1c1278f-5e0d-4e7d-8659-76244dfa325e","resolution":{"observed_at":"2026-08-03T00:03:07.664415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.02010","last_updated":"2022-12-05T03:46:06Z","snapshot_observed_at":"2026-07-06T14:26:44.249882Z","submitted_at":"2022-12-05T03:46:06Z","title":"Multi Agent Path Finding using Evolutionary Game Theory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.02010","snapshot_observed_at":"2026-08-03T00:03:07.790414Z","title":"Multi agent path finding using evolu- tionary game theory,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:07.790414Z"},"links":{"cited_paper":"/paper/2212.02010","citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:a4c757723a7192352b91fd7f6444535a8cd9d89dd74969328a7c6954dc827533","observation_id":"ff2e1604-8800-4cf4-989f-b7765c3eef26","resolution":{"observed_at":"2026-08-03T00:03:07.790414Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:07.948991Z","title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:07.948991Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:4a713d995ed68da6f61d1b2f403e6905b430222c93b96e867d8313ba7f797e41","observation_id":"0cbdf3c2-4a93-4455-a225-0eb34f37c6a5","resolution":{"observed_at":"2026-08-03T00:03:07.948991Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:08.074732Z","title":"Finding optimal solutions to cooperative pathfinding problems,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:08.074732Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:987bb2a2cd058a9fd14e5fc3561305474d91b70e3935859e64aebffc33e313ef","observation_id":"afa093ab-5625-4830-afce-6a3504d8383f","resolution":{"observed_at":"2026-08-03T00:03:08.074732Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:08.250017Z","title":"Planning optimal paths for multiple robots on graphs,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:08.250017Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:cc18baf75945df141468d8ffa859543c60fa214818e498b74e6c03e21159d6cb","observation_id":"f97afe12-2bbf-4666-9984-3a017f65aaad","resolution":{"observed_at":"2026-08-03T00:03:08.250017Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:08.332144Z","title":"Mapf- lns2: Fast repairing for multi-agent path finding via large neighborhood search,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:08.332144Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:499a0f85c2ed8bbf191a34e83195f24b97c079fa9a4de40f18c75aecf422bfd3","observation_id":"594b15d1-2165-4e24-80ec-042240e86b10","resolution":{"observed_at":"2026-08-03T00:03:08.332144Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:08.418047Z","title":"Lacam: Search-based algorithm for quick multi-agent pathfinding,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:08.418047Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:8f1367c72db55a729dc78bef5c12432aebd8ffb2b86da42e85eb1965ff0abdac","observation_id":"aea3dbff-577e-4270-a0f0-15ce39ee9c1f","resolution":{"observed_at":"2026-08-03T00:03:08.418047Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:08.505791Z","title":"Anytime multi-agent path finding via large neighborhood search,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:08.505791Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:7d4a63d439d564b961081e2d83eb593e6ba204418e80fe4429b51bcc037216a1","observation_id":"677c50fe-9673-4fc3-ac1b-70642f4cd91a","resolution":{"observed_at":"2026-08-03T00:03:08.505791Z","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-07-06T15:23:49.202914Z","submitted_at":"2023-05-05T15:43:20Z","title":"Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03632","snapshot_observed_at":"2026-08-03T00:03:08.597775Z","title":"Improving lacam for scalable eventually optimal multi- agent pathfinding,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:08.597775Z"},"links":{"cited_paper":"/paper/2305.03632","citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:36c027f6acf31c9b2b968eb9ad5a7c53e461a52e8dd22a2a8de211f9e11309c6","observation_id":"5e388148-1ea9-4926-8194-4d31eb5ff535","resolution":{"observed_at":"2026-08-03T00:03:08.597775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.04292","last_updated":"2024-01-21T22:40:07Z","snapshot_observed_at":"2026-07-06T16:03:54.971351Z","submitted_at":"2023-08-08T14:36:58Z","title":"Engineering LaCAM$^\\ast$: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.04292","snapshot_observed_at":"2026-08-03T00:03:08.688527Z","title":"Engineering lacam*: Towards real-time, large-scale, and near- optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:08.688527Z"},"links":{"cited_paper":"/paper/2308.04292","citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:4c8025a4bbe738195e1ba844e9a8af6a80ed23bb2064b560c2100e18a62ed2ff","observation_id":"216f7256-202c-4d89-acd6-02b3e60e034a","resolution":{"observed_at":"2026-08-03T00:03:08.688527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.08446","last_updated":"2023-05-15T08:42:36Z","snapshot_observed_at":"2026-08-07T17:04:02.318109Z","submitted_at":"2023-05-15T08:42:36Z","title":"Tracking Progress in Multi-Agent Path Finding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.08446","snapshot_observed_at":"2026-08-03T00:03:08.841240Z","title":"Tracking progress in multi-agent path finding,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:08.841240Z"},"links":{"cited_paper":"/paper/2305.08446","citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:b8c5ac57035eadf40e8342e5ff4ee5655c4214b5ba7960b4128a99b46602406e","observation_id":"daa672ea-c980-4e9f-bae7-0daec21e0a10","resolution":{"observed_at":"2026-08-03T00:03:08.841240Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:09.019657Z","title":"Conflict-based search for optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:09.019657Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:616199e05f186c08cbafee7fb92df8de4e6aa13bccc952ea54bc747b9adac68e","observation_id":"7afbff44-f5de-4676-a7e1-965634a2ed61","resolution":{"observed_at":"2026-08-03T00:03:09.019657Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:09.139239Z","title":"Branch-and- cut-and-price for multi-agent path finding,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:09.139239Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:4c25c2619f73039d885b4fdc13b857d648383d9562df236d2908a52a5f3bdaf5","observation_id":"4b4dc03a-37fd-428e-99b7-a37357554281","resolution":{"observed_at":"2026-08-03T00:03:09.139239Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:09.262914Z","title":"The increasing cost tree search for optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:09.262914Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:760e1600ab453991a97ac1873215e92afb8d256cb70c6842e3177399c9c258af","observation_id":"486683e6-c540-4c49-a4aa-953bc028e637","resolution":{"observed_at":"2026-08-03T00:03:09.262914Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:09.429217Z","title":"Icbs: The improved conflict-based search algorithm for multi-agent pathfinding,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:09.429217Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:bc1264aef860d5b3579b76b6c463ae9ac50595fa47ecc5d91e1a548f1720610b","observation_id":"945e3fc9-3000-499f-b922-d5f88a127044","resolution":{"observed_at":"2026-08-03T00:03:09.429217Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:09.539394Z","title":"Eecbs: A bounded-suboptimal search for multi-agent path finding,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:09.539394Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:f6ba988038f37becacc4be68254078ceb303baed522299384094f45d625f8b00","observation_id":"21d15ab1-3960-416b-b0a5-2be9bb267693","resolution":{"observed_at":"2026-08-03T00:03:09.539394Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:09.720413Z","title":"Subdimensional expansion for multirobot path planning,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:09.720413Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:0b46bba330820459dd9bf82f20c17be53dbb3fa93372bba7f473fda899fd505a","observation_id":"edd83a92-76c9-4e26-9f10-ef6b7ae1a9bd","resolution":{"observed_at":"2026-08-03T00:03:09.720413Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:09.883412Z","title":"Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:09.883412Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:3282daf2f3251d2f3de20c5e09f48413b88f299ecd590449a6526eeb23ec270e","observation_id":"c6418a58-b6f4-4f94-8b68-a1a2b2792661","resolution":{"observed_at":"2026-08-03T00:03:09.883412Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:09.997355Z","title":"Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:09.997355Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:d3c68e1cadfaa4065f46ee6e9ff1d4195f9d6ff1dbe695842dba42b4500a8e53","observation_id":"95c04ca7-f7c3-423f-a9c5-cc7be5f40dd8","resolution":{"observed_at":"2026-08-03T00:03:09.997355Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:10.167637Z","title":"Fico: Finite- horizon closed-loop factorization for unified multi-agent path finding,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:10.167637Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:d4dabfa674f0f70c1651422f28622530c76d024a20d397bf405a5687f4449e17","observation_id":"d5c67f35-8479-4060-9baa-0b0e627a7338","resolution":{"observed_at":"2026-08-03T00:03:10.167637Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:10.286074Z","title":"Constrained model predictive control: Stability and optimality,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:10.286074Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:68003b8109519ef93c612ecd3f2b402fa0041e94463d682bb7dc0638485f7032","observation_id":"7b56fafd-50c8-4f68-a4ba-8e962f7e941d","resolution":{"observed_at":"2026-08-03T00:03:10.286074Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:10.393592Z","title":"Continuity and monotonicity of the mpc value function with respect to sampling time and prediction horizon,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:10.393592Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:67560625190f2372afcce8950a77eaf433355d2842039761f26837f658389616","observation_id":"8d8efb35-ad24-4952-bdc3-fe1643e37338","resolution":{"observed_at":"2026-08-03T00:03:10.393592Z","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-03T00:03:10.501753Z","title":"Lifelong multi-agent path finding for online pickup and delivery tasks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:10.501753Z"},"links":{"cited_paper":"/paper/1705.10868","citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:ba777e6d2854a395fa3b95a293a8d7cd08df96ecd2a3265c968f3b055e68d276","observation_id":"b00634ac-4684-4b50-9c75-2fa247250b5e","resolution":{"observed_at":"2026-08-03T00:03:10.501753Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:10.571165Z","title":"Multi-agent path finding with delay probabilities,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:10.571165Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:7790b19543dff9bfb3cebf394df7da4fc8650dafd7b89561a661355b1f2b44f2","observation_id":"ad977fd4-1ddd-4fda-b801-aeccaf7c0833","resolution":{"observed_at":"2026-08-03T00:03:10.571165Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:10.643466Z","title":"Lifelong multi-agent path finding in large-scale warehouses,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:10.643466Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:2e50d80731101973af72eb1162dfcc6920c921e27654ef4a6ed1eced6fd2d949","observation_id":"790fa181-2423-40cb-8565-86b01dd65047","resolution":{"observed_at":"2026-08-03T00:03:10.643466Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:10.718418Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:10.718418Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:82f0412c29b1c70f18c0dd782318f9ddb1ddd47570b475dcaa0795fa7b9e8ca4","observation_id":"4b6440a8-78ae-4029-b9b7-13d6db5bba65","resolution":{"observed_at":"2026-08-03T00:03:10.718418Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:10.776958Z","title":"Priority inheritance with backtracking for iterative multi-agent path finding,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:10.776958Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:fb5ccb9ad075db321b79c307ccded1e51f2198a9203f95feebd41e493c87824f","observation_id":"59ffcf19-bcaf-47e6-a35e-d9b9c5f69713","resolution":{"observed_at":"2026-08-03T00:03:10.776958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.07841","last_updated":"2025-04-10T15:21:23Z","snapshot_observed_at":"2026-08-07T16:06:49.144744Z","submitted_at":"2025-04-10T15:21:23Z","title":"Anytime Single-Step MAPF Planning with Anytime PIBT","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.07841","snapshot_observed_at":"2026-08-03T00:03:10.826703Z","title":"Anytime single-step mapf planning with anytime pibt,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:10.826703Z"},"links":{"cited_paper":"/paper/2504.07841","citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:ea16eb44cfc8b0dd477e54f336e0b741242daf3d21b61204642e168e00cea467","observation_id":"8d6dce36-7f2d-4901-9e28-31d9a992bb09","resolution":{"observed_at":"2026-08-03T00:03:10.826703Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:10.886737Z","title":"An empirical comparison of the hardness of multi-agent path finding under the makespan and the sum of costs objectives,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:10.886737Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:e538c240303a2153574e43cfc48e0e40f706542a1760efc2730b1427aacd0c93","observation_id":"d47423cc-874f-409d-9aa8-a24036a49f24","resolution":{"observed_at":"2026-08-03T00:03:10.886737Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:03:10.927860Z","title":"Grne and J","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:10.927860Z"},"links":{"citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:c63c47f99fae581b10a155774681165d16dcdf0edafbe84328563edc4e5abd26","observation_id":"3d616f21-a2d9-4f76-92b8-6b825c2a7d85","resolution":{"observed_at":"2026-08-03T00:03:10.927860Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","latest_version":3,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":33},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 2 inbound Pith citation observations for arXiv:2602.12024."}