{"as_of":"2026-08-22T09:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1477cdc9e5a545b197f9665ea3952f890bb4d244908074d0e18b1a486a26d2b4","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:04:02.919212Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.12014/citation-record","integrity":"/paper/2411.12014/integrity","json":"/paper/2411.12014/citation-record.json","paper":"/paper/2411.12014"},"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-12T18:04:03.290330Z","title":"Time optimal output feedback control of nondeterministic finite state machines with safe reachability","venue":null,"work_id":"d098bb34-fb2a-4874-947b-ae45ac953983","year":2020},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.825701Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:62c7563cce76cb3552ede218a7c47deb823976f9254a71a399102a1d426557c2","observation_id":"88c1118c-d119-49e5-8a4d-f5b25fbe7015","resolution":{"observed_at":"2026-08-12T18:04:03.296851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:03.273301Z","title":"Data-driven controller synthesis via finite abstractions with formal guarantees","venue":null,"work_id":"589b6cf4-0711-44b1-b4ec-bbbc3e4cdcc1","year":2023},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.830367Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:def28f94427a0e186d5d7642cbf2d31e40ae2235d6aa589ddd4d152f8d12b8e7","observation_id":"498e49be-9ebc-4517-9632-5f2e5583e7d9","resolution":{"observed_at":"2026-08-12T18:04:03.278001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:03.257647Z","title":"Output feedback control of nondeterministic finite--state systems with reach--avoid specifications","venue":null,"work_id":"87d0ba5f-8f03-4188-b22b-25ee9521af8f","year":2022},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.836234Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:5ff2a2ed68309549ffc2afadb7018f2caf33f8aa0326946b5392791991615386","observation_id":"db181bb1-6df0-429a-a322-e8c1a8a2d380","resolution":{"observed_at":"2026-08-12T18:04:03.263603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:03.243208Z","title":"Co-b \\\"u chi control barrier certificates for stochastic control systems","venue":null,"work_id":"184e8552-9982-4834-a86f-e87b7171d804","year":2024},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.840784Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:66ebae71daaaada4f295bb4fc800ce34796a646ffe4741505e9e3f742366654c","observation_id":"c96d0883-e4a4-4dfa-8e37-8a056d991b3b","resolution":{"observed_at":"2026-08-12T18:04:03.247828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08497","last_updated":"2025-02-21T23:41:03Z","snapshot_observed_at":"2026-08-21T17:54:53.717562Z","submitted_at":"2024-08-16T02:42:17Z","title":"Data-driven Construction of Finite Abstractions for Interconnected Systems: A Compositional Approach","version":2},"cited_work":{"arxiv_id":"2408.08497","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.08497","snapshot_observed_at":"2026-08-12T18:04:02.958965Z","title":"Data-driven Construction of Finite Abstractions for Interconnected Systems: A Compositional Approach","venue":"eess.SY","work_id":"0fd2ec18-fe56-4f58-8ed0-3db0f00b7c1e","year":2024},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.845901Z"},"links":{"cited_paper":"/paper/2408.08497","citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:d7ee42bf66b227881d5406ed9cdd6076a7bcb0d42aef6de2ed2d2eed312042a4","observation_id":"1a323727-c78b-4567-8acf-016b85373f9e","resolution":{"observed_at":"2026-08-12T18:04:02.967735Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:03.228727Z","title":"Data-driven controller synthesis via co-b \\\"u chi barrier certificates with formal guarantees","venue":null,"work_id":"d1d1b04f-42d3-42b5-bc9a-27e75ada62c4","year":2024},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.850216Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:7804d6c9190c547598648aebe2410e23a782c5d3c61bee182589d93021e46ed4","observation_id":"3e9a2b4a-85c2-47fa-92b5-8a0fde2cfd34","resolution":{"observed_at":"2026-08-12T18:04:03.233761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:03.212574Z","title":"Discrete abstractions for robot motion planning and control in polygonal environments","venue":null,"work_id":"65613082-f1af-4b05-8756-d635641414f9","year":2005},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.854974Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:f8039457e5a5eac3508bacf92def5cae7ca6361332018afb4f262a2f2b7611e1","observation_id":"b749fa2a-f6b0-4185-bbb1-5220f8bfbc12","resolution":{"observed_at":"2026-08-12T18:04:03.217853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:02.858799Z","title":"Principles of model checking","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.858799Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:5f91d1c41296a728283c389442802cbb36b5391e00edd1f3fbc42d082ef9a28a","observation_id":"becfa792-77a3-40ac-9703-5ff9303f84b7","resolution":{"observed_at":"2026-08-12T18:04:02.858799Z","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-12T18:04:03.184831Z","title":"M \\'e thode g \\'e n \\'e rale pour la r \\'e solution des systemes d’ \\'e quations simultan \\'e es","venue":null,"work_id":"1df90342-e8d1-4502-bf56-2f35bab417a3","year":null},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.862860Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:b600cbe38dd1d0371c8354f8f24701897e629194cec3f4ee51605f3c3a73cafc","observation_id":"eb05dcd4-3bb1-467c-ad99-44f5d677fd6c","resolution":{"observed_at":"2026-08-12T18:04:03.191317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:03.170508Z","title":"A note on two problems in connexion with graphs","venue":null,"work_id":"b6de5806-0991-4ef8-b29b-a3c1e283dba1","year":2022},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.867207Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:f7e2d7e928757160f805432e3ad84269c0da0ffb62c1f582aae23501068ed8e7","observation_id":"f9e24c58-9604-4c75-99cf-435ae660fb7f","resolution":{"observed_at":"2026-08-12T18:04:03.174925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:02.872177Z","title":"A formal basis for the heuristic determination of minimum cost paths","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.872177Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:6cbf1594053f84b5dc0a5f84c91d759b68617d6d28cd5041f5230398f1d6c977","observation_id":"2618aab6-c9d0-4178-8751-19b83b05008e","resolution":{"observed_at":"2026-08-12T18:04:02.872177Z","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-12T18:04:03.132131Z","title":"Sampling-based algorithms for optimal motion planning","venue":null,"work_id":"915af93b-25f0-4649-bf9d-c08f75644706","year":2011},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.878361Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:fe53fa97158654773eacc8cc31e28a3c66ae374795919cbc93edb9de6bd29a85","observation_id":"ef09bf75-ee16-4b24-8ced-1b31fb519dc7","resolution":{"observed_at":"2026-08-12T18:04:03.140678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:03.115222Z","title":"Real-time obstacle avoidance for manipulators and mobile robots","venue":null,"work_id":"257fc34e-efb4-43bf-a450-2ea5db457e37","year":1986},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.883337Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:c26c46e6f3256af84c273e353a86d504dd741c3662e1ff273bcc2395cc2b1044","observation_id":"dea24945-0c26-4b35-a41d-d6020b8d57fb","resolution":{"observed_at":"2026-08-12T18:04:03.120636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:03.094725Z","title":"Rrt-connect: An efficient approach to single-query path planning","venue":null,"work_id":"86848b5c-9027-4c22-b58f-acd05d41618f","year":2000},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.887524Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:b8d757246d967ad8094b8bbab6c4ab04e94905ca1f541a5365ca5ea608257d29","observation_id":"35a5262d-1e50-43e9-9bc8-5b2a5aa8a7be","resolution":{"observed_at":"2026-08-12T18:04:03.101170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:03.079606Z","title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","venue":null,"work_id":"86c96a82-059b-4e56-919f-d8c286fb37d1","year":1996},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.891805Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:aecb1b01e28ec3b9518162e62c335418188cd6c8484a6779da0991ff1c1f9e84","observation_id":"b1563963-1ebc-42b6-b09d-0ae7c8d554e3","resolution":{"observed_at":"2026-08-12T18:04:03.084395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:02.895740Z","title":"Rapidly-exploring random trees: A new tool for path planning","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.895740Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:072412933759225ff9b54f8b11880e7c646e92e73546252576d93b65cc31a41c","observation_id":"04bf2411-f604-49ac-8860-65edf8458adf","resolution":{"observed_at":"2026-08-12T18:04:02.895740Z","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-12T18:04:03.049298Z","title":"Randomized kinodynamic planning","venue":null,"work_id":"b4d32068-1117-4730-80d2-de0ecf6e0152","year":2001},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.900493Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:e52268e661753bed22291e78ec8c2267f7562167c3c1eb767930d492d3d4d597","observation_id":"f6691d8e-d03b-44bf-876c-95dd97ef7cb3","resolution":{"observed_at":"2026-08-12T18:04:03.055513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:03.032698Z","title":"Safe motion planning in dynamic environments","venue":null,"work_id":"ed9a6d48-5153-4e05-a568-67bf71d8c15a","year":2005},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.906015Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:5f9380990c938e5490f3831831de30f594e2f57ee9758f88d2764043157cb70e","observation_id":"b58a1091-46f1-412a-ae92-0b192fa89769","resolution":{"observed_at":"2026-08-12T18:04:03.038480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:03.015431Z","title":"Online mapping and motion planning under uncertainty for safe navigation in unknown environments","venue":null,"work_id":"f782ed2a-8246-4bd1-840d-94e712d2cff1","year":2021},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.910850Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:671ff0ce694a6f2486244642fc727b42027300f10aee206f4aaf3025759832d7","observation_id":"d496f8f2-a3ff-4d2c-80f4-a6d5dcef06f7","resolution":{"observed_at":"2026-08-12T18:04:03.021397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:02.999679Z","title":"Safety verification of stochastic systems: A repetitive scenario approach","venue":null,"work_id":"7b5ad1b0-b9c4-49e2-9550-252e82523e13","year":2022},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.914925Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:95947a2a340860770f062792adba355965e95aa86897dabce4485bef064cb805","observation_id":"e85b1b93-4c91-4dcd-b76b-245bd481b951","resolution":{"observed_at":"2026-08-12T18:04:03.004837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:04:02.984263Z","title":"A real-time motion planner with trajectory optimization for autonomous vehicles","venue":null,"work_id":"f125beda-5d52-49f0-9466-500d0294e119","year":2012},"citing_paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T18:04:02.919212Z"},"links":{"citing_paper":"/paper/2411.12014"},"observation_digest":"sha256:ae13c0762045151a62dff6e26c57b4a8ecea5a83aa3af7f61a512e2def3d17ac","observation_id":"eeb7a6f5-3c68-4cbb-ade4-8dbcbe91087c","resolution":{"observed_at":"2026-08-12T18:04:02.990817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.12014","last_updated":"2024-11-18T19:55:43Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-17T23:44:22.744919Z","submitted_at":"2024-11-18T19:55:43Z","title":"On-the-Go Path Planning and Repair in Static and Dynamic Scenarios"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":17},"total_outbound_references":21},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2411.12014."}