{"as_of":"2026-08-13T13:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:343dab9a01650bd5e77a10b51ab5558c2ae4ce138f354109316b546e834d5efc","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-13T06:32:02.005865+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-12T14:20:40.540762Z","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:513f4d2cc5f47cefa127d019f56a016f36891457c6fcb109577e14d2c6317aea","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-12T14:20:40.540762Z","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:7cbc82f8ffb61e623f3938ad42065dd85cea37830cebb4a9fe6d9cab6d1f71c2","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-12T14:20:40.540762Z","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:c10546d2900d14d29449ddbed128767d53c8f7c20fc4a763601566ddebf66bc7","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-12T14:20:40.540762Z","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:2854c13d8896a0eb4397dba52d985a48479d3205b7ffe95e9d982108c4f6f1c0","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-11T21:13:25.007693Z","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-12T14:20:40.540762Z","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:a77f31ac05f803d46b16f1e225e1cc4f661fc9bcb68a8fefb3e39f9cd967a5c3","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-12T14:20:40.540762Z","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:ed3092ef39ec7eef63f17ddeb05ce90ae8f96f713bf2c99c90488574de493e90","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-12T14:20:40.540762Z","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:33d423c4eba82f14c8fcf8a919711680a23a36dd28d6e9ee4fe359b343bba8b3","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-12T14:20:40.540762Z","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:b5e4d34f5bf214618ef322bbad7dce32179bf0016ddaf302cbde48c7054b4752","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-12T14:20:40.540762Z","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:70250fd4b037e1295c9fda30ae285c342bcce408ae9708845a0dfd1aca083ada","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-12T14:20:40.540762Z","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:19d2b97db1216d9a5ee0c343e4843f366e82e29f3523acf157711e278038c8af","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-12T14:20:40.540762Z","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:8a080a46b7d6ed0294d5a507b91d4818f24732b1d8d66e4545b5387839617e33","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-12T14:20:40.540762Z","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:2247989aee3559112dbc694072b6d2be5d391e5f3f4cdc4452d1c562225edb8a","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-12T14:20:40.540762Z","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:c9f654027f0d7754cfbc5b236b29b2bbcfcd22bb65978c3b74995e546b51402b","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-12T14:20:40.540762Z","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:1551b961c1ccae4a7b8cbc8e30ed7c86ec0b562a34cd283b60e4330ea0f2c3c8","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-12T14:20:40.540762Z","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:38962ab86990257d259dbe149e15602bd159c4daba272b48549b7e5f6cf00d48","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-12T14:20:40.540762Z","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:9435cc5502fcda9c994642026fbb0c3bfe448e4593432f78ad225c6a51082357","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-11T08:45:11.873591Z","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-12T14:20:40.540762Z","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:0fdcd3756f4971869117a5f30bf3524a36ccd50feac23d59f5a9b6cbf3cd3715","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-12T14:20:40.540762Z","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:e87063241c11363d6c428f085156064b9629c4b42f0ccc99e95fb134bc3279e3","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-12T14:20:40.540762Z","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:96194171b7f6af50027d2bbbebfc516c756b86507432e0b6e1251a68ceff72f2","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-12T14:20:40.540762Z","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:bc2a22226ae6a28b38fe6f562769ff33f972d1a4a1d5bf48eac26b1b75786aff","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-12T14:20:40.540762Z","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:362c70eb19e3170a08a1ce7f4239e17ffba2e43531e5f45c83443f658627e635","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-12T14:20:40.540762Z","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:afb2654ed5eef5ee751154606f8959a7585b7e52bda0806f1523f1c302b20232","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-12T14:20:40.540762Z","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:0776e0000877da2e73496af0e790419101bed5a03b62b43ff693d827cdcdee85","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-12T14:20:40.540762Z","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:8cb818c1b2523fedfa775ea940b681e360d93efc336753f3c5c2ac3c350eacf8","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-12T14:20:40.540762Z","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:4c16b97e029d56a96f239938e8aee9fab3fb993b0ef28c85a574eee184932b00","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-12T14:20:40.540762Z","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:2a6856ce3a10f40fac2f69b83f98814ef51bc0111e74e8347fa3142b96ef5c35","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-12T14:20:40.540762Z","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:f4430cd465ebecbf5ff662582f76f3d1b30cfda60f15b0e719935b2697bf4162","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-12T14:20:40.540762Z","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:6bfd87f9cf9202eee12b0337e76b9d6942cfd0179b139120f9cb156d78403300","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-12T14:20:40.540762Z","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:35c318641cb7403ae54609afc0a41a0f04ead709fa5c8ad841cd55bb6fef4012","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-12T14:20:40.540762Z","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:c851917ed76b7eef5bb2d88d4324f9bac8ad42e144f6bbdebd9e022b518a9661","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-12T14:20:40.540762Z","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:f340a62bf135176e6b280a38e1b44e08090701c0b012fc8f09dfaf4a2191a9c0","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-12T14:20:40.540762Z","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:329636c807a50a83e45f03d1fb6caa047333008756603b28c145e2dfea604efb","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-12T14:20:40.540762Z","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:ff33141b1533d409c434dcf74198369f4a4e5ae8f4cc75190fb6bffb35f5d0a0","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-12T14:20:40.540762Z","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:cff7f557f49f3ade2217eb0580890ca12a40de718fe5c2d69a4da15a01653a63","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-12T14:20:40.540762Z","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:5197980ec4aa166778735c572eb91797788b5af1de70583429039700a11fbe81","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-12T14:20:40.540762Z","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:081bdd2ff211e1aa8e56bba92835c671424016bc2a5eed3da7d0ad26f86510b7","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-12T14:20:40.540762Z","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:8a66ab4043b30e7f3c9e1024e5d8205dd6e8166560462f2cee2b3f213a26e8e4","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-12T14:20:40.540762Z","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:71f97ed83350dae73023bcd151448e43b2c0b54dbc5e8e1b1bf2dc0991210b50","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-12T14:20:40.540762Z","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:a72221ff422fb996a3e11517cffbd7fa30f43cfdad7eaba1dbd54fc8af4c07e4","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-13T05:13:05.042515Z","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-12T14:20:40.540762Z","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:29f2aac468841653af35ab48aab70b140d87d3b517f2c11a0a94a00abfe5d8cf","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-12T14:20:40.540762Z","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:50b09765267f726a58ecc70b30e76015284e188c7f5d49dc58cc1cd93839cfe6","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-12T14:20:40.540762Z","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:f0e967d0de30b8dc168be18da7768d00b0320085a4fe6c9d44a35fad11bd108f","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-12T14:20:40.540762Z","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:61e216b04a52dfbe1ba3783574e9ed6f677d5fb3ecdca84fdebcd33734bfe34d","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-12T14:20:40.540762Z","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:6df88b2dd126ce388f84591a91dcfe484a155f13d1720f634f7c30a877563e08","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-12T14:20:40.540762Z","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:6b72939ce2dd31b529b288aeb5848454d87910cd704910094f561b410b64c1d8","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-12T14:20:40.540762Z","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:480560035d6298616a772d4617980bb889a2029484475bd73e2f88d282ec287f","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-12T14:20:40.540762Z","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:a2df986a4c000e4f282b6cf0ca0dbcbb12c34fdd22d7b06e5efdcce6ae736e04","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-12T14:20:40.540762Z","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:6bbe79557300a2a465b5a1afba90142676510dabc9ddaa360ec5327ad05cb55b","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-12T14:20:40.540762Z","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:4cc34876cdc34bfa61f42820a6f87a5be461694faa40ff0b28e10448f90c8489","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-12T14:20:40.540762Z","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:5986abadf49a728a0195f544311f7c844016a7ad99238e9c11d92fe8c7e6a006","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:9fd112cf355d4c3726ed84f4c8a7237d433c1b44a63297d11eb3c7b57d36c429","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:a60d58d363800b79f961698f53729c813ed673152cb59231f207e59caed89aad","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:9c3df782c21d40d7a2c77a3ad4c04f9d2d10c142f908aeebbedbc8ead3067600","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:0cc9076900a297bcbc8bca90ad1dc57028163dc8ad46db43ed1ce768c6ed3787","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:d0ee77b9a0828a50966590266a4b2ee66d897340d2474514efeaac416fe981c4","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:58848116fb7cf710429e906dee566fd335f822dfe5c43fd04468b998cf51d07b","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:a514ca5cb4f4e550a78bbf3b43345ac094a932d6eaaecab211080b9d5bbfc7ba","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:7a3e91be6ef7cbd3f432083190ba6ac483365cf0067a45e2b14d9c9eb44b20c8","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:5825ddd2484e054edac9f4f95a9c166358992679c5eaf8c765ac382c0d7b95c5","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:a54ae0a09bd52db5fe604f4544be1ba96c0eaf26f61d3a799ee0196b275e389b","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:769b80d4c5dfbc6a5f33f2041e58e4d622ad965e8f88f68a2e08d90d30384f30","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:885943a377a354e14fa497d27ab36607764d27eddbd6c9495ae39f256158606e","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:187d9bdb78fc3af57d54fd465b1a61f9c4cd5ade846886b333838f3a72a905c0","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:1b4dfcf6a4a5094eafd47936f098b786b65f31d83ca78865e89b30cc9fc52ccc","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:91c6c2f1570ce9e1167f1343258ac1ac6cf3009f3b0bea4e05532f0eecd732d0","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:7ce9133766961d0da40c30c41396ad1fdaa0b78f02fe09cdd06bb98455da9d1f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:c99ae587ae5ccaf0aee75f87eb5205801979870614f9c3db8debf8835f3b3b80","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:13ed3f515b1603ad75b1c6a0c7abf90579ef75b9a4bcb97ef1de6a9baf5c2d27","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:74cd7feae7b2d44ca45d14029d5dee65cb25fd6e84311ac642f42b8b4061aebb","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:d8ee38d233bfd5cddc7f8be2b426e574162e938299a4158a6f7e020c368423d8","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:3960e6191ef89fdd1c33579644bb5662734ed76f567e9872d505b84f4b65e8ca","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:b332b184c5b92bb4b0d7a5ac78f7dde812c19de619bcfc9914c6708ff765f550","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:e62f946e3ce11a2c60319e14aece853ff6095991e5c875454e9f5ba8ee45071b","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:dd100845a54b8689fecf2c8c98e50d24f3261c861f19e0f470a37a7f301c046a","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:cd2fd61ef38a9ecda81fc6301d8eb36b870a76ebb51cfa118b823b2f72f638f7","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:f3c9ab4c5a62f9f2e2a3ce2677f9bd3814295979995e645dea5f257bf9dad31c","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:ad67c49dfef01d5792545ed8b7c4bd2bb7f471492bcbf98798da659ff24d8bb0","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:545dc9a0d5ef6b45f314f300a0b531854d17d561971bd8a3b3e0bee8a9be0472","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:3e57845447cd502150c3998ef81791910607338bc4053175012ab9ee381b8cd9","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:3a64caf264060726b6c33780f31b2329dc2b6321dbfb8a638d4ce8049f192212","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:75e158c3291744991b3db7211b2999f00f8e95d4c0bcaabd6bfb9532b359246e","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:5542009d78e3b7b4571ad68c8ab036eaf5a2eecff0c74b37e5a102e0a22ded81","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:6353df2f28aed63d09b20c70d00210e6bb54d9105388200e06fe9eef0c33413f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:a6e1100f1963f3307dcf03599a52d815b9c6841c54ee4ddc3711f460996213ec","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:b8bb19c352ca48b4ca60e3edc95d1522136e0dbf972d53a93664ad1c5ab076a1","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:154aa23635b82540d7052307ffe72c6bb44e2471479aa902f21b180914c81126","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:d9bba4b1d448274a9c465998ed168c8bc5c7b6510a07dfc14558cb1dc9a289ac","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:effb1b0d47c7faeef54a830d0a372ea9a0d7b286d30dfd380738ffc63689bd31","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:d0ca31a311886696eb37d7aebec2c5e72aab21aaeb0e5e442c5897088e1763fd","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:b16607bae921ef07d6bb7e4d9596d284dd2f45184324045443a113c943c24b33","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:5774f01c1c655e4eb01e64d36696628c424de49bec61be1a6ab14a8ef1411bce","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:bfefaffb4b1b5b4e173214a6c7c084b553da548f2e6b559338a4a692155c82fa","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:8b73f576a8028be75a401ba48f2c60e67605406aa8c26df18c4f644fb8d2df4c","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:b294bdbef86b2d1ea80ba3642a6f2606a3090dd4db616a4df83358643e29042f","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:633a3174f4c084c00118462cb71a0f0196e49b42ec655bd0a66b92f2904acf6e","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:85cc4ed1417b9519b32ffedfb967e24eafac9aa5a00b5f7c2b5cbfcb37ee22b7","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:c2d19d3fe2f283fbf9c265e40744a5ac3cc6931c540aa4a5315990308297e077","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:b69080d0b5c01093835ebec61700d1c9f3925f91384f89d6b348db0008c5c499","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:18ab44aabf6982c0517150082697f84deb39eeb9853c9cdfe8a31e6bf45a4c08","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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:1e27c48e24a678920d977ae1d90c36882f2dbc3f2096d99e99730e59c4dee8bd","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T14:20:40.540762Z","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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 100 of 125 outbound references and 0 inbound Pith citation observations for arXiv:2411.15365."}