{"as_of":"2026-08-04T19:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:50b355c51c788bc878253df9b3e9b2e1edb2ec8e057a7d4b7da03c62ddeb7638","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T01:50:43.992888Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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.27495/citation-record","integrity":"/paper/2606.27495/integrity","json":"/paper/2606.27495/citation-record.json","paper":"/paper/2606.27495"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T01:50:43.992888Z","title":"Asymptotically optimal planning by feasible kinodynamic planning in a state–cost space,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:fd346884646cb770cd2afcfcba5c04e2bb9172741d94c9acc2ca2a2fafbec752","observation_id":"f4cdd4d2-f907-4372-a023-204311e81112","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","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-29T01:50:43.992888Z","title":"Aor- rtc: Almost-surely asymptotically optimal planning with rrt-connect,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:786dd3c05a1c317a7faa4033f2ad1f9f8ac4d9ab795f82cc352a548188083696","observation_id":"bba8bafe-1b9c-40f1-aa42-bab9bcb996fd","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","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-29T01:50:43.992888Z","title":"Adaptive robot coordination: A subproblem-based approach for hybrid multi- robot motion planning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:6f0a995c8aeadcc360f8c0c1f7af959c6cda41a626d2a42e7515b71e65522e76","observation_id":"cc7f7097-cbe4-41a6-b961-cc6c38eed277","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","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-29T01:50:43.992888Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:4f5ae59915b2f7fc61ea0502685e1e686fe0ad7312fcff721028151311e880a3","observation_id":"23c8e6f0-576a-4f70-96ca-4eb223bf2ee4","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","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-29T01:50:43.992888Z","title":"Batch informed trees (bit*): Informed asymptotically optimal anytime search,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:eed409a67ea48cf20ad46982b75733a07e88be1163de5d001d774289faa28833","observation_id":"19b584c1-ea5a-4338-89ee-1d9a1420810d","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","resolver_source":null,"status":"malformed_identifier"},"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-29T01:50:43.992888Z","title":"Nearest-neighbourless asymptotically optimal motion plan- ning with fully connected informed trees (fcit*),","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:bf4dff3ceb40396ca7a06b7ed43a5dcdaa3c5fb0dd8dd261e120df03aa51a672","observation_id":"55267fa3-3d30-4744-8bfd-9f8f6a863164","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","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-29T01:50:43.992888Z","title":"Using a prm planner to compare centralized and decoupled planning for multi-robot systems,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:3f4dadac39d0321df94cc9b2491582eb892e66c47c5d79ba3a068c9412fb6ec1","observation_id":"1f83fa24-a81b-4370-a255-d04bf562c257","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","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-29T01:50:43.992888Z","title":"drrt*: Scalable and informed asymptotically-optimal multi-robot mo- tion planning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:82eae83afa02e7883db76e7554ab0ca96a41911bf09c23a75803e1800acf0e41","observation_id":"11a3f713-516e-48b3-899d-c31738b71979","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","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.1109/iros","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T15:48:34.690559Z","title":"Li, 3d fully convolutional network for vehicle de- tection in point cloud, in: 2017 IEEE/RSJ Interna- tional Conference on Intelligent Robots and Systems (IROS), 2017, pp","venue":null,"work_id":"2060d144-df60-492a-b86e-726a41433d6d","year":2017},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:64834537693183cc19c2c9a2d8066406ae457b33f3238b81f9bb3510c13208ec","observation_id":"b03f9d23-0bf2-4fa1-9e6e-9031ab15b63b","resolution":{"observed_at":"2026-06-29T01:52:58.972782Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-29T01:50:43.992888Z","title":"Si-rrt and st-rrt* for prioritized multi-manipulator planning: Empirical evaluation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:990c85412a4fb750839365ab20d130e68a1352c35a0bbe51f8922412dbe6b383","observation_id":"9287834b-ffae-4d9d-a9a2-8aa6750da8ff","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","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-29T01:50:43.992888Z","title":"Subdimensional expansion for multirobot path planning,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:efa28b1c7ffe5b153f87030c9b0dcc3e12937a44f3b36e07229d0823ef97ea2b","observation_id":"110b42cd-a839-4d91-9bc9-182ca1b78cd9","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","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-29T01:50:43.992888Z","title":"Representation- optimal multi-robot motion planning using conflict-based search,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:2ab5157af89a1249b8a184caf705b543e9decf3b1755facc79d7873d56c86183","observation_id":"4c96d98d-ad58-49fe-a970-c16d6df82072","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.03509","last_updated":"2026-04-17T11:31:45Z","snapshot_observed_at":"2026-07-06T20:47:14.977471Z","submitted_at":"2025-03-05T13:57:05Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","version":3},"cited_work":{"arxiv_id":"2503.03509","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.03509","snapshot_observed_at":"2026-07-01T18:35:59.119100Z","title":"Sampling-Based Multi-Modal Multi-Robot Multi-Goal Path Planning","venue":"cs.RO","work_id":"1da26931-c73a-4c52-85df-db02b4a6743c","year":2025},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"cited_paper":"/paper/2503.03509","citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:b048b3bfd8e32391c24b872465a048a40bd6242914478bd2505fb0ea20329d0f","observation_id":"09b4d657-f17a-43f8-b273-4598d7e8094f","resolution":{"observed_at":"2026-07-01T18:35:59.120492Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-29T01:50:43.992888Z","title":"St-rrt*: Asymptotically-optimal bidirectional motion planning through space- time,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:18409804a8405a4f4a87caca99e1bed3ee2b76184d8591b722a45746912d0548","observation_id":"6552b07e-2ec9-4bf7-9f67-768999b481c7","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","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-29T01:50:43.992888Z","title":"K-arc: Adaptive robot coordination for multi-robot kinodynamic planning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T01:50:43.992888Z"},"links":{"citing_paper":"/paper/2606.27495"},"observation_digest":"sha256:969c05cc8789a63541c6509f65dd3df0d404015624c0d0e47b01b40b35fa8792","observation_id":"059e64f2-0a89-4d25-baaf-327c6e77a69e","resolution":{"observed_at":"2026-06-29T01:50:43.992888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.27495","last_updated":"2026-06-25T19:20:26Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-03T21:16:24.051645Z","submitted_at":"2026-06-25T19:20:26Z","title":"AO-ARC: Almost-Surely Asymptotically Optimal Multi-Robot Motion Planning with ARC"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":15},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2606.27495."}