REVIEW 2 major objections 1 minor 1 cited by
Source REconstruction of Arcs behind Cluster Halos (SourceREACH): A New Source Reconstruction Algorithm Optimized for Giant Arcs and Galaxy Cluster Lenses
T0 review · 2 major / 1 minor · reviewed 2026-05-25 · grok-4.3
Pith's one-line read A new algorithm reconstructs background sources from giant arcs by de-lensing observed pixels then applying regression to the source plane.
desk verdict De-lensing pixels first then running KNN regression is the core new step, but the performance claim rests on an untested perfect-lens-model assumption and lacks any numbers. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
De-lensing of image pixels into the source plane followed by K Nearest Neighbor Regression to produce the model source while handling spatially varying resolution.
What would settle it
Re-running the reconstruction on the same Abell 370 arc data after deliberately inserting a known PSF kernel or after replacing the lens model with a deliberately inaccurate one would show whether the recovered source matches expectations only when the assumptions hold.
Extended reading notes
Core claim
The SourceREACH algorithm deconvolves the observed image by the point spread function, de-lenses the image pixels, and uses interpolation or regression with smoothing to determine the model source. By operating on de-lensed points the method automatically accounts for the varying resolution across the source plane. When different interpolation and regression techniques are compared on mock data and on the giant arc in Abell 370, K Nearest Neighbor Regression supplies the best balance of noise smoothing and preservation of compact detail in the source.
Load-bearing premise
The method assumes point spread function effects are not significant and that an accurate lens model is already available for the de-lensing step.
Editorial extensions
If this is right
- Giant arcs can be modeled with reduced computational cost compared with traditional pixelated source reconstruction methods.
- K Nearest Neighbor Regression yields source models that suppress noise without erasing compact features in high-resolution cluster-lens data.
- The approach automatically incorporates the position-dependent magnification when mapping image pixels back to the source plane.
- The same pipeline works on both simulated arcs and real observations such as the Abell 370 system.
Reading between the lines
- The same de-lensing-plus-regression logic could be applied to other strong-lensing configurations once an accurate lens model exists.
- Adding an explicit PSF convolution step inside the forward model would extend usability to data sets where PSF blurring cannot be ignored.
- The method's speed advantage may allow routine analysis of the much larger samples of arcs expected from upcoming wide-field surveys.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces SourceREACH, an algorithm for source reconstruction from giant arcs in galaxy cluster lenses. It deconvolves the observed image by the PSF, de-lenses pixels using a supplied lens model, and applies interpolation or regression with smoothing to reconstruct the source while accounting for varying resolution across the source plane. Evaluation on mock data and real Abell 370 observations identifies K Nearest Neighbor Regression as providing the optimal balance of noise smoothing and detail preservation.
Significance. If the performance ranking is placed on quantitative footing and the dependence on an accurate input lens model is tested, the approach could supply a computationally efficient reconstruction tool for high-resolution cluster-lensing data where PSF effects are negligible.
major comments (2)
- [Abstract and Section 3] Abstract and evaluation section: the claim that KNN regression 'results in the best balance of noise smoothing and preservation of compact detail' is presented without any quantitative metrics (e.g., RMS residuals, structural similarity indices, or cross-validation scores), error bars, or explicit comparison baselines against the other tested methods. This leaves the headline performance conclusion only weakly supported.
- [Section 3] Section 3: the entire evaluation pipeline (both mock and Abell 370) assumes an exact, error-free lens model for the de-lensing step. No sensitivity analysis is reported for realistic cluster-scale lens-model uncertainties (typically 5–10 % in convergence), which would systematically displace source-plane points and could change the relative ranking of the regression methods. Mock tests use the input model by construction and therefore do not probe this failure mode.
minor comments (1)
- [Abstract] Abstract: the statement that the algorithm is 'designed for high-resolution observations in which point spread function effects are not significant' is not accompanied by any quantitative criterion or validation test for when this approximation holds.
Simulated Author's Rebuttal
We thank the referee for their constructive report. The comments identify opportunities to strengthen the quantitative basis of our performance claims and to examine robustness to lens-model errors. We address each major comment below and will revise the manuscript accordingly.
read point-by-point responses
-
Referee: [Abstract and Section 3] Abstract and evaluation section: the claim that KNN regression 'results in the best balance of noise smoothing and preservation of compact detail' is presented without any quantitative metrics (e.g., RMS residuals, structural similarity indices, or cross-validation scores), error bars, or explicit comparison baselines against the other tested methods. This leaves the headline performance conclusion only weakly supported.
Authors: We agree that the current text relies on visual comparison of reconstructed sources. In the revised manuscript we will add explicit quantitative metrics for the mock-data tests, including RMS residuals to the true source, structural similarity index (SSIM), and cross-validation scores where appropriate. These quantities will be reported for every interpolation and regression method together with error bars obtained from multiple independent noise realizations, thereby placing the ranking of KNN regression on a firmer numerical footing. revision: yes
-
Referee: [Section 3] Section 3: the entire evaluation pipeline (both mock and Abell 370) assumes an exact, error-free lens model for the de-lensing step. No sensitivity analysis is reported for realistic cluster-scale lens-model uncertainties (typically 5–10 % in convergence), which would systematically displace source-plane points and could change the relative ranking of the regression methods. Mock tests use the input model by construction and therefore do not probe this failure mode.
Authors: The referee correctly observes that our present tests assume a perfect lens model. We will add a dedicated sensitivity subsection that perturbs the convergence map by 5 % and 10 % (consistent with typical cluster-lens uncertainties) and re-runs the full reconstruction pipeline on the mock data. The resulting changes in RMS, SSIM, and method ranking will be quantified and discussed. For the Abell 370 observations we will reference published lens-model uncertainties and comment on their expected influence on the source-plane sampling. revision: yes
Circularity Check
No significant circularity in algorithmic evaluation on external data
full rationale
The paper describes an algorithmic procedure (de-lensing followed by interpolation or regression) and evaluates its performance empirically on mock data and real observations of Abell 370. The central finding that KNN regression offers the best noise/detail balance is a direct outcome of those external tests rather than any parameter fitted inside the method's own equations or any derivation that reduces to its inputs by construction. No self-definitional steps, fitted-input predictions, or load-bearing self-citations appear in the presented logic; the assumption of an accurate input lens model is an external precondition, not a circular element within the paper.
Assumptions & free parameters
assumptions (2)
- domain assumption An accurate lens mass model is available to map observed pixels back to the source plane.
- domain assumption Point spread function effects can be neglected or pre-corrected.
Cite this review
Pith. "Pith review of Source REconstruction of Arcs behind Cluster Halos (SourceREACH): A New Source Reconstruction Algorithm Optimized for Giant Arcs and Galaxy Cluster Lenses." pith.science (2026). https://pith.science/paper/2HJ2TBFH
@misc{pith2026251111952,
author = {Pith},
title = {Pith review of: Source REconstruction of Arcs behind Cluster Halos (SourceREACH): A New Source Reconstruction Algorithm Optimized for Giant Arcs and Galaxy Cluster Lenses},
year = {2026},
howpublished = {\url{https://pith.science/paper/2HJ2TBFH}},
note = {Machine review of arXiv:2511.11952}
}
read the original abstract
We introduce a new algorithm designed for use with extended lensed images, specifically giant arcs lensed by galaxy clusters. These highly magnified images contain important information about both the mass distribution of the cluster and the properties of the background source, but modeling them requires significant computational effort. Our new source reconstruction methodology is designed to be accurate and efficient for high-resolution observations in which point spread function effects are not significant. The overall process deconvolves the observed image by the point spread function, de-lenses the image pixels, and uses interpolation or regression with smoothing to determine the model source. By working with de-lensed points, the method accounts for varying resolution across the source plane. We evaluate the speed and accuracy of different interpolation and regression methods using both mock data and real data for the giant arc in Abell 370. We find that utilizing K Nearest Neighbor Regression results in the best balance of noise smoothing and preservation of compact detail in the source.
Figures
Figures from the paper (8 more)
Forward citations
Cited by 1 Pith paper
-
Kinematic Mapping of Giant Arcs: A New Method to Locate Lensing Critical Curves
A kinematic-mapping technique locates the critical curve of a cluster lens from velocity maps of a giant arc, reaching 0.23-arcsecond uncertainty on the Dragon Arc.
Reference graph
Works this paper leans on
-
[1]
Acebron A., et al., 2024, ApJ, 976, 110 Birrer S., 2021, ApJ, 919, 38 Birrer S., Amara A., 2018, Physics of the Dark Universe, 22, 189 Birrer S., Amara A., Refregier A., 2015, ApJ, 813, 102 Bradaˇ c M., Schneider P., Lombardi M., Erben T., 2005, A&A, 437, 39 Bradaˇ c M., et al., 2009, ApJ, 706, 1201 Bradley L., et al., 2022, astropy/photutils: 1.5.0, doi:...
Reviewed May 25, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.