Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets
As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2407.08848.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-16T10:13:23.305694Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-05T15:19:17.402754Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation fea2f1bf-1e81-4bd5-955d-62e37ff2251f · inbound
Planning Shorter Paths in Graphs of Convex Sets by Undistorting Parametrized Configuration Spaces cites this paper.
Planning Shorter Paths in Graphs of Convex Sets by Undistorting Parametrized Configuration Spaces GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets
Reference 32
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T10:50:59.795652Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 571e42bc-c691-4e9b-8e51-5de68492a552 · inbound
A biconvex method for minimum-time motion planning through sequences of convex sets cites this paper.
A biconvex method for minimum-time motion planning through sequences of convex sets GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T10:13:23.305694Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 8889b036-c53f-4814-8adc-e0aa1e718f5e · inbound
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets cites this paper.
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T17:30:45.587408Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 44d318bc-850b-4316-a78c-dc9570c1e02a · inbound
Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning cites this paper.
Discrete-Guided Diffusion for Scalable and Safe Multi-Robot Motion Planning GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets
Reference 2023
- Resolution
- verified exact
- local_arxiv, observed 2026-08-05T15:19:17.411102Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation c519a300-7869-4585-bce1-b5187767197d · inbound
Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles cites this paper.
Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles GCS*: Forward Heuristic Search on Implicit Graphs of Convex Sets
Reference 34
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T15:10:14.598915Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.