Pith. sign in

Paper Citation Record · LEDGER

Partition universality for graphs of bounded degeneracy and degree

As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2211.15819.

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

pith.paper-citation-record.v1
2211.15819 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T21:15:09.162246Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-06T00:11:37.301756Z

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 ce2c85bc-425e-48e7-be2f-991d3c9a25c4 · inbound

Size-Ramsey numbers of tight paths cites this paper.

Size-Ramsey numbers of tight paths Partition universality for graphs of bounded degeneracy and degree

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-06T21:15:09.162246Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T21:15:09.162246Z digest=sha256:93c754c6f412cadac61b70b069626b37b7a938117e8c077688f5976bfff7de53

Observation c805e32e-a4f6-4778-a7f8-5862b4a46504 · inbound

Combinatorial theorems relative to sparse sets cites this paper.

Combinatorial theorems relative to sparse sets Partition universality for graphs of bounded degeneracy and degree

Reference 1

Resolution
verified exact
local_arxiv, observed 2026-08-06T00:11:37.306907Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-08-06T00:11:37.071368Z digest=sha256:68dfc3456d700d4ced7f861ad8426cea9149e3e8d187f3030666212299652c80