{"as_of":"2026-08-05T23:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d49312b8504167491e15f827abade62b682ad1d95ec0a83d9d69cd3f67392981","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-05T15:59:51.220439Z","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-05T06:32:48.257954+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/2508.19168/citation-record","integrity":"/paper/2508.19168/integrity","json":"/paper/2508.19168/citation-record.json","paper":"/paper/2508.19168"},"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-05T15:59:51.579653Z","title":"Asymptotically optimal sampling- based motion planning methods,","venue":null,"work_id":"66e7e9c5-2cba-4044-a1a3-7f6792c6ddc8","year":2021},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.111895Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:0a6ae9e2efd948078e4df688c7777988808fba94f9d2edd44fe71d609f28de60","observation_id":"28cfdd82-0e46-4dbc-a2b6-dad48b133dc4","resolution":{"observed_at":"2026-08-05T15:59:51.583108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.115358Z","title":"A formal basis for the heuristic determination of minimum cost paths,","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.115358Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:61ae737d3ec580c58f7845ce316429daff6a1d6f16ea998f0b3a8a85476b88b1","observation_id":"3ee3b194-8481-4311-8be3-3e5f81f4bb8d","resolution":{"observed_at":"2026-08-05T15:59:51.115358Z","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-05T15:59:51.566290Z","title":"Dynamic programming, princeton univ,","venue":null,"work_id":"c295a8c8-403b-4914-bdd2-daa62729a4a6","year":1957},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.118557Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:bf424b3a5aa019d4eb97bc1485512408b9afa951a2a489470c9aebe69538bc95","observation_id":"ea82f072-7b54-453e-82ff-d4823635c3a6","resolution":{"observed_at":"2026-08-05T15:59:51.569554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.557846Z","title":"Analysis of probabilistic roadmaps for path planning,","venue":null,"work_id":"94cdf6d3-b86b-4846-b35d-ae2508a0e409","year":1998},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.121981Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:667e5d8cacd0016f79f324e958df59e386af853d2a9e8be98b76a9e047d440bd","observation_id":"37588df9-ab75-48fc-abaa-9594ab6cab5d","resolution":{"observed_at":"2026-08-05T15:59:51.560880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.549426Z","title":"Rapidly-exploring random trees: A new tool for path planning,","venue":null,"work_id":"398d150f-912d-456f-b945-d43e755443b1","year":1998},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.125053Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:78c7bfd8add86ab23c8cdbf791f7adf0371922f02eee4694c14cf99c17318571","observation_id":"918cff78-9be0-40f8-86e2-f1fdd4e087b5","resolution":{"observed_at":"2026-08-05T15:59:51.552442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.540390Z","title":"RRT-connect: An efficient approach to single-query path planning,","venue":null,"work_id":"72d7a6f2-0974-46c9-bae3-a3f4eab70377","year":2000},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.128117Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:ff2991c99112a1c95783bb5f0dd175e410d222e936d8b73b215afcaa3dbd66cf","observation_id":"0da5eaea-0c4f-443c-9286-840a70b05265","resolution":{"observed_at":"2026-08-05T15:59:51.543629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.131253Z","title":"Tree- based grafting approach for bidirectional motion planning with local subsets optimization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.131253Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:21257a74baffef6dbf2b40441449047c6810f74aa281701fcf7edf762ae3f31d","observation_id":"f25a5775-d53e-4232-85cb-017ab052ca29","resolution":{"observed_at":"2026-08-05T15:59:51.131253Z","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-05T15:59:51.527320Z","title":"Approaches for heuristically biasing RRT growth,","venue":null,"work_id":"a797a436-29b9-4f82-b521-ae9855a66119","year":2003},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.134045Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:c008f78c1aad7f111a95bc69d3ed28ce0cb3904da257a43c3fd5cb1de88541ae","observation_id":"69e9a670-591b-499d-b689-45dc78ba5c46","resolution":{"observed_at":"2026-08-05T15:59:51.530436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.136987Z","title":"Bidirectional sampling-based motion plan- ning without two-point boundary value solution,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.136987Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:41ffd1963db6635a7f7f75cc95d88b95d7ee34dc8a8f72870a66c65a9f0f07fc","observation_id":"18ef62ac-1e98-4c2d-8e23-3054a088021b","resolution":{"observed_at":"2026-08-05T15:59:51.136987Z","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-05T15:59:51.139854Z","title":"Adaptively informed trees (AIT*) and effort informed trees (EIT*): Asymmetric bidirectional sampling- based path planning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.139854Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:bab9ef5fdea7d095016d1ea6f70c69baa11b35694d6216febc32c1b87d6efeca","observation_id":"706f0705-bca0-4a85-8057-bbec2f7891f8","resolution":{"observed_at":"2026-08-05T15:59:51.139854Z","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-05T15:59:51.142584Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.142584Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:bf85fcd5d1a872e07cfa1d0721c62ad89a5458068f2c285808cc053c3afdba4e","observation_id":"49d1876e-485a-403a-9097-32760c5bdeec","resolution":{"observed_at":"2026-08-05T15:59:51.142584Z","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-05T15:59:51.504154Z","title":"Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,","venue":null,"work_id":"e158f93e-ce3a-4ff8-bfdd-a7d1badd45ba","year":2014},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.145179Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:987eb26f971d32a4c28ebd9146ecd3bfcccfdc36ee60b0afe8c5f80c73c15ffe","observation_id":"058dc4f1-8a60-4d92-82d4-469b6d53f2ef","resolution":{"observed_at":"2026-08-05T15:59:51.507400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.495605Z","title":"Informed sampling for asymptotically optimal path planning,","venue":null,"work_id":"0e1c26de-c349-4ae5-a742-a0b248293f9e","year":2018},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.149110Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:9fe7be02ee8240cc51043a57963a4372883af52a615a262a51aa632c404eddc8","observation_id":"d89ac7e0-5584-4ba0-9eda-bcf56c24d78f","resolution":{"observed_at":"2026-08-05T15:59:51.498637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.486430Z","title":"Hierarchical rejection sampling for informed kinodynamic planning in high-dimensional spaces,","venue":null,"work_id":"f6e09446-98e0-4265-8bc0-ca030084986c","year":2016},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.151866Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:164ac105675a013fb1a78ac18313dead645940bea052153a36aaf9241fd2e266","observation_id":"645fdd18-aed5-41c9-b856-d193a466d87d","resolution":{"observed_at":"2026-08-05T15:59:51.489926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.477804Z","title":"Gener- alizing informed sampling for asymptotically-optimal sampling-based kinodynamic planning via markov chain monte carlo,","venue":null,"work_id":"3a1014ec-af9f-4422-a186-f136aa239af3","year":2018},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.154593Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:238ffc1b0b1fc6092a17c9bb360c1f4fccc952ac566b02cc185333869ba77354","observation_id":"8cc6a6e3-16ed-442b-b43f-5e5c5955a896","resolution":{"observed_at":"2026-08-05T15:59:51.480853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.157859Z","title":"Elliptical k-nearest neighbors: Path optimization via coulomb’s law and invalid vertices in c-space obstacles,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.157859Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:ad72d6f161ac105476b6c162562d1878f487cb77c7f27b50b9962beb92e64919","observation_id":"85af7b8f-59d8-4a5a-b570-8b1106eb816b","resolution":{"observed_at":"2026-08-05T15:59:51.157859Z","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-05T15:59:51.160608Z","title":"Energy-efficient path planning of reconfigurable robots in complex environments,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.160608Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:269ef618c53ecfff04b24b00dde8181eb2872654b3ec75478d9340de2a5747a6","observation_id":"406d1954-8c01-4f98-8c01-1e72bfff29ab","resolution":{"observed_at":"2026-08-05T15:59:51.160608Z","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-05T15:59:51.459791Z","title":"Non-parametric informed exploration for sampling-based motion planning,","venue":null,"work_id":"f708161f-f664-4917-a954-0999cc2d1792","year":2019},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.163302Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:1345649a29f1f18f6935e014159d85fe482ac19dbbca73aee346f61e5cde706d","observation_id":"1f2d4e02-ad86-4512-8ff4-77924720b05f","resolution":{"observed_at":"2026-08-05T15:59:51.462936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.451052Z","title":"Batch informed trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs,","venue":null,"work_id":"8053f86b-524a-4044-b9ca-71371d597c1a","year":2015},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.166650Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:45ae3a481a7af9062a597e12c99b0a2fb1a47cd6412004fc03f95635749f5081","observation_id":"a0236816-2fe3-4c59-bfa7-0d57bb62a52e","resolution":{"observed_at":"2026-08-05T15:59:51.454308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.442584Z","title":"Batch informed trees (BIT*): Informed asymptotically optimal anytime search,","venue":null,"work_id":"56933c1f-9fb4-489b-affa-bbcc7fa3e545","year":2020},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.169378Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:dbe1e3f2196385474a7b00288682f5ef335c862a11c825572c5c2dd0df4f7667","observation_id":"ce45fb5b-ec16-47aa-b84d-27107770cbbc","resolution":{"observed_at":"2026-08-05T15:59:51.445636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.172217Z","title":"Penrose, Random geometric graphs","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.172217Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:7a789c72afb43e48ecf5878105b840abd69a0490156ab804c9d791d1dce1f399","observation_id":"f58f18c1-478a-489b-bf5b-a54986f0818c","resolution":{"observed_at":"2026-08-05T15:59:51.172217Z","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-05T15:59:51.429338Z","title":"Advanced BIT* (ABIT*): Sampling- based planning with advanced graph-search techniques,","venue":null,"work_id":"35c14e09-d0fd-42da-a8a5-f52c703696d7","year":2020},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.175322Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:02b1d5d39fdc7ff44b0888c11c0fc77100efb9cdc1b65f045719d64a7588f8a8","observation_id":"72f30d90-bd67-4357-87e1-c6931a5acfb9","resolution":{"observed_at":"2026-08-05T15:59:51.432498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.178130Z","title":"Flexible informed trees (FIT*): Adaptive batch-size approach in informed sampling- based path planning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.178130Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:3045221c920498c62aed74be6ab2816c4d9bb882ab9ec2dfcd08ea93e95ee5ec","observation_id":"9debc243-63b9-4387-8a05-6c5e3b4e6d40","resolution":{"observed_at":"2026-08-05T15:59:51.178130Z","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-05T15:59:51.181180Z","title":"Adaptively informed trees (AIT*): Fast asymptotically optimal path planning through adaptive heuristics,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.181180Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:714aaa690b7fe76d4d70c86058906d0da1364bb1953c1054c0b6ab5e7e40683b","observation_id":"36130420-6d1b-47ca-a015-dbe8a2294da6","resolution":{"observed_at":"2026-08-05T15:59:51.181180Z","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-05T15:59:51.184731Z","title":"Preserving and combining knowledge in robotic lifelong reinforcement learning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.184731Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:0d187c7df4c5010dd53b683768486d94925161409c8c5404b34fe2c05f5f89ec","observation_id":"fa349668-3cfe-4188-9852-b8c8e652811d","resolution":{"observed_at":"2026-08-05T15:59:51.184731Z","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-05T15:59:51.187520Z","title":"Estimated informed anytime search for sampling-based planning via adaptive sampler,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.187520Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:3fd1892126d46ad3d73f356ebc20cdabafa22b2652cc264c6a40f36c0cb3f253","observation_id":"8cb0d8e6-b829-4ef1-a12f-6b1a0a987ee4","resolution":{"observed_at":"2026-08-05T15:59:51.187520Z","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-05T15:59:51.402273Z","title":"Meta-reinforcement learning in non-stationary and dynamic environments,","venue":null,"work_id":"d7a64dd6-1e67-40bc-baa6-9cca73c749f7","year":2023},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.190215Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:f71d944317e09450a3a113bcdb1a6e62006f0d42abf005be204e2fcf8a90d8d9","observation_id":"2db40c9e-7f2f-4daf-ad86-2bba2881b9af","resolution":{"observed_at":"2026-08-05T15:59:51.405386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.393570Z","title":"Solving robotic manipulation with sparse reward reinforcement learn- ing via graph-based diversity and proximity,","venue":null,"work_id":"ae9ea7c4-0dd7-44f7-85bc-39abac2db7b6","year":2023},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.192843Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:587d5a9ee8b4113f952573298a8207d4b2559f19c372e351669c8a07ef121c79","observation_id":"e79f5615-a745-42fa-a1eb-117a6fb70793","resolution":{"observed_at":"2026-08-05T15:59:51.396658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.384500Z","title":"Lateral flexion of a compliant spine improves motor performance in a bioinspired mouse robot,","venue":null,"work_id":"b85aabb2-1f85-4273-b1f3-121263b3aee3","year":2023},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.195618Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:0179390f7d94ef83cb50e96c424f66a70e0df2bf7d935a15af5fdfe81160919e","observation_id":"9174ef6a-b7b3-4e33-b044-cffd417a2ba4","resolution":{"observed_at":"2026-08-05T15:59:51.388140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.374698Z","title":"Cloud- native fog robotics: Model-based deployment and evaluation of real- time applications,","venue":null,"work_id":"366819c3-23e5-4541-aea9-1d5fe6945e0c","year":2025},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.199507Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:cf0365ede69ed21d36438a8671e4dceff0794b5bfe520afd35e3c0cbe5a5d189","observation_id":"97d2d39c-76a8-4ba4-aa02-442deb901180","resolution":{"observed_at":"2026-08-05T15:59:51.377852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.202236Z","title":"Motion planning for robotics: A review for sampling-based planners,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.202236Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:41aeb2c538a2afbee6b458194848d2745fea19fac9f5228bc29ceb1ae958818b","observation_id":"24f96f36-4f23-4b03-b69c-07c2bd7eab42","resolution":{"observed_at":"2026-08-05T15:59:51.202236Z","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-05T15:59:51.361054Z","title":"Complex robotic manipulation via graph-based hindsight goal generation,","venue":null,"work_id":"ea794396-4fc4-4ec4-b73f-c7f640d274be","year":2022},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.205060Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:f66c59fe488aec811a968edd415dbcdc5646adce7c490a5d7e1941a7d8d018b7","observation_id":"eaabf4fb-62e0-49f4-8d56-f8d5658c9389","resolution":{"observed_at":"2026-08-05T15:59:51.364154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.351391Z","title":"Contact-aware shaping and maintenance of deformable lin- ear objects with fixtures,","venue":null,"work_id":"7297efc5-4b6e-4c8e-bbdf-f79bf5d7a1e5","year":2023},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.208369Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:b6c9f303aaa75c81262e3da359f2409ee7d653d72915abdaf957db6f4ef464e1","observation_id":"bc71ba6f-ae89-411f-a8f8-fd63648248b4","resolution":{"observed_at":"2026-08-05T15:59:51.355212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.341523Z","title":"Context-based meta- reinforcement learning with bayesian nonparametric models,","venue":null,"work_id":"dac99dcc-6016-43bb-8b33-e04bb1aaffa5","year":2024},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.211128Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:bfbf74b37866b5e20b2a9b7de81614de1ecf9b3ccd2b199143e7cc1890a1b561","observation_id":"b36d262a-940f-4c55-badd-8e3e4566f67d","resolution":{"observed_at":"2026-08-05T15:59:51.345332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.214086Z","title":"The open motion planning library,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.214086Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:b7a0610ea5d374e7b0745cab92c3747e4456280bc282a3bfbfa9e78048546cb7","observation_id":"c8aa4a1c-42d8-43b8-9cb0-4e4340933b7d","resolution":{"observed_at":"2026-08-05T15:59:51.214086Z","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-05T15:59:51.251547Z","title":"Benchmarking motion planning algorithms: An extensible infrastructure for analysis and visualization,","venue":null,"work_id":"44dce6d5-cf7e-479d-a675-325deeaf1d5c","year":2015},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.217652Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:6a070316017ae9e11e41ff03a67201b83df73b9e6406464985b2e49a3dcbe5ad","observation_id":"2faa1015-fd64-4a0f-b844-8fb1b9b21354","resolution":{"observed_at":"2026-08-05T15:59:51.256404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-05T15:59:51.239975Z","title":"Planner developer tools (PDT): Reproducible experiments and statistical analysis for developing and testing motion planners,","venue":null,"work_id":"10e210df-6296-4c4d-b9ba-306c46374176","year":2022},"citing_paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T15:59:51.220439Z"},"links":{"citing_paper":"/paper/2508.19168"},"observation_digest":"sha256:13dbe2ff610314072f6853fe138a8371ced000f99981baeb44e8ea1afe001f74","observation_id":"316d8095-1ba4-4c8e-95a4-8ef8b77d6991","resolution":{"observed_at":"2026-08-05T15:59:51.245065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.19168","last_updated":"2025-08-26T16:16:18Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-05T15:59:49.427947Z","submitted_at":"2025-08-26T16:16:18Z","title":"Direction Informed Trees (DIT*): Optimal Path Planning via Direction Filter and Direction Cost Heuristic"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":23},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2508.19168."}