{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PVAW6JA2CD7LNJ6PAL2RN3HYO3","short_pith_number":"pith:PVAW6JA2","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"},"canonical_sha256":"7d416f241a10feb6a7cf02f516ecf876e8f3275bea090c958d6472269d35af5e","source":{"kind":"arxiv","id":"1304.6734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6734","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6734v1","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6734","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"pith_short_12","alias_value":"PVAW6JA2CD7L","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PVAW6JA2CD7LNJ6P","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PVAW6JA2","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PVAW6JA2CD7LNJ6PAL2RN3HYO3","target":"record","payload":{"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"},"canonical_sha256":"7d416f241a10feb6a7cf02f516ecf876e8f3275bea090c958d6472269d35af5e","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"},"source_kind":"arxiv","source_id":"1304.6734","source_version":1,"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-18T03:27:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nDiNLpVRCO4JTMCYJc/jPmsU2FrKRXkoX2F38stuFOMXtuqm6a+bqo1sG790nuwvmAnTKnbKMxxNIXs63tFiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:19:16.711190Z"},"content_sha256":"776667be7ccca2a1cc7d4ad781857c28e0857ccb6a564fe14564cdfbccf4c1c8","schema_version":"1.0","event_id":"sha256:776667be7ccca2a1cc7d4ad781857c28e0857ccb6a564fe14564cdfbccf4c1c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PVAW6JA2CD7LNJ6PAL2RN3HYO3","target":"graph","payload":{"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"},"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-18T03:27:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwZnL8lk8qVakARGDxKE1CQX3UYZkkqdRB1Moxcw0wD/yo1RW6GXm6PnYzSsIfFsi4afMx3YodO4ptvEgAsIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:19:16.711852Z"},"content_sha256":"e47858349c7727650c28ff63f63e851367bca0991fee6a695b8061fd0c577ad6","schema_version":"1.0","event_id":"sha256:e47858349c7727650c28ff63f63e851367bca0991fee6a695b8061fd0c577ad6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3/bundle.json","state_url":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3/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-31T12:19:16Z","links":{"resolver":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3","bundle":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3/bundle.json","state":"https://pith.science/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVAW6JA2CD7LNJ6PAL2RN3HYO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PVAW6JA2CD7LNJ6PAL2RN3HYO3","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":"28c21ac150d2173135d521df91f93d1d495965d04f6a704e2d2958f3fe771a35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-24T20:09:39Z","title_canon_sha256":"61fa73be4a9e8632d1eaf7660f7c0ce50561c396ab3b814a38ac250dcbd6c9fc"},"schema_version":"1.0","source":{"id":"1304.6734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6734","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6734v1","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6734","created_at":"2026-05-18T03:27:11Z"},{"alias_kind":"pith_short_12","alias_value":"PVAW6JA2CD7L","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PVAW6JA2CD7LNJ6P","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PVAW6JA2","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:e47858349c7727650c28ff63f63e851367bca0991fee6a695b8061fd0c577ad6","target":"graph","created_at":"2026-05-18T03:27:11Z","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":"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","authors_text":"Lorijn van Rooijen, Marc Zeitoun, Thomas Place","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-24T20:09:39Z","title":"Separating regular languages by piecewise testable and unambiguous languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6734","kind":"arxiv","version":1},"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:776667be7ccca2a1cc7d4ad781857c28e0857ccb6a564fe14564cdfbccf4c1c8","target":"record","created_at":"2026-05-18T03:27:11Z","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":"28c21ac150d2173135d521df91f93d1d495965d04f6a704e2d2958f3fe771a35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-24T20:09:39Z","title_canon_sha256":"61fa73be4a9e8632d1eaf7660f7c0ce50561c396ab3b814a38ac250dcbd6c9fc"},"schema_version":"1.0","source":{"id":"1304.6734","kind":"arxiv","version":1}},"canonical_sha256":"7d416f241a10feb6a7cf02f516ecf876e8f3275bea090c958d6472269d35af5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d416f241a10feb6a7cf02f516ecf876e8f3275bea090c958d6472269d35af5e","first_computed_at":"2026-05-18T03:27:11.985887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:11.985887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nynv1TUEPHvckPG5q1Wri2ps3nqbPpTNHLQJKyVVLfDe7kJYDyhly6QWZimTG/6cLPhmrs1GKVC2Nl3pPDVUAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:11.986513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:776667be7ccca2a1cc7d4ad781857c28e0857ccb6a564fe14564cdfbccf4c1c8","sha256:e47858349c7727650c28ff63f63e851367bca0991fee6a695b8061fd0c577ad6"],"state_sha256":"044da744b379f788069504fb4911419e0fc705978ec3f0b8563d5024f1481ae4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OYAuZc2enTIzEJMNVHA690cIbSHqJ3sLERnyyl3HcIoE3iVfvT3DFkQvwQ5XjtdOj95N0m+l/fJxtyb34VPGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:19:16.715591Z","bundle_sha256":"c73a709108d616cb83483707af0831c63cfc1630fa15d0648cbd7484ec1f2700"}}