{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HYPJQBW6TUDGS4VCKQWZSM6IKI","short_pith_number":"pith:HYPJQBW6","canonical_record":{"source":{"id":"1010.3263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-15T20:06:43Z","cross_cats_sorted":[],"title_canon_sha256":"e38afd948b13cf8651d1e3a41f398a48d0333d02f1a851e8778a077906f4ba86","abstract_canon_sha256":"2e33d6f304dbad089482b09b2f31518a1fc41edb2ae9b1a16466a81846b18584"},"schema_version":"1.0"},"canonical_sha256":"3e1e9806de9d066972a2542d9933c8523f45884a7c5aac504b7e05aa0fbb309d","source":{"kind":"arxiv","id":"1010.3263","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3263","created_at":"2026-05-18T04:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3263v1","created_at":"2026-05-18T04:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3263","created_at":"2026-05-18T04:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"HYPJQBW6TUDG","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HYPJQBW6TUDGS4VC","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HYPJQBW6","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HYPJQBW6TUDGS4VCKQWZSM6IKI","target":"record","payload":{"canonical_record":{"source":{"id":"1010.3263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-15T20:06:43Z","cross_cats_sorted":[],"title_canon_sha256":"e38afd948b13cf8651d1e3a41f398a48d0333d02f1a851e8778a077906f4ba86","abstract_canon_sha256":"2e33d6f304dbad089482b09b2f31518a1fc41edb2ae9b1a16466a81846b18584"},"schema_version":"1.0"},"canonical_sha256":"3e1e9806de9d066972a2542d9933c8523f45884a7c5aac504b7e05aa0fbb309d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:09.701753Z","signature_b64":"sHKfrlKvZrBUteqsqoHyyoyaQD+4PhENgw2D/I3LiDJxQ1rsJnfDnNIhppP11P7VmpiqHCvsT/ehxn5EeUMxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e1e9806de9d066972a2542d9933c8523f45884a7c5aac504b7e05aa0fbb309d","last_reissued_at":"2026-05-18T04:39:09.701172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:09.701172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.3263","source_version":1,"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:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJwKSRNLSaJIENfdq0TOoip/Z9i9wC0k3extQtRtEtWwPhfvpPEDagvFW4kRphpuzBLIUyN1I4LGZa8QBhGxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:24:59.019851Z"},"content_sha256":"afd6257bc09c7af45abf225a1441762d2fc5172885bdef36bb9a3ae61f2d5e05","schema_version":"1.0","event_id":"sha256:afd6257bc09c7af45abf225a1441762d2fc5172885bdef36bb9a3ae61f2d5e05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HYPJQBW6TUDGS4VCKQWZSM6IKI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Syntactic Complexity of Ideal and Closed Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz Brzozowski, Yuli Ye","submitted_at":"2010-10-15T20:06:43Z","abstract_excerpt":"The state complexity of a regular language is the number of states in the minimal deterministic 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 study the syntactic complexity of the class of regular ideal languages and their complements, the closed languages. We prove that $n^{n-1}$ is a tight upper bound on the complexity of right ideals a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3263","kind":"arxiv","version":1},"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:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tDTu46i8KtQLZia8rIIQO1iflB7vjvL4H5fNEEUl33fOHl3Gbp4K/cuXBRiLCUL/iT/F/+Ay/3bjha55Hw1UDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:24:59.020183Z"},"content_sha256":"ef4c9750390f6570ba83a8697d23401b8e36091fec47343134c9233d4798c6b0","schema_version":"1.0","event_id":"sha256:ef4c9750390f6570ba83a8697d23401b8e36091fec47343134c9233d4798c6b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI/bundle.json","state_url":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI/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-28T07:24:59Z","links":{"resolver":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI","bundle":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI/bundle.json","state":"https://pith.science/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYPJQBW6TUDGS4VCKQWZSM6IKI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HYPJQBW6TUDGS4VCKQWZSM6IKI","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":"2e33d6f304dbad089482b09b2f31518a1fc41edb2ae9b1a16466a81846b18584","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-15T20:06:43Z","title_canon_sha256":"e38afd948b13cf8651d1e3a41f398a48d0333d02f1a851e8778a077906f4ba86"},"schema_version":"1.0","source":{"id":"1010.3263","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3263","created_at":"2026-05-18T04:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3263v1","created_at":"2026-05-18T04:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3263","created_at":"2026-05-18T04:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"HYPJQBW6TUDG","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HYPJQBW6TUDGS4VC","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HYPJQBW6","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:ef4c9750390f6570ba83a8697d23401b8e36091fec47343134c9233d4798c6b0","target":"graph","created_at":"2026-05-18T04:39:09Z","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 the minimal deterministic 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 study the syntactic complexity of the class of regular ideal languages and their complements, the closed languages. We prove that $n^{n-1}$ is a tight upper bound on the complexity of right ideals a","authors_text":"Janusz Brzozowski, Yuli Ye","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-15T20:06:43Z","title":"Syntactic Complexity of Ideal and Closed Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3263","kind":"arxiv","version":1},"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:afd6257bc09c7af45abf225a1441762d2fc5172885bdef36bb9a3ae61f2d5e05","target":"record","created_at":"2026-05-18T04:39:09Z","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":"2e33d6f304dbad089482b09b2f31518a1fc41edb2ae9b1a16466a81846b18584","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-15T20:06:43Z","title_canon_sha256":"e38afd948b13cf8651d1e3a41f398a48d0333d02f1a851e8778a077906f4ba86"},"schema_version":"1.0","source":{"id":"1010.3263","kind":"arxiv","version":1}},"canonical_sha256":"3e1e9806de9d066972a2542d9933c8523f45884a7c5aac504b7e05aa0fbb309d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e1e9806de9d066972a2542d9933c8523f45884a7c5aac504b7e05aa0fbb309d","first_computed_at":"2026-05-18T04:39:09.701172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:09.701172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sHKfrlKvZrBUteqsqoHyyoyaQD+4PhENgw2D/I3LiDJxQ1rsJnfDnNIhppP11P7VmpiqHCvsT/ehxn5EeUMxCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:09.701753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.3263","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afd6257bc09c7af45abf225a1441762d2fc5172885bdef36bb9a3ae61f2d5e05","sha256:ef4c9750390f6570ba83a8697d23401b8e36091fec47343134c9233d4798c6b0"],"state_sha256":"98284ee801ed532fd8ed8e691dad4eecc30d7fade5d757839b3608490f52440c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8PVtpI0RswBzRIi4BEYxd4YKj8PRYObgTylUeC9SOJodeB+4xlS4HnACWiMatFGG4jHwN/el8yF0TPNnGDoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T07:24:59.021978Z","bundle_sha256":"94bb2b59a69e58ca5b22be777005a778a09188dfa970e9643e7554eb8e01c81a"}}