{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VMPYQKI3Z4JCZT4FHR4JVMF6MA","short_pith_number":"pith:VMPYQKI3","canonical_record":{"source":{"id":"1603.00361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-03-01T17:11:05Z","cross_cats_sorted":[],"title_canon_sha256":"24aae810881e11b1102fa06e7e2f3faf10a60d6bd998d5ff95971f86d1b588f9","abstract_canon_sha256":"cff625189878cccafed0209328d88b67214011e83bd4e11a7a8a7e58292ecff5"},"schema_version":"1.0"},"canonical_sha256":"ab1f88291bcf122ccf853c789ab0be601e3ede24f86280a33468f656de577169","source":{"kind":"arxiv","id":"1603.00361","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00361","created_at":"2026-05-18T01:05:43Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00361v2","created_at":"2026-05-18T01:05:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00361","created_at":"2026-05-18T01:05:43Z"},{"alias_kind":"pith_short_12","alias_value":"VMPYQKI3Z4JC","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VMPYQKI3Z4JCZT4F","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VMPYQKI3","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VMPYQKI3Z4JCZT4FHR4JVMF6MA","target":"record","payload":{"canonical_record":{"source":{"id":"1603.00361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-03-01T17:11:05Z","cross_cats_sorted":[],"title_canon_sha256":"24aae810881e11b1102fa06e7e2f3faf10a60d6bd998d5ff95971f86d1b588f9","abstract_canon_sha256":"cff625189878cccafed0209328d88b67214011e83bd4e11a7a8a7e58292ecff5"},"schema_version":"1.0"},"canonical_sha256":"ab1f88291bcf122ccf853c789ab0be601e3ede24f86280a33468f656de577169","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:43.844412Z","signature_b64":"TWrQ6XO2r+wxOxbi0oQN2N5MG+uFokU13sDyj8YmiUjCTd2RXDQ8KfHVtBW6ANJSUHXn+KT5TsfTkwqWTGVFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab1f88291bcf122ccf853c789ab0be601e3ede24f86280a33468f656de577169","last_reissued_at":"2026-05-18T01:05:43.844002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:43.844002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.00361","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:05:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1E6705cf9CGqseA5XFgZlpv2ybDDC1tFKN0/2YfYV37QkcWtQ2/6pAWVpCb5IAWcXH9zaPbkONfdkckc/3lhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:54:35.350648Z"},"content_sha256":"3aa3905619ecca88683806f14ce7f3f9152217207e4a347f938e2321c632c5db","schema_version":"1.0","event_id":"sha256:3aa3905619ecca88683806f14ce7f3f9152217207e4a347f938e2321c632c5db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VMPYQKI3Z4JCZT4FHR4JVMF6MA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Piecewise Testable Languages and Nondeterministic Automata","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":"2016-03-01T17:11:05Z","abstract_excerpt":"A regular language is $k$-piecewise testable if it is a finite boolean combination of languages of the form $\\Sigma^* a_1 \\Sigma^* \\cdots \\Sigma^* a_n \\Sigma^*$, where $a_i\\in\\Sigma$ and $0\\le n \\le k$. Given a DFA $A$ and $k\\ge 0$, it is an NL-complete problem to decide whether the language $L(A)$ is piecewise testable and, for $k\\ge 4$, it is coNP-complete to decide whether the language $L(A)$ is $k$-piecewise testable. It is known that the depth of the minimal DFA serves as an upper bound on $k$. Namely, if $L(A)$ is piecewise testable, then it is $k$-piecewise testable for $k$ equal to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00361","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:05:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHyVEKCY53QpaOazlczcTGCwtEV0J93xB8Gn9gtnIgnYqAMkavwsowfR2KpYPLIyUL4kj5k600lqhiieC/+tBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:54:35.351031Z"},"content_sha256":"094be8bea2b751569485676d571459b499af9d513c0499c631ef794c161f0910","schema_version":"1.0","event_id":"sha256:094be8bea2b751569485676d571459b499af9d513c0499c631ef794c161f0910"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMPYQKI3Z4JCZT4FHR4JVMF6MA/bundle.json","state_url":"https://pith.science/pith/VMPYQKI3Z4JCZT4FHR4JVMF6MA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMPYQKI3Z4JCZT4FHR4JVMF6MA/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-26T17:54:35Z","links":{"resolver":"https://pith.science/pith/VMPYQKI3Z4JCZT4FHR4JVMF6MA","bundle":"https://pith.science/pith/VMPYQKI3Z4JCZT4FHR4JVMF6MA/bundle.json","state":"https://pith.science/pith/VMPYQKI3Z4JCZT4FHR4JVMF6MA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMPYQKI3Z4JCZT4FHR4JVMF6MA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VMPYQKI3Z4JCZT4FHR4JVMF6MA","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":"cff625189878cccafed0209328d88b67214011e83bd4e11a7a8a7e58292ecff5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-03-01T17:11:05Z","title_canon_sha256":"24aae810881e11b1102fa06e7e2f3faf10a60d6bd998d5ff95971f86d1b588f9"},"schema_version":"1.0","source":{"id":"1603.00361","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00361","created_at":"2026-05-18T01:05:43Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00361v2","created_at":"2026-05-18T01:05:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00361","created_at":"2026-05-18T01:05:43Z"},{"alias_kind":"pith_short_12","alias_value":"VMPYQKI3Z4JC","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VMPYQKI3Z4JCZT4F","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VMPYQKI3","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:094be8bea2b751569485676d571459b499af9d513c0499c631ef794c161f0910","target":"graph","created_at":"2026-05-18T01:05:43Z","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":"A regular language is $k$-piecewise testable if it is a finite boolean combination of languages of the form $\\Sigma^* a_1 \\Sigma^* \\cdots \\Sigma^* a_n \\Sigma^*$, where $a_i\\in\\Sigma$ and $0\\le n \\le k$. Given a DFA $A$ and $k\\ge 0$, it is an NL-complete problem to decide whether the language $L(A)$ is piecewise testable and, for $k\\ge 4$, it is coNP-complete to decide whether the language $L(A)$ is $k$-piecewise testable. It is known that the depth of the minimal DFA serves as an upper bound on $k$. Namely, if $L(A)$ is piecewise testable, then it is $k$-piecewise testable for $k$ equal to the","authors_text":"Tom\\'a\\v{s} Masopust","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-03-01T17:11:05Z","title":"Piecewise Testable Languages and Nondeterministic Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00361","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:3aa3905619ecca88683806f14ce7f3f9152217207e4a347f938e2321c632c5db","target":"record","created_at":"2026-05-18T01:05:43Z","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":"cff625189878cccafed0209328d88b67214011e83bd4e11a7a8a7e58292ecff5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-03-01T17:11:05Z","title_canon_sha256":"24aae810881e11b1102fa06e7e2f3faf10a60d6bd998d5ff95971f86d1b588f9"},"schema_version":"1.0","source":{"id":"1603.00361","kind":"arxiv","version":2}},"canonical_sha256":"ab1f88291bcf122ccf853c789ab0be601e3ede24f86280a33468f656de577169","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab1f88291bcf122ccf853c789ab0be601e3ede24f86280a33468f656de577169","first_computed_at":"2026-05-18T01:05:43.844002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:43.844002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TWrQ6XO2r+wxOxbi0oQN2N5MG+uFokU13sDyj8YmiUjCTd2RXDQ8KfHVtBW6ANJSUHXn+KT5TsfTkwqWTGVFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:43.844412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.00361","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3aa3905619ecca88683806f14ce7f3f9152217207e4a347f938e2321c632c5db","sha256:094be8bea2b751569485676d571459b499af9d513c0499c631ef794c161f0910"],"state_sha256":"4fa77d5a33c1c5f872de7c9f1b15778a51405209995bb82aef24706a23244fbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XSyptm9Q9uuddA6iaDJt40omhoC3Gw6CdzkHnK3Dy/s5VN2WvM/L16VhnqTHXBNka6DaAUY2Kz5+gZ0tsX/iDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:54:35.353830Z","bundle_sha256":"b551d31b1df79f5b1c6477666579efa26ad0805f0c1d049fcaf5116a29eba330"}}