arxiv: 2604.14592 · v2 · submitted 2026-04-16 · 🧬 q-bio.MN

Recognition: unknown

Absolute Concentration Robustness of Non-Redundant Zero-One Networks with Conservation Laws

Xinyi Si , Xiaoxian Tang

Authors on Pith no claims yet

Pith reviewed 2026-05-10 10:10 UTC · model grok-4.3

classification 🧬 q-bio.MN

keywords absolute concentration robustnessconservation lawszero-one reaction networksstoichiometric matrixnon-vacuous ACRreaction network theory

0 comments

The pith

Stoichiometric matrices with four or more distinct rows preclude non-vacuous ACR in non-redundant zero-one networks of dimension at most two.

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

The paper examines how conservation laws influence absolute concentration robustness, where the concentration of a species remains fixed across all steady states. It proves that augmenting a network with one new species linearly dependent on the originals eliminates non-vacuous ACR for generic rate constants. It further shows that nondegenerate non-redundant zero-one networks of dimension at most two lose non-vacuous ACR whenever their stoichiometric matrix contains four or more distinct rows. A sympathetic reader cares because this identifies structural barriers that stop certain biological reaction systems from maintaining fixed concentrations independent of other parameters.

Core claim

For nondegenerate non-redundant zero-one networks of dimension at most two, the stoichiometric matrix having at least four distinct rows implies the network has no non-vacuous ACR for any generic choice of rate constants. Separately, any network with conservation laws, when augmented by one new species dependent on the existing ones, yields a resulting network with no non-vacuous ACR for generic rate constants on the new reactions.

What carries the argument

The number of distinct rows in the stoichiometric matrix, which determines whether non-vacuous ACR survives under generic rates in these networks.

If this is right

Many conservation laws block non-vacuous ACR in non-redundant zero-one reaction networks.
Networks can be classified by the count of distinct stoichiometric rows to decide if ACR is possible.
The augmentation criterion shows that adding a dependent species systematically removes non-vacuous ACR.

Where Pith is reading between the lines

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

The row-count threshold may offer a template for checking ACR absence in networks of higher dimension.
Biological models relying on zero-one kinetics with conservation laws are unlikely to support robust fixed concentrations unless the row count stays low.

Load-bearing premise

The networks under consideration are nondegenerate and non-redundant zero-one networks of dimension at most two with rate constants chosen generically.

What would settle it

A concrete counterexample would be any nondegenerate non-redundant zero-one network of dimension two whose stoichiometric matrix has four or more distinct rows yet still possesses non-vacuous ACR for some generic rate constants.

read the original abstract

Absolute concentration robustness (ACR) means the concentration of certain species stays the same in all the steady states. In this work, we study how conservation laws might effect non-vacuous ACR in reaction networks. The goal is to show whether non-vacuous ACR can be preserved or precluded by adding species that depend on the existing species. We have the following two main results. (i) For networks with conservation laws, we prove a criterion: for a nondegenerate network, augmenting it with one new species that depends on the original species leads to the resulting network having no non-vacuous ACR for any generic choice of rate constants in the new species. (ii) We characterize all non-redundant zero-one networks with dimension of at most two that exhibit non-vacuous ACR for any generic choice of rate constants according to the number of distinct rows in the stoichiometric matrices. An important finding is that if there are at least four distinct rows in the stoichiometric matrix, then the corresponding network has no non-vacuous ACR for any generic choice of rate constants, which implies that many conservation laws prevent non-vacuous ACR in non-redundant zero-one reaction networks.

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.

Desk Editor's Note private letter to a colleague

The paper gives a general augmentation criterion that kills non-vacuous ACR when you add one dependent species, plus a clean row-count characterization for small zero-one networks.

read the letter

The main things to know are that the authors prove an augmentation result: for a nondegenerate network with conservation laws, adding one new species that depends on the originals produces a network with no non-vacuous ACR for generic rate constants. They also give a full classification of non-redundant zero-one networks with stoichiometric dimension at most two, showing that four or more distinct rows in the stoichiometric matrix rules out non-vacuous ACR for generic rates. This last point directly implies that many conservation laws block ACR in these networks. Both results are stated in terms of the stoichiometric matrix and linear algebra rather than specific parameter fits, which keeps them applicable to model construction. The augmentation criterion is the broader of the two and could be checked on existing networks without re-deriving everything from scratch. The row-count threshold is a simple combinatorial test that works for the zero-one case they consider. The paper stays within its stated scope of nondegenerate, non-redundant zero-one networks and generic rates, so the claims do not overreach. The main limitations are the restriction to dimension two or less for the characterization and the zero-one stoichiometry assumption. The augmentation result itself is not limited to low dimension, but the paper does not extend the classification beyond that or consider adding multiple species at once. Genericity leaves special parameter values unaddressed, which is standard but worth noting when applying the criteria. The proofs rest on case analysis of steady-state polynomials, which is feasible here and appears to hold without internal gaps. This is useful for systems biologists who work with stoichiometric models and want concrete tests for when ACR can or cannot occur. A reader already familiar with ACR and conservation laws will be able to apply the criteria to small networks right away. It deserves peer review because the statements are precise, the approach is standard in the field, and the results give testable conditions rather than vague robustness claims. Send it to referees.

Referee Report

2 major / 3 minor

Summary. The paper studies absolute concentration robustness (ACR) in non-redundant zero-one reaction networks subject to conservation laws. It establishes two main results: (i) a criterion showing that, for a nondegenerate network, augmenting it by one new species that is linearly dependent on the original species yields an augmented network with no non-vacuous ACR for any generic choice of the new rate constants; (ii) a complete characterization, by the number of distinct rows in the stoichiometric matrix, of all non-redundant zero-one networks of stoichiometric dimension at most two that admit non-vacuous ACR for generic rate constants, with the key finding that four or more distinct rows precludes non-vacuous ACR.

Significance. If the stated theorems hold, the work supplies an explicit, low-dimensional classification of when conservation laws force the absence of non-vacuous ACR in zero-one networks. The augmentation result is a clean structural statement that may extend beyond the zero-one setting, while the row-count criterion offers a readily checkable obstruction. Both rest on standard linear-algebraic and genericity arguments over stoichiometric matrices rather than on fitted parameters, which strengthens their potential utility for systems-biology model reduction.

major comments (2)

The augmentation theorem (result (i)) is stated for nondegenerate networks; the manuscript should explicitly verify that the genericity argument remains valid when the original network is degenerate, or else clarify why degeneracy is excluded from the claim, because degeneracy could alter the steady-state polynomial degrees that underlie the no-ACR conclusion.
In the characterization of dimension-at-most-two networks (result (ii)), the case analysis for stoichiometric matrices with four or more distinct rows is load-bearing for the central claim that many conservation laws preclude non-vacuous ACR. The manuscript should confirm that every possible configuration of four or more distinct rows (including repeated linear dependencies among the rows) is covered by the enumerated cases, and that the steady-state polynomials are shown to lack the required monomial structure for ACR.

minor comments (3)

The abstract announces two theorems but does not label them or point to their statements in the body; adding explicit theorem numbers and section references would improve readability.
Definitions of 'non-vacuous ACR', 'non-redundant', and 'nondegenerate' appear late; moving concise versions to the introduction would help readers follow the genericity arguments.
Several stoichiometric matrices in the examples are described only by their row counts; displaying the actual matrices (or at least their distinct-row patterns) would make the case analysis easier to verify.

Simulated Author's Rebuttal

2 responses · 0 unresolved

Thank you for the opportunity to respond to the referee's report. We are grateful for the positive assessment of the significance of our work and for the constructive major comments. We address each of them in turn below, indicating where revisions will be made to strengthen the manuscript.

read point-by-point responses

Referee: The augmentation theorem (result (i)) is stated for nondegenerate networks; the manuscript should explicitly verify that the genericity argument remains valid when the original network is degenerate, or else clarify why degeneracy is excluded from the claim, because degeneracy could alter the steady-state polynomial degrees that underlie the no-ACR conclusion.

Authors: We agree that the manuscript would benefit from an explicit clarification on this point. Our focus on nondegenerate networks stems from the fact that degeneracy implies linear dependencies in the reaction vectors that can reduce the effective dimension or introduce common factors in the steady-state equations, potentially affecting the genericity of the no-ACR result. The proof of the augmentation theorem relies on the nondegeneracy assumption to ensure that the augmented network's steady-state polynomials maintain the necessary degree and independence properties for the genericity argument to apply. We will revise the manuscript to include a short paragraph explaining this rationale and noting that degenerate cases fall outside the scope of the current classification, as they may require case-by-case analysis. This addresses the concern without altering the main theorem. revision: yes
Referee: In the characterization of dimension-at-most-two networks (result (ii)), the case analysis for stoichiometric matrices with four or more distinct rows is load-bearing for the central claim that many conservation laws preclude non-vacuous ACR. The manuscript should confirm that every possible configuration of four or more distinct rows (including repeated linear dependencies among the rows) is covered by the enumerated cases, and that the steady-state polynomials are shown to lack the required monomial structure for ACR.

Authors: We appreciate this suggestion to make the coverage explicit. In the manuscript, the case analysis for four or more distinct rows proceeds by considering the possible ways the rows can be arranged in a matrix of rank at most two, which inherently limits the configurations due to the low dimension. All possible distinct row patterns, including those with repeated linear dependencies (such as multiple rows being scalar multiples or linear combinations), are accounted for in the enumeration because the proof classifies based on the number of distinct rows and shows that exceeding three distinct rows forces the steady-state ideal to have generators that prevent the monomial cancellation needed for ACR. To strengthen this, we will add a remark or appendix subsection that systematically lists the possible row configurations for rank ≤2 and verifies the absence of the ACR monomial structure in each. This confirms the completeness of the analysis. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper derives its main results through direct mathematical arguments: a general augmentation criterion proved via linear algebra on stoichiometric matrices for nondegenerate networks, and a complete characterization of non-redundant zero-one networks of dimension at most two obtained by exhaustive case analysis of the steady-state polynomials according to the number of distinct rows. These steps rely on algebraic properties and genericity arguments that are independent of the target ACR conclusions; no parameter fitting, self-referential definitions, or load-bearing self-citations are used to establish the key implication that four or more distinct rows precludes non-vacuous ACR. The derivation chain is therefore self-contained within standard reaction network theory.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on standard linear-algebra facts about stoichiometric matrices and conservation laws together with the domain assumption of nondegeneracy; no free parameters or new entities are introduced.

axioms (2)

standard math Stoichiometric matrices encode linear conservation laws in reaction networks
Invoked throughout the statements about rows and conservation.
domain assumption Nondegeneracy of the network
Required for the augmentation result to hold.

pith-pipeline@v0.9.0 · 5511 in / 1175 out tokens · 52887 ms · 2026-05-10T10:10:24.969874+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

27 extracted references · 4 canonical work pages · 1 internal anchor

[1]

Nature 387(6636), 913–917 (1997)

Barkai, N., Leibler, S.: Robustness in simple biochemical networks. Nature 387(6636), 913–917 (1997)

1997
[2]

Nature397(6715), 168–171 (1999)

Alon, U., Surette, M., Barkai, N., Leibler, S.: Robustness in bacterial chemotaxis. Nature397(6715), 168–171 (1999)

1999
[3]

Nature 419(6904), 304–308 (2002)

Eldar, A., Dorfman, R., Weiss, D., Ashe, H., Shilo, B.Z., Barkai, N.: Robust- ness of the BMP morphogen gradient in drosophila embryonic patterning. Nature 419(6904), 304–308 (2002)

2002
[4]

Science327(5971), 1389–1391 (2010)

Shinar, G., Feinberg, M.: Structural sources of robustness in biochemical reaction networks. Science327(5971), 1389–1391 (2010)

2010
[5]

In: Design and Analysis of Biomolecular Circuits: Engineering Approaches to Systems and Synthetic Biology, pp

Anderson, D.F., Kurtz, T.G.: Continuous time markov chain models for chemical reaction networks. In: Design and Analysis of Biomolecular Circuits: Engineering Approaches to Systems and Synthetic Biology, pp. 3–42. Springer, New York, NY (2011)

2011
[6]

Anderson, D.F., Craciun, G., Kurtz, T.G.: Stochastic analysis of absolute concentration robustness. J. Theoret. Biol.372, 10–18 (2015)

2015
[7]

Karp, R.L., P´ erez Mill´ an, M., Dasgupta, T., Dickenstein, A., Gunawardena, J.: Complex-linear invariants of biochemical networks. J. Theoret. Biol.311, 130–138 (2012)

2012
[8]

P´ erez Mill´ an, M., Dickenstein, A.: Implicit dose-response curves. J. Math. Biol. 70(7), 1669–1684 (2015)

2015
[9]

Joshi, B., Craciun, G.: Foundations of static and dynamic absolute concentration robustness. J. Math. Biol.85(5), 53 (2022)

2022
[10]

Joshi, B., Craciun, G.: Power-engine-load form for dynamic absolute concentra- tion robustness. SIAM J. Appl. Math.83(6), 2237–2259 (2023)

2023
[11]

Joshi, B., Craciun, G.: Reaction network motifs for static and dynamic absolute concentration robustness. SIAM J. Appl. Dyn. Syst.22(2), 501–526 (2023)

2023
[12]

Vietnam J

Meshkat, N., Shiu, A., Torres, A.: Absolute concentration robustness in networks with low-dimensional stoichiometric subspace. Vietnam J. Math.50(3), 623–651 (2022)

2022
[13]

Joshi, B., Kaihnsa, N., Nguyen, T.D., Shiu, A.: Prevalence of multistationary and absolute concentration robustness in reaction networks. SIAM J. Appl. Math. 83(6), 2260–2283 (2023)

2023
[14]

Dickenstein, A., P´ erez Mill´ an, M., Shiu, A., Tang, X.: Multistationarity in 38 structured reaction networks. Bull. Math. Biol.81(5), 1527–1581 (2019) https: //doi.org/10.1007/s11538-019-00572-6

work page doi:10.1007/s11538-019-00572-6 2019
[15]

Puente, L.D.G., Gross, E., Harrington, H.A., Johnston, M., Meshkat, N., P´ erez Mill´ an, M., Shiu, A.: Absolute concentration robustness: Algebra and geometry. J. Symb. Comput.126(1), 102398 (2025)

2025
[16]

Risler, J.J.: Une caract´ erisation des id´ eaux des vari´ et´ es alg´ ebriques r´ eelles. C. R. Acad. Sci. Paris271, 1171–1173 (1970)

1970
[17]

In: Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation, pp

Baldi, L., Mourrain, B.: Computing real radicals by moment optimization. In: Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation, pp. 43–50 (2021)

2021
[18]

Cambridge University Press, Cambridge (2003)

Schenck, H.: Computational Algebraic Geometry. Cambridge University Press, Cambridge (2003)

2003
[19]

Preprint at arxiv.org/abs/2412.17798 (2024)

Feliu, E., Henriksson, O., Pascual-Escudero, B.: The generic geometry of steady state varieties. Preprint at arxiv.org/abs/2412.17798 (2024)

work page internal anchor Pith review arXiv 2024
[20]

Joshi, B., Nguyen, T.D.: Bifunctional enzyme provides absolute concentration robustness in multisite covalent modification networks. J. Math. Biol.88(3), 36 (2024)

2024
[21]

Cobden, D.H., Bockrath, M., McEuen, P.L., Rinzler, A.G., Smalley, R.E.: Spin splitting and even-odd effects in carbon nanotubes. Phys. Rev. Lett.81(3), 681 (1998)

1998
[22]

PLoS Comput

Conradi, C., Feliu, E., Mincheva, M., Wiuf, C.: Identifying parameter regions for multistationarity. PLoS Comput. Biol.13(10), 1005751 (2017)

2017
[23]

Tang, X., Xu, H.: Multistability of small reaction networks. SIAM J. Appl. Dyn. Syst.20(2), 608–635 (2021)

2021
[24]

Wiuf, C., Feliu, E.: Power-law kinetics and determinant criteria for the preclusion of multistationarity in networks of interacting species. SIAM J. Appl. Dyn. Syst. 12(4), 1685–1721 (2013)

2013
[25]

Joshi, B., Shiu, A.: Atoms of multistationarity in chemical reaction networks. J. Math. Chem.51(1), 153–178 (2013) https://doi.org/10.1007/s10910-012-0115-7

work page doi:10.1007/s10910-012-0115-7 2013
[26]

Banaji, M., Pantea, C.: The inheritance of nondegenerate multistationarity in chemical reaction networks. SIAM J. Appl. Math.78(2), 1105–1130 (2018) https: //doi.org/10.1137/16M1103506

work page doi:10.1137/16m1103506 2018
[27]

Jiao, Y., Tang, X., Zeng, X.: Multistability of small zero-one reaction networks. J. Math. Biol.91(6), 82 (2025) 39

2025