{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BOXP3PQOS4K4RBFO5KURCV62DO","short_pith_number":"pith:BOXP3PQO","canonical_record":{"source":{"id":"1409.5368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-18T16:40:09Z","cross_cats_sorted":[],"title_canon_sha256":"20f310af391d8ec6a5b5607ba2d6a04c9ccad1adb04ca95954e14590b535ee57","abstract_canon_sha256":"366ec255bad6afc89bbe646795a1bea4e5fccdbb3ff384cf011e56f3173d3d9d"},"schema_version":"1.0"},"canonical_sha256":"0baefdbe0e9715c884aeeaa91157da1bb26bc3f86bbf3d191c34a8ee5278ed1a","source":{"kind":"arxiv","id":"1409.5368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5368","created_at":"2026-05-18T02:42:29Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5368v1","created_at":"2026-05-18T02:42:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5368","created_at":"2026-05-18T02:42:29Z"},{"alias_kind":"pith_short_12","alias_value":"BOXP3PQOS4K4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BOXP3PQOS4K4RBFO","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BOXP3PQO","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BOXP3PQOS4K4RBFO5KURCV62DO","target":"record","payload":{"canonical_record":{"source":{"id":"1409.5368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-18T16:40:09Z","cross_cats_sorted":[],"title_canon_sha256":"20f310af391d8ec6a5b5607ba2d6a04c9ccad1adb04ca95954e14590b535ee57","abstract_canon_sha256":"366ec255bad6afc89bbe646795a1bea4e5fccdbb3ff384cf011e56f3173d3d9d"},"schema_version":"1.0"},"canonical_sha256":"0baefdbe0e9715c884aeeaa91157da1bb26bc3f86bbf3d191c34a8ee5278ed1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:29.683858Z","signature_b64":"TsdtvM2ZWayevkj3EeUj3rq6WI4pScgzZBMQTNdXDRSgKIM36OoSWXooaeHm516QltVsJeDZvPqi80TdeezQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0baefdbe0e9715c884aeeaa91157da1bb26bc3f86bbf3d191c34a8ee5278ed1a","last_reissued_at":"2026-05-18T02:42:29.683098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:29.683098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.5368","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:42:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/GbO8CQILM1OopnRwHiaU4sEwgm7RTTHW9P6WBpqEtZJ4BwJ75CqGMmMK1PrHqR0AqRebJDAmTe7LKtJxCimCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:24:30.779931Z"},"content_sha256":"f8425f9c3d34e1af6bcbee1d7dfab9bb25050a624eb5d9b05055dbc62a98451c","schema_version":"1.0","event_id":"sha256:f8425f9c3d34e1af6bcbee1d7dfab9bb25050a624eb5d9b05055dbc62a98451c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BOXP3PQOS4K4RBFO5KURCV62DO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fly-automata, model-checking and recognizability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bruno Courcelle (LaBRI), Ir\\`ene A. Durand (LaBRI)","submitted_at":"2014-09-18T16:40:09Z","abstract_excerpt":"The Recognizability Theorem states that if a set of finite graphs is definable by a monadic second-order (MSO) sentence, then it is recognizable with respect to the graph algebra upon which the definition of clique-width is based. Recognizability is an algebraic notion, defined in terms of congruences that can also be formulated by means of finite automata on the terms that describe the considered graphs. This theorem entails that the verification of MSO graph properties, or equivalently, the model-checking problem for MSO logic over finite binary relational structures, is fixed-parameter trac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5368","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:42:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/T6rNt2VDimAj6jOoAaDlQLx41aR7QsLkEJwOlS1IlvpcjW10eTnrXogfsIW0Wi+CoB8sAQeb7ex7r/be5WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:24:30.780264Z"},"content_sha256":"b36bf56dcbc96feed483616b46eaa9e83fad37b22000ba5ea07ba9d73789084a","schema_version":"1.0","event_id":"sha256:b36bf56dcbc96feed483616b46eaa9e83fad37b22000ba5ea07ba9d73789084a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO/bundle.json","state_url":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOXP3PQOS4K4RBFO5KURCV62DO/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-23T15:24:30Z","links":{"resolver":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO","bundle":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO/bundle.json","state":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOXP3PQOS4K4RBFO5KURCV62DO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BOXP3PQOS4K4RBFO5KURCV62DO","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":"366ec255bad6afc89bbe646795a1bea4e5fccdbb3ff384cf011e56f3173d3d9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-18T16:40:09Z","title_canon_sha256":"20f310af391d8ec6a5b5607ba2d6a04c9ccad1adb04ca95954e14590b535ee57"},"schema_version":"1.0","source":{"id":"1409.5368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5368","created_at":"2026-05-18T02:42:29Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5368v1","created_at":"2026-05-18T02:42:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5368","created_at":"2026-05-18T02:42:29Z"},{"alias_kind":"pith_short_12","alias_value":"BOXP3PQOS4K4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BOXP3PQOS4K4RBFO","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BOXP3PQO","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:b36bf56dcbc96feed483616b46eaa9e83fad37b22000ba5ea07ba9d73789084a","target":"graph","created_at":"2026-05-18T02:42:29Z","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":"The Recognizability Theorem states that if a set of finite graphs is definable by a monadic second-order (MSO) sentence, then it is recognizable with respect to the graph algebra upon which the definition of clique-width is based. Recognizability is an algebraic notion, defined in terms of congruences that can also be formulated by means of finite automata on the terms that describe the considered graphs. This theorem entails that the verification of MSO graph properties, or equivalently, the model-checking problem for MSO logic over finite binary relational structures, is fixed-parameter trac","authors_text":"Bruno Courcelle (LaBRI), Ir\\`ene A. Durand (LaBRI)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-18T16:40:09Z","title":"Fly-automata, model-checking and recognizability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5368","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:f8425f9c3d34e1af6bcbee1d7dfab9bb25050a624eb5d9b05055dbc62a98451c","target":"record","created_at":"2026-05-18T02:42:29Z","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":"366ec255bad6afc89bbe646795a1bea4e5fccdbb3ff384cf011e56f3173d3d9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-18T16:40:09Z","title_canon_sha256":"20f310af391d8ec6a5b5607ba2d6a04c9ccad1adb04ca95954e14590b535ee57"},"schema_version":"1.0","source":{"id":"1409.5368","kind":"arxiv","version":1}},"canonical_sha256":"0baefdbe0e9715c884aeeaa91157da1bb26bc3f86bbf3d191c34a8ee5278ed1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0baefdbe0e9715c884aeeaa91157da1bb26bc3f86bbf3d191c34a8ee5278ed1a","first_computed_at":"2026-05-18T02:42:29.683098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:29.683098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TsdtvM2ZWayevkj3EeUj3rq6WI4pScgzZBMQTNdXDRSgKIM36OoSWXooaeHm516QltVsJeDZvPqi80TdeezQAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:29.683858Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.5368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8425f9c3d34e1af6bcbee1d7dfab9bb25050a624eb5d9b05055dbc62a98451c","sha256:b36bf56dcbc96feed483616b46eaa9e83fad37b22000ba5ea07ba9d73789084a"],"state_sha256":"1861776131d02b6c769ce2f909717c99be936672d51ee8a929f87334f2a53126"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HVRe5QFKOO3U6Do91xCAqRlK/rzCH4ekvyT+uyqy2Zay9PIQCxV8ZZEW9lzxxFfaayUribsHfbXAvPZphlveDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:24:30.782141Z","bundle_sha256":"98efa212e18afdc8d7f4ea29eba9d1fa7c339810940f6e29c2ee21dd66326bc1"}}