{"id":"ba1e3b34-57a1-4e87-8769-c52360e26f10","arxiv_id":"1908.04593","paper_version":2,"verdict":"REJECT","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper derives bounds and class results for independent fundamental decompositions of reaction networks, and claims an improved multistationarity algorithm for power-law systems with non-reactant-determined interactions.","lead":"This mathematics paper studies the 'fundamental decomposition' of chemical reaction networks, which splits a network into smaller subnetworks, and asks when those pieces are independent. It then claims this structure lets a computational test for multiple steady states skip a transformation step for a class of power-law kinetic systems.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The claimed MSA improvement is unproven: Theorem 6.1 shows only that CF-RI+ preserves F-decomposition independence, not that multistationarity computations are unchanged or that the transformation can be omitted.","rationale":"The reader identified Theorem 3.13(ii) as the weakest assumption, and that proof step is indeed faulty: the incidence matrix is not a direct sum over fundamental classes when subnetworks share complexes, as the running example's N1 and N2 share M1. However, the more load-bearing gap for the paper's central claim is that Section 6 never connects F-decomposition independence to the actual multistationarity algorithm. Theorem 6.1 is purely a statement about independence being preserved under CF-RI+; it says nothing about the HDA computation, equivalence classes, or the multistationarity verdict. Even if Theorem 3.13 were repaired, the abstract's assertion that the transformation 'is not necessary' would still lack a derivation. The reader's rationale mentions this second gap, so there is partial agreement, but the reader's stated weakest assumption focuses on the structural theorem rather than on the unproven algorithmic implication. The structural portion of the paper may be salvageable with corrections, but the central MSA claim as stated is not supported by the presented proofs.","tokens_in":18922,"tokens_out":5888,"duration_ms":59497,"concrete_test":"For the carbon-cycle subnetwork of Examples 3.12 and 6.2, perform the MSA twice: once on the original PL-NDK with its bi-independent F-decomposition (no CF-RI+ transform) and once on the CF-RI+-transformed PL-RDK system. Record the HDA equivalence classes and the final multistationarity verdicts in both runs. If the direct run is not well-defined or yields a different verdict, the Section 6 claim fails; if they match, the improvement is repairable but still needs a stated theorem.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 6's Theorem 6.1 is the entire support for the abstract's improvement claim, but it states only that CF-RI+ preserves orientation size and that F-decomposition independence is equivalent between N and N_RI. It does not state or prove that the MSA's multistationarity computation is unchanged, that the equivalence classes used by HDA are retained, or that a PL-NDK system can be processed without first becoming PL-RDK. The prose before Theorem 6.1 asserts this implication, but no theorem or lemma derives it. Moreover, the proof invokes Theorem 3.13 to pass from F-decomposition independence to P-decomposition independence; Theorem 3.13(ii) establishes the incidence-independent analogue through a block-diagonal display that is false when fundamental classes share complexes, as they do in the running example (N1 and N2 share M1). Hence the abstract's 'not necessary' assertion is unsupported. The structural results on F-decompositions may be independently useful, but they do not by themselves justify the MSA improvement.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the fundamental (F-)decomposition of chemical reaction networks, which partitions reactions into fundamental classes introduced by Ji and Feinberg for the higher deficiency algorithm. The first part characterizes independence and incidence-independence of F-decompositions and relates these to P- and O-decompositions, with applications to S-system and phosphorylation/dephosphorylation networks. The second part introduces a transformation CF-RI+ that preserves reaction reversibility and claims that, for power-law kinetic systems with non-reactant-determined interactions (PL-NDK) whose F-decomposition is independent, the original Multistationarity Algorithm (MSA) can be applied without first transforming to a reactant-determined (PL-RDK) system. The running example is a subnetwork of Schmitz's carbon cycle model. The paper concludes that the CF-RM transformation is unnecessary under the independence assumption.","tokens_in":19086,"tokens_out":9112,"duration_ms":86850,"significance":"If the central claims hold, the paper would provide useful structural tools for F-decompositions and a practical simplification of the MSA for a class of PL-NDK systems. The identification of network classes with bi-independent F-decompositions (S-systems, phosphorylation/dephosphorylation networks) and the running carbon-cycle example are valuable and clearly presented. However, the advertised MSA improvement is not proven by the stated theorems, and the proof of a key structural equivalence (Theorem 3.13(ii)) relies on a false block-diagonal assertion. The paper is therefore a useful contribution in need of substantial revision, but the central application claim requires new arguments or a reformulation.","major_comments":[{"comment":"The proof asserts that 'By definition, the incidence matrix of the network is the direct sum of the incidence matrices of the fundamental classes' and displays a block-diagonal matrix with blocks F0,...,Fw. This would require the set of complexes to be partitioned by the fundamental classes, but F-decompositions partition only the reaction set. In the running example (Running Examples 3.12 and 3.14), the subnetworks N1 and N2 share the complex M1, so the incidence matrix cannot be block-diagonal after reordering rows and columns. Consequently, the equivalence between P-decomposition and F-decomposition incidence-independence is not established by the given proof. This is load-bearing for the structural results in Sections 3 and 4 (including the bi-independence claims), and a corrected proof or an added hypothesis is needed.","section":"Section 3.2, Theorem 3.13(ii), proof"},{"comment":"The abstract claims that for PL-NDK systems with an independent F-decomposition, 'the transformation to a dynamically equivalent system with reactant-determined interactions ... is not necessary.' Theorem 6.1, however, proves only that CF-RI+ preserves orientation size and that F-decomposition independence is equivalent between N and NRI. It does not state or prove that the MSA's multistationarity computation is unchanged, that the equivalence classes used by the higher deficiency algorithm are retained, or that the extended HDA can be applied directly to a PL-NDK system. The paragraph before Theorem 6.1 asserts this implication without a proof. As written, the advertised improvement is unsupported and needs either a precise theorem connecting preservation of F-decomposition independence to the MSA's output, or a weakening of the claim.","section":"Section 6, Theorem 6.1 and the preceding paragraph"},{"comment":"The proof states that 'we can choose the same basis for Ker LO and Ker LORI such that the order of the rows of the reactions corresponding to the basis remains the same' and concludes that 'the equivalence classes are retained under the transformation.' This is asserted without a proof. CF-RI+ changes the complexes but leaves reaction vectors unchanged; a careful argument is needed to show that the equivalence classes of reactions (as subsets of the reaction index set) are indeed identical before and after transformation, especially when a fundamental class contains reactions with shared complexes. Without this lemma, the transfer of independence from N to NRI is incomplete.","section":"Section 6, proof of Theorem 6.1"}],"minor_comments":[{"comment":"There are several typographical errors, including 'stochiometric' in Proposition 5.2(ii), 'the the network' in the proof of Theorem 3.13(ii), and 'disscussion' in Section 3.1. These should be corrected.","section":"Throughout"},{"comment":"The definition of fundamental classes is written with repeated symbols such as 'y→y′ and y→y′', which makes the intended meaning unclear. Please rewrite using distinct reaction labels.","section":"Section 3.1, Definition of fundamental classes"},{"comment":"The text says 'the dimension of the stoichiometric subspaces of the fundamental classes under the F-decomposition is equal to the dimension of the stoichiometric subspaces of N'; it should say that the sum of the dimensions of the subnetwork stoichiometric subspaces equals the dimension of the stoichiometric subspace of N.","section":"Section 3.2, Running Example 3.14"},{"comment":"The proof of Theorem 4.14 is very difficult to follow because of the notation using primes and double primes on complex labels and coefficients. A clearer notation (e.g., subscripted indices) and a more structured argument would substantially improve readability.","section":"Section 4.3, Theorem 4.14 proof"},{"comment":"The paper relies heavily on unpublished or in-preparation references: [6] (Farinas et al., 'in preparation'), [12] (Gross et al., 'submitted'), and [13] (Hernandez et al., 'to appear'). Please update these references where possible and clarify the status of [6], since Theorem 2.22 and several examples depend on it.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The reader's stress-test concern about Theorem 3.13(ii) is valid: the block-diagonal incidence-matrix display is false when fundamental classes share complexes. However, the equivalence stated in Theorem 3.13(ii) may itself be true (since adding a reverse reaction does not change the image of the incidence map), so a corrected proof is plausible. The more serious issue is that Theorem 6.1 does not deliver the abstract's 'not necessary' claim; that gap is conceptual and requires either a new theorem connecting CF-RI+ to MSA computations or a careful restriction of the claim. I therefore recommend major revision rather than rejection, but the authors should be asked to supply the missing arguments explicitly."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: read the first half, treat the second half with suspicion. The paper gives useful structural facts about fundamental decompositions — the bounds w≤s and w≤n−l, the three-type classification with deficiency consequences, and the identification of new classes (S-systems, multisite PD networks, chains of cycles) with independent/incidence-independent F-decompositions. The running example of the carbon-cycle subnetwork is a nice concrete illustration. I believe these results are new and mostly correct.\n\nThe main problem is the abstract's central claim. For PL-NDK systems with an independent F-decomposition, the paper says the CF-RM/CF-RI+ transformation is 'not necessary.' But Theorem 6.1 only proves that the CF-RI+ transform preserves the number of reactions in an orientation and preserves independence of the F-decomposition. It does not state or prove that the MSA's multistationarity test is unchanged, nor that the HDA extension from [13] can be applied directly to a PL-NDK system. The prose asserts this implication, and the proof of 6.1 mentions that equivalence classes are retained, but no theorem formally connects that to the MSA output. Without a precise description of the MSA algorithm and a lemma showing all its inputs are invariant under CF-RI+, the 'not necessary' claim is unsupported. That is a load-bearing gap.\n\nA smaller issue: the proof of Theorem 3.13(ii) displays the incidence matrix as a block diagonal over fundamental classes, which is false when fundamental classes share complexes (as they do in the running example). The stated equivalence between P- and F-decomposition incidence-independence is probably true — each F-class's incidence image is just the span of its P-class's images, since a reverse reaction contributes the negative of the forward reaction vector — so this is a repairable proof blemish rather than a false theorem. The abstract's 'necessary and sufficient conditions' phrasing is also stronger than what the paper actually derives; the results give necessary bounds plus equivalences, not a full characterization.\n\nWho should read it: people in chemical reaction network theory working on deficiency algorithms or multistationarity. The first half is citable. My recommendation: send it to peer review — it deserves a referee — but the referee should demand a proper statement and proof of the MSA improvement before acceptance. With that fixed, the paper would be solid.","headline":"Useful F-decomposition results, but the advertised MSA improvement outruns the proofs.","tokens_in":19638,"tokens_out":7427,"would_cite":true,"duration_ms":77331,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["37N25","80A30","92C40"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper claims that for power-law kinetic systems with an independent F-decomposition, the multistationarity algorithm can be applied directly, without first converting non-reactant-determined interactions into reactant-determined ones.","keywords":["fundamental decomposition","F-decomposition","chemical reaction networks","power-law kinetics","multistationarity","incidence-independence","reactant-determined kinetics"],"falsifier":"Construct a small CRN with two fundamental classes that share at least one complex, compute the image of the full incidence map and compare it with the direct sum of the images of the subnetwork incidence maps; if they differ, the incidence-independence equivalence in Theorem 3.13(ii) fails for that network.","tokens_in":18704,"feed_emoji":"🧪","tokens_out":3974,"duration_ms":38642,"temperature":0.7,"pith_summary":"The paper studies the F-decomposition of a chemical reaction network, the subnetworks formed by grouping reactions into fundamental classes as introduced for the higher deficiency algorithm. It gives conditions under which this decomposition is independent (the whole network's stoichiometric subspace is the direct sum of the subnetworks' subspaces) or incidence-independent, and identifies network classes, including phosphorylation/dephosphorylation systems and S-system embedded networks, that always have such decompositions. Its main applied claim is that for power-law kinetic systems with non-reactant-determined interactions but an independent F-decomposition, the earlier multistationarity algorithm works without the extra step of transforming the system into a dynamically equivalent reactant-determined one. If correct, this widens the class of biochemical models that can be screened for multiple steady states by direct computation; a subnetwork of Schmitz's carbon cycle model is the running example.","feed_headline":"Reaction splits let multistationarity tests skip a conversion step","feed_subtitle":"For non-reactant-determined power-law systems, an independent F-decomposition makes the usual kinetic conversion unnecessary.","key_machinery":"The F-decomposition is the partition of the reaction set into fundamental classes, where two characteristic vectors are in the same class if they are pairwise dependent in the factor space $\\mathbb{R}^R/(\\operatorname{Ker} L_O)^\\perp$, with reversible pairs and the zero class handled separately. The argument runs through the equivalence in Theorem 3.13, which transfers independence and incidence-independence between the P-decomposition and the F-decomposition, and through the CF-RI+ transformation, a variant of CF-RM that adds catalytic complexes to split non-reactant-determined nodes while preserving reaction reversibility and reaction vectors. Independence of the decomposition is what lets the multistationarity computation bypass the usual kinetic-order conversion step.","core_discovery":"The central claim is an equivalence: for any orientation of a chemical reaction network, the P-decomposition's independence is equivalent to the F-decomposition's independence, and likewise for incidence-independence and bi-independence (Theorem 3.13). Consequently, the fundamental decomposition carries the same structural information regardless of the chosen orientation. On this basis, the paper shows that a power-law kinetic system with non-reactant-determined interactions and an independent F-decomposition can be fed directly to the multistationarity algorithm: the CF-RI+ transformation preserves both orientation size and F-decomposition independence (Theorem 6.1), so the conversion to a reactant-determined system required in the original MSA is unnecessary.","pith_inferences":["A natural testable extension is to search for a CRN with an independent F-decomposition whose fundamental classes share complexes, and check computationally whether the incidence-independence equivalence of Theorem 3.13 still holds for that network.","Since the decomposition arguments are largely independent of the particular kinetics, the same shortcut may extend beyond power-law kinetics to generalized mass-action or other complex-factorizable kinetic systems.","The carbon-cycle example points to a broader family of networks formed by chains of long monomolecular directed cycles with shared boundary complexes, as generalized in Theorem 4.14; one could test whether the MSA shortcut persists when the chain is broken at several places.","If the block-diagonal assumption behind Theorem 3.13(ii) fails, the practical impact may be limited to C-decomposition-like cases, so identifying the exact boundary of validity would sharpen the algorithm's applicability."],"forward_implications":["If the F-decomposition is independent, the multistationarity algorithm can be applied directly to PL-NDK systems, eliminating the CF-RM conversion step required in the original MSA.","The class of systems checkable by the MSA includes PL-NDK systems with independent F-decompositions, such as the carbon-cycle subnetwork used as the running example.","Phosphorylation/dephosphorylation networks, including processive, distributive, dual-site ERK, and mixed-mechanism variants, have bi-independent F-decompositions and therefore fall into this favorable class.","An independent F-decomposition implies the deficiency bound $\\delta \\le w_{II}$, and a CRN with an independent F-decomposition without Type II subnetworks has zero deficiency, so known equilibrium results apply."],"supporting_citations":[{"why":"Introduces the fundamental classes and the higher deficiency algorithm on which the F-decomposition is built.","marker":"[14]"},{"why":"The authors' earlier work extending HDA to PL-RDK systems and introducing the original MSA, which the paper improves.","marker":"[13]"},{"why":"Analyzes the carbon-cycle subnetwork as a PL-NDK system and supplies the deficiency-zero theorem for that class.","marker":"[11]"},{"why":"Feinberg's decomposition theorem relating independent decompositions to positive equilibria, a foundation for the paper's decomposition analysis.","marker":"[7]"},{"why":"Documents incidence-independent decompositions and C-decompositions, used for the incidence-independence results.","marker":"[6]"},{"why":"Provides the CF-RM and CF-RM+ transformation methods from which the new CF-RI+ method is derived.","marker":"[17]"},{"why":"Source of Schmitz's carbon cycle model whose subnetwork serves as the running example.","marker":"[18]"}],"fun_headline_variants":["F-decomposition independence eliminates a kinetic conversion","One property lets multistationarity tests skip a conversion","Orientation-free F-decomposition simplifies power-law checks","Independent F-decomposition bypasses MSA conversion step"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof of Theorem 3.13(ii) assumes that grouping reactions into fundamental classes makes the incidence matrix block-diagonal over the subnetworks, which requires the fundamental classes to partition the complex set; but fundamental classes need not divide the complexes disjointly.","fun_headline_variants_meta":{"raw":{"variants":["F-decomposition independence eliminates a kinetic conversion","One property lets multistationarity tests skip a conversion","Orientation-free F-decomposition simplifies power-law checks","Independent F-decomposition bypasses MSA conversion step"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000269,"raw_usage":{"total_tokens":1621,"prompt_tokens":944,"completion_tokens":677,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":560,"completion_tokens_details":{"reasoning_tokens":615}},"tokens_in":560,"tokens_out":677,"duration_ms":6966,"temperature":1.0,"reasoning_tokens":615,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:38:11.175028+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Construct a small CRN with two fundamental classes that share at least one complex, compute the image of the full incidence map and compare it with the direct sum of the images of the subnetwork incidence maps; if they differ, the incidence-independence equivalence in Theorem 3.13(ii) fails for that network.","supporting_citations":[{"cited_title":"Ji, Uniqueness of equilibria for complex chemical reaction networks, Ph.D","cited_arxiv_id":null,"evidence_quote":"Introduces the fundamental classes and the higher deficiency algorithm on which the F-decomposition is built."},{"cited_title":"Hernandez, E","cited_arxiv_id":null,"evidence_quote":"The authors' earlier work extending HDA to PL-RDK systems and introducing the original MSA, which the paper improves."},{"cited_title":"Fortun, A","cited_arxiv_id":null,"evidence_quote":"Analyzes the carbon-cycle subnetwork as a PL-NDK system and supplies the deficiency-zero theorem for that class."},{"cited_title":"Feinberg, Chemical reaction network structure and the stability of complex isothermal reactors I: The deficiency zero and deficiency one theorems, Chem","cited_arxiv_id":null,"evidence_quote":"Feinberg's decomposition theorem relating independent decompositions to positive equilibria, a foundation for the paper's decomposition analysis."},{"cited_title":"Farinas, E","cited_arxiv_id":null,"evidence_quote":"Documents incidence-independent decompositions and C-decompositions, used for the incidence-independence results."},{"cited_title":"Nazareno, R","cited_arxiv_id":null,"evidence_quote":"Provides the CF-RM and CF-RM+ transformation methods from which the new CF-RI+ method is derived."},{"cited_title":"Schmitz, The Earth’s carbon cycle: Chemical engineering course material, Chem- ical Engineering Education 36(4) (2002) 296–309","cited_arxiv_id":null,"evidence_quote":"Source of Schmitz's carbon cycle model whose subnetwork serves as the running example."}],"review_version":1}