Pith. sign in

Paper Citation Record · LEDGER

Towards Optimizing a Convex Cover of Collision-Free Space for Trajectory Generation

As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2406.09631.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2406.09631 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T10:13:23.463926Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-15T15:10:14.757472Z

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 dc08076b-b026-43ad-9d2a-039ec1495baf · 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 Towards Optimizing a Convex Cover of Collision-Free Space for Trajectory Generation

Reference 47

Resolution
unresolved
no resolver link, observed 2026-08-16T10:13:23.463926Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T10:13:23.463926Z digest=sha256:5ebf88f168d8799e738083ff47098a4ad093e866a21d4239fcba37fb7bddf34c

Observation a58037f0-f871-4020-9d2b-a07dda19caad · inbound

Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles cites this paper.

Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles Towards Optimizing a Convex Cover of Collision-Free Space for Trajectory Generation

Reference 32

Resolution
verified exact
local_arxiv, observed 2026-08-15T15:10:14.763513Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-15T15:10:14.590537Z digest=sha256:34cde3e9eee805a5b764ce8e9fc1e93e943afa84520169047e71a4aff6980724