Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
How many random edges make an almost-Dirac graph Hamiltonian?
As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2410.14447.
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-12T06:34:41.77262+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-06-28T22:04:58.692677Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-01T19:46:10.681150Z
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 b712377d-68dd-4624-beb1-666531b997ed · inbound
Universality for rainbow oriented cycles in perturbed digraphs cites this paper.
Universality for rainbow oriented cycles in perturbed digraphs How many random edges make an almost-Dirac graph Hamiltonian?
Reference 17
- Resolution
- verified exact
- arxiv_id, observed 2026-07-01T19:46:10.682696Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.