{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:M7SHWDTYZJ2XWXJBZPMPTAEIIX","short_pith_number":"pith:M7SHWDTY","canonical_record":{"source":{"id":"1407.0160","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-07-01T09:39:33Z","cross_cats_sorted":[],"title_canon_sha256":"7ab2e66561a715b3c4227aac39cc387c709195f9eddb259cdadf944ae496cd86","abstract_canon_sha256":"1775e4df4ed361e99329575b5630c4d3544c8fb4a5668700397d6010b8520b17"},"schema_version":"1.0"},"canonical_sha256":"67e47b0e78ca757b5d21cbd8f9808845e5a648c766877e17a6cf8c0cada8683f","source":{"kind":"arxiv","id":"1407.0160","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0160","created_at":"2026-05-18T02:31:38Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0160v3","created_at":"2026-05-18T02:31:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0160","created_at":"2026-05-18T02:31:38Z"},{"alias_kind":"pith_short_12","alias_value":"M7SHWDTYZJ2X","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M7SHWDTYZJ2XWXJB","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M7SHWDTY","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:M7SHWDTYZJ2XWXJBZPMPTAEIIX","target":"record","payload":{"canonical_record":{"source":{"id":"1407.0160","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-07-01T09:39:33Z","cross_cats_sorted":[],"title_canon_sha256":"7ab2e66561a715b3c4227aac39cc387c709195f9eddb259cdadf944ae496cd86","abstract_canon_sha256":"1775e4df4ed361e99329575b5630c4d3544c8fb4a5668700397d6010b8520b17"},"schema_version":"1.0"},"canonical_sha256":"67e47b0e78ca757b5d21cbd8f9808845e5a648c766877e17a6cf8c0cada8683f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:38.055236Z","signature_b64":"dSiy490EgSMUS57KejRZ1jZWlqwqkreuRHBTPoqS4H92rcXqmm5CXYBdMuclVjuKZ4teHhRMUALi3se5Kx2VAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67e47b0e78ca757b5d21cbd8f9808845e5a648c766877e17a6cf8c0cada8683f","last_reissued_at":"2026-05-18T02:31:38.054642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:38.054642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.0160","source_version":3,"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:31:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qp07LI6V2prFxBm35PuMHiXv2pbQJVsqpLFMkn5tBkfBVwUBcHsBazDVNIPdiJ9CB+/jm1KrQ0kdXWQKj5dBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:19:05.061305Z"},"content_sha256":"35867f69e393c7ee7dd97295cdb07f212a2cce9112ea405740e447b0c67894b4","schema_version":"1.0","event_id":"sha256:35867f69e393c7ee7dd97295cdb07f212a2cce9112ea405740e447b0c67894b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:M7SHWDTYZJ2XWXJBZPMPTAEIIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distinguishability Operations and Closures on Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Cezar C\\^ampeanu, Nelma Moreira, Rog\\'erio Reis","submitted_at":"2014-07-01T09:39:33Z","abstract_excerpt":"Given a regular language $L$, we study the language of words $\\mathsf{D}(L)$, that distinguish between pairs of different left-quotients of $L$. We characterize this distinguishability operation, show that its iteration has always a fixed point, and we generalize this result to operations derived from closure operators and Boolean operators. We give an upper bound for the state complexity of the distinguishability operation, and prove its tightness. We show that the set of minimal words that can be used to distinguish between different left-quotients of a language $L$ has at most $n-1$ element"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0160","kind":"arxiv","version":3},"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:31:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVcoa8twotqB8pb6/t3jpDLhKXoPZnAvz7UjR9IJVk3iPLgB0taa2M04/Kdcr9BUj+wg3uzFnHmSYT7BOSHxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:19:05.061962Z"},"content_sha256":"7008a72855c3eb4e85fdc46f7562ce58d48ab6acb0c1627c53252f4f44d3a7f7","schema_version":"1.0","event_id":"sha256:7008a72855c3eb4e85fdc46f7562ce58d48ab6acb0c1627c53252f4f44d3a7f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7SHWDTYZJ2XWXJBZPMPTAEIIX/bundle.json","state_url":"https://pith.science/pith/M7SHWDTYZJ2XWXJBZPMPTAEIIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7SHWDTYZJ2XWXJBZPMPTAEIIX/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-30T09:19:05Z","links":{"resolver":"https://pith.science/pith/M7SHWDTYZJ2XWXJBZPMPTAEIIX","bundle":"https://pith.science/pith/M7SHWDTYZJ2XWXJBZPMPTAEIIX/bundle.json","state":"https://pith.science/pith/M7SHWDTYZJ2XWXJBZPMPTAEIIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7SHWDTYZJ2XWXJBZPMPTAEIIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:M7SHWDTYZJ2XWXJBZPMPTAEIIX","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":"1775e4df4ed361e99329575b5630c4d3544c8fb4a5668700397d6010b8520b17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-07-01T09:39:33Z","title_canon_sha256":"7ab2e66561a715b3c4227aac39cc387c709195f9eddb259cdadf944ae496cd86"},"schema_version":"1.0","source":{"id":"1407.0160","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0160","created_at":"2026-05-18T02:31:38Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0160v3","created_at":"2026-05-18T02:31:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0160","created_at":"2026-05-18T02:31:38Z"},{"alias_kind":"pith_short_12","alias_value":"M7SHWDTYZJ2X","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M7SHWDTYZJ2XWXJB","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M7SHWDTY","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:7008a72855c3eb4e85fdc46f7562ce58d48ab6acb0c1627c53252f4f44d3a7f7","target":"graph","created_at":"2026-05-18T02:31:38Z","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":"Given a regular language $L$, we study the language of words $\\mathsf{D}(L)$, that distinguish between pairs of different left-quotients of $L$. We characterize this distinguishability operation, show that its iteration has always a fixed point, and we generalize this result to operations derived from closure operators and Boolean operators. We give an upper bound for the state complexity of the distinguishability operation, and prove its tightness. We show that the set of minimal words that can be used to distinguish between different left-quotients of a language $L$ has at most $n-1$ element","authors_text":"Cezar C\\^ampeanu, Nelma Moreira, Rog\\'erio Reis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-07-01T09:39:33Z","title":"Distinguishability Operations and Closures on Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0160","kind":"arxiv","version":3},"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:35867f69e393c7ee7dd97295cdb07f212a2cce9112ea405740e447b0c67894b4","target":"record","created_at":"2026-05-18T02:31:38Z","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":"1775e4df4ed361e99329575b5630c4d3544c8fb4a5668700397d6010b8520b17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-07-01T09:39:33Z","title_canon_sha256":"7ab2e66561a715b3c4227aac39cc387c709195f9eddb259cdadf944ae496cd86"},"schema_version":"1.0","source":{"id":"1407.0160","kind":"arxiv","version":3}},"canonical_sha256":"67e47b0e78ca757b5d21cbd8f9808845e5a648c766877e17a6cf8c0cada8683f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67e47b0e78ca757b5d21cbd8f9808845e5a648c766877e17a6cf8c0cada8683f","first_computed_at":"2026-05-18T02:31:38.054642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:38.054642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dSiy490EgSMUS57KejRZ1jZWlqwqkreuRHBTPoqS4H92rcXqmm5CXYBdMuclVjuKZ4teHhRMUALi3se5Kx2VAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:38.055236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0160","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35867f69e393c7ee7dd97295cdb07f212a2cce9112ea405740e447b0c67894b4","sha256:7008a72855c3eb4e85fdc46f7562ce58d48ab6acb0c1627c53252f4f44d3a7f7"],"state_sha256":"29e21887642549b0eb3cec9b8635e44bc0c884f4a6521454db9f7006231b480e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3feQ07npwHnxQupvyx+8Z7AC8PuRKwuJA4cNnAutOX/6CDXZje1feP5zCfMI/aLckwU0lprA8alryLzuuXvoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:19:05.064858Z","bundle_sha256":"26f4c08db3531c01e2ad90d0f62163aeb2479b40e194fd35d55fa0be8c74d1e8"}}