Pith. sign in

Paper Citation Record · LEDGER

The optimal edge-colouring threshold

As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2212.04397.

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

pith.paper-citation-record.v1
2212.04397 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T04:38:50.729532Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-07T21:34:09.303480Z

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 63f2e103-8a94-4052-bd18-171f8feffb68 · inbound

Robust Hamiltonicity in families of Dirac graphs cites this paper.

Robust Hamiltonicity in families of Dirac graphs The optimal edge-colouring threshold

Reference 28

Resolution
verified exact
arxiv_id, observed 2026-05-24T07:09:05.313448Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-24T07:07:03.211243Z digest=sha256:1a6e1d1fcac10ca1c0c7be3c16c0e6a802603ab301f1b347ca71e65732c44751

Observation 07dc8282-8b96-4534-8efb-73fb73a20cf3 · inbound

Universal probability bounds for partial Latin squares cites this paper.

Universal probability bounds for partial Latin squares The optimal edge-colouring threshold

Reference 16

Resolution
verified exact
arxiv_id, observed 2026-07-03T22:19:00.486489Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-06-26T23:37:21.762778Z digest=sha256:2f6b019d361d068e18ddb7e5082911080be23ac1f5690be67345d9aae9683fec

Observation b730b1cc-65a4-4018-a36f-2de9736c3ffc · inbound

No-$(k+1)$-in-line problem for $k \geqslant 3$ cites this paper.

No-$(k+1)$-in-line problem for $k \geqslant 3$ The optimal edge-colouring threshold

Reference 25

Resolution
verified exact
local_arxiv, observed 2026-07-07T21:34:09.304925Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-07-07T21:25:11.018193Z digest=sha256:bbbcb180d1e622ead303ce136866dcd8bac6aed8c7c089b8042c74e0beee2399

Observation 899a397f-df9d-4ed9-a801-660a40a2d0c1 · inbound

Universality in random graphs via optimal linking systems: trees and beyond cites this paper.

Universality in random graphs via optimal linking systems: trees and beyond The optimal edge-colouring threshold

Reference 60

Resolution
unresolved
no resolver link, observed 2026-08-07T04:38:50.729532Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T04:38:50.729532Z digest=sha256:0d76a5fcf6836255348dfa503787a812e3871af562ee137c214861b26beb0404