Paper Citation Record · LEDGER

Strong odd colorings in graph classes of bounded expansion

As of 11 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2505.15288.

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

pith.paper-citation-record.v1
2505.15288 v1

Coverage vector

measured 16 of 16 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T15:30:57.086970Z

measured 16 of 16 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+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

16 of 16 outbound references displayed

verified exact3
verified fuzzy8
unresolved5
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation eb3fddd1-2b1a-4fc2-bea2-7398d4d074e5 · outbound

This paper cites Interpreting nowhere dense graph classes as a classical notion of model theory.

Strong odd colorings in graph classes of bounded expansion Interpreting nowhere dense graph classes as a classical notion of model theory

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:30:59.184874Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 8c6851fa-f0b6-4683-95b4-57b8f0642981 · outbound

This paper cites On strong odd colorings of graphs.

Strong odd colorings in graph classes of bounded expansion On strong odd colorings of graphs

Reference 2

Resolution: verified exact; local_arxiv, observed 2026-08-07T15:30:57.519762Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 31547353-d7c8-47fd-9666-2a025ae448f6 · outbound

This paper cites Seymour, and Peter Winkler.

Strong odd colorings in graph classes of bounded expansion Seymour, and Peter Winkler

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:30:59.115302Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation f8766918-b3e5-4fe3-8dac-9461ca9895f5 · outbound

This paper cites Progressive al- gorithms for domination and independence.

Strong odd colorings in graph classes of bounded expansion Progressive al- gorithms for domination and independence

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:30:58.885806Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 627581df-44e4-4e26-b73c-6f16a52b64a0 · outbound

This paper cites First-order interpretations of bounded expansion classes.

Strong odd colorings in graph classes of bounded expansion First-order interpretations of bounded expansion classes

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-07T15:30:56.185369Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2904ad2-f826-4eb6-b6a4-fc63ae2f2f83 · outbound

This paper cites Shrub- depth: Capturing height of dense graphs.

Strong odd colorings in graph classes of bounded expansion Shrub- depth: Capturing height of dense graphs

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-07T15:30:56.264627Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 443f7cbb-145b-4329-af4d-caea722dc7c4 · outbound

This paper cites Strong odd coloring in minor-closed classes.

Strong odd colorings in graph classes of bounded expansion Strong odd coloring in minor-closed classes

Reference 7

Resolution: verified exact; local_arxiv, observed 2026-08-07T15:30:57.383055Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 7f25c2fd-40de-47d7-9065-b6ebbc2569e9 · outbound

This paper cites Odd colourings, conflict-free colourings and strong colouring numbers.

Strong odd colorings in graph classes of bounded expansion Odd colourings, conflict-free colourings and strong colouring numbers

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:30:58.666916Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation baa221ba-af54-45fb-8f66-a8b5c4d296b9 · outbound

This paper cites Strong odd coloring of sparse graphs.

Strong odd colorings in graph classes of bounded expansion Strong odd coloring of sparse graphs

Reference 9

Resolution: verified exact; local_arxiv, observed 2026-08-07T15:30:57.222310Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation c884adbb-ac54-41d9-857c-ece8065edfaf · outbound

This paper cites Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth.

Strong odd colorings in graph classes of bounded expansion Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:30:58.397266Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation fb90e341-5f62-43b1-9150-fb3c6da4d5ca · outbound

This paper cites On nowhere dense graphs.

Strong odd colorings in graph classes of bounded expansion On nowhere dense graphs

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:30:58.072833Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 5ca09a3a-9e69-4502-b974-34e83e751bc6 · outbound

This paper cites Sparsity — Graphs, Structures, and Algorithms , vol- ume 28 of Algorithms and combinatorics.

Strong odd colorings in graph classes of bounded expansion Sparsity — Graphs, Structures, and Algorithms , vol- ume 28 of Algorithms and combinatorics

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-07T15:30:56.716593Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dcbc4c09-55a6-4078-a159-ce54f5555399 · outbound

This paper cites Clustering powers of sparse graphs.

Strong odd colorings in graph classes of bounded expansion Clustering powers of sparse graphs

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:30:57.786620Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 2ea7a323-b867-44be-86d0-366c3f4b0ac7 · outbound

This paper cites Sparsity.

Strong odd colorings in graph classes of bounded expansion Sparsity

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-07T15:30:56.908271Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 40c2f002-05bc-459f-99c3-1c8fb7f223f0 · outbound

This paper cites Graph classes through the lens of logic.

Strong odd colorings in graph classes of bounded expansion Graph classes through the lens of logic

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-07T15:30:56.983686Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation db2c75fb-56a8-4bdf-9c25-1df175f21e63 · outbound

This paper cites Kernelization and approximation of distance-r independent sets on nowhere dense graphs.

Strong odd colorings in graph classes of bounded expansion Kernelization and approximation of distance-r independent sets on nowhere dense graphs

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:30:57.676448Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Pith citing papers

No inbound Pith citation observations are available.