pith. sign in

arxiv: 2508.14017 · v3 · submitted 2025-08-19 · 💻 cs.CC · cs.DC· cs.ET

Analog computation with transcriptional networks

David Doty , Mina Latifi , David Soloveichick This is my paper

Pith reviewed 2026-05-18 22:35 UTC · model grok-4.3

classification 💻 cs.CC cs.DCcs.ET
keywords analog computationtranscriptional networkssynthetic biologypolynomial ODEsmass-action kineticscompilerdynamical systems
0
0 comments X

The pith

Controlling only transcription factor production rates is mathematically sufficient to implement any polynomial analog dynamical system exactly.

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

The paper establishes that transcriptional networks can realize arbitrary analog computations by regulating only the production of transcription factors, without any direct control over their degradation rates. This equivalence holds under standard mass-action kinetics with linear degradation, matching the power of systems that program both production and degradation. A compiler translates suitable polynomial ODE systems into equivalent transcriptional circuits, demonstrated on examples such as oscillations, chaos, analog sorting, memory, PID control, and extremum seeking. Sympathetic readers care because this removes a major engineering barrier in synthetic biology: degradation control is often harder to implement than transcription regulation. The result also clarifies the computational capabilities latent in natural transcriptional circuits.

Core claim

We prove that controlling transcription factor production (i.e., transcription rate) without explicitly controlling degradation is mathematically complete for analog computation, achieving equivalent capabilities to systems where both production and degradation are programmable. We demonstrate our approach on several examples including oscillatory and chaotic dynamics, analog sorting, memory, PID controller, and analog extremum seeking. We provide a compiler, in the form of a Python package that can take any system of polynomial ODEs and convert it to an equivalent transcriptional network implementing the system exactly, under appropriate conditions.

What carries the argument

The exact equivalence reduction that maps any polynomial ODE system satisfying the appropriate conditions to a transcriptional network whose production rates alone reproduce the target dynamics under mass-action kinetics with linear degradation.

Load-bearing premise

Target dynamical systems must satisfy the appropriate conditions that allow exact translation into a transcriptional network whose degradation terms remain the standard linear ones.

What would settle it

An explicit polynomial ODE system that cannot be realized by any transcriptional network with only production-rate control while preserving identical trajectories under the paper's mass-action model.

read the original abstract

Transcriptional networks represent one of the most extensively studied types of systems in synthetic biology. Although the completeness of transcriptional networks for digital logic is well-established, *analog* computation plays a crucial role in biological systems and offers significant potential for synthetic biology applications. While transcriptional circuits typically rely on cooperativity and highly non-linear behavior of transcription factors to regulate *production* of proteins, they are often modeled with simple linear *degradation* terms. In contrast, general analog dynamics require both non-linear positive as well as negative terms, seemingly necessitating control over not just transcriptional (i.e., production) regulation but also the degradation rates of transcription factors. Surprisingly, we prove that controlling transcription factor production (i.e., transcription rate) without explicitly controlling degradation is mathematically complete for analog computation, achieving equivalent capabilities to systems where both production and degradation are programmable. We demonstrate our approach on several examples including oscillatory and chaotic dynamics, analog sorting, memory, PID controller, and analog extremum seeking. Our result provides a systematic methodology for engineering novel analog dynamics using synthetic transcriptional networks without the added complexity of degradation control and informs our understanding of the capabilities of natural transcriptional circuits. We provide a compiler, in the form of a Python package that can take any system of polynomial ODEs and convert it to an equivalent transcriptional network implementing the system *exactly*, under appropriate conditions.

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 / 2 minor

Summary. The paper proves that systems of polynomial ODEs can be exactly realized by transcriptional networks of the form dx_i/dt = p_i(x) - gamma_i x_i, where only the production functions p_i are programmable via transcription-factor regulation while degradation rates remain fixed and linear. It supplies a Python compiler that performs the translation and illustrates the construction on oscillatory/chaotic dynamics, analog sorting, memory, PID control, and extremum seeking.

Significance. If the equivalence holds under the stated conditions, the result is significant: it shows that analog computation is achievable in synthetic biology without engineering degradation control, supplies a reusable compiler, and offers a systematic methodology for both synthetic and natural transcriptional circuits. The explicit compiler and reproducible examples constitute a concrete strength.

major comments (2)
  1. [§3] §3 (main theorem and compiler construction): the claim of exact realization for arbitrary polynomial ODEs is qualified by 'appropriate conditions' whose precise statement, domain restrictions, and verification that production functions p_i remain non-negative for general targets (including those with negative coefficients) are not supplied; this is load-bearing for the completeness result.
  2. [§4] §4 (examples): for the chaotic and extremum-seeking cases, it is not shown that the translated network remains inside a positive invariant set where the production rates stay non-negative throughout the trajectory; without this check the exact equivalence does not automatically extend to the demonstrated dynamics.
minor comments (2)
  1. [Abstract] The abstract and introduction repeatedly use 'appropriate conditions' without a forward reference to the precise statement in the main theorem; adding a one-sentence definition or pointer would improve readability.
  2. [Model section] Notation for the production polynomials p_i(x) is introduced without an explicit non-negativity constraint in the model section; stating the constraint p_i(x) >= 0 for x in the relevant domain would clarify the biological interpretation.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments on our manuscript. We address each major comment below. We agree that additional precision and verification are warranted and will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: [§3] §3 (main theorem and compiler construction): the claim of exact realization for arbitrary polynomial ODEs is qualified by 'appropriate conditions' whose precise statement, domain restrictions, and verification that production functions p_i remain non-negative for general targets (including those with negative coefficients) are not supplied; this is load-bearing for the completeness result.

    Authors: We agree that the theorem statement in §3 should make the 'appropriate conditions' fully explicit rather than referring to them only in the text. The conditions consist of restricting trajectories to a compact forward-invariant subset of the positive orthant on which every production function p_i remains non-negative; this set is constructed by choosing a sufficiently large radius so that the highest-degree positive terms dominate any negative contributions. For target polynomials containing negative coefficients the compiler first rewrites each right-hand side as a difference of two polynomials with non-negative coefficients and then realizes the difference via an auxiliary species whose production is strictly positive. We will revise the manuscript to include (i) a precise statement of the theorem with the domain restriction written explicitly, (ii) a short lemma establishing non-negativity of each p_i on the chosen invariant set, and (iii) a brief discussion of how the compiler handles negative coefficients without violating the non-negativity requirement. revision: yes

  2. Referee: [§4] §4 (examples): for the chaotic and extremum-seeking cases, it is not shown that the translated network remains inside a positive invariant set where the production rates stay non-negative throughout the trajectory; without this check the exact equivalence does not automatically extend to the demonstrated dynamics.

    Authors: We concur that explicit verification of a positive invariant set is needed for the chaotic and extremum-seeking examples to guarantee that the realized network stays inside the region where all production functions remain non-negative. In the revised version we will add, for each of these two examples, (a) an explicit description of a compact forward-invariant set contained in the positive orthant that contains the attractor, and (b) a numerical or analytic check confirming that every production function p_i is non-negative throughout that set. These additions will be placed in the supplementary material with a brief reference in the main text. revision: yes

Circularity Check

0 steps flagged

No circularity: proof constructs explicit compiler translation from polynomial ODEs to transcriptional networks

full rationale

The paper's central result is a mathematical proof establishing that any polynomial ODE system can be realized exactly by a transcriptional network of the form dx_i/dt = p_i(x) - gamma_i x_i (with only p_i programmable) under appropriate conditions, implemented via a provided Python compiler. This derivation proceeds by direct construction of the network from the target ODEs rather than by fitting parameters to data, renaming known results, or relying on self-citations for the load-bearing step. The abstract and description contain no self-definitional loops, fitted-input predictions, or uniqueness theorems imported from prior author work. The conditional caveat ('under appropriate conditions') qualifies the scope but does not create circularity, as the translation itself is the independent content of the proof. The result is therefore self-contained against external mathematical benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The result rests on standard modeling assumptions for transcriptional networks and the existence of appropriate conditions for exact equivalence; no free parameters or invented entities are described in the abstract.

axioms (2)
  • domain assumption Transcriptional networks are modeled with controllable production rates and linear degradation terms under mass-action kinetics.
    Invoked to establish the baseline model that the proof extends to full analog completeness.
  • domain assumption Target dynamics are expressible as polynomial ODEs that satisfy the paper's appropriate conditions for exact implementation.
    Required for the compiler to produce an equivalent transcriptional network.

pith-pipeline@v0.9.0 · 5772 in / 1131 out tokens · 37076 ms · 2026-05-18T22:35:51.370742+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.