{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BM2Z65UWHC6YO2E5O5JLVEBVFF","short_pith_number":"pith:BM2Z65UW","schema_version":"1.0","canonical_sha256":"0b359f769638bd87689d7752ba9035294b027d1825e5c5c3d34e5a6668c607f4","source":{"kind":"arxiv","id":"1801.10436","version":3},"attestation_state":"computed","paper":{"title":"Lower Bounds for Synchronizing Word Lengths in Partial Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Hans Zantema, Henk Don, Michiel de Bondt","submitted_at":"2018-01-31T13:11:42Z","abstract_excerpt":"It was conjectured by \\v{C}ern\\'y in 1964, that a synchronizing DFA on $n$ states always has a synchronizing word of length at most $(n-1)^2$, and he gave a sequence of DFAs for which this bound is reached. Until now a full analysis of all DFAs reaching this bound was only given for $n \\leq 5$, and with bounds on the number of symbols for $n \\leq 12$. Here we give the full analysis for $n \\leq 7$, without bounds on the number of symbols.\n  For PFAs (partial automata) on $\\leq 7$ states we do a similar analysis as for DFAs and find the maximal shortest synchronizing word lengths, exceeding $(n-"},"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":"1801.10436","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-01-31T13:11:42Z","cross_cats_sorted":[],"title_canon_sha256":"d4890a5e55e586216672996798e79e31587f35ad472547fae1bc79a37efbac0b","abstract_canon_sha256":"6c17cc1fc9f40bcc7798bcea83f1c5fa9dabca1903917b441c3e7efde86be0cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:39.394574Z","signature_b64":"cgKV/OsPTEcD3bvh18N+/JuF/D5wzdi7SlLYNRxbsI2ZHC0qe1QKURg+8eCBCystYu4reKVv7Dhjkar5vli/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b359f769638bd87689d7752ba9035294b027d1825e5c5c3d34e5a6668c607f4","last_reissued_at":"2026-05-18T00:05:39.394134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:39.394134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Synchronizing Word Lengths in Partial Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Hans Zantema, Henk Don, Michiel de Bondt","submitted_at":"2018-01-31T13:11:42Z","abstract_excerpt":"It was conjectured by \\v{C}ern\\'y in 1964, that a synchronizing DFA on $n$ states always has a synchronizing word of length at most $(n-1)^2$, and he gave a sequence of DFAs for which this bound is reached. Until now a full analysis of all DFAs reaching this bound was only given for $n \\leq 5$, and with bounds on the number of symbols for $n \\leq 12$. Here we give the full analysis for $n \\leq 7$, without bounds on the number of symbols.\n  For PFAs (partial automata) on $\\leq 7$ states we do a similar analysis as for DFAs and find the maximal shortest synchronizing word lengths, exceeding $(n-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10436","kind":"arxiv","version":3},"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":"1801.10436","created_at":"2026-05-18T00:05:39.394205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.10436v3","created_at":"2026-05-18T00:05:39.394205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10436","created_at":"2026-05-18T00:05:39.394205+00:00"},{"alias_kind":"pith_short_12","alias_value":"BM2Z65UWHC6Y","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BM2Z65UWHC6YO2E5","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BM2Z65UW","created_at":"2026-05-18T12:32:16.446611+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/BM2Z65UWHC6YO2E5O5JLVEBVFF","json":"https://pith.science/pith/BM2Z65UWHC6YO2E5O5JLVEBVFF.json","graph_json":"https://pith.science/api/pith-number/BM2Z65UWHC6YO2E5O5JLVEBVFF/graph.json","events_json":"https://pith.science/api/pith-number/BM2Z65UWHC6YO2E5O5JLVEBVFF/events.json","paper":"https://pith.science/paper/BM2Z65UW"},"agent_actions":{"view_html":"https://pith.science/pith/BM2Z65UWHC6YO2E5O5JLVEBVFF","download_json":"https://pith.science/pith/BM2Z65UWHC6YO2E5O5JLVEBVFF.json","view_paper":"https://pith.science/paper/BM2Z65UW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.10436&json=true","fetch_graph":"https://pith.science/api/pith-number/BM2Z65UWHC6YO2E5O5JLVEBVFF/graph.json","fetch_events":"https://pith.science/api/pith-number/BM2Z65UWHC6YO2E5O5JLVEBVFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BM2Z65UWHC6YO2E5O5JLVEBVFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BM2Z65UWHC6YO2E5O5JLVEBVFF/action/storage_attestation","attest_author":"https://pith.science/pith/BM2Z65UWHC6YO2E5O5JLVEBVFF/action/author_attestation","sign_citation":"https://pith.science/pith/BM2Z65UWHC6YO2E5O5JLVEBVFF/action/citation_signature","submit_replication":"https://pith.science/pith/BM2Z65UWHC6YO2E5O5JLVEBVFF/action/replication_record"}},"created_at":"2026-05-18T00:05:39.394205+00:00","updated_at":"2026-05-18T00:05:39.394205+00:00"}