{"id":"9df2df00-fef5-439b-898a-dca068400b72","arxiv_id":"1908.06199","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"Closed formulas and a recursion produce Gaussian or one-parameter-optimal quadrature nodes and weights for C0 and C1 spline spaces on non-uniform, asymmetric partitions.","lead":"This paper gives explicit formulas and a recursion for building optimal quadrature rules on splines with any number of subintervals, for both C0 and C1 continuity. The value is that isogeometric analysis can integrate curved shapes using fewer sample points without losing accuracy.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The recipe's validity for every admissible input is not established: Sections 4/8 assert rather than prove that the recursion keeps roots in [-1,1] and weights positive, and the link to known orthogonal-polynomial theory in (10.3) may leave the positivity domain after the first step.","rationale":"The reader identified the root-location/positivity propagation of the recursion as the weakest assumption; I agree. This is the single load-bearing point because the rest of the construction is explicit algebra: once the nodes are real, in [-1,1], and weights positive, exactness on the spline space can be verified by quadrature of the basis, as the author's cross-checks do. The manuscript's own Section 11 confesses the absence of proofs and gives only finite numerical evidence; the \"have to lie\" comments in Sections 4 and 8 are assertions, not consequences. My added observation about beta_new > 0 after one step and the sign of -96beta in (10.3) shows why the standard positivity theorems cannot be invoked without an extra argument. This does not mean the recipe is wrong; the worked examples and external comparisons are credible, but it does mean the claim \"all rules for every nonuniform asymmetric partition\" is not established. Hence the verdict should remain CONDITIONAL, and the reader's conditional status is unchanged.","tokens_in":27855,"tokens_out":13507,"duration_ms":129391,"concrete_test":"Implement the Appendix B Maple code and, for the c=1 odd-degree case, run a targeted search: for n=1..10, S=2..20, and all length-ratio sequences from {1/100,1/10,1,10,100} with asymmetric orders, compute the recursed (alpha_i,beta_i); at each subinterval compute the roots of Q_n and M_{n+1} and the weights via (2)/(6) with 200-digit precision, checking max|x_i|<=1 and w_i>0. Analytically, use the identification (10.3) to compute the positivity/oscillation domain of the Arvesu functional and verify whether the orbit from (0,0) under (3)/(3.1) stays inside that domain for all n,S,lambda. If any computed node falls outside [-1,1] or any weight is nonpositive, the claimed universality is falsified; if the orbit leaves the domain but nodes stay inside, an independent proof is still required to support the claim.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim requires that the alpha,beta produced by recursion maps (3)/(3.2*), with stretching (3.1), make Q_n and M_n the orthogonal polynomials of a positive measure whose zeros lie in [-1,1] and whose quadrature weights are positive. The paper never proves this. Section 4 step 5 and Section 8 steps 6/10 merely comment that the roots \"have to lie\" in [-1,1], and Section 11 states \"I did not add any proofs\" and reports only finite numerical checks (S,N <= 20, roughly 200 digits) plus a few cross-checks. The asserted link to Arvesu/Krall polynomials, (10.3), maps Q_n to parameters (2,0,0,8alpha+96beta,0,-96beta); the last parameter is a point mass/derivative coefficient. For lambda=1, one step of (3) from (alpha,beta)=(0,0) gives beta_new = 1/[3(n+1)^2(n+2)^2] > 0, so -96*beta_new < 0. No argument in the paper reconciles this with the positivity conditions needed to apply the standard zero-location theorems from [1],[2]. If, for some permissible nonuniform/asymmetric partition, a root of Q_N or M_N leaves [-1,1] (or a weight becomes nonpositive), the algorithm's output is not a quadrature rule for [a,b], so the \"all ... rules\" claim fails. This is the load-bearing soft spot: everything else (formula algebra, spline exactness given root/weight conditions) can be checked symbolically, but this existence/positivity half is only asserted.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper presents a set of recursive formulas and algorithms intended to generate Gaussian or optimal quadrature rules for spline spaces of continuity class 0 and 1 on a compact interval with arbitrary non-uniform, asymmetric subintervals. For the classes S_{2N,0} and S_{2N+1,1} it gives one-parameter families of rules, and for the two '1/2-rule' classes S_{2N-1,0} and S_{2N,1} it gives additional formulas. The construction is based on polynomials Q_n and M_n that generalize Legendre and Jacobi polynomials; the nodes are roots of these polynomials and the weights are computed by derivative formulas. The paper includes worked examples, comparisons with published rules and MATLAB code, high-precision numerical checks, and Maple code, but states explicitly in the introduction that no proofs are included.","tokens_in":28226,"tokens_out":5149,"duration_ms":52421,"significance":"If the claimed existence and positivity properties hold, the paper provides a genuinely useful unified recipe for families of spline quadrature rules that previously were known only in special cases. The reductions to Gauss-Legendre rules for S=1, the matches with the published rules by Bartoň et al., Nikolov, Hiemstra et al., and Johannessen's code, and the high-precision numerical verifications are concrete strengths. The Maple code in Appendix B and the Gegenbauer expansions in Appendix C make the formulas reproducible. However, the central assertion that the recursively generated polynomials always have real roots in [-1,1] with positive weights is not proved, and that is exactly the property that makes the output a quadrature rule.","major_comments":[{"comment":"The central claim that the algorithms produce quadrature rules for every non-uniform asymmetric partition is not established. Step 5 of Algorithm 1 and steps 6 and 10 of Algorithm 2 comment only that the roots 'have to lie' in [-1,1], and Section 11 states 'I did not add any proofs.' The finite numerical checks with S,N up to 20 and 'several non-uniform cases' do not cover the universal claim in the abstract. The paper should either supply a proof that the recursion keeps all roots in [-1,1] and all weights positive, or explicitly re-state the result as a conjecture restricted to verified cases.","section":"§4, §8, §11"},{"comment":"The identification of Q_n with the Arvesú–Marcellán–Álvarez-Nodarse polynomials P_n(2,0,0,8α+96β,0,-96β) is not reconciled with positivity. Starting from (α,β)=(0,0), one application of recursion (3) in Section 3 gives β_new = 1/[3(n+1)^2(n+2)^2] > 0, so the last coefficient -96β_new is negative. No argument is given that the standard zero-location and positivity theorems from [1] and [2] apply in this parameter regime. If the associated quadratic form loses positivity, the roots of Q_n may leave [-1,1] or some weights may become non-positive, which would invalidate the constructed rule.","section":"§11, Eq. (10.3); §3, Eq. (3)"},{"comment":"The 1/2-rule construction depends on square roots whose realness is asserted without justification. In Section 7.1, ω is computed from ω = (-B ± sqrt(B^2 - 4AC))/(2A), and in Section 7.3 the middle-subinterval parameters are computed from SQ = B3^2 - 4 A3 C3. For a genuine quadrature rule on [a,b], these discriminants must be non-negative for all admissible inputs, including the strongly stretched and asymmetric cases; the paper gives no proof and no numerical exploration of discriminant failure. This is the same load-bearing existence gap as the root-location issue, specific to the 1/2-rule algorithms.","section":"§7.1, §7.3"},{"comment":"The abstract claims 'closed formulae for all Gaussian or optimal ... quadrature rules,' but Section 10 states 'It is not claimed that these are all node distributions that occur for C0/C1 optimal or suboptimal quadrature rules.' These statements need to be reconciled. Either the sense of 'all' must be defined precisely and the completeness of the listed node-distribution types proved, or the abstract must be weakened to describe the families actually constructed.","section":"Abstract and §10"}],"minor_comments":[{"comment":"The phrase 'parsing from the first/last subinterval to the middle' should be 'proceeding' rather than 'parsing'; elsewhere 'derivations' should be 'derivatives' (e.g., Section 1).","section":"Abstract"},{"comment":"The equation numbering jumps from (3) to (5) in Sections 2 and 3, and several formulas such as the (5.1*) labels in Sections 6 and 7 are introduced with a star notation that is not summarized in one place. A consistent numbering and a table of the starred formulas would improve usability.","section":"§2, §3"},{"comment":"The real-line examples are presented as 'proof left for the reader' exercises. Since these examples are part of the claimed validation, either a concise derivation or an explicit pointer to the calculation in [14] should be included.","section":"§5.2, §5.3"},{"comment":"The algorithms contain minor inconsistencies: step 15 in Algorithm 1 appears to be missing, and in Algorithm 2 the comments refer to 'subinterval [SM]' while the text elsewhere says one or two middle subintervals; these should be aligned for reproducible implementation.","section":"§4, §8"},{"comment":"The numerical verification paragraph reports tests for S=1,...,20 and N=1,...,20, but no details are given about which non-uniform/asymmetric length sequences were tested or how the 200-digit checks were distributed. Adding a precise test list would make the evidence easier to assess.","section":"§11"}],"recommendation":"major_revision","confidential_remarks":"The paper is openly a recipe and relies heavily on the author's earlier preprint [14]. The decisive question is whether the missing positivity/root-location proof can be supplied. If the author can provide it, or if the claims are restricted to proven special cases, the paper would be a useful contribution; as it stands, the abstract's universal claim exceeds what the manuscript establishes."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things to know. First, this is the first place I have seen a fully explicit recursive construction that covers arbitrary degree, non-uniform asymmetric partitions, and both C0 and C1 spline quadrature rules, including the 1/2-rules. Second, it is exactly what the title says: a recipe. The author states up front, \"I did not add any proofs,\" so the value is conditional on the recursion doing what it claims for all admissible inputs.\n\nWhat the paper does well: the formulas and algorithms are concrete, with Maple code in the appendices, several worked non-uniform asymmetric examples, and the author reports high-precision checks for S,N up to 20 as well as matches against independent published codes and tables (Johannessen; Bartoň; Hiemstra et al.). The S=1 limit reducing to Gauss–Legendre is a good sanity check. The connection to Koornwinder and Arvesú's semi-classical Jacobi polynomials gives plausible theoretical scaffolding, and the Gegenbauer expansions in Appendix A are useful in themselves.\n\nThe soft spot is load-bearing. The algorithms in Sections 4 and 8 need the roots of Q_n and M_n to lie in [-1,1] and the weights to be positive. The paper only comments that the roots \"have to lie\" in [-1,1] and gives no proof that the recursion maps preserve the parameter domain where that is guaranteed. Section 11 says proofs are omitted. The link to Arvesú/Krall polynomials in (10.3) is suggestive, but the stress-test note is right that no positivity argument is supplied: one step from (alpha,beta)=(0,0) already yields a negative coefficient for the point-mass term, and the standard zero-location theorems are not shown to apply. For a practitioner the numerical evidence is strong, but the claim covers \"all\" non-uniform asymmetric inputs, and that claim is not supported as written. Minor issue: there is a class-label inconsistency in Section 6 (S_{2N+1,0} versus S_{2N-1,0}), which in a recipe paper is small but can mislead.\n\nWorth a serious referee—not a desk reject. The construction is novel and practically useful in isogeometric analysis. A referee should push for a proof of the root/weight properties, a precise statement of the admissible parameter domain, or a machine-checkable verification. As is, I would cite it with caveats and test it before trusting it on arbitrary asymmetric partitions.","headline":"A genuinely new explicit recipe for C0/C1 spline quadrature rules on non-uniform asymmetric partitions, but the paper's central validity claim—roots stay in [-1,1], weights stay positive—is asserted rather than proved, so treat it as a strong conditional result.","tokens_in":28739,"tokens_out":2043,"would_cite":true,"duration_ms":21448,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65D32","65D07","42C05"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper claims a complete explicit recipe—closed formulas plus a recursion—for the nodes and weights of optimal quadrature rules on C^0 and C^1 spline spaces with arbitrary non-uniform, asymmetric partitions.","keywords":["optimal quadrature","spline spaces","C0 and C1 splines","semi-classical orthogonal polynomials","Jacobi-type polynomials","Gauss-Legendre quadrature","non-uniform partitions","isogeometric analysis"],"falsifier":"Run the Section 4 or Section 8 algorithm on an admissible partition chosen to stress the recursion—for example, subinterval lengths alternating by factors of 10 or 100 in an asymmetric pattern—and inspect whether any node falls outside $[-1,1]$ before scaling or whether any weight is negative; a single such case would show the claimed generality of the recipe fails.","tokens_in":27600,"feed_emoji":"📐","tokens_out":9698,"duration_ms":88121,"temperature":0.7,"pith_summary":"This paper claims a complete, explicit recipe for the nodes and weights of optimal quadrature rules on spline spaces of continuity class 0 and 1: given any compact interval split into non-uniform, asymmetric subintervals and any number of nodes per subinterval, the formulas produce a rule with the minimum number of nodes that integrates the spline space exactly. The construction covers the even-degree $C^{0}$ classes $S_{2N,0}$ and odd-degree $C^{1}$ classes $S_{2N+1,1}$, plus the two previously missing “1/2-rule” classes $S_{2N-1,0}$ and $S_{2N,1}$. If the recipe is correct, it unifies scattered prior cases and replaces a nonlinear search for optimal rules with an explicit loop over subintervals. The paper is deliberately a recipe: formulas and algorithms are stated, proofs are omitted, and the author reports high-precision numerical checks.","feed_headline":"Closed formulas give optimal spline quadrature on any partition","feed_subtitle":"Nodes and weights for non-uniform, asymmetric C0/C1 spline spaces come from orthogonal-polynomial recursions.","key_machinery":"The load-bearing objects are the polynomial families $Q_n(\\ldots,x)$ and $M_n(\\ldots,x)$ together with the recursion maps that update their parameters. $Q_n$ is the boundary polynomial: its roots are the nodes of a non-middle subinterval, and its parameters $\\alpha$ (for $c=0$) or $\\alpha,\\beta$ (for $c=1$) encode how the smoothness conditions at the neighbouring knots have shifted the orthogonality measure. $M_n$ is the middle polynomial, with parameters from both sides, and its $N+1$ (or $N$) roots give the central nodes. The recursion maps are fractional-linear for $c=0$ and rational for $c=1$, transforming the parameters from one subinterval to the next; a scaling factor $\\lambda = L_i/L_{i-1}$ is inserted when subinterval lengths change. Iterating these maps from the boundary to the middle is what makes the rules explicit rather than the solution of a nonlinear system. The paper connects these polynomials to orthogonal polynomials associated with a Jacobi weight modified by endpoint Dirac masses and, in the $c=1$ case, endpoint derivative masses.","core_discovery":"The central claim is that for the four spline families $S_{2N,0}$, $S_{2N+1,1}$, $S_{2N-1,0}$, and $S_{2N,1}$ on any compact interval, all optimal (or Gaussian, where applicable) one-parameter quadrature rules have an explicit description. On each boundary subinterval the nodes are the roots of an explicitly written polynomial $Q_n(\\ldots,x)$, built from Jacobi polynomials and their derivatives; on the middle subinterval the nodes are roots of an explicitly written polynomial $M_n(\\ldots,x)$ built from Legendre polynomials, with weights given by Gauss–Legendre-style formulas involving derivatives of these polynomials. The parameters $\\alpha$ (and $\\beta$ for $C^1$), initially zero at the boundary, are propagated subinterval by subinterval through recursion maps, with a stretching-factor rescaling when subinterval lengths differ, until the middle parameters are reached. The paper identifies $Q_n$ and $M_n$ as semi-classical Jacobi-type orthogonal polynomials with endpoint mass terms, and notes that in the limit of a single subinterval the formulas reduce to classical Gauss–Legendre quadrature.","pith_inferences":["If the recipes are correct, the one-parameter freedom in each rule is a tunable handle: one could try to impose additional design constraints, such as forcing a node onto an interior knot, and the paper's own example shows at least one such constraint is feasible.","Viewing the recursion as a discrete dynamical system suggests a testable extension: one could study basins of attraction and convergence rates of the parameter map to classify which non-uniform partitions lead to well-behaved rules and which approach the boundary of admissibility.","The paper hints that $C^2$ splines with symmetric non-uniform subintervals may be attackable; a natural next test is to attempt analogues of $Q_n$ and $M_n$ with additional endpoint-mass parameters and see whether a finite recursion map still exists."],"forward_implications":["For any covered spline class and any non-uniform, asymmetric partition, the optimal quadrature rule can be written down by evaluating formulas and iterating the recursion, with no nonlinear system to solve.","The classical Gauss–Legendre rule reappears as the special case of one subinterval, so the construction is a genuine extension of the standard rule.","Previously known closed rules—such as the cubic and quintic $C^1$ rules and the $C^0$ quartic rule—are special cases of the same machinery, which covers arbitrary even and odd degrees rather than isolated low degrees.","The 1/2-rule formulas fill the previously missing $C^0$-odd and $C^1$-even classes, including cases where zeros from different subintervals are algebraically mixed through a larger Galois group.","In the infinite-interval limit, fixed points of the recursion produce the real-line optimal rules in explicit Gegenbauer-polynomial form, with the $C^1$ case exhibiting a second fixed point that yields an additional rule."],"supporting_citations":[{"why":"Supplies the endpoint-mass orthogonal polynomial family used to express the c=0 polynomials.","marker":"[1]"},{"why":"Supplies the endpoint-derivative orthogonal polynomial family used for the c=1 construction.","marker":"[2]"},{"why":"Gives the one-endpoint-mass special case underlying the c=0 polynomial identification.","marker":"[7]"},{"why":"The known C0 degree-4 uniform rule that the recipe reproduces as a special case.","marker":"[3]"},{"why":"Explicit non-uniform cubic C1 Gaussian rules that the S_{2N+1,1} formulas generalize.","marker":"[4]"},{"why":"Explicit C1 quintic rules that the same formulas extend to arbitrary odd degree.","marker":"[5]"},{"why":"The reference solver implementation whose output is compared with the paper's main worked example.","marker":"[9]"},{"why":"The table of optimal and reduced quadrature rules used to check the 1/2-rule results.","marker":"[13]"},{"why":"The author's earlier real-line optimal rules, recovered here as fixed-point limits of the recursion.","marker":"[14]"}],"fun_headline_variants":["Explicit optimal quadrature for every spline family","Recursion from boundary to middle yields spline quadrature rules","Jacobi-based closed formulas for all spline quadrature","All optimal spline quadrature rules now explicit","Closed-form nodes and weights for spline spaces"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The recipe assumes that the parameter recursion always keeps the roots of $Q_n$ and $M_n$ real and inside $[-1,1]$, with positive weights, for every non-uniform, asymmetric partition; the paper states the roots “have to lie” there but gives only numerical verification, not a proof.","fun_headline_variants_meta":{"raw":{"variants":["Explicit optimal quadrature for every spline family","Recursion from boundary to middle yields spline quadrature rules","Jacobi-based closed formulas for all spline quadrature","All optimal spline quadrature rules now explicit","Closed-form nodes and weights for spline spaces"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000203,"raw_usage":{"total_tokens":1395,"prompt_tokens":964,"completion_tokens":431,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":580,"completion_tokens_details":{"reasoning_tokens":354}},"tokens_in":580,"tokens_out":431,"duration_ms":4403,"temperature":1.0,"reasoning_tokens":354,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:53:06.993183+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the Section 4 or Section 8 algorithm on an admissible partition chosen to stress the recursion—for example, subinterval lengths alternating by factors of 10 or 100 in an asymmetric pattern—and inspect whether any node falls outside $[-1,1]$ before scaling or whether any weight is negative; a single such case would show the claimed generality of the recipe fails.","supporting_citations":[{"cited_title":"Koornwinder","cited_arxiv_id":null,"evidence_quote":"Supplies the endpoint-mass orthogonal polynomial family used to express the c=0 polynomials."},{"cited_title":"Arvesú, F","cited_arxiv_id":null,"evidence_quote":"Supplies the endpoint-derivative orthogonal polynomial family used for the c=1 construction."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the one-endpoint-mass special case underlying the c=0 polynomial identification."},{"cited_title":"On certain definite quadrature fo rmulae Journal of Computational and Applied Mathematics 7 5 (1996) 329“343","cited_arxiv_id":null,"evidence_quote":"The known C0 degree-4 uniform rule that the recipe reproduces as a special case."},{"cited_title":"Explicit Gaussian quadrature rules for cubic splines with non-uniform knot sequences","cited_arxiv_id":"1410.7196","evidence_quote":"Explicit non-uniform cubic C1 Gaussian rules that the S_{2N+1,1} formulas generalize."},{"cited_title":"Gaussian quadrature rules for $C^1$ quintic splines","cited_arxiv_id":"1503.00907","evidence_quote":"Explicit C1 quintic rules that the same formulas extend to arbitrary odd degree."},{"cited_title":"R., Calabro, F., Schillinger, D., & Hughes, T","cited_arxiv_id":null,"evidence_quote":"The table of optimal and reduced quadrature rules used to check the 1/2-rule results."},{"cited_title":"Quadrature rules for $C^0$, $C^1$ splines, the real line, and the five (5) families","cited_arxiv_id":"1801.03388","evidence_quote":"The author's earlier real-line optimal rules, recovered here as fixed-point limits of the recursion."}],"review_version":1}