{"id":"a8e5600f-9175-40ce-8417-5cefc2bb3724","arxiv_id":"2607.08108","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":4.0,"correctness_risk":"low","formal_verification":"none","parameter_count":4,"one_line_summary":"Fixed-row truncated Hankel smoothing plus continuous Newton refinement recovers single-snapshot DoAs near square-Hankel accuracy at linear cost in array size.","lead":"A truncated Hankel matrix plus Newton refinement estimates directions of arrival from one array snapshot at cost that grows only linearly with antenna count. That makes high-resolution sensing practical on large reconfigurable arrays used in joint communication-and-sensing base stations.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"Fixed LN=20 may not preserve usable MUSIC noise subspace once sources approach the truncation limit or become closer than the simulated 9° floor.","rationale":"The reader correctly isolates the fixed-LN sufficiency assumption as the weakest link. The paper’s complexity analysis (Table I) and the N-scaling runtime curve (Fig. 2) are solid once LN is treated as constant; the RMSE gap of ~1.5 dB (Fig. 1) is likewise credible under the stated simulation settings. The concern is therefore not that the reported numbers are wrong, but that they do not probe the regime in which truncation is most likely to break MUSIC’s noise-subspace geometry. Because the contribution is framed as a practical systems method for large reconfigurable arrays, an untested operating envelope around K and Δ\theta is a genuine condition on acceptance rather than a reason for rejection. The recommended verdict therefore remains CONDITIONAL, with the concrete ablation above serving as the natural next check before the claim can be treated as generally reliable.","tokens_in":10897,"tokens_out":644,"duration_ms":6645,"concrete_test":"Re-run the Monte-Carlo of Fig. 1 at N=256, SNR=20 dB, with (i) K=15 (still <LN+1=21) and (ii) min separation reduced to 2°, keeping LN=20 and the same Newton settings. If truncated Hankel Newton-MUSIC RMSE then exceeds square Hankel Newton-MUSIC by more than ~3 dB or the coarse-grid stage fails to seed all K peaks, the load-bearing premise fails and the linear-complexity claim no longer covers the intended high-DoF regime.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim (RMSE within ~1.5 dB of square Hankel Newton-MUSIC at O(LN^{2}N) cost) rests on the premise that a fixed truncation LN ≪ N still yields a usable noise subspace of dimension LN+1−K after spatial smoothing, with any resolution loss recovered by Newton from a 0.5° coarse grid (Sec. III-B, Alg. 1). Simulations fix K=4, LN=20, and min separation Δ\theta=9° (Sec. V). Under these conditions the (LN+1)\times(LN+1) matrix has a comfortable noise-subspace dimension of 17 and the sources are well-separated relative to the truncated aperture, so the premise is not stressed. When K approaches LN (or sources are closer / more unequal in power), the noise subspace shrinks and the truncated manifold a_L(\theta) loses resolving power; local Newton refinement cannot create peaks that the coarse spectrum never produced. The paper supplies no analytic bound on admissible K or Δ\theta versus LN, nor any ablation that varies these quantities while holding N large. Thus the claimed accuracy–complexity trade-off is demonstrated only inside a comfortable operating regime, not shown to hold under the denser angular scenes that large reconfigurable arrays are intended to resolve.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper proposes Truncated Hankel Newton-MUSIC for single-snapshot DoA estimation with large reconfigurable arrays in ISAC. A single snapshot is rearranged into a rectangular Hankel matrix with fixed small row dimension LN ≪ N (LN+1 > K), yielding a low-dimensional smoothed correlation matrix whose SVD recovers a usable noise subspace at cost O(LN^{2}N + LN^{3}). Coarse-grid minima of the MUSIC cost J(θ) are then refined by second-order Newton updates that use analytic first and second derivatives of the truncated steering vector. Complexity analysis (Table I) and Monte-Carlo simulations (N up to 1024, K=4, LN=20, Δθ ≥ 9°, M=2000) show RMSE within ~1.5 dB of square Hankel Newton-MUSIC while reducing runtime by more than two orders of magnitude at N=1024 relative to conventional square Hankel MUSIC.","tokens_in":11215,"tokens_out":1015,"duration_ms":9441,"significance":"Single-snapshot high-resolution DoA on large reconfigurable arrays is a genuine bottleneck for real-time ISAC. The combination of fixed-row Hankel truncation with continuous Newton refinement is a practical engineering contribution: the complexity claim is standard matrix arithmetic and is corroborated by the runtime curves in Fig. 2, and the accuracy claim is supported under the stated Monte-Carlo regime. The work supplies a clear algorithmic recipe (Algorithm 1), an explicit complexity table, and reproducible synthetic evaluation against classical baselines. If the accuracy–complexity trade-off extends beyond the comfortable operating point used in the experiments, the method would be immediately useful for large-array sensing; even as a carefully characterized engineering solution it is of interest to the array-signal-processing community.","major_comments":[{"comment":"The central accuracy claim (RMSE within ~1.5 dB of square Hankel Newton-MUSIC at linear cost) rests on a fixed truncation LN=20 for K=4 and a minimum separation Δθ=9° (Sec. V). Under these settings the noise-subspace dimension is 17 and the sources are well separated relative to the truncated aperture, so the premise that truncation loss is fully recovered by Newton from a 0.5° coarse grid is not stressed. No analytic bound relating admissible K or Δθ to LN is given, and no ablation varies K, LN, or angular separation while keeping N large. When K approaches LN or sources become closer/more unequal, the truncated manifold a_L(θ) loses resolving power and local Newton cannot create peaks that the coarse spectrum never produced. An ablation (or a short theoretical discussion of the effective aperture after truncation) is needed before the claimed trade-off can be regarded as generally esta","section":null},{"comment":"Sec. III-B and Algorithm 1 treat K as known and use it both to select the noise subspace dimension and to extract exactly K peaks. In practice K must be estimated from a single snapshot; model-order errors would directly corrupt Un and the subsequent Newton initializations. The manuscript should either include a simple order-selection step (or a sensitivity study) or explicitly state that K is assumed known and discuss the practical implication for ISAC.","section":null}],"minor_comments":[{"comment":"Figs. 1–2 and the surrounding text repeatedly write “Netown-MUSIC”; correct to “Newton-MUSIC”.","section":null},{"comment":"Eq. (7) and the accompanying footnote mix R and RL; a consistent symbol for the smoothed correlation would improve readability.","section":null},{"comment":"The abstract and introduction emphasize reconfigurable antennas, yet all experiments use a fixed ULA geometry. A short remark clarifying that the algorithm itself is geometry-agnostic (or a brief non-ULA experiment) would better connect the motivation to the evaluation.","section":null},{"comment":"RMSE is reported in dBrad; a brief conversion note or dual axis in degrees would help readers accustomed to degree-scale DoA errors.","section":null},{"comment":"A few recent single-snapshot / off-grid DoA references (beyond the cited Hankel-MUSIC and Newtonized OMP works) would better situate the contribution.","section":null}],"recommendation":"major_revision","confidential_remarks":"The technical core is sound engineering and the complexity claims check out; the main risk is over-generalization of the accuracy claim beyond the comfortable (K, LN, Δθ) regime used in the simulations. A major-revision decision that requires a modest ablation or an explicit operating-regime statement should be sufficient; I do not see a load-bearing mathematical error that would justify rejection."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The one thing worth knowing is that they deliberately fix the Hankel row length LN independent of N, keep the long column for smoothing, and then Newton-refine coarse peaks. That is the actual move. Complexity then drops to O(LN^{2}N) instead of O(N^{3}), and at N=1024 they show more than two orders of magnitude runtime cut while RMSE stays within ~1.5 dB of the square-Hankel Newton baseline.\n\nWhat is new is modest but real: the combination of fixed-row truncation (LN=20 for K=4) with second-order continuum refinement for the single-snapshot reconfigurable-array setting. Hankel smoothing and Newtonized continuum search already exist; the paper’s contribution is the deliberate truncation-plus-Newton package plus the matching complexity table and runtime curves. The math is standard and clean—SVD equivalence note, analytic gradient/Hessian of the MUSIC cost, Algorithm 1. Monte-Carlo design (M=2000, N=256, K=4, min sep 9°) is transparent and the four-way ablation (square/truncated × grid/Newton) isolates the two design choices. Fig. 1 and Fig. 2 support the accuracy–complexity claim under those conditions. Citations to Liao–Fannjiang, Mamandipoor, and classical MUSIC/ESPRIT are appropriate; self-cites are minor.\n\nSoft spots are real but proportionate. LN is an empirical free parameter; there is no bound relating admissible K or minimum separation to LN, and the simulations never stress the regime where K approaches LN or sources sit closer than 9°. Newton cannot invent peaks the coarse truncated spectrum never produced. K is assumed known, no real RF data, no modern sparse-recovery baselines. Those are the usual systems-paper gaps, not load-bearing contradictions.\n\nThis is for people who actually need low-latency single-snapshot DoA on large reconfigurable arrays in ISAC. A serious referee should see it; the core claim is reproducible from the given equations and figures. I would engage if I were working the same latency–N trade-off; otherwise it is a clean incremental systems note.","headline":"Solid engineering trade-off paper: fixed-row Hankel + Newton gives near-square accuracy at linear cost for single-snapshot DoA, demonstrated cleanly but only inside a comfortable regime.","tokens_in":11837,"tokens_out":534,"would_cite":false,"duration_ms":5651,"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 fixed-size Hankel window plus Newton refinement makes single-snapshot DoA estimation linear in array size, with accuracy close to full square Hankel MUSIC.","keywords":["single-snapshot DoA","Hankel spatial smoothing","truncated Hankel","Newton-MUSIC","reconfigurable antennas","ISAC","low-complexity subspace methods"],"falsifier":"Increase the number of sources or shrink the minimum angular separation while keeping LN fixed at the paper’s value (20); if the RMSE gap to square Hankel Newton-MUSIC then opens well beyond 1.5 dB or the method fails to resolve the sources, the truncation premise fails.","tokens_in":11766,"feed_emoji":"📡","tokens_out":631,"duration_ms":6034,"temperature":0.7,"pith_summary":"In reconfigurable-antenna ISAC systems that must estimate directions of arrival from one snapshot, classical subspace methods fail because the sample covariance is rank-deficient, while full Hankel spatial smoothing restores rank at cubic cost in the number of ports. This paper shows that a deliberately truncated Hankel matrix whose row dimension is held fixed and independent of array size still recovers a usable signal subspace, so that correlation construction and SVD become linear in the number of antennas. Coarse grid peaks are then polished by a few second-order Newton steps in continuous angle, removing the quantization floor that dense-grid MUSIC leaves behind. Simulations with hundreds of ports confirm that the accuracy stays within roughly 1.5 dB of the expensive square-Hankel Newton baseline while runtime drops by more than two orders of magnitude at N=1024. The result matters for real-time sensing: large reconfigurable arrays can keep high angular resolution without waiting for multiple snapshots or paying cubic compute.","feed_headline":"Single-snapshot DoA that stays linear in array size","feed_subtitle":"Fixed Hankel window plus Newton polish cuts runtime by 100\times while matching full-matrix accuracy","key_machinery":"Truncated Hankel matrix of fixed row dimension LN≪N: the single snapshot is rearranged into a rectangular Hankel matrix whose small row size keeps the smoothed correlation matrix tiny, while the long column dimension still supplies enough overlapping subarrays for subspace recovery; subsequent Newton updates on the continuous MUSIC cost then refine the coarse peaks.","core_discovery":"When the Hankel row dimension is fixed at a small constant LN independent of array size N (and only slightly larger than the number of sources), Truncated Hankel Newton-MUSIC recovers a usable noise subspace, yields DoA RMSE within about 1.5 dB of full square Hankel Newton-MUSIC, and reduces the dominant complexity from O(N^{3}) to O(LN^{2} N), producing more than two orders of magnitude runtime reduction at N=1024.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Truncated Hankel Newton-MUSIC keeps single-snapshot DoA linear in N","Fixed-row Hankel plus Newton refines DoA at O(LN²N) cost","Single-snapshot DoA: fixed Hankel window matches full-matrix RMSE","Gridless DoA via truncated Hankel cuts runtime >100× at N=1024","Newton-polished truncated Hankel recovers noise subspace for large arrays"],"cache_read_input_tokens":128,"weakest_assumption_plain":"A fixed, small truncation length still leaves enough spatial diversity that the noise subspace of the tiny correlation matrix remains usable for MUSIC, and that any resolution loss is fully recovered by local Newton steps started from a coarse half-degree grid.","fun_headline_variants_meta":{"raw":{"variants":["Truncated Hankel Newton-MUSIC keeps single-snapshot DoA linear in N","Fixed-row Hankel plus Newton refines DoA at O(LN²N) cost","Single-snapshot DoA: fixed Hankel window matches full-matrix RMSE","Gridless DoA via truncated Hankel cuts runtime >100× at N=1024","Newton-polished truncated Hankel recovers noise subspace for large arrays"]},"model":"grok-4.5","effort":"low","cost_usd":0.004942,"raw_usage":{"total_tokens":1429,"prompt_tokens":812,"num_sources_used":0,"completion_tokens":90,"cost_in_usd_ticks":49420000,"prompt_tokens_details":{"text_tokens":812,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":527,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":812,"tokens_out":90,"duration_ms":5032,"temperature":1.0,"reasoning_tokens":527,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-10T12:55:39.891128+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Increase the number of sources or shrink the minimum angular separation while keeping LN fixed at the paper’s value (20); if the RMSE gap to square Hankel Newton-MUSIC then opens well beyond 1.5 dB or the method fails to resolve the sources, the truncation premise fails.","supporting_citations":[],"review_version":1}