{"as_of":"2026-08-04T10:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0312dc759e214f06e6147ebc51ff802865904bbbb004b4f5324659964c2ef745","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T01:01:10.097404Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"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.27625/citation-record","integrity":"/paper/2606.27625/integrity","json":"/paper/2606.27625/citation-record.json","paper":"/paper/2606.27625"},"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:01:10.097404Z","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.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:77b4b9c6a5bc3353d5487ee2abc35daaf8b692fb08f1c3ca9a17c99d45307b5f","observation_id":"6f07a3d7-f2f3-4340-a55c-e138d79f91d7","resolution":{"observed_at":"2026-06-29T01:01:10.097404Z","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:01:10.097404Z","title":"On parallel rrts for multi-robot systems,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:03649df72454a43a506f77d32611bd779b55e9b0be99b5e82122b51e3b87c114","observation_id":"bc438cff-4ef1-4b0a-85a2-11fb2929bb0b","resolution":{"observed_at":"2026-06-29T01:01:10.097404Z","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.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:3eb164ad0f3324c945b9fada76ac3da8b2780b99c32791162b6991b474bdca5c","observation_id":"2ea4b79f-0cf2-4060-9072-c0ca6ced33cb","resolution":{"observed_at":"2026-06-29T01:02:55.057044Z","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:01:10.097404Z","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.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:c47891349a55556c9312da8ee64849c6bb8e46bb0ac32ad1383eca97a497f470","observation_id":"17873c88-e24d-44c1-bcc2-8172b73de7d9","resolution":{"observed_at":"2026-06-29T01:01:10.097404Z","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:01:10.097404Z","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.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:3671c0f48b4e8797fc0f2f42972585d3d831761c245fff7651c6883a1760ca06","observation_id":"d6fc90cd-e65f-4b5f-a234-dc90347842fa","resolution":{"observed_at":"2026-06-29T01:01:10.097404Z","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:01:10.097404Z","title":"Finding a needle in an exponential haystack: Discrete rrt for exploration of implicit roadmaps in multi-robot motion planning,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:f2dd41dd2544fefa8960f511a020112d7ae4753c108ce2e300f51fd79fceff5d","observation_id":"684557ea-9baa-4fee-bdb4-dca8aa7f8eb5","resolution":{"observed_at":"2026-06-29T01:01:10.097404Z","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:01:10.097404Z","title":"drrt*: Scalable and informed asymptotically-optimal multi-robot mo- tion planning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:5a1329b14ad6beee0ac80838f191c60f2e9fddcf22167ba0b8c4241de6d51c8f","observation_id":"39715a15-55ad-4741-a664-41a82fa981d3","resolution":{"observed_at":"2026-06-29T01:01:10.097404Z","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:01:10.097404Z","title":"Subdimensional expansion for multirobot path planning,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:994c7c178b1dc9d292509a3721690448ab993a798565586c87b87f72fa668ea9","observation_id":"dc66ed31-3dd5-4d71-8c67-07ef9b8bf6a9","resolution":{"observed_at":"2026-06-29T01:01:10.097404Z","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:01:10.097404Z","title":"Parallel hierarchical composition conflict-based search for optimal multi-agent pathfind- ing,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:8055db5513d2689a007453c531c7cd329e23dbf8b8db743af5dea110a8847604","observation_id":"afb7c316-063f-471a-abb7-bc459e7d8776","resolution":{"observed_at":"2026-06-29T01:01:10.097404Z","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:01:10.097404Z","title":"Conflict-based search for optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:4d254b365a0ab62d8a40d1721e6ef6c10652fdb7ee5ddd65eef18bdcba1325f9","observation_id":"a46e9854-2acc-4d3f-a483-031b45e84f26","resolution":{"observed_at":"2026-06-29T01:01:10.097404Z","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:01:10.097404Z","title":"Covering complete graphs by cliques,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:856f3fa766112c54c9687f1322373d0f3dae6a44b49a7deb6817776975d92a64","observation_id":"c532e2e3-e571-4bfe-890f-e1e3c707c9d8","resolution":{"observed_at":"2026-06-29T01:01:10.097404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.23960","last_updated":"2026-04-27T02:07:14Z","snapshot_observed_at":"2026-08-03T04:39:06.397645Z","submitted_at":"2026-04-27T02:07:14Z","title":"Multi-Robot Motions in Milliseconds: Vector-Accelerated Primitives for Sampling-Based Planning","version":1},"cited_work":{"arxiv_id":"2604.23960","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.23960","snapshot_observed_at":"2026-06-29T01:02:55.635348Z","title":"Multi-Robot Motions in Milliseconds: Vector-Accelerated Primitives for Sampling-Based Planning","venue":"cs.RO","work_id":"1686894d-99fe-4a5f-908c-4e702098d5c1","year":2026},"citing_paper":{"arxiv_id":"2606.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"cited_paper":"/paper/2604.23960","citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:047ea4ab4b96854de4a80192977c827b9814b19d4f809f0b20ccd843f1d48e60","observation_id":"148e3c3f-3217-44b3-9605-fcabe8f659a3","resolution":{"observed_at":"2026-06-29T01:02:55.636736Z","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:01:10.097404Z","title":"St-rrt*: Asymptotically-optimal bidirectional motion planning through space- time,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:42b12d03648f5458c55604eee1c11923d53982e23879db40beef7a28cf0efe92","observation_id":"cc00e8b1-5da0-446c-bcb4-1d2480656fbe","resolution":{"observed_at":"2026-06-29T01:01:10.097404Z","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:01:10.097404Z","title":"Motions in mi- croseconds via vectorized sampling-based planning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.27625","last_updated":"2026-06-26T00:48:23Z","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T01:01:10.097404Z"},"links":{"citing_paper":"/paper/2606.27625"},"observation_digest":"sha256:492003b9d321963e5b74e74644bbcfb3663a60e4232ad154d52dc5002cd09029","observation_id":"12f8e8cb-ae4b-417e-b6bf-a96e940efb63","resolution":{"observed_at":"2026-06-29T01:01:10.097404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.27625","last_updated":"2026-06-26T00:48:23Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-03T13:43:48.549905Z","submitted_at":"2026-06-26T00:48:23Z","title":"P-ARC: Exploiting Subproblem Independence for Parallel Multi-Robot Motion Planning"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":14},"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 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2606.27625."}