Pith. sign in

REVIEW 3 major objections 4 minor 20 references

Open, Reproducible Calculation of Assembly Indices

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

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

Pith's one-line read The paper presents assembly-theory, an open-source Rust package that computes exact molecular assembly indices, claiming one to two orders of magnitude speedup over the prior Go implementation and introducing a new vector-addition-chain…

desk verdict Useful open-source Rust tool for assembly indices with real speedups, but the flagship bound's admissibility is unproven and validation leans on the closed-source algorithm it aims to replace. read the letter →

arxiv 2507.08852 v1 pith:DNI3VQGR submitted 2025-07-08 physics.chem-ph

Devansh Vimal , Garrett Parzych , Olivia M. Smith , Devendra Parkar , Sean Bergen , Joshua J. Daymude , Cole Mathis This is my paper · ORCID
classification physics.chem-ph
keywords assemblytheoryindexbranch-and-boundadditionchainRustpackagemolecularcomplexityopen-sourcesoftware
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 introduces assembly-theory, an open-source Rust package for computing the molecular assembly index, the minimum number of recursive bond-combining steps needed to build a molecule. The authors claim exact computation with one to two orders of magnitude speedup over the previous Go implementation, and they provide curated reference datasets, tests, and benchmarks to make comparisons reproducible. The package implements several branch-and-bound algorithms, including a fastest variant that pairs an existing integer addition chain bound with a novel vector addition chain bound. If these claims hold, exact complexity scores for molecules become practical on commodity hardware, with Python bindings for standard cheminformatics workflows.

What carries the argument

The calculation follows a top-down two-phase design. First, an enumeration phase finds all pairs of isomorphic, edge-disjoint subgraphs of the molecular graph, binning them into equivalence classes using canonical graph representations; second, a parallel branch-and-bound search recursively removes duplicate subgraphs, using the assembly indices of smaller fragments to bound the indices of their parents. The branch-and-bound variants differ in the lower bound they apply: no bound (bb-naive), a logarithmic bound $\log_2 b$ on the remaining $b$ bonds (bb-logbound), an integer addition chain bound (bb-intbound), and a combination of the integer addition chain bound with a novel vector addition chain bound (bb-allbounds). These bounds let the search discard pathways that cannot beat the best path found so far; the vector addition chain bound is the load-bearing novelty that yields the largest speedups on larger molecules.

What would settle it

Run bb-allbounds and the fully enumerating bb-naive algorithm on every molecule in the four provided reference datasets; if any molecule receives a strictly larger assembly index from bb-allbounds, the vector addition chain bound has pruned an optimal pathway and the exactness claim for the default algorithm is false.

Watch

Extended reading notes

Core claim

The central claim is that assembly-theory is the first open, cross-platform, high-performance package to compute exact molecular assembly indices, and that its fastest algorithm turns previously impractical calculations into routine ones. The paper demonstrates this by benchmarking all algorithm variants against the prior Go implementation on four curated datasets, reporting speedups of 6.5 to 410 times depending on the dataset and variant. The fastest variant, bb-allbounds, combines the integer addition chain bound from earlier work with a newly introduced vector addition chain bound, and it is the package's default algorithm. The paper also supplies unit and integration tests, per-molecule timing data, and ground-truth tables derived from a closed-source prior algorithm, positioning the package as a framework for fair comparison of future algorithmic improvements.

Load-bearing premise

The fastest algorithm's guarantee of exactness depends on the claim, stated in Section 3 without proof, that its new vector addition chain lower bound never underestimates the number of construction steps still required; if that bound can be too small, pruning could discard the shortest assembly pathway.

Editorial extensions

If this is right

  • Exact assembly indices become available for molecules up to at least 25 heavy atoms in seconds to minutes on commodity hardware, making large-scale chemical-space studies practical.
  • The curated datasets with ground-truth values provide a common testbed for comparing current and future assembly-index algorithms on equal footing.
  • Python bindings and compatibility with standard cheminformatics tooling let practicing chemists compute assembly indices without learning Rust or handling raw file formats.
  • The modular algorithm interface means new bounding strategies can be added and benchmarked without rewriting the search machinery.
  • Speedups of up to 410 times on natural products imply that molecules that previously took over an hour now finish in seconds, enabling exploratory metabolomics and life-detection workflows.

Reading between the lines

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

  • The same two-phase search with both addition-chain bounds could transfer to other decomposition problems, such as retrosynthesis planning or polymer construction, where an object is built by joining isomorphic fragments.
  • Per-molecule timings in the paper suggest that molecules with many disjoint isomorphic subgraph pairs are the hard cases, so future algorithms might focus on pruning the enumeration of those pairs rather than the search itself.
  • The open ground-truth tables, though initially derived from a closed-source tool, could let the community develop independent exact implementations and machine-learning estimators calibrated against exact assembly indices.
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

3 major / 4 minor

Summary. The manuscript presents assembly-theory, an open-source Rust package for computing molecular assembly indices, with multiple branch-and-bound variants, Python bindings, and curated benchmark datasets. It claims exact computation of assembly indices with speedups of one to two orders of magnitude over the existing assembly_go tool. The paper focuses on software design, functionality, and benchmarking rather than on algorithmic theory.

Significance. If the exactness claims hold, this is a valuable contribution to the chemical informatics community: it provides open, cross-platform, reproducible molecular-assembly-index calculation and a modular framework for comparing future algorithms. The Rust implementation, Python/RDKit integration, and inclusion of test and benchmark suites are concrete strengths that should be credited. However, the central exactness claim depends on an unproven lower bound and on validation against a closed-source implementation, so the package cannot yet be endorsed as exact without further support.

major comments (3)
  1. [Section 3 (bb-allbounds)] The 'novel bound provided by a vector addition chain' is introduced without a definition or proof of admissibility. In a branch-and-bound search, a lower bound must never exceed the true minimum number of remaining assembly steps; otherwise pruning can discard optimal pathways and the algorithm can return an overestimate of the assembly index. Since bb-allbounds is the default algorithm, this unproven bound is load-bearing for the paper's headline claim of exact, fast computation. Please either provide a proof that the vector chain bound is admissible, or clearly label bb-allbounds as approximate/heuristic and adjust the exactness claims accordingly.
  2. [Section 5 (Validation)] The correctness validation relies entirely on ground-truth assembly indices 'calculated using the closed-source [16] algorithm, privately provided to us by the authors.' This is not an independent check: matching another implementation of the same algorithm family does not rule out shared systematic errors, especially since [16] is itself a branch-and-bound method. The test datasets also cover assembly indices only up to 16, so the novel bound is not stressed on large, hard instances. I recommend cross-validating against bb-naive (exhaustive enumeration) for small molecules, and ideally against an independent oracle, and adding such tests to the published test suite.
  3. [Section 5 (Table 1)] The headline speedup numbers in Table 1 are reported as means without any measure of variance, and the coconut_55 assembly_go entry is a single sample. As these numbers are a central claim of the paper, please report standard deviations or confidence intervals for the 20-sample runs, and mark the single-sample entry as preliminary.
minor comments (4)
  1. [Figure 2 caption] The caption says 'The same four assembly-theory branch-and-bound algorithms from Fig. 1 are shown here,' but Fig. 1 is an illustration of assembly pathways for anthracene, not the algorithms; the reference should likely be to Section 3 or Table 1.
  2. [Section 5 (Dataset descriptions)] The description of gdb17_200 contains a typo: 'Flourine' should be 'Fluorine'.
  3. [Section 6 (Availability)] The availability section states that source code is on GitHub but does not give the repository URL in the text; please include the explicit URL for reproducibility.
  4. [Section 4.3 (Python interface)] The Python function signature uses set[str] with a default None; consider using Optional[Set[str]] or a sentinel value for clarity.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the software is validated against an external closed-source oracle, but no claimed result reduces to its own inputs by construction.

full rationale

This paper is a software and benchmarking contribution rather than a mathematical derivation, so the circularity analysis reduces to checking whether any algorithmic claim is defined in terms of its own output or fitted from the data it is meant to predict. The nearest candidate is Section 5, where the test suite validates assembly indices against "ground truth assembly indices calculated using the closed-source [16] algorithm, privately provided to us by the authors." This is a real validation dependency: the open package is benchmarked against another implementation of the same quantity, and if that oracle is wrong the package will inherit the error. But this is cross-validation against an external implementation, not a construction in which the predicted quantity is defined as the input or statistically forced from it. Similarly, bb-intbound imports the integer addition chain bound from [16], and bb-allbounds adds an unproved "novel bound provided by a vector addition chain"; the lack of a proof of admissibility is a correctness risk, but the paper never defines the novel bound in terms of the target assembly index, so no in-paper equation-level reduction exists. The self-citations ([5], [12], [17], [19]) support background theory and are not load-bearing for the software's exactness or speed claims. No circular step can be exhibited from the paper's text, so the appropriate finding is no significant circularity.

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

The central claim (computing exact assembly indices quickly) rests on two unverified assumptions: correctness of the closed-source ground truth, and admissibility of the novel vector addition chain bound. No free parameters or invented physical entities are introduced.

assumptions (3)
  • domain assumption The closed-source algorithm of Seet et al. [16] produces correct assembly indices, so the ground-truth CSVs are reliable references.
    Section 5: ground truth values were 'calculated using the closed-source [16] algorithm, privately provided to us by the authors'. The validation suite treats these as correct.
  • ad hoc to paper The novel vector addition chain bound is a valid lower bound on the number of remaining assembly steps, so pruning with it preserves exactness.
    Section 3 introduces bb-allbounds with 'a novel bound provided by a vector addition chain'. No proof of admissibility is given; the exactness of bb-allbounds depends on this unverified property.
  • domain assumption The benchmark protocol (same machine, sequence of molecules, exclusion of parsing time) provides a fair comparison of assembly_go and assembly-theory.
    Table 1 and Section 5 describe the protocol. The authors benchmarked assembly_go themselves, but the closed-source [16] implementation is not directly compared.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Open, Reproducible Calculation of Assembly Indices." pith.science (2026). https://pith.science/paper/DNI3VQGR

@misc{pith2026250708852,
  author       = {Pith},
  title        = {Pith review of: Open, Reproducible Calculation of Assembly Indices},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DNI3VQGR}},
  note         = {Machine review of arXiv:2507.08852}
}
read the original abstract

We present assembly-theory, a Rust package for computing assembly indices of covalently bonded molecular structures. This is a key complexity measure of assembly theory, a recent theoretical framework quantifying selection across diverse systems, most importantly chemistry. assembly-theory is designed for researchers and practitioners alike, providing (i) extensible, high-performance implementations of assembly index calculation algorithms, (ii) comprehensive benchmarks against which current and future algorithmic improvements can be tested, and (iii) Python bindings and RDKit-compatible data loaders to support integration with existing computational pipelines.

Figures

Figures reproduced from arXiv: 2507.08852 by the authors.

Figure 1
Figure 1. Assembly Pathways for Anthracene. Starting with bonds as building blocks (yellow), a joining operation yields progressively larger structures by combining any two compatible structures that have already been constructed (arrows). These intermediate structures must obey valence rules but otherwise do not have to be physically accessible or chemically synthesizable. There may be many assembly pathways from building bl… view at source ↗
Figure 2
Figure 2. Per-Molecule Benchmark Times. The mean assembly index calculation time across 20 samples for each molecule (dot) in gdb17_200 as a function of the molecule’s number of duplicate isomorphic subgraphs, a measure roughly correlated with the molecule’s size and complexity. The same four assembly-theory branch-and-bound algorithms from [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

20 extracted references · 9 canonical work pages

  1. [16]

    Patarroyo, Gage Siebert, Sara I

    Ian Seet, Keith Y. Patarroyo, Gage Siebert, Sara I. Walker, and Leroy Cronin. 2024. Rapid Computation of the Assembly Index of Molecular Graphs. https://doi.org/10.48550/arXiv.2410.09100 arXiv:2410.09100

    arXiv doi:10.48550/arxiv.2410.09100 2024

  2. [1]

    RDKit: Open-Source Cheminformatics

    2024. RDKit: Open-Source Cheminformatics. https://doi.org/10.5281/zenodo.591637

    doi:10.5281/zenodo.591637 2024

  3. [2]

    Blum and Jean-Louis Reymond

    Lorenz C. Blum and Jean-Louis Reymond. 2009. 970 Million Druglike Small Molecules for Virtual Screening in the Chemical Universe Database GDB-13. Journal of the American Chemical Society 131, 25 (2009), 8732–8733. https://doi.org/10.1021/ja902302h

    doi:10.1021/ja902302h 2009

  4. [3]

    Venkata Chandrasekhar, Kohulan Rajan, Sri Ram Sagar Kanakam, Nisha Sharma, Viktor Weißenborn, Jonas Schaub, and Christoph Steinbeck. 2025. COCONUT 2.0: A Comprehensive Overhaul and Curation of the Collection of Open Natural Products Database. Nucleic Acids Research 53, D1 (2025), D634–D643. https://doi.org/10.1093/nar/gkae1063 8 Vimal, Parzych, Smith, Par...

    doi:10.1093/nar/gkae1063 2025

  5. [4]

    Gebhard, Aaron C

    Timothy D. Gebhard, Aaron C. Bell, Jian Gong, Jaden J. A. Hastings, G. Matthew Fricke, Nathalie Cabrol, Scott Sandford, Michael Phillips, Kimberley Warren-Rhodes, and Atılım Güneş Baydin. 2022. Inferring Molecular Complexity from Mass Spectrometry Data Using Machine Learning. In Machine Learning and the Physical Sciences Workshop at NeurIPS

    work page 2022

  6. [5]

    Michael Jirasek, Abhishek Sharma, Jessica R. Bame, S. Hessam M. Mehr, Nicola Bell, Stuart M. Marshall, Cole Mathis, Alasdair MacLeod, Geoffrey J. T. Cooper, Marcel Swart, Rosa Mollfulleda, and Leroy Cronin. 2024. Investigating and Quantifying Molecular Complexity Using Assembly Theory and Spectroscopy. ACS Central Science 10, 5 (2024), 1054–1064. https://...

    work page doi:10.1021/acscentsci.4c00120 2024

  7. [6]

    Constructing the Molecular Tree of Life using Assembly Theory and Mass Spectrometry

    Amit Kahana, Alasdair MacLeod, Hessam Mehr, Abhishek Sharma, Emma Carrick, Michael Jirasek, Sara I. Walker, and Leroy Cronin. 2024. Constructing the Molecular Tree of Life Using Assembly Theory and Mass Spectrometry. https://doi.org/10.48550/arxiv.2408.09305 arXiv:2408.09305

    work page Pith review arXiv doi:10.48550/arxiv.2408.09305 2024

  8. [7]

    Minoru Kanehisa. 2019. Toward Understanding the Origin and Evolution of Cellular Organisms. Protein Science 28, 11 (2019), 1947–1951. https://doi.org/10.1002/pro.3715

    work page doi:10.1002/pro.3715 2019

Show all 20 references
  1. [8]

    Minoru Kanehisa, Miho Furumichi, Yoko Sato, Masayuki Kawashima, and Mari Ishiguro-Watanabe. 2023. KEGG for Taxonomy-Based Analysis of Pathways and Genomes. Nucleic Acids Research 51, D1 (2023), D587–D592. https: //doi.org/10.1093/nar/gkac963

    2023 doi

  2. [9]

    Minoru Kanehisa and Susumu Goto. 2000. KEGG: Kyoto Encyclopedia of Genes and Genomes. Nucleic Acids Research 28, 1 (2000), 27–30. https://doi.org/10.1093/nar/28.1.27

    2000 doi

  3. [10]

    Walker, Michael Lachmann, and Leroy Cronin

    Christopher Kempes, Sara I. Walker, Michael Lachmann, and Leroy Cronin. 2024. Assembly Theory and Its Relationship with Computational Complexity. https://doi.org/10.48550/arXiv.2406.12176 arXiv:2406.12176

    2024 doi arXiv

  4. [11]

    Marshall, Liam Wilbraham, and Leroy Cronin

    Yu Liu, Cole Mathis, Michał Dariusz Bajczyk, Stuart M. Marshall, Liam Wilbraham, and Leroy Cronin. 2021. Exploring and Mapping Chemical Space with Molecular Assembly Trees. Science Advances 7, 39 (2021), eabj2465. https: //doi.org/10.1126/sciadv.abj2465

    2021 doi

  5. [12]

    Marshall, Cole Mathis, Emma Carrick, Graham Keenan, Geoffrey J

    Stuart M. Marshall, Cole Mathis, Emma Carrick, Graham Keenan, Geoffrey J. T. Cooper, Heather Graham, Matthew Craven, Piotr S. Gromski, Douglas G. Moore, Sara. I. Walker, and Leroy Cronin. 2021. Identifying Molecules as Biosignatures with Assembly Theory and Mass Spectrometry. ...

    2021 doi

  6. [13]

    McKay and Adolfo Piperno

    Brendan D. McKay and Adolfo Piperno. 2014. Practical Graph Isomorphism, II. Journal of Symbolic Computation 60 (2014), 94–112. https://doi.org/10.1016/j.jsc.2013.09.003

    2014 doi

  7. [14]

    Jeffrey M. Perkel. 2020. Why Scientists Are Turning to Rust. Nature 588, 7836 (2020), 185–186. https://doi.org/10. 1038/d41586-020-03382-2

    2020

  8. [15]

    Blum, and Jean-Louis Reymond

    Lars Ruddigkeit, Ruud Van Deursen, Lorenz C. Blum, and Jean-Louis Reymond. 2012. Enumeration of 166 Billion Organic Small Molecules in the Chemical Universe Database GDB-17. Journal of Chemical Information and Modeling 52, 11 (2012), 2864–2875. https://doi.org/10.1021/ci300415d

    2012 doi

  9. [17]

    Kempes, Sara I

    Abhishek Sharma, Dániel Czégel, Michael Lachmann, Christopher P. Kempes, Sara I. Walker, and Leroy Cronin

  10. [18]

    Maria Sorokina, Peter Merseburger, Kohulan Rajan, Mehmet Aziz Yirik, and Christoph Steinbeck. 2021. COCONUT Online: Collection of Open Natural Products Database. Journal of Cheminformatics 13, 1 (2021), 2. https://doi.org/10. 1186/s13321-020-00478-9

    2021

  11. [19]

    Walker, Cole Mathis, Stuart Marshall, and Leroy Cronin

    Sara I. Walker, Cole Mathis, Stuart Marshall, and Leroy Cronin. 2024. Experimentally Measured Assembly Indices Are Required to Determine the Threshold for Life. Journal of The Royal Society Interface 21, 220 (2024), 20240367. https://doi.org/10.1098/rsif.2024.0367

    2024

  12. [2023]

    Nature 622, 7982 (2023), 321–328

    Assembly Theory Explains and Quantifies Selection and Evolution. Nature 622, 7982 (2023), 321–328. https: //doi.org/10.1038/s41586-023-06600-9

    2023 doi

Pith tools

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