{"as_of":"2026-08-22T02:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7fb42d2c296bde8ca6f83f03e6cf5ed4d19e66bd2789f9730ecff090904177cf","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:11:32.759693Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.21675/citation-record","integrity":"/paper/2504.21675/integrity","json":"/paper/2504.21675/citation-record.json","paper":"/paper/2504.21675"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.311478Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.311478Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:d0709d10aedad16d2f53524b72242a319ef24c5fb9708cf8440027d18a0be7c2","observation_id":"e3b68459-1868-478d-9a74-8f403662c152","resolution":{"observed_at":"2026-08-16T05:11:32.311478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/21m1396824","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:33.802091Z","title":"A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs","venue":null,"work_id":"9d815bde-cae7-4195-b88b-00968c970554","year":2022},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.327508Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:4b6252459dd507b610aae88195d735e19acdcfd7de99ec02f8a0de640017adf8","observation_id":"2084389e-9b22-4d6d-9540-5b9ed7a4f6eb","resolution":{"observed_at":"2026-08-16T05:11:33.813729Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ipec.2020.1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:33.766399Z","title":"On the parameterized complexity of clique elimination distance","venue":null,"work_id":"e06f639e-840e-4f7a-8e17-c12b802efe0e","year":2020},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.345310Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:3ac6015fcc393446f7fe348430c4fa4cb60680e1ba425bf094956220f5ed2023","observation_id":"d6435db0-10d2-4c2b-bfd3-569088cfc7d5","resolution":{"observed_at":"2026-08-16T05:11:33.772688Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2024.24","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:34.346019Z","title":"u r Informatik, Schloss Dagstuhl - Leibniz-Zentrum f \\","venue":null,"work_id":"6dea383b-1de8-4b13-81b0-088913c8f37c","year":2024},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.358766Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:3ebf4be71fd0855cac3e056725bda070ae01e9a231aa4b2034166f2e92b7bcd2","observation_id":"c594a337-8c0f-4771-9157-3ecfd7655660","resolution":{"observed_at":"2026-08-16T05:11:34.356220Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.373964Z","title":"Kernelization for graph packing problems via rainbow matching","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.373964Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:296d4595f506713dca924aef30e6e0cf8320bbe30bcff5b719c4b8cb93e6a748","observation_id":"fee73eaa-40c5-43e1-a558-fb6f92182f30","resolution":{"observed_at":"2026-08-16T05:11:32.373964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ipec.2023.7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:33.694398Z","title":"Bodlaender, \\' E douard Bonnet, Lars Jaffke, Dusan Knop, Paloma T","venue":null,"work_id":"5cc2e1df-d2c0-429c-adc8-d5fe7cd03500","year":2023},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.384428Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:78fc9081bfb721da5e286cafa2fabf5e508e298180c2e82ec43b44549ccd4481","observation_id":"e9c20573-034f-4154-8e86-ff7219ce615c","resolution":{"observed_at":"2026-08-16T05:11:33.703851Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.396929Z","title":"Treewidth for graphs with small chordality","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.396929Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:517c63d38c3b0c62835544ed7f6fd0e1ebad77ab51a756499202781e04927f8d","observation_id":"4b2d67bd-23f3-46db-aafc-cadb81354998","resolution":{"observed_at":"2026-08-16T05:11:32.396929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.409486Z","title":"Definability equals recognizability for graphs of bounded treewidth","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.409486Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:e1ccd47ba1886e0486beef7163239ea2204319ad60605aab476ee33868fd76fc","observation_id":"ab7762ea-5645-4318-9f94-c05d432841b7","resolution":{"observed_at":"2026-08-16T05:11:32.409486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.425516Z","title":"Twin-width I : tractable FO model checking","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.425516Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:36bc117deb541b6e4394e7214fd0910d5bbc2af2e7d4ddc07ad78c24871dcb7d","observation_id":"9c024d0f-854f-4d34-bb00-22808a138b63","resolution":{"observed_at":"2026-08-16T05:11:32.425516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.439122Z","title":"Graph isomorphism parameterized by elimination distance to bounded degree","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.439122Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:c185c43669aa42733e16e7f46903bfb5715b48efb5877e461590318269f4494d","observation_id":"7de50cb5-37c7-43e4-8bb1-bd12071f6bd2","resolution":{"observed_at":"2026-08-16T05:11:32.439122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.445789Z","title":"Linear time solvable optimization problems on graphs of bounded clique-width","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.445789Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:2fb8ce435e6633297a8b4f5227b91c47e45f4a1f7c655bb210f93a4c922d5233","observation_id":"98818fb0-1efb-466f-8630-79e997fa33bd","resolution":{"observed_at":"2026-08-16T05:11:32.445789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.455004Z","title":"Randomized contractions meet lean decompositions","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.455004Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:37d98913b1e8aee1edab7b9093ea5204e837b2f884430a7d2a4f3619db16c0d5","observation_id":"d911bec9-244a-49d2-bbf8-704f9f607e4c","resolution":{"observed_at":"2026-08-16T05:11:32.455004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/140988553","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:33.499955Z","title":"Minimum bisection is fixed-parameter tractable","venue":null,"work_id":"619f201a-7050-46de-ba1c-e8d196509dfe","year":2019},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.470615Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:806dd7175d5203293afbf9611eb215c9b445f6da662b18e30558dab2d24e7e8c","observation_id":"136b8338-545b-4595-b10f-f8abbf2a7b87","resolution":{"observed_at":"2026-08-16T05:11:33.513885Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.486028Z","title":"Graph Theory, 4th Edition , volume 173 of Graduate texts in mathematics","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.486028Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:6203774b236ae6704896b014976e563cc491aae773d98c23d91d9fb22585a916","observation_id":"6d806a3c-87e5-42eb-aaeb-d3ab03703790","resolution":{"observed_at":"2026-08-16T05:11:32.486028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.497367Z","title":"Fixed-parameter tractability and completeness II : On completeness for W [1]","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.497367Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:c6200c97792644eb2c9fa0322daa240f0d30aa6a77515940883ed22399e7ad6d","observation_id":"907e3521-aa67-433b-a81d-7e5f1e9b1152","resolution":{"observed_at":"2026-08-16T05:11:32.497367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.18740","last_updated":"2023-11-30T17:38:00Z","snapshot_observed_at":"2026-08-18T05:24:40.805671Z","submitted_at":"2023-11-30T17:38:00Z","title":"First-Order Model Checking on Monadically Stable Graph Classes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.18740","snapshot_observed_at":"2026-08-16T05:11:32.509039Z","title":"First-order model checking on monadically stable graph classes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.509039Z"},"links":{"cited_paper":"/paper/2311.18740","citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:c63c5f9dedd46dd9c326c17d479dbd5f662ce5b324321469a26b59981fc1de6d","observation_id":"a7a34790-885b-4bd2-9ffb-78d47e30503e","resolution":{"observed_at":"2026-08-16T05:11:32.509039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.521839Z","title":"First-order model checking on structurally sparse graph classes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.521839Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:23fd5c44778005cc6382f362851b5f1742d36f30dc25a805c1bfba0b559ae6d9","observation_id":"2205b271-55ec-488f-864a-228e153b9aca","resolution":{"observed_at":"2026-08-16T05:11:32.521839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2024.10352","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:33.987947Z","title":"Sat backdoors: Depth beats size","venue":null,"work_id":"076a9b77-6ca3-41f9-af48-f0560d805183","year":2024},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.535162Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:8ac4badfd858a250d898540df736b4fbd47dd23b0b42a6cee5fc4f892263dfa7","observation_id":"10321dbf-91b5-4afd-a66d-82f451aa5b48","resolution":{"observed_at":"2026-08-16T05:11:34.004275Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.545039Z","title":"New limits to classical and quantum instance compression","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.545039Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:30e847e731be3e1945a31b111dd1871e69bda72adc541cfb9eb3e415ee83a423","observation_id":"63c6ea8e-4b0a-4311-b585-9e3b6c1c1792","resolution":{"observed_at":"2026-08-16T05:11:32.545039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.06799","last_updated":"2018-11-16T13:33:39Z","snapshot_observed_at":"2026-08-14T17:57:50.143855Z","submitted_at":"2018-11-16T13:33:39Z","title":"Progressive Algorithms for Domination and Independence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.06799","snapshot_observed_at":"2026-08-16T05:11:32.551736Z","title":"Progressive algorithms for domination and independence","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.551736Z"},"links":{"cited_paper":"/paper/1811.06799","citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:f0aff6a77e35ee2ed20aa9f4f3ffa9d565eeba16e46c0bc91490e5fda1d2a822","observation_id":"e28eebfc-1822-4759-ae02-13184df37b4e","resolution":{"observed_at":"2026-08-16T05:11:32.551736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.560211Z","title":"On 2-clubs in graph-based data clustering: theory and algorithm engineering","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.560211Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:b7d359587734e572a923a9f9b05ceb95086f460261d6463ea12d85506acb93d0","observation_id":"01dd4f67-a6e4-468f-ac4e-199c3c47cecf","resolution":{"observed_at":"2026-08-16T05:11:32.560211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3517129","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:33.244494Z","title":"Parameterized complexity of elimination distance to first-order logic properties","venue":null,"work_id":"8affbf46-def0-4f55-98b2-2c34736076dd","year":2022},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.574047Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:866bc73360caea459cc613e6e0af57fad8c2ee602978d06796bbb3e62021bd54","observation_id":"b8abec35-c2c9-4898-9356-c1fdbe133cd0","resolution":{"observed_at":"2026-08-16T05:11:33.255425Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:34.293462Z","title":null,"venue":null,"work_id":"dba4657b-e3f6-4c6b-949b-fb73a475ca72","year":1979},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.583766Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:a186a11d987b35dfa4417e103359e94cc8b27cf75e87cce8f56dd98b03ebfaa8","observation_id":"efc0d2c3-ccdb-4396-83e3-7de841899d0f","resolution":{"observed_at":"2026-08-16T05:11:34.300283Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.590708Z","title":"Deciding first-order properties of nowhere dense graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.590708Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:66fc31019c0258aa7224f6879968aaa6c8e408089c2680bc1c8f2f5cb6467729","observation_id":"87cc05bf-82de-41c9-98b9-a025f8a667bd","resolution":{"observed_at":"2026-08-16T05:11:32.590708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-28639-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:33.158733Z","title":"A structural view on parameterizing problems: Distance from triviality","venue":null,"work_id":"866a6a44-d2dd-47ae-8f3b-4ce09757dec5","year":2004},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.611641Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:205d687dc88186e6697d0473d59b70d2740cc6320f4664d61b06d9ff0d3e5af9","observation_id":"1797bd37-6ec0-413e-b2c1-70dab2ecf951","resolution":{"observed_at":"2026-08-16T05:11:33.180172Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/090767285","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:33.125256Z","title":"A more relaxed model for graph-based data clustering: s-plex cluster editing","venue":null,"work_id":"e756f39c-05ad-47f9-a0b5-51bc67dae146","year":2010},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.626530Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:138bc46bc64e34ae8b0f0ba8a84a6295a7ed9afd7a2e3a6843c6eaf522bb5828","observation_id":"270d38d1-1b77-4671-80d8-1a3c0c033f3e","resolution":{"observed_at":"2026-08-16T05:11:33.136506Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.642100Z","title":"Elimination distances, blocking sets, and kernels for vertex cover","venue":null,"work_id":null,"year":1955},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.642100Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:d50d681872ab5b91b3c5ae78eaf5707769dd3905571115afde9d660266053716","observation_id":"3e239ca8-f818-48f3-aff4-a0451c414120","resolution":{"observed_at":"2026-08-16T05:11:32.642100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-29700-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"On editing graphs into 2-club clusters","venue":"Lecture notes in computer science","work_id":"159e444b-d629-4757-805b-2f7ef46d85de","year":2012},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.654428Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:266a597b1c8a69a93cec480ee96b114f692bacc44eda9aa7b610427216891149","observation_id":"0fb198bf-c32b-4d23-ace0-8fcf3a716400","resolution":{"observed_at":"2026-08-16T05:11:33.056114Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.672813Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.672813Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:defee0e7685fe9de3f8bdd37b7563d0476f27c08ab94ad580a6dcbb8921a8efc","observation_id":"213f2db2-cbdc-4b07-ade2-7cd190a2e275","resolution":{"observed_at":"2026-08-16T05:11:32.672813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2021.73","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.967265Z","title":"Recursive backdoors for SAT","venue":null,"work_id":"efbc9430-67d6-4758-a447-ccb3f15135ee","year":2021},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.693181Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:daee5b8e7ed7771909abb2867406cd61cd747ea1e19e88bc2e06d2a0179e97df","observation_id":"41b03cc7-2a44-4363-b56e-5c9473005aec","resolution":{"observed_at":"2026-08-16T05:11:32.978369Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.703341Z","title":"Algorithms and data structures for first-order logic with connectivity under vertex failures","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.703341Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:c0339570a1833337a260b94f0a06a525d1c06568a666fe7e79fa3c549af16841","observation_id":"5b1a8a23-59c7-4661-9b0e-fd88c1b40958","resolution":{"observed_at":"2026-08-16T05:11:32.703341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:34.259334Z","title":"The complexity of optimal elimination trees","venue":null,"work_id":"db2fa052-8779-418d-997f-b57ea2e75ef6","year":1988},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.714653Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:362e6f22169662e057220e1a3ba6a8e5223d2667308e6c27145fa165815a70ef","observation_id":"198e053c-6b4d-450a-a682-b5e1bec41aba","resolution":{"observed_at":"2026-08-16T05:11:34.267062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:11:32.733871Z","title":"First-order logic with connectivity operators","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.733871Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:4bc57f1b8a87504de531d6efd50a8ed490c887f956b3bfb845aa11f08023ca29","observation_id":"e55c513d-1c01-4d94-85e0-5910557c1d4c","resolution":{"observed_at":"2026-08-16T05:11:32.733871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00224-020-10005-w","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"Faster parameterized algorithm for cluster vertex deletion","venue":"Theory of Computing Systems","work_id":"b0465dda-35d4-4646-8111-0e7faf41b44d","year":2021},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.748953Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:069ca5c4c9e102c71e50b6fbb0b9e67efab9841ff5928dd440a7b1a1c466ef3e","observation_id":"cd2346ab-331d-4620-a8fa-5b33ece39636","resolution":{"observed_at":"2026-08-16T05:11:32.883761Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-011-9492-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"Approximation and tidying—a problem kernel for s-plex cluster vertex deletion","venue":"Algorithmica","work_id":"6b003e30-6238-4f91-a42c-36524e548086","year":2012},"citing_paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T05:11:32.759693Z"},"links":{"citing_paper":"/paper/2504.21675"},"observation_digest":"sha256:a5f69bad146920c6a2244fffd59932407bd2911f11a976eacc33a72eee583d96","observation_id":"32c9f5cf-8224-4097-8a10-8b8f01788a22","resolution":{"observed_at":"2026-08-16T05:11:32.847013Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.21675","last_updated":"2025-08-19T10:11:49Z","latest_version":2,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-20T02:06:57.141036Z","submitted_at":"2025-04-30T14:15:41Z","title":"Elimination Distance to Dominated Clusters"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":21,"verified_exact":12,"verified_fuzzy":1},"total_outbound_references":35},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2504.21675."}