{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XDP6YMLU6IU6SBXO5F2IMH2BF3","short_pith_number":"pith:XDP6YMLU","canonical_record":{"source":{"id":"1001.5019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-01-27T20:51:47Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"8c34cdb70e54d71ab76abcdc870d99c46c30592e4787c2fe343d5ae1ef6b0487","abstract_canon_sha256":"974e4b2e4cae1d8ff01ea6f3391463b0f75ad6c1d892db9d1facf55b86b3cab4"},"schema_version":"1.0"},"canonical_sha256":"b8dfec3174f229e906eee974861f412ede41f2961f2170d8f0d3d35a4789a3ac","source":{"kind":"arxiv","id":"1001.5019","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.5019","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1001.5019v2","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.5019","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"XDP6YMLU6IU6","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XDP6YMLU6IU6SBXO","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XDP6YMLU","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XDP6YMLU6IU6SBXO5F2IMH2BF3","target":"record","payload":{"canonical_record":{"source":{"id":"1001.5019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-01-27T20:51:47Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"8c34cdb70e54d71ab76abcdc870d99c46c30592e4787c2fe343d5ae1ef6b0487","abstract_canon_sha256":"974e4b2e4cae1d8ff01ea6f3391463b0f75ad6c1d892db9d1facf55b86b3cab4"},"schema_version":"1.0"},"canonical_sha256":"b8dfec3174f229e906eee974861f412ede41f2961f2170d8f0d3d35a4789a3ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:39.398328Z","signature_b64":"a26R2TbRwQQatnRhEwcxhNBDyLolCuJesjE0I0jN4PmL2ctjM0IZOVL/0XrKKQf8sUHLGTMS4MQg9/KhjCH7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8dfec3174f229e906eee974861f412ede41f2961f2170d8f0d3d35a4789a3ac","last_reissued_at":"2026-05-18T02:24:39.397881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:39.397881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.5019","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-18T02:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZyAI5FsCJ7ex5L/hzT/JyKjEg5p42764biGb6fYT8DmG0YeYCVu0YyU9VxhKStU+D/Caodf2STu1tpNW9txRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T05:12:59.255511Z"},"content_sha256":"15a592297920be1bd6427ec4d3766de67aebeae43d852b79beef71f6e1e302cc","schema_version":"1.0","event_id":"sha256:15a592297920be1bd6427ec4d3766de67aebeae43d852b79beef71f6e1e302cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XDP6YMLU6IU6SBXO5F2IMH2BF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for the Complexity of Monadic Second-Order Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"cs.LO","authors_text":"Siamak Tazari, Stephan Kreutzer","submitted_at":"2010-01-27T20:51:47Z","abstract_excerpt":"Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO is fixed-parameter tractable in linear time on any such class of graphs. From a logical perspective, Courcelle's theorem establishes a sufficient condition, or an upper bound, for tractability of MSO-model checking.\n  Whereas such upper bounds on the complexity of logics have received significant attention in the literature, almost nothing is known about corresponding lower bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.5019","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-18T02:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnfeh6P6IT77DmXEfR2C5f53Aii3RkarOamw5v7WJ2yEjqJyncynskbwyWdz6B5lD/+2jkB6PJn+D6QXHbnSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T05:12:59.255863Z"},"content_sha256":"2521caa6b7febbe3e507933a5a0800348f7f74ad2b44e542ec2245af0455e9d1","schema_version":"1.0","event_id":"sha256:2521caa6b7febbe3e507933a5a0800348f7f74ad2b44e542ec2245af0455e9d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDP6YMLU6IU6SBXO5F2IMH2BF3/bundle.json","state_url":"https://pith.science/pith/XDP6YMLU6IU6SBXO5F2IMH2BF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDP6YMLU6IU6SBXO5F2IMH2BF3/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-22T05:12:59Z","links":{"resolver":"https://pith.science/pith/XDP6YMLU6IU6SBXO5F2IMH2BF3","bundle":"https://pith.science/pith/XDP6YMLU6IU6SBXO5F2IMH2BF3/bundle.json","state":"https://pith.science/pith/XDP6YMLU6IU6SBXO5F2IMH2BF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDP6YMLU6IU6SBXO5F2IMH2BF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XDP6YMLU6IU6SBXO5F2IMH2BF3","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":"974e4b2e4cae1d8ff01ea6f3391463b0f75ad6c1d892db9d1facf55b86b3cab4","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-01-27T20:51:47Z","title_canon_sha256":"8c34cdb70e54d71ab76abcdc870d99c46c30592e4787c2fe343d5ae1ef6b0487"},"schema_version":"1.0","source":{"id":"1001.5019","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.5019","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1001.5019v2","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.5019","created_at":"2026-05-18T02:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"XDP6YMLU6IU6","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XDP6YMLU6IU6SBXO","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XDP6YMLU","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:2521caa6b7febbe3e507933a5a0800348f7f74ad2b44e542ec2245af0455e9d1","target":"graph","created_at":"2026-05-18T02:24:39Z","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":"Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO is fixed-parameter tractable in linear time on any such class of graphs. From a logical perspective, Courcelle's theorem establishes a sufficient condition, or an upper bound, for tractability of MSO-model checking.\n  Whereas such upper bounds on the complexity of logics have received significant attention in the literature, almost nothing is known about corresponding lower bounds.","authors_text":"Siamak Tazari, Stephan Kreutzer","cross_cats":["cs.CC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-01-27T20:51:47Z","title":"Lower Bounds for the Complexity of Monadic Second-Order Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.5019","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:15a592297920be1bd6427ec4d3766de67aebeae43d852b79beef71f6e1e302cc","target":"record","created_at":"2026-05-18T02:24:39Z","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":"974e4b2e4cae1d8ff01ea6f3391463b0f75ad6c1d892db9d1facf55b86b3cab4","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-01-27T20:51:47Z","title_canon_sha256":"8c34cdb70e54d71ab76abcdc870d99c46c30592e4787c2fe343d5ae1ef6b0487"},"schema_version":"1.0","source":{"id":"1001.5019","kind":"arxiv","version":2}},"canonical_sha256":"b8dfec3174f229e906eee974861f412ede41f2961f2170d8f0d3d35a4789a3ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8dfec3174f229e906eee974861f412ede41f2961f2170d8f0d3d35a4789a3ac","first_computed_at":"2026-05-18T02:24:39.397881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:39.397881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a26R2TbRwQQatnRhEwcxhNBDyLolCuJesjE0I0jN4PmL2ctjM0IZOVL/0XrKKQf8sUHLGTMS4MQg9/KhjCH7Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:39.398328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.5019","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15a592297920be1bd6427ec4d3766de67aebeae43d852b79beef71f6e1e302cc","sha256:2521caa6b7febbe3e507933a5a0800348f7f74ad2b44e542ec2245af0455e9d1"],"state_sha256":"55baeb7bcd13604703ff0a123fc489f714df73dd66554e6f51a777a4dde8c600"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y0f3Xs+eZvdRsiWCdbKn3fClJZ6GWToZBY4FHCAc5AOOa/erblj0P+p1zME363loHdqaTrdpnFI1E/U5TduHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T05:12:59.258059Z","bundle_sha256":"4571185724ed876c3f4aa06f6620c6a8eea667d0d44d96a43af9ab6b3fecb041"}}