Paper Citation Record · LEDGER

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries

As of 20 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2504.19729.

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

pith.paper-citation-record.v1
2504.19729 v2

Coverage vector

measured 12 of 12 reference resolution

Typed states for the displayed outbound observations.

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

measured 12 of 12 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 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

12 of 12 outbound references displayed

verified exact1
verified fuzzy9
unresolved2
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation a92bbec7-d5c1-4261-a5f1-31240a838a35 · outbound

This paper cites In Ioana Oriana Bercea and Rasmus Pagh, editors,2025 Symposium on Simplicity in Algorithms, SOSA 2025, New Orleans, LA, USA, January 13-15, 2025 , pages 1–8.

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries In Ioana Oriana Bercea and Rasmus Pagh, editors,2025 Symposium on Simplicity in Algorithms, SOSA 2025, New Orleans, LA, USA, January 13-15, 2025 , pages 1–8

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:35.927071Z

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.

Observation 9361a784-b64f-436b-bbfc-615165706db7 · outbound

This paper cites Halld´ orsson, Fabian Kuhn, Yannic Maus, and Tigran Tonoyan.

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries Halld´ orsson, Fabian Kuhn, Yannic Maus, and Tigran Tonoyan

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:35.875542Z

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.

Observation d3096231-446e-4d48-8296-66a37d6465e5 · outbound

This paper cites Ultrafast Distributed Coloring of High Degree Graphs.

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries Ultrafast Distributed Coloring of High Degree Graphs

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:35.829528Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c9f2abef-5e72-4ee1-93b1-886897ea3094 · outbound

This paper cites (2∆ - l)-edge-coloring is much easier than maximal matching in the distributed setting.

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries (2∆ - l)-edge-coloring is much easier than maximal matching in the distributed setting

Reference 2009

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:35.902195Z

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.

Observation 6e0209fa-b669-41c9-8698-6ffa4dbf570f · outbound

This paper cites Halld´ orsson, Fabian Kuhn, and Alexandre Nolin.

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries Halld´ orsson, Fabian Kuhn, and Alexandre Nolin

Reference 2015

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:35.896262Z

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.

Observation f1181c32-3100-4211-a3bb-0f23d83a5fdd · outbound

This paper cites The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis.

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis

Reference 2018

Resolution: unresolved; no resolver link, observed 2026-08-16T05:57:35.831694Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

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

This paper cites Round and Communication Efficient Graph Coloring.

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.

Observation 1f634430-5c92-4a17-88b9-22463c45fdcf · outbound

This paper cites The complexity of (∆+1) coloring in congested clique, massively parallel computation, and centralized local com- putation.

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries The complexity of (∆+1) coloring in congested clique, massively parallel computation, and centralized local com- putation

Reference 2021

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:35.908964Z

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.

Observation 2f862734-4c59-46d5-abe4-2abd99fb0e81 · outbound

This paper cites Fully dynamic (∆ + 1)-coloring against adaptive adversaries.

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries Fully dynamic (∆ + 1)-coloring against adaptive adversaries

Reference 2022

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:35.915474Z

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.

Observation b8677ca7-494f-4fdc-a7dd-e8ee496bd4bb · outbound

This paper cites Halld´ orsson, Fabian Kuhn, and Alexandre Nolin.

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries Halld´ orsson, Fabian Kuhn, and Alexandre Nolin

Reference 2023

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:35.890174Z

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.

Observation f826e217-efef-44a5-89d7-f1e6798527f3 · outbound

This paper cites (∆+1) vertex coloring in O(n) communication.

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries (∆+1) vertex coloring in O(n) communication

Reference 2024

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:35.882978Z

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.

Observation 8a6ef730-ff18-4152-89b8-86bc9aafe3d6 · outbound

This paper cites Dynamic algorithms for graph coloring.

Faster Dynamic $(\Delta+1)$-Coloring Against Adaptive Adversaries Dynamic algorithms for graph coloring

Reference 2025

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:57:35.921421Z

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.

Pith citing papers

No inbound Pith citation observations are available.