{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3LV25O6SMXAILHFOOV3PFFEJXA","short_pith_number":"pith:3LV25O6S","canonical_record":{"source":{"id":"1302.3906","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-02-15T22:24:44Z","cross_cats_sorted":[],"title_canon_sha256":"79b6091442e5ef0471305a38f4e94b0faa8aea3084dae543ac7073647d3069cf","abstract_canon_sha256":"ac31e1562d3afff0cd96a9d7292296805d234aa3306bdfb61f2d2204b780c3e2"},"schema_version":"1.0"},"canonical_sha256":"daebaebbd265c0859cae7576f29489b8049ee031c7ee8e71535ec5fc0acb4c99","source":{"kind":"arxiv","id":"1302.3906","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3906","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3906v2","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3906","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"3LV25O6SMXAI","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3LV25O6SMXAILHFO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3LV25O6S","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3LV25O6SMXAILHFOOV3PFFEJXA","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3906","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-02-15T22:24:44Z","cross_cats_sorted":[],"title_canon_sha256":"79b6091442e5ef0471305a38f4e94b0faa8aea3084dae543ac7073647d3069cf","abstract_canon_sha256":"ac31e1562d3afff0cd96a9d7292296805d234aa3306bdfb61f2d2204b780c3e2"},"schema_version":"1.0"},"canonical_sha256":"daebaebbd265c0859cae7576f29489b8049ee031c7ee8e71535ec5fc0acb4c99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:05.652947Z","signature_b64":"4TBt4es7yF7u0QwDkm+5WOB7jpVZdYNn+vYIbZdR9Zp1AjLJm0xthID0C8yKJgkEPF+p+2VlwO3rXAH4/D19BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daebaebbd265c0859cae7576f29489b8049ee031c7ee8e71535ec5fc0acb4c99","last_reissued_at":"2026-05-18T03:25:05.652155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:05.652155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3906","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-18T03:25:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U3M5QGkd9mLVOfjdYUxHAkhTOvaAlZ/iw8roCUrAQYbp35n9v/fxnW90CZ+dZoBTcBL4kFcn+k/EREbUQ5EmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:13:59.788941Z"},"content_sha256":"bb98dda74c028521a545eabacce71cc3574ecf0ec1e0a8deac5b5a6927c59098","schema_version":"1.0","event_id":"sha256:bb98dda74c028521a545eabacce71cc3574ecf0ec1e0a8deac5b5a6927c59098"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3LV25O6SMXAILHFOOV3PFFEJXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Gareth Davies, Janusz Brzozowski","submitted_at":"2013-02-15T22:24:44Z","abstract_excerpt":"We relate two measures of complexity of regular languages. The first is syntactic complexity, that is, the cardinality of the syntactic semigroup of the language. That semigroup is isomorphic to the semigroup of transformations of states induced by non-empty words in the minimal deterministic finite automaton accepting the language. If the language has n left quotients (its minimal automaton has n states), then its syntactic complexity is at most n^n and this bound is tight. The second measure consists of the quotient (state) complexities of the atoms of the language, where atoms are non-empty"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3906","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-18T03:25:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pnuo5XuSaNJRkjsF1v8dO9o1Wb01ZqDA0s2/O4FHZj32QlPcdJnn2GG0MMxuFJWqYQaCPQckynZNo9/1FJ72Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:13:59.789284Z"},"content_sha256":"fc7f2ef91010c85aa828709e39425312e499029dd9b80a2917c6fa650cba8c4c","schema_version":"1.0","event_id":"sha256:fc7f2ef91010c85aa828709e39425312e499029dd9b80a2917c6fa650cba8c4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LV25O6SMXAILHFOOV3PFFEJXA/bundle.json","state_url":"https://pith.science/pith/3LV25O6SMXAILHFOOV3PFFEJXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LV25O6SMXAILHFOOV3PFFEJXA/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-01T19:13:59Z","links":{"resolver":"https://pith.science/pith/3LV25O6SMXAILHFOOV3PFFEJXA","bundle":"https://pith.science/pith/3LV25O6SMXAILHFOOV3PFFEJXA/bundle.json","state":"https://pith.science/pith/3LV25O6SMXAILHFOOV3PFFEJXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LV25O6SMXAILHFOOV3PFFEJXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3LV25O6SMXAILHFOOV3PFFEJXA","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":"ac31e1562d3afff0cd96a9d7292296805d234aa3306bdfb61f2d2204b780c3e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-02-15T22:24:44Z","title_canon_sha256":"79b6091442e5ef0471305a38f4e94b0faa8aea3084dae543ac7073647d3069cf"},"schema_version":"1.0","source":{"id":"1302.3906","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3906","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3906v2","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3906","created_at":"2026-05-18T03:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"3LV25O6SMXAI","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3LV25O6SMXAILHFO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3LV25O6S","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:fc7f2ef91010c85aa828709e39425312e499029dd9b80a2917c6fa650cba8c4c","target":"graph","created_at":"2026-05-18T03:25: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":"We relate two measures of complexity of regular languages. The first is syntactic complexity, that is, the cardinality of the syntactic semigroup of the language. That semigroup is isomorphic to the semigroup of transformations of states induced by non-empty words in the minimal deterministic finite automaton accepting the language. If the language has n left quotients (its minimal automaton has n states), then its syntactic complexity is at most n^n and this bound is tight. The second measure consists of the quotient (state) complexities of the atoms of the language, where atoms are non-empty","authors_text":"Gareth Davies, Janusz Brzozowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-02-15T22:24:44Z","title":"Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3906","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:bb98dda74c028521a545eabacce71cc3574ecf0ec1e0a8deac5b5a6927c59098","target":"record","created_at":"2026-05-18T03:25: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":"ac31e1562d3afff0cd96a9d7292296805d234aa3306bdfb61f2d2204b780c3e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-02-15T22:24:44Z","title_canon_sha256":"79b6091442e5ef0471305a38f4e94b0faa8aea3084dae543ac7073647d3069cf"},"schema_version":"1.0","source":{"id":"1302.3906","kind":"arxiv","version":2}},"canonical_sha256":"daebaebbd265c0859cae7576f29489b8049ee031c7ee8e71535ec5fc0acb4c99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"daebaebbd265c0859cae7576f29489b8049ee031c7ee8e71535ec5fc0acb4c99","first_computed_at":"2026-05-18T03:25:05.652155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:05.652155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4TBt4es7yF7u0QwDkm+5WOB7jpVZdYNn+vYIbZdR9Zp1AjLJm0xthID0C8yKJgkEPF+p+2VlwO3rXAH4/D19BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:05.652947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3906","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb98dda74c028521a545eabacce71cc3574ecf0ec1e0a8deac5b5a6927c59098","sha256:fc7f2ef91010c85aa828709e39425312e499029dd9b80a2917c6fa650cba8c4c"],"state_sha256":"bce059c53e2b3e0f2fd884b8423ade5bf5c2f9c33becd7136f47753e23dde3a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bclOoMNCHCuEPFO7yvn+XmPlyZSVBjLyHpqlaqQZz88ybZDCHKsFlgw66AphIdEsMs3xEXwn2VXCGdP/2ziwCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:13:59.791229Z","bundle_sha256":"f26d9b31baf54a8bc87db5e53f36f095094c901cb61863c90544e4d7c3cb4d3b"}}