Pith. sign in

Paper Citation Record · LEDGER

Round and Communication Efficient Graph Coloring

As of 20 August 2026, this Paper Citation Record lists 3 of 3 outbound references and 1 inbound Pith citation observation for arXiv:2412.12589.

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

pith.paper-citation-record.v1
2412.12589 v2

Coverage vector

measured 3 of 3 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T14:13:13.725140Z

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T05:57:35.815566Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-16T05:57:35.863600Z

Reference resolution

3 of 3 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved1
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 9d95c625-8eff-4d9b-8a80-7b11ecb37f0d · outbound

This paper cites Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication.

Round and Communication Efficient Graph Coloring Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication

Reference 3

Resolution
metadata mismatch
local_arxiv, observed 2026-08-11T14:13:13.866162Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-11T14:13:13.719997Z digest=sha256:b890d228e5f3c9b340fcf64921438ab654cbdcf3b239ecb7121f1492d2848e9c

Observation e040b3b9-e89d-4bcb-be6a-565620df339f · outbound

This paper cites [MK17] Ali Mashreghi and Valerie King.

Round and Communication Efficient Graph Coloring [MK17] Ali Mashreghi and Valerie King

Reference 1992

Resolution
metadata mismatch
raw_fallback, observed 2026-08-11T14:13:13.841040Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-11T14:13:13.725140Z digest=sha256:38b4074d79182bf383e8384b4cabb63c057a45bcf8a6e76b6c3641ebb3333e82

Observation 3fa66c93-2aeb-4c5c-85e9-41d8cd76bcd9 · outbound

This paper cites [CFG+19] Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uit to, and Yufan Zheng.

Round and Communication Efficient Graph Coloring [CFG+19] Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uit to, and Yufan Zheng

Reference 2021

Resolution
unresolved
no resolver link, observed 2026-08-11T14:13:13.706744Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:13:13.706744Z digest=sha256:a0b3a0ca45f82f1e884b9ce016a091af4248c09b376a39abea1f1772d5a6012b

Pith citing papers

Observation e4d6f6a4-aa2b-4837-a75c-6dbce6047e1d · inbound

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries cites this paper.

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries Round and Communication Efficient Graph Coloring

Reference 2020

Resolution
verified exact
local_arxiv, observed 2026-08-16T05:57:35.867996Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-16T05:57:35.815566Z digest=sha256:b9796cd2d4c28d248f97b072036e285590dca1922d5757bc90b6e3fda9b5fce4