{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Y2RPHMS7MHOEVXG4LQ4SQ77CX6","short_pith_number":"pith:Y2RPHMS7","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"},"canonical_sha256":"c6a2f3b25f61dc4adcdc5c39287fe2bfbe79d364b24e0182325457c6f70096a2","source":{"kind":"arxiv","id":"1109.5804","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5804","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5804v2","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5804","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"Y2RPHMS7MHOE","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y2RPHMS7MHOEVXG4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y2RPHMS7","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Y2RPHMS7MHOEVXG4LQ4SQ77CX6","target":"record","payload":{"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"},"canonical_sha256":"c6a2f3b25f61dc4adcdc5c39287fe2bfbe79d364b24e0182325457c6f70096a2","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"},"source_kind":"arxiv","source_id":"1109.5804","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:52:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RG2DtqixoOULcOLqRd3OooQzTH8JAcUa+I8ySKm8r0oN8aZHdXwX3i6Ox1g73WHRVcA5x//NL4Vcf6s0LIqDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:28:09.865098Z"},"content_sha256":"144955923a8beb17d254d96575ac2ba5728c2100d93b77d60ea6c48abf70ea3d","schema_version":"1.0","event_id":"sha256:144955923a8beb17d254d96575ac2ba5728c2100d93b77d60ea6c48abf70ea3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Y2RPHMS7MHOEVXG4LQ4SQ77CX6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:52:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AINplzwBtrc6fEdLljj2+QLGU2pHEBXTN6bioSElsSBl97X2qm51nr9tbn9/naAQog6OxHvLqAcRJrMsFyY/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:28:09.865462Z"},"content_sha256":"9e5577df9bbc6747a26eac66587f7a288781f34b3d15cd8ce3f16f05b77dc0bc","schema_version":"1.0","event_id":"sha256:9e5577df9bbc6747a26eac66587f7a288781f34b3d15cd8ce3f16f05b77dc0bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/bundle.json","state_url":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T15:28:09Z","links":{"resolver":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6","bundle":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/bundle.json","state":"https://pith.science/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2RPHMS7MHOEVXG4LQ4SQ77CX6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Y2RPHMS7MHOEVXG4LQ4SQ77CX6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d2c79b836a27a743c1368df388d1aa49da63ddb69f74aac430d8ec49ee5793b0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-27T08:45:10Z","title_canon_sha256":"4ca807d22865626949014ad0cc591d70fec77db29de79a1b73370b3818647472"},"schema_version":"1.0","source":{"id":"1109.5804","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5804","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5804v2","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5804","created_at":"2026-05-18T03:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"Y2RPHMS7MHOE","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y2RPHMS7MHOEVXG4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y2RPHMS7","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:9e5577df9bbc6747a26eac66587f7a288781f34b3d15cd8ce3f16f05b77dc0bc","target":"graph","created_at":"2026-05-18T03:52:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexander Langer, Jan Obdr\\v{z}\\'alek, Peter Rossmanith, Petr Hlin\\v{e}n\\'y, Robert Ganian, Somnath Sikdar","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-27T08:45:10Z","title":"Lower Bounds on the Complexity of MSO1 Model-Checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5804","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:144955923a8beb17d254d96575ac2ba5728c2100d93b77d60ea6c48abf70ea3d","target":"record","created_at":"2026-05-18T03:52:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d2c79b836a27a743c1368df388d1aa49da63ddb69f74aac430d8ec49ee5793b0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-27T08:45:10Z","title_canon_sha256":"4ca807d22865626949014ad0cc591d70fec77db29de79a1b73370b3818647472"},"schema_version":"1.0","source":{"id":"1109.5804","kind":"arxiv","version":2}},"canonical_sha256":"c6a2f3b25f61dc4adcdc5c39287fe2bfbe79d364b24e0182325457c6f70096a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6a2f3b25f61dc4adcdc5c39287fe2bfbe79d364b24e0182325457c6f70096a2","first_computed_at":"2026-05-18T03:52:53.294985Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:53.294985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"em+D6VhrAcpAi5Zo0skpY+ichpIh+ZqIbJrwDJKupM0Z6RcXE3OG8oVpjP1rpWOLjOPBmeZmUcS5BqhFXO9dAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:53.295570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5804","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:144955923a8beb17d254d96575ac2ba5728c2100d93b77d60ea6c48abf70ea3d","sha256:9e5577df9bbc6747a26eac66587f7a288781f34b3d15cd8ce3f16f05b77dc0bc"],"state_sha256":"18c48e9a67924f288364aa136cdbab5bff75ca33345b99bc068f3a20639cd31e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNWjnzXK7QFmmyM9uK60mkQMdf+qUxpISElJYEU1TGP6SxjPq/5Gq+2oe4lg15uH2TZY8Z3QavTWtpbBz5s6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:28:09.867628Z","bundle_sha256":"ca4015d69121cf3c8ea2d7a1d91ff96d5afac9b724d29061a3df226733d7a0ca"}}