Pith. sign in

Paper Citation Record · LEDGER

Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition

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

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

pith.paper-citation-record.v1
2011.04511 v2

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-14T06:32:32.682623+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-12T00:24:40.696223Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-24T15:44:41.336074Z

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 3f1aa7a8-a4ea-4123-96d6-95a0f3b68110 · inbound

Notes on Theory of Distributed Systems cites this paper.

Notes on Theory of Distributed Systems Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition

Reference 142

Resolution
verified exact
arxiv_id, observed 2026-05-24T15:44:41.340442Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=arxiv_source observed=2026-05-24T15:42:08.656511Z digest=sha256:8b2256abe88b15e9619a663c2e3a83d22689e0d2378f97aa11aa3f6d5c41966c

Observation 29f0d9f7-ba48-4e03-b99d-ac56cc34116d · inbound

Truly Work-efficient Parallel Deterministic $(\Delta+1)$-coloring and Maximal Independent Set cites this paper.

Truly Work-efficient Parallel Deterministic $(\Delta+1)$-coloring and Maximal Independent Set Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-12T00:24:40.696223Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T00:24:40.696223Z digest=sha256:8a1d954761e227dd4af3ff980a5641ac065b9193424dd805f11aa03c7cf60962