Paper Citation Record · LEDGER

Dynamic domination and independence in sparse graphs

As of 9 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2607.22384.

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

pith.paper-citation-record.v1
2607.22384 v1

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T05:04:36.137139Z

measured 25 of 25 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+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

25 of 25 outbound references displayed

verified exact0
verified fuzzy0
unresolved24
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 68381e32-f391-4313-aef0-2e5a5f4a44a6 · outbound

This paper cites Fully dynamic set cover via hypergraph maximal matching: An optimal approximation through a local approach.

Dynamic domination and independence in sparse graphs Fully dynamic set cover via hypergraph maximal matching: An optimal approximation through a local approach

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.818440Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5a6b7ab7-e546-4576-9b89-f571f0d2f0d5 · outbound

This paper cites Fomin, Pierre Fraigniaud, Sylvain Gay, Petr A.

Dynamic domination and independence in sparse graphs Fomin, Pierre Fraigniaud, Sylvain Gay, Petr A

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.829658Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 836a39f7-df62-45eb-baf2-7f8fe5c6e0c7 · outbound

This paper cites Dynamic representation of sparse graphs.

Dynamic domination and independence in sparse graphs Dynamic representation of sparse graphs

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.835983Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b74b086-633d-4b07-b47a-bf7e1d462382 · outbound

This paper cites Domination problems in nowhere-dense classes.

Dynamic domination and independence in sparse graphs Domination problems in nowhere-dense classes

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.843301Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b68ad9a-7f1c-4d55-a375-bff300097941 · outbound

This paper cites Constant-factor approximation of the domination number in sparse graphs.Euro- pean Journal of Combinatorics, 34(5):833–840, 2013.

Dynamic domination and independence in sparse graphs Constant-factor approximation of the domination number in sparse graphs.Euro- pean Journal of Combinatorics, 34(5):833–840, 2013

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.851649Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36746084-e13b-4e08-aa40-796565291a57 · outbound

This paper cites Approximation metatheorems for classes with bounded expansion.

Dynamic domination and independence in sparse graphs Approximation metatheorems for classes with bounded expansion

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.859854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3de4dc32-cee1-4477-b343-3e827f99e02e · outbound

This paper cites Testing first-order properties for subclasses of sparse graphs.Journal of the ACM, 60(5):36:1–36:24, 2013.

Dynamic domination and independence in sparse graphs Testing first-order properties for subclasses of sparse graphs.Journal of the ACM, 60(5):36:1–36:24, 2013

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.868559Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98791764-b285-4846-ad04-f96f1efad5e5 · outbound

This paper cites A dynamic data structure for counting subgraphs in sparse graphs.

Dynamic domination and independence in sparse graphs A dynamic data structure for counting subgraphs in sparse graphs

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.877363Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be46ce87-f1cc-4432-a0e9-64465beba7ed · outbound

This paper cites A dynamic data structure for counting subgraphs in sparse graphs.

Dynamic domination and independence in sparse graphs A dynamic data structure for counting subgraphs in sparse graphs

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.887577Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4bb41c9c-9c20-4b38-be38-ed96efa71458 · outbound

This paper cites Progressive Algorithms for Domination and Independence.

Dynamic domination and independence in sparse graphs Progressive Algorithms for Domination and Independence

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.896532Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed13da17-f3e9-475b-9a1d-c92ea3df7b2f · outbound

This paper cites Progressive algo- rithms for domination and independence.

Dynamic domination and independence in sparse graphs Progressive algo- rithms for domination and independence

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.905644Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9440a19b-dd28-4610-a66e-fb795a1f5443 · outbound

This paper cites Methods for algorithmic meta theorems.Model Theoretic Meth- ods in Finite Combinatorics, 558:181–206, 2011.

Dynamic domination and independence in sparse graphs Methods for algorithmic meta theorems.Model Theoretic Meth- ods in Finite Combinatorics, 558:181–206, 2011

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.914723Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ebcc3231-4d17-4c1e-a957-702492f1d632 · outbound

This paper cites Deciding first-order properties of nowhere dense graphs.Journal of the ACM, 64(3):17:1–17:32, 2017.

Dynamic domination and independence in sparse graphs Deciding first-order properties of nowhere dense graphs.Journal of the ACM, 64(3):17:1–17:32, 2017

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.923961Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df4acfb8-0e86-4c9f-9ee8-6524ff20aeb6 · outbound

This paper cites First-order query evaluation with cardinality conditions.

Dynamic domination and independence in sparse graphs First-order query evaluation with cardinality conditions

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.933406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4055f0ea-c0bf-4283-babf-cad6f84e32b4 · outbound

This paper cites First-order queries on classes of structures with bounded expan- sion.Logical Methods in Computer Science, 16(1), 2020.

Dynamic domination and independence in sparse graphs First-order queries on classes of structures with bounded expan- sion.Logical Methods in Computer Science, 16(1), 2020

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.942208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5275069e-6a47-4a29-9964-4bb39944cd90 · outbound

This paper cites Oracles for bounded-length shortest paths in planar graphs.

Dynamic domination and independence in sparse graphs Oracles for bounded-length shortest paths in planar graphs

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:35.950745Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3d1cff7d-6a8b-4d33-a14f-d180c3d93d77 · outbound

This paper cites Minimum dominating set approximation in graphs of bounded arboricity.

Dynamic domination and independence in sparse graphs Minimum dominating set approximation in graphs of bounded arboricity

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:36.057188Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1a809d4b-9ea2-47e0-b46d-32c964e1f6bd · outbound

This paper cites Parameterized dynamic data struc- ture for Split Completion.

Dynamic domination and independence in sparse graphs Parameterized dynamic data struc- ture for Split Completion

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:36.114497Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 853d3de1-acf5-4a16-b20f-0f72bf3c120b · outbound

This paper cites Computing treedepth in polynomial space and linear FPT time.

Dynamic domination and independence in sparse graphs Computing treedepth in polynomial space and linear FPT time

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:36.125347Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 228d48ef-aa07-4832-b2df-d92169accd3e · outbound

This paper cites Grad and classes with bounded expansion II.

Dynamic domination and independence in sparse graphs Grad and classes with bounded expansion II

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:36.127351Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 514495dd-ba67-4e6e-a0be-8c8ab60e1bc9 · outbound

This paper cites Springer, 2012.

Dynamic domination and independence in sparse graphs Springer, 2012

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:36.129385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1fed62a5-70f5-45e1-aefa-7ef8e93f17d7 · outbound

This paper cites Sparsity.

Dynamic domination and independence in sparse graphs Sparsity

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:36.131528Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c38ffe0-45b5-410d-9c6f-a4ad317160cd · outbound

This paper cites Parameterized circuit complexity of model-checking on sparse structures.

Dynamic domination and independence in sparse graphs Parameterized circuit complexity of model-checking on sparse structures

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:36.133468Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 648f2aa4-f46b-4cfe-922a-bb200c540ba1 · outbound

This paper cites Enumeration for FO queries over nowhere dense graphs.Journal of the ACM, 69(3):22:1–22:37, 2022.

Dynamic domination and independence in sparse graphs Enumeration for FO queries over nowhere dense graphs.Journal of the ACM, 69(3):22:1–22:37, 2022

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T05:04:36.135352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e96cf346-6fc0-4ade-a30c-37a51f5ada6b · outbound

This paper cites Aggregate queries on sparse databases.

Dynamic domination and independence in sparse graphs Aggregate queries on sparse databases

Reference 25

Resolution: malformed identifier; no resolver link, observed 2026-08-01T05:04:36.137139Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.