Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Computing bounded-width tree and branch decompositions of k-outerplanar graphs
As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1301.5896.
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-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T11:33:03.548072Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-07T18:16:16.850658Z
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 35b86b4f-4256-4949-8242-052c7a23ce3d · inbound
A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs cites this paper.
A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs Computing bounded-width tree and branch decompositions of k-outerplanar graphs
Reference 17
- Resolution
- verified exact
- local_arxiv, observed 2026-08-07T11:33:07.021313Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.