{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3NGDADBHSKLQYZDXPS2S2P6HWC","short_pith_number":"pith:3NGDADBH","canonical_record":{"source":{"id":"2605.15390","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-14T20:19:30Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c7c4a37945d4f76daea25c74a9562c76653dfe35c9d652df990015010fee34db","abstract_canon_sha256":"d56b5b01980c7473eea1178dd9d06b82a3c765de2287d061b7add6512127c103"},"schema_version":"1.0"},"canonical_sha256":"db4c300c2792970c64777cb52d3fc7b0883e49b58a42a3e93ff22fd29502ea96","source":{"kind":"arxiv","id":"2605.15390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15390","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15390v1","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15390","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_12","alias_value":"3NGDADBHSKLQ","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_16","alias_value":"3NGDADBHSKLQYZDX","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_8","alias_value":"3NGDADBH","created_at":"2026-05-20T00:00:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3NGDADBHSKLQYZDXPS2S2P6HWC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15390","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-14T20:19:30Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c7c4a37945d4f76daea25c74a9562c76653dfe35c9d652df990015010fee34db","abstract_canon_sha256":"d56b5b01980c7473eea1178dd9d06b82a3c765de2287d061b7add6512127c103"},"schema_version":"1.0"},"canonical_sha256":"db4c300c2792970c64777cb52d3fc7b0883e49b58a42a3e93ff22fd29502ea96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:56.099255Z","signature_b64":"ynMJq9PkZfwv2SdnG91s4ULrab8dIsNMkDSYORzgVlTzRhvf9BT5drnLKTYK7fmlCaour3Ajs5j0XN5JoGi/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db4c300c2792970c64777cb52d3fc7b0883e49b58a42a3e93ff22fd29502ea96","last_reissued_at":"2026-05-20T00:00:56.098358Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:56.098358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15390","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-20T00:00:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzCOjub+PPNjU75TV/FgEjhz5R5+jdZfdlq/ClNwkexNKeT2achSPy2ZJg+v4TdFvzBhxg7fWfITO2OwMKrbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T03:22:01.366556Z"},"content_sha256":"76655b3a98ab7fc7b8b5d36c403bbfb0f81753b5706e6cc3db2a095b62643fea","schema_version":"1.0","event_id":"sha256:76655b3a98ab7fc7b8b5d36c403bbfb0f81753b5706e6cc3db2a095b62643fea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3NGDADBHSKLQYZDXPS2S2P6HWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kofola 1.0: A Modular Approach to {\\omega}-Regular Complementation and Inclusion Checking (Technical Report)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Kofola decomposes Büchi automata into strongly connected components and applies tailored complementation to each.","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Luk\\'a\\v{s} Hol\\'ik, Nicolas Mazzocchi, Ondrej Alexaj, Ond\\v{r}ej Leng\\'al, Vojt\\v{e}ch Havlena, Yong Li","submitted_at":"2026-05-14T20:19:30Z","abstract_excerpt":"We present Kofola, an efficient tool for complementation and inclusion checking of B\\\"uchi automata, two central tasks in automata-theoretic verification with applications in model checking, monitoring, and theorem proving. Kofola implements a state-of-the-art modular complementation framework that decomposes the input automaton into strongly connected components and applies to each component a complementation algorithm tailored to its structural properties. Building on this modular construction, Kofola also provides modular inclusion checking with new heuristics. A key ingredient is a new on-"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Kofola implements a state-of-the-art modular complementation framework that decomposes the input automaton into strongly connected components and applies to each component a complementation algorithm tailored to its structural properties. Building on this modular construction, Kofola also provides modular inclusion checking with new heuristics. Empirical evaluation shows that Kofola is highly competitive with state-of-the-art complementation and inclusion-checking tools: it is the most robust tool in our evaluation and often outperforms competitors by several orders of magnitude on benchmarks from practical applications.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The decomposition into strongly connected components combined with per-component tailored complementation algorithms and the new on-the-fly emptiness checker for the produced generalized Rabin pair condition together preserve correctness while delivering the reported efficiency gains (abstract, paragraphs describing the framework and the emptiness-checking algorithm).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Kofola 1.0 implements a modular SCC-based complementation framework for Büchi automata with tailored per-component algorithms, a new on-the-fly emptiness checker, and modular inclusion heuristics, showing strong empirical performance.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Kofola decomposes Büchi automata into strongly connected components and applies tailored complementation to each.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4f74b667f6a1f6f2e87c04496c1c30408ecf20e7b27687ab63490d932682ccad"},"source":{"id":"2605.15390","kind":"arxiv","version":1},"verdict":{"id":"be25cf9e-59d0-4021-ac53-c11235711b91","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:14:45.565041Z","strongest_claim":"Kofola implements a state-of-the-art modular complementation framework that decomposes the input automaton into strongly connected components and applies to each component a complementation algorithm tailored to its structural properties. Building on this modular construction, Kofola also provides modular inclusion checking with new heuristics. Empirical evaluation shows that Kofola is highly competitive with state-of-the-art complementation and inclusion-checking tools: it is the most robust tool in our evaluation and often outperforms competitors by several orders of magnitude on benchmarks from practical applications.","one_line_summary":"Kofola 1.0 implements a modular SCC-based complementation framework for Büchi automata with tailored per-component algorithms, a new on-the-fly emptiness checker, and modular inclusion heuristics, showing strong empirical performance.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The decomposition into strongly connected components combined with per-component tailored complementation algorithms and the new on-the-fly emptiness checker for the produced generalized Rabin pair condition together preserve correctness while delivering the reported efficiency gains (abstract, paragraphs describing the framework and the emptiness-checking algorithm).","pith_extraction_headline":"Kofola decomposes Büchi automata into strongly connected components and applies tailored complementation to each."},"integrity":{"clean":false,"summary":{"advisory":1,"critical":0,"by_detector":{"doi_compliance":{"total":1,"advisory":1,"critical":0,"informational":0}},"informational":0},"endpoint":"/pith/2605.15390/integrity.json","findings":[{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.2168/LMCS-10(4:13) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":54,"audited_at":"2026-05-19T15:22:36.528543Z","detected_doi":"10.2168/LMCS-10(4:13","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:57.408336Z","status":"completed","version":"0.1.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T15:31:17.862364Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:22:36.528543Z","status":"completed","version":"1.0.0","findings_count":1},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.170460Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.723293Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"beb7a3ad540721b3134e67be9ec90d56f5022536b5897cc8361c6f7e465ea759"},"references":{"count":56,"sample":[{"doi":"","year":2025,"title":"Automata-benchmarks.https://github.com/ondrik/automata-benchmarks/ tree/master/omega/(2025) 2.Kofola.https://github.com/VeriFIT/kofola(2025)","work_id":"cc1efa32-2ea6-43ca-96cd-c5ea8078794d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"In: Touili, T., Cook, B., Jackson, P.B","work_id":"a7b53670-5d9f-4d69-896d-175062984d10","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-642-14295-6_14","year":2010,"title":"Springer (2010).https://doi.org/10.1007/978-3-642-14295-6_14,https: //doi.org/10.1007/978-3-642-14295-6_14","work_id":"83236c4d-d247-4813-b910-748753c0c8f0","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-642-23217-6_13","year":2011,"title":"In: Katoen, J., K¨ onig, B","work_id":"054f9a6d-0ba5-45b5-aeb7-6e70d1c0ee56","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.5281/zenodo.17478623","year":2025,"title":"Alexaj, O., Havlena, V., Hol´ ık, L., Leng´ al, O., Li, Y., Mazzocchi, N.: Artifact: Kofola1.0: A modular approach toω-regular complementation and inclusion checking (october 2025).https://doi.org/10.","work_id":"c057ce50-e310-4a4c-8f85-d4a9c1b4ac24","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":56,"snapshot_sha256":"51ae73651c318524ec65a35beab13d6a343d9067ed9e9c8b0cff26dab66c3922","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"},"verdict_id":"be25cf9e-59d0-4021-ac53-c11235711b91"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DUvk8iY2oT0+FiUgxUviR9dy679iUeYWfE/xm1ELepkoQW6ZJm9pCLVDVZrl7I5NiR7Mhrfc5u8uZ2oZmsvLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T03:22:01.367369Z"},"content_sha256":"113072ceca5335814dd4dd7e1d23e4016ba5fb70d4561bc22288e1cd12516505","schema_version":"1.0","event_id":"sha256:113072ceca5335814dd4dd7e1d23e4016ba5fb70d4561bc22288e1cd12516505"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:3NGDADBHSKLQYZDXPS2S2P6HWC","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.2168/LMCS-10(4:13) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Tsai, M., Fogarty, S., Vardi, M.Y., Tsay, Y.: State of B¨ uchi complementation. Log. Methods Comput. Sci.10(4) (2014).https://doi.org/10.2168/LMCS-10(4: 13)2014,https://doi.org/10.2168/LMCS-10(4:13)2014 17","arxiv_id":"2605.15390","detector":"doi_compliance","evidence":{"ref_index":54,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Tsai, M., Fogarty, S., Vardi, M.Y., Tsay, Y.: State of B¨ uchi complementation. Log. Methods Comput. Sci.10(4) (2014).https://doi.org/10.2168/LMCS-10(4: 13)2014,https://doi.org/10.2168/LMCS-10(4:13)2014 17","reconstructed_doi":"10.2168/LMCS-10(4:13"},"severity":"advisory","ref_index":54,"audited_at":"2026-05-19T15:22:36.528543Z","event_type":"pith.integrity.v1","detected_doi":"10.2168/LMCS-10(4:13","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"2103f767cc042ab8c38d459ff14f6249f415fd7c71b1dac8277d78da14a37236","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":1842,"payload_sha256":"67266a8e41c96ad1ac1bb09b15977fffe7763f15021bfc76264e43556cabdae6","signature_b64":"0dh7vHNejuWAybV8EGLY4lo+8TCpNUVyyAVILRGspv7ZmXe6bYhxTNEYVLUlcrKIAHUUy9K+ZcO+S/2N9pHbBg==","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-19T15:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YIaR6cvlHJMGh7xl2vMPi/7xc8CAX8LQOpgRVls83VFHcW2IgNOv70hgkre+g+zBu6DUqKcdSDIShZW0kEIxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T03:22:01.368341Z"},"content_sha256":"3521e2feaa2dac2868d499d34de5b291f4f93191443ad198513df99ce7fffd72","schema_version":"1.0","event_id":"sha256:3521e2feaa2dac2868d499d34de5b291f4f93191443ad198513df99ce7fffd72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NGDADBHSKLQYZDXPS2S2P6HWC/bundle.json","state_url":"https://pith.science/pith/3NGDADBHSKLQYZDXPS2S2P6HWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NGDADBHSKLQYZDXPS2S2P6HWC/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-21T03:22:01Z","links":{"resolver":"https://pith.science/pith/3NGDADBHSKLQYZDXPS2S2P6HWC","bundle":"https://pith.science/pith/3NGDADBHSKLQYZDXPS2S2P6HWC/bundle.json","state":"https://pith.science/pith/3NGDADBHSKLQYZDXPS2S2P6HWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NGDADBHSKLQYZDXPS2S2P6HWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3NGDADBHSKLQYZDXPS2S2P6HWC","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":"d56b5b01980c7473eea1178dd9d06b82a3c765de2287d061b7add6512127c103","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-14T20:19:30Z","title_canon_sha256":"c7c4a37945d4f76daea25c74a9562c76653dfe35c9d652df990015010fee34db"},"schema_version":"1.0","source":{"id":"2605.15390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15390","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15390v1","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15390","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_12","alias_value":"3NGDADBHSKLQ","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_16","alias_value":"3NGDADBHSKLQYZDX","created_at":"2026-05-20T00:00:56Z"},{"alias_kind":"pith_short_8","alias_value":"3NGDADBH","created_at":"2026-05-20T00:00:56Z"}],"graph_snapshots":[{"event_id":"sha256:113072ceca5335814dd4dd7e1d23e4016ba5fb70d4561bc22288e1cd12516505","target":"graph","created_at":"2026-05-20T00:00:56Z","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":"Kofola implements a state-of-the-art modular complementation framework that decomposes the input automaton into strongly connected components and applies to each component a complementation algorithm tailored to its structural properties. Building on this modular construction, Kofola also provides modular inclusion checking with new heuristics. Empirical evaluation shows that Kofola is highly competitive with state-of-the-art complementation and inclusion-checking tools: it is the most robust tool in our evaluation and often outperforms competitors by several orders of magnitude on benchmarks from practical applications."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The decomposition into strongly connected components combined with per-component tailored complementation algorithms and the new on-the-fly emptiness checker for the produced generalized Rabin pair condition together preserve correctness while delivering the reported efficiency gains (abstract, paragraphs describing the framework and the emptiness-checking algorithm)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Kofola 1.0 implements a modular SCC-based complementation framework for Büchi automata with tailored per-component algorithms, a new on-the-fly emptiness checker, and modular inclusion heuristics, showing strong empirical performance."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Kofola decomposes Büchi automata into strongly connected components and applies tailored complementation to each."}],"snapshot_sha256":"4f74b667f6a1f6f2e87c04496c1c30408ecf20e7b27687ab63490d932682ccad"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:57.408336Z","status":"completed","version":"0.1.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T15:31:17.862364Z","status":"completed","version":"1.0.0"},{"findings_count":1,"name":"doi_compliance","ran_at":"2026-05-19T15:22:36.528543Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.170460Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.723293Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15390/integrity.json","findings":[{"audited_at":"2026-05-19T15:22:36.528543Z","detected_arxiv_id":null,"detected_doi":"10.2168/LMCS-10(4:13","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.2168/LMCS-10(4:13) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":54,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"beb7a3ad540721b3134e67be9ec90d56f5022536b5897cc8361c6f7e465ea759","summary":{"advisory":1,"by_detector":{"doi_compliance":{"advisory":1,"critical":0,"informational":0,"total":1}},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present Kofola, an efficient tool for complementation and inclusion checking of B\\\"uchi automata, two central tasks in automata-theoretic verification with applications in model checking, monitoring, and theorem proving. Kofola implements a state-of-the-art modular complementation framework that decomposes the input automaton into strongly connected components and applies to each component a complementation algorithm tailored to its structural properties. Building on this modular construction, Kofola also provides modular inclusion checking with new heuristics. A key ingredient is a new on-","authors_text":"Luk\\'a\\v{s} Hol\\'ik, Nicolas Mazzocchi, Ondrej Alexaj, Ond\\v{r}ej Leng\\'al, Vojt\\v{e}ch Havlena, Yong Li","cross_cats":["cs.FL"],"headline":"Kofola decomposes Büchi automata into strongly connected components and applies tailored complementation to each.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-14T20:19:30Z","title":"Kofola 1.0: A Modular Approach to {\\omega}-Regular Complementation and Inclusion Checking (Technical Report)"},"references":{"count":56,"internal_anchors":0,"resolved_work":56,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Automata-benchmarks.https://github.com/ondrik/automata-benchmarks/ tree/master/omega/(2025) 2.Kofola.https://github.com/VeriFIT/kofola(2025)","work_id":"cc1efa32-2ea6-43ca-96cd-c5ea8078794d","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"In: Touili, T., Cook, B., Jackson, P.B","work_id":"a7b53670-5d9f-4d69-896d-175062984d10","year":2010},{"cited_arxiv_id":"","doi":"10.1007/978-3-642-14295-6_14","is_internal_anchor":false,"ref_index":3,"title":"Springer (2010).https://doi.org/10.1007/978-3-642-14295-6_14,https: //doi.org/10.1007/978-3-642-14295-6_14","work_id":"83236c4d-d247-4813-b910-748753c0c8f0","year":2010},{"cited_arxiv_id":"","doi":"10.1007/978-3-642-23217-6_13","is_internal_anchor":false,"ref_index":4,"title":"In: Katoen, J., K¨ onig, B","work_id":"054f9a6d-0ba5-45b5-aeb7-6e70d1c0ee56","year":2011},{"cited_arxiv_id":"","doi":"10.5281/zenodo.17478623","is_internal_anchor":false,"ref_index":5,"title":"Alexaj, O., Havlena, V., Hol´ ık, L., Leng´ al, O., Li, Y., Mazzocchi, N.: Artifact: Kofola1.0: A modular approach toω-regular complementation and inclusion checking (october 2025).https://doi.org/10.","work_id":"c057ce50-e310-4a4c-8f85-d4a9c1b4ac24","year":2025}],"snapshot_sha256":"51ae73651c318524ec65a35beab13d6a343d9067ed9e9c8b0cff26dab66c3922"},"source":{"id":"2605.15390","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:14:45.565041Z","id":"be25cf9e-59d0-4021-ac53-c11235711b91","model_set":{"reader":"grok-4.3"},"one_line_summary":"Kofola 1.0 implements a modular SCC-based complementation framework for Büchi automata with tailored per-component algorithms, a new on-the-fly emptiness checker, and modular inclusion heuristics, showing strong empirical performance.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Kofola decomposes Büchi automata into strongly connected components and applies tailored complementation to each.","strongest_claim":"Kofola implements a state-of-the-art modular complementation framework that decomposes the input automaton into strongly connected components and applies to each component a complementation algorithm tailored to its structural properties. Building on this modular construction, Kofola also provides modular inclusion checking with new heuristics. Empirical evaluation shows that Kofola is highly competitive with state-of-the-art complementation and inclusion-checking tools: it is the most robust tool in our evaluation and often outperforms competitors by several orders of magnitude on benchmarks from practical applications.","weakest_assumption":"The decomposition into strongly connected components combined with per-component tailored complementation algorithms and the new on-the-fly emptiness checker for the produced generalized Rabin pair condition together preserve correctness while delivering the reported efficiency gains (abstract, paragraphs describing the framework and the emptiness-checking algorithm)."}},"verdict_id":"be25cf9e-59d0-4021-ac53-c11235711b91"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:76655b3a98ab7fc7b8b5d36c403bbfb0f81753b5706e6cc3db2a095b62643fea","target":"record","created_at":"2026-05-20T00:00:56Z","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":"d56b5b01980c7473eea1178dd9d06b82a3c765de2287d061b7add6512127c103","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-14T20:19:30Z","title_canon_sha256":"c7c4a37945d4f76daea25c74a9562c76653dfe35c9d652df990015010fee34db"},"schema_version":"1.0","source":{"id":"2605.15390","kind":"arxiv","version":1}},"canonical_sha256":"db4c300c2792970c64777cb52d3fc7b0883e49b58a42a3e93ff22fd29502ea96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db4c300c2792970c64777cb52d3fc7b0883e49b58a42a3e93ff22fd29502ea96","first_computed_at":"2026-05-20T00:00:56.098358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:56.098358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ynMJq9PkZfwv2SdnG91s4ULrab8dIsNMkDSYORzgVlTzRhvf9BT5drnLKTYK7fmlCaour3Ajs5j0XN5JoGi/DQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:56.099255Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3521e2feaa2dac2868d499d34de5b291f4f93191443ad198513df99ce7fffd72","sha256:76655b3a98ab7fc7b8b5d36c403bbfb0f81753b5706e6cc3db2a095b62643fea","sha256:113072ceca5335814dd4dd7e1d23e4016ba5fb70d4561bc22288e1cd12516505"],"state_sha256":"b75e4f3c84a53907849a3bd9142899794b686f987c0d85ba1573bafbb7832c4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lNM6ZuwN8XPzvY+wEZX5smY6YbmPOXk8kabTayYmPT+9V6Xu4bpfrRiFpumEN7d+j8zAM6vEx4zshM54iJwOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T03:22:01.372128Z","bundle_sha256":"9219c72ab8026c16857216b6cbf087bbe7ff43462e128cb01466c286d236dd6c"}}