Paper Citation Record · LEDGER

Elimination Distance to Dominated Clusters

As of 21 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2504.21675.

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

pith.paper-citation-record.v1
2504.21675 v2

Coverage vector

measured 35 of 35 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T05:11:32.759693Z

measured 35 of 35 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+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

35 of 35 outbound references displayed

verified exact12
verified fuzzy1
unresolved21
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e3b68459-1868-478d-9a74-8f403662c152 · outbound

This paper cites an unresolved cited work.

Elimination Distance to Dominated Clusters Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.311478Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2084389e-9b22-4d6d-9540-5b9ed7a4f6eb · outbound

This paper cites A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs.

Elimination Distance to Dominated Clusters A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs

Reference 2

Resolution: verified exact; doi, observed 2026-08-16T05:11:33.813729Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d6435db0-10d2-4c2b-bfd3-569088cfc7d5 · outbound

This paper cites On the parameterized complexity of clique elimination distance.

Elimination Distance to Dominated Clusters On the parameterized complexity of clique elimination distance

Reference 3

Resolution: verified exact; doi, observed 2026-08-16T05:11:33.772688Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c594a337-8c0f-4771-9157-3ecfd7655660 · outbound

This paper cites u r Informatik, Schloss Dagstuhl - Leibniz-Zentrum f \.

Elimination Distance to Dominated Clusters u r Informatik, Schloss Dagstuhl - Leibniz-Zentrum f \

Reference 4

Resolution: verified exact; doi, observed 2026-08-16T05:11:34.356220Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation fee73eaa-40c5-43e1-a558-fb6f92182f30 · outbound

This paper cites Kernelization for graph packing problems via rainbow matching.

Elimination Distance to Dominated Clusters Kernelization for graph packing problems via rainbow matching

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.373964Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e9c20573-034f-4154-8e86-ff7219ce615c · outbound

This paper cites Bodlaender, \' E douard Bonnet, Lars Jaffke, Dusan Knop, Paloma T.

Elimination Distance to Dominated Clusters Bodlaender, \' E douard Bonnet, Lars Jaffke, Dusan Knop, Paloma T

Reference 6

Resolution: verified exact; doi, observed 2026-08-16T05:11:33.703851Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 4b2d67bd-23f3-46db-aafc-cadb81354998 · outbound

This paper cites Treewidth for graphs with small chordality.

Elimination Distance to Dominated Clusters Treewidth for graphs with small chordality

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.396929Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ab7762ea-5645-4318-9f94-c05d432841b7 · outbound

This paper cites Definability equals recognizability for graphs of bounded treewidth.

Elimination Distance to Dominated Clusters Definability equals recognizability for graphs of bounded treewidth

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.409486Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c024d0f-854f-4d34-bb00-22808a138b63 · outbound

This paper cites Twin-width I : tractable FO model checking.

Elimination Distance to Dominated Clusters Twin-width I : tractable FO model checking

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.425516Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7de50cb5-37c7-43e4-8bb1-bd12071f6bd2 · outbound

This paper cites Graph isomorphism parameterized by elimination distance to bounded degree.

Elimination Distance to Dominated Clusters Graph isomorphism parameterized by elimination distance to bounded degree

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.439122Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98818fb0-1efb-466f-8630-79e997fa33bd · outbound

This paper cites Linear time solvable optimization problems on graphs of bounded clique-width.

Elimination Distance to Dominated Clusters Linear time solvable optimization problems on graphs of bounded clique-width

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.445789Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d911bec9-244a-49d2-bbf8-704f9f607e4c · outbound

This paper cites Randomized contractions meet lean decompositions.

Elimination Distance to Dominated Clusters Randomized contractions meet lean decompositions

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.455004Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 136b8338-545b-4595-b10f-f8abbf2a7b87 · outbound

This paper cites Minimum bisection is fixed-parameter tractable.

Elimination Distance to Dominated Clusters Minimum bisection is fixed-parameter tractable

Reference 13

Resolution: verified exact; doi, observed 2026-08-16T05:11:33.513885Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 6d806a3c-87e5-42eb-aaeb-d3ab03703790 · outbound

This paper cites Graph Theory, 4th Edition , volume 173 of Graduate texts in mathematics.

Elimination Distance to Dominated Clusters Graph Theory, 4th Edition , volume 173 of Graduate texts in mathematics

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.486028Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 907e3521-aa67-433b-a81d-7e5f1e9b1152 · outbound

This paper cites Fixed-parameter tractability and completeness II : On completeness for W [1].

Elimination Distance to Dominated Clusters Fixed-parameter tractability and completeness II : On completeness for W [1]

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.497367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7a34790-885b-4bd2-9ffb-78d47e30503e · outbound

This paper cites First-Order Model Checking on Monadically Stable Graph Classes.

Elimination Distance to Dominated Clusters First-Order Model Checking on Monadically Stable Graph Classes

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.509039Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2205b271-55ec-488f-864a-228e153b9aca · outbound

This paper cites First-order model checking on structurally sparse graph classes.

Elimination Distance to Dominated Clusters First-order model checking on structurally sparse graph classes

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.521839Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 10321dbf-91b5-4afd-a66d-82f451aa5b48 · outbound

This paper cites Sat backdoors: Depth beats size.

Elimination Distance to Dominated Clusters Sat backdoors: Depth beats size

Reference 18

Resolution: metadata mismatch; raw_fallback, observed 2026-08-16T05:11:34.004275Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 63c6ea8e-4b0a-4311-b585-9e3b6c1c1792 · outbound

This paper cites New limits to classical and quantum instance compression.

Elimination Distance to Dominated Clusters New limits to classical and quantum instance compression

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.545039Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e28eebfc-1822-4759-ae02-13184df37b4e · outbound

This paper cites Progressive Algorithms for Domination and Independence.

Elimination Distance to Dominated Clusters Progressive Algorithms for Domination and Independence

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.551736Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 01dd4f67-a6e4-468f-ac4e-199c3c47cecf · outbound

This paper cites On 2-clubs in graph-based data clustering: theory and algorithm engineering.

Elimination Distance to Dominated Clusters On 2-clubs in graph-based data clustering: theory and algorithm engineering

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.560211Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8abec35-c2c9-4898-9356-c1fdbe133cd0 · outbound

This paper cites Parameterized complexity of elimination distance to first-order logic properties.

Elimination Distance to Dominated Clusters Parameterized complexity of elimination distance to first-order logic properties

Reference 22

Resolution: verified exact; doi, observed 2026-08-16T05:11:33.255425Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation efc0d2c3-ccdb-4396-83e3-7de841899d0f · outbound

This paper cites an unresolved cited work.

Elimination Distance to Dominated Clusters Unresolved cited work

Reference 23

Resolution: unresolved; raw_fallback, observed 2026-08-16T05:11:34.300283Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 87cc05bf-82de-41c9-98b9-a025f8a667bd · outbound

This paper cites Deciding first-order properties of nowhere dense graphs.

Elimination Distance to Dominated Clusters Deciding first-order properties of nowhere dense graphs

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.590708Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1797bd37-6ec0-413e-b2c1-70dab2ecf951 · outbound

This paper cites A structural view on parameterizing problems: Distance from triviality.

Elimination Distance to Dominated Clusters A structural view on parameterizing problems: Distance from triviality

Reference 25

Resolution: verified exact; doi, observed 2026-08-16T05:11:33.180172Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 270d38d1-1b77-4671-80d8-1a3c0c033f3e · outbound

This paper cites A more relaxed model for graph-based data clustering: s-plex cluster editing.

Elimination Distance to Dominated Clusters A more relaxed model for graph-based data clustering: s-plex cluster editing

Reference 26

Resolution: verified exact; doi, observed 2026-08-16T05:11:33.136506Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 3e239ca8-f818-48f3-aff4-a0451c414120 · outbound

This paper cites Elimination distances, blocking sets, and kernels for vertex cover.

Elimination Distance to Dominated Clusters Elimination distances, blocking sets, and kernels for vertex cover

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.642100Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0fb198bf-c32b-4d23-ace0-8fcf3a716400 · outbound

This paper cites On editing graphs into 2-club clusters.

Elimination Distance to Dominated Clusters On editing graphs into 2-club clusters

Reference 28

Resolution: verified exact; doi, observed 2026-08-16T05:11:33.056114Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 213f2db2-cbdc-4b07-ade2-7cd190a2e275 · outbound

This paper cites an unresolved cited work.

Elimination Distance to Dominated Clusters Unresolved cited work

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.672813Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41b03cc7-2a44-4363-b56e-5c9473005aec · outbound

This paper cites Recursive backdoors for SAT.

Elimination Distance to Dominated Clusters Recursive backdoors for SAT

Reference 30

Resolution: verified exact; doi, observed 2026-08-16T05:11:32.978369Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5b1a8a23-59c7-4661-9b0e-fd88c1b40958 · outbound

This paper cites Algorithms and data structures for first-order logic with connectivity under vertex failures.

Elimination Distance to Dominated Clusters Algorithms and data structures for first-order logic with connectivity under vertex failures

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.703341Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 198e053c-6b4d-450a-a682-b5e1bec41aba · outbound

This paper cites The complexity of optimal elimination trees.

Elimination Distance to Dominated Clusters The complexity of optimal elimination trees

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T05:11:34.267062Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation e55c513d-1c01-4d94-85e0-5910557c1d4c · outbound

This paper cites First-order logic with connectivity operators.

Elimination Distance to Dominated Clusters First-order logic with connectivity operators

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-16T05:11:32.733871Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd2346ab-331d-4620-a8fa-5b33ece39636 · outbound

This paper cites Faster parameterized algorithm for cluster vertex deletion.

Elimination Distance to Dominated Clusters Faster parameterized algorithm for cluster vertex deletion

Reference 34

Resolution: verified exact; doi, observed 2026-08-16T05:11:32.883761Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 32c9f5cf-8224-4097-8a10-8b8f01788a22 · outbound

This paper cites Approximation and tidying—a problem kernel for s-plex cluster vertex deletion.

Elimination Distance to Dominated Clusters Approximation and tidying—a problem kernel for s-plex cluster vertex deletion

Reference 35

Resolution: verified exact; doi, observed 2026-08-16T05:11:32.847013Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Pith citing papers

No inbound Pith citation observations are available.