Pith. sign in

Paper Citation Record · LEDGER

A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method

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

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

pith.paper-citation-record.v1
2111.06214 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-12T06:34:41.77262+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-10T00:24:26.464890Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-09T23:24:43.066041Z

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 09c4e3d7-7386-4932-b816-bbb719f95efc · inbound

Triangle-free $d$-degenerate graphs have small fractional chromatic number cites this paper.

Triangle-free $d$-degenerate graphs have small fractional chromatic number A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-10T00:24:26.464890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T00:24:26.464890Z digest=sha256:49181e78e8c7074d1c763e55f935b4631455aadfd91ea77858500218dfa37c05

Observation b2fbe4d1-bb6b-4ff5-93e4-0bba12e8e09f · inbound

Fully Dynamic Algorithms for Coloring Triangle-Free Graphs cites this paper.

Fully Dynamic Algorithms for Coloring Triangle-Free Graphs A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method

Reference 151

Resolution
verified exact
arxiv_id, observed 2026-05-09T23:24:43.067270Z

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.

source=arxiv_source observed=2026-05-09T23:23:43.928107Z digest=sha256:c4d0c14c5eb011b00040a3f9e73b8d7a55ed397a46744d9965d97555d4eb2d38