{"as_of":"2026-08-04T22:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:240c6aaa933aef98da203cc4a217a40e6ca8ddcfdbb7e8bf3f6041cc2aeaa164","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-23T04:31:59.019614Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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/2502.01400/citation-record","integrity":"/paper/2502.01400/integrity","json":"/paper/2502.01400/citation-record.json","paper":"/paper/2502.01400"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-38906-1_8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dominator coloring and CD coloring in almost cluster graphs","venue":null,"work_id":"a717e72a-8f76-4f4f-b634-8d1375075b0f","year":2023},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:abd3af61dd28e78990bd0b00f6f7d109924cab81ca418913954bae63234f7e79","observation_id":"c29974e0-b61a-4587-9113-f40802ae2e4b","resolution":{"observed_at":"2026-05-23T04:32:31.355892Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ipec.2022.5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension","venue":null,"work_id":"c9bd5546-f513-4bb1-8a6c-8ccfc510318e","year":2022},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:1ac97d005763b1dcc05c2a71039a482caf91921f3c9eb36ec1de7b0ddcd1a0c4","observation_id":"9e64dfd5-6c33-45a5-9338-84e25786fcb5","resolution":{"observed_at":"2026-05-23T04:32:31.350481Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/cbo9780511977619","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T06:04:34.544398Z","title":"Graph structure and monadic second-order logic, a language theoretic approach, Cambridge University Press","venue":null,"work_id":"82e59507-0041-4ad0-af1b-e93e2833fcf2","year":2012},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:a6003c908d19b6614a23702b2dbcea5c349680e3f3585fb179bf7ad64a93996a","observation_id":"2e14dfc1-8e59-494b-be80-b16a9a621e4d","resolution":{"observed_at":"2026-05-23T04:32:31.415339Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-10T19:49:13.659793+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T19:49:13.659793+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s002249910009","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T06:04:34.565758Z","title":"Makowsky, and Udi Rotics","venue":null,"work_id":"ae7b5a1b-0cca-413f-a366-73f0f44e886b","year":2000},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:880a232cbcd6263a6fcb3c6cd4cc22472821eee8a2e4f1cfa7dc34ab06b96737","observation_id":"3d5d9b12-89c3-4293-8f28-8258f937b490","resolution":{"observed_at":"2026-05-23T04:32:31.379040Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-10T19:49:13.918945+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-10T19:49:13.918945+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ipec.2023.21","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"o hler, Nikolaos Melissinos, and Manolis Vasilakis. Bandwidth Parameterized by Cluster Vertex Deletion Number . In Neeldhara Misra and Magnus Wahlstr\\","venue":null,"work_id":"79805501-44eb-4233-99f3-ff29988bb4ef","year":2023},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:5b315f57b2665ae61a5ffd7b8f4ccc8aab94606fffc030e0452a052066c0aaf8","observation_id":"5077987a-3343-42bc-86ee-eeb028255c0f","resolution":{"observed_at":"2026-05-23T04:32:31.362047Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-023-01161-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T17:29:38.328543Z","title":"Extended MSO model checking via small vertex integrity","venue":null,"work_id":"5ac1165d-2b16-4acb-9a1e-8513a2b80e5f","year":2016},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:0f88a350495c2c67e8b293b621472631afece542c805e2bb6e4bf4f0dce098b2","observation_id":"e7e99c61-9b67-451e-a6c4-5266afa4aadb","resolution":{"observed_at":"2026-05-23T04:32:31.454853Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2023.59","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T04:46:45.760400Z","title":"Tight algorithms for connectivity problems parameterized by clique-width","venue":null,"work_id":"8bd076b1-4dcf-4530-9150-c953b9045634","year":2023},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:d2d0e0774407a3c359664e9c675b98b1fd07ae5d54bdaf491bcc2bb1ccbbf311","observation_id":"3237723a-7c85-4d42-bf52-26ab5e89dd5e","resolution":{"observed_at":"2026-05-23T04:32:31.444085Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-17T22:51:09.565937+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T22:51:09.565937+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2024.105261","doi":"10.1016/j.ic.2024.105261","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Fixed-parameter algorithms for fair hitting set problems","venue":null,"work_id":"a345a76d-646e-4450-a519-8e324cc09c75","year":2025},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:61718d7c724c649ac0bcc595984c1c75fc1bc303b019bf7c5acb11e7963d3436","observation_id":"7f4408a4-78a3-41ec-9b16-7b8f84571b70","resolution":{"observed_at":"2026-05-23T04:32:31.370343Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-27051-2_31","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Italiano, Athanasios L","venue":null,"work_id":"c509eaea-ece3-46a6-b58c-ec3381430a39","year":2023},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:cdeaafbf4cf42c01875be3dd0dd9c99803fc6e93e8d9c9d3d0ba1f7ac683ecb4","observation_id":"4ace4398-12a2-4230-869f-46c3644dc204","resolution":{"observed_at":"2026-05-23T04:32:31.393675Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-26176-4_27","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deconstructing parameterized hardness of fair vertex deletion problems","venue":null,"work_id":"0e88eb18-fb32-4168-bb2f-eb605b79439a","year":2019},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:0bf33aaab22b5b32a1158a2b33ec4640a7d75f7ef1f0845b9cf94ff99ba5502b","observation_id":"fb8d3d1f-de35-46fe-90d6-7e93c7af888d","resolution":{"observed_at":"2026-05-23T04:32:31.409097Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2012.04.004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T22:23:59.673882Z","title":"Bin packing with fixed number of bins revisited","venue":null,"work_id":"35b36b3f-28cb-41dc-8538-6d69b93868d4","year":2013},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:0431e60f391ab01dec0ae5c43dd428816092cca7ccf86187349e1daaab5e8609","observation_id":"bf08456f-219b-4874-a933-2fd9a17e2538","resolution":{"observed_at":"2026-05-23T04:32:31.431097Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2021.03.008","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parameterized complexity of fair feedback vertex set problem","venue":null,"work_id":"073098da-412b-4917-9f9e-3982a01c52e8","year":2021},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:05a145b096610e806f37c27029f374967ec0b686c99566eb5a183cf36c136e03","observation_id":"24c83f81-fafe-4b0d-8b6e-401017ca2420","resolution":{"observed_at":"2026-05-23T04:32:31.339195Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2021.106118","doi":"10.1016/j.ipl.2021.106118","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Local linear set on graphs with bounded twin cover number","venue":null,"work_id":"340cd935-3f40-4e66-b810-74317c103aa6","year":2021},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:0be5baeb535e9637779502ce19626b15549710d6bdf557415631843c3cd159d8","observation_id":"fe682899-226e-4756-b788-78de53511cc7","resolution":{"observed_at":"2026-05-23T04:32:31.438599Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.23638/lmcs-15(4:12)2019","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity","venue":null,"work_id":"ac818a66-00cd-4139-a3e9-74c56f2ed3ab","year":2019},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:2c390db6b0f87e9d234d2f9e3731b965d4942a92122802ad935b0bf359448fff","observation_id":"0aa22a6d-0277-4517-8f84-8e1a9905a522","resolution":{"observed_at":"2026-05-23T04:32:31.425432Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.06878","last_updated":"2020-06-09T10:56:41Z","snapshot_observed_at":"2026-07-06T06:29:01.762510Z","submitted_at":"2018-03-19T11:49:02Z","title":"Parameterized Complexity of Fair Vertex Evaluation Problems","version":4},"cited_work":{"arxiv_id":"1803.06878","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1803.06878","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parameterized complexity of fair vertex evaluation problems","venue":null,"work_id":"3e997085-3293-429d-ae88-902b54b01ced","year":2018},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"cited_paper":"/paper/1803.06878","citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:d756ecfb513f700aaa67e0789bf29f19cbc7d0c5e660b75f7f3bf948619213b0","observation_id":"76a1bca9-2dfd-432c-83ce-29edb8f53c5e","resolution":{"observed_at":"2026-05-23T04:32:32.445119Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.mfcs.2019.33","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parameterized complexity of fair vertex evaluation problems","venue":null,"work_id":"a4e1f558-a6e6-41cc-b2b6-8819916b4284","year":2019},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:465853ab72b5aa02b0e7721535f3d779d819b750157eb08906b4dd441e0edb5f","observation_id":"70ef74d7-ba9a-47b7-87b4-aaef02c62de4","resolution":{"observed_at":"2026-05-23T04:32:31.403775Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Fair edge deletion problems on treedecomposable graphs and improper colorings","venue":null,"work_id":"8b4b2cda-7df9-40b9-a9b9-79d2d3084240","year":2010},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:b05b6ffd03d99ebdb8a0da6b2238532b61df046008afcf5e17406e9855161415","observation_id":"a8b922ce-b6a0-4139-b0ff-d4c266aa042f","resolution":{"observed_at":"2026-05-23T04:37:32.728755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"On minimum fair odd cycle transversal","venue":null,"work_id":"49c3d7e0-a98a-4f09-8433-8b3f78995202","year":2010},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:35e8f761df43674913c79d965dd0a1f4ce8d0df9768f60517d8589a04f120898","observation_id":"8eb64e97-e194-4e8c-8673-dc03adacb62e","resolution":{"observed_at":"2026-05-23T04:37:32.732091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-022-01006-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Minimum eccentricity shortest path problem with respect to structural parameters","venue":null,"work_id":"c7258a8e-f4a9-484f-9a11-46c1d8141f8b","year":2023},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:c95db54022d7436dabd6716c3fa2a8bf45a85e7c15b331d5afd6342db8176562","observation_id":"5dddc435-ec8e-47cc-be7f-647c89a46fda","resolution":{"observed_at":"2026-05-23T04:32:31.449155Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-011-9554-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T04:17:36.499683Z","title":"Algorithmic meta-theorems for restrictions of treewidth","venue":null,"work_id":"1acc048f-ef70-471b-a363-470c82cbb010","year":2012},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:96146d7d43259a32555344049c8fc5bb17a7d31d0c469b90f16e048f556767ff","observation_id":"d79c4bb2-2385-4f1e-af01-6ff16d2f8440","resolution":{"observed_at":"2026-05-23T04:32:31.420260Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2168/lmcs-10(1:18)2014","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T04:17:36.579582Z","title":"Model checking lower bounds for simple graphs","venue":null,"work_id":"153777c0-f378-4501-a368-8ac9d482c67e","year":2014},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:7c444689e346ad1feb382dc7ef90a7318b9fa766948477d7c129b690d95b493d","observation_id":"1a61468a-68f5-4b51-91d4-6b5e4ed6f323","resolution":{"observed_at":"2026-05-23T04:32:31.318707Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/moor.8.4.538","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lenstra, Jr","venue":null,"work_id":"166f0cdb-4154-4d8d-8f8f-01c3c2bbbc7f","year":1983},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:bcee4cc87cdc9fc9ec7190728129b91fdcfc8059ebdcf1e4fd9efd5b2d34b869","observation_id":"726d1b3e-befc-428d-9f66-6ec4b918023c","resolution":{"observed_at":"2026-05-23T04:32:31.344548Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-13T18:50:47.890599+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T18:50:47.890599+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/12.24280","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fair edge deletion problems","venue":null,"work_id":"81d3cde0-3e63-4c7e-8e7f-8f14c239f1b8","year":1989},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:85aaf5b59a56fc30f6e518d03d3d7f1ac969df83c00bce36643e80afd7e7784f","observation_id":"09b81933-492b-4960-ab48-af17a3bf877c","resolution":{"observed_at":"2026-05-23T04:32:31.304262Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2019.06.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parameterized complexity of fair deletion problems","venue":null,"work_id":"3bc0ae81-9681-46a4-9de9-0292ba7ad695","year":2020},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:28c66dc3409ffa0c3edf3ceca9cd81cdf10770a88100a106fe37fecdb9a1e7f1","observation_id":"c33e35dd-2c39-4738-8220-31df625e7011","resolution":{"observed_at":"2026-05-23T04:32:31.385095Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7990.2023","doi":"10.1109/focs57990.2023.00008","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages =","venue":null,"work_id":"a54acb03-1df1-4af5-8acf-770716891711","year":2023},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:184f1ccb8c5bad01cf7297dd23183b85115febb65bf78f6d655c4ac6321f17ab","observation_id":"de76a7b7-7fbd-46cf-b6a9-6efd0a4da8fe","resolution":{"observed_at":"2026-05-23T04:32:31.332822Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7714.187771","doi":"10.1145/1877714.1877718","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Monadic second order logic on graphs with local cardinality constraints","venue":null,"work_id":"31234878-4362-4a76-85d4-464500aab3e0","year":2011},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:8eb15f598c702ad1a9b2255b7ae6c1925d72f29b520aa033f9b45b981a27ea4c","observation_id":"5a2afa55-ab27-4a90-be52-3341bdd97edc","resolution":{"observed_at":"2026-05-23T04:32:31.290202Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Complexity of domination-type problems in graphs","venue":null,"work_id":"a7d49782-8470-481b-984e-48aa192e3165","year":1994},"citing_paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-23T04:31:59.019614Z"},"links":{"citing_paper":"/paper/2502.01400"},"observation_digest":"sha256:ad85503706a79a4fc4c1a9a11c52a2ea1d6df0ba0fb73676b880ef2e517c6996","observation_id":"f7949b93-6ba6-4dac-b1c8-219053b656f3","resolution":{"observed_at":"2026-05-23T04:37:32.735202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.01400","last_updated":"2026-04-24T23:08:06Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T20:30:17.578339Z","submitted_at":"2025-02-03T14:31:37Z","title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":23,"verified_fuzzy":3},"total_outbound_references":27},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2502.01400."}