Paper Citation Record · LEDGER

Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2410.12649.

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

pith.paper-citation-record.v1
2410.12649 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 10 of 10 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 10 of 10 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T10:50:59.783128Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-10T06:15:00.866473Z

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 ac68d266-00dc-43a5-9326-3e46d227514f · 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 Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-12T10:50:59.783128Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ca6c070-966b-4d6c-85f5-7c2ffb42dfd6 · inbound

Neural Configuration-Space Barriers for Manipulation Planning and Control cites this paper.

Neural Configuration-Space Barriers for Manipulation Planning and Control Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

Reference 44

Resolution: verified exact; arxiv_id, observed 2026-05-23T00:47:19.007817Z

Source-reported events for the cited work

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

Observation da3e16cc-5f5b-4875-a282-d2347e5c5049 · inbound

Neural Configuration-Space Barriers for Manipulation Planning and Control cites this paper.

Neural Configuration-Space Barriers for Manipulation Planning and Control Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

Reference 44

Resolution: verified exact; arxiv_id, observed 2026-05-25T08:50:32.886047Z

Source-reported events for the cited work

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

Observation bcb972c7-cf6e-4870-9ce3-4bed143cba18 · 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 Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

Reference 61

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4b19598a-057d-46f5-990d-3428b63c509a · 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 Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

Reference 2019

Resolution: unresolved; no resolver link, observed 2026-08-05T15:19:17.237204Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4c431e9-3797-4b3d-a9ed-47df5319ac99 · inbound

Signal Temporal Logic Motion Planning via Graphs of Convex Sets cites this paper.

Signal Temporal Logic Motion Planning via Graphs of Convex Sets Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

Reference 54

Resolution: verified exact; arxiv_id, observed 2026-05-25T04:35:20.740394Z

Source-reported events for the cited work

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

Observation 23a6ffcb-e91a-4604-b4b1-d10803a6f433 · inbound

Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning cites this paper.

Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

Reference 7

Resolution: verified exact; arxiv_id, observed 2026-07-03T11:28:04.200802Z

Source-reported events for the cited work

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

Observation c861c930-b98a-4706-bb82-5ae8731056c4 · 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 Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

Reference 22

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

Source-reported events for the cited work

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

Observation 84ed37fa-e796-4f87-beab-0f4d98a30521 · inbound

Any-Body Guard: Universal Safeguarding for Manipulation Policies via Action Masking cites this paper.

Any-Body Guard: Universal Safeguarding for Manipulation Policies via Action Masking Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

Reference 38

Resolution: verified exact; arxiv_id, observed 2026-07-04T08:49:41.810077Z

Source-reported events for the cited work

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

Observation 4f10724a-aa54-40d3-9ac4-84a72ff60e93 · 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 Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space

Reference 17

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.