{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PVFXFC3OOHHHO7TAZ6HZUEYJA7","short_pith_number":"pith:PVFXFC3O","schema_version":"1.0","canonical_sha256":"7d4b728b6e71ce777e60cf8f9a130907c0d8a8c96b923c994e1062f1283f4e27","source":{"kind":"arxiv","id":"1403.2090","version":2},"attestation_state":"computed","paper":{"title":"Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals","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":"2014-03-09T18:50:12Z","abstract_excerpt":"We solve two open problems concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a left ideal or a suffix-closed language with $n$ left quotients (that is, with state complexity $n$) is at most $n^{n-1}+n-1$, and that of a two-sided ideal or a factor-closed language is at most $n^{n-2}+(n-2)2^{n-2}+1$. Since these bounds are known to be reachable, this settles the problems."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1403.2090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-03-09T18:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"2c3df5d7279b1cc00bcdfc333b31d2126aa8503e0d409557c8f740f4656341c8","abstract_canon_sha256":"dc6a7ae6228058b4d27edadd1cb4d77f81138fb02cb160ba88736b1573b5393f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:25.880187Z","signature_b64":"jggz2CQPjIAIiacuC+Igwi+6cBDZBTcRgTFEP5mFRLtaCNHCIFxUWSd4gahO5tdp1EIBDsicFBqxhQjtrLoACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d4b728b6e71ce777e60cf8f9a130907c0d8a8c96b923c994e1062f1283f4e27","last_reissued_at":"2026-05-18T02:48:25.879704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:25.879704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals","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":"2014-03-09T18:50:12Z","abstract_excerpt":"We solve two open problems concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a left ideal or a suffix-closed language with $n$ left quotients (that is, with state complexity $n$) is at most $n^{n-1}+n-1$, and that of a two-sided ideal or a factor-closed language is at most $n^{n-2}+(n-2)2^{n-2}+1$. Since these bounds are known to be reachable, this settles the problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2090","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.2090","created_at":"2026-05-18T02:48:25.879787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2090v2","created_at":"2026-05-18T02:48:25.879787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2090","created_at":"2026-05-18T02:48:25.879787+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVFXFC3OOHHH","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVFXFC3OOHHHO7TA","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVFXFC3O","created_at":"2026-05-18T12:28:43.426989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PVFXFC3OOHHHO7TAZ6HZUEYJA7","json":"https://pith.science/pith/PVFXFC3OOHHHO7TAZ6HZUEYJA7.json","graph_json":"https://pith.science/api/pith-number/PVFXFC3OOHHHO7TAZ6HZUEYJA7/graph.json","events_json":"https://pith.science/api/pith-number/PVFXFC3OOHHHO7TAZ6HZUEYJA7/events.json","paper":"https://pith.science/paper/PVFXFC3O"},"agent_actions":{"view_html":"https://pith.science/pith/PVFXFC3OOHHHO7TAZ6HZUEYJA7","download_json":"https://pith.science/pith/PVFXFC3OOHHHO7TAZ6HZUEYJA7.json","view_paper":"https://pith.science/paper/PVFXFC3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2090&json=true","fetch_graph":"https://pith.science/api/pith-number/PVFXFC3OOHHHO7TAZ6HZUEYJA7/graph.json","fetch_events":"https://pith.science/api/pith-number/PVFXFC3OOHHHO7TAZ6HZUEYJA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVFXFC3OOHHHO7TAZ6HZUEYJA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVFXFC3OOHHHO7TAZ6HZUEYJA7/action/storage_attestation","attest_author":"https://pith.science/pith/PVFXFC3OOHHHO7TAZ6HZUEYJA7/action/author_attestation","sign_citation":"https://pith.science/pith/PVFXFC3OOHHHO7TAZ6HZUEYJA7/action/citation_signature","submit_replication":"https://pith.science/pith/PVFXFC3OOHHHO7TAZ6HZUEYJA7/action/replication_record"}},"created_at":"2026-05-18T02:48:25.879787+00:00","updated_at":"2026-05-18T02:48:25.879787+00:00"}