{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PVAW6JA2CD7LNJ6PAL2RN3HYO3","short_pith_number":"pith:PVAW6JA2","schema_version":"1.0","canonical_sha256":"7d416f241a10feb6a7cf02f516ecf876e8f3275bea090c958d6472269d35af5e","source":{"kind":"arxiv","id":"1304.6734","version":1},"attestation_state":"computed","paper":{"title":"Separating regular languages by piecewise testable and unambiguous languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Lorijn van Rooijen, Marc Zeitoun, Thomas Place","submitted_at":"2013-04-24T20:09:39Z","abstract_excerpt":"Separation is a classical problem asking whether, given two sets belonging to some class, it is possible to separate them by a set from a smaller class. We discuss the separation problem for regular languages. We give a Ptime algorithm to check whether two given regular languages are separable by a piecewise testable language, that is, whether a $B{\\Sigma}1(<)$ sentence can witness that the languages are disjoint. The proof refines an algebraic argument from Almeida and the third author. When separation is possible, we also express a separator by saturating one of the original languages by a s"},"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":"1304.6734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-24T20:09:39Z","cross_cats_sorted":[],"title_canon_sha256":"61fa73be4a9e8632d1eaf7660f7c0ce50561c396ab3b814a38ac250dcbd6c9fc","abstract_canon_sha256":"28c21ac150d2173135d521df91f93d1d495965d04f6a704e2d2958f3fe771a35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:11.986513Z","signature_b64":"nynv1TUEPHvckPG5q1Wri2ps3nqbPpTNHLQJKyVVLfDe7kJYDyhly6QWZimTG/6cLPhmrs1GKVC2Nl3pPDVUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d416f241a10feb6a7cf02f516ecf876e8f3275bea090c958d6472269d35af5e","last_reissued_at":"2026-05-18T03:27:11.985887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:11.985887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separating regular languages by piecewise testable and unambiguous languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Lorijn van Rooijen, Marc Zeitoun, Thomas Place","submitted_at":"2013-04-24T20:09:39Z","abstract_excerpt":"Separation is a classical problem asking whether, given two sets belonging to some class, it is possible to separate them by a set from a smaller class. We discuss the separation problem for regular languages. We give a Ptime algorithm to check whether two given regular languages are separable by a piecewise testable language, that is, whether a $B{\\Sigma}1(<)$ sentence can witness that the languages are disjoint. The proof refines an algebraic argument from Almeida and the third author. When separation is possible, we also express a separator by saturating one of the original languages by a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6734","kind":"arxiv","version":1},"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":"1304.6734","created_at":"2026-05-18T03:27:11.985980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6734v1","created_at":"2026-05-18T03:27:11.985980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6734","created_at":"2026-05-18T03:27:11.985980+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVAW6JA2CD7L","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVAW6JA2CD7LNJ6P","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVAW6JA2","created_at":"2026-05-18T12:27:57.521954+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/PVAW6JA2CD7LNJ6PAL2RN3HYO3","json":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3.json","graph_json":"https://pith.science/api/pith-number/PVAW6JA2CD7LNJ6PAL2RN3HYO3/graph.json","events_json":"https://pith.science/api/pith-number/PVAW6JA2CD7LNJ6PAL2RN3HYO3/events.json","paper":"https://pith.science/paper/PVAW6JA2"},"agent_actions":{"view_html":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3","download_json":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3.json","view_paper":"https://pith.science/paper/PVAW6JA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6734&json=true","fetch_graph":"https://pith.science/api/pith-number/PVAW6JA2CD7LNJ6PAL2RN3HYO3/graph.json","fetch_events":"https://pith.science/api/pith-number/PVAW6JA2CD7LNJ6PAL2RN3HYO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3/action/storage_attestation","attest_author":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3/action/author_attestation","sign_citation":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3/action/citation_signature","submit_replication":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3/action/replication_record"}},"created_at":"2026-05-18T03:27:11.985980+00:00","updated_at":"2026-05-18T03:27:11.985980+00:00"}