Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2204.08981.
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-21T06:32:19.484+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T18:06:54.802073Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-07-08T16:25:09.892423Z
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 e9ffc0a9-ab17-4e2c-8c9a-8dba52e439eb · inbound
Edge-coloring $K_{n, n}$ with no 2-colored $C_{2k}$ cites this paper.
Edge-coloring $K_{n, n}$ with no 2-colored $C_{2k}$ Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Reference 10
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T16:49:49.735370Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a5123455-94cc-433d-a850-7871a736578a · inbound
Odd Ramsey numbers of multipartite graphs and hypergraphs cites this paper.
Odd Ramsey numbers of multipartite graphs and hypergraphs Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Reference 14
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T18:06:54.802073Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b07ad50c-aac0-4e4b-879e-f9cc3a61c6bc · inbound
Erd\H{o}s meets Nash-Williams cites this paper.
Erd\H{o}s meets Nash-Williams Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Reference 14
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T10:41:59.268280Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 57d30ed9-9271-4bd3-ad0e-50649b8faeb1 · inbound
Sharp asymptotic bounds for uniform union-free hypergraphs cites this paper.
Sharp asymptotic bounds for uniform union-free hypergraphs Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Reference 3
- Resolution
- verified exact
- arxiv_id, observed 2026-05-13T05:07:17.805303Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 50136a35-fae9-4b90-8800-41487a566abc · inbound
Sharp asymptotic bounds for uniform union-free hypergraphs cites this paper.
Sharp asymptotic bounds for uniform union-free hypergraphs Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Reference 3
- Resolution
- verified exact
- arxiv_id, observed 2026-05-14T20:59:27.304580Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 9b0dde03-0b34-4ebf-aaf7-55eb86aa9e39 · inbound
Sharp asymptotic bounds for uniform union-free hypergraphs cites this paper.
Sharp asymptotic bounds for uniform union-free hypergraphs Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-08-02T14:33:55.567729Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 88d40b50-b2aa-4ff5-8503-69314c38dc3e · inbound
Solution to a conjecture of Alon, D\k{e}bski, Grytczuk and Przyby\l{}o on fixed-cardinality arithmetic progressions cites this paper.
Solution to a conjecture of Alon, D\k{e}bski, Grytczuk and Przyby\l{}o on fixed-cardinality arithmetic progressions Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Reference 4
- Resolution
- verified exact
- local_arxiv, observed 2026-07-08T16:25:09.894386Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.