MétaCan
Menu
Back to cohort
Record W4403465826 · doi:10.1080/17445760.2024.2413509

Cellular automaton model of self-healing

2024· article· en· W4403465826 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal of Parallel Emergent and Distributed Systems · 2024
Typearticle
Languageen
FieldComputer Science
TopicCellular Automata and Applications
Canadian institutionsBrock University
Fundersnot available
KeywordsComputer scienceCellular automatonAsynchronous cellular automatonSelf-healingAutomatonTheoretical computer scienceDistributed computingMobile automatonArtificial intelligenceAutomata theory

Abstract

fetched live from OpenAlex

We propose a simple cellular automaton model of a self-healing system and investigate its properties. In the model, the substrate is a two-dimensional checkerboard configuration which can be damaged by changing values of a finite number of sites. The cellular automaton we consider is a checkerboard voting rule, a binary rule with Moore neighborhood which is topologically conjugate to the majority voting rule. For a single-color damage (when only cells in the same state are modified), the rule always fixes the damage. For a general damage, when it is localized inside a 3×3 square, the rule also fixes it always. When the damage is inside of a larger n×n square, the efficiency of the rule in fixing the damage becomes smaller than 100%, but it remains better than 98% for n≤5 and better than 75% for n≤7. We show that in the limit of infinite n the efficiency tends to zero.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.944
Threshold uncertainty score0.342

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.019
GPT teacher head0.269
Teacher spread0.250 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it