{"as_of":"2026-08-20T08:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f339b8b994bbf6b305ce0a98c7267dfc24a358ae8cacf6051700633328485993","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-07T14:01:56.724017Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2604.25567/citation-record","integrity":"/paper/2604.25567/integrity","json":"/paper/2604.25567/citation-record.json","paper":"/paper/2604.25567"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses","venue":null,"work_id":"1a109981-5e0e-4660-9799-0db0ab1f5956","year":2008},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:605393502f63d1c4adb7386d60c70679a6db5025e53ad6251712e8e0716014b4","observation_id":"b3acb5fe-6cb5-4ab1-829a-b76cb5d3b88b","resolution":{"observed_at":"2026-05-27T04:58:35.405711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Trajectory Planning for Quadrotor Swarms","venue":null,"work_id":"672e355d-1887-4552-9661-89ee5e6dccf4","year":2018},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:67f17253ba356b32bf13c3822b529f07e19842ac3c7de6978c48ae17249bf21e","observation_id":"fff26674-7065-4e8b-ac95-de059af2a122","resolution":{"observed_at":"2026-05-27T04:58:35.432592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Improved Conflict-Based Search for the Virtual Network Embedding Problem","venue":null,"work_id":"85bf637f-2a7a-43e2-bbde-d8af7baf5bbb","year":2023},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:855e2d5ff2041a05fac0d2924b32dc54b6260e6d90246bfa12979c4307ee06ca","observation_id":"98af2640-0dc2-41fd-bcbb-d0c7a78c34e2","resolution":{"observed_at":"2026-05-27T04:58:35.436924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"An Optimization Variant of Multi-Robot Path Planning Is Intractable","venue":null,"work_id":"8ddeec67-591e-40c6-a528-c88970700937","year":2010},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:a9f3a9a3f8e73b35d1e331c6ee48a53e5f5c851c10a29fbd2a4092dbdca2b782","observation_id":"88d76570-b169-477d-96a9-3bdcb140597b","resolution":{"observed_at":"2026-05-27T04:58:35.390364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Engineering LaCAM*: Towards Real-time, Large-scale, and Near-optimal Multi-agent Pathfinding","venue":null,"work_id":"2f2d0cbd-d748-4a55-a4ab-671d139aca5d","year":2024},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:8a51d673f1b5f522e5c0268c5cb3fc153af21fa0e301db18e8783be54f6c03dd","observation_id":"84adc760-0931-44e4-8b3f-c3ca9511fed3","resolution":{"observed_at":"2026-05-27T04:58:35.410233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Multi-Agent Path Finding with Kinematic Con- straints","venue":null,"work_id":"8dbba37f-4461-458a-8581-5d4998c04bf4","year":2016},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:f70b13462cd1b371ee59d2058eb0df1e8cc5aa2b132b0250b5b6063116f4c3b8","observation_id":"b010d2f0-e0e6-482e-b10c-ceff588f5b3c","resolution":{"observed_at":"2026-05-27T04:58:35.386175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Persistent and robust execution of mapf schedules in warehouses","venue":null,"work_id":"11528841-aa67-4251-891e-7489e3df5444","year":2019},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:139414a55f7399da6d223bf129cf484e6c497de95963408b517fe5612ee8d7b5","observation_id":"53a53ec6-96a4-4dbd-b5df-bfeb8e3cb29a","resolution":{"observed_at":"2026-05-27T04:58:35.396327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Receding Horizon Re-Ordering of Multi-Agent Execution Schedules","venue":null,"work_id":"a765a9d2-d4de-41ee-8c2b-2ada1d755641","year":2023},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:9da758251ef417a9922fa2dec0bd4638d35fae9a662f3ce1c73cabf09b1cfde7","observation_id":"3c8e638e-18e5-4e3a-8e8d-8e350c715163","resolution":{"observed_at":"2026-05-27T04:58:35.400541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution","venue":null,"work_id":"0143937c-c92d-42b6-9704-82a75a3f214c","year":2024},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:85f1d21a8ac0be34c5e329c9ad965e09957e5a4a6f79833a0c39836e7129cd5a","observation_id":"d025af6b-4f6c-4452-b452-3a1bbcf42647","resolution":{"observed_at":"2026-05-27T04:58:35.419150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Introducing Delays in Multi Agent Path Finding","venue":null,"work_id":"330e4583-7dfb-4e2d-818d-5cb47bad7a9b","year":2024},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:7114975271c0fad3920554da21499799cd4682d66bbf7ad4e7aabbae9a7ef22c","observation_id":"cc67ca70-5f79-4a27-8fd8-d1d5b81cbd9d","resolution":{"observed_at":"2026-05-27T04:58:35.427118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2509.10284","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Holistic Architecture for Monitoring and Optimization of Robust Multi-Agent Path Finding Plan Execution","venue":null,"work_id":"2f8c15fe-8187-4f89-8f4b-c17f8e39f211","year":2025},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:4a194c1376d0fa09389648d9e3d7393f2e074396fddbfefda561ce5a138bbbec","observation_id":"f2349787-c8a5-4332-bb19-c0afd05cfc74","resolution":{"observed_at":"2026-05-12T08:41:25.950282Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Multi-Agent Path Finding with Delay Probabilities","venue":null,"work_id":"8fe442d0-27ad-4dda-9d99-338aae2918e4","year":2017},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:e06a3657c6c6934935816f328a4bfebca2097b05cd0ad0f1421c4d0e7e8c15f3","observation_id":"4e4d4236-7d06-4448-a431-44f0d9be82b5","resolution":{"observed_at":"2026-05-27T04:58:35.423206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Locally-optimal multi-robot navigation under delaying disturbances using homotopy constraints","venue":null,"work_id":"d91e0fb8-3acf-4aaf-8cdb-10c4e74ecd91","year":2018},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:7e7489aaa8ba942d20d43983d768ccfe8de83b507dce22e0c5b1f985439bd550","observation_id":"97b11323-47b8-4756-a6d5-737be0df8977","resolution":{"observed_at":"2026-05-27T04:58:35.415131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.01495","last_updated":"2026-04-26T19:49:58Z","snapshot_observed_at":"2026-08-19T23:31:33.957779Z","submitted_at":"2025-08-02T21:33:08Z","title":"WinkTPG: An Execution Framework for Multi-Agent Path Finding Using Temporal Reasoning","version":2},"cited_work":{"arxiv_id":"2508.01495","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.01495","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"WinkTPG: An Execution Framework for Multi-Agent Path Finding Using Temporal Reasoning","venue":"cs.AI","work_id":"531589ce-309f-4b18-8c97-5e4d98d2aafd","year":2025},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"cited_paper":"/paper/2508.01495","citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:b69ec5082092430557e3bb58cf6ace19b023f0e4884bb3f2a464cd986c754733","observation_id":"42af2773-5c56-48af-88fa-2d4f04f8d329","resolution":{"observed_at":"2026-05-12T08:41:25.964088Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Solving Robust Execution of Multi-Agent Pathfinding Plans as a Scheduling Problem","venue":null,"work_id":"fa404c7a-d397-4407-80a8-d712fd2a8138","year":2023},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:b11c7aac58c351336cd1e256efd2ffb1301cc77006776b4d564792756a0a53e6","observation_id":"e9e55147-efdf-497d-a65b-22e7600d28fe","resolution":{"observed_at":"2026-05-27T04:58:35.454515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"A Real-Time Rescheduling Algorithm for Multi- robot Plan Execution","venue":null,"work_id":"8c8700fa-7cb4-46d2-a3e2-c473eff99cdd","year":2024},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:870d730df18bb4b739c04eead88d0306a0d244bbe02db8a4594c920685180469","observation_id":"3ec9ac77-37d5-4165-8633-77641177bbc3","resolution":{"observed_at":"2026-05-27T04:58:35.467572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03554","last_updated":"2024-04-04T16:06:39Z","snapshot_observed_at":"2026-08-16T14:03:35.146452Z","submitted_at":"2024-04-04T16:06:39Z","title":"No Panacea in Planning: Algorithm Selection for Suboptimal Multi-Agent Path Finding","version":1},"cited_work":{"arxiv_id":"2404.03554","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.03554","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Chen,et al.No Panacea in Planning: Algorithm Selection for Suboptimal Multi-Agent Path Finding","venue":null,"work_id":"bcfa6196-b2de-4dc7-8b0a-fd7d8dc4f7ca","year":null},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"cited_paper":"/paper/2404.03554","citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:2ed3cd91cd6b9b0d71aaa768714a4107c8417f0288c94064e44a7cd62e4eb3b9","observation_id":"626d1a0c-f5d1-4c69-813b-82d2a20f10fd","resolution":{"observed_at":"2026-05-12T08:41:25.954651Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood Search","venue":null,"work_id":"7244199d-6131-491d-90c3-33cb21151932","year":2022},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:a6f9ad18482716c77d5e1cf89e8472b6c729da36b9daf8d3b24e76bdef891ccc","observation_id":"ba0978cf-18ce-4257-9e2f-76427ce16ee8","resolution":{"observed_at":"2026-05-27T04:58:35.458848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"LNS2+RL: Combining Multi-agent Reinforcement Learning with Large Neighborhood Search in Multi-agent Path Find- ing","venue":null,"work_id":"a7f51ced-6f99-46b6-a8bf-ae51772f7336","year":2025},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:5d4c020a31f867bc302aa0062a9baca87f21091017aed80a134ac403e9d693b4","observation_id":"b43f70b3-2400-4e3b-b37a-8087da1d7a2a","resolution":{"observed_at":"2026-05-27T04:58:35.449936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.08184","last_updated":"2021-03-04T14:28:56Z","snapshot_observed_at":"2026-08-16T19:13:04.083940Z","submitted_at":"2020-10-16T06:23:53Z","title":"PRIMAL2: Pathfinding via Reinforcement and Imitation Multi-Agent Learning -- Lifelong","version":3},"cited_work":{"arxiv_id":"2010.08184","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.08184","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"PRIMAL2: Pathfinding via Reinforcement and Imitation Multi-Agent Learning – Lifelong","venue":null,"work_id":"58e480c7-9809-416e-9eda-4302664c515c","year":2021},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"cited_paper":"/paper/2010.08184","citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:79e82f6232bdf78077275979b3c9669734f99eb74a02ada078774c09e81faa1f","observation_id":"8124c229-90be-43b2-92b9-ec91627c53da","resolution":{"observed_at":"2026-05-12T08:41:25.959346Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks (Extended Abstract)","venue":null,"work_id":"f11b852d-2a30-4618-8d05-2f9f8d2fbcc1","year":2025},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:bf24b69425a232e64bd5568b23be79505a03a7022dd3a2d39df6a726e387833c","observation_id":"9928218f-24e2-4438-a034-2db66418e359","resolution":{"observed_at":"2026-05-27T04:58:35.476619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","venue":null,"work_id":"0f74ba38-9cbd-4685-a9f7-6c4dffcb2d14","year":2019},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:0841cb8f33f39685c71a7592a161559b718a994e46f625736b1941986858bee5","observation_id":"320b5f5b-b558-4ccd-8663-5fe11b946c9d","resolution":{"observed_at":"2026-05-27T04:58:35.472062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Robust multi-agent path finding and executing","venue":null,"work_id":"85b73629-a4e0-42d7-9374-bb3409cf0ceb","year":2020},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:6ed57ccccac741295584de4a0f70d12a354ce45477f56d9ea5ad7f9b0e422eeb","observation_id":"f802ecbe-b1c1-4fc7-bdd6-dbb860a1d5cb","resolution":{"observed_at":"2026-05-27T04:58:35.480713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Scikit-learn: Machine learning in Python","venue":null,"work_id":"268bc980-5fb1-4631-b234-c208d6cfdb8b","year":2011},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:535004cc00a06c93cc786910e3ec8836b8948e8d00c728a191e0c93ae03249c2","observation_id":"d1c34ab4-d7e2-4fe6-bc5b-60038fb8248e","resolution":{"observed_at":"2026-05-27T04:58:35.445211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"TensorFlow: Large-scale machine learning on heterogeneous systems","venue":null,"work_id":"7dbc9777-0903-4277-a99a-ab7850951236","year":2015},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:ef2cfdface366e426a05136a7a0c9924acef39f6a12174f245a4bdd247ac84b5","observation_id":"1ff41687-85de-4006-b4f0-671b83071a64","resolution":{"observed_at":"2026-05-27T04:58:35.441024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-05T21:23:00.469572Z","title":"Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem","venue":null,"work_id":"0aa214f5-b6f0-4e11-9758-b853a41c59f4","year":2014},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:68cf89d79ee6a3f35654c83d6785d2655f899a4a79b997beec1bcedf599eae86","observation_id":"ec82fcc7-a583-4670-b6f6-4c11b26d0261","resolution":{"observed_at":"2026-05-27T04:58:35.463384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","latest_version":1,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-11T14:10:27.006058Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":4,"verified_fuzzy":22},"total_outbound_references":26},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2604.25567."}