Pith. sign in

Paper Citation Record · LEDGER

Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2204.08981.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2204.08981 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 6 of 6 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 6 of 6 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T16:49:49.735370Z

measured 0 of 1 external citation measurements

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.

source=pdf_text observed=2026-08-06T16:49:49.735370Z digest=sha256:33596dc55922ffa46e6f0ffe6ee482de6450a166ae0b007b7180f7496cdaf7dd

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.

source=pdf_text observed=2026-08-06T10:41:59.268280Z digest=sha256:b4804aecd5d635827ff040525838d46e0d54129b99f9b634e167443f1e0cc429

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-05-13T05:02:44.085197Z digest=sha256:fd4f4ec43c8985cbcfd0ad40ead6d74a10123be75eefd83e51915b1968232943

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-05-14T20:58:30.414161Z digest=sha256:bb3559dd035a4fffbb139cd4c8021661e07337d01bf0a037c285e0890e572468

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.

source=pdf_text observed=2026-08-02T14:33:55.567729Z digest=sha256:0dfb7978e186fff80bab17e7d853f9596e4e6bafa29df6e1cfd8e22bb420d6ea

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-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-07-08T16:20:17.382586Z digest=sha256:2b10ffb4887b5e04c77b09694f8363264054a19074a47b321a2a8ce7e068e2fa