{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HGG2KA756Q7GKMYXESXW663USR","short_pith_number":"pith:HGG2KA75","canonical_record":{"source":{"id":"1303.2143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-03-08T23:01:05Z","cross_cats_sorted":[],"title_canon_sha256":"2ed86931b9dbf4b0882fbecc96183f77610dd0db5c6a017eebc89d1e53748e4c","abstract_canon_sha256":"4ec89ddf6e55b47ec17b9dd1e3bfb758852686046b31f2a608ef6e2363ca3449"},"schema_version":"1.0"},"canonical_sha256":"398da503fdf43e65331724af6f7b74945aa0ae43437328a3c7d0448d9a46226d","source":{"kind":"arxiv","id":"1303.2143","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2143","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2143v1","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2143","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"HGG2KA756Q7G","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HGG2KA756Q7GKMYX","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HGG2KA75","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HGG2KA756Q7GKMYXESXW663USR","target":"record","payload":{"canonical_record":{"source":{"id":"1303.2143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-03-08T23:01:05Z","cross_cats_sorted":[],"title_canon_sha256":"2ed86931b9dbf4b0882fbecc96183f77610dd0db5c6a017eebc89d1e53748e4c","abstract_canon_sha256":"4ec89ddf6e55b47ec17b9dd1e3bfb758852686046b31f2a608ef6e2363ca3449"},"schema_version":"1.0"},"canonical_sha256":"398da503fdf43e65331724af6f7b74945aa0ae43437328a3c7d0448d9a46226d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:19.944310Z","signature_b64":"yb6rjTnfGr7xm53ai1OcsQ0C0B8H5cOYdBFAfbnI6xJPLaiAlBWgVtjLp02uPT6QoxVaJ2KjDTPvfh4giA21CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"398da503fdf43e65331724af6f7b74945aa0ae43437328a3c7d0448d9a46226d","last_reissued_at":"2026-05-18T03:31:19.943573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:19.943573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.2143","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:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMnGAKCXJ4VsS1BtwlW7f3WKzMDOmEtp+ctyl1ysBrsVo1Jl0Pg+w0WWuqpxdEf8z/iT8uTTjJarZD5OHDPZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:18:46.566713Z"},"content_sha256":"30e0a6c01581a065ac8afca47f62d2e114ef9699c2ba03023cb685e8167889c7","schema_version":"1.0","event_id":"sha256:30e0a6c01581a065ac8afca47f62d2e114ef9699c2ba03023cb685e8167889c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HGG2KA756Q7GKMYXESXW663USR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The separation problem for regular languages by piecewise testable languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Lorijn van Rooijen, Marc Zeitoun","submitted_at":"2013-03-08T23:01:05Z","abstract_excerpt":"Separation is a classical problem in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class. We present and discuss the separation problem for regular languages. We then give a direct polynomial time 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 indeed disjoint. The proof is a reformulation and a refinement of an algebraic argument already given by Almeida and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2143","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:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oct8sr4OFuy002x/43LSdUvZGGpZ/daNdZBmXmArq7fscd7mNhNGEfu4EH6zsWHVq0xiGdqk2QG0jWBZbn1oCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:18:46.567215Z"},"content_sha256":"ea94442aef729fc6176fa0b11c3caa591df67f75d4055076729655330e9bc0aa","schema_version":"1.0","event_id":"sha256:ea94442aef729fc6176fa0b11c3caa591df67f75d4055076729655330e9bc0aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGG2KA756Q7GKMYXESXW663USR/bundle.json","state_url":"https://pith.science/pith/HGG2KA756Q7GKMYXESXW663USR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGG2KA756Q7GKMYXESXW663USR/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-31T17:18:46Z","links":{"resolver":"https://pith.science/pith/HGG2KA756Q7GKMYXESXW663USR","bundle":"https://pith.science/pith/HGG2KA756Q7GKMYXESXW663USR/bundle.json","state":"https://pith.science/pith/HGG2KA756Q7GKMYXESXW663USR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGG2KA756Q7GKMYXESXW663USR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HGG2KA756Q7GKMYXESXW663USR","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":"4ec89ddf6e55b47ec17b9dd1e3bfb758852686046b31f2a608ef6e2363ca3449","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-03-08T23:01:05Z","title_canon_sha256":"2ed86931b9dbf4b0882fbecc96183f77610dd0db5c6a017eebc89d1e53748e4c"},"schema_version":"1.0","source":{"id":"1303.2143","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2143","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2143v1","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2143","created_at":"2026-05-18T03:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"HGG2KA756Q7G","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HGG2KA756Q7GKMYX","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HGG2KA75","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:ea94442aef729fc6176fa0b11c3caa591df67f75d4055076729655330e9bc0aa","target":"graph","created_at":"2026-05-18T03:31:19Z","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 in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class. We present and discuss the separation problem for regular languages. We then give a direct polynomial time 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 indeed disjoint. The proof is a reformulation and a refinement of an algebraic argument already given by Almeida and","authors_text":"Lorijn van Rooijen, Marc Zeitoun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-03-08T23:01:05Z","title":"The separation problem for regular languages by piecewise testable languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2143","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:30e0a6c01581a065ac8afca47f62d2e114ef9699c2ba03023cb685e8167889c7","target":"record","created_at":"2026-05-18T03:31:19Z","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":"4ec89ddf6e55b47ec17b9dd1e3bfb758852686046b31f2a608ef6e2363ca3449","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-03-08T23:01:05Z","title_canon_sha256":"2ed86931b9dbf4b0882fbecc96183f77610dd0db5c6a017eebc89d1e53748e4c"},"schema_version":"1.0","source":{"id":"1303.2143","kind":"arxiv","version":1}},"canonical_sha256":"398da503fdf43e65331724af6f7b74945aa0ae43437328a3c7d0448d9a46226d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"398da503fdf43e65331724af6f7b74945aa0ae43437328a3c7d0448d9a46226d","first_computed_at":"2026-05-18T03:31:19.943573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:19.943573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yb6rjTnfGr7xm53ai1OcsQ0C0B8H5cOYdBFAfbnI6xJPLaiAlBWgVtjLp02uPT6QoxVaJ2KjDTPvfh4giA21CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:19.944310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2143","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30e0a6c01581a065ac8afca47f62d2e114ef9699c2ba03023cb685e8167889c7","sha256:ea94442aef729fc6176fa0b11c3caa591df67f75d4055076729655330e9bc0aa"],"state_sha256":"bad8ab0ac6243c5797a2c7c669ca29a4aa3508096e16f3d8594664c90ca02e34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/RhbpLwGwbMrS4/kxam5j8YcIyy9IlTKwazRwk3og2GWBWM3v7oCXkbjY0/3K72jYWZG/ZI9/SL2hG0CAGBOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:18:46.570219Z","bundle_sha256":"4af137ec8f470d60609c947b5ecdf55ff8108c8ce0c132189f35eccb4b3c56f4"}}