MétaCan
Menu
Back to cohort
Record W2946183952

Noisy random boolean networks and cell differentiation

2010· article· en· W2946183952 on OpenAlex
Marco Villani, Roberto Serra, A. Barbieri, Andrea Roli, Stuart Kauffman, Annamaria Colacci

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

VenueArchivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) · 2010
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGene Regulatory Network Analysis
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsComputer scienceBoolean networkBoolean functionAnd-inverter graphBoolean circuitTheoretical computer scienceAlgorithm
DOInot available

Abstract

fetched live from OpenAlex

We propose a modification of the Random Boolean Network model where noise is allowed, in such a way that in its asymptotic state the system can visit several attractors of the deterministic dynamics. The notion of Threshold Ergodic Sets (TES) is introduced, and it is proposed that they represent cell types. The degree of differentiation of a cell is related to the number of attractors which belong to its TES, and it shown that this leads to a meaningful description of cell differentiation. By coupling the threshold, which is related to the level of noise, to mutations which may interfere with the control mechanisms of the cell, a description of the the process of cell transformation, from normal to malignant, is provided. This description, albeit abstract, is consistent with several known experimental facts.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.675
Threshold uncertainty score1.000

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.0000.001
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.005
GPT teacher head0.190
Teacher spread0.185 · 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