{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TXKPUABWMG5LTP3777ZL3P4LKN","short_pith_number":"pith:TXKPUABW","schema_version":"1.0","canonical_sha256":"9dd4fa003661bab9bf7ffff2bdbf8b536136c435da493c7e907b167c661bc310","source":{"kind":"arxiv","id":"1109.5267","version":2},"attestation_state":"computed","paper":{"title":"Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"C.-H. Luke Ong (Oxford University Computing Laboratory), Naoki Kobayashi (Graduate School of Information Sciences, Tohoku University)","submitted_at":"2011-09-24T14:05:50Z","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"},"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":"1109.5267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-24T14:05:50Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"f9724819adf542c5b463181272f1dfd9ac644ca260e9a87f1ef3ac11cd038f7e","abstract_canon_sha256":"167595cd9d11ac7d94ddfffb1e72c6c966bb9b4d01d11414bb5925542c64a84d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.231644Z","signature_b64":"K5Qjaxb+H0gvpvZLXOrSCiuaEGFtVhu0yo0GqEV7arNm1Jgk69XNw9q+NaDR6vJMufYucV3Bns3aWXCNl4/tDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dd4fa003661bab9bf7ffff2bdbf8b536136c435da493c7e907b167c661bc310","last_reissued_at":"2026-05-18T01:37:39.231013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.231013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"C.-H. Luke Ong (Oxford University Computing Laboratory), Naoki Kobayashi (Graduate School of Information Sciences, Tohoku University)","submitted_at":"2011-09-24T14:05:50Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5267","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":"1109.5267","created_at":"2026-05-18T01:37:39.231095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5267v2","created_at":"2026-05-18T01:37:39.231095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5267","created_at":"2026-05-18T01:37:39.231095+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXKPUABWMG5L","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXKPUABWMG5LTP37","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXKPUABW","created_at":"2026-05-18T12:26:42.757692+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/TXKPUABWMG5LTP3777ZL3P4LKN","json":"https://pith.science/pith/TXKPUABWMG5LTP3777ZL3P4LKN.json","graph_json":"https://pith.science/api/pith-number/TXKPUABWMG5LTP3777ZL3P4LKN/graph.json","events_json":"https://pith.science/api/pith-number/TXKPUABWMG5LTP3777ZL3P4LKN/events.json","paper":"https://pith.science/paper/TXKPUABW"},"agent_actions":{"view_html":"https://pith.science/pith/TXKPUABWMG5LTP3777ZL3P4LKN","download_json":"https://pith.science/pith/TXKPUABWMG5LTP3777ZL3P4LKN.json","view_paper":"https://pith.science/paper/TXKPUABW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5267&json=true","fetch_graph":"https://pith.science/api/pith-number/TXKPUABWMG5LTP3777ZL3P4LKN/graph.json","fetch_events":"https://pith.science/api/pith-number/TXKPUABWMG5LTP3777ZL3P4LKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXKPUABWMG5LTP3777ZL3P4LKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXKPUABWMG5LTP3777ZL3P4LKN/action/storage_attestation","attest_author":"https://pith.science/pith/TXKPUABWMG5LTP3777ZL3P4LKN/action/author_attestation","sign_citation":"https://pith.science/pith/TXKPUABWMG5LTP3777ZL3P4LKN/action/citation_signature","submit_replication":"https://pith.science/pith/TXKPUABWMG5LTP3777ZL3P4LKN/action/replication_record"}},"created_at":"2026-05-18T01:37:39.231095+00:00","updated_at":"2026-05-18T01:37:39.231095+00:00"}