A Life-like Virtual Cell Membrane Using Discrete Automata
Bibliographic record
Abstract
A framework is presented that captures the discrete and probabilistic nature of molecular transport and reaction kinetics found in a living cell as well as formally representing the spatial distribution of these phenomena. This particle or agent-based approach is computationally robust and complements established methods. Namely it provides a higher level of spatial resolution than formulations based on ordinary differential equations (ODE) while offering significant advantages in computational efficiency over molecular dynamics (MD). Using this framework, a model cell membrane has been constructed with discrete particle agents that respond to local component interactions that resemble flocking or herding behavioral cues in animals. Results from simulation experiments are presented where this model cell exhibits many of the characteristic behaviors associated with its biological counterpart such as lateral diffusion, response to osmotic pressure gradients, membrane growth and cell division. Lateral diffusion rates and estimates for the membrane modulus of elasticity derived from these simple experiments fall well within a biologically relevant range of values. More importantly, these estimates were obtained by applying a simple qualitative tuning of the model membrane. Membrane growth was simulated by injecting precursor molecules into the proto-cell at different rates and produced a variety of morphologies ranging from a single large cell to a cluster of cells. The computational scalability of this methodology has been tested and results from benchmarking experiments indicate that real-time simulation of a complete bacterial cell will be possible within 10 years.
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.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".