{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YLJTME6HCCYLIT7HOMIROU7NDZ","short_pith_number":"pith:YLJTME6H","schema_version":"1.0","canonical_sha256":"c2d33613c710b0b44fe773111753ed1e7c9c0dee7f20f9b064ecaafca6ef7da2","source":{"kind":"arxiv","id":"1704.07856","version":2},"attestation_state":"computed","paper":{"title":"Separability by Piecewise Testable Languages is PTime-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Tom\\'a\\v{s} Masopust","submitted_at":"2017-04-25T18:24:50Z","abstract_excerpt":"Piecewise testable languages form the first level of the Straubing-Th\\'erien hierarchy. The membership problem for this level is decidable and testing if the language of a DFA is piecewise testable is NL-complete. The question has not yet been addressed for NFAs. We fill in this gap by showing that it is PSpace-complete. The main result is then the lower-bound complexity of separability of regular languages by piecewise testable languages. Two regular languages are separable by a piecewise testable language if the piecewise testable language includes one of them and is disjoint from the other."},"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":"1704.07856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-04-25T18:24:50Z","cross_cats_sorted":[],"title_canon_sha256":"7cc54108410c469b725f7eb08059355e2462b9493892e38942153d9da3090f18","abstract_canon_sha256":"d6362475f0d5346800067d8a486d867aee68291325f43a6226c3ef0a121c34a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:22.223102Z","signature_b64":"CpEblSsDdQHJmWzUqf63eY0Up7wUhb8YMEMVg7lBKi/S1K+VkZ45znGawkSBxNyt8Vg5q9hy6iFCH3bSXF2HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2d33613c710b0b44fe773111753ed1e7c9c0dee7f20f9b064ecaafca6ef7da2","last_reissued_at":"2026-05-18T00:30:22.222618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:22.222618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separability by Piecewise Testable Languages is PTime-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Tom\\'a\\v{s} Masopust","submitted_at":"2017-04-25T18:24:50Z","abstract_excerpt":"Piecewise testable languages form the first level of the Straubing-Th\\'erien hierarchy. The membership problem for this level is decidable and testing if the language of a DFA is piecewise testable is NL-complete. The question has not yet been addressed for NFAs. We fill in this gap by showing that it is PSpace-complete. The main result is then the lower-bound complexity of separability of regular languages by piecewise testable languages. Two regular languages are separable by a piecewise testable language if the piecewise testable language includes one of them and is disjoint from the other."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07856","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":"1704.07856","created_at":"2026-05-18T00:30:22.222696+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07856v2","created_at":"2026-05-18T00:30:22.222696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07856","created_at":"2026-05-18T00:30:22.222696+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLJTME6HCCYL","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLJTME6HCCYLIT7H","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLJTME6H","created_at":"2026-05-18T12:31:56.362134+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/YLJTME6HCCYLIT7HOMIROU7NDZ","json":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ.json","graph_json":"https://pith.science/api/pith-number/YLJTME6HCCYLIT7HOMIROU7NDZ/graph.json","events_json":"https://pith.science/api/pith-number/YLJTME6HCCYLIT7HOMIROU7NDZ/events.json","paper":"https://pith.science/paper/YLJTME6H"},"agent_actions":{"view_html":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ","download_json":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ.json","view_paper":"https://pith.science/paper/YLJTME6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07856&json=true","fetch_graph":"https://pith.science/api/pith-number/YLJTME6HCCYLIT7HOMIROU7NDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YLJTME6HCCYLIT7HOMIROU7NDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ/action/storage_attestation","attest_author":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ/action/author_attestation","sign_citation":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ/action/citation_signature","submit_replication":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ/action/replication_record"}},"created_at":"2026-05-18T00:30:22.222696+00:00","updated_at":"2026-05-18T00:30:22.222696+00:00"}