{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZTAAFWBJD5T5VWAJ27CD5SSJFL","short_pith_number":"pith:ZTAAFWBJ","schema_version":"1.0","canonical_sha256":"ccc002d8291f67dad809d7c43eca492acfb9d31669bd829ff59b206c5bc8c2ff","source":{"kind":"arxiv","id":"1203.6152","version":1},"attestation_state":"computed","paper":{"title":"The FO^2 alternation hierarchy is decidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Manfred Kufleitner, Pascal Weil (LaBRI)","submitted_at":"2012-03-28T04:38:31Z","abstract_excerpt":"We consider the two-variable fragment FO^2[<] of first-order logic over finite words. Numerous characterizations of this class are known. Th\\'erien and Wilke have shown that it is decidable whether a given regular language is definable in FO^2[<]. From a practical point of view, as shown by Weis, FO^2[<] is interesting since its satisfiability problem is in NP. Restricting the number of quantifier alternations yields an infinite hierarchy inside the class of FO^2[<]-definable languages. We show that each level of this hierarchy is decidable. For this purpose, we relate each level of the hierar"},"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":"1203.6152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-03-28T04:38:31Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"64447845aec19a7ac4a1c86eeef54aa2d922ac07b232c4bffd61204f1f0afa90","abstract_canon_sha256":"0adef23b0276d5c187dac8ae650ae0eb42bc5be1dabe78ed92bebe0960ed93fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:46.762175Z","signature_b64":"KlFZbCMQSqbEIbOexKti2PJTWO9LVAaWR+FiTxVaHZY+fsGEN25iZrWAT8q7ArKqfFbbLlFnN2W6qbnFRDggCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccc002d8291f67dad809d7c43eca492acfb9d31669bd829ff59b206c5bc8c2ff","last_reissued_at":"2026-05-18T00:17:46.761554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:46.761554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The FO^2 alternation hierarchy is decidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Manfred Kufleitner, Pascal Weil (LaBRI)","submitted_at":"2012-03-28T04:38:31Z","abstract_excerpt":"We consider the two-variable fragment FO^2[<] of first-order logic over finite words. Numerous characterizations of this class are known. Th\\'erien and Wilke have shown that it is decidable whether a given regular language is definable in FO^2[<]. From a practical point of view, as shown by Weis, FO^2[<] is interesting since its satisfiability problem is in NP. Restricting the number of quantifier alternations yields an infinite hierarchy inside the class of FO^2[<]-definable languages. We show that each level of this hierarchy is decidable. For this purpose, we relate each level of the hierar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6152","kind":"arxiv","version":1},"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":"1203.6152","created_at":"2026-05-18T00:17:46.761671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.6152v1","created_at":"2026-05-18T00:17:46.761671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6152","created_at":"2026-05-18T00:17:46.761671+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTAAFWBJD5T5","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTAAFWBJD5T5VWAJ","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTAAFWBJ","created_at":"2026-05-18T12:27:30.460161+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/ZTAAFWBJD5T5VWAJ27CD5SSJFL","json":"https://pith.science/pith/ZTAAFWBJD5T5VWAJ27CD5SSJFL.json","graph_json":"https://pith.science/api/pith-number/ZTAAFWBJD5T5VWAJ27CD5SSJFL/graph.json","events_json":"https://pith.science/api/pith-number/ZTAAFWBJD5T5VWAJ27CD5SSJFL/events.json","paper":"https://pith.science/paper/ZTAAFWBJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZTAAFWBJD5T5VWAJ27CD5SSJFL","download_json":"https://pith.science/pith/ZTAAFWBJD5T5VWAJ27CD5SSJFL.json","view_paper":"https://pith.science/paper/ZTAAFWBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.6152&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTAAFWBJD5T5VWAJ27CD5SSJFL/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTAAFWBJD5T5VWAJ27CD5SSJFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTAAFWBJD5T5VWAJ27CD5SSJFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTAAFWBJD5T5VWAJ27CD5SSJFL/action/storage_attestation","attest_author":"https://pith.science/pith/ZTAAFWBJD5T5VWAJ27CD5SSJFL/action/author_attestation","sign_citation":"https://pith.science/pith/ZTAAFWBJD5T5VWAJ27CD5SSJFL/action/citation_signature","submit_replication":"https://pith.science/pith/ZTAAFWBJD5T5VWAJ27CD5SSJFL/action/replication_record"}},"created_at":"2026-05-18T00:17:46.761671+00:00","updated_at":"2026-05-18T00:17:46.761671+00:00"}