{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6WCQPMD4D4G4W3DUFFYG3MOFUL","short_pith_number":"pith:6WCQPMD4","canonical_record":{"source":{"id":"1503.01604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-05T11:07:23Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"03ada9e7698ab2c460ef6ee9f55b38423c7cb01a550e9d37f328a49428f7a6ce","abstract_canon_sha256":"91f47718cc884d25cb8f3ea369891805be19c4a291fdc4c3ecb483a08dbe22c1"},"schema_version":"1.0"},"canonical_sha256":"f58507b07c1f0dcb6c7429706db1c5a2ef9bd850aa37ff9fb691e7603815ac04","source":{"kind":"arxiv","id":"1503.01604","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01604","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01604v1","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01604","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"6WCQPMD4D4G4","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6WCQPMD4D4G4W3DU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6WCQPMD4","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6WCQPMD4D4G4W3DUFFYG3MOFUL","target":"record","payload":{"canonical_record":{"source":{"id":"1503.01604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-05T11:07:23Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"03ada9e7698ab2c460ef6ee9f55b38423c7cb01a550e9d37f328a49428f7a6ce","abstract_canon_sha256":"91f47718cc884d25cb8f3ea369891805be19c4a291fdc4c3ecb483a08dbe22c1"},"schema_version":"1.0"},"canonical_sha256":"f58507b07c1f0dcb6c7429706db1c5a2ef9bd850aa37ff9fb691e7603815ac04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:33.277440Z","signature_b64":"Q39QtDyMz7fmKM1V5D/PApH2UIH6qo+uJ8Tsg9jwU+UhWSD1esgo46Zeg4HGarxtQwc5uPO/8qatWdKjoSLUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f58507b07c1f0dcb6c7429706db1c5a2ef9bd850aa37ff9fb691e7603815ac04","last_reissued_at":"2026-05-18T02:25:33.276943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:33.276943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.01604","source_version":1,"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-18T02:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mA+xfHsVZ+OIIwWNHka3GhefmCEoVSlFn3rHt/sBsB5gVg7GQhMDGc2uB9S/vIvgmbZrQfTRD8jOU/TMHD8QBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:12:35.247297Z"},"content_sha256":"56eaa5b1a701ef392a0da2789f368ab7ea9bfa89e744dc09bf68bf34964d8530","schema_version":"1.0","event_id":"sha256:56eaa5b1a701ef392a0da2789f368ab7ea9bfa89e744dc09bf68bf34964d8530"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6WCQPMD4D4G4W3DUFFYG3MOFUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree $k$-Outerplanar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.LO","authors_text":"Hans L. Bodlaender, Lars Jaffke","submitted_at":"2015-03-05T11:07:23Z","abstract_excerpt":"One of the most famous algorithmic meta-theorems states that every graph property that can be defined by a sentence in counting monadic second order logic (CMSOL) can be checked in linear time for graphs of bounded treewidth, which is known as Courcelle's Theorem. These algorithms are constructed as finite state tree automata, and hence every CMSOL-definable graph property is recognizable. Courcelle also conjectured that the converse holds, i.e. every recognizable graph property is definable in CMSOL for graphs of bounded treewidth. We prove this conjecture for a number of special cases in a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01604","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":""},"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-18T02:25:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDJyWqp7pLYWPeUTpUFEo8dQD15a1N4ojfNA1gMyWYAGC5goSjeRAZe6paWKVw6iHtVXPRQpuZTkWJHYH7ddAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:12:35.248149Z"},"content_sha256":"59a6f35bf895a7908939bf743525aed55e3304c9019d6290f1432a4870d44563","schema_version":"1.0","event_id":"sha256:59a6f35bf895a7908939bf743525aed55e3304c9019d6290f1432a4870d44563"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6WCQPMD4D4G4W3DUFFYG3MOFUL/bundle.json","state_url":"https://pith.science/pith/6WCQPMD4D4G4W3DUFFYG3MOFUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6WCQPMD4D4G4W3DUFFYG3MOFUL/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-05-27T10:12:35Z","links":{"resolver":"https://pith.science/pith/6WCQPMD4D4G4W3DUFFYG3MOFUL","bundle":"https://pith.science/pith/6WCQPMD4D4G4W3DUFFYG3MOFUL/bundle.json","state":"https://pith.science/pith/6WCQPMD4D4G4W3DUFFYG3MOFUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6WCQPMD4D4G4W3DUFFYG3MOFUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6WCQPMD4D4G4W3DUFFYG3MOFUL","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":"91f47718cc884d25cb8f3ea369891805be19c4a291fdc4c3ecb483a08dbe22c1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-05T11:07:23Z","title_canon_sha256":"03ada9e7698ab2c460ef6ee9f55b38423c7cb01a550e9d37f328a49428f7a6ce"},"schema_version":"1.0","source":{"id":"1503.01604","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01604","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01604v1","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01604","created_at":"2026-05-18T02:25:33Z"},{"alias_kind":"pith_short_12","alias_value":"6WCQPMD4D4G4","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6WCQPMD4D4G4W3DU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6WCQPMD4","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:59a6f35bf895a7908939bf743525aed55e3304c9019d6290f1432a4870d44563","target":"graph","created_at":"2026-05-18T02:25:33Z","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 famous algorithmic meta-theorems states that every graph property that can be defined by a sentence in counting monadic second order logic (CMSOL) can be checked in linear time for graphs of bounded treewidth, which is known as Courcelle's Theorem. These algorithms are constructed as finite state tree automata, and hence every CMSOL-definable graph property is recognizable. Courcelle also conjectured that the converse holds, i.e. every recognizable graph property is definable in CMSOL for graphs of bounded treewidth. We prove this conjecture for a number of special cases in a s","authors_text":"Hans L. Bodlaender, Lars Jaffke","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-05T11:07:23Z","title":"MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree $k$-Outerplanar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01604","kind":"arxiv","version":1},"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:56eaa5b1a701ef392a0da2789f368ab7ea9bfa89e744dc09bf68bf34964d8530","target":"record","created_at":"2026-05-18T02:25:33Z","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":"91f47718cc884d25cb8f3ea369891805be19c4a291fdc4c3ecb483a08dbe22c1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-05T11:07:23Z","title_canon_sha256":"03ada9e7698ab2c460ef6ee9f55b38423c7cb01a550e9d37f328a49428f7a6ce"},"schema_version":"1.0","source":{"id":"1503.01604","kind":"arxiv","version":1}},"canonical_sha256":"f58507b07c1f0dcb6c7429706db1c5a2ef9bd850aa37ff9fb691e7603815ac04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f58507b07c1f0dcb6c7429706db1c5a2ef9bd850aa37ff9fb691e7603815ac04","first_computed_at":"2026-05-18T02:25:33.276943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:33.276943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q39QtDyMz7fmKM1V5D/PApH2UIH6qo+uJ8Tsg9jwU+UhWSD1esgo46Zeg4HGarxtQwc5uPO/8qatWdKjoSLUCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:33.277440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01604","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56eaa5b1a701ef392a0da2789f368ab7ea9bfa89e744dc09bf68bf34964d8530","sha256:59a6f35bf895a7908939bf743525aed55e3304c9019d6290f1432a4870d44563"],"state_sha256":"52bf1244fb877b2ef2a9f17b551c7e0cf278c03a9b3b112dd5d7d8afa5052920"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sq1/TejSkf5p6DuiGfnPYxhsCKvPp8ditZqH30xRKRZcNVjOR+F7zNKAI0rJP8ctXlvFvlrlZZMAJYy8pJeiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:12:35.252637Z","bundle_sha256":"fccda38a553df9775561f15d1ee16e465c8394983490f3c7975c941550489c08"}}