{"id":"357d7bb8-903f-40b1-a3b2-655f869fe654","arxiv_id":"1908.04449","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"A constrained least-squares method constructs exact Solov'ev tokamak equilibria whose boundary, including X-points, can be specified independently of the polynomial order.","lead":"This paper shows how to build exact magnetic equilibrium shapes for fusion plasmas with almost any desired boundary, using a least-squares fit plus added X-point constraints. The method decouples how precisely the boundary is specified from how complicated the mathematical solution is, so the solution size can be kept small.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Finite polynomial basis limits the decoupling claim: fixed I gives an N-parameter family of boundaries, so increasing M cannot drive the boundary error to zero; no convergence or conditioning results are provided.","rationale":"The reader's weakest assumption identifies the same load-bearing point: a truncated polynomial homogeneous solution matched at discrete points is assumed to approximate the full boundary, with no error bounds, convergence analysis, or conditioning study. My independent read of the manuscript confirms that this is the place where the central claim is least secure. The method itself is mathematically sound as a least-squares projection onto a finite-dimensional space, but the paper's language overstates the degree of decoupling. For fixed N, the attainable boundary curves form a finite-dimensional family, so no amount of additional boundary constraints can reduce the approximation error below the projection error. The examples show visual agreement for three shapes, but they do not demonstrate convergence of the boundary error as I increases, nor do they quantify the worst-case error between sample points. The X-point cases add a further uncontrolled element: the Gaussian weight in Eq. (26) removes the boundary constraint near the null point, so the separatrix shape in that region is determined by the polynomial solution and the three X-point constraints, not by the specified boundary; the size of the deviating region depends on an unspecified Δw. These gaps justify a conditional verdict, not rejection: the core construction is reproducible and likely correct as an approximation scheme, but the advertised 'arbitrary boundary' property is not established by the evidence presented. The recommended verdict remains CONDITIONAL, so UNCHANGED is appropriate; the proposed test would either confirm the plateau and weaken the decoupling claim or show that increasing I reduces the error, which would strengthen it.","tokens_in":7703,"tokens_out":5393,"duration_ms":59408,"concrete_test":"Reproduce the LSN case of Fig. 3(a) with I fixed at 8. For M = 32, 64, 128, 256, and 512, compute the maximum |ψ(R(α_j),Z(α_j))| on a dense set of roughly 1000 boundary points and the Hausdorff distance between the specified curve and the computed ψ=0 contour. If these errors level off at a nonzero plateau as M grows, the claim that boundary accuracy is decoupled from N is contradicted. Then vary I = 6, 8, 10, 12 at M = 4N to see whether the plateau decreases, and report the condition number of the normal matrix from Eqs. (16)–(17).","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim rests on the assumption that the least-squares procedure of Sec. II.C decouples the boundary specification from the size N of the homogeneous solution. This is only partially true. For fixed I, Eq. (10) defines an N-dimensional affine family of flux functions; the attainable zero-level sets form an N-parameter family of curves. Minimizing S in Eq. (15) over M boundary points for fixed N is a projection of the target boundary onto this family. Increasing M (Eq. 14) refines the discrete sampling of that projection; it cannot reduce the approximation error below the distance from the target curve to the family. Thus the abstract's claim that the boundary can be 'specified with an arbitrarily large number of constraints to ensure an accurate representation' holds only after I has been chosen large enough, which is precisely the coupling the paper claims to remove. The paper gives no error metric, no convergence study in I, and no condition-number data; the visual agreement in Figs. 2–3 is a self-consistency check on the same points used to fit. Near X-points the situation is worse: Eq. (26) deliberately downweights points near the null, so the shape of the separatrix there is not controlled by the specified boundary; the size of the uncontrolled region is set by an unspecified Δw.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper presents a constrained least-squares method for constructing exact Solov'ev equilibria, i.e., solutions of the Grad-Shafranov equation with linear source functions, whose plasma boundary is specified by a parametric curve. The boundary is enforced by minimizing the sum of squared residuals of the flux at a large number of points (M) relative to the number of degrees of freedom (N) in the homogeneous polynomial solution, and X-point constraints are imposed exactly using Lagrange multipliers. Three fixed-boundary and three diverted equilibria are shown as examples. The central claims are that the boundary specification can be decoupled from the polynomial expansion order and that arbitrarily many boundary constraints can be used while keeping N small.","tokens_in":7891,"tokens_out":6734,"duration_ms":68754,"significance":"If the decoupling claim were fully substantiated, the method would be a convenient tool for generating analytic equilibria for benchmarking and stability studies. The derivation of the normal equations and the constrained system is clear, the polynomial basis is provided explicitly, and the examples demonstrate that the approach is computationally cheap and easy to implement. However, the over-arching claim about arbitrary boundaries with fixed N is only partially true, and the quantitative support for boundary fidelity in the examples is missing; these gaps should be addressed before the method can be used with confidence for strongly shaped or diverted boundaries.","major_comments":[{"comment":"The central claim that the boundary definition can be decoupled from the size N of the homogeneous solution is not established as stated. For fixed I, Eq. (10) spans an N-dimensional linear space, and the set of attainable zero-level boundaries is an N-parameter family; the least-squares solution of Eqs. (16)–(17) is the projection of the target boundary samples onto that family. Enlarging M only refines the sampling of this projection and cannot reduce the approximation error below the distance from the target curve to the family. The paper shows no residual magnitudes, no convergence study as I is increased, and no conditioning information for the normal equations, so the abstract's claim that 'an arbitrarily large number of constraints' ensures accurate representation requires qualification: I must also grow with the boundary complexity.","section":"§II.C, Eqs. (10), (15)–(17)"},{"comment":"The Gaussian weight (26) intentionally de-emphasizes boundary points near an X-point, so the separatrix shape there is controlled by the X-point constraints and the polynomial expansion, not by the specified boundary. The extent of the uncontrolled region is determined by Δ_w, which is described only as 'appropriately chosen'; the paper gives no guidance or sensitivity analysis for this parameter. Since the visible deviations in Fig. 3 are near the X-points, a user cannot infer an accuracy guarantee for the boundary representation in diverted configurations.","section":"§II.D, Eq. (26), Fig. 3"},{"comment":"The paper claims applicability to configurations with 'one or more X-points,' but Section II.D formulates the Lagrange-multiplier procedure for a single (R_X, Z_X) only. The double-null example in Fig. 3(b) presumably requires two sets of constraints, and the manuscript does not explain how additional multiplier sets are appended or how potential inconsistency between multiple X-point constraints is handled. This omission is significant because the constraint system must be satisfied exactly for each X-point.","section":"§II.D, Eqs. (19)–(25)"}],"minor_comments":[{"comment":"The sentence 'there are obvious advantageous to having M≫N' should read 'advantages'; moreover, the examples use M=4N, which is not '≫' as the text suggests.","section":"§II.B, text near Eq. (14)"},{"comment":"The particular solution is denoted ψ_p in Eq. (7) but ψP in Eq. (15); the notation should be unified.","section":"§II.C, Eq. (15)"},{"comment":"The values of Δ_w used in the examples are not reported; at minimum, the paper should list these values and state the sensitivity of the computed boundary to this choice.","section":"§II.D, Eq. (26)"},{"comment":"The figures show only visual agreement between the specified points and the computed boundary; plotting the residual as a function of the parameter α would provide a much more informative measure of the method's accuracy, especially between sample points.","section":"Figures 2 and 3"},{"comment":"The statement that 'P_{I-1} has order I, while Q_I has order I+1' is potentially confusing because I is used both as a maximum index and as the polynomial order; a short explanation of the indexing convention would help.","section":"Appendix"},{"comment":"Reference [6] is listed as 'submitted for publication' without a journal name; this should be updated or completed before publication.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is within the scope of Physics of Plasmas and the proposed construction is potentially useful. The main concern is that the abstract and summary overstate the independence of boundary accuracy from the polynomial order; I recommend requiring either a tempered statement of the claims or the addition of a convergence study and residual metrics. The treatment of multiple X-points also needs to be explained explicitly."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Worth a look if you work with analytic equilibria for benchmarking. The new thing is simple and real: instead of matching M boundary points with M polynomial coefficients (the square system in Zheng and Cerfon-Freidberg), the authors solve an overdetermined least-squares problem with M>N, and impose X-point constraints exactly with Lagrange multipliers. The math in Eqs. (16)-(25) is correct, and the examples in Figs. 2-3 show that modest polynomial orders (I=6-12) handle quite shaped boundaries. The appendix polynomials are a useful resource, and implementation is straightforward.\n\nThe soft spots are mostly about the claims, not the derivation. The abstract says the boundary can be specified with 'arbitrarily large number of constraints' and that the polynomial order becomes independent of boundary accuracy. That's only half true. For fixed I, the homogeneous solution is an N-dimensional family of flux functions. Adding more M refines the discrete sampling of that family, but it cannot reduce the boundary error below the distance from the target curve to the family. So I and boundary complexity are still coupled; the paper just makes the coupling less direct. The examples demonstrate this in practice, but they don't measure it.\n\nThe numerical validation is also thinner than I'd like. No residuals, no convergence study in I, no conditioning numbers. The figures are self-consistency checks on the same points used for the fit. The X-point case has an additional open knob: the Gaussian weight width Δw in Eq. (26) is 'appropriately chosen' but never specified, and the near-X-point boundary is deliberately not controlled. The size of that uncontrolled region is unknown.\n\nFor a methods paper this is a solid, citable contribution. It doesn't need new physics to be useful. But the abstract should be toned down, and a revision should include an error metric and a small convergence study. I would send it to review.","headline":"A clean, useful extension of Solov'ev equilibrium fitting, but the abstract overstates the decoupling and validation is only visual; deserves review with requests for quantitative checks.","tokens_in":8476,"tokens_out":3705,"would_cite":true,"duration_ms":32491,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"A least-squares fit lets exact Solov'ev equilibria follow any specified tokamak boundary, with X-points included.","keywords":["Grad-Shafranov equation","Solov'ev equilibrium","tokamak boundary shaping","X-point","constrained least squares","polynomial basis","fixed-boundary equilibrium","free-boundary equilibrium"],"falsifier":"For a fixed boundary shape, solve the least-squares system using $M$ sample points and then measure the maximum distance between the computed $\\psi=0$ contour and the specified boundary on a much finer set of points; if that maximum error does not decrease as $M$ increases, or if it becomes large near X-points as the null constraints are added, the claimed decoupling of boundary accuracy from polynomial order is not working.","tokens_in":7411,"feed_emoji":"🧲","tokens_out":12720,"duration_ms":113236,"temperature":0.7,"pith_summary":"Tokamak force balance is governed by the Grad-Shafranov equation, and exact solutions—the Solov'ev equilibria—are usually limited by the small number of free parameters in an analytic solution; the boundary cannot have more degrees of freedom than the solution. This paper shows that enforcing the boundary with constrained least squares removes that tie: the boundary can be specified by an arbitrarily large number of points while the homogeneous solution keeps a small, fixed polynomial basis. With exact X-point constraints added through Lagrange multipliers, single- and double-null diverted equilibria with highly shaped boundaries are obtained as exact solutions of the linearized equation. The polynomial order thus becomes an accuracy parameter rather than a boundary-capacity parameter.","feed_headline":"One matrix inversion fits exact equilibria to any tokamak boundary","feed_subtitle":"A constrained least-squares fit separates boundary shape from polynomial order, with X-points imposed exactly.","key_machinery":"The machinery is the constrained least-squares system built from polynomial homogeneous solutions of $\\Delta^*\\psi=0$. The basis functions $P_i(R,Z)$ and $Q_i(R,Z)$, generated by the recursion $R\\,\\partial_R(R^{-1}\\partial_R f_{i-2})=-i(i-1)f_i$, each satisfy the homogeneous equation identically, so any linear combination is an exact solution. Boundary constraints are assembled into the inner product $\\langle p,q\\rangle=\\sum_j w_j\\,p(R_j,Z_j)q(R_j,Z_j)$ over $M$ points on the parametric boundary curve, and the normal equations for the coefficients are solved in one matrix inversion. X-point constraints are enforced exactly by adding three Lagrange-multiplier rows and columns, with a Gaussian weight $w=1-e^{-[(R-R_X)^2+(Z-Z_X)^2]/\\Delta_w^2}$ down-weighting boundary points near the null so that the exact null does not distort the boundary elsewhere.","core_discovery":"The central claim is that the fidelity of the boundary representation and the polynomial order of the homogeneous solution are decoupled. The flux function is written as $\\psi=\\psi_p+\\psi_h$, where $\\psi_p$ is a particular Solov'ev solution and $\\psi_h$ is a finite polynomial solution of $\\Delta^*\\psi=0$. Instead of requiring the number of boundary constraints $M$ to equal the number of coefficients $N$, the paper imposes $\\psi=0$ at $M\\gg N$ points in a least-squares sense, and for X-point configurations adds the three null conditions $\\psi=0$, $\\partial\\psi/\\partial R=0$, $\\partial\\psi/\\partial Z=0$ as exact constraints via Lagrange multipliers. Thus $M$ can be as large as the boundary specification demands while $N=2I$ (or $I$ for up-down symmetry) stays small, and $I$ is chosen only by how closely the computed boundary must follow the specified curve.","pith_inferences":["The same least-squares decoupling should transfer to other linear elliptic equations with known homogeneous solution families, though the paper does not explore that extension.","A natural robustness test not reported in the paper is the condition number of the normal matrix as $M$ and $I$ grow; ill-conditioning would limit how large $M$ can usefully become.","Because each boundary costs only one small linear solve, the method could generate exact equilibria in batches for scans over shape parameters, which would suit optimization or uncertainty studies."],"forward_implications":["Boundary specification no longer limits the analytic solution: users can add as many boundary points as they want while keeping the polynomial expansion small.","For up-down symmetric equilibria, only the even basis functions are needed and the constraints can be taken from half the boundary, halving the system size.","X-points enter as exact constraints rather than approximations, so single-null and double-null diverted configurations are handled in the same linear framework.","The resulting equilibria are exact analytic solutions of the linearized Grad-Shafranov equation and require only the inversion of a small linear system, making them convenient benchmarks for numerical equilibrium codes.","In the paper's examples, I=4 already gives acceptable results for the highly shaped fixed-boundary equilibria, and the displayed cases use M=4N."],"supporting_citations":[{"why":"Supplies the Grad-Shafranov equation whose exact solutions the paper constructs.","marker":"[1,2]"},{"why":"Defines the Solov'ev equilibrium family with linear pressure and poloidal-current source functions.","marker":"[12]"},{"why":"Provides the complete multipole solutions of the homogeneous equation that motivate the polynomial basis.","marker":"[13]"},{"why":"Introduces the polynomial expansion in powers of R and Z used for the homogeneous solution.","marker":"[14]"},{"why":"Earlier generalization to up-down asymmetric, diverted configurations with X-points; this paper extends it by decoupling M from N.","marker":"[15]"}],"fun_headline_variants":["Exact equilibria for any boundary shape in one matrix inversion","Decouple boundary fit from polynomial order: exact Solov'ev equilibria","Arbitrary plasma cross-sections, exact equilibria, fewer basis functions","X-points constrained exactly, polynomial order only set by accuracy","One inversion fits exact Solov'ev equilibria to any tokamak wall"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that a low-order polynomial solution fitted to many boundary points by least squares stays close to the specified boundary everywhere between those points, and that the Gaussian weighting near X-points does not degrade the fit elsewhere.","fun_headline_variants_meta":{"raw":{"variants":["Exact equilibria for any boundary shape in one matrix inversion","Decouple boundary fit from polynomial order: exact Solov'ev equilibria","Arbitrary plasma cross-sections, exact equilibria, fewer basis functions","X-points constrained exactly, polynomial order only set by accuracy","One inversion fits exact Solov'ev equilibria to any tokamak wall"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000226,"raw_usage":{"total_tokens":1402,"prompt_tokens":811,"completion_tokens":591,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":427,"completion_tokens_details":{"reasoning_tokens":509}},"tokens_in":427,"tokens_out":591,"duration_ms":5718,"temperature":1.0,"reasoning_tokens":509,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:42:19.651490+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For a fixed boundary shape, solve the least-squares system using $M$ sample points and then measure the maximum distance between the computed $\\psi=0$ contour and the specified boundary on a much finer set of points; if that maximum error does not decrease as $M$ increases, or if it becomes large near X-points as the null constraints are added, the claimed decoupling of boundary accuracy from polynomial order is not working.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the Solov'ev equilibrium family with linear pressure and poloidal-current source functions."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the complete multipole solutions of the homogeneous equation that motivate the polynomial basis."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces the polynomial expansion in powers of R and Z used for the homogeneous solution."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Earlier generalization to up-down asymmetric, diverted configurations with X-points; this paper extends it by decoupling M from N."}],"review_version":1}