{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GSMSWI7QMFH7GF6YUTG5BNIR3C","short_pith_number":"pith:GSMSWI7Q","canonical_record":{"source":{"id":"1501.00569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-03T15:05:29Z","cross_cats_sorted":[],"title_canon_sha256":"44b411e8053e4018f97609608d165aece30df0298672afbceb9c47004d2c202b","abstract_canon_sha256":"6dab3d14774a30b2c20f814fd905b164a9f28475d72025d99ba812d2d5d38b68"},"schema_version":"1.0"},"canonical_sha256":"34992b23f0614ff317d8a4cdd0b511d883bbccbeb3fc909ab087b55d55bb7e85","source":{"kind":"arxiv","id":"1501.00569","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00569","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00569v1","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00569","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"GSMSWI7QMFH7","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GSMSWI7QMFH7GF6Y","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GSMSWI7Q","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GSMSWI7QMFH7GF6YUTG5BNIR3C","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-03T15:05:29Z","cross_cats_sorted":[],"title_canon_sha256":"44b411e8053e4018f97609608d165aece30df0298672afbceb9c47004d2c202b","abstract_canon_sha256":"6dab3d14774a30b2c20f814fd905b164a9f28475d72025d99ba812d2d5d38b68"},"schema_version":"1.0"},"canonical_sha256":"34992b23f0614ff317d8a4cdd0b511d883bbccbeb3fc909ab087b55d55bb7e85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:07.239375Z","signature_b64":"DeXxMSB5BpGvXcMFhp7vsDg+zUQq9cBLL9cUe1DYe2tb2mU8WBWNBxu5N+6H07WiCgb+RSBdjPF+m9N5PTqWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34992b23f0614ff317d8a4cdd0b511d883bbccbeb3fc909ab087b55d55bb7e85","last_reissued_at":"2026-05-18T02:30:07.238789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:07.238789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00569","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-18T02:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IllSGDEwSJq2obNijxW+DHoMTaHtdBuLEPj+NubwxBRhp8zhWd6OOecp3w5JZIRufEvnLQ0rbsDsjm2f011LAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:08:47.072416Z"},"content_sha256":"b5d0ca28c27208ab676ad207c82081c7e0f988542ad1f0f15fc90d6542c76486","schema_version":"1.0","event_id":"sha256:b5d0ca28c27208ab676ad207c82081c7e0f988542ad1f0f15fc90d6542c76486"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GSMSWI7QMFH7GF6YUTG5BNIR3C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Transfer Theorem for the Separation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Marc Zeitoun, Thomas Place","submitted_at":"2015-01-03T15:05:29Z","abstract_excerpt":"We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two regular languages, decides whether there exists a third language in C containing the first language, while being disjoint from the second. These problems are considered as means to obtain a deep understanding of the class C.\n  It is usual for such classes to be defined by logical formalisms. Logics are often built on top of each other, by adding new predicates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00569","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-18T02:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X1M3U6HTr6lqRw5I6E8mvRaekDP8q0T/RbK6UfKgglrHqyAFsHkECsU853ePPZC3Hl4SxeMYCvd3FKdg1Ba5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:08:47.072770Z"},"content_sha256":"afd85e56e848113b6f9629741980ff25776ea0be2ed862cd3c7a42d13178c170","schema_version":"1.0","event_id":"sha256:afd85e56e848113b6f9629741980ff25776ea0be2ed862cd3c7a42d13178c170"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSMSWI7QMFH7GF6YUTG5BNIR3C/bundle.json","state_url":"https://pith.science/pith/GSMSWI7QMFH7GF6YUTG5BNIR3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSMSWI7QMFH7GF6YUTG5BNIR3C/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-31T02:08:47Z","links":{"resolver":"https://pith.science/pith/GSMSWI7QMFH7GF6YUTG5BNIR3C","bundle":"https://pith.science/pith/GSMSWI7QMFH7GF6YUTG5BNIR3C/bundle.json","state":"https://pith.science/pith/GSMSWI7QMFH7GF6YUTG5BNIR3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSMSWI7QMFH7GF6YUTG5BNIR3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GSMSWI7QMFH7GF6YUTG5BNIR3C","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":"6dab3d14774a30b2c20f814fd905b164a9f28475d72025d99ba812d2d5d38b68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-03T15:05:29Z","title_canon_sha256":"44b411e8053e4018f97609608d165aece30df0298672afbceb9c47004d2c202b"},"schema_version":"1.0","source":{"id":"1501.00569","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00569","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00569v1","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00569","created_at":"2026-05-18T02:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"GSMSWI7QMFH7","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GSMSWI7QMFH7GF6Y","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GSMSWI7Q","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:afd85e56e848113b6f9629741980ff25776ea0be2ed862cd3c7a42d13178c170","target":"graph","created_at":"2026-05-18T02:30:07Z","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":"We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two regular languages, decides whether there exists a third language in C containing the first language, while being disjoint from the second. These problems are considered as means to obtain a deep understanding of the class C.\n  It is usual for such classes to be defined by logical formalisms. Logics are often built on top of each other, by adding new predicates","authors_text":"Marc Zeitoun, Thomas Place","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-03T15:05:29Z","title":"A Transfer Theorem for the Separation Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00569","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:b5d0ca28c27208ab676ad207c82081c7e0f988542ad1f0f15fc90d6542c76486","target":"record","created_at":"2026-05-18T02:30:07Z","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":"6dab3d14774a30b2c20f814fd905b164a9f28475d72025d99ba812d2d5d38b68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-01-03T15:05:29Z","title_canon_sha256":"44b411e8053e4018f97609608d165aece30df0298672afbceb9c47004d2c202b"},"schema_version":"1.0","source":{"id":"1501.00569","kind":"arxiv","version":1}},"canonical_sha256":"34992b23f0614ff317d8a4cdd0b511d883bbccbeb3fc909ab087b55d55bb7e85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34992b23f0614ff317d8a4cdd0b511d883bbccbeb3fc909ab087b55d55bb7e85","first_computed_at":"2026-05-18T02:30:07.238789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:07.238789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DeXxMSB5BpGvXcMFhp7vsDg+zUQq9cBLL9cUe1DYe2tb2mU8WBWNBxu5N+6H07WiCgb+RSBdjPF+m9N5PTqWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:07.239375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00569","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5d0ca28c27208ab676ad207c82081c7e0f988542ad1f0f15fc90d6542c76486","sha256:afd85e56e848113b6f9629741980ff25776ea0be2ed862cd3c7a42d13178c170"],"state_sha256":"a1ad5b2f9be23195a7c5d5c1bf30dc04a6a931d88f1f13f04b88bcd365c32cd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2v4yc1wcb3eu7jyDAFKSr/NopMk0fFMI9nvIO1z2+L7Ncog4KjpgftD8967JXusV6ONvlQzu1330t+MB23DmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:08:47.074876Z","bundle_sha256":"e0c610bac4426e88f92d3d7c7710a75090e26bc6f6f5d83208814d6c7f49b38c"}}