{"id":"73010938-4cba-4db4-9325-1d50663b4d37","arxiv_id":"2607.10758","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":4,"one_line_summary":"On an analytic 2D scattering-chain benchmark, Galerkin functional-expansion tallies predict integrated autocorrelation time with lower bias and lower solve cost than discrete-cell Markov chains.","lead":"A reduced-basis Monte Carlo tally estimates how much successive neutron generations stay correlated, without building a huge transition matrix. That could make uncertainty estimates and variance-reduction schemes cheaper in reactor criticality calculations.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified against the benchmark claim; transferability is already the reader's condition.","rationale":"The strongest claim is a methods comparison on a controlled analytic benchmark, not a claim of production readiness. The manuscript supplies the exact eigenstructure (Eqs. 2–5), noise-free vs MC agreement (Figs. 2–3), and cost table (Table I) needed to evaluate that comparison. The omitted 2D kernel derivation and lack of shipped code are documentation gaps, not contradictions of the reported numbers. The transferability concern the reader flags is correctly treated as a condition rather than a falsification of the benchmark results. Therefore no adjustment to CONDITIONAL is warranted; the single most useful remaining check is independent verification of the analytic reference and the cosine MOR error at the cited operating point.","tokens_in":8068,"tokens_out":538,"duration_ms":7090,"concrete_test":"Independently recompute τ_int from Eq. (5) with modes m,n=0…500 at ΣtL=33, α=0.5 and confirm τ_ref≈295.31; then re-run the noise-free cosine Galerkin projection at rb=400 and check that relative error remains <3% as reported in Fig. 2. Agreement validates the benchmark numbers that underwrite the efficiency claim.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim is scoped to the analytic 2D isotropic scattering-chain benchmark: Galerkin MOR from FET-style tallies estimates τ_int with lower bias at comparable or lower solve cost than a discrete M-cell chain (cosine rb=400 <3% error at ~16 ms solve vs ~28% bias at 1.5 s for M=1600; Conclusions, Figs. 2–4, Table I). That claim is internally supported by an independent closed-form τ_ref (Eq. 5), noise-free Galerkin curves that MC tracks (Fig. 2), and explicit cost breakdowns that isolate the KKT solve as the incremental cost when FET assembly is already paid. The cosine basis is the exact eigenbasis of this model (Eq. 2), so rapid convergence is expected rather than surprising. The reader's weakest assumption—transfer to energy/angle/heterogeneous multitype criticality—is real but is already framed by the paper as future MBP/FET work, not as a demonstrated production result. No internal inconsistency, hidden bias, or unsupported numerical claim on the benchmark itself is load-bearing enough to overturn the CONDITIONAL verdict.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper proposes using functional-expansion tallies (FETs) as a Galerkin reduced-order representation of the one-generation transition operator in order to estimate the integrated autocorrelation time (IACT, τ_int) of batch Monte Carlo tallies without building a large discrete transition matrix. On an analytic 2D isotropic scattering-chain benchmark with reflective boundaries, the authors derive a closed-form τ_int from the cosine eigenbasis (Eqs. 2–5), then compare (i) a discrete M-cell Markov-chain estimator (Neumann series on a dense cell-to-cell matrix) with (ii) Galerkin MOR assembled from MC outer-product tallies of cosine, Legendre, and Chebyshev product bases, solved via a KKT-constrained resolvent (Eqs. 7a–7b). For Σ_t L = 33 and a centered square tally, cosine MOR with r_b = 400 reaches <3% error at ~16 ms solve cost, while discrete M = 1600 retains ~28% irreducible mesh bias at ~1.5 s; polynomial bases converge more slowly but systematically. The authors conclude that reduced-basis FET-style operator tallies can provide lower bias at comparable or lower solve cost than discrete binning on this benchmark, and sketch future Multitype Branching Process / energy–angle extensions.","tokens_in":8357,"tokens_out":1352,"duration_ms":33925,"significance":"If the result holds, the paper supplies a clean, falsifiable operator-approximation benchmark for correlation prediction in Monte Carlo criticality: an independent closed-form τ_ref (Eq. 5), noise-free Galerkin curves that MC estimates track within uncertainty (Fig. 2), explicit discrete mesh bias (Fig. 3), and a cost breakdown that separates shared walk, assembly, and solve (Fig. 4, Table I). That combination is stronger evidence than typical numerical-only IACT studies. The demonstration that Legendre/Chebyshev subspaces converge (even though cosine is the exact eigenbasis) supports the claim that the method does not require knowing the eigenmodes a priori. The work is incremental relative to prior diffusion-mode AR models and discrete MBP/fission-matrix approaches, but it usefully isolates the reduced-basis operator question and motivates FET-style tallies of correlation operators. Transfer to heterogeneous, energy-dependent criticality with fission multiplicity remains unshown and is correctly labeled future work.","major_comments":[{"comment":"Introduction and Conclusions: the production-efficiency argument treats Galerkin assembly as already paid whenever FET coefficients are tallied. Standard FET tallies estimate expansion coefficients of a distribution (flux/source), whereas the Galerkin matrices  and M̂ require successive-position outer products ψ_j(r_g)ψ_k(r_{g+1}) (Theory, Galerkin MOR; Monte Carlo Algorithm). That is additional tally work, not free reuse of ordinary FET coefficients. The numerical claim still holds under full assembly cost for the reported points (e.g., cosine r_b=400: ~0.42 s assembly + 16 ms solve vs discrete M=1600 at 1.5 s with ~28% bias; Table I, Figs. 2–4), but the manuscript should qualify the “assembly already paid” framing and state clearly what is incremental versus a production FET run that does not already accumulate transition outer products.","section":null},{"comment":"Theory, 2D Scattering Chain / Eq. (2): the one-generation kernel and the 2D eigenvalue formula λ_mn are central to the exact τ_int (Eqs. 4–5) and to all noise-free reference curves, yet the text states the full derivation is “skipped in this summary,” with only 1D citations [14,15]. For a journal article, either an appendix derivation of the 2D reflective isotropic kernel and the four eigenfunction families, or a complete external reference that contains that derivation, is needed so that Eq. (2) and the claim that only cosine×cosine modes contribute for the symmetric tally I=[−a,a]^2 can be verified independently.","section":null}],"minor_comments":[{"comment":"Title: “Prediction for Integrated Autocorrelation Time” is awkward English; “Prediction of Integrated Autocorrelation Time” (or “for Predicting…”) would match the abstract wording.","section":null},{"comment":"Fig. 1 caption and axis labels use “tL” / “mn” / “Wmn” without consistent Σ_t and T^2 notation used in Eqs. (2)–(3); align figure notation with the equations.","section":null},{"comment":"Fig. 2 x-axis is labeled r^2_b while the text uses r_b for total mode pairs; clarify whether the axis is r_b or √r_b × √r_b to avoid misreading the staircase at r_b=400.","section":null},{"comment":"Eq. (6): the Neumann truncation order K is not specified in Results; state the K used for discrete MC estimates and whether it is large enough relative to τ_int≈295.","section":null},{"comment":"Monte Carlo Algorithm: “N_batch independent batches… G scattering steps of a single neutron; by ergodicity this is equivalent to one generation of G independent neutrons” deserves a one-sentence caveat that this equivalence is for the stationary scattering chain, not for a criticality generation with fission multiplicity.","section":null},{"comment":"References [10,11] (Yamamoto et al.) are the closest reduced-basis predecessors; a sentence contrasting diffusion-mode AR surrogates with direct MC tally of the Galerkin transport operator would help readers place the contribution.","section":null}],"recommendation":"minor_revision","confidential_remarks":"This reads as a strong short methods/benchmark paper, possibly condensed from a conference format (“derivation skipped in this summary”). Suitable for a computational nuclear-engineering or Monte Carlo methods venue if the 2D kernel derivation is supplied and the FET-assembly cost claim is tightened. I would not reject for limited transferability: the paper scopes the claim to the analytic benchmark and labels MBP/energy–angle work as future. No integrity or citation concerns."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"This is a clean methods paper with a real result on a controlled problem. The new piece is not FET itself and not correlation prediction itself; it is tallying the transition operator in a Galerkin basis during the walk and recovering τ_int from a small KKT-constrained resolvent, plus a new 2D analytic scattering-chain eigenstructure they use as ground truth.\n\nWhat they do well is the comparison. They give a closed-form τ_int (Eqs. 2–5), noise-free Galerkin curves, MC estimates that track those curves within error bars, and an explicit cost table that separates shared walk cost from assembly and solve. On this benchmark the claim holds: cosine rb=400 gets under 3% error at ~16 ms solve, while discrete M=1600 still carries ~28% irreducible mesh bias at 1.5 s. Legendre and Chebyshev converge more slowly but to the same subspace result, which is the right check. Circularity is low because the reference is independent of the MC tallies.\n\nSoft spots are real but scoped. The 2D kernel derivation is omitted (they say so). Cosine is the exact eigenbasis of this model, so its rapid convergence is expected rather than a surprise; the polynomial results matter more for generality. The efficiency story for production rests on already paying for FET assembly, which is fair only if you are already doing FET. Transfer to energy, angle, heterogeneity, and multitype branching is asserted only as future MBP/FET work—not demonstrated. No code or data are shipped. None of that breaks the benchmark claim.\n\nThis is for people who already care about inter-cycle correlation, fission-matrix size, and FET tallies in criticality MC. It is not a field reorganizer; it is a useful efficiency path on a problem with an exact answer. Math, figures, and citations look solid for that scope. I would send it to peer review. Engage if you work on MC UQ or reduced operators; otherwise file it as a careful methods note.","headline":"Solid benchmark paper: FET/Galerkin tallies beat discrete M-cell chains on IACT for an exact 2D scattering problem, with transfer to real criticality left as future work.","tokens_in":8981,"tokens_out":524,"would_cite":true,"duration_ms":6926,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.5","headline":"A reduced-basis Galerkin tally can predict Monte Carlo cycle correlations with lower bias and cost than a large discrete transition matrix, as shown on an exact 2D scattering-chain benchmark.","keywords":["functional expansion tallies","integrated autocorrelation time","Monte Carlo criticality","Galerkin model-order reduction","inter-cycle correlations","scattering-chain benchmark","uncertainty quantification"],"falsifier":"Apply the same FET/MOR tally and discrete-cell estimator inside a production Multitype Branching Process criticality calculation on a heterogeneous reactor geometry and check whether the reduced-basis integrated autocorrelation time still reaches lower error at lower solve cost than a refined fission matrix of similar memory.","tokens_in":8939,"feed_emoji":"⚛️","tokens_out":873,"duration_ms":10900,"temperature":0.7,"pith_summary":"Monte Carlo criticality calculations have correlated generations, so ordinary sample variances understate the true uncertainty of tallies by a factor given by the integrated autocorrelation time. Estimating that factor from a full cell-to-cell transition matrix becomes expensive as the mesh is refined. This paper shows that the same correlation information can instead be accumulated as small Galerkin matrices of basis-function products while the Monte Carlo walk is already running, then recovered by a constrained linear solve that removes the stationary mode. On an analytic two-dimensional isotropic scattering chain with a known closed-form answer, a cosine product basis reaches a few-percent error with a few hundred modes and no mesh bias, while a discrete cell chain still carries tens of percent bias at comparable or higher solve cost. The practical claim is that functional-expansion tallies already used for flux reconstruction can double as an efficient route to correlation prediction and better uncertainty quantification.","feed_headline":"Reduced-basis tallies beat mesh matrices on Monte Carlo correlation","feed_subtitle":"On an exact 2D scattering chain, cosine Galerkin models cut bias and solve cost versus discrete cells","key_machinery":"The Galerkin reduced-order model: Monte Carlo walks accumulate small matrices of basis-function products that approximate the transition operator, then a Karush–Kuhn–Tucker constrained resolvent removes the unit eigenvalue and yields the integrated autocorrelation time without ever forming a large discrete transition matrix.","core_discovery":"On the exact 2D isotropic scattering-chain benchmark, Galerkin reduced-order models built from Monte Carlo tallies of basis products estimate integrated autocorrelation time with systematically lower bias than a discrete M-cell Markov chain at comparable or lower solve cost; the cosine eigenbasis converges especially fast, while polynomial bases converge with order and remain unbiased relative to noise-free Galerkin projections.","pith_inferences":["If the cosine advantage is largely eigenbasis alignment, heterogeneous or energy-dependent problems will need problem-adapted bases (or larger polynomial orders) before the same cost–accuracy edge appears.","Once the reduced operator is available, similar tallies could also target higher-order temporal statistics or region-specific correlation diagnostics without extra walks.","The method’s memory scaling may matter as much as wall-clock solve cost for very large production meshes where dense fission matrices are already prohibitive."],"forward_implications":["In runs that already tally functional-expansion coefficients, the incremental cost of estimating integrated autocorrelation time collapses to a small dense linear solve.","Correlation-aware uncertainty quantification becomes practical without building and storing a large phase-space transition matrix.","Slow source modes identified in the reduced basis can guide source-update or variance-reduction strategies whose benefit depends on the correlation structure.","The same reduced-operator idea can be carried into Multitype Branching Process frameworks for real criticality uncertainty quantification."],"fun_headline_variants":["Cosine Galerkin tallies cut bias versus discrete Markov chains on 2D scatter","Reduced-basis FET estimates IAT with lower bias than cell-binning at lower cost","Galerkin products of bases beat mesh matrices for Monte Carlo autocorrelation time","Analytic 2D chain shows cosine reduced models converge fast on correlation lag","Functional expansion tallies yield lower-bias IAT than discrete transition matrices"],"cache_read_input_tokens":128,"weakest_assumption_plain":"That bias and cost conclusions drawn on a homogeneous, single-speed, isotropic 2D scattering chain with reflective boundaries will still hold for real criticality problems that include energy, angle, material heterogeneity, and fission branching.","fun_headline_variants_meta":{"raw":{"variants":["Cosine Galerkin tallies cut bias versus discrete Markov chains on 2D scatter","Reduced-basis FET estimates IAT with lower bias than cell-binning at lower cost","Galerkin products of bases beat mesh matrices for Monte Carlo autocorrelation time","Analytic 2D chain shows cosine reduced models converge fast on correlation lag","Functional expansion tallies yield lower-bias IAT than discrete transition matrices"]},"model":"grok-4.5","effort":"low","cost_usd":0.003906,"raw_usage":{"total_tokens":1187,"prompt_tokens":708,"num_sources_used":0,"completion_tokens":106,"cost_in_usd_ticks":39060000,"prompt_tokens_details":{"text_tokens":708,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":373,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":708,"tokens_out":106,"duration_ms":5049,"temperature":1.0,"reasoning_tokens":373,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-14T09:28:27.382341+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Apply the same FET/MOR tally and discrete-cell estimator inside a production Multitype Branching Process criticality calculation on a heterogeneous reactor geometry and check whether the reduced-basis integrated autocorrelation time still reaches lower error at lower solve cost than a refined fission matrix of similar memory.","supporting_citations":[],"review_version":1}