{"id":"0fe9c6cf-0697-4512-8567-ef3f9d9fd615","arxiv_id":"2608.09665","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":5,"one_line_summary":"A Carleman-Picard iteration with Legendre-exponential time reduction globally converges, within a truncated reduced model, for reconstructing initial data of quasilinear transport with memory from outflow measurements.","lead":"A new Carleman-weighted iterative scheme reconstructs the unknown initial state of a nonlinear transport equation with memory from boundary outflow measurements. The paper proves the iteration converges globally on an admissible set for the truncated reduced model, and demonstrates it numerically on synthetic 2D inclusions.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"All stated theorems apply only to the N-truncated reduced system; the paper gives no N-dependent consistency estimate linking its fixed point to the original initial data u0, so reconstruction of (1.1) remains unproved.","rationale":"The contraction and stability analysis is internally coherent: Proposition 2.1 is the standard transport Carleman estimate, Lemma 4.1 supplies Lipschitz continuity on B_M, and Theorem 4.1's estimate (4.6) is derived from convexity inequalities with the Carleman term dominating for large lambda. I find no clear defect in that argument for fixed N. The real risk is at the model-reduction step, exactly as the reader flagged. A Galerkin-type projection argument would need to control not just the tail of the modal expansion but the residual obtained by applying the nonlinear operators to the truncated sum; the paper provides no such bound. Because the stated reconstruction target is u0(x) of (1.1), this is load-bearing. The missing piece is a consistency estimate of the form dist(U_{lambda,epsilon}, projection of true solution) <= C(N,epsilon,lambda) + C delta, with C(N,epsilon,lambda) tending to zero as N tends to infinity and epsilon tends to zero while lambda is chosen in the admissible range. Without it, the analytical contribution proves global convergence for an auxiliary finite system, not for the inverse problem posed. The paper's own Remark 5.1 and Section 2.1 acknowledge this, but an explicit admission does not make the bridge unnecessary. The numerical section could strengthen the case but currently tunes lambda and epsilon on Test 1 and tests only three profiles without a systematic N-convergence scan; moreover, two of the three profiles violate the C^1 hypothesis as noted in Remark 6.2. Therefore the conditional verdict should be retained.","tokens_in":19999,"tokens_out":6687,"duration_ms":65501,"concrete_test":"Using the coefficients in (6.1), choose a smooth true initial state, for example (6.6), simulate (1.1) forward on the same 61x61 grid, and compute the exact modal coefficients u_m(x) of the simulated field. For N = 1, 2, ..., 25 evaluate the truncated residual R_N(x) defined by the left side of (3.8). Report ||R_N||_{L^2(Omega)} as a function of N and also report the reconstruction error ||u_{0,N} - u_0|| for the Carleman-Picard fixed point at each N with fixed lambda, epsilon, and low noise. If ||R_N|| does not decay to zero, or if the reconstruction error does not decrease with N, then the fixed point of the reduced system is not a consistent approximation to u0 and Theorems 4.1 and 5.1 cannot be transferred to Problem 1.1.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The advertised result is reconstruction of u0 for (1.1), but every analytic theorem concerns the fixed point of T_{\\lambda,\\epsilon} acting on the finite N-modal reduced system (3.14). The paper never quantifies the error between that fixed point and the true initial data. Section 3 justifies truncation only by saying that the tail of (3.2) is small in L^2_{e^{-2t}}; since the nonlinear coefficients S_mn, M_mn, and F_m in (3.5)-(3.7) are evaluated at the truncated sum, smallness of the tail does not imply smallness of the truncated residual (3.8). No estimate of the form ||u0 - u_{0,N}|| <= rho(N,epsilon,lambda) + data-noise term is stated, and Remark 5.1 explicitly disclaims uniformity in N. Section 2.1 likewise disclaims uniqueness for the original problem. Thus Theorems 4.1 and 5.1 establish only convergence of the iterates to a fixed point of a finite-dimensional model; they do not establish that this fixed point approximates the solution of Problem 1.1. The numerical experiments use profiles violating the smoothness hypotheses, and no systematic N-convergence study is reported, so the experiments do not supply the missing consistency argument.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper treats Problem 1.1: recover the initial state u0 of the quasilinear transport equation (1.1) with a Volterra memory term from outflow boundary observations. The method has three components: a Legendre-exponential basis expansion in time truncated at N+1 modes, yielding the spatial system (3.14) for modal coefficients; a Carleman-weighted, Tikhonov-regularized least-squares minimization that defines a Picard map T_{lambda,epsilon} on an admissible ball in H^s; and convergence and stability theorems. Theorem 4.1 proves that T_{lambda,epsilon} is a strict contraction in a weighted norm for sufficiently large Carleman parameter, with contraction factor of order lambda^{-1/2}, hence global convergence of the iteration to a fixed point of the truncated system. Theorem 5.1 gives a weighted Lipschitz stability estimate with respect to noisy outflow data. Section 6 reports two-dimensional reconstructions of a disk, two Gaussian inclusions, and a Y-shaped inclusion at 5% and 10% noise, together with a study of the role of the Carleman parameter. The paper is explicit that all analytical results concern the fixed-N, Tikhonov-regularized reduced problem.","tokens_in":20299,"tokens_out":13432,"duration_ms":126610,"significance":"The fixed-N analysis is a useful and, on inspection, internally consistent contribution: the Carleman estimate for H dot grad is elementary and correctly proven, the variational-inequality subtraction in Theorem 4.1 is legitimate, and the stability estimate in Theorem 5.1 is clearly derived. The authors are also commendably transparent: Remark 5.1 and the concluding section state that no uniformity in N is claimed, and Remark 6.2 acknowledges that the discontinuous numerical profiles lie outside the regularity assumptions. The availability of reproducible code on Zenodo is a further strength. The main limitation is that the bridge from the truncated system (3.14) to the original Problem 1.1 is not established: no N-dependent error estimate links the fixed point of T_{lambda,epsilon} to u0, and no N-convergence experiment is reported. Thus the analytical results prove convergence of an algorithm for a surrogate finite-dimensional problem, but not yet reconstruction for the original infinite-dimensional inverse problem. With an added consistency analysis or a carefully reframed scope, the paper would be a solid contribution to numerical inverse problems for transport equations.","major_comments":[{"comment":"The central claim of the paper is reconstruction of u0 for Problem 1.1, but Theorems 4.1 and 5.1 establish convergence and stability only for the fixed-N truncated system (3.14). The passage from (3.2) to (3.8) is justified by saying that the tail of the Legendre-exponential expansion tends to zero in the weighted L^2 norm; this is not enough, because the coefficients S_mn, M_mn, and F_m in (3.5)-(3.7) are evaluated at the truncated sum, so smallness of the tail does not imply smallness of the truncated residual in (3.8). No estimate of the form ||u0 - u_{0,N}|| <= rho(N,epsilon,lambda) plus a data-noise term is stated, and Remark 5.1 explicitly disclaims uniformity in N. Therefore the global convergence and stability theorems do not by themselves justify reconstruction for equation (1.1). The revision should either add such an N-dependent consistency estimate, even a qualitative one, or carefully reframe the advertised scope as the reduced finite-dimensional model.","section":"Section 3, after Eq. (3.8); see also Remark 5.1 and Section 7"},{"comment":"Because the theory is silent on N, the numerical experiments are the only evidence for consistency of the truncation, but they do not supply that evidence. The plateau criterion selects a single N per test and the figures report only the selected N; there is no systematic study of the reconstruction error as a function of N for fixed noise and a fixed smooth initial profile. In addition, the disk and Y-shaped profiles are discontinuous and therefore violate the smoothness assumptions of Problem 1.1, as Remark 6.2 acknowledges. A systematic N-convergence study using smooth profiles would at least provide numerical evidence for the missing bridge and would be straightforward to add.","section":"Section 6, in particular Section 6.2 and the three tests of Section 6.3"}],"minor_comments":[{"comment":"The quantity E_max is reported as a percentage but never defined; please define it explicitly, for example as 100 times the relative error of the maximum reconstructed value.","section":"Section 6.3"},{"comment":"The claim that the constrained and unconstrained minimizers coincide for M sufficiently large requires the unconstrained minimizer to lie in the interior of B_M; state this explicitly and, if possible, report the H^s norm of the computed iterates to show they remain inside the ball.","section":"Remark 6.1"},{"comment":"The stopping criterion uses an ell^2 norm on vectors of nodal values without specifying how the modal components and grid points are vectorized; please state the convention.","section":"Algorithm 1 and Eq. (6.4)"},{"comment":"The theorem guarantees contraction only for lambda larger than an unspecified lambda_1 and constant C; the numerical choice lambda=4 is therefore not certified by the theory. The lambda study is informative, but it would be helpful to state explicitly that the correspondence between the theoretical threshold and the practical choice is not quantified.","section":"Theorem 4.1 and Section 6.4"},{"comment":"The sentence 'Since the series in (3.2) converges, the neglected tail tends to zero...' is mathematically true but potentially misleading as a justification of (3.8); consider replacing it with a precise statement of what the convergence does and does not imply for the truncated residual.","section":"Section 3, sentence after Eq. (3.8)"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is honest and the technical core is sound for the reduced model. The main revision needed is to address the N-consistency gap either analytically or by explicit reframing; otherwise the paper risks overclaiming reconstruction for the original infinite-dimensional problem. I would not reject, because the fixed-N contraction and stability theorem is a publishable contribution if the scope is stated accurately. Recommend major revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nHere's my read on Neupane and Nguyen. The paper does something real: it applies the Legendre-exponential time-dimensional reduction and Carleman-weighted Picard iteration to a quasilinear transport equation with state-dependent speed and Volterra memory, a combination not in the earlier literature. The contraction proof (Theorem 4.1) and the noisy-data stability estimate (Theorem 5.1) look internally consistent to me under the stated hypotheses. The numerical work is reproducible (code on Zenodo), and the experiments show the method localizes inclusions well at 5-10% noise. I believe the authors are honest: Section 2.1, Remark 5.1, and the conclusion all explicitly say the analytical results are for the truncated and regularized reduced problem.\n\nThat honesty is also the paper's soft spot. Every theorem concerns the fixed point of T_{\\lambda,\\epsilon} on the finite N-modal system (3.14). The paper never provides an estimate like ||u0 - u_{0,N}|| \\leq \\rho(N,\\varepsilon,\\lambda) + data-noise. Truncating after N temporal modes and evaluating the nonlinear coefficients on the truncated sum does not, by itself, give control of the residual in (3.8); you'd need a quantitative stability estimate for the truncated system with respect to the discarded tail. Smallness of the tail in the weighted L^2 sense doesn't imply smallness of the modal residual because c and f are nonlinear functions of the full solution. The authors know this—Remark 5.1 disclaims uniformity in N—but the consequence is that the global convergence theorem does not justify reconstructing the initial data of (1.1). It justifies approximating the fixed point of a finite-dimensional model.\n\nThe numerics don't close that gap. The test profiles include discontinuous inclusions that violate the C^1 assumptions, which the authors flag; fine as stress tests, but they don't supply the missing consistency argument. And the Carleman parameter study shows a practical tension: large lambda is needed for contraction, but the weighted system becomes severely ill-conditioned for lambda much beyond 4. That's an important caveat for anyone using the method.\n\nThe paper deserves a serious referee. It's a solid within-subfield contribution and the proof machinery is reused with care. But the referee should ask for either an N-dependent consistency estimate or a sharper framing that the reconstructed object is the reduced model's initial condition, not the PDE's initial state. If the authors can't provide the former, they need to stop implying the latter.","headline":"Competent extension of Carleman-Picard to quasilinear transport with memory, but the theorems only cover the truncated N-modal system, not the original PDE problem.","tokens_in":20778,"tokens_out":5550,"would_cite":true,"duration_ms":47330,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["35R30","35F25","35R09","35B45","65M32"],"pacs":[],"model":"deepseek-v4-flash","headline":"For the truncated time-reduced system, the Carleman–Picard map is a strict contraction for large Carleman parameter, giving global convergence from any admissible initial guess and stable reconstruction of the initial state from noisy…","keywords":["inverse initial-data problem","quasilinear transport equation","Volterra memory term","Carleman estimate","Carleman–Picard method","time-dimensional reduction","Legendre–exponential basis","Tikhonov regularization"],"falsifier":"Take a smooth exact solution of (1.1), generate exact outflow data, run the truncated Carleman–Picard method with increasing $N$ and suitably chosen $\\varepsilon$, and compare $u_{0,N}$ with the true $u_0$ in a fixed norm; if the error does not tend to zero as $N\\to\\infty$, the assumed bridge between the truncated and full problems fails. A second test would check whether a field $H$ violating the nontrapping or weight condition (2.5) destroys the contraction property numerically.","tokens_in":19769,"feed_emoji":"🧮","tokens_out":7364,"duration_ms":59062,"temperature":0.7,"pith_summary":"The paper claims that the ill-posed inverse problem of recovering the initial state of a quasilinear transport equation with a Volterra memory term from outflow boundary measurements can be recast, after expanding time in a Legendre–exponential basis and truncating, as a finite nonlinear spatial system solved by a Carleman-weighted Picard iteration. The central theoretical result is that, for a sufficiently large Carleman parameter, the iteration map is a strict contraction on a fixed admissible ball, with contraction factor of order $\\lambda^{-1/2}$, so it converges from any initial guess in that ball and depends Lipschitz-continuously on noisy outflow data. The authors are explicit that these theorems apply to the truncated and Tikhonov-regularized reduced problem, not to the original infinite-dimensional equation. Two-dimensional numerical experiments recover disk, two-Gaussian, and Y-shaped inclusions and show that the iteration converges in a few steps at moderate noise levels.","feed_headline":"Global convergence proved for Carleman–Picard transport inversion","feed_subtitle":"A weighted fixed-point scheme recovers initial states from noisy outflow data in nonlinear transport with memory.","key_machinery":"The argument rests on two objects. The Legendre–exponential basis $\\Psi_n(t)=\\sqrt{(2n+1)/T}\\,e^{t}P_n(2t/T-1)$ is orthonormal in $L^2_{e^{-2t}}(0,T)$ and has the property that no basis function has an identically vanishing derivative, so no spatial modal coefficient disappears from the time-derivative term after truncation. The other is the Carleman estimate (2.6) for the principal transport operator $H\\cdot\\nabla$, which, under the weight condition $H\\cdot\\nabla\\varphi_*\\ge\\mu_0>0$, yields $\\lambda\\int_\\Omega e^{2\\lambda\\varphi_*}|v|^2\\le C\\int_\\Omega e^{2\\lambda\\varphi_*}|H\\cdot\\nabla v|^2+C\\lambda\\int_{\\partial\\Omega} e^{2\\lambda\\varphi_*}|v|^2$. This estimate supplies the coercivity that, together with the Lipschitz bound on the frozen nonlinear terms, makes the Picard map contractive for large $\\lambda$.","core_discovery":"For the reduced system (3.14) of spatial modal coefficients obtained by truncating the Legendre–exponential expansion at $N+1$ terms, the paper proves that the Carleman–Picard map $T_{\\lambda,\\varepsilon}$ defined by minimizing the weighted functional (4.2) is a strict contraction in the weighted norm (4.5) once $\\lambda$ exceeds a threshold. Consequently the fixed point is unique in $B_M$ and the iteration $U^{(k+1)}=T_{\\lambda,\\varepsilon}(U^{(k)})$ converges geometrically from every $U^{(0)}\\in B_M$. Theorem 5.1 quantifies stability: the weighted reconstruction error is bounded by the noisy outflow-data misfit plus a Tikhonov term of order $\\sqrt{\\varepsilon/\\lambda}$. The reconstructed initial state is then $u_{0,N}(x)=\\sum_{n=0}^{N}u_n(x)\\Psi_n(0)$.","pith_inferences":["Beyond the paper: the missing $N$-dependent error estimate means the theorems do not by themselves justify reconstructing the true initial data of (1.1); a quantitative bound on $\\|u_{0,N}-u_0\\|$ in terms of the truncated tail would close the bridge between the reduced and original problems.","Beyond the paper: because the stability constant may depend on $N$ and no estimate uniform in $N$ is given, the simultaneous limits $N\\to\\infty$, $\\varepsilon\\to0$ are not covered; a testable extension would compute reconstruction error as $N$ grows on a smooth exact solution.","Beyond the paper: the plateau criterion used to select $N$ from projected noisy data is heuristic; a discrepancy-principle-type rule would make the choice data-adaptive and provable.","Beyond the paper: the discontinuous disk and Y-shaped tests violate the assumed $C^1$ regularity, and the paper itself calls them stress tests; a weak-solution analysis would be needed to make the theorems cover such profiles."],"forward_implications":["For fixed truncation index $N$ and regularization parameter $\\varepsilon$, the reconstruction error depends Lipschitz-continuously on the relative noise level $\\delta$, so increased outflow noise degrades the weighted reconstruction only proportionally.","Because convergence holds for every initial guess in the admissible ball, the iteration can be started from the zero guess rather than from a near-solution approximation.","The truncation index $N$ serves as a regularization device: suppressing high-order temporal modes filters noise-sensitive components of the data.","Numerically, moderate positive values of the Carleman parameter improve reconstructions over the unweighted Picard scheme, while excessively large $\\lambda$ severely worsens the conditioning of the discrete least-squares system.","The method extends the Carleman contraction principle to quasilinear transport with memory, provided the geometric propagation condition $T>\\tau_H^*/\\kappa_0$ and the weight condition (2.5) hold."],"supporting_citations":[{"why":"Supplies the Legendre–exponential basis, its orthonormality, and the differentiation rule that underpins the time-dimensional reduction.","marker":"[11]"},{"why":"Introduces the Carleman contraction principle that the paper adopts to obtain global convergence of the Picard iteration.","marker":"[23]"},{"why":"Develops the Carleman contraction mapping method for quasilinear elliptic equations, the direct methodological predecessor of the present transport analysis.","marker":"[29]"},{"why":"Provides the local Carleman-estimate framework and the construction of weights satisfying condition (2.5) for transport operators.","marker":"[7]"},{"why":"Establishes global uniqueness for time-dependent transport coefficient inverse problems via a Carleman estimate, motivating the principal-operator estimate used here.","marker":"[18]"},{"why":"Establishes Lipschitz stability for a non-standard transport inverse problem via Carleman estimates, the stability result that the noisy-data analysis extends.","marker":"[17]"},{"why":"Applies time-dimensional reduction together with the Carleman contraction principle to nonlinear hyperbolic equations, a direct predecessor of the present method.","marker":"[12]"}],"fun_headline_variants":["Carleman-Picard iteration proven convergent for transport recovery","Global convergence proof for memory transport inverse problem","Carleman-contraction recovers initial data in nonlinear transport","Time-reduction and Carleman-Picard for stable transport inversion","Convergent Picard scheme for noisy outflow data in memory transport"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that retaining $N$ temporal modes and evaluating the nonlinear coefficients on the truncated sum produces a system whose fixed point approximates the true initial data; no $N$-dependent error estimate is given, and the theorems also require the geometric weight condition (2.5) to hold.","fun_headline_variants_meta":{"raw":{"variants":["Carleman-Picard iteration proven convergent for transport recovery","Global convergence proof for memory transport inverse problem","Carleman-contraction recovers initial data in nonlinear transport","Time-reduction and Carleman-Picard for stable transport inversion","Convergent Picard scheme for noisy outflow data in memory transport"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00043,"raw_usage":{"total_tokens":2188,"prompt_tokens":925,"completion_tokens":1263,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":541,"completion_tokens_details":{"reasoning_tokens":1178}},"tokens_in":541,"tokens_out":1263,"duration_ms":9490,"temperature":1.0,"reasoning_tokens":1178,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T13:07:43.798070+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a smooth exact solution of (1.1), generate exact outflow data, run the truncated Carleman–Picard method with increasing $N$ and suitably chosen $\\varepsilon$, and compare $u_{0,N}$ with the true $u_0$ in a fixed norm; if the error does not tend to zero as $N\\to\\infty$, the assumed bridge between the truncated and full problems fails. A second test would check whether a field $H$ violating the nontrapping or weight condition (2.5) destroys the contraction property numerically.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the Legendre–exponential basis, its orthonormality, and the differentiation rule that underpins the time-dimensional reduction."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces the Carleman contraction principle that the paper adopts to obtain global convergence of the Picard iteration."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Develops the Carleman contraction mapping method for quasilinear elliptic equations, the direct methodological predecessor of the present transport analysis."},{"cited_title":"Cannarsa, G","cited_arxiv_id":null,"evidence_quote":"Provides the local Carleman-estimate framework and the construction of weights satisfying condition (2.5) for transport operators."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes global uniqueness for time-dependent transport coefficient inverse problems via a Carleman estimate, motivating the principal-operator estimate used here."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Establishes Lipschitz stability for a non-standard transport inverse problem via Carleman estimates, the stability result that the noisy-data analysis extends."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Applies time-dimensional reduction together with the Carleman contraction principle to nonlinear hyperbolic equations, a direct predecessor of the present method."}],"review_version":1}