{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KIJXOX3LXZCHQGOPSQUOXA2U63","short_pith_number":"pith:KIJXOX3L","schema_version":"1.0","canonical_sha256":"5213775f6bbe447819cf9428eb8354f6d1f8a552a0a654ac8c7ef31cd91d59a7","source":{"kind":"arxiv","id":"1703.07618","version":3},"attestation_state":"computed","paper":{"title":"DFAs and PFAs with Long Shortest Synchronizing Word Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Hans Zantema, Henk Don, Michiel de Bondt","submitted_at":"2017-03-22T12:28:34Z","abstract_excerpt":"It was conjectured by \\v{C}ern\\'y in 1964, that a synchronizing DFA on $n$ states always has a shortest 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 4$, and with bounds on the number of symbols for $n \\leq 10$. Here we give the full analysis for $n \\leq 6$, without bounds on the number of symbols.\n  For PFAs the bound is much higher. For $n \\leq 6$ we do a similar analysis as for DFAs and find the maximal shortest synchronizing word lengths, ex"},"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":"1703.07618","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-22T12:28:34Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"4c9ba094a31508adea1a44f8589080f2dc0b7620ae0db0e8570600cbd6b5c6ed","abstract_canon_sha256":"4f1ed686f73bd9240a8ca5fd82f382f2e6b96fb327cf3f7bc1be17e9d698f5dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:17.235088Z","signature_b64":"QwvSs/xk9oguZjKBTG7eSu9n4QNPvn4GIty/fYDuGfweT8QHPT+mps4lyZmeVHSQZa4wEj01H2Sx7nYxS9pCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5213775f6bbe447819cf9428eb8354f6d1f8a552a0a654ac8c7ef31cd91d59a7","last_reissued_at":"2026-05-18T00:42:17.234348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:17.234348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DFAs and PFAs with Long Shortest Synchronizing Word Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Hans Zantema, Henk Don, Michiel de Bondt","submitted_at":"2017-03-22T12:28:34Z","abstract_excerpt":"It was conjectured by \\v{C}ern\\'y in 1964, that a synchronizing DFA on $n$ states always has a shortest 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 4$, and with bounds on the number of symbols for $n \\leq 10$. Here we give the full analysis for $n \\leq 6$, without bounds on the number of symbols.\n  For PFAs the bound is much higher. For $n \\leq 6$ we do a similar analysis as for DFAs and find the maximal shortest synchronizing word lengths, ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07618","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":"1703.07618","created_at":"2026-05-18T00:42:17.234459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07618v3","created_at":"2026-05-18T00:42:17.234459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07618","created_at":"2026-05-18T00:42:17.234459+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIJXOX3LXZCH","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIJXOX3LXZCHQGOP","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIJXOX3L","created_at":"2026-05-18T12:31:24.725408+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/KIJXOX3LXZCHQGOPSQUOXA2U63","json":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63.json","graph_json":"https://pith.science/api/pith-number/KIJXOX3LXZCHQGOPSQUOXA2U63/graph.json","events_json":"https://pith.science/api/pith-number/KIJXOX3LXZCHQGOPSQUOXA2U63/events.json","paper":"https://pith.science/paper/KIJXOX3L"},"agent_actions":{"view_html":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63","download_json":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63.json","view_paper":"https://pith.science/paper/KIJXOX3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07618&json=true","fetch_graph":"https://pith.science/api/pith-number/KIJXOX3LXZCHQGOPSQUOXA2U63/graph.json","fetch_events":"https://pith.science/api/pith-number/KIJXOX3LXZCHQGOPSQUOXA2U63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63/action/storage_attestation","attest_author":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63/action/author_attestation","sign_citation":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63/action/citation_signature","submit_replication":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63/action/replication_record"}},"created_at":"2026-05-18T00:42:17.234459+00:00","updated_at":"2026-05-18T00:42:17.234459+00:00"}