{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SWR6OME3OHY3C6X7NF3R2KT2Q5","short_pith_number":"pith:SWR6OME3","schema_version":"1.0","canonical_sha256":"95a3e7309b71f1b17aff69771d2a7a8772b4f8f7eb8e7e0bb2cdff35576cec56","source":{"kind":"arxiv","id":"1802.07397","version":1},"attestation_state":"computed","paper":{"title":"PTL-separability and closures for WQOs on words","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche","submitted_at":"2018-02-21T01:47:25Z","abstract_excerpt":"We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of upward closed sets. In this way, a range of regular language classes arises as PTLs. Moreover, each of the WQOs guarantees regularity of all downward closed sets. We consider two problems. First, we study which (perhaps non-regular) language classes permit a decision procedure to decide whether two given languages are separable by a PTL with respect to a given"},"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":"1802.07397","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-02-21T01:47:25Z","cross_cats_sorted":[],"title_canon_sha256":"b9bee462590c72c8b92f9d498bf1a217071ccc8ba37fe46ed759f9646a3c783f","abstract_canon_sha256":"c3891bcd3f03025a7d17af93cf2bba2ac28b2d5e2319b997ced16c60bffb54b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:50.337221Z","signature_b64":"fuWSe39sm+w82eE1+XXbqR+TvS2iCMOvQb01X9xAhQcYImIINNyeSQ2aQeGexr5s4OCJs+3ajKBDm1/eYg+pAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95a3e7309b71f1b17aff69771d2a7a8772b4f8f7eb8e7e0bb2cdff35576cec56","last_reissued_at":"2026-05-18T00:22:50.336492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:50.336492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PTL-separability and closures for WQOs on words","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche","submitted_at":"2018-02-21T01:47:25Z","abstract_excerpt":"We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of upward closed sets. In this way, a range of regular language classes arises as PTLs. Moreover, each of the WQOs guarantees regularity of all downward closed sets. We consider two problems. First, we study which (perhaps non-regular) language classes permit a decision procedure to decide whether two given languages are separable by a PTL with respect to a given"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07397","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":"1802.07397","created_at":"2026-05-18T00:22:50.336604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07397v1","created_at":"2026-05-18T00:22:50.336604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07397","created_at":"2026-05-18T00:22:50.336604+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWR6OME3OHY3","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWR6OME3OHY3C6X7","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWR6OME3","created_at":"2026-05-18T12:32:53.628368+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/SWR6OME3OHY3C6X7NF3R2KT2Q5","json":"https://pith.science/pith/SWR6OME3OHY3C6X7NF3R2KT2Q5.json","graph_json":"https://pith.science/api/pith-number/SWR6OME3OHY3C6X7NF3R2KT2Q5/graph.json","events_json":"https://pith.science/api/pith-number/SWR6OME3OHY3C6X7NF3R2KT2Q5/events.json","paper":"https://pith.science/paper/SWR6OME3"},"agent_actions":{"view_html":"https://pith.science/pith/SWR6OME3OHY3C6X7NF3R2KT2Q5","download_json":"https://pith.science/pith/SWR6OME3OHY3C6X7NF3R2KT2Q5.json","view_paper":"https://pith.science/paper/SWR6OME3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07397&json=true","fetch_graph":"https://pith.science/api/pith-number/SWR6OME3OHY3C6X7NF3R2KT2Q5/graph.json","fetch_events":"https://pith.science/api/pith-number/SWR6OME3OHY3C6X7NF3R2KT2Q5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWR6OME3OHY3C6X7NF3R2KT2Q5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWR6OME3OHY3C6X7NF3R2KT2Q5/action/storage_attestation","attest_author":"https://pith.science/pith/SWR6OME3OHY3C6X7NF3R2KT2Q5/action/author_attestation","sign_citation":"https://pith.science/pith/SWR6OME3OHY3C6X7NF3R2KT2Q5/action/citation_signature","submit_replication":"https://pith.science/pith/SWR6OME3OHY3C6X7NF3R2KT2Q5/action/replication_record"}},"created_at":"2026-05-18T00:22:50.336604+00:00","updated_at":"2026-05-18T00:22:50.336604+00:00"}