Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:0806.0840.
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-20T06:33:59.587034+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T21:12:09.134724Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-15T21:12:09.883039Z
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 83efe5a6-102e-4e32-9be4-a6951e1e1859 · inbound
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing cites this paper.
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
Reference 2012
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-15T21:12:09.887569Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.