Pith. sign in

REVIEW 4 major objections 4 minor 27 references

Permutation theory governs long-term dynamics of critical Boolean networks

T0 review · 4 major / 4 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The length of an attractor in a critical Boolean network is governed by the order of a single permutation induced by its feedback loops.

desk verdict The permutation reformulation is clean and the typical/extremal max-length bounds are correct, but the mean-length scaling rests on a false lemma and is unsupported as written. read the letter →

arxiv 2608.07790 v1 pith:2ZEAY7RQ submitted 2026-08-07 q-bio.MN physics.bio-ph

Venkata Sai Narayana Bavisetty , Matthew Wheeler , Julian Vignes , Matthew Stephen Jones Jr. , Ruodan Liu , Sean Campbell , Claus Kadelka This is my paper · ORCID
classification q-bio.MNphysics.bio-ph MSC 05A0537B1560C0592C42
keywords BooleannetworkscriticalK=1attractorlengthspermutationorderrandompermutationsKauffmanfeedbackloopsmeanlength
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper claims that for critical Boolean networks of connectivity one, all asymptotic properties of long-term dynamics are determined by a single permutation built from the network's feedback loops. The paper shows that the mean attractor length of such a network is within a constant factor of the order of this permutation, so the distribution of attractor lengths becomes a question about the arithmetic of random permutations. Combining standard results on the order of random permutations, the paper concludes that almost all networks have maximum attractor length at most $\exp[\tfrac{1}{2}\ln^2 N]$, some networks reach $\exp[\Theta(\sqrt{N\ln N})]$, and the average over networks of the mean attractor length scales as $\exp[N^{1/3+o(1)}]$. A reader should care because this connects Boolean network dynamics with combinatorics and number theory, and because it shows that rare networks with exceptionally long attractors dominate ensemble averages.

What carries the argument

The machinery is the induced permutation $\sigma$ on the $m$ relevant nodes of the network: each relevant node maps to its unique successor, so the cycles of $\sigma$ correspond exactly to feedback loops, and its order $\mathrm{ord}(\sigma)$ is the least common multiple of the loop lengths. The load-bearing inequalities $\mathrm{ord}(\sigma)/4 \le \bar A \le 2\,\mathrm{ord}(\sigma)$ turn every attractor-length question into a permutation-order question; Theorem 1 proves the lower bound by reducing to positive loops, splitting composite loop lengths into distinct prime powers, and applying a factorization together with an infinite product bound. The asymptotics then come from known permutation-order results applied to $\sigma$ under the relevant-node count distribution $P(m)\sim (m/N)e^{-m^2/2N}$.

What would settle it

Evaluate the identity labelled Lemma 2 at k=2: formula (15) yields $\bar c(4)=-1/2$, so $\bar c(4)\cdot 4 = -2$, whereas the right-hand side summed over divisors of 2 equals $c(1)+2c(2)=4$. The claimed equality fails, and the Möbius inversion in its proof assigns coefficient $+1$ to every power-of-two quotient when the true coefficient is $-1$ for quotient 2. Checking the theorem's reduction for a single negative 2-loop therefore decides whether the lower bound $\mathrm{ord}(\sigma)/4 \le \bar A$ is valid.

Watch

Extended reading notes

Core claim

The central claim is that the permutation $\sigma$ induced by the feedback loops of a critical $K=1$ Boolean network is a faithful invariant for long-term dynamics: its cycle lengths are exactly the loop lengths, every attractor length divides $2\,\mathrm{ord}(\sigma)$, and the mean attractor length $\bar A$ satisfies $\mathrm{ord}(\sigma)/4 \le \bar A \le 2\,\mathrm{ord}(\sigma)$. The paper then proves that this invariant yields three asymptotic statements: almost all networks have sub-exponential maximum attractor lengths, extremal networks attain lengths of order $\exp[\Theta(\sqrt{N\ln N})]$, and the expected mean attractor length over network realizations scales as $\exp[N^{1/3+o(1)}]$, dominated by rare high-order permutations.

Load-bearing premise

The argument hinges on the claim that the average time before a network repeats is always at least one quarter of the least common multiple of its feedback-loop lengths; if that comparison is wrong, the reported average attractor length does not follow.

Editorial extensions

If this is right

  • Almost every critical $K=1$ network of $N$ nodes has all attractor lengths at most $\exp[\tfrac{1}{2}\ln^2 N]$, so typical long-term behavior is sub-exponential in $N$.
  • There exist critical $K=1$ networks whose longest attractor grows as $\exp[\Theta(\sqrt{N\ln N})]$, so network-to-network variation in attractor length is enormous.
  • The expected mean attractor length over network realizations scales as $\exp[N^{1/3+o(1)}]$, meaning a handful of rare networks with very high permutation order dominate the ensemble average; simulations that sample typical networks will underestimate it.
  • Up to constant factors the number of attractors is $2^m/\mathrm{ord}(\sigma)$, so the same permutation controls both attractor counting and attractor length.
  • In critical $K=2$ networks the dynamically active core reduces asymptotically to a $K=1$ structure, so the permutation-based approach is a candidate route to higher-connectivity attractor statistics.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the permutation encoding is as faithful as claimed, the full finite-size distribution of attractor lengths should track the distribution of cycle structures of a random permutation conditioned on the relevant-node count; this could be checked by exact enumeration for moderate $N$.
  • Because $\bar A$ is within a constant factor of $\mathrm{ord}(\sigma)$, one can estimate a network's mean attractor length directly from the lcm of its feedback-loop lengths without simulating the Boolean dynamics, offering a fast structural diagnostic for Boolean models.
  • The dominance of rare networks in the mean suggests that ensemble-level statements about Boolean network dynamics depend sensitively on the random-network distribution; conditioning on different loop-sign or loop-length statistics could shift the mean scaling exponent.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper studies critical K=1 Boolean networks and claims that their attractor lengths are governed by the order of a permutation induced by the network's feedback loops. Using classical results of Erdős–Turán, Landau, and Goh–Schmutz, it asserts that almost all networks have maximum attractor length at most exp[(1/2)ln^2 N], that some networks attain exp[Theta(sqrt(N ln N))], and that the mean attractor length scales as exp[N^{1/3+o(1)}]. The main mathematical content is in the appendix, where Theorem 1 is intended to prove the lower bound \bar A >= ord(sigma)/4 that connects the mean attractor length to the permutation order.

Significance. If the results were correct, the paper would provide a clean bridge between Boolean network dynamics and permutation theory, resolving a long-standing scaling question for K=1 Kauffman networks. The typical and extremal maximum-length statements are plausibly sound: they follow from well-known facts about random permutations, conditional on the standard result that attractor lengths divide 2 ord(sigma). The conceptual reformulation in terms of the induced permutation is attractive and could be valuable. However, the headline mean-length scaling exp[N^{1/3}] is not established: its proof depends on a lower-bound theorem whose key lemma is false, and a numerical claim in the appendicial proof is also contradicted by direct computation. The paper provides no machine-checked artifact for the claimed formal verification, and the verification claim is inconsistent with the false lemma.

major comments (4)
  1. [Appendix, Eq. (15) and Lemma 2] Eq. (15) gives a negative number of attractors for a negative 2-loop at ell=4. For n=2, ell=4, the formula yields \bar c(4) = (1/4) sum_{d|2, 2/d odd} mu(d) 2^{4/(2d)} = (1/4)(-2) = -1/2, whereas direct enumeration of the negative 2-loop (00->10->11->01->00) shows exactly one 4-cycle. Consequently Lemma 2 is false; for k=2 the left-hand side \bar c(4)*4 equals -2 while the right-hand side is c(1)+2c(2)=4 under the standard reading of Eq. (17). This invalidates the use of Lemma 2 in Eq. (19).
  2. [Lemma 2 proof] The Möbius-inversion coefficient in the proof of Lemma 2 is miscomputed. The proof claims that the coefficient of c(d')d' is 1 whenever k/d' is a power of 2 and 0 otherwise. For r = k/d' = 2^s, the coefficient is sum_{e|r, r/e odd} mu(e), which equals 1 for s=0, -1 for s=1, and 0 for s>=2. This is not a minor typo: it produces exactly the counterexample to the lemma described in the previous comment.
  3. [Appendix, Theorem 1 and Eqs. (3), (11)-(12)] Because Lemma 2 is false, Step 1 of Theorem 1 fails, so the lower bound \bar A >= ord(sigma)/4 in Eq. (3) is unproven. This bound is load-bearing: the mean-attractor-length derivation in Eqs. (11)-(12) requires both the upper bound \bar A <= 2 ord(sigma) and the lower bound \bar A >= ord(sigma)/4. Without the lower bound, the expected value of \bar A could in principle be much smaller than exp[N^{1/3+o(1)}]. The headline mean-length result is therefore unsupported as written.
  4. [Appendix, Step 3 and Eqs. (28)-(29)] The claimed numerical value of the infinite product R_min is incorrect. The factors are p/(2p-1), whose product over all primes converges to 0; already the partial product over 2,3,5,7 equals 14/143 approximately 0.098, below 1/4. Thus the assertion that "a numerical computation gives R_min ~ 0.32 > 1/4" is false, and the Step 3 lower-bound argument fails for an additional reason even after the positive-loop reduction.
minor comments (4)
  1. [Eq. (23)] The displayed inequality has an extra "-1" on the right-hand side: for j=0 it reads gcd(0,ab) <= gcd(0,a)+gcd(0,b)+ab-a-b-1, i.e. ab <= ab-1, which is false. The subsequent line uses the version without the "-1", so this appears to be a typographical slip that should be corrected.
  2. [Appendix, formal verification claim] The manuscript states that Lemma 2 and Lemma 3 were formally verified using the Aristotle API [26], but no artifact, certificate, or proof script is provided. Since Lemma 2 is false, this verification claim cannot be credited in its current form.
  3. [Throughout] There are several typographical and grammatical errors, including "simple alebraic manifpulation" in the proof of Step 2 and "Kjr" in reference [4]; these should be corrected in a revision.
  4. [Eq. (15)] The condition "2n/ell odd" in Eq. (15) is typeset ambiguously; please clarify the scope of the "0 otherwise" clause and explicitly define the support of \bar c(ell).

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: load-bearing inputs are external theorems and prior results; the unproven Lemma 2 is a soundness defect, not a circular reduction.

full rationale

The paper's derivation chain uses (i) the known decomposition of a critical K=1 network into loops and trees, (ii) prior results [4,5,17,18] that attractor lengths divide 2 ord(sigma), (iii) a new theorem attempting to prove the matching lower bound bar A >= ord(sigma)/4, (iv) external probabilistic and number-theoretic results of Erdos-Turan, Landau, and Goh-Schmutz, and (v) the known distribution P(m) of relevant-node counts from [7,15]. None of these inputs is defined in terms of the target attractor-length asymptotics, and no parameter is fitted to the data being predicted. The fact that Lemma 2 appears to miscompute a Mobius coefficient and can yield negative cycle counts is a correctness problem: it means Theorem 1 is not established, so the exp[N^{1/3}] mean-length claim lacks support as written. But an unsupported or even false lemma is not circularity, because the claim is not assumed as an input or equivalent to a fitted quantity by construction. The only self-citation, [14] Kadelka et al., supports the biological criticality hypothesis as background and is not load-bearing for any attractor-length result. The assertion of formal verification via the Aristotle API is not accompanied by an artifact, which is a verification gap rather than a circular step. No specific circular reduction can be exhibited, so the honest finding is no significant circularity.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The paper introduces no fitted parameters or new physical entities. The load-bearing assumptions are the uniform-permutation model for the relevant core, the known cycle-counting formulas for loops, and the classical permutation-order theorems. The main internal weakness is the proof of Lemma 2, not the axiomatic base.

assumptions (4)
  • domain assumption The relevant core of a random critical K=1 network induces a uniformly random permutation on the m relevant nodes.
    Used in Section 'Typical versus extremal maximum attractor lengths' and the mean-length calculation; cited to [7,15], not proved in the paper.
  • domain assumption Every attractor length divides 2 ord(sigma) and the number of attractors is given by the Burnside-type formula (20).
    Taken from prior work [4,5,17,18]; the paper restates this in permutation language.
  • standard math Classical results: Erdős-Turán on typical permutation order, Landau's maximal order, Goh-Schmutz on expected order.
    These are external theorems used without proof, appropriate as inputs.
  • domain assumption The distribution P(m) ~ (m/N) exp(-m^2/(2N)) of the number of relevant nodes.
    Taken from [7,15] and used in Eq. (10)-(11) for the Laplace averaging.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Permutation theory governs long-term dynamics of critical Boolean networks." pith.science (2026). https://pith.science/paper/2ZEAY7RQ

@misc{pith2026260807790,
  author       = {Pith},
  title        = {Pith review of: Permutation theory governs long-term dynamics of critical Boolean networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2ZEAY7RQ}},
  note         = {Machine review of arXiv:2608.07790}
}
abstract

Boolean networks are widely used to model gene regulatory dynamics, where long-term behavior is organized by attractors - by both their number and their lengths. The number of attractors was resolved recently, but the distribution of attractor lengths and its dependence on network architecture remain poorly understood. We address this for critical Boolean networks with connectivity $K=1$. We show that the attractor structure of these networks is encoded by a permutation induced by the network's feedback loops, thereby recasting questions about attractor lengths as questions about permutations and their arithmetic properties. In particular, the maximum attractor length is determined by the order of the induced permutation. Using results of Erd\H{o}s and Tur\'an together with a classical theorem of Landau, we show that almost all networks have attractors of length at most $\exp[\tfrac{1}{2}\ln^2 N]$, while some networks support attractors as long as $\exp[\sqrt{N\ln N}]$. The mean attractor length scales as $\exp[N^{1/3}]$, reflecting the influence of rare networks whose exceptionally long attractors dominate the expectation value. These results establish a direct connection between Boolean network dynamics, combinatorics, and number theory, and identify the permutation induced by the feedback loops as a central dynamical invariant governing attractor lengths in critical Boolean networks.

Figures

Figures reproduced from arXiv: 2608.07790 by the authors.

Figure 1
Figure 1. (a) Two disjoint K = 1 Boolean network components, each consisting of a loop of relevant nodes (numbered 1–4 and 5–7) with trees of non-relevant nodes branching out. (b) The corresponding permutation σ on the relevant nodes, consisting of loops (1 2 3 4) and (5 6 7): the top row lists each node and the arrow indicates its image under σ. Let m denote the number of relevant nodes. Within the subnetwork induced by thes… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

27 extracted references · 24 canonical work pages

  1. [1]

    Metabolic stability and epigenesis in randomly constructed genetic nets

    Stuart A Kauffman. Metabolic stability and epigenesis in randomly constructed genetic nets. Journal of theoretical biology, 22(3):437–467, 1969

    work page 1969

  2. [2]

    Boolean modeling in systems biology: an overview of methodology and applications.Physical biology, 9(5):055001, 2012

    Rui-Sheng Wang, Assieh Saadatpour, and Reka Albert. Boolean modeling in systems biology: an overview of methodology and applications.Physical biology, 9(5):055001, 2012

    work page 2012

  3. [3]

    The random map model: a disordered model with deter- ministic dynamics.Journal de Physique, 48(6):971–978, 1987

    Bernard Derrida and H Flyvbjerg. The random map model: a disordered model with deter- ministic dynamics.Journal de Physique, 48(6):971–978, 1987

    work page 1987

  4. [4]

    Exact solution of kauffman’s model with connectivity one

    Henrik Flyvbjerg and NJ Kjr. Exact solution of kauffman’s model with connectivity one. Journal of Physics A: Mathematical and General, 21(7):1695–1718, 1988

    work page 1988

  5. [5]

    Number and length of attractors in a critical kauffman model with connectivity one.Physical review letters, 94(8):088701, 2005

    Barbara Drossel, Tamara Mihaljev, and Florian Greil. Number and length of attractors in a critical kauffman model with connectivity one.Physical review letters, 94(8):088701, 2005

    work page 2005

  6. [6]

    Number of attractors in random boolean networks.Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, 72(1):016110, 2005

    Barbara Drossel. Number of attractors in random boolean networks.Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, 72(1):016110, 2005

    work page 2005

  7. [7]

    Number of attractors in the critical kauffman model is exponential

    TMA Fink and FC Sheldon. Number of attractors in the critical kauffman model is exponential. Physical Review Letters, 131(26):267402, 2023. 10

    work page 2023

  8. [8]

    Insights from number theory into the critical kauffman model with connectivity one.Journal of Physics A: Mathematical and Theoretical, 57(27):275003, 2024

    FC Sheldon and TMA Fink. Insights from number theory into the critical kauffman model with connectivity one.Journal of Physics A: Mathematical and Theoretical, 57(27):275003, 2024

    work page 2024

Show all 27 references
  1. [9]

    Superpolynomial growth in the number of attractors in kauffman networks.Physical Review Letters, 90(9):098701, 2003

    Björn Samuelsson and Carl Troein. Superpolynomial growth in the number of attractors in kauffman networks.Physical Review Letters, 90(9):098701, 2003

    2003

  2. [10]

    The origins of order: Self-organization and selection in evolution

    Stuart A Kauffman. The origins of order: Self-organization and selection in evolution. InSpin glasses and biology, pages 61–100. World Scientific, 1992

    1992

  3. [11]

    Robustness and evolvability in genetic regulatory networks.Journal of theoretical biology, 245(3):433–448, 2007

    Maximino Aldana, Enrique Balleza, Stuart Kauffman, and Osbaldo Resendiz. Robustness and evolvability in genetic regulatory networks.Journal of theoretical biology, 245(3):433–448, 2007

    2007

  4. [12]

    Critical dynamics in genetic regulatory networks: examples from four kingdoms.PLoS One, 3(6):e2456, 2008

    Enrique Balleza, Elena R Alvarez-Buylla, Alvaro Chaos, Stuart Kauffman, Ilya Shmulevich, and Maximino Aldana. Critical dynamics in genetic regulatory networks: examples from four kingdoms.PLoS One, 3(6):e2456, 2008

    2008

  5. [13]

    Criticality distinguishes the ensemble of biological regulatory networks.Physical review letters, 121(13):138102, 2018

    Bryan C Daniels, Hyunju Kim, Douglas Moore, Siyu Zhou, Harrison B Smith, Bradley Karas, Stuart A Kauffman, and Sara I Walker. Criticality distinguishes the ensemble of biological regulatory networks.Physical review letters, 121(13):138102, 2018

    2018

  6. [14]

    A meta-analysis of Boolean network models reveals design principles of gene regu- latory networks.Science advances, 10(2):eadj0822, 2024

    Claus Kadelka, Taras-Michael Butrie, Evan Hilton, Jack Kinseth, Addison Schmidt, and Haris Serdarevic. A meta-analysis of Boolean network models reveals design principles of gene regu- latory networks.Science advances, 10(2):eadj0822, 2024

    2024

  7. [15]

    Random boolean networks.Reviews of nonlinear dynamics and complexity, pages 69–110, 2008

    Barbara Drossel. Random boolean networks.Reviews of nonlinear dynamics and complexity, pages 69–110, 2008

    2008

  8. [16]

    Investigation of the dynamics of critical k= 2 kauffman networks using second-order loops.Journal of the Physical Society of Japan, 77(9):094002, 2008

    Shan-Tarng Chen, Hsen-Che Tseng, Shu-Chin Wang, and Ping-Cheng Li. Investigation of the dynamics of critical k= 2 kauffman networks using second-order loops.Journal of the Physical Society of Japan, 77(9):094002, 2008

    2008

  9. [17]

    On the number of attractors of posi- tive and negative boolean automata circuits

    Jacques Demongeot, Mathilde Noual, and Sylvain Sené. On the number of attractors of posi- tive and negative boolean automata circuits. In2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops, pages 782–789. IEEE, 2010

    2010

  10. [18]

    World Scientific, 2017

    Solomon W Golomb.Shift register sequences: secure and limited-access code generators, effi- ciency code generators, prescribed property generators, mathematical models. World Scientific, 2017

    2017

  11. [19]

    On some problems of a statistical group-theory

    Paul Erdos and Pál Turán. On some problems of a statistical group-theory. i.Z. Wahrschein- lichkeitstheorie verw. Geb, 4:175–186, 1965

    1965

  12. [20]

    On some problems of a statistical group-theory

    Pál Erdős and P Turán. On some problems of a statistical group-theory. ii.Acta Math. Acad. Sci. Hungar., 18:151–163, 1967

    1967

  13. [21]

    On some problems of a statistical group-theory

    Paul Erdős and Paul Turán. On some problems of a statistical group-theory. iii.Acta Math. Acad. Sci. Hungar, 18:309–320, 1967

    1967

  14. [22]

    On some problems of a statistical group-theory

    Paul Erdős and Paul Turán. On some problems of a statistical group-theory. iv.Acta Mathe- matica Hungarica, 19(3-4):413–435, 1968

    1968

  15. [23]

    Über die maximalordnung der permutationen gegebenen grades.Archiv der Math

    Edmund Landau. Über die maximalordnung der permutationen gegebenen grades.Archiv der Math. und Phys, 3:92–103, 1903. 11

    1903

  16. [24]

    The expected order of a random permutation.Bulletin of the London Mathematical Society, 23(1):34–42, 1991

    William MY Goh and Eric Schmutz. The expected order of a random permutation.Bulletin of the London Mathematical Society, 23(1):34–42, 1991

    1991

  17. [25]

    Cycle type of random permutations: a toolkit.arXiv preprint arXiv:2104.12019, 2021

    Kevin Ford. Cycle type of random permutations: a toolkit.arXiv preprint arXiv:2104.12019, 2021

    2021 arXiv

  18. [26]

    Aristotle: Imo-level automated theorem proving, 2025

    Tudor Achim, Alex Best, Alberto Bietti, Kevin Der, Mathïs Fédérico, Sergei Gukov, Daniel Halpern-Leistner, Kirsten Henningsgard, Yury Kudryashov, Alexander Meiburg, Mar- tin Michelsen, Riley Patterson, Eric Rodriguez, Laura Scharff, Vikram Shanker, Vladmir Sicca, Hari Sowriraj...

    2025

  19. [27]

    Courier Corporation, 1981

    Nicolaas Govert De Bruijn.Asymptotic methods in analysis, volume 4. Courier Corporation, 1981. 12

    1981

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.