{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MKLTKVJLQHH4ZTOODN2SERRGQB","short_pith_number":"pith:MKLTKVJL","canonical_record":{"source":{"id":"2605.13553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T13:57:31Z","cross_cats_sorted":[],"title_canon_sha256":"521ab7a130d487ad27f3419523465923407970841d12d1585df54ad876e4ed90","abstract_canon_sha256":"f41006edea56a97d38ca0159c66049738b017c08988f7db1a9c3a41a4afd58be"},"schema_version":"1.0"},"canonical_sha256":"629735552b81cfcccdce1b75224626805abcd12b87ebbff3c899976cf4366d77","source":{"kind":"arxiv","id":"2605.13553","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13553","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13553v1","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13553","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"MKLTKVJLQHH4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MKLTKVJLQHH4ZTOO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MKLTKVJL","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MKLTKVJLQHH4ZTOODN2SERRGQB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T13:57:31Z","cross_cats_sorted":[],"title_canon_sha256":"521ab7a130d487ad27f3419523465923407970841d12d1585df54ad876e4ed90","abstract_canon_sha256":"f41006edea56a97d38ca0159c66049738b017c08988f7db1a9c3a41a4afd58be"},"schema_version":"1.0"},"canonical_sha256":"629735552b81cfcccdce1b75224626805abcd12b87ebbff3c899976cf4366d77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:23.704523Z","signature_b64":"SjacW/PgFJPfRHUlWDvLrp6jNTrm6tuNfg35YctZD+knjM/Ybpe0sqhFZp1x5XwDeS6lpkygwbWH2+0B5ojJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"629735552b81cfcccdce1b75224626805abcd12b87ebbff3c899976cf4366d77","last_reissued_at":"2026-05-18T02:44:23.704102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:23.704102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13553","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:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YBWwERH+WsItiL/XlJl3MH1EPGuUo5zvjDtD/QX8zuTDmyzYlXS+TOK22hwRy+KWNaSRh9Z3S1U0G0MTxe5EBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:24:15.724490Z"},"content_sha256":"8116f0ab65a704bf5949cba328e4df0a372270f1887dc60a9e255f739afcac7e","schema_version":"1.0","event_id":"sha256:8116f0ab65a704bf5949cba328e4df0a372270f1887dc60a9e255f739afcac7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MKLTKVJLQHH4ZTOODN2SERRGQB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subsumption in $\\mathcal{FL}_{\\bot \\mathit{reg}}$ with TBoxes Is in ExpTime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Deciding concept subsumption in FL_bot_reg with TBoxes is ExpTime-complete.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Barbara Morawska, Micha{\\l} Henne, Pawe{\\l} Parys","submitted_at":"2026-05-13T13:57:31Z","abstract_excerpt":"Description logics (DL) are a family of formal languages for representing and reasoning about structured knowledge in terms of concepts and their relationships. A central reasoning problem in DL is concept subsumption. Although this problem has been widely studied, important open problems remain for certain logics. The expressive power of DLs depends on the constructors available for building complex concepts. In this work, we investigate subsumption in the restricted logic $\\mathcal{FL}_{\\bot \\mathit{reg}}$ and its related fragments $\\mathcal{FL}_\\mathit{reg}$, $\\mathcal{FL}_\\bot$, and $\\math"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that deciding subsumption between two concept descriptions in FL_bot_reg and FL_reg is PSpace-complete. When subsumption is considered with respect to a TBox, the complexity increases to ExpTime-complete. Our results are obtained via a novel reduction to parity pushdown games.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the novel reduction to parity pushdown games correctly captures the subsumption problem and that the complexity of the game problem transfers appropriately to the DL setting.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Subsumption in FL_bot_reg and FL_reg is PSpace-complete without TBoxes and ExpTime-complete with TBoxes via reduction to parity pushdown games.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Deciding concept subsumption in FL_bot_reg with TBoxes is ExpTime-complete.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"665d01d3ba91d99e694acba7c2e44239e700a9e06f2615a10062823c436472cd"},"source":{"id":"2605.13553","kind":"arxiv","version":1},"verdict":{"id":"25f368b7-d555-442b-82cb-09b687e45829","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:11:12.725574Z","strongest_claim":"We show that deciding subsumption between two concept descriptions in FL_bot_reg and FL_reg is PSpace-complete. When subsumption is considered with respect to a TBox, the complexity increases to ExpTime-complete. Our results are obtained via a novel reduction to parity pushdown games.","one_line_summary":"Subsumption in FL_bot_reg and FL_reg is PSpace-complete without TBoxes and ExpTime-complete with TBoxes via reduction to parity pushdown games.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the novel reduction to parity pushdown games correctly captures the subsumption problem and that the complexity of the game problem transfers appropriately to the DL setting.","pith_extraction_headline":"Deciding concept subsumption in FL_bot_reg with TBoxes is ExpTime-complete."},"references":{"count":16,"sample":[{"doi":"10.1145/1075382.1075387","year":2005,"title":"Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T.W., Yannakakis, M.: Analysis of recursive state machines. ACM Trans. Program. Lang. Syst.27(4), 786–818 (2005). https://doi.org/10.1145/107","work_id":"2f7cf807-ebc4-448a-93e5-43cfc9a2ef60","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/bfb0054902","year":1998,"title":"Baader, F., Borgida, A., McGuinness, D.L.: Matching in description logics: Prelim- inary results. In: ICCS. pp. 15–34. Lecture Notes in Computer Science, Springer (1998). https://doi.org/10.1007/BFb00","work_id":"c7d80a25-37a5-4253-bcbf-1ea8e65830c0","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: IJCAI. pp. 364–","work_id":"c5c93ce2-e139-47a8-bbfc-8c375d246645","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2005,"title":"Professional Book Center (2005), http://ijcai.org/Proceedings/05/Papers/ 0372.pdf","work_id":"c06eb19a-cec5-4d59-9252-272c212e1623","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2003,"title":"Cam- bridge University Press (2003)","work_id":"c6058a37-afcf-49b4-b2cc-79c2031a5408","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":16,"snapshot_sha256":"950f319bcb61a040f7d64fbcbade94a8efeb8f40018cbd5cef321e9466550a67","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f1dad8cb80e99eebd1491795f81861cf3768a8ed59001e5b9f2355ddb2959925"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"25f368b7-d555-442b-82cb-09b687e45829"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1jHdQ9lSCAsdq8O4s8L0PjuD/I9oELIGxo1cAmuauDxpWnsnSRBthGnSufrWQYoOGl3kUG3UrhbOG3ZEPVKSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:24:15.725173Z"},"content_sha256":"13b7268140979ea750a464af47d67aedf3c99c0be86f68132a61929ab85d2daf","schema_version":"1.0","event_id":"sha256:13b7268140979ea750a464af47d67aedf3c99c0be86f68132a61929ab85d2daf"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:MKLTKVJLQHH4ZTOODN2SERRGQB","target":"integrity","payload":{"note":"Identifier '10.1016/s0022-0000(76)80046-8' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Hunt, H. B., I., Rosenkrantz, D.J., Szymanski, T.G.: On the equivalence, contain- ment,andcoveringproblemsfortheregularandcontext-freelanguages.J.Comput. Syst. Sci.12(2), 222–268 (1976). https://doi.org/10.1016/S0022-0000(76)80046-8","arxiv_id":"2605.13553","detector":"doi_compliance","evidence":{"doi":"10.1016/s0022-0000(76)80046-8","arxiv_id":null,"ref_index":11,"raw_excerpt":"Hunt, H. B., I., Rosenkrantz, D.J., Szymanski, T.G.: On the equivalence, contain- ment,andcoveringproblemsfortheregularandcontext-freelanguages.J.Comput. Syst. Sci.12(2), 222–268 (1976). https://doi.org/10.1016/S0022-0000(76)80046-8","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":11,"audited_at":"2026-05-19T06:26:08.301793Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s0022-0000(76)80046-8","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"00a0103abb452af033923db094bbc0f3bd293b98f51e274b13de9cdc1b95edcb","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":141,"payload_sha256":"2270f247fd1e622a6b37a8d447f87a620829ab669a130c25d3197d7be56d1cc1","signature_b64":"gHgNfEcCzSgMacgCkRCJwZxZQRn99LN2RmwBEXaHAfb4CGlrKIPRt5ArSE4L50aNauvOSdYf3MQ0eTfmMS9PAw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T06:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wbeFMq4nu4DVBOnQJYGNHTxYymz+XRo2FWtKYkms840WwjXAio1Tv+1TrEGS4ahorsdQU89VFuSSYwDWcjeuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:24:15.726297Z"},"content_sha256":"72dab89380422499a6403c443fb33a1581a04dab88724af556d79aab60c86607","schema_version":"1.0","event_id":"sha256:72dab89380422499a6403c443fb33a1581a04dab88724af556d79aab60c86607"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKLTKVJLQHH4ZTOODN2SERRGQB/bundle.json","state_url":"https://pith.science/pith/MKLTKVJLQHH4ZTOODN2SERRGQB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKLTKVJLQHH4ZTOODN2SERRGQB/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-05-21T17:24:15Z","links":{"resolver":"https://pith.science/pith/MKLTKVJLQHH4ZTOODN2SERRGQB","bundle":"https://pith.science/pith/MKLTKVJLQHH4ZTOODN2SERRGQB/bundle.json","state":"https://pith.science/pith/MKLTKVJLQHH4ZTOODN2SERRGQB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKLTKVJLQHH4ZTOODN2SERRGQB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MKLTKVJLQHH4ZTOODN2SERRGQB","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f41006edea56a97d38ca0159c66049738b017c08988f7db1a9c3a41a4afd58be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T13:57:31Z","title_canon_sha256":"521ab7a130d487ad27f3419523465923407970841d12d1585df54ad876e4ed90"},"schema_version":"1.0","source":{"id":"2605.13553","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13553","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13553v1","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13553","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"MKLTKVJLQHH4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MKLTKVJLQHH4ZTOO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MKLTKVJL","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:13b7268140979ea750a464af47d67aedf3c99c0be86f68132a61929ab85d2daf","target":"graph","created_at":"2026-05-18T02:44:23Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that deciding subsumption between two concept descriptions in FL_bot_reg and FL_reg is PSpace-complete. When subsumption is considered with respect to a TBox, the complexity increases to ExpTime-complete. Our results are obtained via a novel reduction to parity pushdown games."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the novel reduction to parity pushdown games correctly captures the subsumption problem and that the complexity of the game problem transfers appropriately to the DL setting."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Subsumption in FL_bot_reg and FL_reg is PSpace-complete without TBoxes and ExpTime-complete with TBoxes via reduction to parity pushdown games."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Deciding concept subsumption in FL_bot_reg with TBoxes is ExpTime-complete."}],"snapshot_sha256":"665d01d3ba91d99e694acba7c2e44239e700a9e06f2615a10062823c436472cd"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f1dad8cb80e99eebd1491795f81861cf3768a8ed59001e5b9f2355ddb2959925"},"paper":{"abstract_excerpt":"Description logics (DL) are a family of formal languages for representing and reasoning about structured knowledge in terms of concepts and their relationships. A central reasoning problem in DL is concept subsumption. Although this problem has been widely studied, important open problems remain for certain logics. The expressive power of DLs depends on the constructors available for building complex concepts. In this work, we investigate subsumption in the restricted logic $\\mathcal{FL}_{\\bot \\mathit{reg}}$ and its related fragments $\\mathcal{FL}_\\mathit{reg}$, $\\mathcal{FL}_\\bot$, and $\\math","authors_text":"Barbara Morawska, Micha{\\l} Henne, Pawe{\\l} Parys","cross_cats":[],"headline":"Deciding concept subsumption in FL_bot_reg with TBoxes is ExpTime-complete.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T13:57:31Z","title":"Subsumption in $\\mathcal{FL}_{\\bot \\mathit{reg}}$ with TBoxes Is in ExpTime"},"references":{"count":16,"internal_anchors":0,"resolved_work":16,"sample":[{"cited_arxiv_id":"","doi":"10.1145/1075382.1075387","is_internal_anchor":false,"ref_index":1,"title":"Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T.W., Yannakakis, M.: Analysis of recursive state machines. ACM Trans. Program. Lang. Syst.27(4), 786–818 (2005). https://doi.org/10.1145/107","work_id":"2f7cf807-ebc4-448a-93e5-43cfc9a2ef60","year":2005},{"cited_arxiv_id":"","doi":"10.1007/bfb0054902","is_internal_anchor":false,"ref_index":2,"title":"Baader, F., Borgida, A., McGuinness, D.L.: Matching in description logics: Prelim- inary results. In: ICCS. pp. 15–34. Lecture Notes in Computer Science, Springer (1998). https://doi.org/10.1007/BFb00","work_id":"c7d80a25-37a5-4253-bcbf-1ea8e65830c0","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: IJCAI. pp. 364–","work_id":"c5c93ce2-e139-47a8-bbfc-8c375d246645","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Professional Book Center (2005), http://ijcai.org/Proceedings/05/Papers/ 0372.pdf","work_id":"c06eb19a-cec5-4d59-9252-272c212e1623","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Cam- bridge University Press (2003)","work_id":"c6058a37-afcf-49b4-b2cc-79c2031a5408","year":2003}],"snapshot_sha256":"950f319bcb61a040f7d64fbcbade94a8efeb8f40018cbd5cef321e9466550a67"},"source":{"id":"2605.13553","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:11:12.725574Z","id":"25f368b7-d555-442b-82cb-09b687e45829","model_set":{"reader":"grok-4.3"},"one_line_summary":"Subsumption in FL_bot_reg and FL_reg is PSpace-complete without TBoxes and ExpTime-complete with TBoxes via reduction to parity pushdown games.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Deciding concept subsumption in FL_bot_reg with TBoxes is ExpTime-complete.","strongest_claim":"We show that deciding subsumption between two concept descriptions in FL_bot_reg and FL_reg is PSpace-complete. When subsumption is considered with respect to a TBox, the complexity increases to ExpTime-complete. Our results are obtained via a novel reduction to parity pushdown games.","weakest_assumption":"That the novel reduction to parity pushdown games correctly captures the subsumption problem and that the complexity of the game problem transfers appropriately to the DL setting."}},"verdict_id":"25f368b7-d555-442b-82cb-09b687e45829"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8116f0ab65a704bf5949cba328e4df0a372270f1887dc60a9e255f739afcac7e","target":"record","created_at":"2026-05-18T02:44:23Z","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":"f41006edea56a97d38ca0159c66049738b017c08988f7db1a9c3a41a4afd58be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T13:57:31Z","title_canon_sha256":"521ab7a130d487ad27f3419523465923407970841d12d1585df54ad876e4ed90"},"schema_version":"1.0","source":{"id":"2605.13553","kind":"arxiv","version":1}},"canonical_sha256":"629735552b81cfcccdce1b75224626805abcd12b87ebbff3c899976cf4366d77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"629735552b81cfcccdce1b75224626805abcd12b87ebbff3c899976cf4366d77","first_computed_at":"2026-05-18T02:44:23.704102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:23.704102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SjacW/PgFJPfRHUlWDvLrp6jNTrm6tuNfg35YctZD+knjM/Ybpe0sqhFZp1x5XwDeS6lpkygwbWH2+0B5ojJCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:23.704523Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13553","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8116f0ab65a704bf5949cba328e4df0a372270f1887dc60a9e255f739afcac7e","sha256:13b7268140979ea750a464af47d67aedf3c99c0be86f68132a61929ab85d2daf","sha256:72dab89380422499a6403c443fb33a1581a04dab88724af556d79aab60c86607"],"state_sha256":"cede208da72e112cb05dfe1fdbe88b06af7814ce457769a84b89f131e7272b73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMEudlexQDpsdIoVln2+TptgLveq2D3eZoPnsMv1Zvd1nkifooGjt5h5ln7VatfX71KfOOyhtOk4IqCwleYrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T17:24:15.729416Z","bundle_sha256":"70e4b712db6e3f9df0e34d78efffcc3ccbbbf63edef8fc20e8c57b528e11efda"}}