{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PMNBWBNGEJXPS6KZQDMDYZ37YI","short_pith_number":"pith:PMNBWBNG","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"},"canonical_sha256":"7b1a1b05a6226ef9795980d83c677fc21ce33cf00863422f15ed0f8205cf73d6","source":{"kind":"arxiv","id":"1412.1641","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1641","created_at":"2026-05-18T01:55:42Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1641v2","created_at":"2026-05-18T01:55:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1641","created_at":"2026-05-18T01:55:42Z"},{"alias_kind":"pith_short_12","alias_value":"PMNBWBNGEJXP","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PMNBWBNGEJXPS6KZ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PMNBWBNG","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PMNBWBNGEJXPS6KZQDMDYZ37YI","target":"record","payload":{"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"},"canonical_sha256":"7b1a1b05a6226ef9795980d83c677fc21ce33cf00863422f15ed0f8205cf73d6","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"},"source_kind":"arxiv","source_id":"1412.1641","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:55:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bxI42AONoES296ZCuEv+/GvH0otR8OJhglcDvYvPPfWNXZl9IiXxVWwxPlbDBrT7oNrZWnYjIbYe+YP1MG1KBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:33:07.380435Z"},"content_sha256":"0a94ca819e387fd3fbc316b9f52a8347019a036c37e052739ec13bc79b123dbd","schema_version":"1.0","event_id":"sha256:0a94ca819e387fd3fbc316b9f52a8347019a036c37e052739ec13bc79b123dbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PMNBWBNGEJXPS6KZQDMDYZ37YI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:55:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54cT/7yAmHBn4iFSqldZdx/srTDxxJNr6Ja0NEbPxtG8ZeryCwJdR484UutuI/QtD75sjwxXlW6FoNJ9FrMbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:33:07.380804Z"},"content_sha256":"ba4c15747d07155c28145fcee2944b8b59053dd410be9dcc5addc3d0505d6a19","schema_version":"1.0","event_id":"sha256:ba4c15747d07155c28145fcee2944b8b59053dd410be9dcc5addc3d0505d6a19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI/bundle.json","state_url":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T19:33:07Z","links":{"resolver":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI","bundle":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI/bundle.json","state":"https://pith.science/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PMNBWBNGEJXPS6KZQDMDYZ37YI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PMNBWBNGEJXPS6KZQDMDYZ37YI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"89df9472f53b3813c3879773dc70172a7a450d5e6ff9616881deac13d4fa49e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-04T12:27:07Z","title_canon_sha256":"9d5b5e2ea7c814bb90e751fdaa96d381a304cb4db5575b45fa144ab142a9a3f7"},"schema_version":"1.0","source":{"id":"1412.1641","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1641","created_at":"2026-05-18T01:55:42Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1641v2","created_at":"2026-05-18T01:55:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1641","created_at":"2026-05-18T01:55:42Z"},{"alias_kind":"pith_short_12","alias_value":"PMNBWBNGEJXP","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PMNBWBNGEJXPS6KZ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PMNBWBNG","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:ba4c15747d07155c28145fcee2944b8b59053dd410be9dcc5addc3d0505d6a19","target":"graph","created_at":"2026-05-18T01:55:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Micha\\\"el Thomazo, Tom\\'a\\v{s} Masopust","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-04T12:27:07Z","title":"On $k$-piecewise testability (preliminary report)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1641","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0a94ca819e387fd3fbc316b9f52a8347019a036c37e052739ec13bc79b123dbd","target":"record","created_at":"2026-05-18T01:55:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"89df9472f53b3813c3879773dc70172a7a450d5e6ff9616881deac13d4fa49e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-12-04T12:27:07Z","title_canon_sha256":"9d5b5e2ea7c814bb90e751fdaa96d381a304cb4db5575b45fa144ab142a9a3f7"},"schema_version":"1.0","source":{"id":"1412.1641","kind":"arxiv","version":2}},"canonical_sha256":"7b1a1b05a6226ef9795980d83c677fc21ce33cf00863422f15ed0f8205cf73d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b1a1b05a6226ef9795980d83c677fc21ce33cf00863422f15ed0f8205cf73d6","first_computed_at":"2026-05-18T01:55:42.582899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:42.582899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZofS2kgMStvllgLniVyqc8WvteNuEi6Q1lQ3Qxxa7JY//NZM/plZrBq4jGjCe+NLBueKw503Q4YmVJ+tIWhVDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:42.583538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1641","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a94ca819e387fd3fbc316b9f52a8347019a036c37e052739ec13bc79b123dbd","sha256:ba4c15747d07155c28145fcee2944b8b59053dd410be9dcc5addc3d0505d6a19"],"state_sha256":"5d43eb752f1d4bd46d67e652545776a857650837f369e75caa8b141d5805e8d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c12p4atGPYcR0hcrj0fekI06t3R7nfbrgMokkoDvyWsVhKifefWM8aI/CQoShS406oXgZrS4S6oomLxRNNxRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:33:07.383575Z","bundle_sha256":"e519843ab0cf82ea02408b5be17391ffac2d0ac98cb7f618c301189eefdde17b"}}