{"as_of":"2026-08-11T05:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:30aac6472a21476c806db86c045136d0e8e363d415541b65cee33a816bcf9d05","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-10T06:31:04.303077+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-07-12T06:59:57.337747Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.18913","last_updated":"2025-04-14T02:47:15Z","snapshot_observed_at":"2026-07-06T19:58:22.387205Z","submitted_at":"2024-11-28T05:08:00Z","title":"Planning Shorter Paths in Graphs of Convex Sets by Undistorting Parametrized Configuration Spaces","version":2},"cited_work":{"arxiv_id":"2411.18913","doi":"10.48550/arxiv.2411.18913","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.18913","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PlanningShorterPathsinGraphsofConvexSetsbyUndistortingParametrizedConfiguration Spaces,","venue":"arXiv (Cornell University)","work_id":"df1f07f9-9e87-4fb3-a4ce-929e0ed23210","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":10,"source":"pdf_text","source_observed_at":"2026-06-27T00:09:30.656365Z"},"links":{"cited_paper":"/paper/2411.18913","citing_paper":"/paper/2606.18516"},"observation_digest":"sha256:49d52becec894987e829bf7562213b4d54a2eef0515c35acfe2f880e52a13ed5","observation_id":"30da80bf-0e33-465f-b263-6ce8ab328d1b","resolution":{"observed_at":"2026-06-27T00:10:15.948148Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18913","last_updated":"2025-04-14T02:47:15Z","snapshot_observed_at":"2026-07-06T19:58:22.387205Z","submitted_at":"2024-11-28T05:08:00Z","title":"Planning Shorter Paths in Graphs of Convex Sets by Undistorting Parametrized Configuration Spaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18913","snapshot_observed_at":"2026-07-12T06:59:57.337747Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02797","last_updated":"2026-07-02T22:17:11Z","snapshot_observed_at":"2026-08-10T02:10:05.333421Z","submitted_at":"2026-07-02T22:17:11Z","title":"RCOA Extension and Applications","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-12T06:59:57.337747Z"},"links":{"cited_paper":"/paper/2411.18913","citing_paper":"/paper/2607.02797"},"observation_digest":"sha256:dc103e7eaead7220b36d54a799c8541cee5e585217281956d8612b331e8d41a9","observation_id":"bf6cfb5c-455f-479f-a776-696d69047a11","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/2411.18913/citation-record","integrity":"/paper/2411.18913/integrity","json":"/paper/2411.18913/citation-record.json","paper":"/paper/2411.18913"},"outbound":[],"paper":{"arxiv_id":"2411.18913","last_updated":"2025-04-14T02:47:15Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-07-06T19:58:22.387205Z","submitted_at":"2024-11-28T05:08:00Z","title":"Planning Shorter Paths in Graphs of Convex Sets by Undistorting Parametrized Configuration Spaces"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2411.18913."}