Pith. sign in

Paper Citation Record · LEDGER

Strong odd colorings in graph classes of bounded expansion

As of 8 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-07T06:34:17.273281+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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T15:30:55.936290Z digest=sha256:cea0d3de4d05cfb61e96c4b772a938762e05e2df009e8e0733a24bf6e9236d54

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T15:30:56.019632Z digest=sha256:bf954b5d43d815fc09427343aa6dbbb52b8c93d9cd6710b81e454b94cb5730da

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T15:30:56.084650Z digest=sha256:e1fb06f145ed1edc11a257db28e317237642a93d4b3347f07093e3e54c233222

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T15:30:56.120424Z digest=sha256:2177ecebe34adb4cd00a1978949e7f8981c862e6675773c6ad5f6b0a4b10ab98

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.

source=pdf_text observed=2026-08-07T15:30:56.185369Z digest=sha256:0d3e2cbb6bdcc572597e50416d0ea4eba19266797afa022d89705862b735aaaf

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.

source=pdf_text observed=2026-08-07T15:30:56.264627Z digest=sha256:67f27747d3c3d1b434c464527ef58e35b3ba6eadd2e09f53e0b46adb9fef4faf

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T15:30:56.327791Z digest=sha256:e4b447d7c683b41f0c1676fd7c9a4f0f74333a82bc4d653b35c12ccaab8aa449

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T15:30:56.413081Z digest=sha256:3c05a2d1e15912ad35c3b4844c16176f6f4992f4a252b0037a4d1130bd35f463

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T15:30:56.485370Z digest=sha256:a408c8d3762d188d129554b28ed3f119eb1aad49351255cbee8c14116d7bfb1e

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T15:30:56.585355Z digest=sha256:99fe4486848792a800d1a8e0593a787a3455113b86b99730e9549d3c0c07e915

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T15:30:56.646828Z digest=sha256:ffe3c01c99d4cf95ed5b1d8a132c3a3ebc52c083a0d5ec99dcb570bd22e091ca

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.

source=pdf_text observed=2026-08-07T15:30:56.716593Z digest=sha256:22f74e0d7ec11e2ac0dbd166e60868ca668ac4510de292a9728ff6b7c6f4f473

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T15:30:56.818221Z digest=sha256:2ad343b28e376bb848aa9d6fc695ae971c8c8b994e6b03ec48adfbae4bd21c57

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.

source=pdf_text observed=2026-08-07T15:30:56.908271Z digest=sha256:3153c31aefbfec9990ae2b1596156cfe962627daa3f5fdc5cb417fb8b54625a8

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.

source=pdf_text observed=2026-08-07T15:30:56.983686Z digest=sha256:63e1901d8a5caab25808d8629fc26aa75d39a17b72a7deb5059f6ef64613a445

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-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T15:30:57.086970Z digest=sha256:9f5aca293391a33995af88f3dc4df33299d35c3bd0d09296ee93dd09193658de

Pith citing papers

No inbound Pith citation observations are available.