Paper Citation Record · LEDGER

The Parameterized Complexity of Computing the Linear Vertex Arboricity

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

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

pith.paper-citation-record.v1
2505.18885 v1

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T14:33:02.257697Z

measured 25 of 25 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 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

25 of 25 outbound references displayed

verified exact13
verified fuzzy3
unresolved7
parse uncertain0
malformed identifier2
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 9b7443dc-7613-49ce-ac6e-01002eee2353 · outbound

This paper cites Line and Plane Cover Numbers Revisited.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Line and Plane Cover Numbers Revisited

Reference 1

Resolution: verified exact; local_arxiv, observed 2026-08-07T14:33:04.608923Z

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.

Observation 0cd1e4ec-ee51-429a-b474-6288fd90a7f7 · outbound

This paper cites Drawing graphs on few lines and few planes.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Drawing graphs on few lines and few planes

Reference 2

Resolution: verified exact; doi, observed 2026-08-07T14:33:04.094416Z

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.

Observation b5eb9f47-3738-4b2b-940c-66a079274d0a · outbound

This paper cites The complexity of drawing graphs on few lines and few planes.

The Parameterized Complexity of Computing the Linear Vertex Arboricity The complexity of drawing graphs on few lines and few planes

Reference 3

Resolution: malformed identifier; no resolver link, observed 2026-08-07T14:33:00.004051Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6a5b60b2-ee2b-46d7-b861-e47c68402e8a · outbound

This paper cites Beyond Outerplanarity.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Beyond Outerplanarity

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-07T14:33:00.107504Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 326a7fe0-7220-4586-aecc-d7bba267f4bc · outbound

This paper cites The Parametrized Complexity of the Segment Number.

The Parameterized Complexity of Computing the Linear Vertex Arboricity The Parametrized Complexity of the Segment Number

Reference 5

Resolution: verified exact; local_arxiv, observed 2026-08-07T14:33:04.443538Z

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.

Observation f6d05531-e5f5-45e2-8ddd-62c2daca16d6 · outbound

This paper cites The monadic second-order logic of graphs.

The Parameterized Complexity of Computing the Linear Vertex Arboricity The monadic second-order logic of graphs

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-07T14:33:00.292298Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 18eb86d9-9cb0-4a92-a9f8-1a9375076e44 · outbound

This paper cites Monadic second-order logic, page 315–426.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Monadic second-order logic, page 315–426

Reference 7

Resolution: verified exact; doi, observed 2026-08-07T14:33:03.944037Z

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.

Observation d78fe0d4-1759-482b-b2c9-f7cc8abfea9b · outbound

This paper cites an unresolved cited work.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Unresolved cited work

Reference 8

Resolution: unresolved; raw_fallback, observed 2026-08-07T14:33:05.424440Z

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.

Observation 91fb083d-1e3d-4744-9d32-a7a7f6681dc9 · outbound

This paper cites Cubic planar graphs that cannot be drawn on few lines.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Cubic planar graphs that cannot be drawn on few lines

Reference 9

Resolution: verified exact; doi, observed 2026-08-07T14:33:03.747702Z

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.

Observation c7afc459-6ead-44a6-a8c2-561e6f106dec · outbound

This paper cites The weak line cover number in 3D for restricted graph classes.

The Parameterized Complexity of Computing the Linear Vertex Arboricity The weak line cover number in 3D for restricted graph classes

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T14:33:05.208946Z

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.

Observation 1bdc4b45-471c-46dd-818d-1e3806574ceb · outbound

This paper cites Vertex-partitioning into fixed additive induced-hereditary prop- erties is NP-hard.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Vertex-partitioning into fixed additive induced-hereditary prop- erties is NP-hard

Reference 11

Resolution: malformed identifier; doi_truncated, observed 2026-08-07T14:33:03.604667Z

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.

Observation b12c4291-b53e-47b2-b0fb-55a579121691 · outbound

This paper cites Fellows, Jan Kratochv ´ ıl, Matthias Middendorf, and Frank Pfeiffer.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Fellows, Jan Kratochv ´ ıl, Matthias Middendorf, and Frank Pfeiffer

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T14:33:05.033245Z

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.

Observation 060ee462-fcf4-47f5-909e-92eb56da707e · outbound

This paper cites 4-connected triangulations on few lines.

The Parameterized Complexity of Computing the Linear Vertex Arboricity 4-connected triangulations on few lines

Reference 13

Resolution: verified exact; doi, observed 2026-08-07T14:33:03.457986Z

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.

Observation 02981056-e3fc-4931-82dd-a5963a4dc5a3 · outbound

This paper cites On the weak line cover numbers.

The Parameterized Complexity of Computing the Linear Vertex Arboricity On the weak line cover numbers

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T14:33:04.885815Z

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.

Observation 3a828b0b-ab99-415b-8df9-e01d67ab099f · outbound

This paper cites Experimental analy- sis of the accessibility of drawings with few segments.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Experimental analy- sis of the accessibility of drawings with few segments

Reference 15

Resolution: verified exact; doi, observed 2026-08-07T14:33:03.284947Z

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.

Observation e6f74b95-2f01-45b1-99bb-a62fbdac7b8a · outbound

This paper cites A single-exponential time 2-approximation algorithm for treewidth.

The Parameterized Complexity of Computing the Linear Vertex Arboricity A single-exponential time 2-approximation algorithm for treewidth

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-07T14:33:01.468121Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 866583b6-58f8-4dce-a9a9-323fe01f7f79 · outbound

This paper cites Drawing graphs on few circles and few spheres.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Drawing graphs on few circles and few spheres

Reference 17

Resolution: verified exact; doi, observed 2026-08-07T14:33:03.136739Z

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.

Observation b4b80a88-bdf4-4159-9d9c-fd45b7459708 · outbound

This paper cites Bounds for the vertex linear arboricity.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Bounds for the vertex linear arboricity

Reference 18

Resolution: verified exact; doi, observed 2026-08-07T14:33:02.947197Z

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.

Observation fab3a534-4054-4189-99b3-bf4131aff0b3 · outbound

This paper cites Variants of the Segment Number of a Graph.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Variants of the Segment Number of a Graph

Reference 19

Resolution: verified exact; local_arxiv, observed 2026-08-07T14:33:04.289513Z

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.

Observation a1112e01-7818-472f-b471-fb0ef1028e98 · outbound

This paper cites On the computational complexity and geometry of the first-order theory of the reals.

The Parameterized Complexity of Computing the Linear Vertex Arboricity On the computational complexity and geometry of the first-order theory of the reals

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-07T14:33:01.896725Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c1887d7-41d9-4fbc-8542-46e9d0b97acd · outbound

This paper cites On the computational complexity and geometry of the first- order theory of the reals.

The Parameterized Complexity of Computing the Linear Vertex Arboricity On the computational complexity and geometry of the first- order theory of the reals

Reference 21

Resolution: verified exact; doi, observed 2026-08-07T14:33:02.777904Z

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.

Observation 79a0b1f9-84f6-4575-b853-1b2fc9b4bcf4 · outbound

This paper cites On the computational complexity and geometry of the first-order theory of the reals.

The Parameterized Complexity of Computing the Linear Vertex Arboricity On the computational complexity and geometry of the first-order theory of the reals

Reference 22

Resolution: verified exact; doi, observed 2026-08-07T14:33:02.620428Z

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.

Observation c9ae7627-abb0-4829-ac9c-cbf84cdf733a · outbound

This paper cites Drawing graphs with few arcs.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Drawing graphs with few arcs

Reference 23

Resolution: verified exact; doi, observed 2026-08-07T14:33:02.436387Z

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.

Observation 830f6ddf-ea47-4ab1-88b1-8d33633f65f8 · outbound

This paper cites an unresolved cited work.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Unresolved cited work

Reference 1995

Resolution: unresolved; no resolver link, observed 2026-08-07T14:33:01.072583Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b8a5f0e-8a2a-4e4f-b45d-af5dfa4fe76a · outbound

This paper cites an unresolved cited work.

The Parameterized Complexity of Computing the Linear Vertex Arboricity Unresolved cited work

Reference 2007

Resolution: unresolved; no resolver link, observed 2026-08-07T14:33:00.593983Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.