{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OES3DGPG4POVLI2I4SICM2YEUS","short_pith_number":"pith:OES3DGPG","schema_version":"1.0","canonical_sha256":"7125b199e6e3dd55a348e490266b04a48113889d4866209875be8cd10dbd8843","source":{"kind":"arxiv","id":"1511.08605","version":2},"attestation_state":"computed","paper":{"title":"Fly-automata for checking MSO 2 graph properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bruno Courcelle (LaBRI)","submitted_at":"2015-11-27T10:19:43Z","abstract_excerpt":"A more descriptive but too long title would be : Constructing fly-automata to check properties of graphs of bounded tree-width expressed by monadic second-order formulas written with edge quantifications. Such properties are called MSO2 in short. Fly-automata (FA) run bottom-up on terms denoting graphs and compute \"on the fly\" the necessary states and transitions instead of looking into huge, actually unimplementable tables. In previous works, we have constructed FA that process terms denoting graphs of bounded clique-width, in order to check their monadic second-order (MSO) properties (expres"},"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":"1511.08605","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-27T10:19:43Z","cross_cats_sorted":[],"title_canon_sha256":"e35ab835fe9378ccf5814e1ecda39b0a2091d90475bab3415043e37240140421","abstract_canon_sha256":"75b4e08285cf7c1aa2b9a5623aac29ea0d3c2fff3c692e2fb1ff10424e165503"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:53.920377Z","signature_b64":"Dt2HaRekAXEA8nHfZYq8uOwG+cj+1jvh8/1MXByNt1ckMY/VYWWxKJaw2gmsa92KPWgfZ2CqcqspptelB4hvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7125b199e6e3dd55a348e490266b04a48113889d4866209875be8cd10dbd8843","last_reissued_at":"2026-05-18T01:23:53.919663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:53.919663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fly-automata for checking MSO 2 graph properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bruno Courcelle (LaBRI)","submitted_at":"2015-11-27T10:19:43Z","abstract_excerpt":"A more descriptive but too long title would be : Constructing fly-automata to check properties of graphs of bounded tree-width expressed by monadic second-order formulas written with edge quantifications. Such properties are called MSO2 in short. Fly-automata (FA) run bottom-up on terms denoting graphs and compute \"on the fly\" the necessary states and transitions instead of looking into huge, actually unimplementable tables. In previous works, we have constructed FA that process terms denoting graphs of bounded clique-width, in order to check their monadic second-order (MSO) properties (expres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08605","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.08605","created_at":"2026-05-18T01:23:53.919771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08605v2","created_at":"2026-05-18T01:23:53.919771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08605","created_at":"2026-05-18T01:23:53.919771+00:00"},{"alias_kind":"pith_short_12","alias_value":"OES3DGPG4POV","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OES3DGPG4POVLI2I","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OES3DGPG","created_at":"2026-05-18T12:29:34.919912+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/OES3DGPG4POVLI2I4SICM2YEUS","json":"https://pith.science/pith/OES3DGPG4POVLI2I4SICM2YEUS.json","graph_json":"https://pith.science/api/pith-number/OES3DGPG4POVLI2I4SICM2YEUS/graph.json","events_json":"https://pith.science/api/pith-number/OES3DGPG4POVLI2I4SICM2YEUS/events.json","paper":"https://pith.science/paper/OES3DGPG"},"agent_actions":{"view_html":"https://pith.science/pith/OES3DGPG4POVLI2I4SICM2YEUS","download_json":"https://pith.science/pith/OES3DGPG4POVLI2I4SICM2YEUS.json","view_paper":"https://pith.science/paper/OES3DGPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08605&json=true","fetch_graph":"https://pith.science/api/pith-number/OES3DGPG4POVLI2I4SICM2YEUS/graph.json","fetch_events":"https://pith.science/api/pith-number/OES3DGPG4POVLI2I4SICM2YEUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OES3DGPG4POVLI2I4SICM2YEUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OES3DGPG4POVLI2I4SICM2YEUS/action/storage_attestation","attest_author":"https://pith.science/pith/OES3DGPG4POVLI2I4SICM2YEUS/action/author_attestation","sign_citation":"https://pith.science/pith/OES3DGPG4POVLI2I4SICM2YEUS/action/citation_signature","submit_replication":"https://pith.science/pith/OES3DGPG4POVLI2I4SICM2YEUS/action/replication_record"}},"created_at":"2026-05-18T01:23:53.919771+00:00","updated_at":"2026-05-18T01:23:53.919771+00:00"}