{"as_of":"2026-08-11T12:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cca3c8289e8465778b4cfcdf5d4e6c62f476c04fb7c4e71ab26f74e039066b3b","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:35:37.055249Z","state":"measured"},{"denominator":54,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":54,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.23793/citation-record","integrity":"/paper/2506.23793/integrity","json":"/paper/2506.23793/citation-record.json","paper":"/paper/2506.23793"},"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-06T21:35:37.919508Z","title":"Lifelong multi-agent path finding in large-scale warehouses,","venue":null,"work_id":"48c0ef5f-550f-4144-bfc1-b8dbeb4f1b44","year":2021},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:35.865921Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:caa13b44c7053e9e93cb5e1bd0231761d55bd49c6a01d26081468078c2959182","observation_id":"dd1aa3ae-04b9-4a14-940c-a6a63d5ed1ce","resolution":{"observed_at":"2026-08-06T21:35:37.924230Z","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-06T21:35:37.902309Z","title":"Intersection coordination with priority-based search for autonomous vehicles,","venue":null,"work_id":"9ea9a07e-b8e4-4a0b-a3f0-15bd1f402113","year":2023},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:35.920514Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:7748c7ecb37fd7bf830c1f6543e241436a619f64f4218390139d517a40f57e4c","observation_id":"c9517f9b-c180-45f1-b9a1-19dbcfa9671c","resolution":{"observed_at":"2026-08-06T21:35:37.907925Z","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-06T21:35:37.886539Z","title":"Multi-agent pathfinding: Definitions, variants, and benchmarks,","venue":null,"work_id":"e4668ff7-59c4-4578-bf43-6c70eda35d61","year":2019},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:35.960729Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:98973d2e1641867f06cc5dac0c53ab47f262644728265ca83093bd45c10927dd","observation_id":"dd09f6f7-68b0-4023-974f-679332f6fe28","resolution":{"observed_at":"2026-08-06T21:35:37.891062Z","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-06T21:35:37.871323Z","title":"Multi-agent path finding with kinematic constraints","venue":null,"work_id":"64836259-be51-452d-ae1b-5a8823e6c935","year":2016},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.006100Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:56161d327e5b80649cb3e0f10ce8cedc29c8810e8319da558db2f09407e9b832","observation_id":"74a29688-5cc0-411e-8cff-2fc398f23c9e","resolution":{"observed_at":"2026-08-06T21:35:37.876264Z","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-06T21:35:37.855200Z","title":"Lifelong path planning with kinematic constraints for multi-agent pickup and delivery,","venue":null,"work_id":"50b7dd68-0315-40f9-ae3b-d50fe87801b7","year":2019},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.055700Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:524d6d7a2ef2aad8ad1841ba75293c64c1591f57ac1e5e077e51ad2cd54304c9","observation_id":"6b4e0237-a65e-4959-a0b3-692c861e3b8e","resolution":{"observed_at":"2026-08-06T21:35:37.860182Z","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-06T21:35:37.840055Z","title":"Prioritized multi- agent path finding for differential drive robots,","venue":null,"work_id":"985fc400-3c45-4720-ac4e-306066689a67","year":2019},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.087353Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:a9c1e494ea5821c86dad6e5809f048735bfb5cf31a665ecf1349443fb7503e52","observation_id":"dfcf9b5e-c1d7-434d-9c80-a871a1e0b04a","resolution":{"observed_at":"2026-08-06T21:35:37.844635Z","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-06T21:35:37.824371Z","title":"Finding optimal solutions to cooperative pathfinding problems,","venue":null,"work_id":"8e36308e-eb6f-4796-b695-7ca59a19e301","year":2010},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.134757Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:01acce1cea3a6f31f6cee14e34ef93c53c469f54742b3d1443cc30e5ca828a7e","observation_id":"69500802-7848-440b-aeca-c2e38c1bc105","resolution":{"observed_at":"2026-08-06T21:35:37.829675Z","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-06T21:35:36.162983Z","title":"Conflict-based search for optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.162983Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:5d945b2dfeaead44bc1de1f49d6cef6d65a88273f595c4d623f3793a89001e18","observation_id":"22aee36e-0e67-427e-ac24-b4e5cdb94fe1","resolution":{"observed_at":"2026-08-06T21:35:36.162983Z","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-06T21:35:37.799472Z","title":"M*: A complete multirobot path planning algorithm with performance bounds,","venue":null,"work_id":"a7ba9e72-8bba-4d66-9532-d0db19f6bd10","year":2011},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.203090Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:f502ee757635706f1275ccad0f0c21fa408cc2b39999f60b047b807cce903589","observation_id":"7be0efe0-df7a-4076-8f2b-c639b71e2881","resolution":{"observed_at":"2026-08-06T21:35:37.804391Z","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-06T21:35:37.782705Z","title":"Efficient sat approach to multi-agent path finding under the sum of costs objec- tive,","venue":null,"work_id":"b4f8cd0d-ac07-4eff-9a61-5ff79e09a172","year":2016},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.289801Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:b837a7a5ed81683a55b44792e13aec39d256ac08ce77bd52570e3b8bba188594","observation_id":"7cad0169-906d-402d-a316-f7eb9e944248","resolution":{"observed_at":"2026-08-06T21:35:37.788053Z","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-06T21:35:36.360084Z","title":"Priority inheritance with backtracking for iterative multi-agent path finding,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.360084Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:32046742ae5fc281895fca6748220a932d6d8dacc7c0e2e6492066ff40e50eb9","observation_id":"71986a9f-b3ad-41d5-b632-a04c88613673","resolution":{"observed_at":"2026-08-06T21:35:36.360084Z","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-06T21:35:37.754193Z","title":"Lacam: Search-based algorithm for quick multi-agent pathfinding,","venue":null,"work_id":"3458893b-c1c0-4592-aa3d-98c22059d8e9","year":2023},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.439522Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:0a1f40afaee1fc52c9ea062c33e80cc9dd8b960c3ae3e386f5cfd7519bb7f899","observation_id":"05f9de3f-0fbb-4b86-bb98-4044f62ad7ce","resolution":{"observed_at":"2026-08-06T21:35:37.758995Z","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-06T21:35:37.737929Z","title":"Mapf- lns2: Fast repairing for multi-agent path finding via large neighbor- hood search,","venue":null,"work_id":"2863b498-bb36-4355-b746-0c3c4c74646a","year":2022},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.521821Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:8b385f65e64d59748cffa4879da7d245167f50bac74b9363ba2b2f14ec06cfd7","observation_id":"0deaa79c-e118-4c54-8a33-2572edd8bb48","resolution":{"observed_at":"2026-08-06T21:35:37.742620Z","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-06T21:35:37.720961Z","title":"An optimization variant of multi-robot path planning is intractable,","venue":null,"work_id":"ef3152e1-6503-493f-a9db-d1ad134a4d6a","year":2010},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.605384Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:bb493c512149438c48e33963bf8187b5ad294dacbfd8938de35945310a90c792","observation_id":"14eced16-b9fd-4eab-bfad-7897be68721f","resolution":{"observed_at":"2026-08-06T21:35:37.725356Z","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-06T21:35:37.706333Z","title":"Mapper: Multi-agent path planning with evolutionary reinforcement learning in mixed dynamic environments,","venue":null,"work_id":"8b8934c7-a3ff-40c0-99a5-bf5bcfe76e2a","year":2020},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.680447Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:62263282e201939c11cd20ad380e3d6b36db33f67b97612830691585a48410df","observation_id":"4df54157-e9e9-40ab-8bc7-7e2aee4360ae","resolution":{"observed_at":"2026-08-06T21:35:37.710774Z","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-06T21:35:37.692327Z","title":"Message-aware graph attention networks for large-scale multi-robot path planning,","venue":null,"work_id":"5aaf95a2-8199-4444-8c4d-e6bc63e768aa","year":2021},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.779224Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:c4e19d478fa9da67b17914b6f826762abe5644da88f6ee6230fb7dd60ddbd32e","observation_id":"6861167c-84eb-4f40-9bb9-f8338981f494","resolution":{"observed_at":"2026-08-06T21:35:37.696492Z","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-06T21:35:37.676668Z","title":"Scrimp: Scalable communication for reinforcement-and imitation-learning-based multi- agent pathfinding,","venue":null,"work_id":"04b7a827-bf31-43b4-b205-cd5c357cdf6a","year":2023},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.834148Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:b9fd51af1c5049d69cf57b9908941f4f0a7b7b615fceab9d84d7d417ea626d2d","observation_id":"ed2b60aa-c3a4-4464-8dbc-14711689e6fe","resolution":{"observed_at":"2026-08-06T21:35:37.681717Z","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-06T21:35:37.660633Z","title":"Distributed heuristic multi-agent path finding with communication,","venue":null,"work_id":"6acd2db4-1ba8-4528-93c1-fe0b7fbcad4b","year":2021},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.870700Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:79974bea5178aa94e7e459b3b817ffe021d9964e5638d4c62c6909d41b9f0204","observation_id":"c81b304f-b780-4af8-ba06-2a815f7796ac","resolution":{"observed_at":"2026-08-06T21:35:37.666510Z","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-06T21:35:37.645742Z","title":"Learning selective communication for multi-agent path finding,","venue":null,"work_id":"5eb2919c-6971-4162-9f3c-e4d99b8b1b30","year":2021},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.875574Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:2b0cbd000928eef8071f065a30eea97343d30b40a937aba25e528bd3d9f7246a","observation_id":"f0d1302e-cd4c-4e2e-9eab-c3324ee933f3","resolution":{"observed_at":"2026-08-06T21:35:37.650608Z","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-06T21:35:37.629943Z","title":"Ensembling prioritized hybrid policies for multi-agent pathfinding,","venue":null,"work_id":"73889171-f915-4077-8203-c6dbe02a5fed","year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.880167Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:d76f589caf7c04a47153c9786917c5295b987f0415cf57d29f91a8fcab93d804","observation_id":"3db4e1f0-2577-4c17-b508-38eadf3dfa9f","resolution":{"observed_at":"2026-08-06T21:35:37.635184Z","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-06T21:35:37.614342Z","title":"Learn to follow: Decentralized lifelong multi-agent pathfinding via planning and learning,","venue":null,"work_id":"399c8cb9-aa1b-45ff-906e-db05e4434057","year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.884523Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:6200e10dc211ea58c3d2b68be89098282260b11680859409c2fd68264bc7857a","observation_id":"cd03b688-cade-4f73-87ff-945393caf32f","resolution":{"observed_at":"2026-08-06T21:35:37.618994Z","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-06T21:35:37.598702Z","title":"When to switch: planning and learning for partially observable multi-agent pathfinding,","venue":null,"work_id":"e1e131ec-23ab-48d3-ac30-041661f5fa1f","year":2023},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.891182Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:679b8c19d8011802af230df4fc8166713e972ce519de8bb3a8e4d8426b2498c9","observation_id":"a6c65baa-0279-48dd-a348-931cf7132bdf","resolution":{"observed_at":"2026-08-06T21:35:37.602922Z","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-06T21:35:37.584029Z","title":"A comprehensive review on lever- aging machine learning for multi-agent path finding,","venue":null,"work_id":"fa97932e-41c7-437d-bdfa-745563c57d64","year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.895520Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:8459c313d636713c7e2ef99d79f0adf9095a9d8fba8d4b2b462c763e15303303","observation_id":"3a8df2ce-2328-4399-b1ba-e6915f2ada4d","resolution":{"observed_at":"2026-08-06T21:35:37.589011Z","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-06T21:35:37.569558Z","title":"MAPF- GPT: Imitation learning for multi-agent pathfinding at scale,","venue":null,"work_id":"93f7df8b-16fb-4769-808b-e35cdb422512","year":2025},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.899835Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:2f7bc14566a9c466188e7e35499acb1d0fd3a13c27a21ad80b4a03a402634fda","observation_id":"75dee056-2301-4120-b162-7bfe4db7a7c2","resolution":{"observed_at":"2026-08-06T21:35:37.574323Z","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-06T21:35:37.554226Z","title":"Multi-agent imitation learning: Value is easy, regret is hard,","venue":null,"work_id":"2b498d87-92fa-421f-b9d9-9c6f1164260e","year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.904314Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:947268d7a0dffed2fcd57d158f734a57d54a2dc6950d31992a5ec2d9263db817","observation_id":"9140094b-5ed1-43b5-9121-7bcb4f14c43b","resolution":{"observed_at":"2026-08-06T21:35:37.558362Z","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-06T21:35:37.540080Z","title":"Learning multi-agent behaviors from distributed and streaming demonstrations,","venue":null,"work_id":"8db54333-ead7-43b1-a403-05e7d074f6be","year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.908461Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:e658ef4a766b288b9057e94e9413e864f5e79c7b89e97c2fe2cfd839e97d5147","observation_id":"77c97a48-4ee0-4b0e-ba08-54237a3d14c2","resolution":{"observed_at":"2026-08-06T21:35:37.544293Z","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-06T21:35:37.525443Z","title":"Bayesian multi- type mean field multi-agent imitation learning,","venue":null,"work_id":"73759918-1bc3-41ae-86d0-960d29917b60","year":2020},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.913339Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:59447cd161c7896e3450701d6c9cae6b6d2e376d7cc6dc88a8c23827f433507c","observation_id":"b81ad8b0-f8b1-4396-9f30-11e429c798f6","resolution":{"observed_at":"2026-08-06T21:35:37.529745Z","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-06T21:35:37.509792Z","title":"Multi-agent generative adversarial imitation learning,","venue":null,"work_id":"dbfe6f87-6607-4586-9455-31ec31fc142d","year":2018},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.918577Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:9bd77421e6384af244e7b3fa41805e08c919537e53c088d27133333db88a4d11","observation_id":"252a0fcf-2a5a-471a-8791-2f8fcaf96539","resolution":{"observed_at":"2026-08-06T21:35:37.515200Z","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-06T21:35:37.493979Z","title":"Gailpg: Multi-agent policy gradient with generative adversarial imitation learning,","venue":null,"work_id":"912503f9-8eaf-4fa6-9de0-cb8284a8cc02","year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.923440Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:2c0f8763173fcd4f0ea327bc7233ac5005e6207c3601a54f47a9f833ceeb0573","observation_id":"4d2b0807-71f8-4ade-9152-f3bf26c214ec","resolution":{"observed_at":"2026-08-06T21:35:37.498345Z","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-06T21:35:37.479989Z","title":"Multi-agent imitation learning with copulas,","venue":null,"work_id":"61b928f5-367c-41ef-b473-a2ec9721287b","year":2021},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.928874Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:72d308ff5ae26c41aa0ce756eaa15b240e46fd2ebeb99ce1d996e703c344625b","observation_id":"0fa55020-88f7-48f3-9bcf-d3a719779759","resolution":{"observed_at":"2026-08-06T21:35:37.484292Z","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-06T21:35:37.464840Z","title":"Conditional imitation learning for multi-agent games,","venue":null,"work_id":"3b8ea338-09c0-459d-9cc5-c577ddbeab0f","year":2022},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.934912Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:cb656641e9f2e1001e4c7d32081b9c283d7b2177beea7dec91adb6da8994b2a8","observation_id":"e06f86cd-ed2f-4af5-a06a-90b10e6e3571","resolution":{"observed_at":"2026-08-06T21:35:37.469667Z","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-06T21:35:37.451333Z","title":"Coordinated multi-agent imitation learning,","venue":null,"work_id":"ef401e71-013b-4f8a-b477-55ffa2920c9f","year":2017},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.940237Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:b0a9a380f386a2000d29cf7416f1d743688706d9efea92834269b22c614f6a76","observation_id":"61869932-80c2-47e6-b980-07c67b5d4d98","resolution":{"observed_at":"2026-08-06T21:35:37.455344Z","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-06T21:35:37.437516Z","title":"Offline pre-trained multi-agent decision transformer,","venue":null,"work_id":"582f95b0-7f2c-4dc7-8c5a-2e7de3414dd1","year":2023},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.945722Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:098c5a3f97d1edfe28eb04a37899ab5e04495fac790cdb549c288056084d32ff","observation_id":"2e985abf-bcce-4a08-8cd5-47ae90c6edcf","resolution":{"observed_at":"2026-08-06T21:35:37.441976Z","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-06T21:35:37.423192Z","title":"Mastering the game of go with deep neural networks and tree search,","venue":null,"work_id":"46f817f8-fe81-468e-b932-318115f3f1c1","year":2016},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.951357Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:9e3e7af4d08000f55b9e81fb32e8f768a204d212a38331141f9fc259b75c9af1","observation_id":"ea98309a-248b-403b-bc87-06defd8637a5","resolution":{"observed_at":"2026-08-06T21:35:37.427935Z","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-06T21:35:37.408351Z","title":"Amortized planning with large-scale transformers: A case study on chess,","venue":null,"work_id":"07871d6a-b166-4c05-b2a1-1cf6ba513873","year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.956200Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:92d213fb9bf173945b51d1b5d9953cb0fd230bb4f8961cb87cd92e02ced4884a","observation_id":"e68483bf-4547-4d7c-9bd8-c662b61ac533","resolution":{"observed_at":"2026-08-06T21:35:37.412991Z","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":"2108.07258","last_updated":"2022-07-12T23:45:14Z","snapshot_observed_at":"2026-08-02T09:20:40.804790Z","submitted_at":"2021-08-16T17:50:08Z","title":"On the Opportunities and Risks of Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07258","snapshot_observed_at":"2026-08-06T21:35:36.962234Z","title":"On the opportunities and risks of foundation models,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.962234Z"},"links":{"cited_paper":"/paper/2108.07258","citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:3a99e455eacb25073a531642579d7de18de8c4300b24d87c0451d249bbb4534d","observation_id":"089c339c-e07f-4aa6-939d-c3f21a229b57","resolution":{"observed_at":"2026-08-06T21:35:36.962234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04129","last_updated":"2023-03-07T18:44:07Z","snapshot_observed_at":"2026-08-03T19:24:56.017408Z","submitted_at":"2023-03-07T18:44:07Z","title":"Foundation Models for Decision Making: Problems, Methods, and Opportunities","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.04129","snapshot_observed_at":"2026-08-06T21:35:36.966715Z","title":"Foundation models for decision making: Problems, methods, and opportunities,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.966715Z"},"links":{"cited_paper":"/paper/2303.04129","citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:b39af384a404167f9aacdc51d6e0e9a66bc8399712eef7205b1d549ff4098498","observation_id":"87235990-9198-4b19-b7ab-7f4b8e95b113","resolution":{"observed_at":"2026-08-06T21:35:36.966715Z","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-06T21:35:37.393808Z","title":"Foundation models in robotics: Applications, challenges, and the future,","venue":null,"work_id":"fb821c12-18e7-48ca-9aed-78ac739b754d","year":2023},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.972514Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:85f586dbbb0378305508d8f5d565984183407d39b100a5faf83006e54e5c8921","observation_id":"8bcc3cd7-fd4f-4824-98be-be376f3558d6","resolution":{"observed_at":"2026-08-06T21:35:37.398082Z","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.12213","last_updated":"2024-05-26T19:55:26Z","snapshot_observed_at":"2026-07-06T18:16:51.116432Z","submitted_at":"2024-05-20T17:57:01Z","title":"Octo: An Open-Source Generalist Robot Policy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12213","snapshot_observed_at":"2026-08-06T21:35:36.976921Z","title":"Octo: An open-source generalist robot policy,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.976921Z"},"links":{"cited_paper":"/paper/2405.12213","citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:029eb7aba7bbacc944ef1ca5396ed2f451e988b4be031390df4647b6eade481d","observation_id":"84f176d6-a7e4-4f06-9a22-07103d6c3d9f","resolution":{"observed_at":"2026-08-06T21:35:36.976921Z","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-06T21:35:37.378425Z","title":"OpenVLA: An open-source vision-language-action model,","venue":null,"work_id":"fbb64dd8-d70e-4cdd-8a05-1a82aee1d8f3","year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.983030Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:b9f57ac257bc23ce3d49ac7fcf4d127166497ca2515d19a8ea9e5fce8e9845fb","observation_id":"b5c77707-b835-4d5f-8a4b-42ce8a51c237","resolution":{"observed_at":"2026-08-06T21:35:37.382896Z","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":"2411.04468","last_updated":"2024-11-07T06:36:19Z","snapshot_observed_at":"2026-08-04T17:52:28.620519Z","submitted_at":"2024-11-07T06:36:19Z","title":"Magentic-One: A Generalist Multi-Agent System for Solving Complex Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.04468","snapshot_observed_at":"2026-08-06T21:35:36.988410Z","title":"Magentic- one: A generalist multi-agent system for solving complex tasks,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.988410Z"},"links":{"cited_paper":"/paper/2411.04468","citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:0c65fa759458b8eec87a0eb06c9c3e39f9c0817922e64ccdd11df251c7260205","observation_id":"e068fdce-c98b-4c47-a94d-173a3eda9c5b","resolution":{"observed_at":"2026-08-06T21:35:36.988410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14491","last_updated":"2024-09-22T15:36:29Z","snapshot_observed_at":"2026-08-10T14:27:04.759435Z","submitted_at":"2024-09-22T15:36:29Z","title":"Work Smarter Not Harder: Simple Imitation Learning with CS-PIBT Outperforms Large Scale Imitation Learning for MAPF","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.14491","snapshot_observed_at":"2026-08-06T21:35:36.993267Z","title":"Work smarter not harder: Simple imitation learning with cs-pibt outperforms large scale imitation learning for mapf,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.993267Z"},"links":{"cited_paper":"/paper/2409.14491","citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:51f5e9c48c456749aac096c88e43da5395ed09acf04d4fffa7ca3acb962b4b26","observation_id":"8e55d298-f30b-4ede-a024-82d5164b1738","resolution":{"observed_at":"2026-08-06T21:35:36.993267Z","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-06T21:35:37.363912Z","title":"Multi-agent systems and foundation models enable autonomous supply chains: Opportunities and challenges,","venue":null,"work_id":"ddeee5f2-4658-4149-98c8-3ca3384dc694","year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:36.997857Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:2da1a67774772c540c712aac9e16e8eafbeb0d9cd07ce457529e33edf2e8da69","observation_id":"b1f37afb-d1f8-4727-890b-e112b46699e6","resolution":{"observed_at":"2026-08-06T21:35:37.368331Z","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-06T21:35:37.348713Z","title":"Fine-tuning multi- modal transformer models for generating actions in virtual and real environments,","venue":null,"work_id":"88925610-db13-4094-b5d6-aff3e53281f1","year":2023},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:37.002515Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:3bb97a076b9fad8137f1671b36f1fd589a04a06c8848ad85704d5e8fada21d83","observation_id":"257beee2-a2ef-4c33-a438-28c189dbdb53","resolution":{"observed_at":"2026-08-06T21:35:37.353328Z","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-06T21:35:37.333393Z","title":"Archer: Training language model agents via hierarchical multi-turn rl,","venue":null,"work_id":"bab7e02f-d89f-4ab7-9744-ec62dd8c3900","year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:37.006794Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:8aa9a90fe7004f63de4ecbf770f13fdaf85d4242cfa6de1ea5028ff2373e6654","observation_id":"53b0381c-9c08-4585-ab07-47aedf04d3e2","resolution":{"observed_at":"2026-08-06T21:35:37.337974Z","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-06T21:35:37.316660Z","title":"Fine-tuning large vision-language models as decision-making agents via reinforcement learning,","venue":null,"work_id":"478541a6-7402-4b21-99a1-42c311b8a1a8","year":2025},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:37.011215Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:d8c879ec9c0ab2e61fbe9baccf811218ec3bd6c5571f6caa871606000329d73a","observation_id":"52dacca2-6c6c-4852-bd1f-ca629c180a90","resolution":{"observed_at":"2026-08-06T21:35:37.321889Z","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":"2409.05865","last_updated":"2024-09-09T17:59:50Z","snapshot_observed_at":"2026-08-02T18:32:11.602139Z","submitted_at":"2024-09-09T17:59:50Z","title":"Robot Utility Models: General Policies for Zero-Shot Deployment in New Environments","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.05865","snapshot_observed_at":"2026-08-06T21:35:37.017677Z","title":"Robot utility models: General policies for zero-shot deployment in new environments,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:37.017677Z"},"links":{"cited_paper":"/paper/2409.05865","citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:b30f5e575a8b101cc0c738d190ca2c074689b2958508f391c6e1bf5b14126afc","observation_id":"6668de8d-7714-4d2b-9d19-b7653c5757b1","resolution":{"observed_at":"2026-08-06T21:35:37.017677Z","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-06T21:35:37.299960Z","title":"The in- creasing cost tree search for optimal multi-agent pathfinding,","venue":null,"work_id":"af37dae2-904b-4364-a752-a4746261b284","year":2013},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:37.023557Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:629ef7e24528c0961838fd59394060dbe08244f34cf38cfbc576d22816526aa8","observation_id":"c07d7e21-98a9-47fc-b8e9-6cff29650f3c","resolution":{"observed_at":"2026-08-06T21:35:37.304472Z","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-06T21:35:37.284087Z","title":"Searching with consistent prioritization for multi-agent path finding,","venue":null,"work_id":"e457e2c5-bcc6-40d8-a5bd-5a8c40bd354a","year":2019},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:37.028491Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:73fb10cbc3aaa734762a193d9660c430381db7d511ff7fa387d1b738e076b6ae","observation_id":"ecf40a58-b143-4e17-82a7-3fa13ea3e8be","resolution":{"observed_at":"2026-08-06T21:35:37.288647Z","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-06T21:35:37.265565Z","title":"Primal: Pathfinding via reinforcement and imitation multi-agent learning,","venue":null,"work_id":"704680ed-e2a3-4781-9409-1989987003e6","year":2019},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:37.033141Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:49fc3439a041c09f19ff5d934a46e72e404cb9a88031ce8dd6a2a88c71b319b0","observation_id":"610e4bde-3704-49a1-a000-973732edc67f","resolution":{"observed_at":"2026-08-06T21:35:37.270571Z","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-06T21:35:37.249964Z","title":"Amortized planning with large-scale transformers: A case study on chess,","venue":null,"work_id":"557adb9f-1ff8-4ce6-a49f-7257efc3cac3","year":2025},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:37.038895Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:19875b242bbdea8a0971992b56f43b9bf75c41c6aa765ee065872aada808b1c1","observation_id":"71b97b49-e319-46af-814a-b7ac7726cf9e","resolution":{"observed_at":"2026-08-06T21:35:37.254446Z","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-06T21:35:37.234073Z","title":"Engineering lacam*: Towards real-time, large-scale, and near-optimal multi-agent pathfinding,","venue":null,"work_id":"bccfc01a-6006-48e3-8aa7-c51ec993e682","year":2024},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:37.044566Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:d5972b4010c5fb6934dadb760fc7c0ee5874a3b489afb0d13fc4a5b7d82d8f99","observation_id":"ba85efd0-0d1a-49ae-836c-821e8081a0a7","resolution":{"observed_at":"2026-08-06T21:35:37.238925Z","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-06T21:35:37.049332Z","title":"A reduction of imitation learning and structured prediction to no-regret online learning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:37.049332Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:4ab6ca95c54d2c7c932a17d3066414449a8c77721563d49ae7c147ebc1844484","observation_id":"fa5cad76-a3c9-4bc5-8e35-729b1bc6b356","resolution":{"observed_at":"2026-08-06T21:35:37.049332Z","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-06T21:35:37.204115Z","title":"Pogema: A benchmark platform for cooperative multi-agent pathfinding,","venue":null,"work_id":"a103a192-c1fc-4b9b-8b0b-c594c23faadc","year":2025},"citing_paper":{"arxiv_id":"2506.23793","last_updated":"2025-06-30T12:34:31Z","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T21:35:37.055249Z"},"links":{"citing_paper":"/paper/2506.23793"},"observation_digest":"sha256:5d069e0355a5350f465b23858e9472e95f06753c9b843d06808a6d454a652d06","observation_id":"1127eaa4-b4d8-41fb-b294-ec2dd505cba9","resolution":{"observed_at":"2026-08-06T21:35:37.210295Z","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":"2506.23793","last_updated":"2025-06-30T12:34:31Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-10T14:01:57.808077Z","submitted_at":"2025-06-30T12:34:31Z","title":"Advancing Learnable Multi-Agent Pathfinding Solvers with Active Fine-Tuning"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":45},"total_outbound_references":54},"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 54 of 54 outbound references and 0 inbound Pith citation observations for arXiv:2506.23793."}