Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$
As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1611.06827.
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-08-11T00:42:02.303507Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-25T15:05:57.688180Z
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 376a4c3e-5f1b-4682-8fe2-d555e0cb1407 · inbound
Perfectly packing graphs with bounded degeneracy and many leaves cites this paper.
Perfectly packing graphs with bounded degeneracy and many leaves The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$
Reference 10
- Resolution
- verified exact
- arxiv_id, observed 2026-05-25T15:05:57.692912Z
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.
Observation deea8db8-1fa3-4daf-8a75-ee2a9304a9c7 · inbound
A rainbow blow-up lemma for almost optimally bounded edge-colourings cites this paper.
A rainbow blow-up lemma for almost optimally bounded edge-colourings The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$
Reference 18
- Resolution
- verified exact
- arxiv_id, observed 2026-05-24T17:29:44.668443Z
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.
Observation 757f74f8-152e-4367-833e-93704c21ecc4 · inbound
A congruence obstruction to Roman's bound for Zarankiewicz numbers cites this paper.
A congruence obstruction to Roman's bound for Zarankiewicz numbers The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$
Reference 11
- Resolution
- unresolved
- no resolver link, observed 2026-08-11T00:42:02.303507Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.