Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Progressive Algorithms for Domination and Independence
As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1811.06799.
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-09T06:31:02.800959+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-05T12:26:55.810039Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-05T12:26:57.610497Z
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 d5afd00e-0119-459c-a884-4ea931b2f54c · inbound
Fatness and Flatness cites this paper.
Fatness and Flatness Progressive Algorithms for Domination and Independence
Reference 18
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T07:31:27.288256Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4bb41c9c-9c20-4b38-be38-ed96efa71458 · inbound
Dynamic domination and independence in sparse graphs cites this paper.
Dynamic domination and independence in sparse graphs Progressive Algorithms for Domination and Independence
Reference 10
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T05:04:35.896532Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6359e191-e7ec-4e1a-a7a2-db59ae595118 · inbound
Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension cites this paper.
Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension Progressive Algorithms for Domination and Independence
Reference 84
- Resolution
- verified exact
- local_arxiv, observed 2026-08-05T12:26:57.614648Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.