{"as_of":"2026-08-11T17:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:173987b297a058c5bf3024f1fc227827de5075980913d126784b400f0a12251b","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T05:12:46.302131Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:20:17.296657Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-28T23:42:49.469683Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.17993","last_updated":"2024-12-23T21:27:19Z","snapshot_observed_at":"2026-08-11T05:06:01.836939Z","submitted_at":"2024-12-23T21:27:19Z","title":"Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.17993","snapshot_observed_at":"2026-08-07T14:20:17.296657Z","title":"Multi-agent path finding in continuous spaces with projected diffusion models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.296657Z"},"links":{"cited_paper":"/paper/2412.17993","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:6417e85161948e6a7428442f1a70ecf74d2fba644790cc67673cb613a6c0d7c7","observation_id":"951789c2-afc1-435d-bc43-18f6214094f2","resolution":{"observed_at":"2026-08-07T14:20:17.296657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"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":{"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":"2412.17993","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.17993","snapshot_observed_at":"2026-06-28T23:42:49.469683Z","title":"Christopher and Sven Koenig and Ferdinando Fioretto , title =","venue":null,"work_id":"f809986b-d600-4dce-a599-5cbbf922d315","year":2024},"citing_paper":{"arxiv_id":"2604.06598","last_updated":"2026-04-08T02:32:54Z","snapshot_observed_at":"2026-07-06T22:55:01.863342Z","submitted_at":"2026-04-08T02:32:54Z","title":"Train-Small Deploy-Large: Leveraging Diffusion-Based Multi-Robot Planning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T18:45:04.853816Z"},"links":{"cited_paper":"/paper/2412.17993","citing_paper":"/paper/2604.06598"},"observation_digest":"sha256:43cb7c01edcb6319d18fb4411608d08d434f1a76b36b1705233c2d4923b7912b","observation_id":"eb061e94-b8a4-46bd-9dd9-d51a2d45f377","resolution":{"observed_at":"2026-05-11T00:00:54.260047Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2412.17993","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.17993","snapshot_observed_at":"2026-06-28T23:42:49.469683Z","title":"Christopher and Sven Koenig and Ferdinando Fioretto , title =","venue":null,"work_id":"f809986b-d600-4dce-a599-5cbbf922d315","year":2024},"citing_paper":{"arxiv_id":"2605.10917","last_updated":"2026-05-11T17:52:15Z","snapshot_observed_at":"2026-07-06T23:22:47.781940Z","submitted_at":"2026-05-11T17:52:15Z","title":"Optimal and Scalable MAPF via Multi-Marginal Optimal Transport and Schr\\\"odinger Bridges","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-12T03:54:39.066558Z"},"links":{"cited_paper":"/paper/2412.17993","citing_paper":"/paper/2605.10917"},"observation_digest":"sha256:cae7853581d8712052b8ffe7aa582d4492f3a1d78981b30474b4e76f22c5bebc","observation_id":"d9c68919-4771-4943-9c3a-799f9c26a22a","resolution":{"observed_at":"2026-05-12T03:56:21.847682Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2412.17993","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.17993","snapshot_observed_at":"2026-06-28T23:42:49.469683Z","title":"Christopher and Sven Koenig and Ferdinando Fioretto , title =","venue":null,"work_id":"f809986b-d600-4dce-a599-5cbbf922d315","year":2024},"citing_paper":{"arxiv_id":"2605.30825","last_updated":"2026-05-29T04:25:45Z","snapshot_observed_at":"2026-07-06T23:40:03.151978Z","submitted_at":"2026-05-29T04:25:45Z","title":"Unlearning in Diffusion Models: A Unified Framework with KL Divergence and Likelihood Constraints","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T23:39:16.848908Z"},"links":{"cited_paper":"/paper/2412.17993","citing_paper":"/paper/2605.30825"},"observation_digest":"sha256:ebd8dd1f7b241942f52ac1a6d9a30568b2e21e37a925a23fa6f9eadcdb99a47b","observation_id":"524326c5-3dc3-440a-95dc-b7a932eb0796","resolution":{"observed_at":"2026-06-28T23:42:49.471011Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-02T02:06:24.664871Z","title":"Multi-agent path finding in continuous spaces with projected diffusion models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14455","last_updated":"2026-07-16T01:04:32Z","snapshot_observed_at":"2026-08-09T12:19:59.345529Z","submitted_at":"2026-07-16T01:04:32Z","title":"Motion Planning with Model-Based Diffusion via Constraint Optimization and Adaptive Scheduling","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T02:06:24.664871Z"},"links":{"cited_paper":"/paper/2412.17993","citing_paper":"/paper/2607.14455"},"observation_digest":"sha256:2df9ae9d7bf006419faf2c0acc0c8095151b2c995020da5378effb76d64e5cc3","observation_id":"92508bfd-ae7a-4e5a-93cf-395cb4e1c1d8","resolution":{"observed_at":"2026-08-02T02:06:24.664871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.17993/citation-record","integrity":"/paper/2412.17993/integrity","json":"/paper/2412.17993/citation-record.json","paper":"/paper/2412.17993"},"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-11T05:12:46.786891Z","title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","venue":null,"work_id":"c3df933c-80f0-4459-af3b-34f2a9184cae","year":2019},"citing_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},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.219762Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:ac4c60597dba892af4a60161d20d3aeb8e2aec0ae904a7250c85ccaf48d0f2dd","observation_id":"920c1e81-28c3-451d-89df-3d3b99f7fb34","resolution":{"observed_at":"2026-08-11T05:12:46.791874Z","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-11T05:12:46.775181Z","title":"Lifelong multi-agent path finding in large-scale warehouses","venue":null,"work_id":"37b004a3-2db2-4b5f-b05f-82257aa9c538","year":2021},"citing_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},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.224925Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:a23290eba7ccd5a0988d435fe48b00ba085800bb7673638c552dae1de268a84d","observation_id":"e782c7a3-1172-4510-8a61-ad7ee29dda5a","resolution":{"observed_at":"2026-08-11T05:12:46.779733Z","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-11T05:12:46.764007Z","title":"warehouseman's problem","venue":null,"work_id":"fe61267e-9a20-4ea3-a4b4-75ccbcc56741","year":1984},"citing_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},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.229161Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:d3bb930fd98465a8b1a582a5193466b4b8a590f53ab08740701ef88272c6b51e","observation_id":"7f3c8062-5ff6-46e1-8434-8e8171f0a3ce","resolution":{"observed_at":"2026-08-11T05:12:46.767933Z","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-11T05:12:46.232862Z","title":"Generative modeling by estimating gradients of the data distribution","venue":null,"work_id":null,"year":2019},"citing_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},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.232862Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:d0469966be10c54db302ab70f5c104cd01d2d64354bfc16e0c8c8937d4b080ac","observation_id":"df1953d4-4dc3-4025-9f8d-44bf128921e9","resolution":{"observed_at":"2026-08-11T05:12:46.232862Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:12:46.236989Z","title":"Denoising diffusion probabilistic models","venue":null,"work_id":null,"year":2020},"citing_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},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.236989Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:cf9653c99aeb46dc26c129f2d4b40c15455d2c75caa88e224a37298e58ece056","observation_id":"f17def52-2474-4c20-8c89-ed79aba7dca6","resolution":{"observed_at":"2026-08-11T05:12:46.236989Z","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-11T05:12:46.739113Z","title":"Motion planning diffusion: Learning and planning of robot motions with diffusion models","venue":null,"work_id":"e45600dc-21d2-4af0-9c61-0b5eece159f9","year":2023},"citing_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},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.240840Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:aa8d05aab698f6ec723f0f31c8963de3ecfa3d528fdb9cfec337cabfdf5933d8","observation_id":"3ce4b3b3-dd3b-430a-a8da-2af9c5456ff6","resolution":{"observed_at":"2026-08-11T05:12:46.742867Z","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-11T05:12:46.245302Z","title":"Constrained synthesis with projected diffusion models","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.245302Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:ece0729fa279540a52ceb6ef474663a71c250ba54006cfc8865a8ea3377697db","observation_id":"1df36624-0641-4a57-afc2-923ff9adbdef","resolution":{"observed_at":"2026-08-11T05:12:46.245302Z","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-11T05:12:46.721131Z","title":"Improved heuristics for multi-agent path finding with conflict-based search","venue":null,"work_id":"a6e16d50-957a-4786-80bc-813d182ede1c","year":2019},"citing_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},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.248718Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:5800a41363fd04ac60e322e2cfc5adcf7b5ba3867df1a252896c10fdc3f9a9a4","observation_id":"07fd95b0-869f-4b91-a345-e0de132b6d9f","resolution":{"observed_at":"2026-08-11T05:12:46.725483Z","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-11T05:12:46.709598Z","title":"Eecbs: A bounded-suboptimal search for multi-agent path finding","venue":null,"work_id":"a81684c2-d6b4-439a-b4f0-8d071c99ea3c","year":2021},"citing_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},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.252278Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:b9f5472a6b6f9cc6f93c41264ad60ce73205edab8157e5e2bedfbe93fa7a9dd1","observation_id":"f1dcf214-b12d-4ee7-832f-4e0f54a5016b","resolution":{"observed_at":"2026-08-11T05:12:46.713418Z","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-11T05:12:46.697847Z","title":"Priority inheritance with backtracking for iterative multi-agent path finding","venue":null,"work_id":"d4d95076-cc7f-4b14-b2a2-01393fc3c417","year":2022},"citing_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},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.255677Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:9953bdb852ebc211ad9609dfaf3bcc0ca1871553f62a2f635b8f2f4a9a44d1c2","observation_id":"3990c990-bd74-4bdd-8eb9-c542c4faaa3f","resolution":{"observed_at":"2026-08-11T05:12:46.701613Z","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":"2410.03072","last_updated":"2025-05-07T13:04:49Z","snapshot_observed_at":"2026-08-09T09:32:46.526838Z","submitted_at":"2024-10-04T01:31:13Z","title":"Multi-Robot Motion Planning with Diffusion Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03072","snapshot_observed_at":"2026-08-11T05:12:46.259182Z","title":"Multi-robot motion planning with diffusion models","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.259182Z"},"links":{"cited_paper":"/paper/2410.03072","citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:98929d9a172e6d310d2eee3d64332eb72bb9a0b52d420b6ae8d1a14122201a0f","observation_id":"020d3bc6-55cb-419f-861d-959be2339a0f","resolution":{"observed_at":"2026-08-11T05:12:46.259182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:12:46.263347Z","title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","venue":null,"work_id":null,"year":1996},"citing_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},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.263347Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:fc287751dfcaab261458d0296f628c1e608972f4262bd0e6702bf434fcc47c69","observation_id":"51f3646e-b3e9-4719-9f86-29f0785b9bd7","resolution":{"observed_at":"2026-08-11T05:12:46.263347Z","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-11T05:12:46.678872Z","title":"Rapidly-exploring random trees: A new tool for path planning","venue":null,"work_id":"9e97e6a9-9068-4900-bc00-f6c0a3494f8e","year":1998},"citing_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},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.266866Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:c07b59dfbefa0941fede1dafb4a3359c5c140b24f723b361985def192c39aabe","observation_id":"9d9283a0-0609-4e29-a5ad-9a52f55538c5","resolution":{"observed_at":"2026-08-11T05:12:46.682678Z","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-11T05:12:46.270230Z","title":"Schoellig, and Raffaello D'Andrea","venue":null,"work_id":null,"year":2012},"citing_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},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.270230Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:8356686748d158f80dca686ef4c1990352990c97661e36cc104ae99764a8937a","observation_id":"3ffa2f30-a81b-48f9-83b6-b58e3468a0f6","resolution":{"observed_at":"2026-08-11T05:12:46.270230Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:12:46.274073Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_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},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.274073Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:33b0b7053f2c41f84ff5581c52a827c1cd381e20b492795b271b4fc0a223b3f1","observation_id":"9c401c3b-c1eb-4fc7-9354-8194768f0f2d","resolution":{"observed_at":"2026-08-11T05:12:46.274073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:12:46.277645Z","title":"Multi-agent cooperative motion planning based on alternating direction method of multipliers","venue":null,"work_id":null,"year":2023},"citing_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},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.277645Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:68b515bd5865fb6496c121069104178d67225ab5747f779003c2310e56f257ca","observation_id":"c6173f51-e31c-472b-94f8-2ffe89a27bd5","resolution":{"observed_at":"2026-08-11T05:12:46.277645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.09991","last_updated":"2022-12-21T01:06:18Z","snapshot_observed_at":"2026-08-06T05:32:02.292779Z","submitted_at":"2022-05-20T07:02:03Z","title":"Planning with Diffusion for Flexible Behavior Synthesis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.09991","snapshot_observed_at":"2026-08-11T05:12:46.280949Z","title":"Planning with diffusion for flexible behavior synthesis","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.280949Z"},"links":{"cited_paper":"/paper/2205.09991","citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:ac893e6d5c27c91f09ac5d045dd962fd9fea3efcf9afb3309cd76644d1a2fe1d","observation_id":"39ac7ff8-8bec-4366-b5cb-12e36567ed6b","resolution":{"observed_at":"2026-08-11T05:12:46.280949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.09467","last_updated":"2022-01-24T05:43:59Z","snapshot_observed_at":"2026-08-08T22:05:10.442729Z","submitted_at":"2022-01-24T05:43:59Z","title":"CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.09467","snapshot_observed_at":"2026-08-11T05:12:46.284952Z","title":"Ctrms: Learning to construct cooperative timed roadmaps for multi-agent path planning in continuous spaces","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.284952Z"},"links":{"cited_paper":"/paper/2201.09467","citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:65cb04c4b1c0d0e7e85d1b2d91e95feb6dcf779b10d377d3bef20bea2f523453","observation_id":"f4407c1d-5091-49bc-ba61-be6a49f856fc","resolution":{"observed_at":"2026-08-11T05:12:46.284952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:12:46.288867Z","title":"Diffusion models: A comprehensive survey of methods and applications","venue":null,"work_id":null,"year":2023},"citing_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},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.288867Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:06bb1713d81685c8612d3a6e86bc1019cfe85cd4a8bee6736d33da62e3264318","observation_id":"d811efbf-d0f0-47e3-8404-2761a9af3c47","resolution":{"observed_at":"2026-08-11T05:12:46.288867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.13456","last_updated":"2021-02-10T18:17:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-11-26T19:39:10Z","title":"Score-Based Generative Modeling through Stochastic Differential Equations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.13456","snapshot_observed_at":"2026-08-11T05:12:46.293245Z","title":"Score-based generative modeling through stochastic differential equations","venue":null,"work_id":null,"year":2011},"citing_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},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.293245Z"},"links":{"cited_paper":"/paper/2011.13456","citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:0918bb8f848706e02279258fdbdb33cb033ee9ac53f890ca0296a3f12dcb824f","observation_id":"80019551-933e-4fbd-87bc-96a5a08bc5ca","resolution":{"observed_at":"2026-08-11T05:12:46.293245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T05:12:46.298125Z","title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","venue":null,"work_id":null,"year":2011},"citing_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},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.298125Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:5921cb8992000ec3a9030fd6367d0ada1dee4c1eb9f1bb3dba5c078936ff437f","observation_id":"29830196-02f7-4a9f-babf-c51d5fab7d65","resolution":{"observed_at":"2026-08-11T05:12:46.298125Z","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-11T05:12:46.652313Z","title":"Fast approximations for job shop scheduling: A lagrangian dual deep learning method","venue":null,"work_id":"8dfc227b-6e49-4868-acf3-b7bbd848c723","year":2022},"citing_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},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T05:12:46.302131Z"},"links":{"citing_paper":"/paper/2412.17993"},"observation_digest":"sha256:84a5b897416af02d63fed4be3e269dc5853d59f26249dfa8b397b552cfdaffdb","observation_id":"d5e393d8-80f6-48db-b9f3-b5bcdd57ecf6","resolution":{"observed_at":"2026-08-11T05:12:46.657785Z","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":"2412.17993","last_updated":"2024-12-23T21:27:19Z","latest_version":1,"primary_category":"cs.RO","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"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":22},"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 22 of 22 outbound references and 6 inbound Pith citation observations for arXiv:2412.17993."}