{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KZRADJWZ3OMEPK7IG3TDLRT36G","short_pith_number":"pith:KZRADJWZ","schema_version":"1.0","canonical_sha256":"566201a6d9db9847abe836e635c67bf199f212a3bd02cd73731413f78a9b6b29","source":{"kind":"arxiv","id":"1104.2409","version":7},"attestation_state":"computed","paper":{"title":"Modifying the upper bound on the length of minimal synchronizing word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"A. N. Trahtman","submitted_at":"2011-04-13T08:26:43Z","abstract_excerpt":"A word $w$ is called synchronizing (recurrent, reset, magic, directable) word of deterministic finite automaton (DFA) if $w$ sends all states of the automaton to a unique state. In 1964 Jan \\v{C}erny found a sequence of n-state complete DFA possessing a minimal synchronizing word of length $(n-1)^2$. He conjectured that it is an upper bound on the length of such words for complete DFA. Nevertheless, the best upper bound $(n^3-n)/6$ was found almost 30 years ago. We reduce the upper bound on the length of the minimal synchronizing word to $n(7n^2+6n-16)/48$. An implemented algorithm for finding"},"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":"1104.2409","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-13T08:26:43Z","cross_cats_sorted":[],"title_canon_sha256":"ee98445f0d5f87a2924c0e265a3187b3e2ac4b81928add407436baf8e367de34","abstract_canon_sha256":"7e365804add508f630fa6cd06a891b5c663a0b448cddb62b26078a4fbd287ccf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:57.765105Z","signature_b64":"i+o0F2EMqk9KfTQFZNTbh8tHtNQeZ5B3upSPWCX2e3FcDxtn2p8yOQT9Hjj2Fq+kiO61AwydCHc1cpTXoRDXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"566201a6d9db9847abe836e635c67bf199f212a3bd02cd73731413f78a9b6b29","last_reissued_at":"2026-05-18T02:55:57.764612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:57.764612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modifying the upper bound on the length of minimal synchronizing word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"A. N. Trahtman","submitted_at":"2011-04-13T08:26:43Z","abstract_excerpt":"A word $w$ is called synchronizing (recurrent, reset, magic, directable) word of deterministic finite automaton (DFA) if $w$ sends all states of the automaton to a unique state. In 1964 Jan \\v{C}erny found a sequence of n-state complete DFA possessing a minimal synchronizing word of length $(n-1)^2$. He conjectured that it is an upper bound on the length of such words for complete DFA. Nevertheless, the best upper bound $(n^3-n)/6$ was found almost 30 years ago. We reduce the upper bound on the length of the minimal synchronizing word to $n(7n^2+6n-16)/48$. An implemented algorithm for finding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2409","kind":"arxiv","version":7},"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":"1104.2409","created_at":"2026-05-18T02:55:57.764683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2409v7","created_at":"2026-05-18T02:55:57.764683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2409","created_at":"2026-05-18T02:55:57.764683+00:00"},{"alias_kind":"pith_short_12","alias_value":"KZRADJWZ3OME","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"KZRADJWZ3OMEPK7I","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"KZRADJWZ","created_at":"2026-05-18T12:26:34.985390+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/KZRADJWZ3OMEPK7IG3TDLRT36G","json":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G.json","graph_json":"https://pith.science/api/pith-number/KZRADJWZ3OMEPK7IG3TDLRT36G/graph.json","events_json":"https://pith.science/api/pith-number/KZRADJWZ3OMEPK7IG3TDLRT36G/events.json","paper":"https://pith.science/paper/KZRADJWZ"},"agent_actions":{"view_html":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G","download_json":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G.json","view_paper":"https://pith.science/paper/KZRADJWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2409&json=true","fetch_graph":"https://pith.science/api/pith-number/KZRADJWZ3OMEPK7IG3TDLRT36G/graph.json","fetch_events":"https://pith.science/api/pith-number/KZRADJWZ3OMEPK7IG3TDLRT36G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G/action/storage_attestation","attest_author":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G/action/author_attestation","sign_citation":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G/action/citation_signature","submit_replication":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G/action/replication_record"}},"created_at":"2026-05-18T02:55:57.764683+00:00","updated_at":"2026-05-18T02:55:57.764683+00:00"}