{"as_of":"2026-08-06T08:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b9a44b48a88df0bd24fce482ebf4e21dc675881eb33fa85b83bb380c9ff82eb","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T15:33:40.883486Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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.19776/citation-record","integrity":"/paper/2508.19776/integrity","json":"/paper/2508.19776/citation-record.json","paper":"/paper/2508.19776"},"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:33:44.430384Z","title":"Asymptotically optimal sampling-based motion planning methods,","venue":null,"work_id":"5eee85ba-f05d-4294-8c3c-ff5281a72f9c","year":2021},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:37.062040Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:cd1f6dc1f31707ceb5c3ba53f7d3cea53d31d4e572f7763f39b876c592c31670","observation_id":"7da66530-95fa-4c69-b0bc-502b0a184649","resolution":{"observed_at":"2026-08-05T15:33:44.624309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:33:37.184050Z","title":"Motion planning for robotics: A review for sampling- based planners,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:37.184050Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:e5883b882a828fa29f132c0fff592434d182435e97780f1a61b2fc6b18baf798","observation_id":"50aab2fe-ce54-40fe-b3d0-5a666d785ab6","resolution":{"observed_at":"2026-08-05T15:33:37.184050Z","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:33:44.096094Z","title":"Sampling-based motion planning: A comparative review,","venue":null,"work_id":"844bac8b-6ab0-403b-b9db-6b9f48beb8ab","year":2024},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:37.296859Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:d5cfb48c31da206198a2e08e19f5ea2357b70252a7a268fd9a33c3588a88d938","observation_id":"7ae5efe1-4fea-4203-a581-5b30d4683cbb","resolution":{"observed_at":"2026-08-05T15:33:44.234216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:33:37.379147Z","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.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:37.379147Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:c4f3a2a0b225cc34852e054ed26c575199494c08a30085132c62525b215d00be","observation_id":"b15c8674-30aa-45db-92bc-060a0b3ae319","resolution":{"observed_at":"2026-08-05T15:33:37.379147Z","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:33:37.523664Z","title":"A note on two problems in connexion with graphs,","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:37.523664Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:33a21705622fef6098ed717b8e501cf790eb20290010b741a48c83e0e72ca7f6","observation_id":"4d53922b-ec4f-4e35-bee5-609366433d81","resolution":{"observed_at":"2026-08-05T15:33:37.523664Z","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:33:37.675704Z","title":"A formal basis for the heuristic determination of minimum cost paths,","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:37.675704Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:92e583cbfbd4bb98cbc610dd215e27831bcc15bfef4fed0dc2e10ebc87f1fb79","observation_id":"a3e1671a-b966-42bf-a43b-525aa1fcce96","resolution":{"observed_at":"2026-08-05T15:33:37.675704Z","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:33:37.867934Z","title":"Rapidly-exploring random trees: A new tool for path planning,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:37.867934Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:9baf06f5fd5905abefcefee5d80a5c5dfb4c8ecfa9ee0625fca4af9b1d8d691c","observation_id":"9394d6c6-7f5a-4e89-a471-80b52675ed8e","resolution":{"observed_at":"2026-08-05T15:33:37.867934Z","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:33:38.004884Z","title":"Prob- abilistic roadmaps for path planning in high-dimensional configuration spaces,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:38.004884Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:73f72ff5c2158c0e75c51d85bfb0fc7316a0cbb7515ad49e98e188b308d83826","observation_id":"f6692b58-53ce-4b21-97c3-6f3d05a0bc1e","resolution":{"observed_at":"2026-08-05T15:33:38.004884Z","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:33:43.619838Z","title":"RRT-connect: An efficient approach to single-query path planning,","venue":null,"work_id":"3e4464e8-23be-4ebe-89d3-143294936da9","year":2000},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:38.188329Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:ef4a93ce4c7aad3babf19be96eb978a65fec472d389735c6a472c6734b304478","observation_id":"929dc238-b0ce-4fd2-9cf0-56ffd8da5cc5","resolution":{"observed_at":"2026-08-05T15:33:43.774649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:33:38.346634Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:38.346634Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:c8884d27b991ebd40a60a6ad8c24d21bd4c6b02688a96b89539b32de229e5f1c","observation_id":"5a907995-557a-4c49-bc6b-4f9ccb175547","resolution":{"observed_at":"2026-08-05T15:33:38.346634Z","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:33:38.554137Z","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.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:38.554137Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:2eb6c0c1afd78e50cd2f3e7e216fa7da12836ebbb1af075bc37006d3cfa8364b","observation_id":"85523191-c39c-4920-9f8b-2270d3ac8ad6","resolution":{"observed_at":"2026-08-05T15:33:38.554137Z","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:33:38.699564Z","title":"Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:38.699564Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:ea7902dbe1b2b2b46dccbca9e4fe6d840ea9e3a5362fd7c77bce3d4e83a19777","observation_id":"1223e779-f3b6-42c3-99f3-42e87852e5b9","resolution":{"observed_at":"2026-08-05T15:33:38.699564Z","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:33:38.827869Z","title":"Informed sam- pling for asymptotically optimal path planning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:38.827869Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:1a9f57e4f66cac1444e9fee6bb76ca649c1b9e6b5d04479488fd85db2f5abf7f","observation_id":"01dd8dc9-eba9-433a-bf38-22521eaa7318","resolution":{"observed_at":"2026-08-05T15:33:38.827869Z","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:33:43.197334Z","title":"Batch informed trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs,","venue":null,"work_id":"537e8d48-fb44-4780-b74b-828bb1d127f8","year":2015},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:39.023462Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:605e012e104c3012ef0c9ef78792bfc008d47da494c5501307a10ee519cdbace","observation_id":"8396bffc-c6c0-4aad-a489-9cbe2827c746","resolution":{"observed_at":"2026-08-05T15:33:43.316201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:33:39.233612Z","title":"Batch informed trees (BIT*): Informed asymptotically optimal anytime search,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:39.233612Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:56c90bc5d20047c5f3090a3d917418ebd79bb55626142a02e5ade8dab0a0d04c","observation_id":"9b0f570e-9a5b-4896-890f-81979e7ee4e3","resolution":{"observed_at":"2026-08-05T15:33:39.233612Z","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:33:42.914527Z","title":"Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions,","venue":null,"work_id":"741d7a4b-88ef-4694-9b94-45bc45b91aa2","year":2015},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:39.342015Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:c0ebeada77738868b3bc4ac1851eb17e524071d22abd3660a2b047bd72bbb12b","observation_id":"253670c1-22bd-4f47-a58e-1f872692659c","resolution":{"observed_at":"2026-08-05T15:33:43.055822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:33:39.478880Z","title":"Penrose, Random geometric graphs","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:39.478880Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:77838413a4f2986ac249667f24aac0487324ce6bd5918a2cb94fe248f63e7ae3","observation_id":"ef124b8b-3361-4a23-afdc-6988d42cf620","resolution":{"observed_at":"2026-08-05T15:33:39.478880Z","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:33:42.584248Z","title":"Adaptively informed trees (AIT*) and effort informed trees (EIT*): Asymmetric bidirectional sampling-based path planning,","venue":null,"work_id":"b8860a80-9531-4a7d-99a9-87391e28baeb","year":2022},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:39.610085Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:0d775be9f8f1eb42367a3408ad826c9663bc78e93754420749cd0e9d846d6cdb","observation_id":"13933bcd-3bbf-4190-9d5b-ce061a04dc0a","resolution":{"observed_at":"2026-08-05T15:33:42.772139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:33:42.362817Z","title":"Adaptively informed trees (AIT*): Fast asymptotically optimal path planning through adaptive heuristics,","venue":null,"work_id":"869f1b9c-d6e3-44d1-b2a2-38c44d11b5c9","year":2020},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:39.731585Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:a5fd02154aec90b4b514b694216c9c4d9c115ca06e19a2b411bfc2372ba03000","observation_id":"2482170b-9060-4887-be38-b5e859553a90","resolution":{"observed_at":"2026-08-05T15:33:42.469134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:33:42.173769Z","title":"Flexible informed trees (FIT*): Adaptive batch-size approach in informed sampling-based path planning,","venue":null,"work_id":"064dc132-8e34-435e-add6-7c315e247813","year":2024},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:39.796623Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:736cdfb313a3b7cccdc68eda0c88058710a0628038d9daa80ac78f998bb10fc1","observation_id":"19fea2a1-5132-46da-86c7-25f4568e0970","resolution":{"observed_at":"2026-08-05T15:33:42.265883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2411.17902","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:33:41.091687Z","title":"Nearest-neighbourless asymptotically optimal motion planning with fully connected informed trees (FCIT*),","venue":null,"work_id":"aa965cef-4fc6-42de-aa14-a076b8c1ce0c","year":2024},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:39.988032Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:d3b5ec75023ebe759d69e193ec94ea8c57120bf82e04ad9bdaf46043c80031ba","observation_id":"c5ba85c7-610b-4658-9856-a187c17927e3","resolution":{"observed_at":"2026-08-05T15:33:41.174416Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:33:41.923044Z","title":"Energy-efficient path planning of reconfigurable robots in complex environments,","venue":null,"work_id":"b9c087e0-9844-4015-b185-a0337fba99c5","year":2022},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:40.181080Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:e4c32d27aa93ecdcd11acfca684605028fb6bde17e2a082d064576f4d5364667","observation_id":"b0d09dde-c444-48bc-bfd3-b96b5111426f","resolution":{"observed_at":"2026-08-05T15:33:42.030713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:33:41.706167Z","title":"GuILD: Guided incremental local densification for accelerated sampling-based motion planning,","venue":null,"work_id":"c1a21964-2873-472e-a82f-68979274967a","year":2023},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:40.316559Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:3ff8159247ff8b2614878bad16d57ac72246e3f77424cd07af1950d86db6c7d4","observation_id":"1829cfc8-e868-43a0-a3ae-1b466795e990","resolution":{"observed_at":"2026-08-05T15:33:41.807393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:33:41.496383Z","title":"New perspective on sampling-based motion planning via random geometric graphs,","venue":null,"work_id":"f9eac45b-fd4a-4c3d-84e9-979ccb0243df","year":2018},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:40.425214Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:d664eac48053da87cf3347369e47922a316e78819b2cb5abb1adbe9229214aae","observation_id":"91486001-67eb-4738-822f-e8f0fff5709d","resolution":{"observed_at":"2026-08-05T15:33:41.632420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:33:40.548731Z","title":"Benchmarking motion planning algorithms: An extensible infrastructure for analysis and vi- sualization,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:40.548731Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:d80e4207fa56fd4476fbbf908885567befdf1e6e7823a7140c71c6dfe7c6a9aa","observation_id":"37e1523e-2b06-4604-a9e2-a740a601c516","resolution":{"observed_at":"2026-08-05T15:33:40.548731Z","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:33:41.257569Z","title":"Planner developer tools (PDT): Reproducible experiments and statistical analysis for de- veloping and testing motion planners,","venue":null,"work_id":"803bb7ba-95cb-40e3-a17e-376ff9c42d15","year":2022},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:40.671308Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:1a9e0ca2f4d9accbde0ad4a2415339330db0fe45aad73cdffb962c7bfe536102","observation_id":"9829056c-3e6d-466b-9ebf-728efe50e1a2","resolution":{"observed_at":"2026-08-05T15:33:41.401791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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:33:40.832986Z","title":"Moveit! task construc- tor for task-level motion planning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:40.832986Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:1868f1e6ed2f48dedb6b6b427c4418062f675ca92f8b06c6da6560ddb8b05cbc","observation_id":"d5fa7759-fe3d-4db6-bd96-0ddf946209dc","resolution":{"observed_at":"2026-08-05T15:33:40.832986Z","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:33:40.883486Z","title":"The open motion planning library,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T15:33:40.883486Z"},"links":{"citing_paper":"/paper/2508.19776"},"observation_digest":"sha256:a032b0f4045261aaf6d50abfa11685d532a8a31bf5e6e3d68d3119e377138336","observation_id":"d0d0c9bc-7db6-4b98-ba51-cbfd07d96543","resolution":{"observed_at":"2026-08-05T15:33:40.883486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.19776","last_updated":"2025-08-27T11:00:25Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-05T15:33:33.871259Z","submitted_at":"2025-08-27T11:00:25Z","title":"Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":1,"verified_fuzzy":12},"total_outbound_references":28},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2508.19776."}