{"as_of":"2026-08-21T06:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9ec38206147cd5059fb0048d9f166550cc6fdb143f2aa7b03396bb4676ae961f","coverage":[{"denominator":125,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:28:19.468582Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2411.15365/citation-record","integrity":"/paper/2411.15365/integrity","json":"/paper/2411.15365/citation-record.json","paper":"/paper/2411.15365"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.912048Z","title":"Interpreting nowhere dense graph classes as a classical notion of model theory","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.912048Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:b18278cf0831e654055aacedef0cddff6574a6efc186ba4fb98fc6f5e0a4cc2a","observation_id":"7bd8cf21-8f90-4c0d-a43e-2c9ef18ec56a","resolution":{"observed_at":"2026-08-12T14:28:18.912048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.917944Z","title":"Second-order quantifi ers and the complexity of theories","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.917944Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:840e49689faba08bc6bf2140ea508f071d091414c1381d7499c3953e5930067c","observation_id":"59d8dac5-bbcc-4d3b-9ec2-f5f1c82d4208","resolution":{"observed_at":"2026-08-12T14:28:18.917944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.923463Z","title":"On uniformity within NC1","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.923463Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:4e98c7fc05b31f0db9dabaa9b5a08a8c91d0da462bc5fc2be03237993309a1ac","observation_id":"67e721a3-1d73-42b8-9d6b-43f48dc44d3a","resolution":{"observed_at":"2026-08-12T14:28:18.923463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.928576Z","title":"Expressive power of unary counters","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.928576Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:66a45d939fc6bcb7abc1e5d768493f6f66e743e9845924986a194646ae754714","observation_id":"4a565da2-5ace-4711-8589-eed92f99b74f","resolution":{"observed_at":"2026-08-12T14:28:18.928576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.13953","last_updated":"2021-09-02T11:53:26Z","snapshot_observed_at":"2026-08-16T18:06:38.689650Z","submitted_at":"2021-07-29T13:28:46Z","title":"Separator logic and star-free expressions for graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.13953","snapshot_observed_at":"2026-08-12T14:28:18.935335Z","title":"Separator logic and star-free expre ssions for graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.935335Z"},"links":{"cited_paper":"/paper/2107.13953","citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:09f3ab4cf99b75e924bfcf10559ad34e84f4b7e1f23ba06e997eb62ad42f8a71","observation_id":"5767ae7c-0340-4d06-9292-6de3043ee713","resolution":{"observed_at":"2026-08-12T14:28:18.935335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.942234Z","title":"Twin-width VIII: delineation and Win- Wins","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.942234Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:a739b24bf23f6c23e38a776371bae791dde05be8c71da81af35861bb7959b8ff","observation_id":"bcb02260-4900-44c7-8a8c-917787a0d2f4","resolution":{"observed_at":"2026-08-12T14:28:18.942234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.948468Z","title":"Model checking on interpreta tions of classes of bounded local cliquewidth","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.948468Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:24053ed7cb947161a3b9e4bb7e99f55c5e9303ddf8f37866ac4db6b0b5739f76","observation_id":"a3f36d95-8e2b-429f-88d7-f7d84a5cb7fd","resolution":{"observed_at":"2026-08-12T14:28:18.948468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.953674Z","title":"Twin-width II: small classes","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.953674Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:4742f92bd703db94fe1b07a8e96da913528c9243d026e01ce80740857a9f6182","observation_id":"ae9f42ce-3c45-4714-a4b5-9d17682c593e","resolution":{"observed_at":"2026-08-12T14:28:18.953674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.959563Z","title":"Twin-width III: max independent set, min dominating set, and coloring","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.959563Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:c5b0434e1806443c4d8c8d12998e60d3f37f3c6403f873b77efc7fbbfbb6565d","observation_id":"befab4c0-5604-4435-9fc8-f16de801979e","resolution":{"observed_at":"2026-08-12T14:28:18.959563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.964933Z","title":"Twin-width IV: ordered graphs and matrices","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.964933Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:ba2d5e7dbc80d70dd1bbebae5bb27a0b3c04050af6c6f041e0db91c5000e816a","observation_id":"945cfdd8-5c0e-49a5-95c1-16ddb5bb5119","resolution":{"observed_at":"2026-08-12T14:28:18.964933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.970390Z","title":"Twin- width V: linear minors, modular counting, and matrix multip lication","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.970390Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:f810c4dd6720e9897a88dfc428bd1b81200c8abdf8ce42beb51cebbdb96792ff","observation_id":"f3a3c195-1cf0-40df-b7f6-bc0d5e7c6ecc","resolution":{"observed_at":"2026-08-12T14:28:18.970390Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.975799Z","title":"Twin-width VI: the lens of contraction sequences","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.975799Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:88cb585f384416c145f40e2665fe092601ac4343833d398798fe96dfd35cc96e","observation_id":"d7e1e42d-060b-4e03-8337-f611846be3cc","resolution":{"observed_at":"2026-08-12T14:28:18.975799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.981458Z","title":"Twin-width and polynomial kernels","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.981458Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:694d73dbb80603d463023aec8101f1c6ccfae8abdc33870283b60acb3581201d","observation_id":"3e888ff9-8450-4f9e-a5f1-f5050b3ab1bd","resolution":{"observed_at":"2026-08-12T14:28:18.981458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.987484Z","title":"Twin-width I: tractable FO model checking","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.987484Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:15c59f544273736dff6641e18f79daf1f8f2bfcd2a8b8c8ac280017e41a1255c","observation_id":"f47ac7b5-870a-4df0-b7c8-826546172d9d","resolution":{"observed_at":"2026-08-12T14:28:18.987484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.992506Z","title":"Twin-width and permutations.Logical Methods in Computer Science , 20, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.992506Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:daa66c001d708c5b8f07aec77cde050071ee703b4b7eb2026faff02a7c0ee198","observation_id":"c584b021-7a4d-4ab7-b00c-8149c5ccafa4","resolution":{"observed_at":"2026-08-12T14:28:18.992506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:18.997573Z","title":"Existential characterizations of monadic NIP","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:18.997573Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:febdffa5fc7325a6eac385c8f99d2cad489a997f5a77845627e20cc46b6ce9bc","observation_id":"ef01dd40-bcd9-4f2b-8d5d-cd3fb7e61b86","resolution":{"observed_at":"2026-08-12T14:28:18.997573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.11229","last_updated":"2024-12-22T07:28:46Z","snapshot_observed_at":"2026-08-16T16:32:13.814588Z","submitted_at":"2022-09-15T16:29:03Z","title":"Decomposition horizons and a characterization of stable hereditary classes of graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11229","snapshot_observed_at":"2026-08-12T14:28:19.009073Z","title":"De- composition horizons and a characterization of stable here ditary classes of graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.009073Z"},"links":{"cited_paper":"/paper/2209.11229","citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:be7b92bb9c8718abf3b1c596dd6ff197b005c8513ae3450c218fdee7104438fe","observation_id":"1493ddbb-74dd-4a7a-bcc8-83d69eba982f","resolution":{"observed_at":"2026-08-12T14:28:19.009073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.014244Z","title":"Structure and complexit y of relational queries","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.014244Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:f7e60c861a86cb460b1299eef46597c46e8cd8e75496f88cc1bef7846b46099c","observation_id":"1a97be63-f0f4-4bc5-a781-fc39131fbf7c","resolution":{"observed_at":"2026-08-12T14:28:19.014244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.019154Z","title":"Optimal implementa tion of conjunctive queries in relational data bases","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.019154Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:e5820d5cf322c13b07f0f8032507efebed755e6e24bda2647a3610e4c192f6fc","observation_id":"e00c1b4f-0ec3-4984-aa98-30c2b56a88c1","resolution":{"observed_at":"2026-08-12T14:28:19.019154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.024439Z","title":"Stro ng computational lower bounds via parameterized complexity","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.024439Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:91e038c992fd15ec5703b116536874fcb5240d0a81c35ba8b32f030a24752e44","observation_id":"1d9751fe-45aa-4552-ae7a-ea2f1db73ae0","resolution":{"observed_at":"2026-08-12T14:28:19.024439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.029081Z","title":"Designing fpt algorithms for cut problems using randomized contractions","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.029081Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:ec36dc7c746142412720c5506bf7691ca19f49bcca919c6a74920b00ee21ed38","observation_id":"c9505c41-9e7b-4ede-9e64-17605c485c99","resolution":{"observed_at":"2026-08-12T14:28:19.029081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.034045Z","title":"A relational model of data for large shared data banks","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.034045Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:22860399ac14b5179aac6f5e43b46522a00a2db3afca81d31cdb6df2b8fbdd8b","observation_id":"01e123c8-c5fb-4aa3-8850-2ea5309bc8c9","resolution":{"observed_at":"2026-08-12T14:28:19.034045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.039105Z","title":"A combinatorial theorem for trees: a pplications to monadic logic and in- finite structures","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.039105Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:984e726aff20bd859a2b76f6881c215120f3d5162f9b345839ab87ab2cab6bed","observation_id":"5281a08c-61e3-4d65-b2bd-0daa75f194d4","resolution":{"observed_at":"2026-08-12T14:28:19.039105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.044720Z","title":"Graph rewriting: An algebraic and log ic approach","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.044720Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:26fa1c446c671f72c2b3617789f1c647b787488bcad838c955f5fe6d6a1725de","observation_id":"f0e47de6-c8bb-4ed1-b29a-55141fd96c88","resolution":{"observed_at":"2026-08-12T14:28:19.044720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.050301Z","title":"The monadic second-order logic of gra phs","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.050301Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:4cdb1cb4da0b7ba88dd1f9c9d0da5217e58fdc8da412be7c54c7616962d1af55","observation_id":"79c46b91-790e-454a-98fa-01db920cbddb","resolution":{"observed_at":"2026-08-12T14:28:19.050301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.058465Z","title":"The monadic second-order logic of gra phs VII: Graphs as relational struc- tures","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.058465Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:c09fa375dec3aab4693d548add2a43ad7b16e7c4181322325ee46dc3e853ae4a","observation_id":"5c203491-c5e0-43a8-9d97-aaa7b0473c05","resolution":{"observed_at":"2026-08-12T14:28:19.058465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.063919Z","title":"Lin ear time solvable optimization problems on graphs of bounded clique-width","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.063919Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:b2fbf069d5be5bc380b3eb3a22e2e871371a31aa28d1e784626f2f4055e61a20","observation_id":"e3785df8-142e-464c-85bd-24a83867407c","resolution":{"observed_at":"2026-08-12T14:28:19.063919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.069631Z","title":"Upper bounds to the clique width of graphs","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.069631Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:dc3421541f2cc18b3a6709282aed1b94103a2db25a1340fcb42faa34f0291955","observation_id":"d73c17ff-7504-41b7-97e4-c05effad1985","resolution":{"observed_at":"2026-08-12T14:28:19.069631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.078107Z","title":"Vertex-minors, monad ic second-order logic, and a conjec- ture by Seese","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.078107Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:1dbf175ac1d8103a83c28adf61013f4442f43dd512f36899b72fe4509147d204","observation_id":"5ae85540-a16e-4709-b64f-f893376409f2","resolution":{"observed_at":"2026-08-12T14:28:19.078107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.084086Z","title":"Springer, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.084086Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:04807e908695e996da3a21845c9bcd89047585f5ccdfd0f28cfe638afe7c8f90","observation_id":"ba79f984-69d3-4548-8a19-3ba0d22d3280","resolution":{"observed_at":"2026-08-12T14:28:19.084086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.089858Z","title":"Randomized contractions meet lean decompositions","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.089858Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:a0a50e7136d97dab0a3e1d4c358ba65521f9255385a483f6a1a15397cbd53860","observation_id":"cb6f3e6e-90d6-4520-b561-63db0479e1ba","resolution":{"observed_at":"2026-08-12T14:28:19.089858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.095088Z","title":"Minimum bisection is fixed parameter tractable","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.095088Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:60b1cce771769134fd6144737d610fffc3cd7a72124ad13e550d7028138d7fad","observation_id":"60062fa6-7109-4d9a-8d49-b1d5de6be53c","resolution":{"observed_at":"2026-08-12T14:28:19.095088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.099812Z","title":"Minimum bisection is fixed-parameter tractable","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.099812Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:3b6eda714d0ff4f315a229856d027a7829a3d0e826935bc52e8f63124095e969","observation_id":"8caaa5de-e48e-4839-b4af-df1ead6bdec3","resolution":{"observed_at":"2026-08-12T14:28:19.099812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.105740Z","title":"Locall y excluding a minor","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.105740Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:0515aad17e570598af47c536cbe71c6cc525a10a005a48cc8b5bad5cdf9c100b","observation_id":"7e5504a8-b97f-4938-8ee1-219eadb44981","resolution":{"observed_at":"2026-08-12T14:28:19.105740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.110590Z","title":"Tree acceptors and some of their applicatio ns","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.110590Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:6219620feac8f0978631088b87773a1d34385feacd0af80f5da1ae60964add07","observation_id":"1432de1a-1098-49ad-bc04-e9f2e2758d62","resolution":{"observed_at":"2026-08-12T14:28:19.110590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.116380Z","title":"Fixed-parameter tra ctability and completeness I: Basic results","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.116380Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:a47c097656185b1f47ed2e33a012fc13cb72dc6b2ae9a893ea1bb92ab35ae991","observation_id":"b1f94be0-ca79-4a9b-9541-a9aeb0aae923","resolution":{"observed_at":"2026-08-12T14:28:19.116380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.121402Z","title":"Downey and Michael R","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.121402Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:ac1f2e7e33c433669c90caad45ddd910319c83e5a675ec413f1753327fd78495","observation_id":"0cb154e9-2bd7-4df5-8ee4-78399d71579c","resolution":{"observed_at":"2026-08-12T14:28:19.121402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.126589Z","title":"Fundamentals of parameterized complexity , volume 4","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.126589Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:b9ab1d0b644d5fc8e2513b1f456ca97ad48591e2ba7adb19955bde7db32e7e21","observation_id":"833a5697-ac20-402f-b25f-5ca74de8f87a","resolution":{"observed_at":"2026-08-12T14:28:19.126589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.131801Z","title":"Lacon-and shrub-decompositions: A new cha racterization of first-order transduc- tions of bounded expansion classes","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.131801Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:6a904f55f864ad9f396194f7fa95206bc418b46f06d910de7fba06c199c19ce2","observation_id":"be12b17f-2838-4fee-aa5a-da82c7d5e9cd","resolution":{"observed_at":"2026-08-12T14:28:19.131801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.18740","last_updated":"2023-11-30T17:38:00Z","snapshot_observed_at":"2026-08-18T05:24:40.805671Z","submitted_at":"2023-11-30T17:38:00Z","title":"First-Order Model Checking on Monadically Stable Graph Classes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.18740","snapshot_observed_at":"2026-08-12T14:28:19.136947Z","title":"First-order model checking on monadically stable graph classes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.136947Z"},"links":{"cited_paper":"/paper/2311.18740","citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:bcfd223a9532e75bfb6df680882b99a1747fe11dd52550e24b0bfb273b6c97c7","observation_id":"501a737d-e4cc-4241-b847-27765d575397","resolution":{"observed_at":"2026-08-12T14:28:19.136947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.146150Z","title":"Tree- like decompositions for transductions of sparse graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.146150Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:5390dc65bb28b75e010339d207985a9296ced249fc7b5d98cdd3d02930702cf9","observation_id":"0a4b78a2-7ced-4a83-b17b-2d6a444f33e1","resolution":{"observed_at":"2026-08-12T14:28:19.146150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.152506Z","title":"Mouawad, Sebastian Siebertz, and Alexandre Vigny","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.152506Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:90ea6c01546e55ba051280560dbe02aea003ba37f3c550d4fa2edcdb31e41615","observation_id":"94c08076-54a9-4aa5-ab05-a59e0ab0a947","resolution":{"observed_at":"2026-08-12T14:28:19.152506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.157831Z","title":"First-order model checking on struc- turally sparse graph classes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.157831Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:4776b7d2922b44596293bc93ad83e482c6d74ad36c8b6c5713e85f59bb94951c","observation_id":"0a29422b-fbea-4577-9e6c-2991a2208915","resolution":{"observed_at":"2026-08-12T14:28:19.157831Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.163780Z","title":"Indiscernibles and flatness in monadically stable and monadically nip class es","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.163780Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:37fbb1a082c8c6cb3107b91c10da76c822d61ddbfc1b2df10dd5bb57e5558c9a","observation_id":"9ed272c8-a0cc-4e48-84a9-0b593ac589fd","resolution":{"observed_at":"2026-08-12T14:28:19.163780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.171375Z","title":"In Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages 1550–1560, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.171375Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:f575ba42f25738cd519ede727ec22bf9e6e1266f94209a5d3212ddd3fca2c1f2","observation_id":"3157d5e3-6f48-419d-b1de-971d4c1b0365","resolution":{"observed_at":"2026-08-12T14:28:19.171375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.178393Z","title":"Deciding first-order properties for sparse graphs","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.178393Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:c88ba39ba3329a255357c8834272bad12cf8ae090aa0275413f7d3eca8da1867","observation_id":"a05a1f51-4b43-4427-bf31-0df5fe45ad2e","resolution":{"observed_at":"2026-08-12T14:28:19.178393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.185080Z","title":"Testing first-order properties for subclasses of sparse graphs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.185080Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:a9b094daf4a8846911abfc0e94e015799cc43ab08c50e520d52e4a489cf6b4ae","observation_id":"e0e91bdd-e62a-464a-9065-f9792c21d5ff","resolution":{"observed_at":"2026-08-12T14:28:19.185080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.190715Z","title":"Perspectives in Mathematical Logic","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.190715Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:2aff9d3a15fab3eb568261fc7af8afe2ca03fab6a03304c00cc92f834aac15ed","observation_id":"5f8a7b55-5259-4d63-9a0a-465f4343d425","resolution":{"observed_at":"2026-08-12T14:28:19.190715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:19.196251Z","title":"Mathematical logic (2","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.196251Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:a8f5ab9dc2ff975f6f9e4a08e684f923d297a99c315ecd7ac8ae6168789bf6e4","observation_id":"473aa165-2e60-4de0-b2d4-6604ca66cc50","resolution":{"observed_at":"2026-08-12T14:28:19.196251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.427676Z","title":"Model-checking on ordered structures","venue":null,"work_id":"70114cfd-8694-4fdb-9c0c-d7ce136de9b3","year":2020},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.204575Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:9a6a9ba244d2f562795b4de172d5e707437af6d830707b31b9e8cfbd4402e0bd","observation_id":"54001825-424c-4ca2-826d-1aa7d540bfef","resolution":{"observed_at":"2026-08-12T14:28:21.433335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.409973Z","title":"Counting quantifiers, successor rela tions, and logarithmic space","venue":null,"work_id":"ab47a1b8-865a-4915-994f-a3092d9026ca","year":1997},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.209865Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:028ebd0b35ebe08d6ec690588f5d60ae6200598844305e3cca16c2b4a6e02b90","observation_id":"69fb07e2-8883-4fa5-9bbd-59a211339a5d","resolution":{"observed_at":"2026-08-12T14:28:21.416371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.391989Z","title":"Generalized first-order spectra and poly nomial-time recognizable sets","venue":null,"work_id":"1c29d75c-274c-4a96-b0bc-69b31cbc20d1","year":1974},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.215425Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:571088af35ed9d9d1353ecc1e427b7d94c6bc2d03fc6401784022cb4d7a15598","observation_id":"8c19a86e-d8df-401d-976e-7ecfcf3dfdce","resolution":{"observed_at":"2026-08-12T14:28:21.398439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.373647Z","title":"Monadic generalized spectra","venue":null,"work_id":"dbcde379-4ddb-481a-bccd-df0569f890c6","year":1975},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.220627Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:814fcbf4ed34745acc76e41867e039b145db4e391cf7e5d692684f59dcb7c3d7","observation_id":"7874c106-226d-47b6-bdf5-eebcd6a00ec8","resolution":{"observed_at":"2026-08-12T14:28:21.378881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.356615Z","title":"The first order pro perties of products of algebraic systems","venue":null,"work_id":"3ecac744-d1e0-4b2e-980d-55696b3a7c32","year":1967},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.225668Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:0d1783ab69c0a90f0253440777443e033a8ea534ec75b1c6c045302584baa089","observation_id":"e932e797-90e7-47c3-a84a-0bc824724ad6","resolution":{"observed_at":"2026-08-12T14:28:21.362013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.338318Z","title":"Fixed-parameter tractability, definability, and model-checking","venue":null,"work_id":"fafbc1e4-bf5e-4bba-9d21-58be83162f47","year":2001},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.230570Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:52179bc0ca667141969e7cfdac4fa8d8a50eea108c961e982d03d69f83b4a091","observation_id":"f73d3df0-612f-42a2-801e-76ed9b30181a","resolution":{"observed_at":"2026-08-12T14:28:21.344673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.317818Z","title":"Texts in Theoretical Com- puter Science","venue":null,"work_id":"9b8e526d-a196-4b40-9759-07ed079741ce","year":2006},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.235407Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:a3bb1246fde27ab732799a53f63c599e6d85496dca75a9f366d2e790ee9174f8","observation_id":"5e45eabf-0c4d-4582-8476-01d5ba6f1b0c","resolution":{"observed_at":"2026-08-12T14:28:21.324023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.295396Z","title":"Compound logics for modification problems","venue":null,"work_id":"dd1e0b78-9627-4090-b8f5-82b7bcdfe660","year":2023},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.240599Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:3f1e89266fb77d6de60dd9710b6ba02d0386a83e0a9dab84393b3b68eb76d8f3","observation_id":"091967bb-1f0f-4053-a62e-f1b0bf311a94","resolution":{"observed_at":"2026-08-12T14:28:21.300883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.278044Z","title":"An algo- rithmic meta-theorem for graph modification to planarity an d fol","venue":null,"work_id":"f87b65e7-4d33-44d7-8a2b-f969445c349e","year":2023},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.248244Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:a5f6b34f94513c27be0aae86169acff56d7faacbf6536eaa129acb66b61203e4","observation_id":"0ceeb5f5-1562-47b9-b884-bc9da479a5e9","resolution":{"observed_at":"2026-08-12T14:28:21.283845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.257916Z","title":"Deciding first-order pro perties of locally tree-decomposable structures","venue":null,"work_id":"cc15ae05-ac81-4080-8387-28a2ee4c5de9","year":2001},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.253054Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:77db6873f7e3ed2129b1c2ee92f0216dbb49f18c5d1a6031b8a7ec37415dc472","observation_id":"c1e07ed1-9d94-4745-98df-04f8fa068c00","resolution":{"observed_at":"2026-08-12T14:28:21.263760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.241073Z","title":"On local and non-local properties","venue":null,"work_id":"aa1d1423-51ed-4c2f-8a2d-e136ef8336ab","year":1982},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.258573Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:bdbb5ba0ccbfad8104ba91069cdfe4e7b7331c3f5701ac525daeac47433b8031","observation_id":"bce21575-294e-4650-a9c3-40d068cbcd98","resolution":{"observed_at":"2026-08-12T14:28:21.246424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.224424Z","title":"A new perspective on FO model checking of dense graph cla sses","venue":null,"work_id":"e1227755-85b1-49c5-b87f-8e25cb2d0c96","year":2020},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.265060Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:4f5a953990d8cc7e5d3d93d536f165bca4de5a1ff82789910806dc5c141f4cba","observation_id":"a1046d61-ec47-425e-ada3-5a121291e41a","resolution":{"observed_at":"2026-08-12T14:28:21.229806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.206782Z","title":"Recovering sparse graphs","venue":null,"work_id":"f53a7860-2c34-4ad7-984f-74fc602c1ab4","year":2018},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.269994Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:77e959186b794cfd8dbab5ee49d4af34a60197767f35c3cf4ec2a4264245a5de","observation_id":"d23754ad-561d-43df-aacd-3ba6e10f0616","resolution":{"observed_at":"2026-08-12T14:28:21.212218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.189123Z","title":"First-order interpretations of bounded expansion classes","venue":null,"work_id":"c10fab2d-5de8-4b7a-a824-9d524d9e5ce9","year":2020},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.276070Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:ca89b9b745d9da9f448e9138f6b02c173858f77a5a1b1d9236eca2eaad89f909","observation_id":"ca827329-d5f0-42c4-a9fd-247203bf5d1c","resolution":{"observed_at":"2026-08-12T14:28:21.194464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.170608Z","title":"Flip- per games for monadically stable graph classes","venue":null,"work_id":"3d36d770-b7a1-48b2-b662-bb0237ba7b6c","year":2023},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.282139Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:7620cfe42eb645bfc2c963f4e7cd4a44d5c65052301f5ba0f59ec26815847e5d","observation_id":"6885a43c-a19c-4c45-a76d-58956f8c4223","resolution":{"observed_at":"2026-08-12T14:28:21.177214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.152547Z","title":"Twin- width and types","venue":null,"work_id":"204894a4-c8c4-4c95-b2cd-8495b4b621b0","year":2022},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.287570Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:cd7d4c91d4495db2f1f9305f561e94b4bc35562c079ddc4a677973892d755846","observation_id":"f94ea303-cc56-448f-afa3-c77dddfe2d4e","resolution":{"observed_at":"2026-08-12T14:28:21.157782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.133846Z","title":"Stable graphs of bounded twin- width","venue":null,"work_id":"7068de35-7163-4d11-8917-21425d1a7ef5","year":2022},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.292810Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:5e89022398a3e55fb2f705c8b1ec2336c9498076e5c645df4c6137b413d5272e","observation_id":"25c6dce2-0c79-4355-9760-dc22d8268106","resolution":{"observed_at":"2026-08-12T14:28:21.139430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.115932Z","title":"Lower bounds on the complexity of MSO 1 model-checking","venue":null,"work_id":"8d09175d-ddf2-45ef-a707-ac5c114a7aa7","year":2014},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.298043Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:9737070327925b1b1cd7c7958bdfe6c0c1dd0d67e561a07fe9a0b86b73e6902e","observation_id":"2457928e-b911-42e2-a436-eac585c46aa9","resolution":{"observed_at":"2026-08-12T14:28:21.121449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.097075Z","title":"Shrub-depth: Capturing height of dense graphs","venue":null,"work_id":"0dd917fa-86a5-491d-af89-48f54aa5c156","year":2019},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.304830Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:073daea749e1a40fcbe7bc04c3448c299b1967190d78e5b9f869300a29911be5","observation_id":"49756e0f-3818-48ab-8ae9-6fa49341dcc7","resolution":{"observed_at":"2026-08-12T14:28:21.102835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.077423Z","title":"When trees grow low: Shrubs and fast MSO1","venue":null,"work_id":"9a0b0d8a-1468-4dfb-aac0-8de286973f26","year":2012},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.310340Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:d5bf8a0f12229dd63e4b3b19a6a36cc3ba4a2eaab2e2e35114a249dae8eb1937","observation_id":"127161c9-6fee-4733-8dd3-51889a3f9f06","resolution":{"observed_at":"2026-08-12T14:28:21.083600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.057039Z","title":"Order-invariant MSO is s tronger than counting MSO in the finite","venue":null,"work_id":"2f1e927f-9c8d-4eb4-b1eb-572964b4d3f8","year":2008},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.315819Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:cd9e1ad21da939a45cfdcde400580dada30fe329dd2eb6e7d932b1dc28760777","observation_id":"eaf49474-2f81-4242-9d7f-85be01e9c92e","resolution":{"observed_at":"2026-08-12T14:28:21.063532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.038019Z","title":"Twin-Width, logical and combinatorial characterisations","venue":null,"work_id":"3d756c8d-3225-4dfa-8201-f962306b456c","year":2024},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.320571Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:45864cd6a6f1bccf60381767e6dacd7f9fb71eafff6c817209bb5321c743a608","observation_id":"cabefe13-05d2-40c6-8d5d-34d5dc8f0793","resolution":{"observed_at":"2026-08-12T14:28:21.043895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:21.003658Z","title":"Model-checking for first-order logic with disjoint paths predicates in proper minor-close d graph classes","venue":null,"work_id":"6aab42af-671c-4580-a368-e7e44cdc109b","year":2023},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.325590Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:ce7adfa061bc29b2a0237b2f12b2427c1d2503998a8f99c54b6916af2d647d18","observation_id":"e00bf529-0e48-404d-9239-91dd23979784","resolution":{"observed_at":"2026-08-12T14:28:21.012860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.972672Z","title":"Springer, 2007","venue":null,"work_id":"c806b573-7966-4174-9cbb-c61aec80eaf9","year":2007},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.332229Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:4b175468597a37bf1c99db9e948f3aae9527f3d8802adcb36a36b6dba9959270","observation_id":"d5e1310a-d56b-4892-bb84-574168605044","resolution":{"observed_at":"2026-08-12T14:28:20.985061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.949281Z","title":"Discrepancy and sparsity","venue":null,"work_id":"790c983a-3fd4-47e7-b383-e61c3dc4c42a","year":2024},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.338266Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:da14300f4f2b513a9fc21d3ad34990897dd2a90f8ab93791ffbc71de14658b22","observation_id":"06bf7f66-d771-4fd6-87c5-65fb359175b5","resolution":{"observed_at":"2026-08-12T14:28:20.957302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.920265Z","title":"Logic, graphs, and algorithms","venue":null,"work_id":"e9738b80-be0d-4ce2-a506-46bf8fa32bc2","year":2008},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.343613Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:d5b77764d451798f8373ecb18d51fa84e738d20d6da4075053f3209833d249dd","observation_id":"d859b581-8df5-4623-8e91-4639e7f4a01b","resolution":{"observed_at":"2026-08-12T14:28:20.929497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.868185Z","title":"Finding topolog- ical subgraphs is fixed-parameter tractable","venue":null,"work_id":"8fa1d070-af56-40d7-9460-df039361c83d","year":2011},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.348608Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:42ab835275a9e96e1cce2f2e27bb8ebab63f38b0f939823a4d774cbaf433cf83","observation_id":"078434fc-9c22-45ff-b1c2-fff315fda092","resolution":{"observed_at":"2026-08-12T14:28:20.885711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.839631Z","title":"Methods for algorit hmic meta theorems","venue":null,"work_id":"dd101be5-0526-487d-aa90-50fc6d2ce6ca","year":2009},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.353528Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:3e55545be65800c75f16608944a79e2e78be84d68b094c9cfa3ccd07773de63b","observation_id":"7c617f25-afbc-4c31-9028-f496b95671d2","resolution":{"observed_at":"2026-08-12T14:28:20.847762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.815024Z","title":"Deciding first-order properties of nowhere dense graphs","venue":null,"work_id":"d12f7564-8fe9-4483-80af-f526e7ca52e6","year":2017},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.359111Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:5e98e3f9472739ee9d7fadec70ad1ea6e0b6bc7439f605fc0e27421cab5cabcb","observation_id":"da340fb3-aa10-4a91-b8f9-f19c82c328e2","resolution":{"observed_at":"2026-08-12T14:28:20.823014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.791819Z","title":"First-order quer y evaluation with cardinality condi- tions","venue":null,"work_id":"138aeff8-2eee-4126-af7d-311a9ea4a25e","year":2018},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.364370Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:dd5c924924fab2ce815d298d5a6cc1a238c9f6c01cfcaa8d731eef29ea962dcf","observation_id":"5ecd8cf4-4a12-4f83-9b1d-f8853cc4dab3","resolution":{"observed_at":"2026-08-12T14:28:20.800579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.769948Z","title":"Logic and the challenge of computer scie nce","venue":null,"work_id":"6ed86754-9d6a-4222-9900-4bfefb3c7b05","year":1985},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.370146Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:cbdb1219f6a6a6ff076624734ccc48789b99666db4bd8be9e06537eca8866083","observation_id":"b38a4b31-9d3b-4e26-8816-327870d6291b","resolution":{"observed_at":"2026-08-12T14:28:20.777767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.749293Z","title":"Model theory, volume 42 of Encyclopedia of mathematics and its applications","venue":null,"work_id":"42a9a369-6bd1-4168-8d7a-b42251c540a1","year":1993},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.375216Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:6b3c60d933a627c6739a0d4eaf7e9adf28abc0f8e976333a6ef7579f8aab6034","observation_id":"957b117e-ffbe-4b21-a63c-760d06e93c94","resolution":{"observed_at":"2026-08-12T14:28:20.756128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.728346Z","title":"Upper and lower bounds for first order exp ressibility","venue":null,"work_id":"b238b899-08a7-4dcd-9d4d-551915de66ef","year":1982},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.380094Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:73fd505351c3d97864c6104d27368c7d377b102c9de54a4ded8ce0033cf10c79","observation_id":"bff8f9c5-6dbd-4b3e-8a85-7dfbef9d97a0","resolution":{"observed_at":"2026-08-12T14:28:20.735794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.704875Z","title":"Languages that capture complexity clas ses","venue":null,"work_id":"8ab6af3c-013b-42c8-a527-3dbe65445bba","year":1987},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.384802Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:c91a181eb0d579033e68782e69056cbd32e152156d2a9e40a221efc8778847bd","observation_id":"9a6427b1-f389-4b94-8a7f-0e81fb02218b","resolution":{"observed_at":"2026-08-12T14:28:20.712906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.683639Z","title":"Descriptive complexity","venue":null,"work_id":"ab2998f8-5163-4451-85e7-d57d94fccd9a","year":1998},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.389263Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:93b5c8bc87941296998618ea0538aae044f997b10e0df6315de0561e2c3bd62a","observation_id":"05d43882-3379-4e80-9820-d736032349c9","resolution":{"observed_at":"2026-08-12T14:28:20.690045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.663007Z","title":"Regular partitions of gentle graphs","venue":null,"work_id":"b66f3c94-1db6-4e9d-956c-fdb3b3d6873b","year":2020},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.393785Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:4247d6f33ef46a298aa41dd1da12d3d37d2bf90e889e4a1110c089204138264b","observation_id":"04e199a5-bb42-495c-b5ce-42d054754aaf","resolution":{"observed_at":"2026-08-12T14:28:20.668605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.642812Z","title":"The minimumk-way cut of bounded size is fixed- parameter tractable","venue":null,"work_id":"2068a421-6e39-4b65-8d47-c08b51682a4f","year":2011},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.398538Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:0c729a52aef09ea5312abdd196d73c8a2c08c670f4b30d9b7a92ff435d907b2f","observation_id":"beff9bab-6c77-41dd-88e4-e331886d68f3","resolution":{"observed_at":"2026-08-12T14:28:20.648845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.625185Z","title":"Algorithmic meta-theorems","venue":null,"work_id":"43cccd73-5a4b-46d9-9b03-b6bb87b48ce3","year":2011},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.403222Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:b6efe6439897d18f752725926f00335904a29a5ceb9388fb18e4b0b67fa4e385","observation_id":"2731eb50-c01b-4241-97c8-6c4df61bfd6d","resolution":{"observed_at":"2026-08-12T14:28:20.630615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.606095Z","title":"On the parameterized intractabilit y of monadic second-order logic","venue":null,"work_id":"8407063f-2b64-4069-ba29-209ef214252d","year":2012},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.408019Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:cfaa355f1fdefe13be67535a31b1e7833f36e544a3f5ef1cf9a7125670597c70","observation_id":"d3231600-4768-4c52-9282-84e14e287ad4","resolution":{"observed_at":"2026-08-12T14:28:20.612736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.587634Z","title":"Lower bounds for th e complexity of monadic second- order logic","venue":null,"work_id":"349074ad-9fff-4898-9230-eb75dcd40cba","year":2010},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.412690Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:5f7c8cf1f47c6cb95cd98d349f17deb61a419134bf00f002bba1a8c25c46d044","observation_id":"2cff5483-8b2b-46b0-9f8a-260e33b24840","resolution":{"observed_at":"2026-08-12T14:28:20.593941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.564495Z","title":"On brambles, grid- like minors, and parameterized intractability of monadic second-order logic","venue":null,"work_id":"790960e7-51fc-4afc-adce-3c2e0ded96c6","year":2010},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.418232Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:20100b1def522d2adbee647d662df178db22b2645a0e7e5e7f12d66b77701e5f","observation_id":"ad9bf112-8f05-47ec-8178-b5a47fc07e27","resolution":{"observed_at":"2026-08-12T14:28:20.570783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.535314Z","title":"First-order logic with counting","venue":null,"work_id":"a104458f-78bb-4233-8b6a-89454f6aaa1f","year":2017},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.422800Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:c046940650511f75535eb96af9099a828b09e41c1271e01662fc07461148af67","observation_id":"978f0668-90d0-4c0e-ae59-4389d2823df1","resolution":{"observed_at":"2026-08-12T14:28:20.541201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.509736Z","title":"Gaifman normal forms for counting extensions of first- order logic","venue":null,"work_id":"44e9d3df-ef50-44cd-80bc-25eb9d33d0bb","year":2018},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.427861Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:449e2ffe45c43ab64e337056d8a68957a47c4298835d9230d5d4f76175e51cb4","observation_id":"fb77c5dc-0a81-40f1-847e-3d54ec1065ea","resolution":{"observed_at":"2026-08-12T14:28:20.516151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.490193Z","title":"Elements of finite model theory , volume 41","venue":null,"work_id":"5a4aedae-1524-47de-93cf-8a818bf7f46c","year":2004},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.433087Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:52d11308f734ef6a0b72db544023693233acb3414589ed2f8da55a5f776efda8","observation_id":"441ef3d5-aed1-4e4a-8392-4055a33d5100","resolution":{"observed_at":"2026-08-12T14:28:20.496464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.471897Z","title":"Elements of Finite Model Theory","venue":null,"work_id":"4203df2c-65bf-4d8a-84a3-8be79c70ea53","year":2004},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.437734Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:16e87cc063b418c691562ade0bc2b91b39190c3c4522066ce9eda6b9e10acfa1","observation_id":"bbf4b5df-0eb9-4361-a2df-63d7b2e50fc0","resolution":{"observed_at":"2026-08-12T14:28:20.477647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.449621Z","title":null,"venue":null,"work_id":"cb212205-9d5f-4045-a4ec-257915b07cab","year":2018},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.442445Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:a48ea2b76c8c9b22392fa7d8b3155c995f910bfb8e8e61e2028a028fab52ccaa","observation_id":"9e41f4ab-13a1-430a-a333-a22ea383fab0","resolution":{"observed_at":"2026-08-12T14:28:20.457201Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.432039Z","title":"PhD thesis, Universit¨ at Bremen, 2024","venue":null,"work_id":"6bf280e2-5c1f-47a5-9d06-626745b303d8","year":2024},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.447196Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:a0184b925349e48a6f5bc83c211a084eb27f2cbe74d8b142ccd191cb777cf3a4","observation_id":"4171b6b9-f94f-4eb3-9c5a-a98c5c613de3","resolution":{"observed_at":"2026-08-12T14:28:20.437921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.413198Z","title":"Tree-width and the mona dic quantifier hierarchy","venue":null,"work_id":"7fdee988-4fce-4496-a455-c6457e25ee6a","year":2003},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.452096Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:87603d5c10537dc6ef2826b77991ad667846ea518077efa8ffc9993f251d3df3","observation_id":"742d9519-4fd4-49cd-8700-6a5da6a9cad5","resolution":{"observed_at":"2026-08-12T14:28:20.419320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.394376Z","title":"Regularity le mmas for stable graphs","venue":null,"work_id":"c43016f4-2f56-4836-84b6-cdbaadfe97d4","year":2014},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.457151Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:27a91f0bf06d92a0ba24a5732b5c02632fb6ff2a2d6843b69a4e96be7095fddd","observation_id":"05b6bfb5-46ed-405f-85d6-72dc9fc40ce6","resolution":{"observed_at":"2026-08-12T14:28:20.400571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.370405Z","title":"Structural sparsity","venue":null,"work_id":"b813c102-26b1-4e6a-9b93-dd2ac35d6c77","year":2016},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.462613Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:98860bcec83fe6b6c930ce536a3a63308ed7897692011304c3fd5725d31b8b2c","observation_id":"86df8bd3-814e-441e-b959-981726515ab6","resolution":{"observed_at":"2026-08-12T14:28:20.377930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:28:20.344284Z","title":"On n owhere dense graphs","venue":null,"work_id":"22c46043-b440-4963-9757-ab8699ed7d8e","year":2011},"citing_paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems","version":1},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-08-12T14:28:19.468582Z"},"links":{"citing_paper":"/paper/2411.15365"},"observation_digest":"sha256:3256bab9d8fe4924e71d1f28734a91c889be51939dbc62ef2491f68573dcdae8","observation_id":"b49d2869-cf6d-4925-95f3-4ae9467da8ad","resolution":{"observed_at":"2026-08-12T14:28:20.349794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.15365","last_updated":"2024-11-22T22:15:14Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-18T20:33:53.710725Z","submitted_at":"2024-11-22T22:15:14Z","title":"Advances in Algorithmic Meta Theorems"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":50,"verified_exact":0,"verified_fuzzy":50},"total_outbound_references":125},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 100 of 125 outbound references and 0 inbound Pith citation observations for arXiv:2411.15365."}