{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PMNBWBNGEJXPS6KZQDMDYZ37YI","short_pith_number":"pith:PMNBWBNG","schema_version":"1.0","canonical_sha256":"7b1a1b05a6226ef9795980d83c677fc21ce33cf00863422f15ed0f8205cf73d6","source":{"kind":"arxiv","id":"1412.1641","version":2},"attestation_state":"computed","paper":{"title":"On $k$-piecewise testability (preliminary report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Micha\\\"el Thomazo, Tom\\'a\\v{s} Masopust","submitted_at":"2014-12-04T12:27:07Z","abstract_excerpt":"For a non-negative integer $k$, a language is $k$-piecewise test\\-able ($k$-PT) if it is a finite boolean combination of languages of the form $\\Sigma^* a_1 \\Sigma^* \\cdots \\Sigma^* a_n \\Sigma^*$ for $a_i\\in\\Sigma$ and $0\\le n \\le k$. We study the following problem: Given a DFA recognizing a piecewise testable language, decide whether the language is $k$-PT. We provide a complexity bound and a detailed analysis for small $k$'s. The result can be used to find the minimal $k$ for which the language is $k$-PT. We show that the upper bound on $k$ given by the depth of the minimal DFA can be expone"},"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":"1412.1641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-04T12:27:07Z","cross_cats_sorted":[],"title_canon_sha256":"9d5b5e2ea7c814bb90e751fdaa96d381a304cb4db5575b45fa144ab142a9a3f7","abstract_canon_sha256":"89df9472f53b3813c3879773dc70172a7a450d5e6ff9616881deac13d4fa49e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:42.583538Z","signature_b64":"ZofS2kgMStvllgLniVyqc8WvteNuEi6Q1lQ3Qxxa7JY//NZM/plZrBq4jGjCe+NLBueKw503Q4YmVJ+tIWhVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b1a1b05a6226ef9795980d83c677fc21ce33cf00863422f15ed0f8205cf73d6","last_reissued_at":"2026-05-18T01:55:42.582899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:42.582899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $k$-piecewise testability (preliminary report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Micha\\\"el Thomazo, Tom\\'a\\v{s} Masopust","submitted_at":"2014-12-04T12:27:07Z","abstract_excerpt":"For a non-negative integer $k$, a language is $k$-piecewise test\\-able ($k$-PT) if it is a finite boolean combination of languages of the form $\\Sigma^* a_1 \\Sigma^* \\cdots \\Sigma^* a_n \\Sigma^*$ for $a_i\\in\\Sigma$ and $0\\le n \\le k$. We study the following problem: Given a DFA recognizing a piecewise testable language, decide whether the language is $k$-PT. We provide a complexity bound and a detailed analysis for small $k$'s. The result can be used to find the minimal $k$ for which the language is $k$-PT. We show that the upper bound on $k$ given by the depth of the minimal DFA can be expone"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1641","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":"1412.1641","created_at":"2026-05-18T01:55:42.583018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1641v2","created_at":"2026-05-18T01:55:42.583018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1641","created_at":"2026-05-18T01:55:42.583018+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMNBWBNGEJXP","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMNBWBNGEJXPS6KZ","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMNBWBNG","created_at":"2026-05-18T12:28:43.426989+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/PMNBWBNGEJXPS6KZQDMDYZ37YI","json":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI.json","graph_json":"https://pith.science/api/pith-number/PMNBWBNGEJXPS6KZQDMDYZ37YI/graph.json","events_json":"https://pith.science/api/pith-number/PMNBWBNGEJXPS6KZQDMDYZ37YI/events.json","paper":"https://pith.science/paper/PMNBWBNG"},"agent_actions":{"view_html":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI","download_json":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI.json","view_paper":"https://pith.science/paper/PMNBWBNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1641&json=true","fetch_graph":"https://pith.science/api/pith-number/PMNBWBNGEJXPS6KZQDMDYZ37YI/graph.json","fetch_events":"https://pith.science/api/pith-number/PMNBWBNGEJXPS6KZQDMDYZ37YI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI/action/storage_attestation","attest_author":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI/action/author_attestation","sign_citation":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI/action/citation_signature","submit_replication":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI/action/replication_record"}},"created_at":"2026-05-18T01:55:42.583018+00:00","updated_at":"2026-05-18T01:55:42.583018+00:00"}