{"as_of":"2026-08-09T09:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1eb612a21cc1db26aff6bc691a94aa0a0f04927fd870a13610f4981ec707f129","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:30:47.976094Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-10T06:15:00.866473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.19543","last_updated":"2024-09-29T04:01:29Z","snapshot_observed_at":"2026-07-06T19:23:58.763033Z","submitted_at":"2024-09-29T04:01:29Z","title":"Multi-Query Shortest-Path Problem in Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.19543","snapshot_observed_at":"2026-08-06T17:30:47.976094Z","title":"Multi-query shortest-path problem in graphs of convex sets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.10878","last_updated":"2025-07-15T00:42:02Z","snapshot_observed_at":"2026-08-06T17:20:19.942689Z","submitted_at":"2025-07-15T00:42:02Z","title":"Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T17:30:47.976094Z"},"links":{"cited_paper":"/paper/2409.19543","citing_paper":"/paper/2507.10878"},"observation_digest":"sha256:de80b76cede02db0aa5345c33d228f3331302f461c920656dbb985d8b2c62895","observation_id":"f9d04de3-1f13-40d3-9f7c-aaf6277d1533","resolution":{"observed_at":"2026-08-06T17:30:47.976094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19543","last_updated":"2024-09-29T04:01:29Z","snapshot_observed_at":"2026-07-06T19:23:58.763033Z","submitted_at":"2024-09-29T04:01:29Z","title":"Multi-Query Shortest-Path Problem in Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":"2409.19543","doi":"10.48550/arxiv.2409.19543","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.19543","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv preprint arXiv:2409.19543 , year=","venue":null,"work_id":"0cec897d-38cc-4843-9a04-0e8ebdc6dbe8","year":2024},"citing_paper":{"arxiv_id":"2606.00842","last_updated":"2026-05-30T18:32:39Z","snapshot_observed_at":"2026-08-06T19:48:46.479242Z","submitted_at":"2026-05-30T18:32:39Z","title":"A Framework for Motion Planning with Temporal Logic Precedence Specifications via Augmented Graphs of Convex Sets","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T18:13:52.404253Z"},"links":{"cited_paper":"/paper/2409.19543","citing_paper":"/paper/2606.00842"},"observation_digest":"sha256:4b36ef5aa96883052af2cdb3a9926f82a917b8e273b906c283077bb5c39def61","observation_id":"626e0c9b-9279-4809-a2ab-11f2efb687e7","resolution":{"observed_at":"2026-07-01T20:36:12.401484Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19543","last_updated":"2024-09-29T04:01:29Z","snapshot_observed_at":"2026-07-06T19:23:58.763033Z","submitted_at":"2024-09-29T04:01:29Z","title":"Multi-Query Shortest-Path Problem in Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":"2409.19543","doi":"10.48550/arxiv.2409.19543","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.19543","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv preprint arXiv:2409.19543 , year=","venue":null,"work_id":"0cec897d-38cc-4843-9a04-0e8ebdc6dbe8","year":2024},"citing_paper":{"arxiv_id":"2606.18516","last_updated":"2026-06-16T22:14:15Z","snapshot_observed_at":"2026-08-08T07:26:09.910488Z","submitted_at":"2026-06-16T22:14:15Z","title":"Task Allocation and Motion Planning in Dynamic, Cluttered Environments via CBBA and Graphs of Convex Sets","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T00:09:30.656365Z"},"links":{"cited_paper":"/paper/2409.19543","citing_paper":"/paper/2606.18516"},"observation_digest":"sha256:147034a1fb1c38e0d0634a9770f371935deb49b38105b01b40c51b2f2b22978d","observation_id":"c657fbf8-5193-4708-a9ce-d6d35dd47b5d","resolution":{"observed_at":"2026-06-27T00:10:15.967348Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19543","last_updated":"2024-09-29T04:01:29Z","snapshot_observed_at":"2026-07-06T19:23:58.763033Z","submitted_at":"2024-09-29T04:01:29Z","title":"Multi-Query Shortest-Path Problem in Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":"2409.19543","doi":"10.48550/arxiv.2409.19543","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.19543","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"arXiv preprint arXiv:2409.19543 , year=","venue":null,"work_id":"0cec897d-38cc-4843-9a04-0e8ebdc6dbe8","year":2024},"citing_paper":{"arxiv_id":"2607.00444","last_updated":"2026-07-01T04:58:00Z","snapshot_observed_at":"2026-07-07T00:06:03.968882Z","submitted_at":"2026-07-01T04:58:00Z","title":"Search-Based Spatiotemporal and Multi-Robot Motion Planning on Graphs of Space-Time Convex Sets","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-02T11:55:26.547792Z"},"links":{"cited_paper":"/paper/2409.19543","citing_paper":"/paper/2607.00444"},"observation_digest":"sha256:b5b2308966b84d0d21a3810c8a4a7ee49df83f42f630d0854a0bff019022f692","observation_id":"307c9d3d-4497-4031-815f-44d1cc166753","resolution":{"observed_at":"2026-07-02T11:56:54.797146Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19543","last_updated":"2024-09-29T04:01:29Z","snapshot_observed_at":"2026-07-06T19:23:58.763033Z","submitted_at":"2024-09-29T04:01:29Z","title":"Multi-Query Shortest-Path Problem in Graphs of Convex Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.19543","snapshot_observed_at":"2026-07-12T06:59:57.337747Z","title":"Morozov et al.,Multi-query shortest-path problem in graphs of convex sets, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02797","last_updated":"2026-07-02T22:17:11Z","snapshot_observed_at":"2026-08-06T06:23:59.540560Z","submitted_at":"2026-07-02T22:17:11Z","title":"RCOA Extension and Applications","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-12T06:59:57.337747Z"},"links":{"cited_paper":"/paper/2409.19543","citing_paper":"/paper/2607.02797"},"observation_digest":"sha256:073db126f9653c6196ad6408eff481fce5c06c83bf48745381b5371bab430149","observation_id":"6ff67332-655b-4b49-b23f-0c8505bc081f","resolution":{"observed_at":"2026-07-12T06:59:57.337747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2409.19543/citation-record","integrity":"/paper/2409.19543/integrity","json":"/paper/2409.19543/citation-record.json","paper":"/paper/2409.19543"},"outbound":[],"paper":{"arxiv_id":"2409.19543","last_updated":"2024-09-29T04:01:29Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-07-06T19:23:58.763033Z","submitted_at":"2024-09-29T04:01:29Z","title":"Multi-Query Shortest-Path Problem in Graphs of Convex Sets"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2409.19543."}