Gene Networks of Fully Connected Triads with Complete Auto-Activation Enable Multistability and Stepwise Stochastic Transitions
Bibliographic record
Abstract
Fully-connected triads (FCTs), such as the Oct4-Sox2-Nanog triad, have been implicated as recurring transcriptional motifs embedded within the regulatory networks that specify and maintain cellular states. To explore the possible connections between FCT topologies and cell fate determinations, we employed computational network screening to search all possible FCT topologies for multistability, a dynamic property that allows the rise of alternate regulatory states from the same transcriptional network. The search yielded a hierarchy of FCTs with various potentials for multistability, including several topologies capable of reaching eight distinct stable states. Our analyses suggested that complete auto-activation is an effective indicator for multistability, and, when gene expression noise was incorporated into the model, the networks were able to transit multiple states spontaneously. Different levels of stochasticity were found to either induce or disrupt random state transitioning with some transitions requiring layovers at one or more intermediate states. Using this framework we simulated a simplified model of induced pluripotency by including constitutive overexpression terms. The corresponding FCT showed random state transitioning from a terminal state to the pluripotent state, with the temporal distribution of this transition matching published experimental data. This work establishes a potential theoretical framework for understanding cell fate determinations by connecting conserved regulatory modules with network dynamics. Our results could also be employed experimentally, using established developmental transcription factors as seeds, to locate cell lineage specification networks by using auto-activation as a cipher.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".