Pith. sign in

Paper Citation Record · LEDGER

Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2002.10142.

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

pith.paper-citation-record.v1
2002.10142 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T19:23:34.476170Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-06T19:23:36.447036Z

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 51e0c308-f012-4a54-816c-6075fd6e49d6 · inbound

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees cites this paper.

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity

Reference 25

Resolution
verified exact
local_arxiv, observed 2026-08-06T19:23:36.540971Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-06T19:23:34.476170Z digest=sha256:959fdbb0853129426e4ff26447f1ec11f9016d543a4e920e39ba2c7d65a55123

Observation 3f76172b-6e5c-4567-a8c6-733d988a92a1 · inbound

Differentially Private Graph Coloring cites this paper.

Differentially Private Graph Coloring Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-02T23:39:19.467664Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T23:39:19.467664Z digest=sha256:0b1e014b7314fd3ff50fd078a3e49816f53afc04d77e8d16a9e15b721720f82e

Observation 80f39782-b63f-4fbd-9844-ac9e00046e94 · inbound

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation cites this paper.

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-02T22:27:03.567174Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T22:27:03.567174Z digest=sha256:2417c7931e79ba3dd3277bcf3ed738b335d018100d72df260254dc81bc750e1c