{"id":"83d76c12-ed3e-4c7d-b469-a66e9c79dc07","arxiv_id":"2601.13549","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"A two-stage beamformer partitions the eavesdropper's location-uncertainty ball into fan slices and enforces per-slice secrecy constraints with small 4×4 LMIs, keeping achievable rates where error-bound methods collapse to zero power.","lead":"Wireless base stations with huge antenna arrays can focus signals so precisely that nearby eavesdroppers get almost nothing — but only if the base station knows exactly where the eavesdroppers are. This paper designs a beamforming scheme that stays secure when eavesdropper locations are only approximately known, by slicing the uncertain area into small wedges and solving a fast convex problem for each.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The LMI (40) enforces the secrecy constraint over an ellipsoid inscribed in each sub-region's error box, not over the actual Cartesian-ball uncertainty; feasibility can leave Eve locations with leakage above Γ, so the worst-case guarantee is invalid.","rationale":"The paper addresses a real problem and the numerical experiments are plausible, but the central claim—guaranteeing the worst-case eavesdropping constraint (17b)—rests on Proposition 3's asserted equivalence between (38) and (39). That equivalence fails for a geometric reason independent of Taylor accuracy: the ellipsoid used in (39) is an inscribed subset of the error box and, more importantly, does not cover the intersection of the original Cartesian uncertainty ball with each sub-region. At the angular edge of a sub-region, a legitimate Eve location on the ball boundary can have (Δr/ϵ_s)^2 + (Δφ/ϑ_s)^2 ≈ 2, so it is omitted from the LMI constraint; feasibility of (40) therefore does not imply |a^H(θ,r)w|^2 ≤ Γ at that location. The reader's weakest assumption concerned the Taylor residual, which is a real but separate issue; my proposed check isolates the ellipsoid-vs-ball problem. If the test shows a violation, the algorithm is not robust as claimed and the central guarantee is unsupported. The flaw is concrete, local, and fixable (e.g., by enlarging Σ_s or using the true polar ellipse), but as written the paper's main result is not established.","tokens_in":23037,"tokens_out":13693,"duration_ms":121224,"concrete_test":"Reproduce Example 2 (N=256, σ_c=0.1, r̂=10 m, θ̂=0, R_max=1 bps/Hz). Solve (P4) to obtain w. For the sub-region containing the upper boundary of the uncertainty ball, compute M = max_{(θ,r) ∈ A_s ∩ {(r cosθ−10)^2 + (r sinθ)^2 ≤ Υ^2}} |a^H(θ,r)w|^2 by dense sampling (≥10^5 points) or a deterministic upper bound. Also evaluate the specific boundary point θ = φ_s + ϑ_s, r = r_max(θ) and check whether (Δr/ϵ_s)^2 + (Δφ/ϑ_s)^2 > 1 and |a^H(θ,r)w|^2 > Γ. If M > Γ, the LMI reformulation does not enforce (17b).","verdict_should_be":"REJECT","load_bearing_attack":"The load-bearing step is Proposition 3, which claims that the infinite constraint (38) can be rewritten as the ellipsoidal-uncertainty constraint (39): max over ζ_s^T Σ_s^{-1} ζ_s ≤ 1 of |w^H(a_s + J_s ζ_s)|^2 ≤ Γ, with Σ_s = diag(ϵ_s^2, ϑ_s^2). This replacement is not valid. For each sub-region A_s = [φ_min, φ_max] × [r_min, r_max], the possible error vector ζ_s = (Δr_s, Δφ_s) ranges over the rectangle |Δr_s| ≤ ϵ_s, |Δφ_s| ≤ ϑ_s. The ellipsoid (Δr_s/ϵ_s)^2 + (Δφ_s/ϑ_s)^2 ≤ 1 is inscribed in that rectangle, not a superset. Moreover, the physical uncertainty set from (7) is a Cartesian ball of radius Υ; in polar coordinates it is approximately {Δr^2 + (r̂Δθ)^2 ≤ Υ^2}, an ellipse with semi-axes Υ and Υ/r̂. At the angular boundary of a sub-region (Δφ = ϑ_s), a point on the ball boundary has Δr ≈ sqrt(Υ^2 − (r̂ϑ_s)^2) ≈ Υ for ϑ_s ≪ Υ/r̂. For this point, (Δr/ϵ_s)^2 + (Δφ/ϑ_s)^2 ≈ 2 > 1 when ϵ_s ≈ Υ. Such a point lies in A_s and in the original uncertainty ball but is excluded from the ellipsoid. Thus a beamformer satisfying all LMIs (40) can violate the worst-case eavesdropping constraint (17b). This is a logical error in the reformulation, independent of the Taylor residual; the residual issue (Prop. 2/Appendix E) is a separate, also unquantified gap.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies robust beamforming for near-field physical-layer security under imperfect Eve location information. The authors formulate a worst-case sum-rate maximization problem with a constraint on the maximum eavesdropping rate over a bounded location-uncertainty region. They first reveal a near-field angular-error amplification effect, then propose a two-stage method: (i) partition the uncertainty region into fan-shaped sub-regions in which a first-order Taylor approximation of the near-field steering vector is asserted to be accurate; (ii) apply the general sign-definiteness (GSD) lemma to convert the infinite worst-case secrecy constraints into 2S+1 deterministic 4×4 LMIs, yielding a convex SCA algorithm. The method is extended to multiple Bobs/Eves and to multi-path scenarios. Numerical results claim a superior trade-off between rate and robustness compared with sampling-based and error-bound-based benchmarks.","tokens_in":23445,"tokens_out":29010,"duration_ms":224626,"significance":"If the two-stage LMI reformulation were valid, this would be a valuable contribution: it addresses the practical and difficult scenario of Eve location uncertainty in near-field XL-array systems, and it proposes a complexity reduction from N-dimensional LMIs to 4×4 LMIs, avoiding the transmit-power collapse of error-bound methods. The angular-error amplification insight and the uncertainty-partitioning idea are conceptually interesting. However, the central reformulation contains a logical gap that undermines the worst-case guarantee, and the Taylor-accuracy proof is not rigorous. The significance is therefore conditional on substantial revision.","major_comments":[{"comment":"The reformulation of the worst-case constraint (38) over the fan-shaped sub-region A_s as the ellipsoidal constraint (39) is not valid. A_s is a rectangle in (θ,r) and, in the local polar coordinates around the surrogate, the uncertainty set from the Cartesian ball is approximately the ellipse Δr^2 + (r̂Δφ)^2 ≤ Υ^2. The ellipsoid in (39), ζ_s^T Σ_s^{-1}ζ_s ≤ 1 with Σ_s = diag(ϵ_s^2, ϑ_s^2), is inscribed in that rectangle, not a superset. For a central sub-region, ϵ_s ≈ Υ and ϑ_s ≈ 1/(2N), which is typically much smaller than Υ/r̂. A point on the boundary of the original ball with Δφ=ϑ_s has Δr ≈ sqrt(Υ^2 − (r̂ϑ_s)^2) ≈ Υ, so (Δr/ϵ_s)^2 + (Δφ/ϑ_s)^2 ≈ 2 > 1. Such a point lies in A_s and in the original uncertainty ball but is outside the ellipsoid. Consequently, a beamformer satisfying the LMIs (40) can violate the worst-case eavesdropping constraint (17b). This is a load-bearing error in","section":"Section III-B2, Proposition 3, Eqs. (38)-(40)"},{"comment":"The proof that the first-order Taylor approximation is 'largely accurate' under Δr/r̂ ≤ 0.1 and sinθ_E − sinθ̂ ≤ 1/(2N) is circular. Steps (e)-(g) in Appendix E use the same small-angle linearization (e.g., sinθ_E − sinθ̂ ≈ cosθ̂ Δθ) and small-range assumptions to show the residual is negligible; they do not bound the second-order remainder. No quantitative upper bound on ||Δa_E||_2 is provided. Thus the worst-case constraint (38) may be violated even if the LMI (40) is satisfied, because the Taylor approximation is not guaranteed to be accurate at all points of the sub-region, especially at corners or for smaller N. A rigorous error bound is needed to support the claimed guarantee.","section":"Proposition 2 / Appendix E"},{"comment":"The 'secure transmission probability' metric is not defined in the manuscript. If it is computed by Monte Carlo sampling of Eve locations, it does not validate the worst-case constraint (17b); a sampled probability of 1 is not a guarantee. The numerical results should be accompanied by a definition of this metric and, ideally, a separate check of the worst-case constraint on a dense grid or via an exact worst-case computation.","section":"Section V, Figs. 7 and 10"}],"minor_comments":[{"comment":"The block structure of H_s and H_{m,k,s_m} is ambiguous. Read as a 4×4 block matrix with b_s^(r) and b_s^(θ) as 2×1 blocks, the dimension is 4, not 6. However, the notation 'b_s^(r) = [∇_r a^H w, 0]^H' is confusing; it should be written with parentheses, e.g., [(∇_r a)^H w, 0]^H, and it should be clarified that the second row of the top-right block is zero.","section":"Section III-B2, Eq. (40) and Section IV, Eq. (47)"},{"comment":"The confidence level α is introduced but its choice and effect are not discussed. A short remark on how α relates to the practical guarantee would be useful.","section":"Section II-D, Eq. (15)"},{"comment":"In Fig. 10, the x-axis label says 'location error' but the caption says 'versus location error'; the caption in Fig. 11 says 'versus power ratio'. Please ensure the axes and captions are consistent.","section":"Section V-A"},{"comment":"The proof of Proposition 1 uses a determinant argument but is not fully rigorous; in particular, the step 'det(A B; C D) = det(A) det(D − C A^{-1} B)' requires A to be invertible, which is not guaranteed. A cleaner proof via Schur complement is recommended.","section":"Appendix A"},{"comment":"Reference [18] is an arXiv preprint; if it has been published in the interim, please update. Also, reference [1] is cited for XL-array transceiver technologies; consider citing a more specific work on near-field XL-array systems in the introduction.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The paper has a promising idea and the uncertainty-partitioning framework is interesting, but the central reformulation in Proposition 3 is not valid as stated: the ellipsoidal uncertainty set is inscribed rather than a superset, so the LMI condition is insufficient for the worst-case secrecy constraint. Together with the unquantified Taylor residual, these issues prevent the manuscript from supporting its main claims. The fixes are nontrivial but may be possible within the scope of the paper. I recommend major revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The angular-error amplification effect (close Eves turn small position errors into large angle errors) is a genuine and useful observation, and the two-stage idea — partition the location-uncertainty region into fan subregions sized by the 1/(2N) Taylor-accuracy condition, then apply a 4x4 LMI per subregion — is a real step beyond the N-dimensional error-bound LMI used in prior work. The complexity reduction and the numerical results (rates near the sampling benchmark without the transmit-power collapse) are attractive.\n\nBut the stress-test note is correct, and it lands on a load-bearing step. Prop. 3 replaces the constraint over the rectangle A_s (or the actual ball intersection) with a constraint over the ellipse ζ_s^T Σ_s^{-1} ζ_s ≤ 1. That ellipse is inscribed in the rectangle, not a superset. A point at the angular boundary and range boundary of a subregion can lie in the original uncertainty ball but outside the ellipse, so satisfying the LMI (40) does not guarantee the worst-case leakage constraint (17b). This is not a Taylor-residual issue; it is a mismatch between the uncertainty set used in the reformulation and the one in the problem statement. The authors would need an outer ellipsoid (e.g., scaled by √2) or an additional argument to actually bound the eavesdropping rate over A_s.\n\nProp. 2's proof is also partly circular: Appendix E approximates sinθ - sinθ̂ ≈ cosθ̂Δθ inside the residual bound, so the “accuracy condition” is not independently established. The Taylor residual itself is never bounded in the optimization, so even if the ellipsoid issue were fixed, the guarantee would still be approximate unless a residual term is added.\n\nThe “secure transmission probability of 1” claim is conditioned on the 95% ball, but the design does not theoretically guarantee even that ball; the Monte Carlo metric is undefined. On the minor side, the reader's block-size worry about b_s^(r) is unfounded — b_s^(r) is a 2-vector, so the 4x4 claim holds.\n\nWho gets value: researchers in near-field PLS and robust beamforming will find the angular-error amplification and partition heuristic worth reading. The central worst-case guarantee, however, is not proven as written. This deserves peer review with major revision — the fixes are local (use an outer approximation, quantify the residual, state the guarantee as approximate) but they are necessary before the main claim can be taken at face value.","headline":"Clever partition-and-refined-LMI idea with a real angular-error amplification insight, but the worst-case secrecy guarantee does not follow as written — the ellipsoid in Prop. 3 is an inner approximation of the actual uncertainty region.","tokens_in":24099,"tokens_out":4780,"would_cite":false,"duration_ms":45822,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"Infinite near-field secrecy constraints can be reduced to a finite set of 4-by-4 matrix inequalities by partitioning the eavesdropper's location-uncertainty region and linearizing the near-field steering vector around each sub-region's surr","keywords":["near-field communications","physical layer security","robust beamforming","location uncertainty","extremely large-scale arrays","linear matrix inequalities","Taylor approximation","angular error amplification"],"falsifier":"Run the proposed algorithm for a small array (e.g., N=16) with an eavesdropper whose uncertainty region straddles a sub-region corner, then compute the exact worst-case leakage max_{q∈A_E} |a(q)^H w|² by dense grid sampling and compare it with the threshold Γ; a violation at any grid point while all 4×4 LMIs hold would falsify the claim that the LMI reformulation enforces the original security constraint.","tokens_in":22789,"feed_emoji":"📡","tokens_out":5306,"duration_ms":52829,"temperature":0.7,"pith_summary":"Extremely large antenna arrays create near-field spherical wavefronts that let a base station focus signals in both angle and range, but they also make secure beamforming fragile: small errors in an eavesdropper's location produce large angle errors, and conventional robust designs either fail to guarantee secrecy or drain the transmit power. The paper claims that this fragility can be overcome by partitioning the eavesdropper's location-uncertainty region into fan-shaped sub-regions and using a first-order Taylor expansion of the near-field steering vector around a surrogate location in each sub-region. Under conditions that make the Taylor approximation accurate, the infinite family of worst-case eavesdropping-rate constraints is recast as a finite set of deterministic 4-by-4 linear matrix inequalities, with complexity independent of the array size. The paper argues this yields a superior trade-off between sum-rate and secrecy robustness and carries over to multiple users and multiple eavesdroppers.","feed_headline":"Near-field secure beamforming shrinks to 4x4 matrix tests","feed_subtitle":"Splitting eavesdropper uncertainty into fan-shaped zones turns infinite worst-case secrecy constraints into a finite LMI set.","key_machinery":"The engine is the near-field steering vector a(θ,r) with Fresnel phase approximation, together with its gradient matrix J_s = [∇_r a, ∇_θ a] at a surrogate location. The paper combines three tools: (1) Proposition 2's accuracy conditions (Δr/r̂ ≤ 0.1 and sin(θ̂+Δθ)−sin θ̂ ≤ 1/(2N)) that justify the linearization; (2) the fan-shaped partition of the uncertainty region into 2S+1 sub-regions, each with a surrogate location and a bounding ellipse Σ_s for the range–angle error; and (3) the GSD lemma applied to convert the worst-case quadratic constraint into the 4×4 LMI (40). The argument works because the partition makes the linearization uniform, so the only uncertainty that survives in each su","core_discovery":"The central claim is that the near-field steering vector a(θ,r) can be locally linearized as a(φ_s, r_s) + J_s ζ_s in each partitioned sub-region, where ζ_s is a 2-dimensional range–angle error vector bounded by an ellipsoid Σ_s. Recasting the worst-case leakage constraint |w^H (a(φ_s,r_s)+J_s ζ_s)|² ≤ Γ for all ζ_s^T Σ_s^{-1} ζ_s ≤ 1, the general sign-definiteness lemma transforms this infinite family into 2S+1 LMIs of size 4 (Proposition 3). The structural discovery is that the LMI dimension drops from N+2 (the error-bound method, which characterizes the N-dimensional steering-vector error) to 4 (the two-dimensional physical error), making robust near-field beamforming affordable for extre","pith_inferences":["The paper proves the reformulation is exact under the Taylor assumption but never quantifies the residual; a testable extension is to fold a worst-case second-order residual bound into the LMI as slack, converting the heuristic guarantee into a certified one.","The same partition-and-linearize template likely applies to other near-field problems with location uncertainty—ISAC beam tracking, near-field localization, and near-field NOMA—where the physical error dimension is also two.","The angular-error amplification effect suggests a design maxim beyond this paper: near-field robust designs should treat uncertainty in polar coordinates rather than in Cartesian CSI error, because the mapping between them is strongly anisotropic.","One concrete stress test is near sub-region corners: if secure transmission probability dips at the fan boundaries, the partition should be refined adaptively rather than uniformly."],"forward_implications":["Robust near-field PLS beamforming scales to extremely large arrays: per iteration the algorithm needs only 4×4 LMIs and one SOC constraint, independent of the number of antennas.","Secrecy robustness is no longer bought by collapsing transmit power; the proposed beamformer shapes the leakage pattern over the whole uncertainty region instead of inflating an error bound.","The method extends to K Bobs and M Eves, with one 4×4 LMI per (Bob, Eve, sub-region) triple, covering multi-user secure networks.","The accuracy conditions give an explicit recipe to set the number of sub-regions from N and the uncertainty radius, making the robustness–rate trade-off tunable."],"fun_headline_variants":["LMI size drops from N+2 to 4 in near-field secure beamforming","Angular-error amplification: closer Eves, bigger angle errors","Fan-shaped partition turns infinite secrecy constraints into finite LMIs","Near-field beamforming robust to Eve location errors","Infinite worst-case secrecy constraints become 4x4 LMIs"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The whole guarantee rests on the claim that after partitioning, the first-order Taylor residual is negligible everywhere in each sub-region; the proof of that claim itself uses the same small-angle linearization, and the optimization never bounds the residual.","fun_headline_variants_meta":{"raw":{"variants":["LMI size drops from N+2 to 4 in near-field secure beamforming","Angular-error amplification: closer Eves, bigger angle errors","Fan-shaped partition turns infinite secrecy constraints into finite LMIs","Near-field beamforming robust to Eve location errors","Infinite worst-case secrecy constraints become 4x4 LMIs"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001327,"raw_usage":{"total_tokens":5306,"prompt_tokens":886,"completion_tokens":4420,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":630,"completion_tokens_details":{"reasoning_tokens":4332}},"tokens_in":630,"tokens_out":4420,"duration_ms":33817,"temperature":1.0,"reasoning_tokens":4332,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T09:30:35.313629+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the proposed algorithm for a small array (e.g., N=16) with an eavesdropper whose uncertainty region straddles a sub-region corner, then compute the exact worst-case leakage max_{q∈A_E} |a(q)^H w|² by dense grid sampling and compare it with the threshold Γ; a violation at any grid point while all 4×4 LMIs hold would falsify the claim that the LMI reformulation enforces the original security constraint.","supporting_citations":[],"review_version":1}