{"as_of":"2026-08-22T07:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2c2d0144e910503cf29580868553921d318033d207ff372337d75ab7203eddf4","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T21:22:57.276089Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2411.08851/citation-record","integrity":"/paper/2411.08851/integrity","json":"/paper/2411.08851/citation-record.json","paper":"/paper/2411.08851"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:22:57.200069Z","title":"Adaptive robot coordination: A subproblem-based approach for hybrid multi-robot motion planning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.200069Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:1e70a9d88cefde3a78c31231642a243e4b0565c785088ec373fd0f3fbab6707e","observation_id":"1c9a42a1-0cf0-4e15-879d-0cf301056737","resolution":{"observed_at":"2026-08-12T21:22:57.200069Z","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-12T21:22:57.525078Z","title":"A robot path planning framework that learns from experience,","venue":null,"work_id":"7bdad0cb-4421-47f6-a018-043df38a0644","year":2012},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.205424Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:975590af0ca711b9b66f83833e516c619104c226b9b13ec2c553768fcc9bf6c8","observation_id":"4ecca1ba-258a-44a6-8f03-17e15fa1629c","resolution":{"observed_at":"2026-08-12T21:22:57.529597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.512278Z","title":"Experience-based planning with sparse roadmap spanners,","venue":null,"work_id":"4dd90f4b-4e16-4b47-8342-95f69ea3ac29","year":2015},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.209852Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:50da117e5853791595271be09241e1316e72adf7f7d34179aca36cf26ae054ca","observation_id":"144396f7-4740-4905-93dd-1be7ffdbaa1a","resolution":{"observed_at":"2026-08-12T21:22:57.516709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.498470Z","title":"Ddm: Fast near-optimal multi-robot path planning using diversified-path and optimal sub-problem solution database heuris- tics,","venue":null,"work_id":"538c0072-8e5a-4e51-a424-bae12c5d7c1d","year":2020},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.214058Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:49aa908051bcf29f0e40730a6005e3be494ff9ca62ed79b3dfa3c9a74b3a816e","observation_id":"9a0bf6d2-228d-4e5f-bec8-8af943f1e2bf","resolution":{"observed_at":"2026-08-12T21:22:57.503310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.485428Z","title":"Efficient heuristics for multi-robot path planning in crowded environments,","venue":null,"work_id":"3626cc09-1e95-40f6-b808-47eb36ee6db1","year":2023},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.218426Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:25ee5659f8c2b4637f443ff843a46412d8fbdb86a1bae5ad85c73fd596f2b854","observation_id":"51ab6071-a0f9-4103-b975-9c1f7f2ad7f2","resolution":{"observed_at":"2026-08-12T21:22:57.489823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.472229Z","title":"Experience-based multi-agent path finding with narrow corridors,","venue":null,"work_id":"ef909993-ea46-450f-b31a-44c0a28ba261","year":null},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.223483Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:8d721871cd542b05d39d4173055c24c9cf5eef781ddaecd75f320e41ceeb03de","observation_id":"d36aff2c-ed0f-4361-9f5f-e03e9a3d63e6","resolution":{"observed_at":"2026-08-12T21:22:57.476685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.228054Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.228054Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:2c9f343a96f5f6a2f8029822c81687bbaccd9102eeb48544efef2acbc0983147","observation_id":"f3f18728-5c43-40b2-aefa-3649a239b13d","resolution":{"observed_at":"2026-08-12T21:22:57.228054Z","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-12T21:22:57.450309Z","title":"Complexity of the mover’s problem and generalizations,","venue":null,"work_id":"72f63f7e-a510-45b9-a520-6df4ef6932e5","year":1979},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.232934Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:3dab8ec85a34a6b460253fd289a56c407d46810efed0bdb5c11d7cfec1c4dd6a","observation_id":"a0638d6c-1048-40dd-9b9a-dc9a6512ae04","resolution":{"observed_at":"2026-08-12T21:22:57.455072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.435910Z","title":"Prob- abilistic roadmaps for path planning in high-dimensional configuration spaces,","venue":null,"work_id":"45a3e61c-1639-4043-8eab-ed6c4f0181c9","year":1996},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.237015Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:ce772e8e1f531dd2e5a40cd61d6b6a058b1fa85c6383426843126b1417669bdc","observation_id":"4ce9b2d5-e28a-4815-84f3-be013fff9c7e","resolution":{"observed_at":"2026-08-12T21:22:57.440670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.422706Z","title":"Rapidly-exploring random trees: A new tool for path planning,","venue":null,"work_id":"19dcba7d-8199-4209-ad4f-6a5ded8279ea","year":1998},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.241282Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:5d414f3327cdcb31869bedb0f59178f68f6179d33dbc215726074a59ccde7976","observation_id":"b1ae3326-3323-49bb-bceb-ee5c8ab5bf84","resolution":{"observed_at":"2026-08-12T21:22:57.426911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.410373Z","title":"Cooperative multi-robot path planning by heuris- tic priority adjustment,","venue":null,"work_id":"8b4cc15c-9edd-4ee1-a6b0-044a2ff0b9ad","year":2006},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.245188Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:0cca76cf4a8de5705827a428557b3720720a4dc16469c9f1214443a182943e39","observation_id":"102553b5-bffd-4659-96f2-f6829536068a","resolution":{"observed_at":"2026-08-12T21:22:57.414773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.397948Z","title":"Prioritized motion planning for multiple robots,","venue":null,"work_id":"2d5cb153-627b-44df-8a17-a4368f224af1","year":2005},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.248915Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:e0469dfb28866889ac91fd120f67144cd4d743cb2cab762326e0f356a7df94c4","observation_id":"06688b72-6943-42ba-990b-64dc05ac853c","resolution":{"observed_at":"2026-08-12T21:22:57.402252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.384090Z","title":"Pareto-optimal coordination of multiple robots with safety guarantees,","venue":null,"work_id":"ac8bfcb6-6935-4e94-8cd3-bfd69fc2a30c","year":2012},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.252950Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:d76b28954a61ddc64fdfea53f8026815c2b853d62f92266adc7d5ce0c8952d2c","observation_id":"cc0f0291-297a-4663-abaa-f553f448f31e","resolution":{"observed_at":"2026-08-12T21:22:57.388677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.370644Z","title":"Subdimensional expansion for multirobot path planning,","venue":null,"work_id":"ee8d8111-89b3-4a0c-af95-b8f615135951","year":2015},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.256758Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:3976e5be679e583d86d6b4c0ce228eed307bf298af5b9004980a9bc7c5d0966e","observation_id":"691d57da-bf75-488b-b968-34aea71c46e8","resolution":{"observed_at":"2026-08-12T21:22:57.375562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.260885Z","title":"Conflict- based search for optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.260885Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:e668e7352e2afde0e08537723318d96d1425005f563e2c5ae7f81b489c87d1ad","observation_id":"fd74271f-af94-46a5-b38d-b596d0dcc81c","resolution":{"observed_at":"2026-08-12T21:22:57.260885Z","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-12T21:22:57.348484Z","title":"Representation- optimal multi-robot motion planning using conflict-based search,","venue":null,"work_id":"a3547f13-5dca-4f46-ae61-9cbc9d912de0","year":2021},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.264656Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:b7b7b90cb62b69ceeae16c01397ff2d2b5669b7fbf3fc0f4229f6adbca7bb32f","observation_id":"2db1b73a-c5ab-4318-9a71-f6326f4a243b","resolution":{"observed_at":"2026-08-12T21:22:57.352977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.335120Z","title":"RRT-connect: An efficient approach to single-query path planning,","venue":null,"work_id":"42e5b0df-05f6-4ffa-8046-568b1847c0f7","year":2000},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.268501Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:15984cc51c17bb15f9fa069e1707b562ac7dde9685092c7d050bf42079f7d5b4","observation_id":"783e5745-1d88-4b95-8b7b-69386d9c365f","resolution":{"observed_at":"2026-08-12T21:22:57.339328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.320075Z","title":"Conflict-based search for optimal multi-agent path finding,","venue":null,"work_id":"a2c5d2e1-e2ec-448b-a059-2253f25b4c10","year":2012},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.272325Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:8896929641295322be1ecfd4c168f5e60bc2a0aa0c9eb0cb8dc58e768b6fb893","observation_id":"db147a41-68f7-4aac-be85-c3c6e337a11e","resolution":{"observed_at":"2026-08-12T21:22:57.324393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T21:22:57.304222Z","title":"Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem,","venue":null,"work_id":"1cfdd905-5e64-4f90-a842-dccf8a1e8082","year":2014},"citing_paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T21:22:57.276089Z"},"links":{"citing_paper":"/paper/2411.08851"},"observation_digest":"sha256:b1358e8bb937b8015e9451ba56765a9b77206bff7523e76bae5df20ecc2ad572","observation_id":"ff21ae1c-426e-40a3-a3c9-014fb40a2f9a","resolution":{"observed_at":"2026-08-12T21:22:57.310741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.08851","last_updated":"2024-11-13T18:30:28Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-13T17:09:10.766029Z","submitted_at":"2024-11-13T18:30:28Z","title":"Experience-based Subproblem Planning for Multi-Robot Motion Planning"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":19},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2411.08851."}