{"as_of":"2026-08-05T04:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1a4d94508aa9925cb8ff231f7277d31cc44a5b1e00f730a004319a77ec7f7f38","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-23T01:19:36.679590Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T01:50:43.992888Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-01T18:35:59.119100Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"cited_work":{"arxiv_id":"2503.03509","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.03509","snapshot_observed_at":"2026-07-01T18:35:59.119100Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","venue":"cs.RO","work_id":"1da26931-c73a-4c52-85df-db02b4a6743c","year":2025},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"cited_paper":"/paper/2503.03509","citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:b048b3bfd8e32391c24b872465a048a40bd6242914478bd2505fb0ea20329d0f","observation_id":"09b4d657-f17a-43f8-b273-4598d7e8094f","resolution":{"observed_at":"2026-07-01T18:35:59.120492Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.03509/citation-record","integrity":"/paper/2503.03509/integrity","json":"/paper/2503.03509/citation-record.json","paper":"/paper/2503.03509"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Subdimensional expansion for multirobot path planning","venue":null,"work_id":"33d863ec-dd49-4c11-9b8d-0dae08ac122d","year":2015},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:b7569a90926068976e42dbf60a38c6e9c533216f3f7b122ec3c3fa464d9a4783","observation_id":"c6e41e82-1b0f-417e-98eb-664c551b2828","resolution":{"observed_at":"2026-05-23T01:22:22.110711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Asymptotically optimal kinodynamic planning using bundles of edges","venue":null,"work_id":"17ce6738-3dd0-453d-adf9-8f9a6fceedf7","year":2021},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:8427f354eb45d4046677617132599649d0f68202edbbfe933d938e7f770f684f","observation_id":"ff890989-ec5a-4b78-8add-63cd2a613d77","resolution":{"observed_at":"2026-05-23T01:22:22.107761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-07-06T02:31:49.297199Z","title":"A review of path-planning approaches for multiple mobile robots","venue":null,"work_id":"66fb03e4-8340-4a89-9138-2e6b43489ca6","year":2022},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:6f41cd9bac74e060a4ca57af9f6ee3ff4bc5f0ef96bd284848b5812e820f6b99","observation_id":"81022133-7d87-4c20-a166-ab50c7652339","resolution":{"observed_at":"2026-05-23T01:22:22.104502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Task and Motion Informed Trees (TMIT*): Almost-surely asymptotically optimal inte- grated task and motion planning","venue":null,"work_id":"769aa3fc-9510-4587-abf1-5f63cf2f4d78","year":2022},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:17ad6d0b8187dc8c67d8c964bea2db218a6cda442a6a6d14a5bf3d8e70f40c49","observation_id":"6c5ef1f9-b1e5-4503-8244-298a814100ee","resolution":{"observed_at":"2026-05-23T01:22:22.101165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Task planning with continuous actions and nondeterminis- tic motion planning queries","venue":null,"work_id":"0e75f2ea-cab1-491c-b337-689efd601461","year":2010},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:b661cfdbf44719985ad67af98b219f3a6be8ec584858e9a59f2c2f310deb2a62","observation_id":"3e9103ad-79ba-4b51-8dc6-ac4b5815dc3f","resolution":{"observed_at":"2026-05-23T01:22:22.097775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sampling-Based Motion Planning on Sequenced Mani- folds","venue":null,"work_id":"667fc7b9-7ab8-4bec-9fd2-2db343e0fe04","year":2021},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:d70cd669da060256fe4b000d9b12ed5ee236e0d34af5a976c5ea4279869b5c3f","observation_id":"466a4e5d-bce7-4fdb-b85a-c79741a93ae3","resolution":{"observed_at":"2026-05-23T01:22:22.094672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal, sampling-based manipulation planning","venue":null,"work_id":"7b0c08fa-af0a-45f3-af69-028cf26d4221","year":2017},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:29e9df1424af424fa9286f4923619f5681ea1548f7fc4dc6733851e6b40db6cd","observation_id":"d543cfe8-19b4-4069-bff5-362e9119378b","resolution":{"observed_at":"2026-05-23T01:22:22.086495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal multirobot path planning on graphs: Complete algorithms and effective heuristics","venue":null,"work_id":"c7899606-7449-4300-a206-5116702ff7ce","year":2016},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:c4369d53cf41d788cca3a871520db0c42983f725d2990d4ca8f889acd4d360db","observation_id":"9c3e7263-a855-4f8a-93e9-7dc5975a0d16","resolution":{"observed_at":"2026-05-23T01:22:22.091221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Multi-agent path finding–an overview","venue":null,"work_id":"86affe3d-8936-4dbe-af24-9e2723a5de4d","year":2019},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:ed26d8f74700387fc14732dbe883659f57ba9a14a8330c1f523a247dd30abf16","observation_id":"f79362fd-a865-4639-9763-0e699f8a96d3","resolution":{"observed_at":"2026-05-23T01:22:22.082294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lifelong multi-agent path finding for online pickup and delivery tasks","venue":null,"work_id":"3019caca-4e29-4c8b-9e45-658a8a0c4a97","year":2017},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:714257db53bb4e96d187ce74a013e948a7ee709d6b3ec2739f4019adee23f5b0","observation_id":"fd497905-4829-4336-9f9d-cc714f999893","resolution":{"observed_at":"2026-05-23T01:22:22.224871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A multi-label A* algorithm for multi-agent pathfinding","venue":null,"work_id":"9233ce15-defc-43b1-ba61-bafc8f6228d9","year":2019},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:b509fdc0ec8819ba4bb23d0c12105f9def47e7053ab2e7b7415103c54d460c19","observation_id":"255d2612-de6e-4705-8f94-5d729175c4c2","resolution":{"observed_at":"2026-05-23T01:22:22.221683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"db- cbs: Discontinuity-bounded conflict-based search for multi-robot kin- odynamic motion planning","venue":null,"work_id":"b83bf7bb-270a-47a7-999c-6bbf4cfc8737","year":2024},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:4db5358e30750f69ef209ad831f821c33b91f03eae6b61280af0b66d5fe5c1fe","observation_id":"50b9e749-23fd-4bf2-b2b9-dd189f774a9e","resolution":{"observed_at":"2026-05-23T01:22:22.217976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"dRRT*: Scalable and informed asymptotically-optimal multi-robot motion planning","venue":null,"work_id":"b3fd2b7d-77d9-4214-bc13-3ee4c481e394","year":2020},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:6f135d4e02555c2a146f9ec3545982ec9b4c585492a4eb42ccd9350a7aeb6791","observation_id":"6b580009-791c-43f4-9a06-9e631038d278","resolution":{"observed_at":"2026-05-23T01:22:22.207594Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Using a PRM planner to compare centralized and decoupled planning for multi-robot systems","venue":null,"work_id":"2c30eefa-a302-491d-a782-facb824964f7","year":2002},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:43081e050ec98c3319af0b19126784f723afa2d1cea471072ff68c004af33513","observation_id":"a4f421c4-aa91-4324-bd69-d4c5bc6c7801","resolution":{"observed_at":"2026-05-23T01:22:22.204054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Multilevel motion planning: A fiber bundle formulation","venue":null,"work_id":"285d9759-c53b-4676-93c2-547e04e5715e","year":2024},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:1d3b9ae90f3851786e8ae710bd18c06bc923ea7594f4cea24e976e2d353464a3","observation_id":"3691f5f1-2682-4f0e-b29b-8e53bf74ee35","resolution":{"observed_at":"2026-05-23T01:22:22.200566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Long-horizon multi-robot rearrangement planning for construction assembly","venue":null,"work_id":"9696c319-8617-4a97-94df-c3443dc397cc","year":2022},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:d83b0b4fd3fe247be3d52f0b2deea256a209dd1ad26b69eafebc5937d63c3b3d","observation_id":"9536b696-fe4d-4f7e-8ff9-1810923725ba","resolution":{"observed_at":"2026-05-23T01:22:22.197038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10665","last_updated":"2023-09-19T14:48:21Z","snapshot_observed_at":"2026-07-06T16:20:36.866744Z","submitted_at":"2023-09-19T14:48:21Z","title":"Fast-dRRT*: Efficient Multi-Robot Motion Planning for Automated Industrial Manufacturing","version":1},"cited_work":{"arxiv_id":"2309.10665","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.10665","snapshot_observed_at":"2026-07-03T11:38:05.537564Z","title":"Fast-dRRT*: Efficient Multi-Robot Motion Planning for Automated Industrial Man- ufacturing","venue":null,"work_id":"66dd5429-412f-4371-9091-83303ccae295","year":2025},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"cited_paper":"/paper/2309.10665","citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:c705e036420c984da281bd576a78357aaa266aaba5cbd454512a97861a99ffd9","observation_id":"703b6ea0-75fc-4761-a4da-0680abc4b15c","resolution":{"observed_at":"2026-05-23T01:22:20.839329Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.02475","last_updated":"2022-03-04T18:12:49Z","snapshot_observed_at":"2026-07-06T12:44:29.320216Z","submitted_at":"2022-03-04T18:12:49Z","title":"Cooperative Task and Motion Planning for Multi-Arm Assembly Systems","version":1},"cited_work":{"arxiv_id":"2203.02475","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.02475","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cooperative task and motion planning for multi-arm assembly systems","venue":null,"work_id":"0b40af20-b332-4599-9265-cd0b714f9e02","year":2022},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"cited_paper":"/paper/2203.02475","citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:c4fe176a4bfe3997d365fcdb8e5e36da9283717fc881c020846ce104a457871d","observation_id":"e9b79782-3a5f-49a0-864b-27b743ff156e","resolution":{"observed_at":"2026-05-23T01:22:20.818277Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Rapidly-exploring random trees: Progress and prospects","venue":null,"work_id":"c03a545a-ba43-4038-b984-70019326203b","year":2001},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:39f982e5d7d755c36a1b8d14fae0dcb2fb8602c183f9442beb1bfdadaf3cfff5","observation_id":"50d35ca8-e977-4d70-b72c-49cc7aaddad2","resolution":{"observed_at":"2026-05-23T01:22:22.193459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prob- abilistic roadmaps for path planning in high-dimensional configuration spaces","venue":null,"work_id":"758b9b76-b8bf-49fe-b7c8-505ad19878fb","year":1996},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:919cf6805899ea125d3e1be2f9f9cf2219fff3f3109ab98e0467b3b4da0b031b","observation_id":"98f3d637-a119-481e-bda6-5fdc8e0712c2","resolution":{"observed_at":"2026-05-23T01:22:22.189984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning","venue":null,"work_id":"41b16104-37bf-4df1-955f-945bd3faee74","year":2016},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:d09e052111d4785747909675e75acc3dc5ae105ea9fb9e3bed091fcf731a38c3","observation_id":"a35a3145-81e8-45a0-9c16-cccd6963e049","resolution":{"observed_at":"2026-05-23T01:22:22.186219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Conflict-based search for optimal multi-agent pathfinding","venue":null,"work_id":"af4df1aa-c58e-48e8-a90e-5a43ebd76dee","year":2015},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:697c884536790c32c0851fced4aa10e82f3c84f2a414b703c2bf7ba6743ec278","observation_id":"e3e97174-bc5b-4c7f-a600-683bf9568114","resolution":{"observed_at":"2026-05-23T01:22:22.182330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Representation- optimal multi-robot motion planning using conflict-based search","venue":null,"work_id":"faea8b6c-2ae5-4821-af61-bae98242d306","year":2021},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:bed3eac62e9b4bac2a626ecacaa7c0e640b32f2cc8ca4abac30a205872f72279","observation_id":"073357a7-4cb2-46a1-b686-4118226ec57a","resolution":{"observed_at":"2026-05-23T01:22:22.176925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Conflict-Based Search for Multi-Robot Motion Planning with Kinodynamic Constraints","venue":null,"work_id":"41744736-e09a-4c7f-a6c1-bf46922e06ed","year":2022},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:ea5aebbffc0866544900e965078a226a51d9336cc0263317f2cba041ccf16db6","observation_id":"48ca2e8e-b72e-4f76-86e3-bec0a274ad91","resolution":{"observed_at":"2026-05-23T01:22:22.170528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prioritized motion planning for multiple robots","venue":null,"work_id":"5af1ac63-9f97-41aa-9c07-1656666cc4c2","year":2005},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:1326e791c8d573fff796eef585ab08943875a94bb5a8d82765283550f30e1b95","observation_id":"c09b02f7-dea3-4dec-abc4-7c39642eb514","resolution":{"observed_at":"2026-05-23T01:22:22.167234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.00315","last_updated":"2023-05-05T14:45:05Z","snapshot_observed_at":"2026-07-06T12:42:44.639026Z","submitted_at":"2022-03-01T09:43:20Z","title":"Quick Multi-Robot Motion Planning by Combining Sampling and Search","version":3},"cited_work":{"arxiv_id":"2203.00315","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.00315","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quick multi-robot motion planning by combining sampling and search","venue":null,"work_id":"4081c02b-ac95-4c12-aa1c-a87961b25ee5","year":2022},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"cited_paper":"/paper/2203.00315","citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:420a3881c34a5879ef7a16c10966ed2e16c7539013f12a5145ec096a27393565","observation_id":"3c77ef1a-b56e-47b9-b158-e8d419202bd6","resolution":{"observed_at":"2026-05-23T01:22:20.833118Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07606","last_updated":"2024-10-10T04:35:27Z","snapshot_observed_at":"2026-07-06T19:30:56.585110Z","submitted_at":"2024-10-10T04:35:27Z","title":"Stop-N-Go: Search-based Conflict Resolution for Motion Planning of Multiple Robotic Manipulators","version":1},"cited_work":{"arxiv_id":"2410.07606","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.07606","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stop-N-Go: Search-based Conflict Resolution for Motion Planning of Multiple Robotic Manipulators","venue":null,"work_id":"87b84b5c-c9af-4320-aff8-d0d16113ae14","year":2024},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"cited_paper":"/paper/2410.07606","citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:cb7762227cc5985bd2539bcfb263e13532cb70ab648d257584b635ddf430ae1f","observation_id":"5f43a822-9b1b-45e8-abda-e1f6ca84aba7","resolution":{"observed_at":"2026-05-23T01:22:20.845789Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Searching with consistent prioritization for multi-agent path finding","venue":null,"work_id":"2204ac26-0ccf-4a5c-9a85-aa38c7573d73","year":2019},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:1450278f6f2cb032d627199ce602f475a6c11b520602621a532ac544739260ab","observation_id":"ad84fa43-7135-466a-9012-cf0b1bf4ece2","resolution":{"observed_at":"2026-05-23T01:22:22.164103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ICBS: The improved conflict-based search algorithm for multi-agent pathfinding","venue":null,"work_id":"22b894c4-653c-4055-96e5-31ec0b40eaa1","year":2015},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:42f28078b6c8b657295b959ff78c8fe5bfa0dcb569c08158b40831575be67c52","observation_id":"639982d2-01df-4fae-a152-64abd2aba947","resolution":{"observed_at":"2026-05-23T01:22:22.160745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"EECBS: A bounded-suboptimal search for multi-agent path finding","venue":null,"work_id":"8f072e35-d185-4060-a32f-9a7535e4e97b","year":2021},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:5b19effa4bc3740841b42021ba934d66fb8381a5b402ba6b918985ef10b6fb28","observation_id":"eccf97e5-7682-4f3e-b24b-de4e98cb1fc3","resolution":{"observed_at":"2026-05-23T01:22:22.157258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems","venue":null,"work_id":"f7a23438-a951-422c-b8b8-e826537a6255","year":2020},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:cb823edfa76930fedccb5066ae4343689d8fdc5f65afeecc02ac04ad55b6dbd1","observation_id":"5e0af3c9-d42f-4981-86af-e498e4ecd18b","resolution":{"observed_at":"2026-05-23T01:22:22.210996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fools Rush in Where Angels Fear to Tread in Multi-Goal CBS","venue":null,"work_id":"16e0b8a8-ffd6-4ae3-a3dd-b64da646654d","year":2024},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:35a51327ee5e8356b6ca28bbfd7b254dc224d2e9a765636675be43438374be9c","observation_id":"5ad694e9-976e-40ad-8d64-37e4508db2f6","resolution":{"observed_at":"2026-05-23T01:22:22.153842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sampling-based algorithms for optimal motion planning","venue":null,"work_id":"57b54070-a43b-4dfd-a3b7-d4e1d5e38933","year":2011},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:5d5db99ae4cea5e7fb320fb29c30e4294883fcfb32c04c352a3a188eddf63e01","observation_id":"0b0c1bf2-eea2-4043-b4fb-f7db3714f0e6","resolution":{"observed_at":"2026-05-23T01:22:22.150529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Adaptively Informed Trees (AIT*) and Effort Informed Trees (EIT*): Asymmetric bidirectional sampling- based path planning","venue":null,"work_id":"59198651-e19a-40ad-bfa5-414a2e9bb6ba","year":2022},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:e865c7beb7a5a05d3569c912a89eb23f5d48530ac815c8847549812b54986ec1","observation_id":"d0664309-f168-4332-b7eb-a6a4e4c1781d","resolution":{"observed_at":"2026-05-23T01:22:22.147285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic","venue":null,"work_id":"e2fbabad-bfee-4b19-bdc6-e5b8900fe5c4","year":2014},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:79a625d51bae3d6c601f5a7edbda31f12d520a8fee5bc15f2589908e682d9959","observation_id":"7eb05768-1ff1-4fff-b289-87b295842422","resolution":{"observed_at":"2026-05-23T01:22:22.214408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Effective metrics for multi-robot motion-planning","venue":null,"work_id":"bab88ac9-3d18-420e-a1d8-e6a1456099ee","year":2018},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:4d8599a5ed4148f4d57db0029fb4cb3b524098b872fb44c5cc84702d3d7453a3","observation_id":"7c1af5ad-1b83-4421-9de4-46240173e093","resolution":{"observed_at":"2026-05-23T01:22:22.143876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Accelerating sampling-based optimal path planning via adaptive informed sampling","venue":null,"work_id":"be7ee572-e2cf-47c1-8673-eb87ea7f088f","year":2024},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:36f182da3d3d2de38991ce158538ff15d606c6c7deb25ee4cc57a4bfbc1af745","observation_id":"42d2905d-a36a-43fa-a8bc-a481be741068","resolution":{"observed_at":"2026-05-23T01:22:22.140426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Adaptively Informed Trees (AIT*): Fast asymptotically optimal path planning through adaptive heuristics","venue":null,"work_id":"cbc38872-c758-49e8-84b3-fd73db198df6","year":2020},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:680d81c69a0d88f7bea81a987a4da961633631bdd3389f64e55e51da18b82d94","observation_id":"17435f18-c525-43db-93fe-31d981a840fe","resolution":{"observed_at":"2026-05-23T01:22:22.136719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Batch informed trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs","venue":null,"work_id":"653a2865-3308-4ca3-b711-b9e58c0458a7","year":2015},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:6891e47e7b3ef2c59b108c2319df407ceab2463c6ac15b34a4a0c76a7175902c","observation_id":"bf29ac70-e7da-4c2f-8081-b2cd93cca2b2","resolution":{"observed_at":"2026-05-23T01:22:22.132882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Creating high-quality paths for motion planning","venue":null,"work_id":"be0b7adc-563c-45d4-8157-70ecc58c4ec1","year":2007},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:331abd34314fd8de6cb6244364872d1effe62c0b8b009d63751404e0ca591c41","observation_id":"1dc03cf3-2158-4181-80ce-85db992ae3c4","resolution":{"observed_at":"2026-05-23T01:22:22.129473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The Pinocchio C++ library – A fast and flexible implementation of rigid body dynamics algorithms and their analytical derivatives","venue":null,"work_id":"0301b232-9237-48be-8e0c-7e92eb3749fa","year":2019},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:b06be7a4a912de8befbe8b50d7905f62a6a03071448a51c86e943b0d011e2429","observation_id":"39b1fc6f-6de0-476d-aea1-695c706e4edd","resolution":{"observed_at":"2026-05-23T01:22:22.125933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Towards computing low-makespan solutions for multi-arm multi-task planning problems","venue":null,"work_id":"c5325210-c0f5-4049-a88e-16fda24708d6","year":null},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:ea586d5ff6845aca9d7d986331446cf51d1d01931d3ad2a78c6049db0946e9ed","observation_id":"66486ebf-82fc-46fb-88fc-70cdb1d0e821","resolution":{"observed_at":"2026-05-23T01:22:22.121470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.17527","last_updated":"2023-06-02T20:04:12Z","snapshot_observed_at":"2026-07-06T15:34:21.966171Z","submitted_at":"2023-05-27T16:59:13Z","title":"Towards computing low-makespan solutions for multi-arm multi-task planning problems","version":2},"cited_work":{"arxiv_id":"2305.17527","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.17527","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Available: https://arxiv.org/abs/2305.17527","venue":null,"work_id":"c33d173a-d116-43f6-9239-b165cf280cbe","year":null},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"cited_paper":"/paper/2305.17527","citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:1bcada415d4677ca353959f5235ba40d645ee2dc00968a578c28759ce7e2e070","observation_id":"0ca6dd26-e8db-42ea-8332-11ead9246afa","resolution":{"observed_at":"2026-05-23T01:22:20.825054Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Using experience to improve constrained planning on foliations for multi-modal problems","venue":null,"work_id":"24131117-6306-4a73-b1c7-05aad8aa9ec1","year":2021},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:9f82174f3610974a18f26606e930de31d2407e786cc3fd418084d4740aa5e0e2","observation_id":"9befabc8-aee9-43ee-a08f-3b7b73f2b40e","resolution":{"observed_at":"2026-05-23T01:22:22.117443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Effort informed roadmaps (EIRM*): Efficient asymptotically optimal multiquery planning by actively reusing validation effort","venue":null,"work_id":"49258a19-a68a-40d1-92eb-a02b3c3e8b32","year":2022},"citing_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-23T01:19:36.679590Z"},"links":{"citing_paper":"/paper/2503.03509"},"observation_digest":"sha256:e0d57801e4a02b552a2e9090ccd9e0110ad76f7c0df150581a5469466c496ad3","observation_id":"e1bfb647-f869-498e-87d7-a7b2570be190","resolution":{"observed_at":"2026-05-23T01:22:22.114056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","latest_version":3,"primary_category":"cs.RO","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":5,"verified_fuzzy":40},"total_outbound_references":45},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 1 inbound Pith citation observation for arXiv:2503.03509."}