Paper Citation Record · LEDGER

Forest Cuts in Sparse Graphs

As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2409.17724.

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

pith.paper-citation-record.v1
2409.17724 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T11:49:58.287185Z

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

0
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 2e41318d-85b6-42c5-ab94-bcc4d894e270 · inbound

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs cites this paper.

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs Forest Cuts in Sparse Graphs

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-12T11:49:58.287185Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 32084b7b-57db-46dc-93e0-fd7fcd8d69a9 · inbound

Sparse graphs with an independent or foresty minimum vertex cut cites this paper.

Sparse graphs with an independent or foresty minimum vertex cut Forest Cuts in Sparse Graphs

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-11T22:11:49.578764Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ec78f4ba-bfa1-4843-9ac0-3faea3b40163 · inbound

Stable cuts, NAC-colourings and flexible realisations of graphs cites this paper.

Stable cuts, NAC-colourings and flexible realisations of graphs Forest Cuts in Sparse Graphs

Reference 6

Resolution: verified exact; arxiv_id, observed 2026-05-23T06:55:27.993696Z

Source-reported events for the cited work

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

Observation a9566051-c9d2-4571-ba2a-58f1c45aa2ee · inbound

The minimum size of a $k$-connected locally nonforesty graph cites this paper.

The minimum size of a $k$-connected locally nonforesty graph Forest Cuts in Sparse Graphs

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-10T16:26:26.213199Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.