{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EXQQO377CJCD5CQES65HCAKYF3","short_pith_number":"pith:EXQQO377","canonical_record":{"source":{"id":"1103.2986","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-03-15T18:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"000314f661ffe4a712637638289cecbdf648dc63d64479954e8e8e2273a66e6a","abstract_canon_sha256":"4875e09b367e5ef39f8e47f7bbbd3f642549940238feaec6aff0df02d5f9da32"},"schema_version":"1.0"},"canonical_sha256":"25e1076fff12443e8a0497ba7101582eedaec853150130317f130fbdd78c1841","source":{"kind":"arxiv","id":"1103.2986","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2986","created_at":"2026-05-18T04:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2986v2","created_at":"2026-05-18T04:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2986","created_at":"2026-05-18T04:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"EXQQO377CJCD","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EXQQO377CJCD5CQE","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EXQQO377","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EXQQO377CJCD5CQES65HCAKYF3","target":"record","payload":{"canonical_record":{"source":{"id":"1103.2986","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-03-15T18:24:15Z","cross_cats_sorted":[],"title_canon_sha256":"000314f661ffe4a712637638289cecbdf648dc63d64479954e8e8e2273a66e6a","abstract_canon_sha256":"4875e09b367e5ef39f8e47f7bbbd3f642549940238feaec6aff0df02d5f9da32"},"schema_version":"1.0"},"canonical_sha256":"25e1076fff12443e8a0497ba7101582eedaec853150130317f130fbdd78c1841","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:05.201634Z","signature_b64":"0aSi4nhzq0DLpKwfR17uyDc/jmLFhKO0QN7PCJ8xt+BwBECC6eIfvAs3GJHsC47N6iz7r/fUEXdwj+wyAF/HCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25e1076fff12443e8a0497ba7101582eedaec853150130317f130fbdd78c1841","last_reissued_at":"2026-05-18T04:08:05.201171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:05.201171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.2986","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-18T04:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MuL284iVy0fa2A/h1qXD/OY328h3fyfycgX5XJgkDdyCELPaTVSirBhKTtNQ/Wxb5vdy/uyVskASpcGSgjtqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:08:19.892474Z"},"content_sha256":"fc01a79759777f2ac02fd4e247eadbe6ce293e5abf54bce9bbabf3e32dd229c2","schema_version":"1.0","event_id":"sha256:fc01a79759777f2ac02fd4e247eadbe6ce293e5abf54bce9bbabf3e32dd229c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EXQQO377CJCD5CQES65HCAKYF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Syntactic Complexity of Prefix-, Suffix-, Bifix-, and Factor-Free Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Baiyu Li, Janusz Brzozowski, Yuli Ye","submitted_at":"2011-03-15T18:24:15Z","abstract_excerpt":"The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity $n$ of these languages. We study the syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. We prove that $n^{n-2}$ is a tight upper bound for prefix-free regular languages. We present properties of the syntactic semigroups of suffix-, bifix-, and factor-free regular languages, conjecture tight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2986","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-18T04:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tuxB6WiVQeSHtcO/BKCcOEIGhTF0qQ+AA7LX+92utcZ6DmjG/q+KJRJf8VyGDqjmbLm5iVzAHXYYzlzV7ScSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:08:19.893018Z"},"content_sha256":"57538cdf16617646f0d2ccba3e09b1f48901ef4819e599fcc1d02a8d735468fa","schema_version":"1.0","event_id":"sha256:57538cdf16617646f0d2ccba3e09b1f48901ef4819e599fcc1d02a8d735468fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXQQO377CJCD5CQES65HCAKYF3/bundle.json","state_url":"https://pith.science/pith/EXQQO377CJCD5CQES65HCAKYF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXQQO377CJCD5CQES65HCAKYF3/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-30T05:08:19Z","links":{"resolver":"https://pith.science/pith/EXQQO377CJCD5CQES65HCAKYF3","bundle":"https://pith.science/pith/EXQQO377CJCD5CQES65HCAKYF3/bundle.json","state":"https://pith.science/pith/EXQQO377CJCD5CQES65HCAKYF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXQQO377CJCD5CQES65HCAKYF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EXQQO377CJCD5CQES65HCAKYF3","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":"4875e09b367e5ef39f8e47f7bbbd3f642549940238feaec6aff0df02d5f9da32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-03-15T18:24:15Z","title_canon_sha256":"000314f661ffe4a712637638289cecbdf648dc63d64479954e8e8e2273a66e6a"},"schema_version":"1.0","source":{"id":"1103.2986","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2986","created_at":"2026-05-18T04:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2986v2","created_at":"2026-05-18T04:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2986","created_at":"2026-05-18T04:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"EXQQO377CJCD","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EXQQO377CJCD5CQE","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EXQQO377","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:57538cdf16617646f0d2ccba3e09b1f48901ef4819e599fcc1d02a8d735468fa","target":"graph","created_at":"2026-05-18T04:08:05Z","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":"The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity $n$ of these languages. We study the syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. We prove that $n^{n-2}$ is a tight upper bound for prefix-free regular languages. We present properties of the syntactic semigroups of suffix-, bifix-, and factor-free regular languages, conjecture tight","authors_text":"Baiyu Li, Janusz Brzozowski, Yuli Ye","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-03-15T18:24:15Z","title":"Syntactic Complexity of Prefix-, Suffix-, Bifix-, and Factor-Free Regular Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2986","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:fc01a79759777f2ac02fd4e247eadbe6ce293e5abf54bce9bbabf3e32dd229c2","target":"record","created_at":"2026-05-18T04:08:05Z","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":"4875e09b367e5ef39f8e47f7bbbd3f642549940238feaec6aff0df02d5f9da32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-03-15T18:24:15Z","title_canon_sha256":"000314f661ffe4a712637638289cecbdf648dc63d64479954e8e8e2273a66e6a"},"schema_version":"1.0","source":{"id":"1103.2986","kind":"arxiv","version":2}},"canonical_sha256":"25e1076fff12443e8a0497ba7101582eedaec853150130317f130fbdd78c1841","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25e1076fff12443e8a0497ba7101582eedaec853150130317f130fbdd78c1841","first_computed_at":"2026-05-18T04:08:05.201171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:05.201171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0aSi4nhzq0DLpKwfR17uyDc/jmLFhKO0QN7PCJ8xt+BwBECC6eIfvAs3GJHsC47N6iz7r/fUEXdwj+wyAF/HCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:05.201634Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2986","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc01a79759777f2ac02fd4e247eadbe6ce293e5abf54bce9bbabf3e32dd229c2","sha256:57538cdf16617646f0d2ccba3e09b1f48901ef4819e599fcc1d02a8d735468fa"],"state_sha256":"931a1bc58863db0ac9e28f533501aabb0654bd8ba9d491202497156111088897"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9FYFiDaQFQ6tpZSUyTi49z4kljeiEMB7vt21ZsaEd1hmij5IPpO+AWYcdDDjkq5zYULITJmM7l9E5hHfHJuCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:08:19.895120Z","bundle_sha256":"bfe493e145a4a568d2d6c15f653abeb9f0a1e3bb162f70ac2e744e2482e3ff3b"}}