Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-12T11:49:58.297791Z
Paper Citation Record · LEDGER
Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
As of 13 August 2026, this Paper Citation Record lists 4 of 4 outbound references and 1 inbound Pith citation observation for arXiv:2411.17885.
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-12T06:34:41.77262+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-01T12:35:28.361693Z
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
4 of 4 outbound references displayed
- verified exact0
- verified fuzzy1
- unresolved3
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 5739c344-4843-46de-8a86-ad7de3ff38c1 · outbound
This paper cites A note on fragile graphs.
Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs A note on fragile graphs
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T11:49:58.379727Z
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 2e41318d-85b6-42c5-ab94-bcc4d894e270 · outbound
This paper cites Forest Cuts in Sparse Graphs.
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 0350d6b3-f51a-48db-bb2e-c50eb2a8a480 · outbound
This paper cites The minimum size of a $3$-connected locally nonforesty graph.
Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs The minimum size of a $3$-connected locally nonforesty graph
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T11:49:58.292530Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e2b5fcb1-e0ed-435f-904b-2ae2cd0b4baf · outbound
This paper cites an unresolved cited work.
Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs Unresolved cited work
Reference 4
- Resolution
- unresolved
- raw_fallback, observed 2026-08-12T11:49:58.364871Z
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.
Pith citing papers
Observation a1686684-e108-425c-ad84-8a26b59e18bc · inbound
Cyclic Neighborhoods in Digraphs cites this paper.
Cyclic Neighborhoods in Digraphs Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T12:35:28.361693Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.