pith. sign in

arxiv: 2605.19046 · v1 · pith:IBDMKXRWnew · submitted 2026-05-18 · 💻 cs.CE

pyModRev: a Python Tool for Model Revision of Boolean Networks

Pedro T. Monteiro , Filipe Gouveia This is my paper

Pith reviewed 2026-05-20 07:47 UTC · model grok-4.3

classification 💻 cs.CE
keywords Boolean networksmodel revisionregulatory networksconsistency checkingminimal repairstime-series dataPython packagebiological modeling
0
0 comments X

The pith

pyModRev verifies consistency of Boolean regulatory models and computes minimal repairs for inconsistencies using both steady-state and time-series data under multiple update schemes.

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

The paper presents pyModRev as a Python package that checks whether Boolean network models of biological regulation match available observations and proposes the smallest set of rule changes needed when they do not. This matters because new experimental results frequently render existing models inconsistent, and biologists need systematic ways to update them without exhaustive manual inspection. The tool handles both fixed-point observations and sequences of states while allowing different logical update rules to be tested together. By packaging the method as an installable Python module, the work aims to let users embed model revision directly into larger computational pipelines for network analysis.

Core claim

pyModRev verifies the consistency of Boolean regulatory models against steady state observations as well as time-series data while considering different update schemes simultaneously, and finds minimal repairs in case of inconsistency.

What carries the argument

The minimal repair procedure that searches for the smallest number of changes to model update rules sufficient to eliminate inconsistencies with the supplied observations.

If this is right

  • A model can be validated once against both static snapshots and dynamic trajectories without separate runs.
  • Multiple logical update schemes can be evaluated in a single consistency check rather than requiring independent analyses.
  • Repairs can be generated directly from observations supplied in standard formats, reducing the need for custom preprocessing scripts.
  • The package format permits direct calls from other Python scripts that already handle Boolean network simulation or visualization.

Where Pith is reading between the lines

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

  • Researchers could chain pyModRev with automated data extraction pipelines to revise models as new time-series experiments are published.
  • The same minimal-repair logic might be applied to compare alternative network topologies rather than fixing a single model.
  • Integration with probabilistic or weighted observations could extend the current deterministic consistency checks.

Load-bearing premise

That the smallest number of rule changes identified by the algorithm will be the most useful or biologically plausible revisions for users.

What would settle it

Running pyModRev on a hand-constructed Boolean model known to be inconsistent with a given set of observations and checking whether it correctly reports inconsistency and returns at least one repair set.

Figures

Figures reproduced from arXiv: 2605.19046 by Filipe Gouveia, Pedro T. Monteiro.

Figure 1
Figure 1. Figure 1: PYMODREV workflow. are considered: change a regulatory function; change the sign of an edge (type of interaction); remove an edge (a regulator); and add an edge (a regulator). In [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Boolean model of the early differentiation of Hematopoietic Stem Cells (HCS). [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
read the original abstract

Biological regulatory networks can be represented by computational models, which allow the study and analysis of biological behaviours, therefore providing a better understanding of a given biological process. However, as new information is acquired, biological models may need to be revised in order to also account for this new information. Current model revision tools are scarce and often lack the flexibility to integrate with broader analysis workflows. Here, we present pyModRev, an enhanced iteration of the model revision tool ModRev, capable of verifying the consistency of Boolean regulatory models, and finding minimal repairs in case of inconsistency. pyModRev supports model validation against both steady state observations as well as time-series data, being able to consider different update schemes simultaneously. pyModRev supports different model formats, and is available as a Python package in PyPI, for easy integration with other model analysis tools, significantly improving accessibility and utility for the logical modelling community.

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

1 major / 0 minor

Summary. The manuscript presents pyModRev, a Python package extending the earlier ModRev tool for Boolean network model revision. It claims to verify consistency of regulatory models against steady-state and time-series observations, compute minimal repairs when inconsistencies are detected, support multiple update schemes simultaneously, handle diverse model formats, and integrate easily into broader workflows via distribution on PyPI.

Significance. A reliable, accessible implementation of these revision capabilities would address the noted scarcity of flexible tools in the logical modelling community and facilitate iterative model refinement as new biological data become available.

major comments (1)
  1. [Abstract] The manuscript states the intended capabilities for consistency verification and minimal-repair search but supplies no algorithm description, pseudocode, correctness argument, benchmark results, or concrete example outputs. This absence prevents assessment of whether the implementation actually supports the central claims (see Abstract and any Methods/Implementation section).

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their review and for highlighting the need for greater technical detail in the manuscript. We address the major comment below and commit to revisions that will strengthen the presentation of the tool's core capabilities.

read point-by-point responses

  1. Referee: [Abstract] The manuscript states the intended capabilities for consistency verification and minimal-repair search but supplies no algorithm description, pseudocode, correctness argument, benchmark results, or concrete example outputs. This absence prevents assessment of whether the implementation actually supports the central claims (see Abstract and any Methods/Implementation section).

    Authors: We agree that the current manuscript provides limited algorithmic exposition. The consistency-checking and minimal-repair procedures are inherited from the original ModRev implementation (which we cite), but the paper does not reproduce or expand upon those details. In the revised version we will add a dedicated Implementation subsection that (i) gives a high-level description of the SAT-based encoding used for both steady-state and time-series consistency checks, (ii) supplies pseudocode for the main revision routine, and (iii) includes a worked example with explicit input model, observations, and resulting minimal repairs. We will also report runtime benchmarks on a small set of published Boolean networks. These additions will be placed before the Results section so that readers can evaluate the central claims directly from the text. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper presents pyModRev as a Python software implementation for verifying consistency of Boolean regulatory models and computing minimal repairs under steady-state and time-series observations with multiple update schemes. No mathematical derivation chain, equations, parameter fitting, or load-bearing self-citations appear in the provided text. The core claims reduce to standard logical-model revision techniques implemented in released code, which is externally checkable and not self-referential by construction. This is the expected outcome for a tool-description paper with no internal predictive or definitional steps.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper contributes a software artifact rather than new mathematical objects or fitted constants.

axioms (1)
  • domain assumption Boolean networks provide a useful discrete representation of biological regulatory networks
    The entire revision workflow rests on this modeling choice stated in the opening sentences of the abstract.

pith-pipeline@v0.9.0 · 5681 in / 1135 out tokens · 47623 ms · 2026-05-20T07:47:14.184588+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.

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages · 1 internal anchor

  1. [1]

    Logical Mod- elling, Some Recent Methodological Advances Illustrated, p

    Chaouiya, C., Monteiro, P.T., Remy, E.: Cellular Automata and Discrete Complex Systems, chap. Logical Mod- elling, Some Recent Methodological Advances Illustrated, p. 3–22. Springer Nature Switzerland (2024) 4 APREPRINT- MAY20, 2026

    work page 2024

  2. [2]

    In: 22th International Conference on Computational Methods in Systems Biology (CMSB)

    Chevalier, S., Boyenval, D., Magaña López, G., Roncalli, T., Vaginay, A., Paulevé, L.: BoNesis: a Python- based declarative environment for the verification, reprogramming, and synthesis of Most Permissive Boolean networks. In: 22th International Conference on Computational Methods in Systems Biology (CMSB). LNCS, Springer, Pisa, Italy (2024)

    work page 2024

  3. [3]

    Partial Order on the set of Boolean Regulatory Functions

    Cury, J.E., Monteiro, P.T., Chaouiya, C.: Partial Order on the set of Boolean Regulatory Functions. arXiv preprint arXiv:1901.07623 (2019)

    work page internal anchor Pith review Pith/arXiv arXiv 1901

  4. [4]

    In: Computational Methods in Systems Biology

    Cury, J.E.R., Tenera Roxo, P., Manquinho, V ., Chaouiya, C., Monteiro, P.T.: Computation of immediate neigh- bours of monotone boolean functions. In: Computational Methods in Systems Biology. p. 3–22. Springer Nature Switzerland (Aug 2025)

    work page 2025

  5. [5]

    Journal of Computa- tional Biology9(1), 67–103 (2002)

    De Jong, H.: Modeling and simulation of genetic regulatory systems: a literature review. Journal of Computa- tional Biology9(1), 67–103 (2002)

    work page 2002

  6. [6]

    In: Lin, F., Sattler, U., Truszczynski, M

    Gebser, M., Guziolowski, C., Ivanchev, M., Schaub, T., Siegel, A., Thiele, S., Veber, P.: Repair and predic- tion (under inconsistency) in large biological networks with answer set programming. In: Lin, F., Sattler, U., Truszczynski, M. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 201...

    work page 2010

  7. [7]

    Theory and Practice of Logic Programming19(1), 27–82 (Jul 2018)

    Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. Theory and Practice of Logic Programming19(1), 27–82 (Jul 2018)

    work page 2018

  8. [8]

    Gouveia, F.: Model revision of Boolean logical models of biological regulatory networks. Ph.D. thesis, Instituto Superior Técnico, Universidade de Lisboa (Sep 2021)

    work page 2021

  9. [9]

    In: Computational Methods in Systems Biology

    Gouveia, F., Lynce, I., Monteiro, P.T.: ModRev - model revision tool for boolean logical models of biologi- cal regulatory networks. In: Computational Methods in Systems Biology. p. 339–348. Springer International Publishing (2020)

    work page 2020

  10. [10]

    Journal of Computational Biology27(2), 144–155 (2020)

    Gouveia, F., Lynce, I., Monteiro, P.T.: Revision of boolean models of regulatory networks using stable state observations. Journal of Computational Biology27(2), 144–155 (2020)

    work page 2020

  11. [11]

    Bioinformatics 29(18), 2320–2326 (Jul 2013)

    Guziolowski, C., Videla, S., Eduati, F., Thiele, S., Cokelaer, T., Siegel, A., Saez-Rodriguez, J.: Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming. Bioinformatics 29(18), 2320–2326 (Jul 2013)

    work page 2013

  12. [12]

    Bioinformatics Advances6(1) (2026)

    Huvar, O., Beneš, N., Brim, L., Pastva, S., Šafránek, D.: Sketchbook: logical model inference from boolean network sketches. Bioinformatics Advances6(1) (2026)

    work page 2026

  13. [13]

    Cells11(2022)

    Hérault, L., Poplineau, M., Remy, E., Duprez, E.: Single cell transcriptomics to understand hsc heterogeneity and its evolution upon aging. Cells11(2022)

    work page 2022

  14. [14]

    Nature Reviews Molecular Cell Biology9(10), 770 (2008)

    Karlebach, G., Shamir, R.: Modelling and analysis of gene regulatory networks. Nature Reviews Molecular Cell Biology9(10), 770 (2008)

    work page 2008

  15. [15]

    Bell System Technical Journal35(6), 1417–1444 (Nov 1956)

    McCluskey, E.J.: Minimization of boolean functions. Bell System Technical Journal35(6), 1417–1444 (Nov 1956)

    work page 1956

  16. [16]

    International Journal of Approximate Reasoning83, 243–264 (Apr 2017)

    Merhej, E., Schockaert, S., Cock, M.D.: Repairing inconsistent answer set programs using rules of thumb: A gene regulatory networks case study. International Journal of Approximate Reasoning83, 243–264 (Apr 2017)

    work page 2017

  17. [17]

    Bioinformatics26(10), 1378–1380 (2010)

    Muessel, C., Hopfensitz, M., Kestler, H.A.: Boolnet - an R package for generation, reconstruction and analysis of boolean networks. Bioinformatics26(10), 1378–1380 (2010)

    work page 2010

  18. [18]

    Frontiers in Physiology9(Jun 2018)

    Naldi, A., Hernandez, C., Abou-Jaoudé, W., Monteiro, P.T., Chaouiya, C., Thieffry, D.: Logical modeling and analysis of cellular regulatory networks with GINsim 3.0. Frontiers in Physiology9(Jun 2018)

    work page 2018

  19. [19]

    Bioinformat- ics31(7), 1154–1159 (Jan 2015)

    Naldi, A., Monteiro, P.T., Müssel, C., Kestler, H.A., Thieffry, D., Xenarios, I., Saez-Rodriguez, J., Helikar, T., Chaouiya, C.: Cooperative development of logical modelling standards and tools with CoLoMoTo. Bioinformat- ics31(7), 1154–1159 (Jan 2015)

    work page 2015

  20. [20]

    Biosystems149, 139–153 (Nov 2016)

    Ostrowski, M., Paulevé, L., Schaub, T., Siegel, A., Guziolowski, C.: Boolean network identification from pertur- bation time series data combining dynamics abstraction and logic programming. Biosystems149, 139–153 (Nov 2016)

    work page 2016

  21. [21]

    Reasoning on the Response of Logical Signaling Networks with ASP, p

    Schaub, T., Siegel, A., Videla, S.: Logical Modeling of Biological Systems, chap. Reasoning on the Response of Logical Signaling Networks with ASP, p. 49–92. Wiley (Jul 2014)

    work page 2014

  22. [22]

    Biosystems84(2), 153–174 (2006)

    Siegel, A., Radulescu, O., Le Borgne, M., Veber, P., Ouy, J., Lagarrigue, S.: Qualitative analysis of the relation between dna microarray data and behavioral models of regulation networks. Biosystems84(2), 153–174 (2006)

    work page 2006

  23. [23]

    p27", "rb

    Thomas, R.: Boolean formalization of genetic control circuits. Journal of Theoretical Biology42(3), 563–585 (1973) 5 APREPRINT- MAY20, 2026 A Tutorial / User manual PYMODREVis a Python reimplementation of MODREVfor automated: i) consistency checking of Boolean logical models against experimental observations, ii) computation of minimal repair operations u...

    work page 1973