{"id":"8b6acdc3-f343-4bee-9a20-6c3345c74ffe","arxiv_id":"2607.06449","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":3,"one_line_summary":"Space-time spectral methods can time-step block-by-block by summing coefficients along the time index to pass final-slice data exactly to the next block.","lead":"This paper shows that space-time spectral methods can be made to time-step block-by-block by exploiting a simple identity: in Legendre or Chebyshev time bases, the final-time value of a block is just the sum of its coefficients. This lets spectral methods store only one block at a time, making them practical for long-time integration problems.","discovery_kind":"unclear","skeptic_critique":{"model":"glm-5.2","headline":"No significant objection identified. The core peel-and-pass identity is a correct application of classical Jacobi endpoint values, and the error propagation model is standard and honestly applied. The reader's concern about K>1 for non-dissipative problems is legitimate but inherent to any time-marc","rationale":"The reader correctly identifies the stability factor K>1 for non-dissipative problems as the least secure assumption, and the paper itself acknowledges this honestly. However, I assess this as less load-bearing than the reader suggests because: (1) K is a property of the PDE/discretization, not of peel-and-pass specifically—any marching method has the same issue; (2) the core identity (Lemma 3.1/Corollary 3.2) is mathematically exact and classical; (3) the empirical evidence over 1227 periods directly supports the practical claims. The reader's verdict of ACCEPT with HIGH confidence is appropriate. The paper makes a clean, correct, and useful contribution: recognizing that endpoint-benign bases allow exact coefficient-space interface passing for space-time spectral elements. The novelty is moderate (the endpoint values are classical; multi-interval spectral methods exist), but the specific observation that coefficient summation serves as an exact, quadrature-free, spatially-agnostic interface mechanism is a genuine and practical contribution. The cost and memory models (Lemmas 4.2-4.3) are straightforward and correct. The numerical experiments are well-designed, including the complex-time singularity test that isolates the Bernstein-ellipse rate improvement mechanism. The code is publicly available. No adjustment to the verdict is warranted.","tokens_in":15910,"tokens_out":3105,"duration_ms":174129,"concrete_test":"Run the peel-and-pass method on a nonlinear problem (e.g., Burgers' equation or nonlinear Schrödinger) using per-block Newton iteration with peel-and-pass of the converged coefficients. If the error accumulation over L=50+ blocks remains consistent with Theorem 4.5's geometric bound (with K determined by the linearized operator), the method's practical scope extends beyond the linear experiments shown. If errors grow super-geometrically or Newton fails to converge on later blocks due to accumulated coefficient error, the linear-only testing would be a more significant limitation.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central mathematical claim rests on Lemma 3.1 and Corollary 3.2: for Legendre or Chebyshev-T bases, P_j(1)=1 (or T_j(1)=1), so the final-time-slice spatial coefficients are obtained by summing along the time index. This is a direct consequence of classical Jacobi polynomial endpoint values (DLMF 18.6.1) and is correct. The peel-and-pass step introduces no additional error beyond what the block solve already carries, as stated. The error propagation bound (Theorem 4.5) is a standard geometric recursion e_n ≤ K·e_{n-1} + local_error, yielding K^L amplification. The reader identifies K>1 for non-dissipative problems as the weakest assumption. This is a fair observation, but it is not load-bearing for the paper's central claim for three reasons: (1) The stability factor K is a property of the underlying PDE and block discretization, not of the peel-and-pass mechanism—any time-stepping or multi-interval spectral method faces identical error propagation. (2) The paper is transparent: it reports empirical K≈1.058 (L=50) and K≈1.021 (L=100) for Klein-Gordon, and shows errors remain below 10^{-11} over 1227 periods. (3) The deep-time experiment (Figure 8) directly demonstrates bounded error accumulation, supporting the practical utility claim. The one genuine gap is that all experiments use linear problems with manufactured solutions, while the abstract and title are somewhat general. However, Theorem 4.5 explicitly restricts to linear well-posed problems, so the theoretical claims are properly scoped. The method extends to nonlinear problems via per-block Newton iteration in principle, but this is untested. This is a scope limitation rather than a correctness concern.","agreement_with_reader":"partial"},"referee_report":{"model":"glm-5.2","summary":"The paper records that in endpoint-benign Legendre or Chebyshev-T time bases, the final time slice of a space-time spectral block is recovered exactly by summing stored coefficients along the time index. This 'peel and pass' step enables block-by-block time stepping for sparse space-time spectral methods, reducing resident memory to a single block while preserving spectral-in-time accuracy. The authors prove the underlying Jacobi endpoint identities (Lemmas 3.1, 3.3), derive memory, cost, and error propagation models (Section 4), and demonstrate the method on heat, wave, Klein-Gordon, and fractional disk heat equations.","tokens_in":16290,"tokens_out":741,"duration_ms":207552,"significance":"The central identity (Lemma 3.1, Corollary 3.2) is a correct and clean application of classical Jacobi polynomial endpoint values (DLMF 18.6.1). While the individual mathematical ingredients are standard, their specific use as an exact, quadrature-free, re-expansion-free interface mechanism for sparse space-time spectral blocks is a useful contribution that composes with arbitrary sparse spatial discretizations. The paper provides reproducible code, falsifiable error propagation estimates (Theorem 4.5), and honest reporting of empirical stability factors including K>1 for non-dissipative problems. The deep-time Klein-Gordon experiment (Figure 8) directly demonstrates bounded error accumulation over 1227 periods, supporting the practical utility claim.","major_comments":[],"minor_comments":[{"comment":"§5.5, Figure 9: The disk fractional heat timing excludes matrix assembly, which is acknowledged but could be more prominently flagged in Table 1 or the figure caption, as it affects the timing comparison.","section":null},{"comment":"Theorem 4.5, assumption (3): The spatial error term epsilon_x is assumed bounded per block, and the accumulated bound gives L*epsilon_x. The paper notes (end of §4.3) that spatial error must be controlled separately, but a brief remark on how this is ensured in the experiments (e.g., fixed N_x chosen to under-resolve spatially relative to temporal) would strengthen the connection between theory and practice.","section":null},{"comment":"§5.4: The statement that a global solve at N_t=256 remained at O(1) error for the deep-time Klein-Gordon problem is interesting but could benefit from a brief explanation of why (e.g., insufficient resolution for 1227 periods).","section":null},{"comment":"Table 1: The deep-time Klein-Gordon row has empty global entries. A footnote or remark explaining that the global solve is infeasible at the required resolution would improve clarity for readers scanning the table.","section":null},{"comment":"Lemma 3.3: The derivative weights for Chebyshev-T (Corollary 3.4) involve a product formula; a reference or brief derivation of the simplification from the Jacobi ratio to the double-factorial form would aid readers wishing to verify.","section":null}],"recommendation":"minor_revision","confidential_remarks":"The paper is a well-executed contribution that isolates a simple but practically useful identity. The reader's concern about K>1 for non-dissipative problems is legitimate but, as the skeptic notes, is not load-bearing for the central claim: it is a property of the PDE and discretization, not of the peel-and-pass mechanism, and the paper is transparent about it. The scope is appropriately restricted to linear problems in the theory, though the title and abstract are somewhat general; Theorem 4.5's restriction to linear well-posed problems mitigates this. No novelty or scope concerns."},"author_rebuttal":{"model":"glm-5.2","summary":"We thank the referee for a careful and positive assessment. The referee's recommendation is minor revision with no major comments listed. We address the referee's summary and significance assessment below, noting where we agree refinements are warranted and where we believe the manuscript already substantiates the claims made.","responses":[{"response":"We confirm that this summary accurately characterizes the paper's central contribution. No revision is needed to align the manuscript with this description; the abstract and Section 3 already state this precisely.","revision_made":"no","referee_comment":"The referee's summary describes the paper as recording that endpoint-benign Legendre or Chebyshev-T time bases allow exact recovery of the final time slice by summing coefficients along the time index, enabling block-by-block time stepping with reduced memory and spectral-in-time accuracy."},{"response":"We agree with this characterization. The manuscript already states in Section 3 that the endpoint values are classical and that the contribution lies in their use as the interface mechanism. We will add a brief clarifying sentence in the introduction to make this framing more visible to readers who skim past Section 3.","revision_made":"partial","referee_comment":"The referee's significance assessment notes that the central identity (Lemma 3.1, Corollary 3.2) is a correct and clean application of classical Jacobi polynomial endpoint values (DLMF 18.6.1), and that while individual ingredients are standard, their specific use as an exact, quadrature-free, re-expansion-free interface mechanism is a useful contribution composing with arbitrary sparse spatial discretizations."},{"response":"We appreciate this assessment. The code repository is archived at the DOI cited in the manuscript. Theorem 4.5 and the empirical K values in Figure 8 (K≈1.058 for L=50 and K≈1.021 for L=100) are reported as stated. No revision needed.","revision_made":"no","referee_comment":"The referee notes the paper provides reproducible code, falsifiable error propagation estimates (Theorem 4.5), and honest reporting of empirical stability factors including K>1 for non-dissipative problems."},{"response":"We agree. Figure 8 shows passed-slice error below 4×10⁻¹¹ throughout and below 10⁻¹¹ for L=100, consistent with Theorem 4.5's prediction of mild accumulation when K is close to 1. No revision needed.","revision_made":"no","referee_comment":"The referee highlights the deep-time Klein-Gordon experiment (Figure 8) as directly demonstrating bounded error accumulation over 1227 periods, supporting the practical utility claim."},{"response":"Since no specific major comments requiring changes were listed, we interpret the minor revision recommendation as an endorsement subject to routine polishing. We will conduct a final proofreading pass for typographical and formatting consistency before resubmission.","revision_made":"partial","referee_comment":"The referee's recommendation is minor revision, with no major comments enumerated in the report."}],"tokens_in":15493,"tokens_out":625,"duration_ms":76811,"standing_objections":[]},"desk_editor":{"model":"glm-5.2","letter":"The core observation is simple but genuinely useful: for Legendre or Chebyshev-T time bases, all basis polynomials equal 1 at the right endpoint, so the final-time-slice spatial coefficients of a solved space-time block are recovered by summing along the time index. This lets you peel off the final slice and pass it as the next block's initial data with no quadrature, re-expansion, or coupled multi-interval system. The identity itself is a direct consequence of classical Jacobi endpoint values (DLMF 18.6.1), and the paper is honest about this. What is new is the packaging: isolating this identity as the interface mechanism for sparse space-time spectral blocks, making it compose with arbitrary spatial discretizations, and turning a global space-time solve into a memory-bounded slab marcher. The derivative-weight extension (Lemma 3.3) for higher-order equations is a natural follow-on, and the recommendation to systemize rather than pass derivatives is practically sound and supported by the experiments. The code is shipped and reproducible, which matters here because the value proposition is partly about implementation practicality. The numerical experiments cover heat, wave, Klein-Gordon, and fractional heat on a disk with Zernike bases, and the deep-time Klein-Gordon run over ~1227 periods with errors staying below 10^{-11} is a convincing demonstration. The error propagation theorem (Theorem 4.5) is standard geometric recursion, correctly stated, and the Bernstein-ellipse rate improvement from shorter blocks is verified empirically in the singular heat example. The reader's concern about K>1 for non-dissipative problems is fair but not a flaw in the paper: the stability factor is a property of the PDE and discretization, not of peel and pass, and any time-marching method faces the same issue. The paper reports the empirical K values and is transparent about the regime. The one genuine scope limitation is that all experiments use linear problems with manufactured solutions. Theorem 4.5 is properly restricted to linear well-posed problems, but the title and abstract are somewhat general. Nonlinear extension via per-block Newton is mentioned but untested. This is a scope limitation, not a correctness concern. This paper is for researchers working on spectral methods for time-dependent PDEs who want spectral-in-time accuracy without the memory burden of a single global solve. It deserves a serious referee.","headline":"The paper identifies a clean coefficient-space endpoint contraction for Jacobi polynomials that lets space-time spectral blocks pass interface data by simple summation, enabling block-by-block time marching with spectral-in-time accuracy.","tokens_in":16763,"tokens_out":590,"would_cite":true,"duration_ms":138477,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65M70","65M12","65M60","41A10"],"pacs":[],"model":"glm-5.2","headline":"Spectral time-stepping via coefficient summation","keywords":["space-time spectral methods","time stepping","Jacobi polynomials","Legendre polynomials","Chebyshev polynomials","spectral elements","orthogonal polynomials","endpoint identity"],"falsifier":"If the per-block stability factor K grows with the number of blocks or with block count for non-dissipative problems, the accumulated error K^L would grow without bound, making the method unreliable for long-time wave-type simulations.","tokens_in":16092,"feed_emoji":"⏱️","tokens_out":966,"duration_ms":136958,"temperature":0.7,"pith_summary":"The paper identifies a property of certain orthogonal polynomial bases (Legendre and Chebyshev first-kind) that makes block-by-block time-stepping possible for space-time spectral methods. In these endpoint-benign bases, every basis polynomial equals one at the right endpoint, so the final-time solution of a solved block is recovered exactly by summing the stored coefficients along the time index. This peel-and-pass step, which the author traces to a Jacobi endpoint identity, lets one solve a space-time spectral problem on a short time block, extract the final slice in coefficient space with no interpolation or quadrature error, and feed it as the initial condition for the next block. The result is a spectral element method in time that holds only one block in memory at a time, needs fewer time coefficients per block than a single global solve would need for the full interval, and preserves spectral accuracy. The paper proves the underlying identities, derives memory, cost, and error-propagation models, and demonstrates the method on heat, wave, Klein-Gordon, and fractional heat equations including a two-dimensional disk geometry.","feed_headline":"Spectral time-stepping via coefficient summation","feed_subtitle":"A Jacobi endpoint identity lets space-time spectral methods advance block by block, storing one slab at a time while keeping spectral-in-","key_machinery":"Jacobi endpoint value identity (Lemma 3.1): shifted Jacobi polynomials evaluated at the right endpoint of a block equal (a+1)_j / j!, independent of block index and step size. For Legendre and Chebyshev-T, this weight is identically one, reducing peel-and-pass to plain coefficient summation. Jacobi endpoint derivative weights (Lemma 3.3) provide analogous contractions for time derivatives at block endpoints.","core_discovery":"The central mechanism is the endpoint contraction identity for Jacobi polynomials, specialized to Legendre and Chebyshev-T bases where all polynomials evaluate to one at the right endpoint. When a space-time block's solution is stored as coefficients u_{j,k} in a tensor product of temporal and spatial polynomial bases, the final-time spatial profile is obtained by summing over the time index j for each spatial index k. This summation is exact, costs O(N_t times N_x) operations, and requires only O(N_x) storage for the passed vector. The identity also extends to endpoint derivatives via related Jacobi weight formulae, enabling the handling of higher-order-in-time equations, though the paper's","pith_inferences":[],"forward_implications":["Long-time spectral simulations that were previously infeasible due to memory scaling of a single global space-time tensor become tractable, since resident memory is reduced to that of one block.","The peel-and-pass mechanism is agnostic to the spatial discretization, so it composes with any sparse orthogonal-polynomial basis on nontrivial geometries (disks, annuli, triangles, etc.) without modification.","For problems with complex-time singularities, blocking improves the spectral convergence rate by moving singularities farther away in each block's reference coordinate, an effect the paper confirms empirically.","Reusable factorization of the block operator across uniform blocks yields solve-cost ratios that scale favorably compared to a single global solve, especially for dense or high-fill factorizations."],"fun_headline_variants":["Block-by-block spectral time-stepping via endpoint summation","Sparse space-time spectral methods advance one slab at a time","Jacobi endpoint identity enables peel-and-pass spectral time-stepping","Spectral accuracy in time with single-block storage","Coefficient summation across time index recovers final-time profile"],"cache_read_input_tokens":0,"weakest_assumption_plain":"The error propagation bound assumes a uniform per-block stability factor K bounding how much incoming error amplifies to outgoing error. For dissipative problems K is at most one, but for non-dissipative problems like the wave equation, K can be slightly above one, meaning errors grow exponentially as K to the power of the number of blocks over very long horizons.","fun_headline_variants_meta":{"raw":{"variants":["Block-by-block spectral time-stepping via endpoint summation","Sparse space-time spectral methods advance one slab at a time","Jacobi endpoint identity enables peel-and-pass spectral time-stepping","Spectral accuracy in time with single-block storage","Coefficient summation across time index recovers final-time profile"]},"model":"glm-5.2","effort":"high","cost_usd":0.0,"raw_usage":{"total_tokens":634,"prompt_tokens":571,"completion_tokens":63,"prompt_tokens_details":null},"tokens_in":571,"tokens_out":63,"duration_ms":23895,"temperature":1.0,"reasoning_tokens":null,"cache_read_input_tokens":0,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-08T05:12:50.645629+00:00","model_set":{"reader":"glm-5.2"},"falsifier":"If the per-block stability factor K grows with the number of blocks or with block count for non-dissipative problems, the accumulated error K^L would grow without bound, making the method unreliable for long-time wave-type simulations.","supporting_citations":[],"review_version":1}