{"as_of":"2026-08-20T21:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c4b87d25055cdd6e891fda82804c0dc43644b985ee65dbdb591ff02099f5c608","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:13:01.416660Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.08521/citation-record","integrity":"/paper/2509.08521/integrity","json":"/paper/2509.08521/citation-record.json","paper":"/paper/2509.08521"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.934093Z","title":"2013 IEEE International Conference on Robotics and Automation : 2421--2428 ://api.semanticscholar.org/CorpusID:14282741","venue":null,"work_id":"0c5a0a43-1149-447d-b693-a0ee375619ff","year":2013},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.256454Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:00a25b6206dac849601079871b8bff2dc036fe0b0cbe9e3110dc4d3caa2e91dc","observation_id":"8b2c72fc-4502-4b9d-8d34-184cd64c80a1","resolution":{"observed_at":"2026-08-15T16:13:01.938445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.921761Z","title":"2015 IEEE International Conference on Robotics and Automation (ICRA) : 4819--4826 ://api.semanticscholar.org/CorpusID:12488088","venue":null,"work_id":"b850055d-0f26-4fff-a71b-4799b6406dc9","year":2015},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.261774Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:c1abe62ee6e6d85907448200b7988dc05566809b47e4fc60f23ad8629f77408d","observation_id":"31953914-11c9-4bd3-ae87-23b010dbc220","resolution":{"observed_at":"2026-08-15T16:13:01.926413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.908582Z","title":"Proceedings 2000 ICRA","venue":null,"work_id":"452e052c-ae4c-49ce-8a42-3adbb7514f94","year":2000},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.265899Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:9d6b29d4d499f7031b63a84f92e1e1ec9e655ce0f6ff5f14ff09e59532ade122","observation_id":"5e984225-aeb8-4ebe-9cf1-c24aea0cab2e","resolution":{"observed_at":"2026-08-15T16:13:01.912887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.270468Z","title":"Numerische Mathematik 1(1): 269--271","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.270468Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:d74c85a552144c5c7fe52c66c545e0aed7f0ead127d398cfd9f1bbf7137c63ce","observation_id":"50ccfa16-a2da-472a-90cd-63b4ace8c6e1","resolution":{"observed_at":"2026-08-15T16:13:01.270468Z","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-15T16:13:01.892748Z","title":"Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006","venue":null,"work_id":"be7cad4a-7f73-4005-a35d-5432d3bf3331","year":2006},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.275183Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:a8f1bc6dbab062593c9d603ef1a30b32c282baeb4bf0a62a84c6e72790144c8d","observation_id":"bffe156b-2598-4a65-a02b-271fb96480d3","resolution":{"observed_at":"2026-08-15T16:13:01.898102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.878842Z","title":"The International Journal of Robotics Research 39: 543 -- 567","venue":null,"work_id":"0860c4a6-21c0-4c16-8847-0600678a1c32","year":2017},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.279565Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:37890abe0beea2bc90879755f3fb7055abbbf16302e74d67152126060160f038","observation_id":"71979c34-1a27-4c2e-9f4f-341fd19db2ad","resolution":{"observed_at":"2026-08-15T16:13:01.883269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.863684Z","title":"IEEE Transactions on Robotics 34: 966--984","venue":null,"work_id":"6c98f2f4-738a-42c9-903b-688dc2274814","year":2017},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.283854Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:bbca9c6aa225c38278d0ed8548e50cdeb44bb7452e63db7ab5e0ec8b977b68a9","observation_id":"34a3b47d-e59d-470b-807e-d0705481d2be","resolution":{"observed_at":"2026-08-15T16:13:01.868003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.849799Z","title":"2015 IEEE International Conference on Robotics and Automation (ICRA) : 3067--3074 ://api.semanticscholar.org/CorpusID:15776115","venue":null,"work_id":"14e7404b-6033-4838-9bb5-5b2682f8385b","year":2014},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.287657Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:392a4abe7bd882f57da39c6e889235496c5426beb0299ae61fbc2e8189abedcd","observation_id":"2cca6cd2-6811-4c56-af22-8cc62d7e414d","resolution":{"observed_at":"2026-08-15T16:13:01.854364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.836195Z","title":"2014 IEEE/RSJ International Conference on Intelligent Robots and Systems : 2997--3004 ://api.semanticscholar.org/CorpusID:12233239","venue":null,"work_id":"78481e1b-537b-4746-bfde-2d886ec11ba9","year":2014},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.291261Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:919acd9e3ba313fc55a83b72f16c520dea8d4f4f6cf4146c5e8917ce748a7ae8","observation_id":"0c9a1247-cb35-4c28-91c9-ec8643b8fa80","resolution":{"observed_at":"2026-08-15T16:13:01.840714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.821722Z","title":null,"venue":null,"work_id":"15efb043-8938-4224-8112-c3076125763a","year":2020},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.294840Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:ffd37df0d06e997704bb3a714ebac13514e95cd6f1b4c6c8a2a15307cb9ad04e","observation_id":"bfc70acc-52bb-411e-ab3e-54bdf86809a4","resolution":{"observed_at":"2026-08-15T16:13:01.826376Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.299601Z","title":"IEEE transactions on Systems Science and Cybernetics 4(2): 100--107","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.299601Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:830472ff83031202ec77b8740e0dd217e7a25b065d786f36479b53043985ec05","observation_id":"59b2611f-3cf8-41f2-b364-2c8ecee26abe","resolution":{"observed_at":"2026-08-15T16:13:01.299601Z","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-15T16:13:01.790295Z","title":"2015 IEEE International Conference on Robotics and Automation (ICRA) : 2951--2957 ://api.semanticscholar.org/CorpusID:14989369","venue":null,"work_id":"059112dd-a1dc-4adb-980e-a8ca0a3049e2","year":2015},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.304900Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:85c965b8ae7e178961c1f466a24b8540a74db8138f2810ceff3972472770d263","observation_id":"671c2cc4-8cf5-48f5-8252-d67bef99293d","resolution":{"observed_at":"2026-08-15T16:13:01.796072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.777661Z","title":"In: Proceedings of the International Symposium on Robotics Research (ISRR)","venue":null,"work_id":"fc107c0b-fce0-473a-bdc6-8b332806a159","year":2013},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.309331Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:dfa0b77d06b9535ed65f8447a8b30fca0e9623ab815a528a98587bca71239db1","observation_id":"3b59405a-b4b6-4108-bf2e-bd5f6ddea443","resolution":{"observed_at":"2026-08-15T16:13:01.781750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.764266Z","title":"The International journal of robotics research 34(7): 883--921","venue":null,"work_id":"ceae5cfe-287f-48a4-84f9-9f19bc0b88c4","year":2015},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.314333Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:b0d8938b04b6e672961fda2ec2e378538907de4633dc9152c16a5f7e46faa370","observation_id":"12ce6cc8-e002-4c12-8384-a8f79e2faab9","resolution":{"observed_at":"2026-08-15T16:13:01.769250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.751284Z","title":"49th IEEE Conference on Decision and Control (CDC) : 7681--7687 ://api.semanticscholar.org/CorpusID:1555207","venue":null,"work_id":"2d01593e-a7ab-491c-af52-4b70efb366c1","year":2010},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.318104Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:4b42de98a69addb85607c78526dae9ef2b70a179395595d9fac71c4a69cf3b4b","observation_id":"a4239cfb-f84b-4ddf-98fd-9657de89df5f","resolution":{"observed_at":"2026-08-15T16:13:01.755964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.323012Z","title":"The international journal of robotics research 30(7): 846--894","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.323012Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:13dd8c6fefac5a39259f97883fe950f5a49d1e24947ea541fbfc149866c565d5","observation_id":"9b1e1359-523c-49ce-8714-50a73d3a4c85","resolution":{"observed_at":"2026-08-15T16:13:01.323012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.327799Z","title":"IEEE transactions on Robotics and Automation 12(4): 566--580","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.327799Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:75ed6e5481566a5260fa263da3cc8447a1a5c9638a985e781ca85ef1c94ae473","observation_id":"ee011cac-8087-4849-bc3d-0e2621ccdb60","resolution":{"observed_at":"2026-08-15T16:13:01.327799Z","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-15T16:13:01.724006Z","title":"a nder J, Hermann A, R \\","venue":null,"work_id":"a3522547-746e-4709-b5b0-ceaee095202f","year":2015},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.331873Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:8b66b1f3f7d8e710db5f27b704e8003f50d4f8eb33cb8525f633e2d4213f6be0","observation_id":"5a498e1d-ac5a-4b30-9b42-9084575d773d","resolution":{"observed_at":"2026-08-15T16:13:01.728240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.711585Z","title":"In: AAAI/IAAI","venue":null,"work_id":"be4b0887-9a64-4726-be63-ffe65fb388b9","year":2002},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.336594Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:37ba3ce226ed92971f3882d42e8500bd14c35eeed6a3ca54c735892b2f48f90f","observation_id":"8140a1cb-aec5-42d3-a2e0-0c061d184da8","resolution":{"observed_at":"2026-08-15T16:13:01.715450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.699858Z","title":"IEEE Transactions on Robotics 21: 354--363","venue":null,"work_id":"36acd9c1-d4e6-4957-8856-683072a68289","year":2005},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.340260Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:d572632e39f16e97a9279d96f10fdbc620c788ce5ced14909489bde2d8def4bb","observation_id":"bd5fac5a-6950-474e-b03d-adb61d0ff866","resolution":{"observed_at":"2026-08-15T16:13:01.703541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.688420Z","title":null,"venue":null,"work_id":"c1157b7a-7215-4aff-9118-fc9ce7973fa4","year":2004},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.344141Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:9a9fd04d37a66e3029af5f296f8bf77819dd704991b0e6db117773978aa00b6e","observation_id":"b84f2c6f-3bee-4591-93d7-79859a9bc19b","resolution":{"observed_at":"2026-08-15T16:13:01.692260Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.676178Z","title":"In: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems","venue":null,"work_id":"1ac62e8e-b2ab-4442-84ae-e8e7cf57da80","year":2006},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.347860Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:16e1a801556d06caea8dae09b369eb7710cea5b3eeb11e817fdc0da096bbabc8","observation_id":"94e9b32b-e066-41ee-8844-c1bcb8d0249f","resolution":{"observed_at":"2026-08-15T16:13:01.680805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.665134Z","title":"Proceedings 2000 ICRA","venue":null,"work_id":"03c15791-5be8-4000-a94e-875b0a6b97fe","year":2000},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.352076Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:e3eeac11fa975b650109fde298e4e24d3773a8d7bff0cffdbacdd46441a68795","observation_id":"d23d154c-e1e8-408a-8d2e-9a761190c5e6","resolution":{"observed_at":"2026-08-15T16:13:01.668806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.653528Z","title":"The annual research report ://api.semanticscholar.org/CorpusID:14744621","venue":null,"work_id":"cf84acce-1a13-4d8f-a5a9-ca53d34e3bd2","year":1998},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.355687Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:aba7be9adaf4720758d81c92de9af5b58f9234e011322c8c816d05982f1e1433","observation_id":"7d9abdcc-6b60-42af-83d7-014b8b4dafc7","resolution":{"observed_at":"2026-08-15T16:13:01.657664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.641589Z","title":"The international journal of robotics research 20(5): 378--400","venue":null,"work_id":"591c33c8-ed5c-40b1-a2d7-5cdce746348a","year":2001},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.359387Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:7c2b5b0a4c65af846b2161988583d75c27507061c7d482cbcb4f34138943337a","observation_id":"ba7d2f6e-49ff-47ed-974a-dae39b06730c","resolution":{"observed_at":"2026-08-15T16:13:01.645758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.629192Z","title":"The International Journal of Robotics Research 35(5): 528--564","venue":null,"work_id":"9397a256-458a-45a9-b44e-24eb2338840d","year":2016},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.363838Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:59200887fc097aa4935bfcd546455874374f29a20354592c90d4430e255f4c81","observation_id":"c7078294-c685-43ad-8b4e-4dc9c6c41eaa","resolution":{"observed_at":"2026-08-15T16:13:01.633634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.616398Z","title":"a ki J and H \\","venue":null,"work_id":"f2ea651a-0d18-4e8e-b9f8-8fce1236dd2e","year":2015},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.367805Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:073ed4283e4761c9f3211d894fbb2badc986cbb0e1290e6afd41653681f073fe","observation_id":"9e66b09c-5b40-4c51-b913-bffb331b82b3","resolution":{"observed_at":"2026-08-15T16:13:01.621365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.13119","last_updated":"2023-09-22T18:00:35Z","snapshot_observed_at":"2026-08-16T14:58:20.975026Z","submitted_at":"2023-09-22T18:00:35Z","title":"Sampling-Based Motion Planning: A Comparative Review","version":1},"cited_work":{"arxiv_id":"2309.13119","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.13119","snapshot_observed_at":"2026-08-15T16:13:01.479420Z","title":"Sampling-Based Motion Planning: A Comparative Review","venue":"cs.RO","work_id":"75a1a008-0f82-42ee-9062-5a0e46aa8e56","year":2023},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.371931Z"},"links":{"cited_paper":"/paper/2309.13119","citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:f47153e424d41c81140ed03acbee81bff2ec519ae6d6482371b4a21350c1c78d","observation_id":"eb9d170a-c4bd-465e-9c94-e438a82b8672","resolution":{"observed_at":"2026-08-15T16:13:01.487415Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.601252Z","title":"The International Journal of Robotics Research 35(7): 797--822","venue":null,"work_id":"9f5896ed-45fe-4a0b-a1ab-e445d28a1b9e","year":2016},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.376474Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:6900a91bcc44e3b465be3fe35dc182fffd26ccbed39e7cb16ac554a560c8bfce","observation_id":"c762c27c-606b-4276-b206-27586da12ad5","resolution":{"observed_at":"2026-08-15T16:13:01.606112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.588639Z","title":"2015 54th IEEE Conference on Decision and Control (CDC) : 2574--2581 ://api.semanticscholar.org/CorpusID:2267285","venue":null,"work_id":"0d81e355-fc6c-4e38-9fc9-22b11dbefcb2","year":2014},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.381447Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:8752923f95e226173524712ce14dd94eef16de87b9e3f2c7e2aeafa975cd6564","observation_id":"9184d726-959b-481f-8146-c18d36efce34","resolution":{"observed_at":"2026-08-15T16:13:01.593492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.576036Z","title":"2023 IEEE International Conference on Robotics and Automation (ICRA) : 7837--7843 ://api.semanticscholar.org/CorpusID:259339259","venue":null,"work_id":"f4c336a5-477c-463d-b08c-4e2e593f0cda","year":2023},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.386548Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:54b50254af3faccabcf37718685b77d0aca3b0ae7da4e9a4f744ef9ace491edc","observation_id":"bacecf04-a1f5-4938-9f49-5694f5cf0cdd","resolution":{"observed_at":"2026-08-15T16:13:01.580614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.561446Z","title":"2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) : 2072--2078 ://api.semanticscholar.org/CorpusID:5808032","venue":null,"work_id":"5edc8206-9a77-44f8-a315-e8892c369568","year":2015},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.392640Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:5565c27d69ff0cf41a9fbe5a93615574fcc1b15d9156cf9d892b1d859f069a81","observation_id":"336884cb-5fd4-4a5f-bf3a-6bd087ef25e9","resolution":{"observed_at":"2026-08-15T16:13:01.566474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.548181Z","title":"://api.semanticscholar.org/CorpusID:14389316","venue":null,"work_id":"f460a119-76dd-4973-84ed-72f2ffec6442","year":1994},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.397304Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:975103b7399b86c03e0f314463c5bafd59e4dd51e56c9e336d085e0b6a001154","observation_id":"29e9b170-e186-4429-9087-ac4ee01e85d0","resolution":{"observed_at":"2026-08-15T16:13:01.552718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.534655Z","title":"2020 IEEE International Conference on Robotics and Automation (ICRA) : 3191--3198 ://api.semanticscholar.org/CorpusID:211133126","venue":null,"work_id":"e068c5d5-7a46-4622-a21a-42491d364279","year":2020},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.401942Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:de00ce1aeba365dc8cc551a93a51c6488b7c9425afd57b92bb003a0a1b16df53","observation_id":"c878ab0a-8451-422a-8579-105107dc6740","resolution":{"observed_at":"2026-08-15T16:13:01.538959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.513366Z","title":"2020 IEEE International Conference on Robotics and Automation (ICRA) : 130--136 ://api.semanticscholar.org/CorpusID:211132476","venue":null,"work_id":"602aa465-76eb-4747-853e-83cc2f6e7bc2","year":2020},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.406863Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:8be067cd298d6ae19275fb263f1faa1ff1f6a36cc66be00982068ce77c221267","observation_id":"2800ce92-fa67-4dd6-99dd-68a804826e27","resolution":{"observed_at":"2026-08-15T16:13:01.518880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:13:01.497777Z","title":"The International Journal of Robotics Research 41: 390 -- 417","venue":null,"work_id":"3142efc9-2cd7-49bc-af86-ff7b91f4f4c4","year":2021},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.412032Z"},"links":{"citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:13c8e7aeb116af3d0945e1ffe83784f1f57d0999bb76899ff791434c9a0b5e90","observation_id":"91c6b117-6268-4072-8bb9-4d419aa17b11","resolution":{"observed_at":"2026-08-15T16:13:01.502459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1205.5088","last_updated":"2012-05-23T04:00:24Z","snapshot_observed_at":"2026-08-16T13:49:05.488271Z","submitted_at":"2012-05-23T04:00:24Z","title":"Kinodynamic RRT*: Optimal Motion Planning for Systems with Linear Differential Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.5088","snapshot_observed_at":"2026-08-15T16:13:01.416660Z","title":"ArXiv abs/1205.5088","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T16:13:01.416660Z"},"links":{"cited_paper":"/paper/1205.5088","citing_paper":"/paper/2509.08521"},"observation_digest":"sha256:6f8ecdbc3ef065b8c2aa77f668eb5ab21b5ffbb8af089746eaacca0b5ce56bc0","observation_id":"5a1048fd-60dc-4612-afcd-b40f350f8317","resolution":{"observed_at":"2026-08-15T16:13:01.416660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.08521","last_updated":"2025-09-10T11:57:56Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-19T09:09:08.468221Z","submitted_at":"2025-09-10T11:57:56Z","title":"FMT$^{x}$: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2509.08521."}