{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PSFXE6VFOE3R35NROBAQ2V544W","short_pith_number":"pith:PSFXE6VF","canonical_record":{"source":{"id":"1509.06215","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-21T13:15:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c575aa7a3cdab82d33a68137706f3009a4f3b7aa91ea15b2da0b3afc37fd342d","abstract_canon_sha256":"cf0ab469ef79031d4071f744f728a155dee3166aab4051fe26d2836f95526840"},"schema_version":"1.0"},"canonical_sha256":"7c8b727aa571371df5b170410d57bce5b9cb479baf4241e958d061c2afdd4059","source":{"kind":"arxiv","id":"1509.06215","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06215","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06215v2","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06215","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"PSFXE6VFOE3R","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSFXE6VFOE3R35NR","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSFXE6VF","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PSFXE6VFOE3R35NROBAQ2V544W","target":"record","payload":{"canonical_record":{"source":{"id":"1509.06215","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-21T13:15:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c575aa7a3cdab82d33a68137706f3009a4f3b7aa91ea15b2da0b3afc37fd342d","abstract_canon_sha256":"cf0ab469ef79031d4071f744f728a155dee3166aab4051fe26d2836f95526840"},"schema_version":"1.0"},"canonical_sha256":"7c8b727aa571371df5b170410d57bce5b9cb479baf4241e958d061c2afdd4059","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:31.194054Z","signature_b64":"8h0hDybdHfLzJD03DLA3TVK46R3B6TWMMZ/FC7GuXLtDBHm6upNOrFOdWnsOvKn0181+AoKXLoPDA7L6sCiRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c8b727aa571371df5b170410d57bce5b9cb479baf4241e958d061c2afdd4059","last_reissued_at":"2026-05-18T01:27:31.193410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:31.193410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.06215","source_version":2,"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:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YDRZTdBuKnzJ5BV/UyZRAfv3AMCaeXxgQYaCcvou5VPAYNFJTO+VHo0aGx8BNXaSx7JDXtJLjmbkJkeYIxs/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:10:05.267973Z"},"content_sha256":"68306f752b24898db97232ea9048426bc732ecf645d28db191d92d5a7af98ee8","schema_version":"1.0","event_id":"sha256:68306f752b24898db97232ea9048426bc732ecf645d28db191d92d5a7af98ee8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PSFXE6VFOE3R35NROBAQ2V544W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Morphisms over Omega-Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Lukas Fleischer, Manfred Kufleitner","submitted_at":"2015-09-21T13:15:41Z","abstract_excerpt":"Morphisms to finite semigroups can be used for recognizing omega-regular languages. The so-called strongly recognizing morphisms can be seen as a deterministic computation model which provides minimal objects (known as the syntactic morphism) and a trivial complementation procedure. We give a quadratic-time algorithm for computing the syntactic morphism from any given strongly recognizing morphism, thereby showing that minimization is easy as well. In addition, we give algorithms for efficiently solving various decision problems for weakly recognizing morphisms. Weakly recognizing morphism are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06215","kind":"arxiv","version":2},"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:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCYDcr5tXPVAKV8ZkFybRUkoHQy2w/1yNYWkkTn19w0aZMYAuDaYZ8LdAcLt4Wlzh6mpaDuPuKXVmbbEtiV9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:10:05.268511Z"},"content_sha256":"df92186af644dfe1e8e0b21cacc3920e0021c07ec08003c15c4ab64a2e2e3b0c","schema_version":"1.0","event_id":"sha256:df92186af644dfe1e8e0b21cacc3920e0021c07ec08003c15c4ab64a2e2e3b0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSFXE6VFOE3R35NROBAQ2V544W/bundle.json","state_url":"https://pith.science/pith/PSFXE6VFOE3R35NROBAQ2V544W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSFXE6VFOE3R35NROBAQ2V544W/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-01T21:10:05Z","links":{"resolver":"https://pith.science/pith/PSFXE6VFOE3R35NROBAQ2V544W","bundle":"https://pith.science/pith/PSFXE6VFOE3R35NROBAQ2V544W/bundle.json","state":"https://pith.science/pith/PSFXE6VFOE3R35NROBAQ2V544W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSFXE6VFOE3R35NROBAQ2V544W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PSFXE6VFOE3R35NROBAQ2V544W","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":"cf0ab469ef79031d4071f744f728a155dee3166aab4051fe26d2836f95526840","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-21T13:15:41Z","title_canon_sha256":"c575aa7a3cdab82d33a68137706f3009a4f3b7aa91ea15b2da0b3afc37fd342d"},"schema_version":"1.0","source":{"id":"1509.06215","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06215","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06215v2","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06215","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"PSFXE6VFOE3R","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSFXE6VFOE3R35NR","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSFXE6VF","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:df92186af644dfe1e8e0b21cacc3920e0021c07ec08003c15c4ab64a2e2e3b0c","target":"graph","created_at":"2026-05-18T01:27:31Z","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":"Morphisms to finite semigroups can be used for recognizing omega-regular languages. The so-called strongly recognizing morphisms can be seen as a deterministic computation model which provides minimal objects (known as the syntactic morphism) and a trivial complementation procedure. We give a quadratic-time algorithm for computing the syntactic morphism from any given strongly recognizing morphism, thereby showing that minimization is easy as well. In addition, we give algorithms for efficiently solving various decision problems for weakly recognizing morphisms. Weakly recognizing morphism are","authors_text":"Lukas Fleischer, Manfred Kufleitner","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-21T13:15:41Z","title":"Efficient Algorithms for Morphisms over Omega-Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06215","kind":"arxiv","version":2},"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:68306f752b24898db97232ea9048426bc732ecf645d28db191d92d5a7af98ee8","target":"record","created_at":"2026-05-18T01:27:31Z","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":"cf0ab469ef79031d4071f744f728a155dee3166aab4051fe26d2836f95526840","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-21T13:15:41Z","title_canon_sha256":"c575aa7a3cdab82d33a68137706f3009a4f3b7aa91ea15b2da0b3afc37fd342d"},"schema_version":"1.0","source":{"id":"1509.06215","kind":"arxiv","version":2}},"canonical_sha256":"7c8b727aa571371df5b170410d57bce5b9cb479baf4241e958d061c2afdd4059","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c8b727aa571371df5b170410d57bce5b9cb479baf4241e958d061c2afdd4059","first_computed_at":"2026-05-18T01:27:31.193410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:31.193410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8h0hDybdHfLzJD03DLA3TVK46R3B6TWMMZ/FC7GuXLtDBHm6upNOrFOdWnsOvKn0181+AoKXLoPDA7L6sCiRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:31.194054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06215","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68306f752b24898db97232ea9048426bc732ecf645d28db191d92d5a7af98ee8","sha256:df92186af644dfe1e8e0b21cacc3920e0021c07ec08003c15c4ab64a2e2e3b0c"],"state_sha256":"2c5299fe0b834f559ef8bce74f302f3866227b82b617f869841d9b53e7fda3b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c66n1tcRMJOh4LEv9mY/XruOVwIl1W0Lu7QcC7JNYjaKzuPHEdNWFqTD+y0c8r194v448lZDQ4LJH+3MjHpZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:10:05.270516Z","bundle_sha256":"093ba87652bbe9404db6c61229807ab8381cfbebd38aa625a8068e91a9d4bcef"}}