Pith. sign in

REVIEW 3 cited by

A compositional account of motifs, mechanisms, and dynamics in biochemical regulatory networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2301.01445 v3 pith:BPKECQLJ submitted 2023-01-04 q-bio.MN math.CT

A compositional account of motifs, mechanisms, and dynamics in biochemical regulatory networks

classification q-bio.MN math.CT
keywords networksregulatorynetworksignedsystemscategoryfunctorgraphs
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Regulatory networks depict promoting or inhibiting interactions between molecules in a biochemical system. We introduce a category-theoretic formalism for regulatory networks, using signed graphs to model the networks and signed functors to describe occurrences of one network in another, especially occurrences of network motifs. With this foundation, we establish functorial mappings between regulatory networks and other mathematical models in biochemistry. We construct a functor from reaction networks, modeled as Petri nets with signed links, to regulatory networks, enabling us to precisely define when a reaction network could be a physical mechanism underlying a regulatory network. Turning to quantitative models, we associate a regulatory network with a Lotka-Volterra system of differential equations, defining a functor from the category of signed graphs to a category of parameterized dynamical systems. We extend this result from closed to open systems, demonstrating that Lotka-Volterra dynamics respects not only inclusions and collapsings of regulatory networks, but also the process of building up complex regulatory networks by gluing together simpler pieces. Formally, we use the theory of structured cospans to produce a lax double functor from the double category of open signed graphs to that of open parameterized dynamical systems. Throughout the paper, we ground the categorical formalism in examples inspired by systems biology.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Presheaves on lax double functors; or, Instances of models of double theories

    math.CT 2025-10 unverdicted novelty 6.0

    Instances of models of double theories are defined as presheaves on lax double functors and shown equivalent to modules from the terminal model or loose natural transformations, with an elements correspondence to disc...

  2. Towards a Unified Theory of Time-Varying Data

    math.CT 2024-01 unverdicted novelty 6.0

    Introduces sheaf-theoretic categories of narratives on time-interval posets as a general framework for time-varying data that satisfies five desiderata from temporal graph theory and generalizes to any category with l...

  3. Double Categories of Open Systems: the Cospan Approach

    math.CT 2025-09 conditional novelty 4.0

    Structured and decorated cospan double categories for open systems have an exoskeleton/outer shell structure, and every object in them is a special symmetric Frobenius pseudomonoid.