Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-05-17T21:26:29.185866Z
Paper Citation Record · LEDGER
Online Graph Coloring for $k$-Colorable Graphs
As of 11 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 1 inbound Pith citation observation for arXiv:2511.16100.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-05-07T05:52:23.197462Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-05-12T10:31:29.088770Z
Reference resolution
24 of 24 outbound references displayed
- verified exact1
- verified fuzzy23
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation e147791a-7842-4d74-8652-7f2e72627315 · outbound
This paper cites Tight bounds for online coloring of basic graph classes.
Online Graph Coloring for $k$-Colorable Graphs Tight bounds for online coloring of basic graph classes
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.580344Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 6e4fd980-ba03-4d9a-af25-024a83db354a · outbound
This paper cites The nonstochastic multiarmed bandit problem.SIAM journal on computing, 32(1):48–77.
Online Graph Coloring for $k$-Colorable Graphs The nonstochastic multiarmed bandit problem.SIAM journal on computing, 32(1):48–77
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.592669Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 7992a87c-2e63-4eda-8b36-a9f2fe311e79 · outbound
This paper cites Can machine learning be secure? InProceedings of the 2006 ACM Symposium on Information, computer and communications security, pages 16–25.
Online Graph Coloring for $k$-Colorable Graphs Can machine learning be secure? InProceedings of the 2006 ACM Symposium on Information, computer and communications security, pages 16–25
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.577393Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 38fd2c92-875a-4045-bab9-3e4b060bcd4c · outbound
This paper cites Effective coloration.The Journal of Symbolic Logic, 41(2):469–480.
Online Graph Coloring for $k$-Colorable Graphs Effective coloration.The Journal of Symbolic Logic, 41(2):469–480
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.589798Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation da830dcf-fcc5-44dd-9e0c-7f0121d3c0a9 · outbound
This paper cites Online coloring of bipartite graphs with and without advice.Algorithmica, 70(1):92–111.
Online Graph Coloring for $k$-Colorable Graphs Online coloring of bipartite graphs with and without advice.Algorithmica, 70(1):92–111
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.586599Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 4b6e5a4e-b473-4c6e-95dd-8f3e2b41eb4c · outbound
This paper cites Online edge coloring is (nearly) as easy as offline.
Online Graph Coloring for $k$-Colorable Graphs Online edge coloring is (nearly) as easy as offline
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.583579Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation d2d1fc73-6aa4-4982-a965-6a97a4cd70df · outbound
This paper cites Deterministic online bipartite edge coloring.
Online Graph Coloring for $k$-Colorable Graphs Deterministic online bipartite edge coloring
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.573668Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 83ed5364-f906-4ea0-85f4-421f5a570338 · outbound
This paper cites Online Edge Coloring: Sharp Thresholds.
Online Graph Coloring for $k$-Colorable Graphs Online Edge Coloring: Sharp Thresholds
Reference 8
- Resolution
- verified exact
- arxiv_id, observed 2026-05-17T21:30:18.448175Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation ee7191ad-626a-4978-95e8-011eb89e1bb0 · outbound
This paper cites Graph theory and probability.Canadian Journal of Mathematics, 11:34–38.
Online Graph Coloring for $k$-Colorable Graphs Graph theory and probability.Canadian Journal of Mathematics, 11:34–38
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.570660Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation eca86307-e6d5-42af-a115-e3dbc71440fd · outbound
This paper cites Zero knowledge and the chromatic number.Journal of Computer and System Sciences, 57(2):187–199.
Online Graph Coloring for $k$-Colorable Graphs Zero knowledge and the chromatic number.Journal of Computer and System Sciences, 57(2):187–199
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.567455Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 48867e9b-c8d6-4ee8-b7a6-38466537977a · outbound
This paper cites Lower bounds for on-line graph color- ings.
Online Graph Coloring for $k$-Colorable Graphs Lower bounds for on-line graph color- ings
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.564042Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 4232a109-35c2-4c97-bbcc-a0c0a311a137 · outbound
This paper cites On-line and first fit colorings of graphs.Journal of Graph theory, 12(2):217–227.
Online Graph Coloring for $k$-Colorable Graphs On-line and first fit colorings of graphs.Journal of Graph theory, 12(2):217–227
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.560938Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 524e72c3-dc34-4348-84a8-f8f0f8c74373 · outbound
This paper cites Halld´orsson.
Online Graph Coloring for $k$-Colorable Graphs Halld´orsson
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.557779Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 5651e6af-45ee-46e4-a248-9192665a50cf · outbound
This paper cites Parallel and on-line graph coloring.Journal of Algorithms, 23(2):265–280.
Online Graph Coloring for $k$-Colorable Graphs Parallel and on-line graph coloring.Journal of Algorithms, 23(2):265–280
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.554808Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation a54f7918-91a1-4341-b195-24035f235f33 · outbound
This paper cites Lower bounds for on-line graph coloring.SODA ’92, Theoretical Computer Science, 130(1):163–174.
Online Graph Coloring for $k$-Colorable Graphs Lower bounds for on-line graph coloring.SODA ’92, Theoretical Computer Science, 130(1):163–174
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.552045Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 0af6ea92-1046-4ab9-85ea-2143e9921a52 · outbound
This paper cites Coloring inductive graphs on-line.FOCS’90 and Algorithmica, 11:53–72.
Online Graph Coloring for $k$-Colorable Graphs Coloring inductive graphs on-line.FOCS’90 and Algorithmica, 11:53–72
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.549224Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 4667d71f-b062-4232-b029-ed3ea8190814 · outbound
This paper cites Better coloring of 3-colorable graphs.
Online Graph Coloring for $k$-Colorable Graphs Better coloring of 3-colorable graphs
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.545467Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 7349470f-6e40-4a5a-8656-1d8eb713e1ac · outbound
This paper cites On-line coloring k-colorable graphs.Israel Journal of Mathematics, 105:93–104.
Online Graph Coloring for $k$-Colorable Graphs On-line coloring k-colorable graphs.Israel Journal of Mathematics, 105:93–104
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.542443Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation fdbfeb8c-34c7-43f0-9130-a314ef9e02a1 · outbound
This paper cites Coloring graphs on-line.Online algorithms: the state of the art, pages 281–305.
Online Graph Coloring for $k$-Colorable Graphs Coloring graphs on-line.Online algorithms: the state of the art, pages 281–305
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.539237Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 89f16bb7-765b-43ad-822b-d8d92c611aa6 · outbound
This paper cites American Mathematical Society.
Online Graph Coloring for $k$-Colorable Graphs American Mathematical Society
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.535955Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 9f03bbdc-90e6-4ea5-8560-f2a85e77979c · outbound
This paper cites An on-line graph coloring algorithm with sublinear performance ratio.Discrete Mathematics, 75(1-3):319–325.
Online Graph Coloring for $k$-Colorable Graphs An on-line graph coloring algorithm with sublinear performance ratio.Discrete Mathematics, 75(1-3):319–325
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.531168Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 8c74d70c-40c8-4a4b-8b6f-3dc8d1a57097 · outbound
This paper cites Cambridge University Press.
Online Graph Coloring for $k$-Colorable Graphs Cambridge University Press
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.528023Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 9ab0a5c9-a198-4a28-a453-9977cb24d077 · outbound
This paper cites Randomized online graph coloring.FOCS’90 and Journal of algorithms, 13(4):657–669.
Online Graph Coloring for $k$-Colorable Graphs Randomized online graph coloring.FOCS’90 and Journal of algorithms, 13(4):657–669
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.525094Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation e2b8ba22-f360-4588-9664-12ee5c826804 · outbound
This paper cites Probabilistic computations: Toward a unified measure of complexity.
Online Graph Coloring for $k$-Colorable Graphs Probabilistic computations: Toward a unified measure of complexity
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-17T21:32:08.521932Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Pith citing papers
Observation 85a725fa-31a2-4af2-b1e0-3dca5fe048ee · inbound
Online Coloring for Graphs of Large Odd Girth cites this paper.
Online Coloring for Graphs of Large Odd Girth Online Graph Coloring for $k$-Colorable Graphs
Reference 3
- Resolution
- verified exact
- local_arxiv, observed 2026-05-12T10:31:29.090972Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.