{"as_of":"2026-08-14T07:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0a0fa874bfdeb791b6559436ddb3b6ed73b7d070c50e69d609bd8047283af856","coverage":[{"denominator":79,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":79,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T22:07:38.591554Z","state":"measured"},{"denominator":79,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":79,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/1907.05940/citation-record","integrity":"/paper/1907.05940/integrity","json":"/paper/1907.05940/citation-record.json","paper":"/paper/1907.05940"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-011-9563-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fomin, Ignasi Sau, and Dimitrios M","venue":"Algorithmica","work_id":"ef91f7b3-8d8d-47f9-854b-2cdb56dfd2b7","year":2012},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:fcbf536632f463a711a00e1df28ed5692cb7ce20f99b5fa0d793e219a7cc1175","observation_id":"46a754f0-0363-452c-94b7-d0b91d0d6f2e","resolution":{"observed_at":"2026-05-24T22:10:00.386268Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7082.134715","doi":"10.5555/1347082.1347153","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Computing excluded minors","venue":null,"work_id":"1c875d12-8f23-409d-9f6d-93907490255a","year":2008},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:16f061ba24845050dc652f2ae17064f05d0fa7249fc9a98155064230e47f22d2","observation_id":"5cf8b4cf-0e8e-4aae-a025-7397ae75248a","resolution":{"observed_at":"2026-05-24T22:10:00.373209Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jctb.2016.10.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M","venue":"Journal of Combinatorial Theory Series B","work_id":"45831bc1-a300-479e-9148-01aa89cc17c2","year":2017},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:a7d0df18df044401f6d3e501975854b2c9faa5f35b1464a6a2a7225cc17b4bb4","observation_id":"0ed63e6f-5436-4554-963f-c9b0ef387f79","resolution":{"observed_at":"2026-05-24T22:10:00.214887Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-20T23:22:17.240103+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T23:22:17.240103+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jctb.2018.12.008","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Alowerboundonthetree-widthofgraphswithirrelevantvertices","venue":"Journal of Combinatorial Theory Series B","work_id":"167a0d86-3869-4fb1-908b-173c27289d43","year":2019},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:35142a879a75b73955f90705797fa9a3d5776b9b2572c23813da02b15c3cfcab","observation_id":"37f746d8-e5a3-450a-aa40-213b1e352db5","resolution":{"observed_at":"2026-05-24T22:10:00.171276Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0196-6774(91)90006-k","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Easy problems for tree-decomposable graphs","venue":"Journal of Algorithms","work_id":"ee29c3f2-e74d-4fad-be21-ea7c559ba693","year":1991},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:101fd2abbbed23339ef4c61b2e5df48ca3b6804e5adead6f1cac639a54351324","observation_id":"29de32d2-0111-4cd2-b2f6-02bc4608f893","resolution":{"observed_at":"2026-05-24T22:10:00.313645Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/19m1287146","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Thilikos","venue":"SIAM Journal on Discrete Mathematics","work_id":"6e782516-3833-4e45-bf8f-c6f4ef334bf0","year":2020},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:52e04e7e8c71118aaa07139e23ec1cbe2b308e4e1b57b4c2856aa663196580b1","observation_id":"7301d266-b47e-40ae-82e8-1b2962340a74","resolution":{"observed_at":"2026-05-24T22:10:00.317622Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/21m140482x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Thilikos","venue":"SIAM Journal on Computing","work_id":"5e96f173-2191-42e2-ad99-3af47bc683b7","year":2023},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:83b9d041dcacc2528f453bd8d256a9bc7f635b3d070268ff4a797e2c63e3405f","observation_id":"a502d7df-f52a-41e0-96cd-d1e753d7aef0","resolution":{"observed_at":"2026-05-24T22:10:00.300574Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Some classes of graphs with bounded treewidth.Bulletin of the EATCS, 36:116–125","venue":null,"work_id":"400f2cc9-3d4b-4100-a8b5-d7c5bd280324","year":null},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:c833a700fd97c04a0012f2596e9ab54f5b475d77cdcfa4ab4b81a52aac31229b","observation_id":"8ba62eb9-5e46-4312-9456-bf5bb7546b52","resolution":{"observed_at":"2026-05-24T22:10:01.230624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01758777","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Borie, R","venue":"Algorithmica","work_id":"f183c893-9621-4170-a8ec-b207be515713","year":1992},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:f0a590f4048fef050807133f149d21bcc691f60211994fd49f8040d728bcab21","observation_id":"31db5030-7f94-4228-96de-cc66840cefb6","resolution":{"observed_at":"2026-05-24T22:10:00.324403Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-015-0045-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph isomorphism parameterized by elimination distance to bounded degree.Algorithmica, 75(2):363–382, 2016.doi:10.1007/s00453-015-0045-3","venue":"Algorithmica","work_id":"12d651cd-bedf-47a7-a142-7367d4267af8","year":2016},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:125e66e16fe9cc9f84da8aca35c9db20260dec120f1da4298147b9a4428d1650","observation_id":"96631381-48b7-42b9-b629-bf355cc9e621","resolution":{"observed_at":"2026-05-24T22:10:00.394950Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-016-0235-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fixed-parameter tractable distances to sparse graph classes.Algorith- mica, 79(1):139–158, 2017.doi:10.1007/s00453-016-0235-7","venue":"Algorithmica","work_id":"c0919e43-c7c8-4e54-88c7-f1ee0b2fac20","year":2017},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:07d2af7cb9eee940c27feea27a6fe8a3ab6c8b3e13ab0ddb0c3761508bcca431","observation_id":"a037ef6f-8e74-4b3e-b152-cdad1564478b","resolution":{"observed_at":"2026-05-24T22:10:00.167784Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.comgeo.2011.12","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Algorithms for the edge-width of an embedded graph.Computational Geometry, 45(5):215–224, 2012.doi:10.1016/j.comgeo.2011.12","venue":null,"work_id":"76d8aa4d-53cb-4fc0-8438-15c157d095e4","year":2012},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:544999cab2d003e86da6e86540874a66249ef47ce0083b90e16bd180ef8f842c","observation_id":"0e612ae8-8b1a-43ae-a07f-0ad278ac6195","resolution":{"observed_at":"2026-05-24T22:10:00.423674Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6147.506148","doi":"10.1145/506147.506148","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Papadimitriou","venue":"Journal of the ACM","work_id":"1c87e7ad-cd64-4c5a-b086-4eeefbb6cd03","year":2002},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:2e1d7d83c2162e1e2e8d89eab29e272a1d1d0349943380cb2b1f3aa56ae8d295","observation_id":"a6f14889-49d1-4502-92e2-1e1541c56808","resolution":{"observed_at":"2026-05-24T22:10:00.297287Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977554.ch144","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Parameterized algorithm for the disjoint path problem on planar graphs: Exponential ink2 and linear in n","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"c3d9d4e7-8370-4972-8e6d-9b4a2d9a2f0e","year":2023},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:3fdc906c9d0e10aec1fe8d15320d11618137a521ca5054728152173b85e4ef48","observation_id":"29c5d392-cd44-4b11-b596-33277a57128f","resolution":{"observed_at":"2026-05-24T22:10:00.320914Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jctb.2020.09.010","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards tight(er) bounds for the excluded grid theorem.Journal of Combinatorial Theory, Series B, 146:219–265, 2021.doi:10.1016/J.JCTB.2020.09.010","venue":"Journal of Combinatorial Theory Series B","work_id":"b2f977df-1a7e-4693-a254-2112c915757f","year":2020},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:bce1880cbc7310093f5b511496fbddb6e70a31ab1a247933cb68e4438166c38b","observation_id":"61a83e91-2dae-4964-97d7-fb27cb0e462c","resolution":{"observed_at":"2026-05-24T22:10:00.349622Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-20T23:22:17.760123+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T23:22:17.760123+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0890-5401(90)90043-h","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T23:39:02.514566Z","title":"The monadic second-order logic of graphs","venue":"Information and Computation","work_id":"69e8ab4c-158e-499e-8f23-ebc09d518761","year":1990},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:f63a2cffac4f26a43eb562aa8f84a375184fcc7f0c8062cee9c0fcf7d1bbbfd6","observation_id":"f6f9fe11-67d2-4ad1-8cbe-e06421c96e69","resolution":{"observed_at":"2026-05-24T22:10:00.338986Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"ita/1992260","doi":"10.1051/ita/1992260302571","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The monadic second-order logic of graphs III: tree-decompositions, minors and complexity issues.RAIRO - Theoretical Informatics and Applications, 26:257–286, 1992.doi:10","venue":"RAIRO - Theoretical Informatics and Applications","work_id":"7646b7c5-6eff-4b49-a443-a26a74b56912","year":1992},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:748d2c6d626b3ce2dbfabcc61b6958890302d4422d80af759b22a04469a3bc3f","observation_id":"f7033049-8a85-4cc6-bb8d-82127da26a53","resolution":{"observed_at":"2026-05-24T22:10:00.476823Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"The expression of graph properties and graph transformations in monadic second- order logic","venue":null,"work_id":"8eaf9c6a-6bbb-4b73-94ce-802f4bf5c862","year":1997},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:851cc1c35e9c38499a39b74db30bcd51240004f5e312e041621871cc55f94ff6","observation_id":"462cbbfa-c6ca-4d27-a04d-748e77b56e55","resolution":{"observed_at":"2026-05-24T22:10:01.222361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-004-1106-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Demaine and MohammadTaghi Hajiaghayi","venue":"Algorithmica","work_id":"252b27b2-fd28-4879-851c-04f9abbaad1f","year":2004},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:0d0f9e049f85d8172792da70ed35d6e45cdd2dc9e04e06644ecaafc3f885a0c4","observation_id":"f7384d70-58ee-46ab-b1e6-e717b2b9ea5d","resolution":{"observed_at":"2026-05-24T22:10:00.268029Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3636.199369","doi":"10.1145/1993636.1993696","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Demaine, MohammadTaghi Hajiaghayi, and Ken ichi Kawarabayashi","venue":null,"work_id":"82c1778a-3a3f-4ee7-bf05-12cff03dc79b","year":2011},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:3395e8b22b3901620efcceeec66b61fb232d291c888bbd43ab9289fe6228461a","observation_id":"49806c11-b72e-40a1-ae04-8fc069332312","resolution":{"observed_at":"2026-05-24T22:10:00.272835Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/040616929","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Demaine, MohammadTaghi Hajiaghayi, and Dimitrios M","venue":"SIAM Journal on Discrete Mathematics","work_id":"b3df1634-9dc9-4edf-8157-bda0d24e85f8","year":2006},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:65190fc22fee2572caf99935c25df048c24b7d4b6d351521607e31b840c2063a","observation_id":"30e5249e-4189-45db-a996-2e346a851792","resolution":{"observed_at":"2026-05-24T22:10:00.345747Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s004530010020","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Diameter and treewidth in minor-closed graph families.Algorithmica, 27:275–291, 2000.doi:10.1007/s004530010020","venue":"Algorithmica","work_id":"d224119c-dd09-461c-a20d-1f0e29778d62","year":2000},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:53c36224d1a2c1b31efabc5f3d2a3d14d1fd9635eed9d58d761cebdfe378668d","observation_id":"ad980fc0-88ac-4ea0-aa99-daa16f43fd61","resolution":{"observed_at":"2026-05-24T22:10:00.230582Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4108.644208","doi":"10.5555/644108.644208","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dynamic generators of topologically embedded graphs","venue":null,"work_id":"49d5cc48-fdb5-41b5-a5f8-af5f4011bd40","year":2003},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:8e1fdd4776db94e550b98ca8a448f6d763f1323448605036cfdc8ede61a26e21","observation_id":"2ad722cc-a62d-4b65-bbdf-b36f81e85df8","resolution":{"observed_at":"2026-05-24T22:10:00.236091Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01190507","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fellows, Jan Kratochvíl, Matthias Middendorf, and Frank Pfeiffer","venue":"Algorithmica","work_id":"1559ac44-80f8-4841-a88a-98379f60f238","year":1995},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:faf70d642d6d715f150fa2929cea98140bbd996cfa0258d39d9b6a008a857f76","observation_id":"b70d70ac-484b-4fdd-9076-1ad4abd528c3","resolution":{"observed_at":"2026-05-24T22:10:00.380498Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/24m1632759","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fomin, Petr A","venue":"SIAM Journal on Discrete Mathematics","work_id":"bf89738b-5f3b-49b6-88e0-6a392be09b0c","year":2025},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:4f1cd3a9d174ab1b93645f1c8e5fe87c4e34993d64072e66ac57c4fb1a3030ee","observation_id":"42c0a245-6678-48cc-a496-0331b77938c2","resolution":{"observed_at":"2026-05-24T22:10:00.309275Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Compound logics for modification problems.ACM Transactions on Computational Logic, 26(1):2:1–2:57, December","venue":null,"work_id":"50627952-6b90-44a4-a9c2-5c85eb7ca430","year":null},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:57d426e3a25373b047d04fa4bf8e653a7bf705526b98ca7803f65006e100d690","observation_id":"aa2c1eb1-cdb1-4d78-8c3a-f632bdf84285","resolution":{"observed_at":"2026-05-24T22:10:01.237843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3696451","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"1, 2, 30","venue":"ACM Transactions on Computational Logic","work_id":"e1a51445-762c-45c7-97ef-2800260c272f","year":2025},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:1b39efc115d728b8cccd0870a336b37d634724f306adc4e1ac16b21ef9c5a732","observation_id":"7b1409e0-3fca-4639-8510-3598ac372cd1","resolution":{"observed_at":"2026-05-24T22:10:00.218686Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3571278","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fomin, Petr A","venue":"ACM Transactions on Computation Theory","work_id":"e242abf2-a131-4af5-a5b0-5c2d5faa3820","year":2022},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:5c7ad3e82b32e67a26f84ad37dbdbcdb33ffaa9c05e80e83fadea12264e5bb6c","observation_id":"8f0a55b1-f69f-4512-97a7-28b1bf2f82a3","resolution":{"observed_at":"2026-05-24T22:10:00.288338Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7713.338431","doi":"10.1145/3357713.3384311","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi","venue":null,"work_id":"64497801-abfd-4444-aba2-761df9f21a8e","year":2020},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:7ab063651316240be64b0b6bb3dd453251b614d079e2b530cdf5a69ea70f6b9c","observation_id":"c2d009c0-aa93-4475-a827-4c178ba83348","resolution":{"observed_at":"2026-05-24T22:10:00.250043Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3155298","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fomin, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M","venue":"ACM Transactions on Algorithms","work_id":"2b7190cd-5e3c-404d-88b6-a2e10816c125","year":2018},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:2e0df43e329cf1b8a5b18e2817bdb9132faae3a22ce5529fa976e8a9fd018918","observation_id":"dad662f8-c916-4831-b4e8-60310cc1be20","resolution":{"observed_at":"2026-05-24T22:10:00.256558Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Fomin and Dimitrios M","venue":null,"work_id":"22314500-5dc8-475c-8c17-ea2d4d00e820","year":2006},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:b66f6ea8de3eee5cc87a86ddb7298a093e3bf3f99ff53af6eb638ee8508c6d9e","observation_id":"72d5bbe2-0170-403f-8624-63191a252fa7","resolution":{"observed_at":"2026-05-24T22:10:01.240967Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T19:06:27.329439Z","title":"(Almost-)optimal FPT algorithm and kernel for T-Cycle on planar graphs","venue":null,"work_id":"990a3ddc-ad0b-497b-88a9-14f1d66f8371","year":2018},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:98d3362e8f3f819868c7e226a80d9f55544a35fada1aece17f36be4be829f58e","observation_id":"f75662bc-5bf1-43c5-8c6e-b1fcaa7580aa","resolution":{"observed_at":"2026-05-24T22:10:00.357032Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejc.2003.07.007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Geelen, R","venue":"European Journal of Combinatorics","work_id":"cdcf8587-acf2-4790-b239-d09e3e4f4fb4","year":2004},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:a54b63f66a1f868c7c64b7b372750efcbceeac79dbed6e38a492150f41772f6c","observation_id":"50c50d8e-768a-4dbd-a147-1578b1e7157c","resolution":{"observed_at":"2026-05-24T22:10:00.416586Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/141000014","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Golovach, Marcin Kamiński, Spyridon Maniatis, and Dimitrios M","venue":null,"work_id":"8cb33206-ab79-42e2-812a-6a24325c6d37","year":2017},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:518859818ca4a191159d268c9d09a99ce24c25cda59da76bc7ae974183a06e66","observation_id":"0bdd3ec8-ee3a-465f-aea8-9a41c519ffed","resolution":{"observed_at":"2026-05-24T22:10:00.413332Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, and Takeaki Uno","venue":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","work_id":"b4fc9e91-7fe2-4ebf-8b5d-fdb12379e17e","year":2014},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:de3c741863fd4c4684f2d2595a259164041093bfaed315e8d638476fcffe140b","observation_id":"e767d103-e110-471e-b74d-881fbe7fe500","resolution":{"observed_at":"2026-05-24T22:10:00.284990Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/22m150914x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Golovach, Giannos Stamoulis, and Dimitrios M","venue":"SIAM Journal on Discrete Mathematics","work_id":"717db87a-da11-464a-9060-96d23f655079","year":2023},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:34279f1f12b0ef773871eb25057dced132e3c35d33e2da119591955fd7c401d7","observation_id":"7b420ba0-633b-4bb5-af36-f1d83a2b20ba","resolution":{"observed_at":"2026-05-24T22:10:00.204922Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-20T23:22:18.494611+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T23:22:18.494611+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3583688","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Golovach, Giannos Stamoulis, and Dimitrios M","venue":"ACM Transactions on Algorithms","work_id":"dc69479c-bf95-4a0a-9121-ac536e015316","year":2023},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:36bdae527e7643abeaee89e02a8cd2f09dd003d9c4d93b69d2ce6525e1d97159","observation_id":"6b30f214-680c-4141-bb0c-cac35bdc52c6","resolution":{"observed_at":"2026-05-24T22:10:00.222237Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977554.ch141","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Golovach, Giannos Stamoulis, and Dimitrios M","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"8ea08e5c-1474-4913-ac44-3d82b8a17334","year":2023},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:5b6ee59179ffbeb66863696f1c15e093e54e7dd256dd74f0c439e4c8a7f7e3dc","observation_id":"4e865391-b63f-4183-9979-e711882187c6","resolution":{"observed_at":"2026-05-24T22:10:00.280631Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.06516","doi":"10.48550/arxiv.2602.06516","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quickly excluding an annotated planar graph, 2026.arXiv:2602.06516,doi:10.48550/arXiv.2602.06516","venue":"arXiv (Cornell University)","work_id":"8f9becfb-d828-48c2-a93a-67b0b669b677","year":2026},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:2bb81b04a72f389a60665039b46f670bd1409afb2824aec1dce3d2392efc11db","observation_id":"fcfa049f-7861-41dd-b2e6-176bba93fd2a","resolution":{"observed_at":"2026-05-24T22:10:00.201445Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3636.199370","doi":"10.1145/1993636.1993700","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2011 , isbn =","venue":null,"work_id":"2df4f927-51ba-4374-a058-29765fcc672e","year":2011},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:12c430bd7678390a123529700cb2f51a0539ecb709a5c01378096a6b873c4e5a","observation_id":"fbad89ab-49a7-49fe-8739-e12a5ed7c75b","resolution":{"observed_at":"2026-05-24T22:10:00.192870Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T10:27:01.270129Z","title":"A Geometric Heuristic for Rectilinear Crossing Minimization","venue":null,"work_id":"5ec132ea-8bab-4415-b2af-677e9db16f00","year":2026},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:2917a2203183ad02361c3dd5613215b4f846f33a6f5867f434926a39fff8aaa8","observation_id":"4cf69c86-0a35-4761-9530-72b25ed75aeb","resolution":{"observed_at":"2026-05-24T22:10:00.184278Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/jgt.23023","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Graph Theory","work_id":"cbdb9a09-09d5-426f-8d52-3c9e8f5932f8","year":2025},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:d893d9bd9aeb1dcd8075213368074ca13ff776bb91e3df1e18259c638f2e7598","observation_id":"67778d9f-53f9-4eb0-9b30-69c69b3a017b","resolution":{"observed_at":"2026-05-24T22:10:00.409231Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2009.45","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Planarity allowing few error vertices in linear time","venue":null,"work_id":"a525235b-449c-47eb-99c2-7e1f64113bd0","year":2009},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:6e8ceb8900fcfa460379d5d3486f0c90d89d862df309ea665dc3acbb13c09b75","observation_id":"ac948274-e6ab-4fd2-8415-75ca22155210","resolution":{"observed_at":"2026-05-24T22:10:00.353140Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611973068.124","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithms for finding an induced cycle in planar graphs and bounded genus graphs","venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","work_id":"31e6dc37-286d-4eb8-98a6-b587b17e62d3","year":2009},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:1543519ee551097c9181f709a174d5b2a3942e5dc1e8be06dcc65bae176a3870","observation_id":"9ba70b97-069d-4baf-9209-deea5f6bc703","resolution":{"observed_at":"2026-05-24T22:10:00.175491Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00493-010-2499-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithms for finding an induced cycle in planar graphs.Combinatorica, 30(6):715–734, 2010.doi:10.1007/S00493-010-2499-X","venue":"COMBINATORICA","work_id":"3a852d28-e6d1-4d22-b96d-2c7641d6fe17","year":2010},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:b000dc0c56bf127f5f58fe18eb519e05aa9dfd2d79f13a1fb3770aea74769c6c","observation_id":"9506c451-3294-4702-9329-03763eb1e977","resolution":{"observed_at":"2026-05-24T22:10:00.277033Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2011.10.004","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The induced disjoint paths problem","venue":"Journal of Computer and System Sciences","work_id":"bba3b55f-07c5-45c2-ab76-15f3021eb1e4","year":2012},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:8a2f9fbdbedfbed4a067147d30a589d167a8f3b168abbec6aa4f2ce92cbd313a","observation_id":"4cf063d2-8548-4c72-97ed-420e44ae60a8","resolution":{"observed_at":"2026-05-24T22:10:00.180511Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jctb.2011","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The disjoint paths problem in quadratic time.Journal of Combinatorial Theory, Series B, 102(2):424–435, 2012.doi:10.1016/j.jctb.2011","venue":null,"work_id":"b770f9b7-488d-4453-b04c-d0c35548b907","year":2012},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:a87d0693eeee941531d6981d8c1eeee3d4a17d56015663fe525d9292e1c0b5d3","observation_id":"23e4a37c-2b9c-4a63-aad0-dc4dd4312ef5","resolution":{"observed_at":"2026-05-24T22:10:00.264844Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00454-012-9413-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Linkless and flat embeddings in 3-space","venue":"Discrete & Computational Geometry","work_id":"3272afa1-9319-4103-9b50-414e15615353","year":2012},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:b89e737e4401f7aa9b67fb5b786f71632714cf873de74d8b608f6091b652f4bd","observation_id":"b648b1a5-38b4-4c1d-bb38-4d10f99176f9","resolution":{"observed_at":"2026-05-24T22:10:00.291969Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2008.53","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"774eec7c-61bb-4e6f-af63-3e77617ca4a5","year":2008},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:ad04e1358fa25b39f49061a2a1fef7f2507e8b4f7df82918d1e43192345c198f","observation_id":"9d159e31-0c63-4871-b4af-09685da4fca9","resolution":{"observed_at":"2026-05-24T22:10:00.244158Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0790.125084","doi":"10.1145/1250790.1250844","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proportional Response Dynamics Leads to Market Equilibrium","venue":null,"work_id":"ebe6737e-39a3-4b21-a9e4-952c2aa12578","year":2007},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:feaa2cc9f1bd6d43a581f54037b1424e358900dfa968d358a87ca0eb598e3174","observation_id":"d69be071-232e-44b8-adf6-3940cb547cb2","resolution":{"observed_at":"2026-05-24T22:10:00.343106Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611973402.130","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"209d147a-f78f-4c05-b0b7-52db75085692","year":2014},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:b169d02f72e08b578f8c490f779b37d4ef415c60f95edffe921ac54e4dd06174","observation_id":"d3771b52-2cc3-469d-8a28-c2cc74ebf8ec","resolution":{"observed_at":"2026-05-24T22:10:00.162549Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/20m1353782","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Discrete Mathematics","work_id":"a2a1c4a1-d933-4801-97d0-8635e31d9550","year":2021},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:4a06d4db78f41552f7726e1047890eac0e47330f59feb20ff70ada441baba689","observation_id":"dcf931cf-63b7-42c3-aca1-dccc8155ac61","resolution":{"observed_at":"2026-05-24T22:10:00.240548Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":null,"venue":null,"work_id":"b01f06a3-ae83-4334-8a4e-4f3b1b2dfa9a","year":2025},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:72f1d3418abc8596a5a32d888e876bff67dfc6914b5bab376ccda08c8f6c9324","observation_id":"a55f85c3-ac7c-4f92-9ea9-b4d836216eb2","resolution":{"observed_at":"2026-05-24T22:10:01.225994Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2012.182","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Thilikos","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"aa1fbe80-f83f-4c0e-a1ca-c05919a1b85c","year":2012},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:e1a2494083ed07be0939f9c44fb412bfec3ba85044db2c0fd04c2e8b64a1c38b","observation_id":"2187813c-a343-4a27-b902-a85ee7f147f1","resolution":{"observed_at":"2026-05-24T22:10:00.405500Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-019-00592-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Deleting vertices to graphs of bounded genus.Algorithmica, 81(9):3655–3691, 2019.doi:10.1007/s00453-019-00592-7","venue":"Algorithmica","work_id":"4603fac9-cb71-47a9-ab76-f4ff0d5ce9a3","year":2019},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:85693668e23a66848430b628a6db3fd8120543bc09e870a0ef4d10cb2bef280c","observation_id":"61b1fdd5-682c-411f-9536-fdcaae2f9c47","resolution":{"observed_at":"2026-05-24T22:10:00.303783Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-05T02:28:24.338817Z","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":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:71aa975067eb87b0afd5559c3f7278b2a45c2c6785fb9ed162a5a4e16fa69b4d","observation_id":"bdb473cf-43a2-45c4-8c7f-038da96ee725","resolution":{"observed_at":"2026-05-24T22:10:00.377732Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1266.2024","doi":"10.1109/focs61266.2024.00007","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Minor containment and disjoint paths in almost-linear time","venue":null,"work_id":"4d4ecf63-4e54-473f-89a4-027172eeb7e8","year":2024},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:bcf08a697f35bc2384232e6eda6dffa22cca2c808386b54e8fc247943f4240d5","observation_id":"7ab31d1d-3047-448f-8752-3aa23366d62c","resolution":{"observed_at":"2026-05-24T22:10:00.391513Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:44.276639+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:44.276639+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978322.44","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Crossing number in slightly superexponential time","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"617172fe-4254-4e7a-8b52-5afa19488758","year":2025},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:1cf906aaa52ff2c806529e3c4c7f695006edf14bd6b13e5d1ec7af955b28ea74","observation_id":"d3ee1f83-da7a-4d65-9c8e-ef9f884e3bae","resolution":{"observed_at":"2026-05-24T22:10:00.383594Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-010-9484-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Obtaining a planar graph by vertex deletion.Algorithmica, 62(3–4):807–822, 2012.doi:10.1007/s00453-010-9484-z","venue":"Algorithmica","work_id":"da4cfbe4-13ff-440b-b880-b98a2a3c5bfd","year":2012},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:a6d9231f57612478ddcbcf87f187c8fc32e58cf2cfba9f05827c1efedd91ad6c","observation_id":"09da5a6c-51de-4534-a55a-26180bf8e687","resolution":{"observed_at":"2026-05-24T22:10:00.360429Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1309.7820","last_updated":"2013-09-30T12:25:38Z","snapshot_observed_at":"2026-07-06T03:24:20.754584Z","submitted_at":"2013-09-30T12:25:38Z","title":"A single exponential bound for the redundant vertex Theorem on surfaces","version":1},"cited_work":{"arxiv_id":"1309.7820","doi":null,"metadata_source":"pith","pith_arxiv_id":"1309.7820","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A single exponential bound for the redundant vertex Theorem on surfaces","venue":"math.CO","work_id":"25cc4294-c445-47e2-a3d0-1cfe612a96d9","year":2013},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"cited_paper":"/paper/1309.7820","citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:2a2c94f4467fb0f7a4f1f87f0e49a7bd005289052515bd92e590ba498ecf8843","observation_id":"cd67d29f-e573-46b4-b290-a63f4dafe4fd","resolution":{"observed_at":"2026-05-24T22:10:00.470763Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s089548019529248x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A linear time algorithm for embedding graphs in an arbitrary surface.SIAM Journal on Discrete Mathematics, 12(1):6–26, 1999.doi:10.1137/S089548019529248X","venue":"SIAM Journal on Discrete Mathematics","work_id":"3cd8fef5-3a0e-4d5f-a56b-d0f00f87d051","year":1999},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:9296e160425de5b68cb57348b6d6f364cf239f0df83b605c33a6073791ef4f1d","observation_id":"a0688731-fdb8-4880-a88f-31ee05ef7962","resolution":{"observed_at":"2026-05-24T22:10:00.402023Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Johns Hopkins Series in the Mathematical Sciences","venue":null,"work_id":"e8b83256-da19-421d-ab89-d9120ae94d27","year":2001},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:301be5c52d811498f0e9d365c543776c6f479d813c35ab7c007e0dc068683b29","observation_id":"7f4630ab-59af-45b0-a722-4dd5d8976558","resolution":{"observed_at":"2026-05-24T22:10:01.215478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Thilikos","venue":null,"work_id":"3c04021d-8288-4dce-a744-d3ba15de3678","year":2024},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:50177f2f9536ef03ab4ee45a6894c1abc9c61bf43b1074ab17a99bb28dac9483","observation_id":"f4ab8f46-1a10-4c4e-97ac-ebfb100be3ba","resolution":{"observed_at":"2026-05-24T22:10:01.218227Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0166-218x(94)00104-l","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Discrete Applied Mathematics","work_id":"b9a36f19-31e8-468d-8216-588b0573dabb","year":1995},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:61ba0f058ef291fb8a2eb0825425e373b1045b32f553bd7b97c0dec8e588a4da","observation_id":"b15ab71a-2a7f-48c4-be7c-fb586a6108ac","resolution":{"observed_at":"2026-05-24T22:10:00.430156Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Reed, Neil Robertson, Alexander Schrijver, and Paul D","venue":null,"work_id":"31c51f32-b749-4da4-ab98-1cd23ddfd932","year":1991},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:a6e9ef6ec267a869c78e068cf058067a14ba22f6b6c316c8d9a084802ff4e9df","observation_id":"05035ba6-d3c5-4d19-9648-e7a7a3202683","resolution":{"observed_at":"2026-05-24T22:10:01.212356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jctb.2008.08.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph minors","venue":"Journal of Combinatorial Theory Series B","work_id":"1b16d700-9e80-4d55-adb7-10a29e9b96dc","year":2008},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:ac732cc29754820fac17b4a92cdab1d89c77ff3cc09624a57d85fef4701513c8","observation_id":"46e8deb5-dd23-431d-b00e-ab0d1de4e1c6","resolution":{"observed_at":"2026-05-24T22:10:00.252958Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jctb.2007.12.007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph minors","venue":"Journal of Combinatorial Theory Series B","work_id":"25775c86-e6ab-4c94-a51f-3171da0805e4","year":2012},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:704a498017164a81cd3ae8580aa6518af414e5aa65a7879cf8790a2326bd3d6a","observation_id":"9c422a48-1943-449e-a21c-1c3d911ac154","resolution":{"observed_at":"2026-05-24T22:10:00.426715Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-20T23:22:20.103859+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T23:22:20.103859+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0095-8956(84)90013-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph minors","venue":"Journal of Combinatorial Theory Series B","work_id":"19a71882-a9b6-4402-bfef-58089727c1d5","year":1984},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:c4a6e22b6bc2f17a41f46ccf208377d162552eecc60b894bcac5cba5a2cf840e","observation_id":"df1e5060-c603-4028-b984-64dfcb7663ab","resolution":{"observed_at":"2026-05-24T22:10:00.211200Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0095-8956(91)90061-n","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Journal of Combinatorial Theory Series B","work_id":"f9d46c51-9e8c-4b14-be9e-2f7ecc9e0f9d","year":1991},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:9fd4c7e8479047209bd7669db4959a8a494ae0c7a7495f8c8fa9d3bed4790c01","observation_id":"225512ff-a86b-4f0f-aa69-4ee88bb71d11","resolution":{"observed_at":"2026-05-24T22:10:00.397928Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-20T23:22:19.560543+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T23:22:19.560543+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1995.1006","doi":"10.1006/jctb.1995.1006","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Robertson and P.D","venue":"Journal of Combinatorial Theory Series B","work_id":"53bd08f2-cbb4-4bdf-ab70-23c749cb5104","year":1995},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:cd64e5895d5f19c0d3ac849f0fb9335120c97ae14da4cdf8e24fbdaf664a3925","observation_id":"d7932d50-c9dc-4e94-b69e-0f93dc4ff7c4","resolution":{"observed_at":"2026-05-24T22:10:00.369021Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-07-20T23:22:19.80941+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T23:22:19.80941+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0095-8956(03)00042-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[RS04] Neil Robertson and P","venue":"Journal of Combinatorial Theory Series B","work_id":"03711a89-450c-456f-a2f0-497865b0b61d","year":2004},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:ab567aaa54a32f8249361cc9d95bb294f94f6239c469d164626e38575c379d07","observation_id":"6d314de5-f1ec-4d8f-bbe3-e5004b267aa2","resolution":{"observed_at":"2026-05-24T22:10:00.331067Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1994.1073","doi":"10.1006/jctb.1994.1073","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seymour, and Robin Thomas","venue":"Journal of Combinatorial Theory Series B","work_id":"4e69f221-386e-4675-8e6c-347fb44419bc","year":1994},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:1a60cd7d94361e94c0c610cb1c641cd5035755f1ad484b0ec2237b3ca0f5c78e","observation_id":"fe701712-6d14-4ae6-a058-b355dd6a774f","resolution":{"observed_at":"2026-05-24T22:10:00.335799Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978322.124","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Thilikos.Parameterizing the quantification of CMSO: model checking on minor-closed graph classes, pages 3728–3742.doi:10.1137/1.9781611978322.124","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"1bb1587c-8fcf-4b3b-89b4-d70c79903ff3","year":2025},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:e4d3595ac1d85c397c8caa645bc95d2523eb6829305b0982075c6f64de859f3d","observation_id":"38aba39a-e439-4e9b-857e-41f88145c9be","resolution":{"observed_at":"2026-05-24T22:10:00.420448Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"Thilikos.k-apices of minor-closed graph classes","venue":null,"work_id":"9f2652e6-c537-4fc9-a61e-c04d23b04022","year":2022},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:7ec6723cc1819509831516323880c50484f71c06e0cc9477b3f13fad7b4d4298","observation_id":"08afd224-e22c-4259-88b7-6053cb577364","resolution":{"observed_at":"2026-05-24T22:10:01.234137Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3519028","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An FPT-Algorithm for Recognizingk-Apices of Minor-Closed Graph Classes","venue":"ACM Transactions on Algorithms","work_id":"6519fb81-c1dc-4db6-a5f3-e12aaf6f96d1","year":2021},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:6f964bb32179aac0e050db3fd5e3871ebbb702c9ad108528a08bc1830e4ecff2","observation_id":"7272c8cb-5e4d-4d09-979f-f43166a9ef8d","resolution":{"observed_at":"2026-05-24T22:10:00.327694Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jctb.2023.02.012","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Thilikos.k-apices of minor-closed graph classes","venue":"Journal of Combinatorial Theory Series B","work_id":"45250d9c-1bc0-4d75-9ec5-3ae6fe2e9220","year":2023},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:e45ca57207fa59aab93d01b54bc9abd8d210ff441e30f4ce3622008ca2cf2445","observation_id":"82c0438c-94d9-46e5-b3ae-21a92edf303d","resolution":{"observed_at":"2026-05-24T22:10:00.260481Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1814.366208","doi":"10.1145/3661814.3662084","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Thilikos, and Alexandre Vigny","venue":null,"work_id":"747748f6-2158-4daa-8238-938aafcdc656","year":2024},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:3e470c0e2c6b9a7f7913be05404f39f1023021a5f9997e1e42f268cc3ba556c1","observation_id":"8f6c3d28-0b6d-417e-88d2-c6b22b2ec4ed","resolution":{"observed_at":"2026-05-24T22:10:00.364909Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-05T02:28:24.338817Z","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":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:d5b19ab0ccb59751776b333416aa78e9bb215a29fbafe1ddbc1775967914aa49","observation_id":"c6206d53-2aec-432f-bba7-7276a43626ed","resolution":{"observed_at":"2026-05-24T22:10:00.227184Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/pl00009273","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bodlaender, Babette de Fluiter, and Dimitrios M","venue":"Algorithmica","work_id":"22d5d4ea-0ad1-4d0f-9373-7db1e98afcbc","year":1999},"citing_paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs","version":7},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-05-24T22:07:38.591554Z"},"links":{"citing_paper":"/paper/1907.05940"},"observation_digest":"sha256:a0691699be5c704e5462250069efa6e9e3e28ae57df134d59fc12f9128d26bf4","observation_id":"15c7b952-dac0-4b60-8c8e-b4f19afa4c2c","resolution":{"observed_at":"2026-05-24T22:10:00.208094Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1907.05940","last_updated":"2026-04-30T17:57:41Z","latest_version":7,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T08:07:26.308534Z","submitted_at":"2019-07-12T20:27:46Z","title":"Finding irrelevant vertices in linear time on bounded-genus graphs"},"reference_resolution":{"displayed":79,"state_counts":{"malformed_identifier":7,"metadata_mismatch":7,"parse_uncertain":0,"unresolved":0,"verified_exact":60,"verified_fuzzy":5},"total_outbound_references":79},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 79 of 79 outbound references and 0 inbound Pith citation observations for arXiv:1907.05940."}