Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Fast and Simple Edge-Coloring Algorithms
As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1907.03201.
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-22T06:32:14.747728+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-16T11:14:15.902586Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-19T05:47:08.078851Z
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 dcb6f133-c317-4e1a-80b8-b62e2412c2b9 · inbound
Improved Streaming Edge Coloring cites this paper.
Improved Streaming Edge Coloring Fast and Simple Edge-Coloring Algorithms
Reference 39
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:14:15.902586Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation afa5a2ba-62b1-4fd2-a258-602931243857 · inbound
The planar edge-coloring theorem of Vizing in $O(n\log n)$ time cites this paper.
The planar edge-coloring theorem of Vizing in $O(n\log n)$ time Fast and Simple Edge-Coloring Algorithms
Reference 14
- Resolution
- verified exact
- arxiv_id, observed 2026-05-19T05:47:08.080860Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.