{"id":"32a6a9ee-c9e8-42d2-a6e4-ef6e2cd1b8cb","arxiv_id":"2411.09331","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"A double-spectral method is proposed to extrapolate vertical magnetic field measurements from a patch to the entire plane for planar samples, with a uniqueness proof for ideal data and a single noiseless numerical test.","lead":"This paper develops a way to fill in missing magnetic field data outside the measured region for flat, thin rock samples. The approach relies on known physics of how the field decays and is tested on a computer simulation, though real noisy measurements are not yet shown to work reliably.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The claimed stabilization by spectral truncation is unquantified: S_J divides by eigenvalues of a smoothing kernel, so noise may be amplified; with no noisy experiment or error estimates, the method's central purpose is not demonstrated.","rationale":"I read the paper as proposing a practical extrapolation method for inverse magnetisation data, with the mathematical uniqueness result as supporting background. The uniqueness proof in Proposition 1 is essentially correct, and the construction of L_J is algebraically coherent: the identity S_J B = B S_J^T indeed makes the lower-right block self-adjoint, so the spectral motivation is plausible. However, the method's stated purpose is to handle measurement noise, and this is exactly where the paper stops short. The stabilizing role of the truncation parameters is asserted but neither analyzed nor tested. Because the algorithm's coefficients involve division by the eigenvalues of a smoothing operator, noise amplification is a real risk, not a pedantic one. The reader's weakest assumption identifies the same gap: lack of noisy experiments and error estimates. My concrete test directly probes that assumption. I do not see an internal inconsistency that would require rejection; the gaps are addressable, so the appropriate verdict remains CONDITIONAL, unchanged from the reader's assessment.","tokens_in":4803,"tokens_out":14355,"duration_ms":148916,"concrete_test":"Rerun the Section 3 experiment with noisy data: set Bmeas_noisy = Bmeas_true + δ on Q, where δ is zero-mean Gaussian noise at 1% and 5% relative L2 levels, and run the algorithm with J=N=80 (also try J = 20, 40, 80, 160). Report the relative L2 extrapolation error on [-10,10]^2 and the norm of S_Jδ. If the error grows dramatically with noise or with J after an optimum, the low-pass stabilization claim fails; if the error stays near the noiseless 7% level, the concern is resolved.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's motivating scenario is contaminated measurement data, but the only numerical test in Section 3 is noiseless. Section 2 asserts that low-pass filtering via truncation parameters J and N should stabilize the method, yet provides no perturbation bound and explicitly defers analysis of J and N to a future paper. The concern is concrete: in step (iii), S_J is built from coefficients 1/μ_j, where μ_j are eigenvalues of the compact smoothing operator K12⋆Q. For the analytic Poisson kernel these eigenvalues decay rapidly, so S_J can have very large norm when J is moderately large. The reconstruction coefficients b_n in (2.5) contain ⟨S_J Bmeas, φ_n^3⟩; additive noise δ therefore enters as S_J δ, which may be amplified without a bound controlling ‖S_J‖. The paper uses J=N=80 with no estimate of this amplification. Thus the central claim that the method extrapolates realistic noisy measurements is not supported by the evidence presented. The uniqueness result in Proposition 1 is internally sound, and the algebraic motivation for L_J is plausible, but the step from ideal-data uniqueness to a stable noisy-data algorithm is the load-bearing gap.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies a data extrapolation problem arising in the inverse magnetisation problem for a planar sample. Given measurements of the vertical component B3 on a bounded patch Q at height h, the aim is to extrapolate this field to the whole plane. The paper proves a uniqueness result (Proposition 1) for ideal noise-free data: any field satisfying the governing equation and matching the measured data on Q has a unique extension to R^2. It then proposes a 'double-spectral' algorithm, based on the spectral decomposition of an auxiliary self-adjoint matrix operator L_J that encodes the geometry and the support assumption, and illustrates the algorithm with a single numerical example using noiseless data, reporting a relative L2 error of about 7% on [-10,10]^2. The derivation of the algorithm relies on a remainder bound for a truncated projection r_J, which is stated without proof, and the stability of the method with respect to measurement noise is not analysed or tested numerically.","tokens_in":5042,"tokens_out":11431,"duration_ms":97226,"significance":"If the proposed extrapolation method is stable under noise, it would be a practically relevant tool for paleomagnetic data processing, since it addresses a bottleneck in estimating net magnetisation: the limited spatial extent and contamination of measured field maps. The uniqueness result for ideal data, while not surprising, is a useful clarification that the extrapolant is well-defined independently of the non-unique magnetisation distributions that produce the data. The algorithmic idea of reducing the extrapolation to a spectral problem for a self-adjoint matrix operator is novel and plausible. However, the paper's central claim that the method extrapolates realistic noisy measurements is not yet supported by the evidence: the key remainder estimate is unproved, no noisy experiments are reported, and no perturbation bounds are given. The paper is therefore an interesting announcement of a potential method, but it is not a complete justification of the method as presented.","major_comments":[{"comment":"The key assertion that ||r_J(·, x)|| -> 0 as J -> infinity uniformly for x in Q is stated without proof. This estimate is load-bearing: it is exactly what allows the replacement of the original system (2.8) by the spectral equation (2.9) for L_J. The eigenfunctions φ_j are those of K12⋆Q, not of K3⋆Q, so the uniform convergence of the projection of the continuous kernel K3(t-x) in this basis is not a standard consequence of Mercer's theorem. A proof, or at least a precise reference, is required before the derivation of the algorithm is valid.","section":"Section 2, 'Towards justification'"},{"comment":"The stability with respect to noise is not established. The operator S_J is defined through coefficients 1/μ_j, where μ_j are eigenvalues of the smoothing operator K12⋆Q; for a smooth positive definite kernel these eigenvalues decay rapidly, so ||S_J|| can be very large for moderate J. Additive noise δ in Bmeas enters the reconstruction coefficients b_n in (2.5) through ⟨S_J Bmeas, φ_n^3⟩, so noise is amplified by S_J without any bound on ||S_J||. The paper motivates the method by the presence of noise and states that low-pass filtering should stabilise it, but it provides no error estimates and the only numerical test (Section 3) uses noiseless data. A perturbation analysis or a noisy numerical experiment, together with a discussion of how to choose J and N, is essential to support the central claim that the method extrapolates contaminated measurement data.","section":"Section 2, Algorithm steps (iii) and (v)"},{"comment":"The numerical evidence is very thin: a single test case with ideal data, with no details on the discretisation of the eigenvalue problems (ii) and (iv), no convergence study with respect to J and N, no noise contamination, and no comparison with a baseline. The reported 7% relative error is not enough to judge the practical utility of the method, especially because the motivating scenario involves measurement noise. At a minimum, the authors should report the dependence of the error on J and N, present a noisy-data experiment, and specify how the eigenfunctions are computed.","section":"Section 3, Numerical illustration"},{"comment":"The statement of Proposition 1 is tautological as written: if the extrapolant must satisfy (1.1) on all of R^2 with the same fixed M1, M2, M3 that generated the data, then existence and uniqueness are immediate. The proof actually establishes the stronger and intended statement: any two magnetisations producing the same field on Q give the same f_M and hence the same field on all of R^2. This should be stated clearly in the proposition. In addition, the regularity assumption in the proposition (M1,M2 in L2) is inconsistent with the integration-by-parts step used later in (2.7), which requires W^{1,2} for M1,M2.","section":"Proposition 1"}],"minor_comments":[{"comment":"The Fourier multiplier π|k|exp(-2πh|k|) vanishes at k=0, so the operator is positive semidefinite, not strictly positive. The conclusion ~f_M - f_M = 0 follows because the difference lies in L2(R2); this nuance should be mentioned for precision.","section":"Proof of Proposition 1"},{"comment":"The definition of S_J is given without derivation. A short explanation of how the kernel S_J is intended to approximate the inverse of K12⋆Q would help the reader follow the subsequent identity for ∫ K12(t-y)S_J(x,y)dy.","section":"Equation (2.2)"},{"comment":"The figures lack colorbars and axis labels for the plotted quantities. In particular, Figure 3.2 shows a 'pointwise error' but there is no indication of its magnitude scale or whether it is absolute or relative.","section":"Figures 3.1 and 3.2"},{"comment":"No information is given about the numerical implementation: the quadrature, the method for solving the eigenvalue problems, or the discretisation parameters. These details are necessary for reproducibility.","section":"Section 3"},{"comment":"The phrase 'J largest in modulus eigenvalues' is slightly confusing because the eigenvalues of K12⋆Q are negative; it would be clearer to say 'J eigenvalues of largest absolute value'.","section":"Algorithm, step (ii)"}],"recommendation":"major_revision","confidential_remarks":"The manuscript appears to be an extended abstract or announcement of a method, with the analysis explicitly deferred to a future paper. The core idea is plausible, but the paper as submitted does not meet the standard for a journal publication in mathematical analysis because the central convergence and stability statements are unproved and the numerical evidence is minimal. I would encourage the editor to invite a revision that includes the missing remainder estimate (or a precise reference) and a convincing noisy-data study, even if the full parameter-choice analysis remains a separate contribution."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The genuinely new thing here is the double-spectral construction: build an auxiliary operator S_J from eigenfunctions of the truncated Poisson kernel, then solve a matrix-operator eigenproblem whose eigenvectors give the extrapolant. I have not seen that in the cited literature, and it is a clever way to turn the geometry into an algebraic object. The paper also proves uniqueness of the extrapolant for ideal data (Proposition 1), and that proof is essentially sound. One nitpick: the text says the operator is positive, but its Fourier multiplier is only nonnegative and has a zero at k=0. For L^2 functions the conclusion is still correct, so it is a wording issue, not a mathematical gap.\n\nThe numerical illustration is honest but thin: one noiseless example, J=N=80, about 7% relative L2 error on a larger box. No code, no data, no baseline. That could be acceptable if the analytic part were rigorous, but it is not. The derivation of the algorithm is heuristic. The key remainder r_J is asserted to go to zero without a rate or a proof, and the step from a self-adjoint compact operator to the spectral truncation is sketched in a few lines. More importantly, the paper's stated motivation is noisy measurements, and the only experiment is noiseless. The stress-test concern about S_J amplifying noise is concrete and lands: the coefficients b_n contain S_J B_meas, and S_J includes 1/mu_j factors where the mu_j are eigenvalues of a compact smoothing kernel. Unless J is chosen very carefully, additive noise enters as S_J delta, and there is no bound on ||S_J||. The paper says low-pass filtering should stabilize things and defers the choice of J and N to a future paper. That is the load-bearing gap. It is not a contradiction, but it means the method's central promise is unverified.\n\nThe paper is candid about its limitations, and the author is not overselling. But a reader in paleomagnetism or inverse problems who wants to use this needs evidence that the algorithm survives noise and some idea of how to pick J and N.\n\nWho is this for? Researchers working on inverse magnetisation from planar scans, particularly those who want to extend patch data before moment estimation. It is a useful sketch and a reasonable starting point for a fuller paper. It deserves a serious referee: the idea is new, the uniqueness result is correct, and the gaps are addressable by adding noisy experiments, deriving a perturbation bound, and justifying the truncation choice. I would send it to review, expecting major revision.","headline":"New double-spectral idea, but the paper's central noise-stability claim is unvalidated; deserves review as a promising sketch.","tokens_in":5502,"tokens_out":2360,"would_cite":false,"duration_ms":25496,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["35R30","47A75","65R32"],"pacs":[],"model":"deepseek-v4-flash","headline":"For ideal data, the vertical magnetic field measured on a finite patch over a planar sample has a unique full-plane extension, and a double-spectral algorithm constructs that extension with about 7% relative L2 error in a numerical test.","keywords":["inverse source problem","magnetisation","planar sample","field extrapolation","spectral decomposition","Riesz transforms","Poisson kernel","net magnetic moment"],"falsifier":"Take the same four-rectangle magnetization and generate $B_3^{\\mathrm{meas}}$ on $Q=[-1,1]^2$ with added noise at a realistic amplitude (say 1% of the signal), run the algorithm with $J=N=80$, and compare the extrapolation on $[-10,10]^2$ with the exact field; if the relative $L^2$ error fails to stay near the clean-data level or grows with noise amplitude, the central stability assumption is falsified.","tokens_in":4581,"feed_emoji":"🧲","tokens_out":8206,"duration_ms":81127,"temperature":0.7,"pith_summary":"This paper tries to establish that the vertical component of a magnetic field measured on a finite planar patch can be extended uniquely to the whole plane, at least for noiseless data, and that a practically implementable 'double-spectral' algorithm can approximate that extension. The uniqueness claim rests on the observation that the field produced by a planar magnetisation is a real-analytic function of the horizontal variables; two different full-plane extensions that agree on the patch would differ by a function that is both analytic and annihilated on the patch by a positive convolution operator, forcing them to be identical. The algorithm solves this extrapolation problem by decomposing the measured data into eigenmodes of a compact integral operator built from the known forward kernel, then solving a coupled spectral problem for the two source quantities that determine the field. In the numerical illustration, the method recovers the field outside the measurement patch over a ten times larger region with about 7% relative L2 error. If the method scales to real measurements, it would remove a main practical limitation of magnetic moment estimation, which currently degrades when only a small noisy patch of field data is available.","feed_headline":"Magnetic patch data can be extended to the whole plane","feed_subtitle":"A double-spectral method reconstructs missing field values outside the scan window, with about 7 percent relative error in tests.","key_machinery":"The machinery is a pair of compact integral operators on the measurement region: $K_{12}f = -\\tfrac{1}{2} p_h \\star_Q f$ (the Poisson kernel) and $K_3 f = -\\tfrac{1}{2} \\partial_h p_h \\star_Q f$ (its height derivative), together with a finite-rank correction operator $S_J$ built from the eigenfunctions of $K_{12}$. Their coupled spectral problem is assembled into the self-adjoint matrix operator $L_J$, whose right-hand side in (2.9) is the measured data plus a remainder $r_J$ that tends to zero as the spectral truncation $J$ grows. The extrapolant is formed by evaluating the full-plane version of the same kernels against the recovered eigenmode components. The proof's load-bearing identity is that $K_{12}$ and $K_3$ are linked through $S_J$ by $\\int\\!\\!\\int_Q K_{12}(t-y)S_J(x,y)\\,d^2y = K_3(t-x)+r_J(t,x)$, which makes the auxiliary operator invert the forward relation on $Q$ up to a controllable remainder.","core_discovery":"Proposition 1 states that for ideal data satisfying (1.1) the extrapolant is unique: any two magnetisations that produce the same vertical field on the measurement region $Q$ must produce the same field on all of $\\mathbb{R}^2$. The proof rewrites (1.1) as $B_3 = -\\tfrac{1}{2}(\\partial_h p_h \\star f_M)$ with $f_M = R_1M_1+R_2M_2+M_3$; if two sources differ, their difference produces a real-analytic field vanishing on an open set, hence vanishing everywhere, and positivity of the Fourier multiplier $\\pi|k|e^{-2\\pi h|k|}$ forces the source difference to be zero. The paper then proposes the double-spectral algorithm (steps (i)-(vi), equations (2.2)-(2.6)): compute the dominant eigenfunctions of the truncated Poisson kernel $K_{12}\\star_Q$, build a correction operator $S_J$ from them, solve the two-by-two self-adjoint spectral problem (2.3) for the vertical component and the in-plane divergence, and form the extrapolant by applying the full-plane kernels to the resulting eigenmodes. The numerical section reports that with $J=N=80$ the extrapolant reproduces the true field on $[-10,10]^2$ with about 7% relative $L^2$ error. Stability under noise is not proven; truncation of the spectra is intended to serve as low-pass filtering, with analysis of the truncation parameters postponed.","pith_inferences":["A direct next experiment is to contaminate the synthetic data with sensor noise and track relative $L^2$ error as a function of $J$ and $N$; absent such a test, the 7% clean-data figure should not be read as a noise robustness claim.","The same two-by-two spectral construction could be adapted to use $B_1$ or $B_2$ components instead of $B_3$, or to recover the two source quantities separately rather than their combined field; the paper does not explore these variants.","Because the proof identifies $f_M = R_1M_1+R_2M_2+M_3$ as the recoverable quantity, the method implicitly sets up a route to estimate the net magnetisation without enforcing unidirectionality; that step is not carried out here.","The real-analyticity argument suggests the extrapolant is stable only if high-frequency components are controlled; the paper's spectral truncation is the concrete mechanism for that control, and its limits define the practical domain of validity."],"forward_implications":["The vertical field on a finite patch determines the full-plane field uniquely, so any ambiguity in extrapolation comes from noise or truncation, not from the inverse problem itself.","Because the method uses only the vertical component and the known planar support, existing paleomagnetic scan protocols already supply the needed input.","Moment-estimation formulas that assume full-plane data can be applied to patch measurements after extrapolation, extending the usable region from $[-1,1]^2$ to at least $[-10,10]^2$ in the tested configuration.","The remainder term $r_J$ vanishes as $J$ grows, so the single-operator spectral approximation is a convergent step; the remaining open question is the quantitative choice of $J$ and $N$ for a given noise level.","Low-pass spectral truncation is the designed stabiliser, so the method is expected to admit noise-controlling variants once the truncation analysis is completed; the paper does not yet supply that analysis."],"supporting_citations":[{"why":"Supplies the forward-model equation (1.1) and the Riesz-transform rewriting (2.1) used in the uniqueness proof and algorithm derivation.","marker":"[2]"},{"why":"Provides the kernel characterisation theorem and the ill-posedness analysis that the proof of Proposition 1 relies on.","marker":"[3]"},{"why":"The bounded-extremal magnetic moment estimation method whose sensitivity to the measurement region and noise motivates the need for full-plane field extrapolation.","marker":"[1]"}],"fun_headline_variants":["Extend magnetic patch data to the whole plane","Double-spectral method extrapolates magnetic field data","Unique extrapolation of magnetic field from planar sample","Fill missing magnetic field data via spectral decomposition","Inverse magnetisation: extrapolate data beyond scan window"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the algorithm remains accurate and stable when the measured field contains realistic noise, because the paper proves uniqueness only for ideal noiseless data, tests only clean synthetic data, and leaves the analysis of the spectral truncation parameters to future work.","fun_headline_variants_meta":{"raw":{"variants":["Extend magnetic patch data to the whole plane","Double-spectral method extrapolates magnetic field data","Unique extrapolation of magnetic field from planar sample","Fill missing magnetic field data via spectral decomposition","Inverse magnetisation: extrapolate data beyond scan window"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000845,"raw_usage":{"total_tokens":3693,"prompt_tokens":977,"completion_tokens":2716,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":593,"completion_tokens_details":{"reasoning_tokens":2643}},"tokens_in":593,"tokens_out":2716,"duration_ms":21032,"temperature":1.0,"reasoning_tokens":2643,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T20:46:09.060929+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take the same four-rectangle magnetization and generate $B_3^{\\mathrm{meas}}$ on $Q=[-1,1]^2$ with added noise at a realistic amplitude (say 1% of the signal), run the algorithm with $J=N=80$, and compare the extrapolation on $[-10,10]^2$ with the exact field; if the relative $L^2$ error fails to stay near the clean-data level or grows with noise amplitude, the central stability assumption is falsified.","supporting_citations":[{"cited_title":"Silent and e quivalent magnetic distributions on thin plates","cited_arxiv_id":null,"evidence_quote":"Supplies the forward-model equation (1.1) and the Riesz-transform rewriting (2.1) used in the uniqueness proof and algorithm derivation."},{"cited_title":"P ., Lima, E","cited_arxiv_id":null,"evidence_quote":"Provides the kernel characterisation theorem and the ill-posedness analysis that the proof of Proposition 1 relies on."},{"cited_title":", Lima, E., Marmorat, J","cited_arxiv_id":null,"evidence_quote":"The bounded-extremal magnetic moment estimation method whose sensitivity to the measurement region and noise motivates the need for full-plane field extrapolation."}],"review_version":1}