Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1907.04585.
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-14T04:19:01.838238Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-07-09T06:06:01.432630Z
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 64531688-dda5-4676-9486-50b5de0eae6e · inbound
Induced packing treewidth cites this paper.
Induced packing treewidth Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
Reference 17
- Resolution
- verified exact
- local_arxiv, observed 2026-07-09T06:06:01.436331Z
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.
Observation bce11cc2-fee8-4c32-b9bb-073f3c9716a4 · inbound
Induced packing treewidth cites this paper.
Induced packing treewidth Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T02:08:23.554754Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d6b27a2c-9e5a-45b3-bab2-235bef437c2a · inbound
TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability cites this paper.
TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
Reference 190
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T04:19:01.838238Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.