Modeling signaling-dependent pluripotent cell states with boolean logic can predict cell fate transitions
Bibliographic record
Abstract
Pluripotent stem cells (PSCs) exist in multiple stable states, each with specific cellular properties and molecular signatures. The process by which pluripotency is either maintained or destabilized to initiate specific developmental programs is poorly understood. We have developed a model to predict stabilized PSC gene regulatory network (GRN) states in response to combinations of input signals. While previous attempts to model PSC fate have been limited to static cell compositions, our approach enables simulations of dynamic heterogeneity by combining an Asynchronous Boolean Simulation (ABS) strategy with simulated single cell fate transitions using Strongly Connected Components (SCCs). This computational framework was applied to a reverse-engineered and curated core GRN for mouse embryonic stem cells (mESCs) to simulate responses to LIF, Wnt/β-catenin, FGF/ERK, BMP4, and Activin A/Nodal pathway activation. For these input signals, our simulations exhibit strong predictive power for gene expression patterns, cell population composition, and nodes controlling cell fate transitions. The model predictions extend into early PSC differentiation, demonstrating, for example, that a Cdx2-high/Oct4-low state can be efficiently and robustly generated from mESCs residing in a naïve and signal-receptive state sustained by combinations of signaling activators and inhibitors. One Sentence Summary Predictive control of pluripotent stem cell fate transitions
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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".