{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TXKPUABWMG5LTP3777ZL3P4LKN","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":"167595cd9d11ac7d94ddfffb1e72c6c966bb9b4d01d11414bb5925542c64a84d","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-24T14:05:50Z","title_canon_sha256":"f9724819adf542c5b463181272f1dfd9ac644ca260e9a87f1ef3ac11cd038f7e"},"schema_version":"1.0","source":{"id":"1109.5267","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5267","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5267v2","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5267","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"TXKPUABWMG5L","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TXKPUABWMG5LTP37","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TXKPUABW","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:62f9910f0e34d299bed26f72b002d89054a18a74d7561d958d440d6bbd75483d","target":"graph","created_at":"2026-05-18T01:37: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":"Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees generated by order-n recursion schemes is n-EXPTIME complete. We consider two subclasses of APT and investigate the complexity of the respective acceptance problems. The main results are that, for APT with a single priority, the problem is still n-EXPTIME complete; whereas, for APT with a disjunctive transition function, the problem is (n-1)-EXPTIME complete. This study was motivated by Kobayashi's recent work showing t","authors_text":"C.-H. Luke Ong (Oxford University Computing Laboratory), Naoki Kobayashi (Graduate School of Information Sciences, Tohoku University)","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-24T14:05:50Z","title":"Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5267","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:1f1b3371289033e8512ac606064e74260b4aa224cd482b66b94b91b4b4ababb8","target":"record","created_at":"2026-05-18T01:37: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":"167595cd9d11ac7d94ddfffb1e72c6c966bb9b4d01d11414bb5925542c64a84d","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-24T14:05:50Z","title_canon_sha256":"f9724819adf542c5b463181272f1dfd9ac644ca260e9a87f1ef3ac11cd038f7e"},"schema_version":"1.0","source":{"id":"1109.5267","kind":"arxiv","version":2}},"canonical_sha256":"9dd4fa003661bab9bf7ffff2bdbf8b536136c435da493c7e907b167c661bc310","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dd4fa003661bab9bf7ffff2bdbf8b536136c435da493c7e907b167c661bc310","first_computed_at":"2026-05-18T01:37:39.231013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:39.231013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K5Qjaxb+H0gvpvZLXOrSCiuaEGFtVhu0yo0GqEV7arNm1Jgk69XNw9q+NaDR6vJMufYucV3Bns3aWXCNl4/tDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:39.231644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5267","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f1b3371289033e8512ac606064e74260b4aa224cd482b66b94b91b4b4ababb8","sha256:62f9910f0e34d299bed26f72b002d89054a18a74d7561d958d440d6bbd75483d"],"state_sha256":"84814bf37534474c00b714352cd8e1a83d729d7a33ec90d145a3f4236b8b6b86"}