{"id":"ba72584d-97a2-480e-9d69-774633407035","arxiv_id":"2607.04810","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Disguised complex-balanced parameter loci of mass-action systems equal the set of rate vectors whose monomial powers match those of some positive vector in the disguised complex-balanced flux cone.","lead":"The paper rewrites the search for rate constants that make a reaction network 'disguised complex-balanced' as binomial equations on a flux cone, eliminating the concentration variables. This turns a hard quantifier-elimination problem into a lower-dimensional algebraic check that inherits classical stability guarantees.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The Reader correctly isolates the ambient-graph reduction as the softest external assumption, yet that reduction is standard, explicitly flagged (Remark 17), and does not affect the novelty or correctness of the elimination step that constitutes the paper’s contribution. Because the derivation of Theorem 20 from Theorem 16 is a direct, assumption-light application of an already-published existence criterion, and because the example recovers a known answer, no load-bearing internal concern arises. The recommended concrete check simply reconfirms the published example by an independent computational path; success leaves the ACCEPT verdict untouched.","tokens_in":15531,"tokens_out":404,"duration_ms":3931,"concrete_test":"Independently recompute the disguised complex-balanced flux cone C_dCB for the four-vertex cycle of §4 by polyhedral projection (e.g., via lrs or Polymake) from the s-cone defined by (DE)+(CB), then solve the binomial system of Theorem 20 analytically; confirm that the resulting semi-algebraic set is identical to the inequality (⋆) already obtained by Boros et al. via full (x,\nu)-quantifier elimination.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (Theorem 20) follows directly from applying the authors' prior positive-algebraic-geometry framework (Corollary 19 / Theorem 18 of [24]) to the polyhedral characterization already obtained in Theorem 16. The only potential incompleteness flagged by the Reader—the ambient complete-graph reduction of Proposition 11 resting on Theorem 9—is inherited from Craciun et al. and is made fully explicit; the paper further supplies a self-contained proof of the key elimination step (Theorem 8) and verifies that the resulting locus coincides with the independently computed locus of Boros et al. on the running example. No internal gap in the elimination argument itself is visible.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper studies mass-action systems that are not themselves complex-balanced but are dynamically equal to complex-balanced realizations (disguised complex-balanced systems). It first reformulates membership of a rate vector k in the disguised complex-balanced parameter locus K_dCB as the existence of positive concentrations x such that the reaction-rate vector v_k(x) lies in a polyhedral cone C_dCB (the disguised complex-balanced flux cone), yielding a parametrized system of polynomial inequalities (Theorem 16). Applying the authors’ earlier positive-algebraic-geometry framework, the concentrations are eliminated, producing an equivalent characterization solely in terms of binomial equations on the positive part of that cone intersected with the simplex (Theorem 20). A self-contained proof of the key reduction that only source complexes of the original network need be retained (Theorem 8) is supplied, and the method is illustrated on the partially reversible cycle of Boros et al., recovering their locus analytically after the elimination step.","tokens_in":15679,"tokens_out":738,"duration_ms":6219,"significance":"If correct, the result supplies a systematic algebraic reduction that removes the state variables from the quantifier-elimination problem defining the disguised complex-balanced locus. This is a genuine computational and conceptual advance over the full (x,\nu)-elimination performed by Boros et al., and it places the problem cleanly inside the authors’ existing theory of generalized polynomial inequalities. The paper is largely self-contained: it re-proves the essential dynamical-equivalence reduction (Theorem 8) and verifies that the resulting locus coincides with an independently obtained description on a nontrivial example. The contribution is therefore both theoretical (a new geometric object, the disguised complex-balanced flux cone, together with an explicit binomial characterization) and practical (a reduced elimination problem).","major_comments":[],"minor_comments":[{"comment":"The ambient complete-graph construction (Proposition 11) and the subsequent relevant-edge subgraph (Remark 17) are correct but could be sign-posted more clearly for readers who have not internalized Theorem 9; a short sentence after Proposition 11 reminding that V'_s \\subseteq V_s is already guaranteed by Theorem 9 would help.","section":null},{"comment":"In the example, the four homogeneous linear equations that reduce the six-dimensional problem to a quadratic in \nu_41/\nu_12 are stated without an intermediate matrix or Gröbner step; a one-line reference to the explicit basis of D would make the reduction fully reproducible by hand.","section":null},{"comment":"Notation for the kinetic matrix Γ_k versus the stoichiometric matrix N is introduced carefully, yet the switch between \nu = v_k(x) and the auxiliary \nū occasionally forces the reader to re-check which graph is intended; a consistent subscript (e.g., \nu^E versus \nū^{E_com}) would reduce cognitive load.","section":null},{"comment":"The phrase “s-cone” is used once without definition; either expand it or cite the earlier paper [23] more explicitly at that point.","section":null}],"recommendation":"accept","confidential_remarks":"The manuscript is a clean, incremental application of the authors’ own positive-algebraic-geometry machinery to a problem introduced by Craciun et al. Novelty is real but modest; the journal’s scope for algebraic methods in dynamical systems appears appropriate. No citation or priority concerns."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The one thing worth knowing: they take the flux-cone view of disguised complex balance (already in Boros et al.) and apply their own positive-algebraic-geometry machinery to kill the concentration variables, leaving only binomial equations on the dCB flux cone. That is Theorem 20. It is a genuine computational simplification of a known quantifier-elimination problem.\n\nWhat works. The chain from Definition 10 through the lemmas to Theorems 16 and 20 is written out carefully and self-contained. They give a streamlined, flux-only proof of the key reduction (Theorem 8) that earlier papers had packaged with extra language. On the Boros running example they recover the same locus analytically after the elimination, which is a useful sanity check. The geometric object they isolate—the dCB flux cone—is clean and reusable. Citations are honest; they do not hide the dependence on Craciun et al. or on their own prior framework.\n\nSoft spots are minor and proportional. The ambient complete-graph construction (and the claim that one never needs new source complexes) is inherited from Craciun et al.; the authors flag it and supply the supporting reduction, so it is not a hidden gap. The paper is methods-first: it does not open a new dynamical regime or settle a conjecture. Significance is therefore local to people who actually compute these loci. No circularity, no invented objects beyond the named cone, no free parameters.\n\nThis is for the CRNT / real-algebraic methods crowd who already care about disguised toric loci and want a lower-dimensional elimination step. It deserves a serious referee. I would accept it for peer review without hesitation; the math is sound and the contribution is real even if modest.","headline":"Clean elimination theorem that removes concentrations from the dCB locus computation; solid methods paper, not a conceptual breakthrough.","tokens_in":16309,"tokens_out":423,"would_cite":true,"duration_ms":4231,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["37N25","34C08","14P10","14Q30","92C42"],"pacs":[],"model":"grok-4.5","headline":"Disguised complex balance reduces to binomial equations on a flux cone, eliminating concentrations from the parameter-locus problem.","keywords":["reaction networks","mass-action kinetics","complex balance","dynamical equality","polynomial inequalities","monomial dependency","disguised complex-balanced flux cone"],"falsifier":"Exhibit a mass-action system whose disguised complex-balanced locus, computed by full quantifier elimination over concentrations and fluxes, properly contains the locus obtained from the binomial equations on the flux cone of the complete source digraph.","tokens_in":16415,"feed_emoji":"⚗️","tokens_out":646,"duration_ms":5136,"temperature":0.7,"pith_summary":"Mass-action reaction networks that are not themselves complex-balanced can still inherit the strong stability properties of complex balance if they are dynamically equal to some auxiliary complex-balanced network. Finding the rate-constant values for which this happens is a hard algebraic quantifier-elimination problem involving both concentrations and reaction rates. This paper shows that the problem is equivalent to a parametrized system of polynomial inequalities whose feasible set is the positive part of a polyhedral flux cone. Applying positive algebraic geometry then converts the inequalities into binomial equations on that cone alone, completely eliminating the concentration variables. The resulting characterization is used to recover, analytically, the disguised-complex-balanced locus of a standard partially reversible cycle, matching earlier computer-algebra results while working only with flux variables.","feed_headline":"Flux-cone binomials find disguised complex balance","feed_subtitle":"Concentrations drop out; rate constants that inherit global stability are decided by equations on fluxes alone.","key_machinery":"The disguised complex-balanced flux cone C_dCB together with the monomial dependency subspace D = ker(Y_s I_{E,s}; 1^T). Membership of a rate vector k in the locus is decided by existence of a normalized positive flux ν in C_dCB that satisfies the binomial equations ν^z = k^z for all z in D.","core_discovery":"The disguised complex-balanced parameter locus of a reaction network equals the set of positive rate vectors k for which there exists a positive flux vector ν lying in the normalized positive part of the disguised complex-balanced flux cone and satisfying the binomial equations ν^z = k^z for every vector z in the monomial dependency subspace of the source complexes. This identity removes the concentration variables from the original quantifier-elimination formulation.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Flux-cone binomials fix rates that disguise complex balance","Disguised balance locus equals binomial solutions on flux cone","Concentrations vanish; flux binomials set complex-balance rates","Positive flux vectors and binomials locate disguised balance","Monomial dependency binomials decide disguised complex balance"],"cache_read_input_tokens":128,"weakest_assumption_plain":"Every dynamically equal complex-balanced realization can be realized using only source complexes already present in the original network, so it is enough to work inside the complete digraph on those source vertices.","fun_headline_variants_meta":{"raw":{"variants":["Flux-cone binomials fix rates that disguise complex balance","Disguised balance locus equals binomial solutions on flux cone","Concentrations vanish; flux binomials set complex-balance rates","Positive flux vectors and binomials locate disguised balance","Monomial dependency binomials decide disguised complex balance"]},"model":"grok-4.5","effort":"low","cost_usd":0.004668,"raw_usage":{"total_tokens":1322,"prompt_tokens":768,"num_sources_used":0,"completion_tokens":80,"cost_in_usd_ticks":46680000,"prompt_tokens_details":{"text_tokens":768,"audio_tokens":0,"image_tokens":0,"cached_tokens":128},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":474,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":768,"tokens_out":80,"duration_ms":3935,"temperature":1.0,"reasoning_tokens":474,"cache_read_input_tokens":128,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-11T13:09:59.291054+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Exhibit a mass-action system whose disguised complex-balanced locus, computed by full quantifier elimination over concentrations and fluxes, properly contains the locus obtained from the binomial equations on the flux cone of the complete source digraph.","supporting_citations":[],"review_version":1}