{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Y2RPHMS7MHOEVXG4LQ4SQ77CX6","short_pith_number":"pith:Y2RPHMS7","schema_version":"1.0","canonical_sha256":"c6a2f3b25f61dc4adcdc5c39287fe2bfbe79d364b24e0182325457c6f70096a2","source":{"kind":"arxiv","id":"1109.5804","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds on the Complexity of MSO1 Model-Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LO","authors_text":"Alexander Langer, Jan Obdr\\v{z}\\'alek, Peter Rossmanith, Petr Hlin\\v{e}n\\'y, Robert Ganian, Somnath Sikdar","submitted_at":"2011-09-27T08:45:10Z","abstract_excerpt":"One of the most important algorithmic meta-theorems is a famous result by Courcelle, which states that any graph problem definable in monadic second-order logic with edge-set quantifications (i.e., MSO2 model-checking) is decidable in linear time on any class of graphs of bounded tree-width. Recently, Kreutzer and Tazari proved a corresponding complexity lower-bound - that MSO2 model-checking is not even in XP wrt. the formula size as parameter for graph classes that are subgraph-closed and whose tree-width is poly-logarithmically unbounded. Of course, this is not an unconditional result but h"},"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":"1109.5804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-27T08:45:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4ca807d22865626949014ad0cc591d70fec77db29de79a1b73370b3818647472","abstract_canon_sha256":"d2c79b836a27a743c1368df388d1aa49da63ddb69f74aac430d8ec49ee5793b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:53.295570Z","signature_b64":"em+D6VhrAcpAi5Zo0skpY+ichpIh+ZqIbJrwDJKupM0Z6RcXE3OG8oVpjP1rpWOLjOPBmeZmUcS5BqhFXO9dAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6a2f3b25f61dc4adcdc5c39287fe2bfbe79d364b24e0182325457c6f70096a2","last_reissued_at":"2026-05-18T03:52:53.294985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:53.294985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on the Complexity of MSO1 Model-Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LO","authors_text":"Alexander Langer, Jan Obdr\\v{z}\\'alek, Peter Rossmanith, Petr Hlin\\v{e}n\\'y, Robert Ganian, Somnath Sikdar","submitted_at":"2011-09-27T08:45:10Z","abstract_excerpt":"One of the most important algorithmic meta-theorems is a famous result by Courcelle, which states that any graph problem definable in monadic second-order logic with edge-set quantifications (i.e., MSO2 model-checking) is decidable in linear time on any class of graphs of bounded tree-width. Recently, Kreutzer and Tazari proved a corresponding complexity lower-bound - that MSO2 model-checking is not even in XP wrt. the formula size as parameter for graph classes that are subgraph-closed and whose tree-width is poly-logarithmically unbounded. Of course, this is not an unconditional result but h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5804","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1109.5804","created_at":"2026-05-18T03:52:53.295066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5804v2","created_at":"2026-05-18T03:52:53.295066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5804","created_at":"2026-05-18T03:52:53.295066+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2RPHMS7MHOE","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2RPHMS7MHOEVXG4","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2RPHMS7","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6","json":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6.json","graph_json":"https://pith.science/api/pith-number/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/graph.json","events_json":"https://pith.science/api/pith-number/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/events.json","paper":"https://pith.science/paper/Y2RPHMS7"},"agent_actions":{"view_html":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6","download_json":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6.json","view_paper":"https://pith.science/paper/Y2RPHMS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5804&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/action/storage_attestation","attest_author":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/action/author_attestation","sign_citation":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/action/citation_signature","submit_replication":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/action/replication_record"}},"created_at":"2026-05-18T03:52:53.295066+00:00","updated_at":"2026-05-18T03:52:53.295066+00:00"}