Search arXivSearch

arXiv · 2606.21002

A Unified Generative Framework for Scalable Chemical Reaction Network Exploration

Abstract

Chemical reaction networks (CRNs) are crucial for understanding reaction mechanisms and guiding chemical synthesis, yet the computational exploration remains limited by the combinatorial growth of chemical space, the reliability of reaction path screening, and the cost of evaluating thermodynamic and kinetic properties. Here, we present ByteCRN, an end-to-end framework for computational CRN exploration that combines chemically informed reaction enumeration with generative transition state modeling. A key component of our framework is a generative rectified flow architecture for both transition state generation and reaction validation, where it maps reactant-product pairs to candidate transition state structures and verifies connectivity by mapping back to reactants and products. This unified generative strategy replaces the most expensive steps of conventional computational workflows, namely iterative transition state search and intrinsic reaction coordinate validation, within a complete CRN construction pipeline. ByteCRN delivers a 10--100-fold acceleration over traditional workflows while maintaining high predictive fidelity for individual reactions. At the network scale, it effectively prunes $\sim$70-90% of the enumerated reactions, streamlining the exploration of complex reaction space. Its utility is illustrated through the discovery of novel pathways involving cyanoacetaldehyde and the successful modeling of the challenging $γ$-ketohydroperoxide network, demonstrating a practical, scalable approach to autonomous chemical exploration.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zechang Sun, Chenxi Hu, Kailai Lin, Jin Li, Changsu Cao, Dingshun Lv, Ji Chen, Weiluo Ren, Hung Q. Pham. 2026-06-19. A Unified Generative Framework for Scalable Chemical Reaction Network Exploration. https://arxiv.org/abs/2606.21002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Global approximations to the error function of real argument for vectorized computation

The error function of real argument can be approximated to a given uniform relative accuracy by a single closed-form expression for the whole variable range either in terms of addition, multiplication, division, and square root operations only, or also using the exponential function. The coefficients have been tabulated for up to 128-bit precision. Tests of a computer code implementation using the standard single- and double-precision floating-point arithmetic show good performance and vectorizability. Approximations to the complementary error function have also been found, including those where only additions, multiplications, and one division are needed to reach a uniform absolute accuracy.

physics.chem-ph

From Heuristics to Machine Learning: The Performance Ceiling for Single-Ion Magnets and Its Electronic Origin

Machine learning (ML) is expected to speed up the discovery of single-ion magnets (SIMs), but does the structural information available before synthesis allow such predictions? For 1215 lanthanide complexes from the SIMDAVIS 1.2.1 database we compared three increasing levels of structural description: tabular features of the coordination site, continuous symmetry measures of the coordination polyhedron, and the complete 3D arrangement of atoms. All three converge to an accuracy near 76%, only slightly above the 71% of the single rule "predict SIM for Dy3+". To explain the failures, we combined multireference ab initio calculations with an inspection of the structures behind the high-confidence errors. The SIMs missed by the geometric models are field-induced relaxers whose ground Kramers doublets are prone to tunnelling, a property invisible to geometric descriptors. Many false positives contain several lanthanide centers or radicals, so their relaxation is collective and outside the single-ion picture. The electronic-structure and connectivity information needed to identify SIMs is therefore not accessible to geometric methods alone. Geometric models remain useful: restricting the screening to compounds with high prediction confidence raises the accuracy to 88% while retaining 48% of the dataset. Building on the analysis of the failures, we propose a strategy that combines simple filters for nuclearity and for radicals with ligand-field descriptors from ab initio calculations.

physics.chem-ph

Composition-Dependent Self-Diffusion Coefficients in Liquid Mixtures from Hybrid Machine Learning

Self-diffusion coefficients are key descriptors of molecular mobility, yet experimental data remain scarce, highlighting the need for reliable prediction methods. In previous work, we introduced the hybrid Enhanced Stokes-Einstein (ESE) model, which advanced the state of the art in the physically consistent prediction of self-diffusion coefficients of solutes at infinite dilution in pure solvents by integrating the Stokes-Einstein equation with machine learning (ML). Here, we extend this approach to concentration-dependent self-diffusion coefficients and multicomponent solvents with HADES. This hybrid architecture leverages a deep-set neural network to connect pure-component and mixture prediction within a single framework. HADES predicts self-diffusion coefficients in liquid mixtures with any number of components at any composition and temperature. The only required inputs are SMILES-encoded molecular structures of the components and the pure-component viscosities, making the method broadly applicable. Trained and evaluated on a comprehensive dataset of 2526 data points for 600 systems, HADES significantly outperforms benchmark prediction methods. The trained model and its source code are fully disclosed, and the application is available via an interactive website https://ml-prop.mv.rptu.de/.

physics.chem-ph