{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LK4NRU3Z3HBP4QHJL4F455J7I7","short_pith_number":"pith:LK4NRU3Z","schema_version":"1.0","canonical_sha256":"5ab8d8d379d9c2fe40e95f0bcef53f47fa0c4ce588cf5ee73051f1fa01b0f47e","source":{"kind":"arxiv","id":"2311.18740","version":1},"attestation_state":"computed","paper":{"title":"First-Order Model Checking on Monadically Stable Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO","math.LO"],"primary_cat":"cs.LO","authors_text":"Ioannis Eleftheriadis, Jan Dreier, Micha{\\l} Pilipczuk, Nikolas M\\\"ahlmann, Rose McCarty, Szymon Toru\\'nczyk","submitted_at":"2023-11-30T17:38:00Z","abstract_excerpt":"A graph class $\\mathscr{C}$ is called monadically stable if one cannot interpret, in first-order logic, arbitrary large linear orders in colored graphs from $\\mathscr{C}$. We prove that the model checking problem for first-order logic is fixed-parameter tractable on every monadically stable graph class. This extends the results of [Grohe, Kreutzer, and Siebertz; J. ACM '17] for nowhere dense classes and of [Dreier, M\\\"ahlmann, and Siebertz; STOC '23] for structurally nowhere dense classes to all monadically stable classes.\n  As a complementary hardness result, we prove that for every hereditar"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2311.18740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-11-30T17:38:00Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO","math.LO"],"title_canon_sha256":"fd6f1980546c294cc8cc5c280877cc3e778d3957b46424b6ad49b54e1f1bee96","abstract_canon_sha256":"4f42afb024ec7b51d6df62df14457a264c2ea158d759771a875d0c5a5ff49390"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:18:46.110149Z","signature_b64":"5fgeqr3bvEa/lwSOQl1GN9HG8ndE8jeGMfAEkBnnzgkBoU4xPBSmZZbQ/v/r4C0Cq9FqDo+X86HFuCHjfIx5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ab8d8d379d9c2fe40e95f0bcef53f47fa0c4ce588cf5ee73051f1fa01b0f47e","last_reissued_at":"2026-07-05T07:18:46.109700Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:18:46.109700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-Order Model Checking on Monadically Stable Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO","math.LO"],"primary_cat":"cs.LO","authors_text":"Ioannis Eleftheriadis, Jan Dreier, Micha{\\l} Pilipczuk, Nikolas M\\\"ahlmann, Rose McCarty, Szymon Toru\\'nczyk","submitted_at":"2023-11-30T17:38:00Z","abstract_excerpt":"A graph class $\\mathscr{C}$ is called monadically stable if one cannot interpret, in first-order logic, arbitrary large linear orders in colored graphs from $\\mathscr{C}$. We prove that the model checking problem for first-order logic is fixed-parameter tractable on every monadically stable graph class. This extends the results of [Grohe, Kreutzer, and Siebertz; J. ACM '17] for nowhere dense classes and of [Dreier, M\\\"ahlmann, and Siebertz; STOC '23] for structurally nowhere dense classes to all monadically stable classes.\n  As a complementary hardness result, we prove that for every hereditar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.18740","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.18740/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2311.18740","created_at":"2026-07-05T07:18:46.109756+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.18740v1","created_at":"2026-07-05T07:18:46.109756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.18740","created_at":"2026-07-05T07:18:46.109756+00:00"},{"alias_kind":"pith_short_12","alias_value":"LK4NRU3Z3HBP","created_at":"2026-07-05T07:18:46.109756+00:00"},{"alias_kind":"pith_short_16","alias_value":"LK4NRU3Z3HBP4QHJ","created_at":"2026-07-05T07:18:46.109756+00:00"},{"alias_kind":"pith_short_8","alias_value":"LK4NRU3Z","created_at":"2026-07-05T07:18:46.109756+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19551","citing_title":"Boolean combinations of graphs","ref_index":2006,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LK4NRU3Z3HBP4QHJL4F455J7I7","json":"https://pith.science/pith/LK4NRU3Z3HBP4QHJL4F455J7I7.json","graph_json":"https://pith.science/api/pith-number/LK4NRU3Z3HBP4QHJL4F455J7I7/graph.json","events_json":"https://pith.science/api/pith-number/LK4NRU3Z3HBP4QHJL4F455J7I7/events.json","paper":"https://pith.science/paper/LK4NRU3Z"},"agent_actions":{"view_html":"https://pith.science/pith/LK4NRU3Z3HBP4QHJL4F455J7I7","download_json":"https://pith.science/pith/LK4NRU3Z3HBP4QHJL4F455J7I7.json","view_paper":"https://pith.science/paper/LK4NRU3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.18740&json=true","fetch_graph":"https://pith.science/api/pith-number/LK4NRU3Z3HBP4QHJL4F455J7I7/graph.json","fetch_events":"https://pith.science/api/pith-number/LK4NRU3Z3HBP4QHJL4F455J7I7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LK4NRU3Z3HBP4QHJL4F455J7I7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LK4NRU3Z3HBP4QHJL4F455J7I7/action/storage_attestation","attest_author":"https://pith.science/pith/LK4NRU3Z3HBP4QHJL4F455J7I7/action/author_attestation","sign_citation":"https://pith.science/pith/LK4NRU3Z3HBP4QHJL4F455J7I7/action/citation_signature","submit_replication":"https://pith.science/pith/LK4NRU3Z3HBP4QHJL4F455J7I7/action/replication_record"}},"created_at":"2026-07-05T07:18:46.109756+00:00","updated_at":"2026-07-05T07:18:46.109756+00:00"}