Exact Reconstruction of Conserved Classes under Switching Finite Dynamics and Whole-Bank Sensor Faults: A Certified 165-State Example

We analyze a specified 165-state finite model with four admissible maps and ten conserved components. Three future-only observations admit an explicit five-symbol state probe; a five-clique certifies the minimum alphabet size. Three independent sensor banks are necessary and sufficient to correct one arbitrary whole-bank substitution. For a fixed catalogue of 21 coordinate predicates and the specified probe, exact Bellman computations certify optimal worst-case depth four and twelve internal decision nodes. A standalone Python standard-library verifier independently checks the finite certificates. The contribution is a reproducible finite case study, not a claim of physical realization, a new general coding theorem, or established literature priority. This record contains a mathematical preprint and its reproducibility materials. The manuscript is licensed under Creative Commons Attribution 4.0 International (CC BY 4.0). The accompanying Python verification software is separately licensed under the MIT License. The standalone verifier uses only the Python 3 standard library and runs offline without creating output files. The reference verification reports 30 PASS and 0 FAIL. The mathematical results concern a precisely specified finite model. No physical realization, external peer review, or established literature priority is claimed. The manuscript and accompanying software documentation were prepared with AI assistance (OpenAI ChatGPT). The named author assumes responsibility for the final mathematical content, verification, citations, and publication.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24354079
Primary Topic
Formal Methods in Verification
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Exact Reconstruction of Conserved Classes under Switching Finite Dynamics and Whole-Bank Sensor Faults: A Certified 165-State Example

Ivo Vajc
2 links
Zenodo (CERN European Organization for Nuclear Research)
Formal Methods in Verification
preprint

Exact Reconstruction of Conserved Classes under Switching Finite Dynamics and Whole-Bank Sensor Faults: A Certified 165-State Example

Ivo Vajc
preprint en

Abstract

We analyze a specified 165-state finite model with four admissible maps and ten conserved components. Three future-only observations admit an explicit five-symbol state probe; a five-clique certifies the minimum alphabet size. Three independent sensor banks are necessary and sufficient to correct one arbitrary whole-bank substitution. For a fixed catalogue of 21 coordinate predicates and the specified probe, exact Bellman computations certify optimal worst-case depth four and twelve internal decision nodes. A standalone Python standard-library verifier independently checks the finite certificates. The contribution is a reproducible finite case study, not a claim of physical realization, a new general coding theorem, or established literature priority. This record contains a mathematical preprint and its reproducibility materials. The manuscript is licensed under Creative Commons Attribution 4.0 International (CC BY 4.0). The accompanying Python verification software is separately licensed under the MIT License. The standalone verifier uses only the Python 3 standard library and runs offline without creating output files. The reference verification reports 30 PASS and 0 FAIL. The mathematical results concern a precisely specified finite model. No physical realization, external peer review, or established literature priority is claimed. The manuscript and accompanying software documentation were prepared with AI assistance (OpenAI ChatGPT). The named author assumes responsibility for the final mathematical content, verification, citations, and publication.

Zenodo (CERN European Organization for Nuclear Research)
Formal Methods in Verification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon