{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OAUKKT5LNYX4FXYR3MH6BG5F5G","short_pith_number":"pith:OAUKKT5L","canonical_record":{"source":{"id":"1504.05159","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-20T19:09:34Z","cross_cats_sorted":[],"title_canon_sha256":"919f81ea25dafe5c49a5f9e53149b82241060d74ad32913a14a950757402f167","abstract_canon_sha256":"50d6f8b322272f3d636005436a7be9e6580706f1b0720498b8848d23155db099"},"schema_version":"1.0"},"canonical_sha256":"7028a54fab6e2fc2df11db0fe09ba5e9843db622c2f78d259dc296e9a4621a9a","source":{"kind":"arxiv","id":"1504.05159","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05159","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05159v4","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05159","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"OAUKKT5LNYX4","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OAUKKT5LNYX4FXYR","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OAUKKT5L","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OAUKKT5LNYX4FXYR3MH6BG5F5G","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05159","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-20T19:09:34Z","cross_cats_sorted":[],"title_canon_sha256":"919f81ea25dafe5c49a5f9e53149b82241060d74ad32913a14a950757402f167","abstract_canon_sha256":"50d6f8b322272f3d636005436a7be9e6580706f1b0720498b8848d23155db099"},"schema_version":"1.0"},"canonical_sha256":"7028a54fab6e2fc2df11db0fe09ba5e9843db622c2f78d259dc296e9a4621a9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:25.770190Z","signature_b64":"u5qEAZQmd7ZiUf7RLitsK/proimFM38p6cLXQEvS7yAQrGNcBAy7KH9+3NzQBjXYiAG991f3LQgjVSK29FU3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7028a54fab6e2fc2df11db0fe09ba5e9843db622c2f78d259dc296e9a4621a9a","last_reissued_at":"2026-05-18T00:55:25.769649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:25.769649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05159","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-18T00:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUZBq5tDhsr2GgLqVY7B8Rb0KheLx43th7+Nx2rJLR1sTgcIS0IP1jnMuhdg79BTR1K6oU5SkVic+mC2rhhICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:26:26.996515Z"},"content_sha256":"fe4ab814bbefe66b9049d44632ca93c7f543bfa90bc34262f63a1002e44a134a","schema_version":"1.0","event_id":"sha256:fe4ab814bbefe66b9049d44632ca93c7f543bfa90bc34262f63a1002e44a134a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OAUKKT5LNYX4FXYR3MH6BG5F5G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Suffix-Free Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz Brzozowski, Marek Szyku{\\l}a","submitted_at":"2015-04-20T19:09:34Z","abstract_excerpt":"We study various complexity properties of suffix-free regular languages. The quotient complexity of a regular language $L$ is the number of left quotients of $L$; this is the same as the state complexity of $L$. A regular language $L'$ is a dialect of a regular language $L$ if it differs only slightly from $L$. The quotient complexity of an operation on regular languages is the maximal quotient complexity of the result of the operation expressed as a function of the quotient complexities of the operands. A sequence $(L_k,L_{k+1},\\dots)$ of regular languages in some class ${\\mathcal C}$, where "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05159","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-18T00:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"viExl6DozwF+/9DmRGcfBU4SB24S5TUOMRfN88Swiq0+NC4hd2OkmV/uZ7xBhSL6EGEh9X4TO7D6uNTiVHpfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:26:26.996862Z"},"content_sha256":"5adec2fe92f664ca2fabd7803a6bd5d661eee0d49929a24e7f65af8b5d587ee1","schema_version":"1.0","event_id":"sha256:5adec2fe92f664ca2fabd7803a6bd5d661eee0d49929a24e7f65af8b5d587ee1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G/bundle.json","state_url":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G/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-30T13:26:26Z","links":{"resolver":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G","bundle":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G/bundle.json","state":"https://pith.science/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OAUKKT5LNYX4FXYR3MH6BG5F5G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OAUKKT5LNYX4FXYR3MH6BG5F5G","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":"50d6f8b322272f3d636005436a7be9e6580706f1b0720498b8848d23155db099","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-20T19:09:34Z","title_canon_sha256":"919f81ea25dafe5c49a5f9e53149b82241060d74ad32913a14a950757402f167"},"schema_version":"1.0","source":{"id":"1504.05159","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05159","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05159v4","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05159","created_at":"2026-05-18T00:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"OAUKKT5LNYX4","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OAUKKT5LNYX4FXYR","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OAUKKT5L","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:5adec2fe92f664ca2fabd7803a6bd5d661eee0d49929a24e7f65af8b5d587ee1","target":"graph","created_at":"2026-05-18T00:55:25Z","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 study various complexity properties of suffix-free regular languages. The quotient complexity of a regular language $L$ is the number of left quotients of $L$; this is the same as the state complexity of $L$. A regular language $L'$ is a dialect of a regular language $L$ if it differs only slightly from $L$. The quotient complexity of an operation on regular languages is the maximal quotient complexity of the result of the operation expressed as a function of the quotient complexities of the operands. A sequence $(L_k,L_{k+1},\\dots)$ of regular languages in some class ${\\mathcal C}$, where ","authors_text":"Janusz Brzozowski, Marek Szyku{\\l}a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-20T19:09:34Z","title":"Complexity of Suffix-Free Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05159","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:fe4ab814bbefe66b9049d44632ca93c7f543bfa90bc34262f63a1002e44a134a","target":"record","created_at":"2026-05-18T00:55:25Z","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":"50d6f8b322272f3d636005436a7be9e6580706f1b0720498b8848d23155db099","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-20T19:09:34Z","title_canon_sha256":"919f81ea25dafe5c49a5f9e53149b82241060d74ad32913a14a950757402f167"},"schema_version":"1.0","source":{"id":"1504.05159","kind":"arxiv","version":4}},"canonical_sha256":"7028a54fab6e2fc2df11db0fe09ba5e9843db622c2f78d259dc296e9a4621a9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7028a54fab6e2fc2df11db0fe09ba5e9843db622c2f78d259dc296e9a4621a9a","first_computed_at":"2026-05-18T00:55:25.769649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:25.769649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u5qEAZQmd7ZiUf7RLitsK/proimFM38p6cLXQEvS7yAQrGNcBAy7KH9+3NzQBjXYiAG991f3LQgjVSK29FU3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:25.770190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05159","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe4ab814bbefe66b9049d44632ca93c7f543bfa90bc34262f63a1002e44a134a","sha256:5adec2fe92f664ca2fabd7803a6bd5d661eee0d49929a24e7f65af8b5d587ee1"],"state_sha256":"4949602c98bfc9358f2cdb5f272609cacc7923088fdd8cee1f0f10c0da23235a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vDUB1BeOQi8RSEVab7UbNr55zAWhGFPBDr2dauD+GzA86Amt/1B65ra/COq3EfpH35XeRK9rU81VHr27P6tlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:26:26.998939Z","bundle_sha256":"f37c80de06d973a4628b7cd97cf11725e9e03cf9783bb9153bba0489cb5712ed"}}