Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
The Complexity of Drawing Graphs on Few Lines and Few Planes
As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1607.06444.
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-15T06:32:42.880941+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-14T12:25:27.417594Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-14T11:22:45.889872Z
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 0d48be51-ef6f-4257-967a-6a0fe772b35f · inbound
Line and Plane Cover Numbers Revisited cites this paper.
Line and Plane Cover Numbers Revisited The Complexity of Drawing Graphs on Few Lines and Few Planes
Reference 4
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-14T12:25:27.417594Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 730474ba-cdf5-4c52-9637-a91ef5fc1b18 · inbound
Variants of the Segment Number of a Graph cites this paper.
Variants of the Segment Number of a Graph The Complexity of Drawing Graphs on Few Lines and Few Planes
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T11:48:09.104662Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5f3eb4fb-50ec-456f-b9c3-8e94cdd3faa0 · inbound
Optimal Curve Straightening is $\exists\mathbb{R}$-Complete cites this paper.
Optimal Curve Straightening is $\exists\mathbb{R}$-Complete The Complexity of Drawing Graphs on Few Lines and Few Planes
Reference 20
- Resolution
- verified exact
- local_arxiv, observed 2026-08-14T11:22:45.895143Z
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.