Pith. sign in

Paper Citation Record · LEDGER

Fast Path Planning Through Large Collections of Safe Boxes

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

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

pith.paper-citation-record.v1
2305.01072 v2

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-12T06:34:41.77262+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-12T16:27:11.902226Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-12T16:27:03.107375Z

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 daf4cde0-3ac0-46e9-bf10-6038c59a6366 · inbound

Bezier Reachable Polytopes: Efficient Certificates for Robust Motion Planning with Layered Architectures cites this paper.

Bezier Reachable Polytopes: Efficient Certificates for Robust Motion Planning with Layered Architectures Fast Path Planning Through Large Collections of Safe Boxes

Reference 16

Resolution
verified exact
local_arxiv, observed 2026-08-12T16:27:03.114120Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-12T16:27:03.058848Z digest=sha256:3e59ad6ab0cd7a2c0a62dbba4f3b76dc88a98477ff5e5d8fe861223e4833dcdf

Observation bd31a90b-28c8-4204-8a03-be7b071f88e7 · inbound

Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes cites this paper.

Dynamically Feasible Path Planning in Cluttered Environments via Reachable Bezier Polytopes Fast Path Planning Through Large Collections of Safe Boxes

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-12T16:27:11.902226Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T16:27:11.902226Z digest=sha256:5e24850751e0e1f3d6ce4365f6f52532aa7141dc06517cfd8166b482b00b38e5