{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YLJTME6HCCYLIT7HOMIROU7NDZ","short_pith_number":"pith:YLJTME6H","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"},"canonical_sha256":"c2d33613c710b0b44fe773111753ed1e7c9c0dee7f20f9b064ecaafca6ef7da2","source":{"kind":"arxiv","id":"1704.07856","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07856","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07856v2","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07856","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"pith_short_12","alias_value":"YLJTME6HCCYL","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YLJTME6HCCYLIT7H","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YLJTME6H","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YLJTME6HCCYLIT7HOMIROU7NDZ","target":"record","payload":{"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"},"canonical_sha256":"c2d33613c710b0b44fe773111753ed1e7c9c0dee7f20f9b064ecaafca6ef7da2","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"},"source_kind":"arxiv","source_id":"1704.07856","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-18T00:30:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQ4XPNVKjiNXY4737OWWxKHvqaPNezKRmyUfdwsoxtjVTj38Y0jkykBomVkESqNHroDBTt9keeCWuRvcc7ySDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:30:13.993215Z"},"content_sha256":"3c1ba28e3822e24e96bdba249b8a6255b3f76cf3fb320a1f1ac1d47f7f1dc364","schema_version":"1.0","event_id":"sha256:3c1ba28e3822e24e96bdba249b8a6255b3f76cf3fb320a1f1ac1d47f7f1dc364"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YLJTME6HCCYLIT7HOMIROU7NDZ","target":"graph","payload":{"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"},"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-18T00:30:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/iooRz9QYBdxNtbygRgInQKjjD+DuoM6gfDhQnA4nTnhc96zZH43o45HSY2k1NxOTaH5pm9mAlHLwytSdYcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:30:13.993954Z"},"content_sha256":"e99d8929c55496e4b51e3056f26215b6360661a51a1312763e6ada03eaa058c8","schema_version":"1.0","event_id":"sha256:e99d8929c55496e4b51e3056f26215b6360661a51a1312763e6ada03eaa058c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ/bundle.json","state_url":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLJTME6HCCYLIT7HOMIROU7NDZ/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-26T16:30:13Z","links":{"resolver":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ","bundle":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ/bundle.json","state":"https://pith.science/pith/YLJTME6HCCYLIT7HOMIROU7NDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLJTME6HCCYLIT7HOMIROU7NDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YLJTME6HCCYLIT7HOMIROU7NDZ","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":"d6362475f0d5346800067d8a486d867aee68291325f43a6226c3ef0a121c34a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-04-25T18:24:50Z","title_canon_sha256":"7cc54108410c469b725f7eb08059355e2462b9493892e38942153d9da3090f18"},"schema_version":"1.0","source":{"id":"1704.07856","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07856","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07856v2","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07856","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"pith_short_12","alias_value":"YLJTME6HCCYL","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YLJTME6HCCYLIT7H","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YLJTME6H","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:e99d8929c55496e4b51e3056f26215b6360661a51a1312763e6ada03eaa058c8","target":"graph","created_at":"2026-05-18T00:30:22Z","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":"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.","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":"2017-04-25T18:24:50Z","title":"Separability by Piecewise Testable Languages is PTime-Complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07856","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:3c1ba28e3822e24e96bdba249b8a6255b3f76cf3fb320a1f1ac1d47f7f1dc364","target":"record","created_at":"2026-05-18T00:30:22Z","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":"d6362475f0d5346800067d8a486d867aee68291325f43a6226c3ef0a121c34a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-04-25T18:24:50Z","title_canon_sha256":"7cc54108410c469b725f7eb08059355e2462b9493892e38942153d9da3090f18"},"schema_version":"1.0","source":{"id":"1704.07856","kind":"arxiv","version":2}},"canonical_sha256":"c2d33613c710b0b44fe773111753ed1e7c9c0dee7f20f9b064ecaafca6ef7da2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2d33613c710b0b44fe773111753ed1e7c9c0dee7f20f9b064ecaafca6ef7da2","first_computed_at":"2026-05-18T00:30:22.222618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:22.222618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CpEblSsDdQHJmWzUqf63eY0Up7wUhb8YMEMVg7lBKi/S1K+VkZ45znGawkSBxNyt8Vg5q9hy6iFCH3bSXF2HDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:22.223102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07856","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c1ba28e3822e24e96bdba249b8a6255b3f76cf3fb320a1f1ac1d47f7f1dc364","sha256:e99d8929c55496e4b51e3056f26215b6360661a51a1312763e6ada03eaa058c8"],"state_sha256":"7917c525cc53f937f19313877f2eb85d67f31d0aa5d027dbef4a96d0e2f84508"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3jLERYpKOP4wveK/23d5ro0DP6/tq38wbkS3T34ToJ9fOUz38W/ryNtbk1IX0ZOYo3aVr+RWQO/YWPpVwSUlDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:30:13.997868Z","bundle_sha256":"ddf0f628f1f47e639c5b18f439e9082401f066586f8b7aa0223dba0ae8707ed6"}}