{"schema_version":"source-reader-v1","record":{"source_id":"cerny-synchronization-paper","versions":[{"work":{"authors":["Yinfeng Zhu"],"kind":"research_paper","publication":"preprint","publication_note":"Source-reported results and external checks are separate from independent OpenMath assessment.","ai_role":"self_reported","ai_note":"Zhu reports obtaining the proof through interaction with OpenAI Codex using GPT-5.6 Sol in ultra mode and verifying the argument himself.","artifacts":[],"published":{"value":"2026-07-22"}},"id":"cerny-synchronization:source:paper:v1","source_id":"cerny-synchronization-paper","title":"The Černý Conjecture for One-Cluster Automata via Annular Spectral Descent","owner":"Yinfeng Zhu","url":"https://arxiv.org/html/2607.19675v1","subject_scope":"Introduction; main positive-level results; Section 10, Definition 10.1, Lemma 10.2 and Corollary 10.8.","revision":"v1","content_sha256":"e4c9662c870b7a57340632830c50c88de9264fb345ef23792b160cfcd66ef803","update_method":"Compare the pinned source before publishing another immutable revision.","identifier_policy":"Stable source identity; exact source passages are versioned.","observed_on":"2026-10-14","source_updated_on":null,"rights":"metadata-link","license":"Source document rights apply; OpenMath publishes original paraphrases.","terms_url":"https://arxiv.org/html/2607.19675v1","attribution":"Yinfeng Zhu","rights_note":"Linked proof prose is not republished. Any copied graph data is CC0, as specified by its archive.","check_interval_days":90}],"entries":[{"id":"cerny-synchronization:entry:cerny-examples:v1","source_version_id":"cerny-synchronization:source:paper:v1","item_id":"introduction-cerny-examples","url":"https://arxiv.org/html/2607.19675v1","wording":"The Černý conjecture asserts that every synchronizing automaton with n states has reset threshold at most (n−1)²; the classical examples of Černý (1964) show that this number would be best possible.","wording_kind":"paraphrase","locator":"§1, first paragraph; reference [5], Lemma 1","supersedes":null},{"id":"cerny-synchronization:entry:circular:v1","source_version_id":"cerny-synchronization:source:paper:v1","item_id":"circular","url":"https://arxiv.org/html/2607.19675v1","wording":"The level-zero circular case is already covered by older results. It is not the positive-level advance claimed by the 2026 proof.","wording_kind":"paraphrase","locator":"Introduction and cited Dubuc (1998)","supersedes":null},{"id":"cerny-synchronization:entry:positive-level:v1","source_version_id":"cerny-synchronization:source:paper:v1","item_id":"positive-level","url":"https://arxiv.org/html/2607.19675v1","wording":"For a synchronizing one-cluster automaton with n states, cycle length m and least level ℓ ≥ 1, the source proves the bound (m−1)(n−1)+mℓ ≤ (n−1)² and the stated relative-extension property.","wording_kind":"paraphrase","locator":"Main theorem and relative-extending-word result","supersedes":null},{"id":"cerny-synchronization:entry:question:v1","source_version_id":"cerny-synchronization:source:paper:v1","item_id":"question","url":"https://arxiv.org/html/2607.19675v1","wording":"The general quadratic conjecture is distinct from a result for a letter whose functional graph has exactly one cycle. Level is the least power mapping the state set onto that cycle.","wording_kind":"paraphrase","locator":"Introduction; definitions of synchronization and one-cluster level","supersedes":null},{"id":"cerny-synchronization:entry:sharpness:v1","source_version_id":"cerny-synchronization:source:paper:v1","item_id":"sharpness","url":"https://arxiv.org/html/2607.19675v1","wording":"A binary family F_n has m = 2, ℓ = n−2 and exact reset threshold 3n−5; a^(n−2)b^(n−1)a^(n−2) resets it to state 1.","wording_kind":"paraphrase","locator":"Section 10, Definition 10.1, Lemma 10.2 and Corollary 10.8","supersedes":null}],"problems":[{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4}],"selected_version_id":"cerny-synchronization:source:paper:v1","available_versions":[{"id":"cerny-synchronization:source:paper:v1","revision":"v1","observed_on":"2026-10-14","title":"The Černý Conjecture for One-Cluster Automata via Annular Spectral Descent","publication":"preprint","content_sha256":"e4c9662c870b7a57340632830c50c88de9264fb345ef23792b160cfcd66ef803","used_in_current_publications":true}],"usages":[{"id":"source-use-2b0f675da887842aab66","entry_id":"cerny-synchronization:entry:cerny-examples:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"assessment","title":"Černý’s examples attain (n−1)²","claim":{"id":"claim-cerny-examples-attain","version":1,"slug":"cerny-examples-attain","title":"Černý’s examples meet the bound"},"fragment":"claim-cerny-examples-attain","assessment":{"id":"cerny-synchronization:report:cerny-examples:v1","entry_id":"cerny-synchronization:entry:cerny-examples:v1","state":"resolved","source_label":"Černý’s examples attain (n−1)²","scope":"Only the exact statement and passage cited here; not an independent OpenMath assessment.","source_date":null,"observed_on":"2026-10-21","evidence_url":"https://arxiv.org/html/2607.19675v1","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-952b51ac032cba5217d3","entry_id":"cerny-synchronization:entry:cerny-examples:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"question","title":"Černý synchronization conjecture","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-48d80f69c3910d8358ba","entry_id":"cerny-synchronization:entry:cerny-examples:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"statement","title":"Černý’s examples meet the bound","claim":{"id":"claim-cerny-examples-attain","version":1,"slug":"cerny-examples-attain","title":"Černý’s examples meet the bound"},"fragment":"claim-cerny-examples-attain","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-19530a1e0a6497217037","entry_id":"cerny-synchronization:entry:circular:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"assessment","title":"Older circular case recalled","claim":{"id":"claim-cerny-circular-case","version":1,"slug":"cerny-circular-case","title":"The older level-zero circular case"},"fragment":"claim-cerny-circular-case","assessment":{"id":"cerny-synchronization:report:circular:v1","entry_id":"cerny-synchronization:entry:circular:v1","state":"resolved","source_label":"Older circular case recalled","scope":"A letter acts as a cycle on all n states, so ℓ = 0.","source_date":"2026-07-22","observed_on":"2026-10-14","evidence_url":"https://arxiv.org/html/2607.19675v1","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-9507475d8a56819bbaa1","entry_id":"cerny-synchronization:entry:circular:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"milestone","title":"Circular automata satisfy the bound","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-15a66d6b5d7f436c3bd4","entry_id":"cerny-synchronization:entry:circular:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"question","title":"Černý synchronization conjecture","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-f5696e8837fc7a1ea5c7","entry_id":"cerny-synchronization:entry:circular:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"statement","title":"The older level-zero circular case","claim":{"id":"claim-cerny-circular-case","version":1,"slug":"cerny-circular-case","title":"The older level-zero circular case"},"fragment":"claim-cerny-circular-case","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-54af3ecc0fa055c4a87b","entry_id":"cerny-synchronization:entry:positive-level:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"assessment","title":"Positive-level one-cluster theorem reported","claim":{"id":"claim-cerny-relative-extension","version":1,"slug":"cerny-relative-extension","title":"Relative extending words on the unique cycle"},"fragment":"claim-cerny-relative-extension","assessment":{"id":"cerny-synchronization:report:positive-level:v1","entry_id":"cerny-synchronization:entry:positive-level:v1","state":"resolved","source_label":"Positive-level one-cluster theorem reported","scope":"Synchronizing, unique a-cycle, least level ℓ ≥ 1.","source_date":"2026-07-22","observed_on":"2026-10-14","evidence_url":"https://arxiv.org/html/2607.19675v1","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-f27386702e36f648db23","entry_id":"cerny-synchronization:entry:positive-level:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"assessment","title":"Positive-level one-cluster theorem reported","claim":{"id":"claim-cerny-positive-level-one-cluster","version":1,"slug":"cerny-positive-level-one-cluster","title":"The bound for positive-level one-cluster automata"},"fragment":"claim-cerny-positive-level-one-cluster","assessment":{"id":"cerny-synchronization:report:positive-level:v1","entry_id":"cerny-synchronization:entry:positive-level:v1","state":"resolved","source_label":"Positive-level one-cluster theorem reported","scope":"Synchronizing, unique a-cycle, least level ℓ ≥ 1.","source_date":"2026-07-22","observed_on":"2026-10-14","evidence_url":"https://arxiv.org/html/2607.19675v1","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-788b7731f830b57310e6","entry_id":"cerny-synchronization:entry:positive-level:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"bound","title":"Reset threshold","claim":{"id":"claim-cerny-positive-level-one-cluster","version":1,"slug":"cerny-positive-level-one-cluster","title":"The bound for positive-level one-cluster automata"},"fragment":"claim-cerny-positive-level-one-cluster","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-4ffe9af9f012d26202e6","entry_id":"cerny-synchronization:entry:positive-level:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"connection","title":"The positive-level one-cluster theorem reaches the conjectured bound within its restricted class.","claim":null,"fragment":"connections","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-0822e436ec67ae141ad8","entry_id":"cerny-synchronization:entry:positive-level:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"definition","title":"One-cluster letter and level","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-b804dc9e5f23a3651a90","entry_id":"cerny-synchronization:entry:positive-level:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"milestone","title":"Positive-level spectral proof is published","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-7a0133bab8949f62ab78","entry_id":"cerny-synchronization:entry:positive-level:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"proof","title":"Extend a subset until the cycle is covered","claim":{"id":"claim-cerny-positive-level-one-cluster","version":1,"slug":"cerny-positive-level-one-cluster","title":"The bound for positive-level one-cluster automata"},"fragment":"claim-cerny-positive-level-one-cluster","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-c5883cb7103a25719762","entry_id":"cerny-synchronization:entry:positive-level:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"question","title":"Černý synchronization conjecture","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-6ff2dc58ed4cdb55efd5","entry_id":"cerny-synchronization:entry:positive-level:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"reading","title":"Read the exact positive-level hypotheses and spectral proof.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-f35e4d5dd21c3c73a11c","entry_id":"cerny-synchronization:entry:positive-level:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"scope","title":"Positive-level theorem","claim":{"id":"claim-cerny-positive-level-one-cluster","version":1,"slug":"cerny-positive-level-one-cluster","title":"The bound for positive-level one-cluster automata"},"fragment":"claim-cerny-positive-level-one-cluster","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-784f1a8708ec18dabc8d","entry_id":"cerny-synchronization:entry:positive-level:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"statement","title":"The bound for positive-level one-cluster automata","claim":{"id":"claim-cerny-positive-level-one-cluster","version":1,"slug":"cerny-positive-level-one-cluster","title":"The bound for positive-level one-cluster automata"},"fragment":"claim-cerny-positive-level-one-cluster","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-c3b59185858faf6c86b8","entry_id":"cerny-synchronization:entry:positive-level:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"statement","title":"Relative extending words on the unique cycle","claim":{"id":"claim-cerny-relative-extension","version":1,"slug":"cerny-relative-extension","title":"Relative extending words on the unique cycle"},"fragment":"claim-cerny-relative-extension","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-a1ee3dc4623e38509649","entry_id":"cerny-synchronization:entry:question:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"assessment","title":"General Černý conjecture remains open","claim":{"id":"claim-cerny-quadratic-bound","version":1,"slug":"cerny-quadratic-bound","title":"The general quadratic reset-word conjecture"},"fragment":"claim-cerny-quadratic-bound","assessment":{"id":"cerny-synchronization:report:general:v1","entry_id":"cerny-synchronization:entry:question:v1","state":"reported_open","source_label":"General Černý conjecture remains open","scope":"All complete synchronizing deterministic finite automata.","source_date":"2026-07-22","observed_on":"2026-10-14","evidence_url":"https://arxiv.org/html/2607.19675v1","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-65ac28ce20ef7a114f9b","entry_id":"cerny-synchronization:entry:question:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"connection","title":"The positive-level one-cluster theorem reaches the conjectured bound within its restricted class.","claim":null,"fragment":"connections","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-a76b31fa032568dca4d4","entry_id":"cerny-synchronization:entry:question:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"definition","title":"Reset word","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-c06b6fe98574c120470f","entry_id":"cerny-synchronization:entry:question:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"definition","title":"One-cluster letter and level","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-12f95c2231c7d0ae48c2","entry_id":"cerny-synchronization:entry:question:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"milestone","title":"Černý’s reset-word question","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-562a6674fe61050ffad4","entry_id":"cerny-synchronization:entry:question:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"question","title":"Černý synchronization conjecture","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-e16137a1ed8381b79e29","entry_id":"cerny-synchronization:entry:question:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"reading","title":"Understand reset words and the one-cluster restriction.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-89bcc5e39eb34e481f7e","entry_id":"cerny-synchronization:entry:question:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"scope","title":"General conjecture","claim":{"id":"claim-cerny-quadratic-bound","version":1,"slug":"cerny-quadratic-bound","title":"The general quadratic reset-word conjecture"},"fragment":"claim-cerny-quadratic-bound","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-e6ccbf6d855b96c5f35e","entry_id":"cerny-synchronization:entry:question:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"statement","title":"The general quadratic reset-word conjecture","claim":{"id":"claim-cerny-quadratic-bound","version":1,"slug":"cerny-quadratic-bound","title":"The general quadratic reset-word conjecture"},"fragment":"claim-cerny-quadratic-bound","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-2911afda874b5074cd6d","entry_id":"cerny-synchronization:entry:sharpness:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"assessment","title":"Exact reset threshold for the binary family","claim":{"id":"claim-cerny-one-cluster-sharp-family","version":1,"slug":"cerny-one-cluster-sharp-family","title":"A family attaining the parameter-dependent bound"},"fragment":"claim-cerny-one-cluster-sharp-family","assessment":{"id":"cerny-synchronization:report:sharpness:v1","entry_id":"cerny-synchronization:entry:sharpness:v1","state":"resolved","source_label":"Exact reset threshold for the binary family","scope":"For every n ≥ 4, rt(F_n) = 3n−5.","source_date":"2026-07-22","observed_on":"2026-10-14","evidence_url":"https://arxiv.org/html/2607.19675v1","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-7ce6c242352e32c3ffee","entry_id":"cerny-synchronization:entry:sharpness:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"bound","title":"Reset threshold of F_n","claim":{"id":"claim-cerny-one-cluster-sharp-family","version":1,"slug":"cerny-one-cluster-sharp-family","title":"A family attaining the parameter-dependent bound"},"fragment":"claim-cerny-one-cluster-sharp-family","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-2e2fe59d959fe6fabfe6","entry_id":"cerny-synchronization:entry:sharpness:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"construction","title":"A four-state member of the sharp family","claim":{"id":"claim-cerny-one-cluster-sharp-family","version":1,"slug":"cerny-one-cluster-sharp-family","title":"A family attaining the parameter-dependent bound"},"fragment":"claim-cerny-one-cluster-sharp-family","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-fd751d010446cdce3bbc","entry_id":"cerny-synchronization:entry:sharpness:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"milestone","title":"Positive-level spectral proof is published","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-9ba8fea9ca6863a79a48","entry_id":"cerny-synchronization:entry:sharpness:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"question","title":"Černý synchronization conjecture","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-44f4f690aea96609ed1e","entry_id":"cerny-synchronization:entry:sharpness:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"reading","title":"Inspect the sharp family, its transitions and matching lower bound.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-ffaa9bb5fda4eee0703e","entry_id":"cerny-synchronization:entry:sharpness:v1","problem":{"slug":"cerny-synchronization","title":"Černý synchronization conjecture","publication_version":4},"kind":"statement","title":"A family attaining the parameter-dependent bound","claim":{"id":"claim-cerny-one-cluster-sharp-family","version":1,"slug":"cerny-one-cluster-sharp-family","title":"A family attaining the parameter-dependent bound"},"fragment":"claim-cerny-one-cluster-sharp-family","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}