Pith. sign in

Paper Citation Record · LEDGER

Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming

As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2303.14737.

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

pith.paper-citation-record.v1
2303.14737 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-08T06:08:32.368172Z

measured 1 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

8
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 4afa6d17-af70-4062-bb17-95440c6a7a69 · 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 Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-06T17:30:48.300220Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T17:30:48.300220Z digest=sha256:4c3b4e93675c686c582709944a34cd6927caa6a5607d548e475e918c4422f618

Observation fe784fc9-8179-4435-8b46-cadc88ae997f · inbound

Robust Convex Model Predictive Control with collision avoidance guarantees for robot manipulators cites this paper.

Robust Convex Model Predictive Control with collision avoidance guarantees for robot manipulators Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-05T14:09:53.196203Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T14:09:53.196203Z digest=sha256:aafe77e32d6d6eaf4bf216a1a549dfb74c0e6bb4ade976029a51dac5f77b8161

Observation 8dd0227f-767d-446e-825d-4af1ab011729 · inbound

Cooperative Grasping for Collective Object Transport in Constrained Environments cites this paper.

Cooperative Grasping for Collective Object Transport in Constrained Environments Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-05T10:51:40.604270Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T10:51:40.604270Z digest=sha256:15c06056da02f05e9889c5a87724497e3b32aac171ecd713ebea1f7c4e3f8872

Observation 6a504cde-2ec3-47da-bdbe-b4f39a795921 · inbound

Task Allocation and Motion Planning in Dynamic, Cluttered Environments via CBBA and Graphs of Convex Sets cites this paper.

Task Allocation and Motion Planning in Dynamic, Cluttered Environments via CBBA and Graphs of Convex Sets Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming

Reference 21

Resolution
verified exact
arxiv_id, observed 2026-06-27T00:10:15.973148Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-06-27T00:09:30.656365Z digest=sha256:f7686eb781367d1ae5654bd910724d899002f9de0c34cd7eb3f4c69d0aa8e5c0

Observation 85b731b6-97db-4b8e-9214-3e6a882a45c5 · inbound

PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds cites this paper.

PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-08T06:08:32.368172Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-08T06:08:32.368172Z digest=sha256:a66160b98313a74f01201375079b7c7d912b0933d7b6585191cabcfa7df38018