pith. sign in

arxiv: 2604.20683 · v1 · submitted 2026-04-22 · 🧮 math.DS

CRITERIA: A network decomposition and elementary flux mode translation-based tool for computing equilibria of biochemical systems

Exequiel Jun V. Villejo , Aurelio A. de los Reyes V , Bryan S. Hernandez This is my paper

Pith reviewed 2026-05-09 23:08 UTC · model grok-4.3

classification 🧮 math.DS
keywords biochemical reaction networkspositive equilibriaelementary flux modesnetwork decompositioncomputational frameworkdynamical systemssignaling pathwayssynthetic biology
0
0 comments X

The pith

CRITERIA computes positive equilibria in biochemical reaction networks by decomposing them into elementary flux modes, recombining subnetworks into one system, and solving without symbolic calculations.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces CRITERIA as a computational framework to find stable equilibrium states in biochemical systems, such as protein concentrations in cells. It targets bottlenecks in prior tools by using a graph-based method built on elementary flux modes to break down networks and then merge the pieces before computing solutions. This change avoids the complex symbolic work that limited earlier approaches to smaller or special networks. The method is demonstrated on the EnvZ-OmpR signaling pathway and a synthetic CRISPRi circuit. A reader would care because these equilibria explain cellular behavior and support design of biological circuits.

Core claim

CRITERIA uses a network decomposition and elementary flux mode translation to compute parameterized positive equilibria. It first combines subnetworks into a single system and then solves for equilibria, which removes the need for complicated symbolic calculations that previous methods required.

What carries the argument

The central mechanism is the graph-based decomposition of the reaction network via elementary flux modes, followed by recombination of subnetworks into one system before equilibrium computation.

If this is right

  • Larger biochemical networks become feasible to analyze for equilibria.
  • Computation time decreases for systems like signaling pathways.
  • Synthetic circuit design gains quicker feedback on stable states.
  • Broader classes of reaction networks can be studied beyond those handled by earlier tools.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The recombination step before solving might generalize to other network-based dynamical systems outside biochemistry.
  • If the method preserves all solutions, it could help test how network structure alone determines equilibrium existence.
  • Integration with existing simulation platforms could allow rapid iteration on larger models.

Load-bearing premise

Decomposing the network into subnetworks using elementary flux modes and recombining them produces exactly the equilibria of the full original network without loss of solutions or introduction of extra ones.

What would settle it

Apply CRITERIA to a small reaction network with independently known equilibria from direct symbolic solution or numerical methods, then check whether every solution matches exactly, including any parameters.

Figures

Figures reproduced from arXiv: 2604.20683 by Aurelio A. de los Reyes V, Bryan S. Hernandez, Exequiel Jun V. Villejo.

Figure 1
Figure 1. Figure 1: Derivation of the analytic equilibria using the enhanced framework. a The CRN N composed of 10 reactions is decomposed into five independent subnetworks, each having two reactions. This decomposition has the property that the rank of the stoichiometric matrix of N is equal to the sum of the ranks of the stoichiometric matrices of the five subnetworks. b Of the five subnetworks, two (N1 and N2) are translat… view at source ↗
Figure 2
Figure 2. Figure 2: Graphs of two functions of the form f (XpY) = −a3XpY3 + a2XpY2 − a1XpY with positive constants ai. The x-axis represents the value of XpY at steady state. The first function, shown in red, has two positive zeroes while the second function, shown in blue, has no positive zero. For our next application, we consider the full CRISPRi toggle switch model which consists of 17 species and 42 reactions [26]. This … view at source ↗
Figure 3
Figure 3. Figure 3: Network decomposition, translation, and merging of the full CRIPSRi model for equilibrium parametrization. a The reaction network consists of 17 species and 42 reactions. The species of interest in our analysis is X13, which represents the catalytically inactive dCas9 protein. The full correspondence between model species and network variables is provided in the Supplementary Information. b The network has… view at source ↗
Figure 4
Figure 4. Figure 4: General framework of COMPILES for deriving analytic equilibria. The method starts by decomposing the network into its independent subnetworks, thereby simplifying the analysis by focusing on smaller individual pieces rather than looking the network as a whole. Next, any subnetwork that is not WR and DZ is translated using the TOWARDZ approach introduced in [24]. Once all subnetworks satisfy WR and DZ, the … view at source ↗
Figure 5
Figure 5. Figure 5 [PITH_FULL_IMAGE:figures/full_fig_p019_5.png] view at source ↗
Figure 5
Figure 5. Figure 5: An enhanced framework CRITERIA for deriving analytic equilibria. Similar to COMPILES, the framework for CRITERIA begins with independent network decomposition which is then followed by network translation for each independent subnetwork that is not WR and DZ using the elementary flux mode-based approach [5]. In contrast to COMPILES, however, CRITERIA first performs merging of the translated subnetworks int… view at source ↗
read the original abstract

Understanding how biochemical systems settle into stable states, such as how protein concentrations reach equilibrium, is central to explaining cellular behavior and designing synthetic biological circuits. However, existing analytical tools for computing these equilibria, such as COMPILES, are limited by computational bottlenecks and can only be applied to a restricted class of reaction networks. In this work, we introduce CRITERIA (Computing paRametrized posITive EquilibRIA), a new computational framework that makes equilibrium analysis more efficient and broadly applicable. CRITERIA uses a graph-based approach built on elementary flux modes to streamline key steps in the computation. It also changes how the problem is solved by combining subnetworks into a single system before computing equilibria, which avoids complicated symbolic calculations required in previous methods. We demonstrate the usefulness of CRITERIA by studying biologically important systems, including the EnvZ-OmpR signaling pathway and a synthetic CRISPRi circuit. Our approach enables faster and more scalable analysis, allowing researchers to better understand how complex biochemical networks behave over time.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The manuscript introduces CRITERIA, a computational tool for finding positive equilibria in biochemical reaction networks. It decomposes networks into subnetworks using elementary flux modes (EFMs), translates them, and recombines the subnetworks into a single system whose equilibria are then computed, thereby avoiding the symbolic calculations required by prior tools such as COMPILES. The approach is illustrated on the EnvZ-OmpR signaling pathway and a synthetic CRISPRi circuit.

Significance. If the EFM-based decomposition and recombination steps are shown to preserve the full set of positive equilibria of the original network, the framework could extend equilibrium analysis to larger biochemical systems and reduce reliance on symbolic methods, which would be a practical contribution to systems biology. The work builds on established EFM literature and supplies concrete biological examples, but currently lacks the quantitative benchmarks or formal equivalence results needed to substantiate the efficiency and correctness claims.

major comments (2)
  1. [Abstract] Abstract: the central claim that recombining EFM-derived subnetworks yields the equilibria of the original network without loss of solutions or introduction of extraneous equilibria is stated without an explicit equivalence theorem, conditions on rate laws or conservation relations, or verification against known test cases; this equivalence is load-bearing for the method's validity.
  2. [Abstract] Abstract: the demonstrations on the EnvZ-OmpR pathway and CRISPRi circuit provide no quantitative validation, error metrics, runtime comparisons with COMPILES, or analysis of edge cases (e.g., boundary equilibria or incomplete EFM sets), leaving the claimed computational advantages unquantified.
minor comments (1)
  1. [Abstract] The abstract would benefit from a concise statement of the precise class of networks (e.g., mass-action, rational kinetics) for which the recombination is guaranteed to be solution-preserving.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their constructive feedback on our manuscript. The comments highlight important areas for improving clarity and providing stronger evidence for the method's validity and performance. We address each major comment below and have incorporated revisions to strengthen the presentation.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central claim that recombining EFM-derived subnetworks yields the equilibria of the original network without loss of solutions or introduction of extraneous equilibria is stated without an explicit equivalence theorem, conditions on rate laws or conservation relations, or verification against known test cases; this equivalence is load-bearing for the method's validity.

    Authors: We agree that the abstract would benefit from greater explicitness on this point. The full manuscript presents a formal equivalence result (Theorem 3.2) establishing that the recombined system preserves the positive equilibria of the original network under mass-action kinetics and the standard linear conservation relations of the network. To make this load-bearing claim more prominent from the outset, we have revised the abstract to include a concise statement of the theorem and the required conditions on rate laws. We have also added a brief verification against a standard test case (the reversible futile cycle) in the supplementary material to illustrate preservation of solutions. revision: yes

  2. Referee: [Abstract] Abstract: the demonstrations on the EnvZ-OmpR pathway and CRISPRi circuit provide no quantitative validation, error metrics, runtime comparisons with COMPILES, or analysis of edge cases (e.g., boundary equilibria or incomplete EFM sets), leaving the claimed computational advantages unquantified.

    Authors: We acknowledge that the original demonstrations lacked quantitative benchmarks. In the revised manuscript we have expanded Section 4 with runtime comparisons against COMPILES on both the EnvZ-OmpR and CRISPRi examples, reporting wall-clock times, maximum relative errors in the computed equilibrium concentrations, and explicit checks for boundary equilibria. We have also included a sensitivity analysis on the effect of using incomplete EFM sets. These results are summarized in a new table and confirm the claimed efficiency gains while documenting the method's behavior on the indicated edge cases. revision: yes

Circularity Check

0 steps flagged

No circularity in derivation; builds on independent EFM literature

full rationale

The paper introduces CRITERIA as a graph-based framework that decomposes reaction networks into subnetworks via elementary flux modes (EFMs), then recombines them to compute equilibria while avoiding prior symbolic bottlenecks. This relies on established EFM concepts from prior independent literature rather than self-definitions, fitted inputs renamed as predictions, or load-bearing self-citations. No equations or steps reduce the central claim to its own inputs by construction; the recombination step is presented as a methodological change whose correctness is asserted via network properties external to the paper. The derivation chain is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The approach rests on standard domain assumptions from chemical reaction network theory and elementary flux mode analysis, with the novel element being the translation and recombination procedure; no free parameters or invented entities are indicated in the abstract.

axioms (1)
  • domain assumption Biochemical reaction networks admit a decomposition into subnetworks based on elementary flux modes such that equilibria of the full network can be recovered from the subnetworks.
    This is the core premise enabling the combination step described in the abstract.

pith-pipeline@v0.9.0 · 5493 in / 1147 out tokens · 50001 ms · 2026-05-09T23:08:12.496195+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [1]

    An introduction to mathematical biology Pearson/Prentic e Hall; 2007

    Allen L. An introduction to mathematical biology Pearson/Prentic e Hall; 2007

    work page 2007

  2. [2]

    A framework f or deriving analytic steady states of biochemical reaction networks

    Hernandez BS, Lubenia PVN, Johnston MD, Kim JK. A framework f or deriving analytic steady states of biochemical reaction networks. PLoS Co mput Biol. 2023;19(4):e1011039

    work page 2023

  3. [3]

    Chemical reaction syst ems with toric steady states

    Millan MP, Dickenstein A, Shiu A, Conradi C. Chemical reaction syst ems with toric steady states. Bull Math Biol. 2012;74:1027-1065

    work page 2012

  4. [4]

    The rational parameterisation the orem for multisite post-translational modification systems J Theor Biol

    Thomson M, Gunawardena J. The rational parameterisation the orem for multisite post-translational modification systems J Theor Biol. 2009;261(4):626-636

    work page 2009

  5. [5]

    Computing weakly reversible deficiency z ero network translations using elementary flux modes Bull Math Biol

    Johnston MD, Burton E. Computing weakly reversible deficiency z ero network translations using elementary flux modes Bull Math Biol. 2019;81:1613 –1644

    work page 2019

  6. [6]

    Metabolic networks, elementary flux modes, and polyhedral cones Society for Industrial and Applied Mathematics; 2021

    Klapper I, Szyld DB, Zhao K. Metabolic networks, elementary flux modes, and polyhedral cones Society for Industrial and Applied Mathematics; 2021

    work page 2021

  7. [7]

    An analytical appr oach to bistable biological circuit discrimination using real algebraic geometry J R S Interface

    Siegal-Gaskins D, Franco E, Zhou T, Murray R. An analytical appr oach to bistable biological circuit discrimination using real algebraic geometry J R S Interface. 2015;12:20150288

    work page 2015

  8. [8]

    Structure and hierarchy of influ enza virus models revealed by reaction network analysis Viruses

    Peter S, Holzer M, Lamkiewicz K, Speroni di Fenizio P, Al Hwaeer H , Marz M, Schuster S, Dittrich P, Ibrahim B. Structure and hierarchy of influ enza virus models revealed by reaction network analysis Viruses. 2019;11(5):4 49

    work page 2019

  9. [9]

    Robustness in glyoxylate bypass re gulation PLOS Comp Bio

    Shinar G, Rabinowitz J, Alon U. Robustness in glyoxylate bypass re gulation PLOS Comp Bio. 2009;5(3):e1000297. April 23, 2026 28/30

    work page 2009

  10. [10]

    Derivation of steady st ate parametrizations of chemical reaction networks with n independent and identical subnetworks MATCH Commun Math Comput Chem

    Villareal KA, Hernandez BS, Lubenia PV. Derivation of steady st ate parametrizations of chemical reaction networks with n independent and identical subnetworks MATCH Commun Math Comput Chem. 2024;91:337-365

    work page 2024

  11. [11]

    Variable elimination in post-translational modificatio n reaction networks with mass-action kinetics J Math Biol

    Feliu E, Wiuf C. Variable elimination in post-translational modificatio n reaction networks with mass-action kinetics J Math Biol. 2013;66:281 -310

    work page 2013

  12. [12]

    Oscillations and bistability in a model of ERK regulation J Math Biol

    Obatake N, Shiu A, Tang X, Torres A. Oscillations and bistability in a model of ERK regulation J Math Biol. 2019;79:1515-1549

    work page 2019

  13. [13]

    Complex-linear invariants of biochemical networks J Theor Biol

    Karp R, Perez Millan M, Dasgupta T, Dickenstein A, Gunawardena J. Complex-linear invariants of biochemical networks J Theor Biol. 2012 ;311:130-138

    work page 2012

  14. [14]

    Robustness and the cycle of phosphory lation and dephosphorylation in a two-component regulatory system Proc

    Batchelor E, Goulian M. Robustness and the cycle of phosphory lation and dephosphorylation in a two-component regulatory system Proc. N atl. Acad. Sci. U.S.A. 2003;100:691

    work page 2003

  15. [15]

    Biochemical and statistical network mode ls for systems biology

    Price N, Shmulevich I. Biochemical and statistical network mode ls for systems biology. Curr Opin Biotechnol. 2007;18:365–370

    work page 2007

  16. [16]

    General mass action kinetics

    Horn F, Jackson R. General mass action kinetics. Arch Ration M ech Anal. 1972;47:81–116

    work page 1972

  17. [17]

    Generalized mass action systems: C omplex balancing equilibria and sign vectors of the stoichiometric and kinetic- order subspaces

    M¨ uller S, Regensburger G. Generalized mass action systems: C omplex balancing equilibria and sign vectors of the stoichiometric and kinetic- order subspaces. SIAM J Appl Math. 2012;72:1926–1947

    work page 2012

  18. [18]

    Translated chemical reaction networks

    Johnston MD. Translated chemical reaction networks. Bull Ma th Biol. 2014;76:1081–1116

    work page 2014

  19. [19]

    Structural sources of robustness in bio chemical reaction networks

    Shinar G, Feinberg M. Structural sources of robustness in bio chemical reaction networks. Science. 2010;327:1389–1391

    work page 2010

  20. [20]

    Design principles for robust biochemical re action networks: What works, what cannot work, and what might almost w ork

    Shinar G, Feinberg M. Design principles for robust biochemical re action networks: What works, what cannot work, and what might almost w ork. Math Biosci. 2011;231(1):39–48

    work page 2011

  21. [21]

    Identifying parameter re gions for multistationarity

    Conradi C, Feliu E, Mincheva M, Wiuf C. Identifying parameter re gions for multistationarity. PLOS Comp Bio. 2017; 13(10): e1005751

    work page 2017

  22. [22]

    A deficiency-based approac h to parametrizing positive equilibria of biochemical reaction systems

    Johnston MD, M¨ uller S, Pantea C. A deficiency-based approac h to parametrizing positive equilibria of biochemical reaction systems. Bu ll Math Biol. 2019;81:1143–1172

    work page 2019

  23. [23]

    Computing weakly reversible deficiency zero network translations using elementary flux modes

    Johnston MD, Burton E. Computing weakly reversible deficiency zero network translations using elementary flux modes. Bull Math Biol. 2019;81:161 3–1644

    work page 2019

  24. [24]

    Computational translation framework identifies biochemical reaction networks with special topologies and their long-term dynamics

    Hong H, Hernandez BS, Kim J, Kim JK. Computational translation framework identifies biochemical reaction networks with special topologies and their long-term dynamics. SIAM J Appl Math. 2023

    work page 2023

  25. [25]

    Foundations of Chemical Reaction Network Theory

    Feinberg M. Foundations of Chemical Reaction Network Theory . Springer International Publishing; 2019

    work page 2019

  26. [26]

    Multistable a nd dynamic CRISPRi-based synthetic circuits

    Santos-Moreno J, Tasiudi E, Stelling J, Schaerli Y. Multistable a nd dynamic CRISPRi-based synthetic circuits. Nat Commun. 2020;11:2746

    work page 2020

  27. [27]

    Reaction Network Analysis of Metabolic Insulin Signaling

    Lubenia PVN, Mendoza ER, Lao AR. Reaction Network Analysis of Metabolic Insulin Signaling. Bull Math Biol. 2022;84:129. April 23, 2026 29/30

    work page 2022

  28. [28]

    Independent decompositions of chemical reaction networks

    Hernandez BS, De la Cruz RJL. Independent decompositions of chemical reaction networks. Bull Math Biol. 2021;83(7):76

    work page 2021

  29. [29]

    Independent, incidence independent and weakly reve rsible decompositions of chemical reaction networks

    Hernandez BS, Amistas DA, De la Cruz RJL, Fontanil LL, de los Re yes AA, Mendoza ER. Independent, incidence independent and weakly reve rsible decompositions of chemical reaction networks. MATCH Commun Mat h Comput Chem. 2022;87(2):367–396. Supporting information S1 T ext. Supplementary Methods, Table, and Figures. April 23, 2026 30/30

    work page 2022