{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YLHUAXLDH3QBOF3BLEQC6ULHIM","short_pith_number":"pith:YLHUAXLD","schema_version":"1.0","canonical_sha256":"c2cf405d633ee017176159202f5167432143ccec4f95b89e009f8ed49084bd62","source":{"kind":"arxiv","id":"1101.4152","version":2},"attestation_state":"computed","paper":{"title":"Languages of Dot-depth One over Infinite Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Alexander Lauser, Manfred Kufleitner","submitted_at":"2011-01-21T15:00:08Z","abstract_excerpt":"Over finite words, languages of dot-depth one are expressively complete for alternation-free first-order logic. This fragment is also known as the Boolean closure of existential first-order logic. Here, the atomic formulas comprise order, successor, minimum, and maximum predicates. Knast (1983) has shown that it is decidable whether a language has dot-depth one. We extend Knast's result to infinite words. In particular, we describe the class of languages definable in alternation-free first-order logic over infinite words, and we give an effective characterization of this fragment. This charact"},"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":"1101.4152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-01-21T15:00:08Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"fb7f4b17b63830db90ce80345c3202950baeb6dd561bb0124636b8a0e3f28e09","abstract_canon_sha256":"285b49da81a9dc57ba6ae71478e4e665bae6cc2669447f8c49fa5016352a048c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:50.703812Z","signature_b64":"jmdKWcdZq+s4Wj+OwVsKiSXJg5HT7yA1LH1wWLNm0Zw6WXgEfwqiJ+NWuDVNpOvb3kCbnEFsq3YwuJXziU/VAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2cf405d633ee017176159202f5167432143ccec4f95b89e009f8ed49084bd62","last_reissued_at":"2026-05-18T02:22:50.703277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:50.703277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Languages of Dot-depth One over Infinite Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Alexander Lauser, Manfred Kufleitner","submitted_at":"2011-01-21T15:00:08Z","abstract_excerpt":"Over finite words, languages of dot-depth one are expressively complete for alternation-free first-order logic. This fragment is also known as the Boolean closure of existential first-order logic. Here, the atomic formulas comprise order, successor, minimum, and maximum predicates. Knast (1983) has shown that it is decidable whether a language has dot-depth one. We extend Knast's result to infinite words. In particular, we describe the class of languages definable in alternation-free first-order logic over infinite words, and we give an effective characterization of this fragment. This charact"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4152","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":"1101.4152","created_at":"2026-05-18T02:22:50.703348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4152v2","created_at":"2026-05-18T02:22:50.703348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4152","created_at":"2026-05-18T02:22:50.703348+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLHUAXLDH3QB","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLHUAXLDH3QBOF3B","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLHUAXLD","created_at":"2026-05-18T12:26:47.523578+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/YLHUAXLDH3QBOF3BLEQC6ULHIM","json":"https://pith.science/pith/YLHUAXLDH3QBOF3BLEQC6ULHIM.json","graph_json":"https://pith.science/api/pith-number/YLHUAXLDH3QBOF3BLEQC6ULHIM/graph.json","events_json":"https://pith.science/api/pith-number/YLHUAXLDH3QBOF3BLEQC6ULHIM/events.json","paper":"https://pith.science/paper/YLHUAXLD"},"agent_actions":{"view_html":"https://pith.science/pith/YLHUAXLDH3QBOF3BLEQC6ULHIM","download_json":"https://pith.science/pith/YLHUAXLDH3QBOF3BLEQC6ULHIM.json","view_paper":"https://pith.science/paper/YLHUAXLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4152&json=true","fetch_graph":"https://pith.science/api/pith-number/YLHUAXLDH3QBOF3BLEQC6ULHIM/graph.json","fetch_events":"https://pith.science/api/pith-number/YLHUAXLDH3QBOF3BLEQC6ULHIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLHUAXLDH3QBOF3BLEQC6ULHIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLHUAXLDH3QBOF3BLEQC6ULHIM/action/storage_attestation","attest_author":"https://pith.science/pith/YLHUAXLDH3QBOF3BLEQC6ULHIM/action/author_attestation","sign_citation":"https://pith.science/pith/YLHUAXLDH3QBOF3BLEQC6ULHIM/action/citation_signature","submit_replication":"https://pith.science/pith/YLHUAXLDH3QBOF3BLEQC6ULHIM/action/replication_record"}},"created_at":"2026-05-18T02:22:50.703348+00:00","updated_at":"2026-05-18T02:22:50.703348+00:00"}