{"as_of":"2026-08-11T19:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0bd65bb937bdbaf5aadc599b95324afaa762ce393c2485a211d7efbb95746afa","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-08-05T14:38:33.644846Z","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-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/2508.21205/citation-record","integrity":"/paper/2508.21205/integrity","json":"/paper/2508.21205/citation-record.json","paper":"/paper/2508.21205"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.08574","last_updated":"2026-04-13T16:50:27Z","snapshot_observed_at":"2026-08-02T09:29:49.746608Z","submitted_at":"2025-08-12T02:19:15Z","title":"DeepFleet: Multi-Agent Foundation Models for Mobile Robots","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.08574","snapshot_observed_at":"2026-08-05T14:38:29.951622Z","title":"DeepFleet: Multi-agent foundation models for mobile robots","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:29.951622Z"},"links":{"cited_paper":"/paper/2508.08574","citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:a8c6f51b8750b94d596845001be1168a660df99e57701ca22c121fcdd16751eb","observation_id":"2cf77887-5c4e-457d-bf53-ea33ce6c7494","resolution":{"observed_at":"2026-08-05T14:38:29.951622Z","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-05T14:38:40.418539Z","title":"Multi-agent path finding – an overview","venue":null,"work_id":"b037fa3f-deae-4370-be91-12c1836ca635","year":2019},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:30.016081Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:caa101054ea8db1af100f6d7baa449d3e3ecb612cd762b04a175037b64f700f5","observation_id":"2fbe4159-d7f3-437a-98c2-9ac0ed6850c6","resolution":{"observed_at":"2026-08-05T14:38:40.564283Z","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-05T14:38:40.187453Z","title":"Improved anonymous multi-agent path finding algorithm","venue":null,"work_id":"b14b46ce-9c31-42c9-8743-7186f273d88c","year":2023},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:30.193577Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:5c2bc02c0ac27d6882d803083a2800fffcd08408b82e1a41224740fd228e3c26","observation_id":"d9352949-d117-43fd-977a-4d18f87c22a4","resolution":{"observed_at":"2026-08-05T14:38:40.280823Z","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-05T14:38:39.864904Z","title":"Topics in Optimal Transportation, volume 58 of Graduate Studies in Mathe- matics","venue":null,"work_id":"f0b08dcb-3c2f-4ff7-a3b9-db74c7381f91","year":2003},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:30.309543Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:3d839b704b61b236edaf7b747896f78c8594615450a66fbd23e61a6c64a46415","observation_id":"e5d19f93-174b-43b0-af04-668cba7919b4","resolution":{"observed_at":"2026-08-05T14:38:39.992680Z","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-05T14:38:39.606084Z","title":"Computational optimal transport: With applications to data science","venue":null,"work_id":"91ea47c1-d809-4111-ad32-b66a517654fe","year":2019},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:30.457054Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:520e1e3ef65c82bed0a35a12fb8ef093fe2f6f6936acaea8eac119ecbfba6629","observation_id":"16f93ec9-ee99-4cac-8d3b-9f1a887500e4","resolution":{"observed_at":"2026-08-05T14:38:39.744784Z","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-05T14:38:39.257059Z","title":"An introduction to optimal transport and Wasserstein gradient flows","venue":null,"work_id":"0ef4f5ac-9957-4784-a4c5-e9829b6fdd42","year":2022},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:30.620744Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:14d0dcff64c96da9e4f7d451c27b0ce2e9e0b6934dc6fdc6292abb27493521a6","observation_id":"70f695f5-8381-465d-ad50-c19846c368a5","resolution":{"observed_at":"2026-08-05T14:38:39.363587Z","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-05T14:38:38.943092Z","title":null,"venue":null,"work_id":"47b0144d-b00f-4543-b067-7c207c6f9f0d","year":2014},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:30.751225Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:e93978cb7bfd5e781ef584f5de6b0fe0ff38b9c0f3df54817cc19c4f0a63df57","observation_id":"c5d8bff3-2a6f-4dd4-b474-4614853b358e","resolution":{"observed_at":"2026-08-05T14:38:39.084838Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T14:38:38.667157Z","title":"Optimal mass transport and kernel density estimation for state-dependent networked dynamic systems","venue":null,"work_id":"63108102-4853-442b-ab10-e2ea43636812","year":2018},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:30.950440Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:609f7a71af2bebb7684b4e6feb14380610fcbe005b4f68a79e11c99011a02162","observation_id":"aaae8d1d-04f7-4726-bd90-368bb76b10a0","resolution":{"observed_at":"2026-08-05T14:38:38.790258Z","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-05T14:38:38.312512Z","title":"Distributed optimal transport for the deployment of swarms","venue":null,"work_id":"46c8731a-f20b-45b5-85c7-41028a9bf160","year":2018},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:31.118237Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:f71ed63038d8bf95429369a81d8a31d6c745127b01acd2e1957ec0519d6b2924","observation_id":"612b9eac-36ef-4570-9bdc-f27a91e02630","resolution":{"observed_at":"2026-08-05T14:38:38.473512Z","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-05T14:38:37.992657Z","title":"Collective motion planning for a group of robots using intermittent diffusion","venue":null,"work_id":"6568c0f5-0d06-47fd-b9a6-43e2badf5889","year":2022},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:31.298735Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:e801a7a3b9fbebf59d0b23d50234a4eb4017aec5230793a79be377889cd2688b","observation_id":"47311ba9-a55e-40be-b680-026126781fdd","resolution":{"observed_at":"2026-08-05T14:38:38.142907Z","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-05T14:38:37.693719Z","title":"Kachar and Alex A","venue":null,"work_id":"d29d0815-0e3d-40ed-af83-814833234309","year":2022},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:31.462400Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:652ccb92e40558a0f54f0fd01df718c882ccf990b6734b5e71ad7d9a45bb86f9","observation_id":"785180ef-16c1-4a17-abe1-41841dbed6be","resolution":{"observed_at":"2026-08-05T14:38:37.820236Z","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-05T14:38:37.366842Z","title":"Continuum swarm tracking control: A geometric per- spective in Wasserstein space","venue":null,"work_id":"32d5e884-043e-4213-b66d-6dcdfb9bb35e","year":2023},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:31.648197Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:6ddc21109f897c42b372b3b965778942124ea65c4bfd1ad435a7aee8cd7f8902","observation_id":"697ae311-c196-4ea6-969c-582675b31b71","resolution":{"observed_at":"2026-08-05T14:38:37.501934Z","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-05T14:38:37.075255Z","title":"Le, Georgia Chalvatzaki, Armin Biess, and Jan Peters","venue":null,"work_id":"04d8ad7d-0821-4bc6-bca2-539830f0305c","year":2023},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:31.823694Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:626963b69a85b19f8d5583adafe81ef6d067502c66f9c4ca220c722a83aa28ed","observation_id":"e903b339-d2e8-444f-ab05-af2eace48f20","resolution":{"observed_at":"2026-08-05T14:38:37.211034Z","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":"2412.17993","last_updated":"2024-12-23T21:27:19Z","snapshot_observed_at":"2026-08-11T05:06:01.836939Z","submitted_at":"2024-12-23T21:27:19Z","title":"Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.17993","snapshot_observed_at":"2026-08-05T14:38:31.985660Z","title":"Christopher, Sven Koenig, and Ferdinando Fioretto","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:31.985660Z"},"links":{"cited_paper":"/paper/2412.17993","citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:eabb40fdcb5b1eda3489eacce872d934e00d983fbbaf6d89f137de11b888ad34","observation_id":"d5e52879-056b-456f-ae69-22390aa81042","resolution":{"observed_at":"2026-08-05T14:38:31.985660Z","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-05T14:38:36.718813Z","title":"Optimal target assignment and path finding for teams of agents","venue":null,"work_id":"978eb5ae-efd6-4cf3-ad5e-d45b753b14f0","year":2016},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:32.118070Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:b4d1455e8c2a71c8e5bcb2523fa55df6fe7d0d20d433baa9915d23734b7d1829","observation_id":"bce4b0b9-a84d-4248-947b-b6f1aa89979b","resolution":{"observed_at":"2026-08-05T14:38:36.889768Z","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-05T14:38:36.413873Z","title":"Non-crossing anonymous MAPF for tethered robots","venue":null,"work_id":"36643d89-8dab-44d4-b688-919e07d8a7e3","year":2022},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:32.226591Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:ed8098cdc36c1bf6883378ce7bba61c489242c911c503f1e7b19d4bdf781cc4d","observation_id":"27451a62-07ab-49d1-9e2d-fd744d3b2fd3","resolution":{"observed_at":"2026-08-05T14:38:36.587916Z","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-05T14:38:36.119059Z","title":"Improved anony- mous multi-agent path finding algorithm","venue":null,"work_id":"8019ac2d-9b78-492a-a27a-5fc24cf4f414","year":2023},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:32.352105Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:d17f724bc08487d423c75944382c2f16e9c630d2142dc552d65cb4edbf9d3ef0","observation_id":"71dd4695-e7fc-473f-a034-8afbdd9c88e2","resolution":{"observed_at":"2026-08-05T14:38:36.237830Z","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-05T14:38:35.878729Z","title":"Anonymous multi-agent path finding with indi- vidual deadlines","venue":null,"work_id":"6d5dca2e-35be-4dd9-baa9-921868cd092c","year":2023},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:32.462971Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:8ab718b33657959f2962ba911a3c3c225e183ef4f87af8282f0fce24b4227359","observation_id":"d7966dc4-107f-48b4-8157-bc5bbf297d76","resolution":{"observed_at":"2026-08-05T14:38:35.967541Z","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-05T14:38:35.621955Z","title":"Rossiter","venue":null,"work_id":"3e272e61-8542-4473-89bc-79373deb9341","year":2004},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:32.626087Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:84b8eb0c6583780a6dff369a5b2b7a619e5ee72d0922c763121c47f5522de9a7","observation_id":"c89e10e2-cac0-4dcd-b2c1-b8f5b89c7f52","resolution":{"observed_at":"2026-08-05T14:38:35.731733Z","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-05T14:38:35.364935Z","title":"Learning-Based Adaptive Control: An Extremum Seeking Approach","venue":null,"work_id":"368a963a-1965-42e4-bd2d-93455cc966c1","year":2016},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:32.780021Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:0a48cad744310a375b5960a8dab4c2867bc496489adc1fd81fb590920b44c167","observation_id":"3e857c0c-50bd-44a1-a1b4-22acf0a294b7","resolution":{"observed_at":"2026-08-05T14:38:35.507512Z","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":"2502.10607","last_updated":"2025-02-14T23:48:13Z","snapshot_observed_at":"2026-08-07T18:16:35.402007Z","submitted_at":"2025-02-14T23:48:13Z","title":"Time Parameterized Optimal Transport","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.10607","snapshot_observed_at":"2026-08-05T14:38:32.924173Z","title":"Time-parameterized OT","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:32.924173Z"},"links":{"cited_paper":"/paper/2502.10607","citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:d7164b9fb5a54b26dd23748bc5522b7130b6290804401f766f001473a261189e","observation_id":"6b05b383-c692-4867-9544-c2cc876f3e1b","resolution":{"observed_at":"2026-08-05T14:38:32.924173Z","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-05T14:38:35.059709Z","title":"Theory of Linear and Integer Programming","venue":null,"work_id":"6cc8843d-0ead-4193-be0b-167e122b9892","year":1998},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:33.058151Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:a112f05385634cbdc9b94760a8f4adb30150e9c2e35a16f80908339bacb92aae","observation_id":"f77f99eb-e804-4986-9e66-297a1a176118","resolution":{"observed_at":"2026-08-05T14:38:35.223074Z","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":"10.1137/1010099","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Veinott, A","venue":"SIAM Review","work_id":"c23670c1-dc5c-4f3a-8529-7e7c1f6f0400","year":1968},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:33.181406Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:9a30b41cea03fdd1278b6df50bb13f286e2f5d7314004b221219dfe1461cb413","observation_id":"28b7bd22-7819-4d51-8a28-52d598954385","resolution":{"observed_at":"2026-08-05T14:38:33.966795Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:38:34.819342Z","title":"Scaling al- gorithms for unbalanced optimal transport problems","venue":null,"work_id":"63fe88b4-fc17-4b16-a8e2-fb883b124f4a","year":2018},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:33.345452Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:030924ca96ed5827ac9912ed876c3ddd9024ef45412365f22e03dcdb4f1421a1","observation_id":"91ac39fd-3b65-4c15-9ba3-97ef0d294279","resolution":{"observed_at":"2026-08-05T14:38:34.932235Z","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-05T14:38:34.490998Z","title":"Alaya, and Gilles Gasso","venue":null,"work_id":"0555eff9-e69c-46b4-9d4c-c1f297359723","year":2020},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:33.502207Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:580d8ac273031ea419a3c8101d1d37595e8f2efc5f337303e1425a919f1e930b","observation_id":"8f6d8ca5-9b31-4040-b8f9-979d8c26aadf","resolution":{"observed_at":"2026-08-05T14:38:34.649979Z","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-05T14:38:34.180766Z","title":"Complete decentralized method for on-line multi-robot trajectory planning in well-formed infrastructures","venue":null,"work_id":"edb04889-c743-4e8a-880e-fcc780861fe6","year":2015},"citing_paper":{"arxiv_id":"2508.21205","last_updated":"2025-08-28T20:47:33Z","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T14:38:33.644846Z"},"links":{"citing_paper":"/paper/2508.21205"},"observation_digest":"sha256:5830d8c16cd5f4042a0d7c7e18d69eb7e85a00aa16ecee19d512accbdc7e46f7","observation_id":"2d33095e-b0d8-4b6b-b3bc-b59c88c9a350","resolution":{"observed_at":"2026-08-05T14:38:34.317172Z","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":"2508.21205","last_updated":"2025-08-28T20:47:33Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-10T12:11:09.181759Z","submitted_at":"2025-08-28T20:47:33Z","title":"Multi-robot Path Planning and Scheduling via Model Predictive Optimal Transport (MPC-OT)"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":21},"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-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 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2508.21205."}