{"as_of":"2026-08-21T18:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fcc83eb1c4d739a327279866d0d9a093d0037c18975d9b8514070739ddbed081","coverage":[{"denominator":221,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T01:00:37.408559Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2606.06686/citation-record","integrity":"/paper/2606.06686/integrity","json":"/paper/2606.06686/citation-record.json","paper":"/paper/2606.06686"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T01:00:37.408559Z","title":"AAAI Conference on Artificial Intelligence (AAAI) , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:2b85f944dc8862685e0479ac35e424b36b81ed3de21f42c11adaecd7938d64b7","observation_id":"707199ca-dda1-471f-b8fd-9db3038e46d8","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:7e3989381ed46cdf2be8b21fa906d9b4f352cab726b02b9fb39552236183f15b","observation_id":"fab0503c-0566-4494-bf2e-89e87ef9f4ba","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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":"10.1609/socs.v17i1.31540","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Introducing Delays in Multi Agent Path Finding , booktitle =","venue":"Proceedings of the International Symposium on Combinatorial Search","work_id":"83b8ce60-5f49-44a2-8096-b3effe062ccf","year":2024},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:541a166b1160c27f1f35eacee970011853d59f75f00eb4ac5f8d73e86e2a2ac2","observation_id":"c159a1d4-bcc8-4c68-9397-bf4c4580a066","resolution":{"observed_at":"2026-06-28T01:01:26.604679Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-28T01:00:37.408559Z","title":"Schweller and Tim Wylie , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:c912d65644cfefbbcd603387a5de743fa766119e7eab8d466371fa0aefa17dce","observation_id":"2ab05f5f-56ff-4c0f-891f-bb91e1d391a3","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Wilson and Lydia E","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:ad474995bfec0a35404b2b6f2dab27084c296bd47822020a556f620910a57e66","observation_id":"251a73a9-cd0b-4a21-bc2f-8df802369170","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:be9c5723d2418b12b82bd5a052e73fbfbf3328bdbee96857e6ac333623b21645","observation_id":"c29c0a5f-d3fc-4cf2-92b0-3394ea2fecd2","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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":"5946.359873","doi":"10.5555/3545946.3598731","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"In: Agmon, N., An, B., Ricci, A., Yeoh, W","venue":null,"work_id":"60dab348-b528-424a-927b-12c7f3cebea6","year":2023},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:98c51f13842a7202db1eea7863ae764b99c7a1eb36ae55502e46c2a49b0b7afc","observation_id":"ed19d015-bd93-4f54-97c2-f5917d354bfd","resolution":{"observed_at":"2026-06-28T01:01:26.609718Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:bfeced999b2d1c20d447b1c0040a8acedec2e2e4406dae9824dafb5c226e3c3e","observation_id":"74f8d0fd-cb61-49b2-8263-f71bf73b3ce2","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/socs.v16i1.27279","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fine-Grained Complexity Analysis of Multi-Agent Path Finding on","venue":"Proceedings of the International Symposium on Combinatorial Search","work_id":"c6dee646-4efd-4b0d-b15c-c4d62e3e3c2b","year":2023},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:9b895419cd8165b7b87e94609e31f9e30ee950b86744294d46ebde321f906a02","observation_id":"f35d7ab2-1dcd-4a56-a981-eba985306fe4","resolution":{"observed_at":"2026-06-28T01:01:26.616958Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-28T01:00:37.408559Z","title":"2024 , note =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:32e046b651a968f1b5434197bc9d22872c15a9322b4461be86beee4ff4afb7e4","observation_id":"48d82bad-b2c2-4507-a2d5-36e1ae9c8cd1","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"International Workshop on the Algorithmic Foundations of Robotics (WAFR) , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:fec3a1376c10916bf235ab5f30d1254f0efef1489164e86bfc24ffd995b4a7a7","observation_id":"457e5ae0-29a5-4470-90c5-9299a4ea0987","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:21ad35f0268e0e5dda013fbc1e2bd16418c974b7b81a67ffa9a3c4d13984d377","observation_id":"2b304843-9a54-4718-a10c-76bce9e1ce36","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:557616c6ab18a278d9d05e252f4624abe5b52bcdf806704197bc6e91f874505e","observation_id":"614e2cda-2488-4f83-b94e-291565402310","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Agarwal and Tzvika Geft and Dan Halperin and Erin Taylor , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:4afab84cb022da82bf1e6dc8b1fe11a4eb34b69608a6ac7be4dd1c9451a90d8e","observation_id":"04344811-6349-49ee-8c2f-b54ad864bf28","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Agarwal and Tzvika Geft and Dan Halperin and Erin Taylor , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:e1ae9c0c5f78dc11a441f0c1085e4455a6a450054d194ae6f4de84ab2e3f3ad9","observation_id":"dab4a7a7-ffeb-4a59-af7c-5d36c625b113","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Agarwal and Boris Aronov and Tzvika Geft and Dan Halperin , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:8924f57b6634e36739c686d00bbcc075eef43514d8b242fd06ae188176fce927","observation_id":"ac370af9-7474-4772-b46d-43ee7520fef7","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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":"10.1137/1.9781611976465.105","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Agarwal and Boris Aronov and Tzvika Geft and Dan Halperin , editor =","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"32a67585-2895-4233-be55-145f6db22168","year":2021},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:97103362abdf038c375ebcac69509990ac25fe1d65ba7f5723cab6076aac0e59","observation_id":"2a2b7f62-5332-486f-a22d-ba783c196eca","resolution":{"observed_at":"2026-06-28T01:01:26.607239Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:ea7f6b294ddb6288d2934983d8098650bdbedf5a57941f53f5186cd79c80ace1","observation_id":"4c2347a3-0bd2-4069-91c5-e9abb996ccc3","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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":"5850.353590","doi":"10.5555/3535850.3535905","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Refined Hardness of Distance-Optimal Multi-Agent Path Finding , booktitle =","venue":null,"work_id":"48ac922b-31be-44d0-9cf7-f8edd2b39313","year":2022},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:bc5e840af0708f4b61564497fd49ffe6ee6a6c6bcee94689349b12dc588b66c8","observation_id":"97852d25-ee1c-4f03-b32a-20f99bb53619","resolution":{"observed_at":"2026-06-28T01:01:26.596599Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-28T01:00:37.408559Z","title":"2021 , note =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:f23cb4d5c97525143e43a9ce4fe47ef05d51e93f54e087e9ff767792c9e54c09","observation_id":"1f6207cf-5585-468b-8244-5502f695c672","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"2023 , note =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:9401a50e452f3ef3b6b3e68860929f84c4ce68ee14ef6059708667117e430538","observation_id":"93c154c5-19a1-4bbe-965e-7bdd68f3685e","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Agarwal and Mark de Berg and Benjamin Holmgren and Alex Steiger and Martijn Struijs , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:ff91db1fee951bbb47a950ebbcddafa4bdedce3e35ccd25b8bcdba4448fb5b00","observation_id":"d99cc84d-1165-4930-ba67-e6130eb7b1cb","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:b9e1c5151e4937628b1c27fbb4e257388e92a609a4c94bc3435389a51924fced","observation_id":"3cf52393-eafa-4980-bf54-924d7c22c5a1","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"and Schwartz, Jacob Theodore and Sharir, Micha , journal=","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:d059f9c2117bccb8d76c95d3a2bb30dea1858ab59e6e24963af14014b3f2ebd7","observation_id":"8aabe3f4-4c2c-4c83-843d-e3ad2b3a13a6","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Spirakis and Chee","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:abda12b9ed6e88b02bbdc25a2cefaf105e28c85015c2673197f3be1ed081f391","observation_id":"51147ba6-b69a-4f9c-b6a1-3d8386251783","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Hearn and Erik D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:125da7b3e2c201ca54de4e30e516dddc6ca8395bdbb5c96843883808cefec35e","observation_id":"821ce1a2-e873-4ca2-bd23-fb0140c5ba38","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Wessel van der Heijden and Irina Kostitsyna and Lloyd E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:e0acc5453c5928430f8616ade0c497ef8aa521c147fe1d3106b055a0b2246a53","observation_id":"f84365a5-caf3-4371-a5ca-1af3f503a800","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Reconfigurations in Graphs and Grids , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:ff0c1034ac839ed6729c91c5d120fd43d134ca15d091c7572b42e33c8cb08215","observation_id":"5e706786-e88c-4a85-bd8f-456488733c29","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Mouawad and Naomi Nishimura , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:d9b16d6bb63971c347995de8f7b4146018cafcdfe99e66a839724f7c59b9b612","observation_id":"380ecb36-4616-42b9-baa7-d540db9fdadd","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:067f0c2b63ae2c0a95ca97a8044286774d75743e713ea4bbef1d9e231d84b84b","observation_id":"f990beaf-ff63-40df-8c21-b84d96438000","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"2015 , publisher=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:1930246dd906de996b0836166f99993ed13c28dad1468d3f5b68443d715413dd","observation_id":"b1d51c9d-b4cc-4c61-a48b-e963e4b736e0","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:593f29a7a103d9dc17a2f89965190fdab65ad2b67250d59c1e99c8756fcc8a3f","observation_id":"321472d2-855f-467d-88c8-a91011f22380","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Bodlaender , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:c1f2ce26b9909f5bc15ddf05b428cdfca54c90aaa3a0615a54838c0d7ac4864e","observation_id":"90732540-630e-4c1e-bd2b-570b4b681f0e","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"SoCG , series =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:506c2a4d970d70f90506e00e10d7c2303c76051a0fa03376bf6e201252babdca","observation_id":"6d248d5d-9a24-429a-9b47-bc9e5809320b","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:62f7ad29c99240dc1b9b93d55eb5cac57243449cf41cb9c7e3e1d9db47970fae","observation_id":"4301b48b-7b71-41b5-9b8c-786d9d2efb14","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"International Conference on Fun with Algorithms , pages=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:f260c6852bab55bd57c102ac3d789eba10d827a412817f9a0ea45fd9024721d6","observation_id":"e76ee42d-40fa-41a5-a25e-f4119306fc7e","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Demaine and Alan Guo and Giovanni Viglietta , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:58562b01e8e8f3a4353f579ca62ca064c96099f6dc6343606f63bc31f1aaa1ad","observation_id":"95dc8b38-1883-44d2-97bf-0865894d3894","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:4a9669bf42dbedd7d31a5687ef577cb3e38c4b868dc5cf8340f583afbbc9c3af","observation_id":"20dda126-499e-46a2-8f97-311381b70d3e","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"2020 , school=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:0a2cfd904df08400cd51488c33e47396a71913693790c705ea7421142a9ec0d6","observation_id":"80477824-2227-4a92-8444-50959730af44","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Coulombe and Erik D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:c40afd37a33c11f5d261dac073d5e237d98df5ed821ad319d50b0fe90bb946a1","observation_id":"5b903b63-71d8-4779-af9d-070aa2477a9b","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Wilfong , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:eee154b2d2a203a3a15de4e314e4195c45e1ad5dd4529d2de7809018533269af","observation_id":"aaafe4b5-1906-4560-b757-88f4aea20626","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:7f804762b7af662e4d9a9d8d401a3652d402f0df3828a61496503d0cbf57e73a","observation_id":"dc3aae65-7dd0-49d2-8284-1ba163bd0581","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:35188accc85ac0b077324f88e06fb23518acc4444f01382cced272fc3b01b6e7","observation_id":"7bc3c903-f377-4f1a-90a7-3116b8c9cb74","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","resolver_source":null,"status":"parse_uncertain"},"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-06-28T01:00:37.408559Z","title":"Demaine and S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:e89e648992c68f629acb08fbb7f817880797b2fb80224b329550d28ce17fbded","observation_id":"6241d42d-66b7-4de5-8584-707f70aa2a7a","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:b1b0419ec4aa9d09ff782e8350783b508cc65690f8e041accc3c1a995e296b5c","observation_id":"93ca0ac1-7ee6-479d-aacf-6d1d9fef8add","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Tovey and Guni Sharon and T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:f3194bd4e8ff551717ba955e3f2b61681a3667b4af06342ce49e051de7374a3e","observation_id":"e69a76b5-a9f9-4701-9feb-bdb8050d3d9a","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:42ce2f221dbb82a7f8a2b2e985969607d2186332aec177fde66261dbf5f1efcf","observation_id":"cc12b969-977b-40cc-a6a5-9a088feabb28","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:38b103802bb24c2ff28507ae9c74ca9172c7a252e59b5a398bacc09e0997913e","observation_id":"0d3d0de9-ef3c-4343-a8d7-9c439ad5ccc3","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Lower bounds based on the Exponential Time Hypothesis , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:46645f648edeb5d7991f359d6b0f7651f0dd787fae3bbe4059e39fc39060f7ba","observation_id":"5031645d-8a55-489d-aacc-cd6e3fcc82b8","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Kanj and Stefan Szeider , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:ecf9aae101c34e47fa21fba7b966e5903e28daf73361c688d0dae05b89298583","observation_id":"fc659793-d89c-4250-8e83-304034d3c4ab","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"1982 , timestamp =","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:fc3d25ef8d89504e394f2a4235a8cfcd7c626fe993b8931a63732e81a9839dcc","observation_id":"4a3ac76d-c61b-4acb-bf91-897469e90c46","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Knuth and Arvind Raghunathan , title =","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:b5ecf2971c7feb7961e4612f46a308388dd98e0b7958dc7ca46c526331e02ee3","observation_id":"f0d064c7-a439-4536-b33c-7611e080b88f","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:d9e4fc3f784f0fb11b7d5a364f787f3502a774e3db134b1d9d598820fa9d6119","observation_id":"dacc46ca-19d3-4d57-a0eb-da9ffbca470c","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Time and Space Bounds for Planning , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:8361738988089cdeb76f3ae96bc42232e4c022e354db0bb5a23278f5e8de99f1","observation_id":"33bdf68b-715c-4d1b-b6a2-ee5b59610475","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Machines , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:2182b2e7a5d98746f85500f60bb0082102dac65e6ac196b2de53d807ede6c16b","observation_id":"bdc6c98a-0796-4d64-b32f-d64b464e7de8","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Kanj and Andrew Youngdahl , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:a0118366df95b5586a8bc2171c123597a468dc6f5c83f62c4270b4371a64557e","observation_id":"7fa97710-1897-4d5a-9d95-bc14bf893c5f","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Refining complexity analyses in planning by exploiting the exponential time hypothesis , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:b59dd225df0f71556774599a81ad7fa9fc621a19f5e3ae0431fe50271fa7de7b","observation_id":"a08ee059-9a4c-46a8-bff8-b0aa735751de","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:44eebce5d79c85715f50c2bf88ac4d6cab77476667e0e9b3dc1751459cfeb864","observation_id":"70f25fd0-aa61-419e-aabb-b9ad2117000f","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Workshop on the Algorithmic Foundations of Robotics,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:74b5039f1b751957dda6ed3397ee594d5847f0169740445e364dce856d951a0d","observation_id":"9492b7e4-0bbc-4ff8-b5f5-6a441449581a","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Miller and Paul G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:4b9d04d3270490684df70272eed52daa81a8ce68d5a576e9d7a832fbba60b319","observation_id":"504427a5-5b5e-49d1-ad35-129ada862f7f","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:2a5b215cfcd9e8efdfd6982a4b4e508dc9f62360e6f11f7dea6438c1f5826ff5","observation_id":"81a96515-05d3-4e25-8881-04d88b8dd173","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"American Journal of Mathematics , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:03596d26a87727241588201fcfbeb755ffad61de9e4f9571f1693e4066d76df5","observation_id":"7ba304a6-ede0-43a4-bf01-8eda33aeb4ff","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Journal of Combinatorial Theory, Series B , volume=","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:055bc3cf6692f6c9ff1c1e63f28bd22e5e0bbc9c274eab73a260823ec8eaec5f","observation_id":"8db3ddef-6a96-49f1-8e50-812fbea888d2","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"LaValle , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:a532b7eeed305c5ceb8790647f274a815249c931fdd6a94cea3a50aaca4c21bf","observation_id":"4abfa0bb-527b-4db1-a2b7-8d116a17d73c","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Yakovlev , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:9a79f371e6763c2adc7648c70a299f9746a9d373360c9061d5434716b2f11599","observation_id":"c03d5155-ffbf-4814-aa85-be53262a5a77","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:0e8443b8a03c3e1fa0e75a4986f81ddf0173d33887766a5a6a116aff03b82d4f","observation_id":"dcaa1e27-e8ea-4113-baa6-415b21fd99a4","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Solving simultaneous target assignment and path planning efficiently with time-independent execution , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:28a3ef14f2019a895659079a8abe53b49c8ea2f9efcc1ba41e8c752a3d230324","observation_id":"529ca438-010c-43f5-ac8f-c3490cd2d5ec","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Yakovlev , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:f681b4ae88a918f278bb8daa0154cbb488406eb91eb0a9c74bf10d7157317647","observation_id":"adf1989d-5e6f-43ff-a43b-8473209d6bae","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:c8ed0cee5bb83f53a56049717aa75ef42d21368bfcc1bef506e06456327f4b6b","observation_id":"d063032b-bb0d-4918-8997-a92589d5df72","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Sturtevant and Glenn Wagner and Pavel Surynek , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:681a15c18c3fec007b189392d96efe5cfe2224c112a5e6220d9afcbf01490eca","observation_id":"56d42dcd-9e2d-4111-a860-76a4ea1e9579","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Sturtevant and Ariel Felner and Sven Koenig and Hang Ma and Thayne T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:1e176d5df1f16f5b3d01e74b9efdf1e1564efb6e185d587e436c37d9fd098a42","observation_id":"070b584b-5d56-4ce9-96e2-5ec6f7fe41ce","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Studies in Complexity and Cryptography , series =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:32693941937910c67f1f48d8205ff00ff631c408089252fdff7e04055d7be8b7","observation_id":"e160a1ea-d992-4fd6-a104-396d46c51b3c","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:d55a76fa6c27dae377bb7c00687484d747a0ac490276d04c0c1f0572ddb940a6","observation_id":"bf87ef14-05bc-45fd-9bea-9f6c329a9650","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","resolver_source":null,"status":"parse_uncertain"},"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-06-28T01:00:37.408559Z","title":"Journal of Symbolic Computation , volume=","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:3add41b4b997428ece109eef37c84c52ccd38d116ba5d00ec4dd89b6b9e7449e","observation_id":"a321a6ad-beaf-4025-8795-f21b6f1ba66e","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Demaine and Mikhail Rudoy , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:b93a63c42e0637cddf2e3e831ee187957402c1f0ea008d3fe5010c99b58e61ac","observation_id":"9673b380-8daf-46e3-8a01-02b29ec8bcdc","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:a1b6c4cae17fc9e144d9e30af7038e77a7376c46b7c5807af3b4ffd19a3232cc","observation_id":"29ce33f2-0399-4347-80d5-6e9ecf1a5257","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","resolver_source":null,"status":"parse_uncertain"},"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-06-28T01:00:37.408559Z","title":"SoCG , series =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:741e396edb0085377eb8511c007334ee2acf5bbf52036e1606d276a18127a432","observation_id":"632c9ecb-9fc9-456c-9af5-6160d8c86701","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:4f36fd2609984605a9d19020ed53c4a35dc16ccc315f99238541ca79ae452d6b","observation_id":"b956e01b-debf-452a-84ed-95488ce4d5e7","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:2e41a6ade5334335d291a6acd42a556fb51a5b8aff18626707250cf5b5188ad3","observation_id":"cc585977-e50a-4c98-94b3-ee0516ce941d","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","resolver_source":null,"status":"parse_uncertain"},"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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:7766bb34f1c96df6212cbdb10e7eb46aa44d80913efeb0b04d1ea222b5b467e2","observation_id":"e6f47c3a-ed78-47fb-a8e1-fae2efe4928f","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Mover problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:a0f05d461e0081cb44ba38862c7bd544e75b30dfefb9526b8b7c77f5a1ca0eb3","observation_id":"b841d913-3fb5-400d-9c81-b15415615a5d","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Sliding Disks in the Plane , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:b637d90acf0482e8ee6f6846eb5921794490344b159141d11315c7a3e26b1d8b","observation_id":"ef99a1fe-2571-4cbf-8341-8f30698d7c1a","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"van Kreveld and Golan Miglioli","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:ca29187ba5878d5181f2bc9f8401401e8a5fda91277bb5ddca7fe0ce1be8fbd5","observation_id":"5ea1a14e-d21d-43a6-b67e-3b74c7821bd3","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Moving coins , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:f76fc3a6d31c094dd17e638c6c8999ac957294de32b29855bd66ba5cb59d21c9","observation_id":"684ad045-9573-46c7-a0cc-a9c7b7d92923","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Buckley , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:9f8587d546f5ce670cdeb7872825cd0aa00035da044c60299d022c6b5a0e9d2e","observation_id":"381cc982-9c8c-4f30-9ac9-32a96d01d144","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Clarkson and Peter W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:4b2eea4973d8958e72ce97144e67827b3204d50de3fd585c39b9496fbfe5d1a7","observation_id":"a7c257d8-8dad-4d3c-9067-401473869e32","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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":"10.1007/978-3-642-17283-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2012 , url =","venue":"Geometry and computing","work_id":"090bd418-8839-428e-aa54-7f74b449d041","year":2012},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:24eb3614f98076e96cabea8131502f94e86cf2d2c161ffc43fac81d1da0d1b0e","observation_id":"a145e9cb-30e8-46c5-84f4-485afcf755f7","resolution":{"observed_at":"2026-06-28T01:01:26.601993Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-28T01:00:37.408559Z","title":"Lin and Dinesh Manocha , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:a37af334d951054ff22c94064d38090427635a4639e1897918eef16474769c88","observation_id":"03264f9e-a5d6-4879-bdaf-40d906b06ae1","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:e2f3f0608a8a33c206815c152aa953be844137f00add3d982690dc45433ba075","observation_id":"d59c5576-8110-45ae-9eb5-f0e8657b968b","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:d6a6bdc975a72cb9123f6f5f8fa90e2a71ca53f297f9804a98f99356d20c779e","observation_id":"3610cce7-6263-4016-b8e9-dca29b1c6f4b","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:e9efe6925e68b935807ca77a0fa06a9298fd71f113d2dfe2b9765a1b515a4c15","observation_id":"52520338-2f5d-41be-9797-33e561679abd","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:4775ca387ad2f5fe7bf88b4c198e1937ea4017b437cf6df935fc3953a34a4ab0","observation_id":"f76218e4-9da9-43be-b064-a6eb8ce3c1d2","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Workshop on the Algorithmic Foundations of Robotics,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:3dbde78f7371ee812eca7f7f433175f3587bbd1d1a0b54bd0ef66804a1635116","observation_id":"8f0e1e79-5e04-4b36-8783-59ac58340ce9","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Robotics: Science and Systems , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:f3938e011208ea0fb22ccd4215fac748bcb30a629479ae6df05f93698d855e1a","observation_id":"b1ef0e1a-4605-48cf-aa87-a3b45d7a53fc","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Han and Jingjin Yu , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:2c8c0095d827be8346f677e746a941f41e0dc4a7ae64e8bd664ed6dc19b5991d","observation_id":"d0e1b287-e1d6-4be1-906f-c543ab8c4536","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":"Tang and Vijay Kumar , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:b8d78f29e53d30262707c650967d900a78c598418a6ac8b0f93ccca419368ef4","observation_id":"e3de53d2-3899-4833-82b5-4a8014ab3954","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:e53e136afbcfc20e4f221e551f41080cb703590c22203629ca17236d7a7590cf","observation_id":"8d1c6ce3-1348-41e3-a23a-37330689a6c1","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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-06-28T01:00:37.408559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:b4da0989d554be838e54637ce5ae2372916d6e2bbf98dad021ec42ee8075b08a","observation_id":"e08af9f6-55c7-40ef-af1c-64ce09b47085","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","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":"10.1007/bf01840371","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computing euclidean maxi- mum spanning trees.Algorithmica, 5(3):407–419, 1990.doi:10.1007/BF01840371","venue":"Algorithmica","work_id":"72264afa-7a9d-4651-8557-2365b22813fe","year":1987},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:ab6023684c0d731b8086923383ba46c074c8c77cd537e20adde25589bb59398b","observation_id":"5a7a07d2-dbc3-4428-9574-dcbed1e75258","resolution":{"observed_at":"2026-06-28T01:01:26.614624Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-28T01:00:37.408559Z","title":"van den Berg and Mark H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-06-28T01:00:37.408559Z"},"links":{"citing_paper":"/paper/2606.06686"},"observation_digest":"sha256:b6c834d3d32c60b6f5d81fd76838a9319d8e2262f89ace2893bdc96b52a217fb","observation_id":"9d5b0035-c6e2-481f-aa17-c565663a3c89","resolution":{"observed_at":"2026-06-28T01:00:37.408559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.06686","last_updated":"2026-06-04T20:00:05Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-14T22:46:20.873233Z","submitted_at":"2026-06-04T20:00:05Z","title":"On the Hardness of Optimal Motion on Trees"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":5,"unresolved":88,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":221},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 100 of 221 outbound references and 0 inbound Pith citation observations for arXiv:2606.06686."}