{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BOXP3PQOS4K4RBFO5KURCV62DO","short_pith_number":"pith:BOXP3PQO","schema_version":"1.0","canonical_sha256":"0baefdbe0e9715c884aeeaa91157da1bb26bc3f86bbf3d191c34a8ee5278ed1a","source":{"kind":"arxiv","id":"1409.5368","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.5368","created_at":"2026-05-18T02:42:29.683227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5368v1","created_at":"2026-05-18T02:42:29.683227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5368","created_at":"2026-05-18T02:42:29.683227+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOXP3PQOS4K4","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOXP3PQOS4K4RBFO","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOXP3PQO","created_at":"2026-05-18T12:28:22.404517+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/BOXP3PQOS4K4RBFO5KURCV62DO","json":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO.json","graph_json":"https://pith.science/api/pith-number/BOXP3PQOS4K4RBFO5KURCV62DO/graph.json","events_json":"https://pith.science/api/pith-number/BOXP3PQOS4K4RBFO5KURCV62DO/events.json","paper":"https://pith.science/paper/BOXP3PQO"},"agent_actions":{"view_html":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO","download_json":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO.json","view_paper":"https://pith.science/paper/BOXP3PQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5368&json=true","fetch_graph":"https://pith.science/api/pith-number/BOXP3PQOS4K4RBFO5KURCV62DO/graph.json","fetch_events":"https://pith.science/api/pith-number/BOXP3PQOS4K4RBFO5KURCV62DO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO/action/storage_attestation","attest_author":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO/action/author_attestation","sign_citation":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO/action/citation_signature","submit_replication":"https://pith.science/pith/BOXP3PQOS4K4RBFO5KURCV62DO/action/replication_record"}},"created_at":"2026-05-18T02:42:29.683227+00:00","updated_at":"2026-05-18T02:42:29.683227+00:00"}