{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3ZNXEOD6Z34GBWM6MBVDEUHUU4","short_pith_number":"pith:3ZNXEOD6","canonical_record":{"source":{"id":"1308.0181","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-08-01T12:52:18Z","cross_cats_sorted":[],"title_canon_sha256":"ef65b6033a4577b2a679fb2291b6980efbbf1bdde9a8d59b1137044de34804af","abstract_canon_sha256":"28abfe4cc6f2e8136a4da75de0b71c1c3e5cfec95ef432a3a601e7b569b0d4b4"},"schema_version":"1.0"},"canonical_sha256":"de5b72387ecef860d99e606a3250f4a7216bfe555c5b50f9e744d87fad29c4ff","source":{"kind":"arxiv","id":"1308.0181","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0181","created_at":"2026-05-18T01:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0181v4","created_at":"2026-05-18T01:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0181","created_at":"2026-05-18T01:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"3ZNXEOD6Z34G","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3ZNXEOD6Z34GBWM6","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3ZNXEOD6","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3ZNXEOD6Z34GBWM6MBVDEUHUU4","target":"record","payload":{"canonical_record":{"source":{"id":"1308.0181","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-08-01T12:52:18Z","cross_cats_sorted":[],"title_canon_sha256":"ef65b6033a4577b2a679fb2291b6980efbbf1bdde9a8d59b1137044de34804af","abstract_canon_sha256":"28abfe4cc6f2e8136a4da75de0b71c1c3e5cfec95ef432a3a601e7b569b0d4b4"},"schema_version":"1.0"},"canonical_sha256":"de5b72387ecef860d99e606a3250f4a7216bfe555c5b50f9e744d87fad29c4ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:37.968067Z","signature_b64":"Xt79j9ymlx0VWD99alf0DPEaOp9XySTT+eMfaUyRe/YWLTV06TsZ+9XUPCCTpn3GmjEdA6HOj67QW2JhuOHECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de5b72387ecef860d99e606a3250f4a7216bfe555c5b50f9e744d87fad29c4ff","last_reissued_at":"2026-05-18T01:37:37.967628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:37.967628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.0181","source_version":4,"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-18T01:37:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xjm8cAX/0yCx42gW43RYpGgFsSZtixflPsVQSAuPKFQ3Aqa6h32pALoR23O9I8VN70royL2wTYxlNNzvB87LBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:16:33.757246Z"},"content_sha256":"48fabc6e95fbd30121cde4cde710a67bad5370a5e28259d5eb517ce756d4403c","schema_version":"1.0","event_id":"sha256:48fabc6e95fbd30121cde4cde710a67bad5370a5e28259d5eb517ce756d4403c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3ZNXEOD6Z34GBWM6MBVDEUHUU4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Separation by Locally Testable and Locally Threshold Testable Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"France), Lorijn van Rooijen (University Bordeaux, Marc Zeitoun (University Bordeaux, Thomas Place (University Bordeaux","submitted_at":"2013-08-01T12:52:18Z","abstract_excerpt":"A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally threshold testable) separator. In both cases, we design a decision procedure based on the occurrence of special patterns in automata accepting the input languages. We prove that the problem is computationally harder than deciding membership. The correctness proof of the algorithm yields a stronger result, namely a description of a possible sep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0181","kind":"arxiv","version":4},"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-18T01:37:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84SAH3jEer0Xh4FJia+Q4yjleMnWCruZxIwLUApjlWB0DjCQhFxaNdEF3zGYDFVanvDajVt9Sbb1lKdXkYEyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:16:33.758006Z"},"content_sha256":"5d2e241cc1efbb1e445b4813d33e36dbb07af53645d9f60114f6dbeac47152c5","schema_version":"1.0","event_id":"sha256:5d2e241cc1efbb1e445b4813d33e36dbb07af53645d9f60114f6dbeac47152c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZNXEOD6Z34GBWM6MBVDEUHUU4/bundle.json","state_url":"https://pith.science/pith/3ZNXEOD6Z34GBWM6MBVDEUHUU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZNXEOD6Z34GBWM6MBVDEUHUU4/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-06-10T12:16:33Z","links":{"resolver":"https://pith.science/pith/3ZNXEOD6Z34GBWM6MBVDEUHUU4","bundle":"https://pith.science/pith/3ZNXEOD6Z34GBWM6MBVDEUHUU4/bundle.json","state":"https://pith.science/pith/3ZNXEOD6Z34GBWM6MBVDEUHUU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZNXEOD6Z34GBWM6MBVDEUHUU4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3ZNXEOD6Z34GBWM6MBVDEUHUU4","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":"28abfe4cc6f2e8136a4da75de0b71c1c3e5cfec95ef432a3a601e7b569b0d4b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-08-01T12:52:18Z","title_canon_sha256":"ef65b6033a4577b2a679fb2291b6980efbbf1bdde9a8d59b1137044de34804af"},"schema_version":"1.0","source":{"id":"1308.0181","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0181","created_at":"2026-05-18T01:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0181v4","created_at":"2026-05-18T01:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0181","created_at":"2026-05-18T01:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"3ZNXEOD6Z34G","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3ZNXEOD6Z34GBWM6","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3ZNXEOD6","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:5d2e241cc1efbb1e445b4813d33e36dbb07af53645d9f60114f6dbeac47152c5","target":"graph","created_at":"2026-05-18T01:37:37Z","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":"A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally threshold testable) separator. In both cases, we design a decision procedure based on the occurrence of special patterns in automata accepting the input languages. We prove that the problem is computationally harder than deciding membership. The correctness proof of the algorithm yields a stronger result, namely a description of a possible sep","authors_text":"France), Lorijn van Rooijen (University Bordeaux, Marc Zeitoun (University Bordeaux, Thomas Place (University Bordeaux","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-08-01T12:52:18Z","title":"On Separation by Locally Testable and Locally Threshold Testable Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0181","kind":"arxiv","version":4},"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:48fabc6e95fbd30121cde4cde710a67bad5370a5e28259d5eb517ce756d4403c","target":"record","created_at":"2026-05-18T01:37:37Z","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":"28abfe4cc6f2e8136a4da75de0b71c1c3e5cfec95ef432a3a601e7b569b0d4b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-08-01T12:52:18Z","title_canon_sha256":"ef65b6033a4577b2a679fb2291b6980efbbf1bdde9a8d59b1137044de34804af"},"schema_version":"1.0","source":{"id":"1308.0181","kind":"arxiv","version":4}},"canonical_sha256":"de5b72387ecef860d99e606a3250f4a7216bfe555c5b50f9e744d87fad29c4ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de5b72387ecef860d99e606a3250f4a7216bfe555c5b50f9e744d87fad29c4ff","first_computed_at":"2026-05-18T01:37:37.967628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:37.967628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xt79j9ymlx0VWD99alf0DPEaOp9XySTT+eMfaUyRe/YWLTV06TsZ+9XUPCCTpn3GmjEdA6HOj67QW2JhuOHECg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:37.968067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0181","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48fabc6e95fbd30121cde4cde710a67bad5370a5e28259d5eb517ce756d4403c","sha256:5d2e241cc1efbb1e445b4813d33e36dbb07af53645d9f60114f6dbeac47152c5"],"state_sha256":"1e3755a66cd9c6051465609a815fbfe63382b3667ce7eafa7fe002b8e6d49408"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4CHot2jeLMUrPhfAgd7DGkpTx+oBbgw8eXoJwgQyy3pDXAhb7s79x4DmdGf/YAWbrPOaB/zfJ5qQDilzTflkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:16:33.761527Z","bundle_sha256":"693178df6666e55cd6791018afd92f0e228666637d8dedf9bf6dbc484692125d"}}