{"as_of":"2026-08-06T02:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b186c24d630df3ed2d1c5124abcf278f292538a107420db7d9369ca999ba5cd5","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T05:04:36.137139Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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/2607.22384/citation-record","integrity":"/paper/2607.22384/integrity","json":"/paper/2607.22384/citation-record.json","paper":"/paper/2607.22384"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:04:35.818440Z","title":"Fully dynamic set cover via hypergraph maximal matching: An optimal approximation through a local approach","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.818440Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:d34015d1cdd4914758b35a91fbf2c00b7b6926fc02aa4b1a193a1f59d9218ee9","observation_id":"68381e32-f391-4313-aef0-2e5a5f4a44a6","resolution":{"observed_at":"2026-08-01T05:04:35.818440Z","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-01T05:04:35.829658Z","title":"Fomin, Pierre Fraigniaud, Sylvain Gay, Petr A","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.829658Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:8cf3dca4f3ba0e7fd2f14a6986df786f606c3bac442acd50bbfe77092572a4a5","observation_id":"5a6b7ab7-e546-4576-9b89-f571f0d2f0d5","resolution":{"observed_at":"2026-08-01T05:04:35.829658Z","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-01T05:04:35.835983Z","title":"Dynamic representation of sparse graphs","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.835983Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:ca80da1d27c4e354e3487f49bc9c9cc39970511280cd65df1be8b94d26ebf243","observation_id":"836a39f7-df62-45eb-baf2-7f8fe5c6e0c7","resolution":{"observed_at":"2026-08-01T05:04:35.835983Z","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-01T05:04:35.843301Z","title":"Domination problems in nowhere-dense classes","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.843301Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:71b765c6fb0b8c7fe8a4c4447c4d7f8714b185f60fd7d1e403a1cbf78b8416bf","observation_id":"3b74b086-633d-4b07-b47a-bf7e1d462382","resolution":{"observed_at":"2026-08-01T05:04:35.843301Z","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-01T05:04:35.851649Z","title":"Constant-factor approximation of the domination number in sparse graphs.Euro- pean Journal of Combinatorics, 34(5):833–840, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.851649Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:112e307786ca43d639784add1c8a8c72d0a7f0ae87b487010137090c904f1393","observation_id":"3b68ad9a-7f1c-4d55-a375-bff300097941","resolution":{"observed_at":"2026-08-01T05:04:35.851649Z","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-01T05:04:35.859854Z","title":"Approximation metatheorems for classes with bounded expansion","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.859854Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:2d993bd67b3f33cd1f7f6695bd10c879499ef7c0ffad23740ece030835e6ff44","observation_id":"36746084-e13b-4e08-aa40-796565291a57","resolution":{"observed_at":"2026-08-01T05:04:35.859854Z","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-01T05:04:35.868559Z","title":"Testing first-order properties for subclasses of sparse graphs.Journal of the ACM, 60(5):36:1–36:24, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.868559Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:f470a6c36c561a38bf57b8468139cc5ab39859a5d204dedfcfb327a04d619567","observation_id":"3de4dc32-cee1-4477-b343-3e827f99e02e","resolution":{"observed_at":"2026-08-01T05:04:35.868559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1209.0375","last_updated":"2013-01-03T07:51:02Z","snapshot_observed_at":"2026-07-06T02:54:51.696920Z","submitted_at":"2012-09-03T15:00:41Z","title":"A dynamic data structure for counting subgraphs in sparse graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1209.0375","snapshot_observed_at":"2026-08-01T05:04:35.877363Z","title":"A dynamic data structure for counting subgraphs in sparse graphs","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.877363Z"},"links":{"cited_paper":"/paper/1209.0375","citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:4215c58143eddb298f647c5ecd079db1f53e3bd9e33b9ec4bb9bb6bed210b96d","observation_id":"98791764-b285-4846-ad04-f96f1efad5e5","resolution":{"observed_at":"2026-08-01T05:04:35.877363Z","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-01T05:04:35.887577Z","title":"A dynamic data structure for counting subgraphs in sparse graphs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.887577Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:3f354f5447dd63744b57b9f3ebd3b635e4f2be76a6189617e7ff7d00efc538f2","observation_id":"be46ce87-f1cc-4432-a0e9-64465beba7ed","resolution":{"observed_at":"2026-08-01T05:04:35.887577Z","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-07-06T07:15:10.452888Z","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-01T05:04:35.896532Z","title":"Progressive algo- rithms for domination and independence.CoRR, abs/1811.06799, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.896532Z"},"links":{"cited_paper":"/paper/1811.06799","citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:7f37ef0d624e3cbcf9e0b843191550e401fcddfed589bff83a8bf505354b4be3","observation_id":"4bb41c9c-9c20-4b38-be38-ed96efa71458","resolution":{"observed_at":"2026-08-01T05:04:35.896532Z","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-01T05:04:35.905644Z","title":"Progressive algo- rithms for domination and independence","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.905644Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:d8fe8a9f477715d6e3d33696bb87a9fa1d29fe8a8564459fce794c9ac66e30bb","observation_id":"ed13da17-f3e9-475b-9a1d-c92ea3df7b2f","resolution":{"observed_at":"2026-08-01T05:04:35.905644Z","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-01T05:04:35.914723Z","title":"Methods for algorithmic meta theorems.Model Theoretic Meth- ods in Finite Combinatorics, 558:181–206, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.914723Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:3d60b3dd87c076f757c163ba6f6f9d5ddbff9c8c9d29508d477e92cebd9500eb","observation_id":"9440a19b-dd28-4610-a66e-fb795a1f5443","resolution":{"observed_at":"2026-08-01T05:04:35.914723Z","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-01T05:04:35.923961Z","title":"Deciding first-order properties of nowhere dense graphs.Journal of the ACM, 64(3):17:1–17:32, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.923961Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:2757dd3847b677137213df6e0a6a6448bbb5e85773bd9547c7a4373ab46656dc","observation_id":"ebcc3231-4d17-4c1e-a957-702492f1d632","resolution":{"observed_at":"2026-08-01T05:04:35.923961Z","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-01T05:04:35.933406Z","title":"First-order query evaluation with cardinality conditions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.933406Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:8e6b849d21b97e044127e521c6c2aa49a4de8e25317c06689673c32ad0d0e757","observation_id":"df4acfb8-0e86-4c9f-9ee8-6524ff20aeb6","resolution":{"observed_at":"2026-08-01T05:04:35.933406Z","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-01T05:04:35.942208Z","title":"First-order queries on classes of structures with bounded expan- sion.Logical Methods in Computer Science, 16(1), 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.942208Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:6dd3bfcfb1099f7c7fbefc11438bbb502132a85bbd7e0a83bd2c19eb02e6a3d8","observation_id":"4055f0ea-c0bf-4283-babf-cad6f84e32b4","resolution":{"observed_at":"2026-08-01T05:04:35.942208Z","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-01T05:04:35.950745Z","title":"Oracles for bounded-length shortest paths in planar graphs","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:35.950745Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:b0172c1ac879a5243aecf32faa8332105cb714707756c8da2eecc30e64bb9244","observation_id":"5275069e-6a47-4a29-9964-4bb39944cd90","resolution":{"observed_at":"2026-08-01T05:04:35.950745Z","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-01T05:04:36.057188Z","title":"Minimum dominating set approximation in graphs of bounded arboricity","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:36.057188Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:346c3a20709a7882ec802bbfae488cb1ac386cb419d608865a8a38f8a5ab9d27","observation_id":"3d1cff7d-6a8b-4d33-a14f-d180c3d93d77","resolution":{"observed_at":"2026-08-01T05:04:36.057188Z","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-01T05:04:36.114497Z","title":"Parameterized dynamic data struc- ture for Split Completion","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:36.114497Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:290a7ddf7cfec01e34bf70cd8600027fe43f06910b5d8810a796eb2b7936e7d9","observation_id":"1a809d4b-9ea2-47e0-b46d-32c964e1f6bd","resolution":{"observed_at":"2026-08-01T05:04:36.114497Z","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-01T05:04:36.125347Z","title":"Computing treedepth in polynomial space and linear FPT time","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:36.125347Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:a110487371012a0f6b96fe4500b2481e3e359c2e16d9afd8215aa375d3faddd6","observation_id":"853d3de1-acf5-4a16-b20f-0f72bf3c120b","resolution":{"observed_at":"2026-08-01T05:04:36.125347Z","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-01T05:04:36.127351Z","title":"Grad and classes with bounded expansion II","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:36.127351Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:225aebd6ffeac6d6807cfc16b5894e51307a3c27798e6275368e940577ae3fb2","observation_id":"228d48ef-aa07-4832-b2df-d92169accd3e","resolution":{"observed_at":"2026-08-01T05:04:36.127351Z","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-01T05:04:36.129385Z","title":"Springer, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:36.129385Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:ff663a7f5e500f1f1c4c411a1f2457df8c47040a78a01c09a77327ea9a17db72","observation_id":"514495dd-ba67-4e6e-a0be-8c8ab60e1bc9","resolution":{"observed_at":"2026-08-01T05:04:36.129385Z","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-01T05:04:36.131528Z","title":"Sparsity","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:36.131528Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:27a21296275fd81d21c95bf04307d697e6c3f06bd75ce2c91beacfc1b6e628bd","observation_id":"1fed62a5-70f5-45e1-aefa-7ef8e93f17d7","resolution":{"observed_at":"2026-08-01T05:04:36.131528Z","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-01T05:04:36.133468Z","title":"Parameterized circuit complexity of model-checking on sparse structures","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:36.133468Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:4a0c96733967255605c44174df1896615a897555c0b3b9ca4238a510807b2d5c","observation_id":"8c38ffe0-45b5-410d-9c6f-a4ad317160cd","resolution":{"observed_at":"2026-08-01T05:04:36.133468Z","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-01T05:04:36.135352Z","title":"Enumeration for FO queries over nowhere dense graphs.Journal of the ACM, 69(3):22:1–22:37, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:36.135352Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:2811fb9aefb78ca949c286fd596ef6f31736126fe8c8b2b7ed68ba953c20e42f","observation_id":"648f2aa4-f46b-4cfe-922a-bb200c540ba1","resolution":{"observed_at":"2026-08-01T05:04:36.135352Z","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-01T05:04:36.137139Z","title":"Aggregate queries on sparse databases","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T05:04:36.137139Z"},"links":{"citing_paper":"/paper/2607.22384"},"observation_digest":"sha256:80e844312af047df8da4dc9ec9737c1bb6f4f73fba615f8c6a5fca51613cf3b9","observation_id":"e96cf346-6fc0-4ade-a30c-37a51f5ada6b","resolution":{"observed_at":"2026-08-01T05:04:36.137139Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22384","last_updated":"2026-07-24T15:10:32Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-04T01:50:44.964930Z","submitted_at":"2026-07-24T15:10:32Z","title":"Dynamic domination and independence in sparse graphs"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":25},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2607.22384."}