{"as_of":"2026-08-13T15:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9bcd93326166e12910ef806b7ff102ab0a113593df50aabd8c54a23091c39a12","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:27:11.868908Z","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-03T21:48:59.711970Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2101.11565","last_updated":"2023-07-03T19:12:57Z","snapshot_observed_at":"2026-08-07T07:47:14.991363Z","submitted_at":"2021-01-27T17:40:11Z","title":"Shortest Paths in Graphs of Convex Sets","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.11565","snapshot_observed_at":"2026-08-12T16:27:11.868908Z","title":"Shortest paths in graphs of convex sets,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.13507","last_updated":"2024-11-20T17:57:33Z","snapshot_observed_at":"2026-08-12T16:17:35.829140Z","submitted_at":"2024-11-20T17:57:33Z","title":"Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T16:27:11.868908Z"},"links":{"cited_paper":"/paper/2101.11565","citing_paper":"/paper/2411.13507"},"observation_digest":"sha256:0bd7a33c817d443cb068f79805b6410d7234a0f3db3ec6e79e0355f3b238b3c1","observation_id":"b5c9f148-f5dd-42bb-bba4-21331bd6eb6d","resolution":{"observed_at":"2026-08-12T16:27:11.868908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.11565","last_updated":"2023-07-03T19:12:57Z","snapshot_observed_at":"2026-08-07T07:47:14.991363Z","submitted_at":"2021-01-27T17:40:11Z","title":"Shortest Paths in Graphs of Convex Sets","version":5},"cited_work":{"arxiv_id":"2101.11565","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.11565","snapshot_observed_at":"2026-07-03T21:48:59.711970Z","title":"Shortest Paths in Graphs of Convex Sets,","venue":null,"work_id":"3daffb09-3fa8-4187-85bc-76802687d5ef","year":2023},"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":8,"source":"pdf_text","source_observed_at":"2026-06-27T00:09:30.656365Z"},"links":{"cited_paper":"/paper/2101.11565","citing_paper":"/paper/2606.18516"},"observation_digest":"sha256:e77c48e058d5c24cd3f9fcd9a733c1ecd4eb33f8d9031298c77d4dd772b84e84","observation_id":"693bdab3-37c2-45a9-90b7-19c8ee7b8b0f","resolution":{"observed_at":"2026-07-03T21:48:59.713363Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2101.11565/citation-record","integrity":"/paper/2101.11565/integrity","json":"/paper/2101.11565/citation-record.json","paper":"/paper/2101.11565"},"outbound":[],"paper":{"arxiv_id":"2101.11565","last_updated":"2023-07-03T19:12:57Z","latest_version":5,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-07T07:47:14.991363Z","submitted_at":"2021-01-27T17:40:11Z","title":"Shortest Paths 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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2101.11565."}