{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XAE4R2O4KGILVIDMYWEPYGPQG6","short_pith_number":"pith:XAE4R2O4","canonical_record":{"source":{"id":"1509.06032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-20T17:55:12Z","cross_cats_sorted":[],"title_canon_sha256":"58a217696ecf92127ef91a81aca0685024c13de36750628f816c17aad6c534c2","abstract_canon_sha256":"cf9574f3451f17f8a5a0ab5d526d3ccc38eb2839403a9c86d826ce9b024ab8af"},"schema_version":"1.0"},"canonical_sha256":"b809c8e9dc5190baa06cc588fc19f0379903ab433ce87f5dc4763146b575efc7","source":{"kind":"arxiv","id":"1509.06032","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06032","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06032v2","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06032","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"XAE4R2O4KGIL","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XAE4R2O4KGILVIDM","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XAE4R2O4","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XAE4R2O4KGILVIDMYWEPYGPQG6","target":"record","payload":{"canonical_record":{"source":{"id":"1509.06032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-20T17:55:12Z","cross_cats_sorted":[],"title_canon_sha256":"58a217696ecf92127ef91a81aca0685024c13de36750628f816c17aad6c534c2","abstract_canon_sha256":"cf9574f3451f17f8a5a0ab5d526d3ccc38eb2839403a9c86d826ce9b024ab8af"},"schema_version":"1.0"},"canonical_sha256":"b809c8e9dc5190baa06cc588fc19f0379903ab433ce87f5dc4763146b575efc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:55.537113Z","signature_b64":"nZEdRFp48Zw71Uo9/ydD+UJigTImUzsfiNFe/shbCq59IpGTzJJ5yAnde7fp9faW1Y4NLbWGhegdxhjL81U0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b809c8e9dc5190baa06cc588fc19f0379903ab433ce87f5dc4763146b575efc7","last_reissued_at":"2026-05-18T00:52:55.536547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:55.536547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.06032","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-18T00:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBToJTzrO2JHWkDjrVOgZb+c1+7J6/LHeFZL5hIjV+jTdqMlW8c4RfFxD8bPHzOUCJZVw9cK8rYVgFzPjqnoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T03:50:14.278888Z"},"content_sha256":"8e7dcee347bf2609be0e310dee297bb4dc3bcb9c0e14cb0bc68ec4c52539ef75","schema_version":"1.0","event_id":"sha256:8e7dcee347bf2609be0e310dee297bb4dc3bcb9c0e14cb0bc68ec4c52539ef75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XAE4R2O4KGILVIDMYWEPYGPQG6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Syntactic complexity of regular ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz A. Brzozowski, Marek Szyku{\\l}a, Yuli Ye","submitted_at":"2015-09-20T17:55:12Z","abstract_excerpt":"The state complexity of a regular language is the number of states in a minimal deterministic finite automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the worst-case syntactic complexity taken as a function of the state complexity $n$ of languages in that class. We prove that $n^{n-1}$, $n^{n-1}+n-1$, and $n^{n-2}+(n-2)2^{n-2}+1$ are tight upper bounds on the syntactic complexities of right ideals and prefix-closed languages, left ideals and suffix-closed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06032","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-18T00:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h8hhl31uMtQlL4o5/9RVvCaaZ3pc2mKUfpg6VAqqVIImVgSPzR8TelAj0Tqs001Q3fBoIHG7n9NfoTc0+nXWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T03:50:14.279228Z"},"content_sha256":"857e7f79295b6643db8050c7ea858a5bb98e2c9a0cbd0461229fad92d26cd735","schema_version":"1.0","event_id":"sha256:857e7f79295b6643db8050c7ea858a5bb98e2c9a0cbd0461229fad92d26cd735"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XAE4R2O4KGILVIDMYWEPYGPQG6/bundle.json","state_url":"https://pith.science/pith/XAE4R2O4KGILVIDMYWEPYGPQG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XAE4R2O4KGILVIDMYWEPYGPQG6/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-28T03:50:14Z","links":{"resolver":"https://pith.science/pith/XAE4R2O4KGILVIDMYWEPYGPQG6","bundle":"https://pith.science/pith/XAE4R2O4KGILVIDMYWEPYGPQG6/bundle.json","state":"https://pith.science/pith/XAE4R2O4KGILVIDMYWEPYGPQG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XAE4R2O4KGILVIDMYWEPYGPQG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XAE4R2O4KGILVIDMYWEPYGPQG6","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":"cf9574f3451f17f8a5a0ab5d526d3ccc38eb2839403a9c86d826ce9b024ab8af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-20T17:55:12Z","title_canon_sha256":"58a217696ecf92127ef91a81aca0685024c13de36750628f816c17aad6c534c2"},"schema_version":"1.0","source":{"id":"1509.06032","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06032","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06032v2","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06032","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"XAE4R2O4KGIL","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XAE4R2O4KGILVIDM","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XAE4R2O4","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:857e7f79295b6643db8050c7ea858a5bb98e2c9a0cbd0461229fad92d26cd735","target":"graph","created_at":"2026-05-18T00:52:55Z","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 state complexity of a regular language is the number of states in a minimal deterministic finite automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the worst-case syntactic complexity taken as a function of the state complexity $n$ of languages in that class. We prove that $n^{n-1}$, $n^{n-1}+n-1$, and $n^{n-2}+(n-2)2^{n-2}+1$ are tight upper bounds on the syntactic complexities of right ideals and prefix-closed languages, left ideals and suffix-closed","authors_text":"Janusz A. Brzozowski, Marek Szyku{\\l}a, Yuli Ye","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-20T17:55:12Z","title":"Syntactic complexity of regular ideals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06032","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:8e7dcee347bf2609be0e310dee297bb4dc3bcb9c0e14cb0bc68ec4c52539ef75","target":"record","created_at":"2026-05-18T00:52:55Z","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":"cf9574f3451f17f8a5a0ab5d526d3ccc38eb2839403a9c86d826ce9b024ab8af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-20T17:55:12Z","title_canon_sha256":"58a217696ecf92127ef91a81aca0685024c13de36750628f816c17aad6c534c2"},"schema_version":"1.0","source":{"id":"1509.06032","kind":"arxiv","version":2}},"canonical_sha256":"b809c8e9dc5190baa06cc588fc19f0379903ab433ce87f5dc4763146b575efc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b809c8e9dc5190baa06cc588fc19f0379903ab433ce87f5dc4763146b575efc7","first_computed_at":"2026-05-18T00:52:55.536547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:55.536547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nZEdRFp48Zw71Uo9/ydD+UJigTImUzsfiNFe/shbCq59IpGTzJJ5yAnde7fp9faW1Y4NLbWGhegdxhjL81U0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:55.537113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06032","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e7dcee347bf2609be0e310dee297bb4dc3bcb9c0e14cb0bc68ec4c52539ef75","sha256:857e7f79295b6643db8050c7ea858a5bb98e2c9a0cbd0461229fad92d26cd735"],"state_sha256":"d47b24d934cc7e214eae7b410fa944bf32f01eac728d0625b3d0539b681c4b8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1qwFnokzDYNFQ8dTCwOA8yZLmbFnqwqoF+hLBxl1ovxRk9rTfR2f8AgEDpbIhiD16BqxJtz9AabKG6TsHH/wAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T03:50:14.281045Z","bundle_sha256":"ec17f12b265672501195e157b5bcfefae13da65c3d01210ba9c93ba0d4c342a8"}}