{"id":"fe2d2f7e-42a2-4d6c-8872-9a331463496f","arxiv_id":"2506.00192","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The authors derive a squared position error bound for STARS-assisted near-field ISAC and propose algorithms that jointly optimize sensor placement and beamforming, achieving lower error at lower deployment cost than benchmarks.","lead":"A new design for combining sensing and communication in 6G uses a smart surface that reflects and transmits signals, with sensors placed directly on the surface to exploit near-field spherical waves for distance estimation. The paper derives a bound on positioning error and shows how to place sensors and set beamformers to minimize cost while keeping communication quality.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 1's diagonal-FIM proof rests on an invalid trace inequality; the off-diagonal FIM terms may be nonzero, making the closed-form SPEB an unquantified approximation.","rationale":"After re-deriving the key step, I find the reader's weakest assumption is indeed the most load-bearing issue. The diagonal FIM is not a technical convenience; it is the mechanism by which Proposition 1 produces the closed-form SPEB in Eqs. (20)-(21), and it feeds directly into the deployment optimization in Eqs. (26), (31), and (39). The trace inequality cited in Appendix A is misapplied: for PSD matrices one can justify Tr(AB) <= Tr(A)Tr(B), but diag(v_{t,1}) has mixed-sign entries, so the product trace can be nonzero. I constructed a simple counterexample showing this. The empirical match in Fig. 3 may still hold because the off-diagonal terms could be small for the specific steering vectors and optimized covariance, but the paper does not demonstrate that; the proposed numerical check settles it. I do not see grounds to reject the paper: the system concept, algorithms, and simulations are meaningful, and the flaw is repairable either by a correct symmetry argument or by bounding the off-diagonal contribution. I also note a secondary gap in the proof of Proposition 2 in Appendix B: the chain f(\\tilde{d}_s) > f_1(\\tilde{d}_s) >= f_1(M^2 d_R^2/M_r^2) does not imply f(\\tilde{d}_s) > f(M^2 d_R^2/M_r^2) because f_2 at the boundary is positive. This affects the closed-form sensor interval, but the SCA loop in Algorithm 1 remains a valid fallback. Hence the conditional verdict is appropriate.","tokens_in":25032,"tokens_out":8748,"duration_ms":79267,"concrete_test":"Evaluate the exact FIM from Eq. (51), with \\dot{A}_theta and \\dot{A}_r from Eq. (19), for the paper's simulation parameters (N=128, M=M_r=32, d_s=d_R=lambda_c/2, lambda_c=0.0107 m, r_s=20 m, theta_s=60 deg), using R_{\\bar{X}_r}=I_{M_r} and, separately, the optimized covariance produced by Algorithm 2. Compute rho=|J_12|/sqrt(J_11*J_22). If rho is not below 1e-3 in either case, the diagonal-FIM assumption is violated in the operating regime; then compare the full SPEB with the diagonal formula (20) to quantify the relative error. If rho is exactly zero to numerical precision, the conclusion survives despite the invalid proof step.","verdict_should_be":"UNCHANGED","load_bearing_attack":"In Appendix A, the proof that the FIM J_gamma is diagonal relies on the inequality |Tr(AB)| <= Tr(A)Tr(B) for arbitrary matrices A,B, then applies it to Tr(diag(v_{t,1}) R_{\\bar{X}_r} \\bar{A}_t) and concludes this trace is zero because Tr(diag(v_{t,1}))=0. This inequality is not valid for arbitrary matrices; it holds (in the form used) for positive semidefinite matrices, whereas diag(v_{t,1}) contains negative entries and is not PSD. Expanding the trace gives alpha_t^H diag(v_{t,1}) R_{\\bar{X}_r} alpha_t, which is not identically zero for generic PSD R_{\\bar{X}_r}; for example, with M=3, v=[-1,0,1], alpha_t=1, and R=diag(1,0.5,1), the value is 0.5. Thus the off-diagonal entries [J_gamma]_12 and [J_gamma]_21 in Eq. (51) are not proven to vanish. Since Proposition 1 and Eqs. (20)-(21) replace J_gamma by its diagonal, the resulting SPEB is an approximation with unquantified error, and the sensor-deployment optimization in Section III-A is built on this unvalidated diagonal form.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript proposes a STARS-assisted near-field ISAC architecture in which sensing antennas are co-located on the STARS, and derives a squared position error bound (SPEB) whose closed form is claimed to expose how the SPEB depends on the sensor interval, the number of sensors, and the active/passive beamforming. A weighted SPEB-plus-deployment-cost problem is formulated, then solved by alternating optimization: a successive convex approximation / geometric programming block for sensor deployment and a penalty-based SDR/SCA block for beamforming. Numerical simulations compare the proposed SPEB with an existing numerical SPEB and with ML/MUSIC estimates, and compare the proposed algorithms against three benchmarks.","tokens_in":25291,"tokens_out":6437,"duration_ms":63085,"significance":"If the main derivation is correct, the paper offers a useful engineering result: an explicit, interpretable SPEB formula for near-field sensing with a STARS-mounted array, together with a deployment-aware optimization framework that appears to outperform fixed-deployment benchmarks. The paper also includes concrete algorithmic machinery (SCA, GP approximation, SDR with rank-one recovery, penalty methods) and Monte Carlo comparisons against classical estimators, which are valuable even if the final claim is only approximate. The central theoretical claim, however, is the diagonality of the Fisher information matrix in Proposition 1, and the current proof of that claim has a gap; the numerical validation cannot by itself quantify the approximation error over the parameter range used in the deployment optimization.","major_comments":[{"comment":"The proof that the off-diagonal FIM entries vanish uses the inequality |Tr(AB)| ≤ Tr(A)Tr(B) with A = diag(v_{t,1}) and B = R_{\\bar X_r} \\bar A_t. This inequality is not valid for arbitrary square matrices; in the form used, it requires both matrices to be positive semidefinite, whereas diag(v_{t,1}) has negative entries. Indeed, Tr(diag(v_{t,1}) R_{\\bar X_r} \\bar A_t) = α_t^H diag(v_{t,1}) R_{\\bar X_r} α_t, which is not identically zero for a generic PSD R_{\\bar X_r}; for example, with M=3, v=[-1,0,1], α_t=1, and R=diag(1,0.5,1), the value is 0.5. Therefore the off-diagonal entries [J_γ]_{12} and [J_γ]_{21} are not proven to vanish, and the diagonal SPEB expression in Proposition 1, Eqs. (20)-(21), is an unquantified approximation. Since Section III-A optimizes the sensor interval using these diagonal forms, this gap is load-bearing.","section":"Appendix A, Eq. (51)"},{"comment":"The expression for [J_{tilde η}]_{2,2} contains a negative first term proportional to -c(R_{\\bar X_r}), while any entry of a valid Fisher information matrix must be nonnegative. As written, for parameter choices where c(R_{\\bar X_r}) > 0, this diagonal entry can become negative, which is inconsistent with the definition in Eq. (16). The subsequent substitution in Section III-A, Eq. (25b), assumes this term has a fixed sign (C_1 > 0) and therefore builds the sensor-deployment optimization on an expression that may not be a valid FIM. The authors should either prove a sign property for c(R_{\\bar X_r}) under the model constraints, or revise Eq. (21b) and the optimization that uses it.","section":"Eq. (21b)"},{"comment":"As printed, the feasible set for \\tilde d_s is given by M^2 d_R^2/4 ≤ \\tilde d_s ≤ M^2 d_R^2/M_r^2. For any M_r > 2, the upper bound M^2 d_R^2/M_r^2 is strictly smaller than the lower bound M^2 d_R^2/4, so the subproblem (24) is infeasible and Proposition 2's closed-form solution \\tilde d_s^* = (M d_R/M_r)^2 lies outside the stated feasible set. This appears to be a typographical error in the lower bound or in the aperture constraint (23b), but as written it invalidates the sensor-interval optimization. Please correct the bounds and re-examine the monotonicity argument in Appendix B if the bounds change.","section":"Section III-A, constraint (24b)"}],"minor_comments":[{"comment":"The phrase 'a cost function minimization problem, a cost function minimization problem is formulated' is duplicated and should be reduced to a single clause.","section":"Abstract"},{"comment":"There is a typo, 'amzith angle', which should be 'azimuth angle'.","section":"Section II-C"},{"comment":"Even after correcting the bound issue, the notation \\tilde d_s = d_s^2 and the subsequent inequality (24b) should be stated with explicit division bars, since the current rendering makes the intended fractions ambiguous.","section":"Section III-A, Eq. (24b)"},{"comment":"The caption states a comparison of 'RMSE/root SPEB' but the text does not define how the root SPEB is computed from Eq. (20); please add the definition or a reference.","section":"Fig. 7"},{"comment":"The notation for the trace is inconsistent: the main text uses 'tr' in Eq. (14) and 'Tr' elsewhere. Please unify.","section":"Eq. (14) and Appendix A"}],"recommendation":"major_revision","confidential_remarks":"The main technical barrier is the invalid trace inequality in Appendix A, which is load-bearing for the diagonal-FIM claim. The paper's engineering contribution and numerical study are solid, and the issue is fixable in principle by computing the off-diagonal FIM terms directly and either proving they are small under the proposed deployment/beamforming constraints or explicitly redefining Proposition 1 as an approximation with a quantified error. I would not recommend rejection on the current evidence, but the manuscript should not be accepted until this gap is addressed."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThis paper is a good example of a solid systems paper with a load-bearing proof gap. The new architecture — sensors colocated at the STARS for near-field ISAC — is a natural and useful extension of the authors' earlier STARS-ISAC work, and the SPEB derivation is genuinely new. The closed-form optimal sensor interval under the stated condition (aperture matching between STAR and sensor arrays) is a nice analytical result, and the joint sensor-deployment/beamforming algorithm is thorough. The numerical validation against the numerical SPEB and against ML/MUSIC is reassuring: the approximate SPEB tracks the exact bound well in the shown regimes, and the proposed scheme beats the benchmarks in both SPEB and deployment cost.\n\nThe problem is Appendix A. The claim that |Tr(AB)| ≤ Tr(A)Tr(B) for all A, B is false. It holds for positive semidefinite matrices, but diag(v_{t,1}) is not PSD — it has both positive and negative entries. The specific trace Tr(diag(v_{t,1}) R_{\\bar{X}_r} \\bar{A}_t) does not vanish by that argument. As the stress-test note shows, a simple counterexample gives a nonzero value. That means the off-diagonal entries of the FIM are not proven to be zero, and Proposition 1's diagonal SPEB is an approximation whose error is unquantified. The entire sensor-deployment optimization in Section III-A is built on that diagonal form. This is not a fatal blow to the paper's practical value — the simulations suggest the approximation is good — but the theoretical claim is not established. Also, Eq. (21b) has a negative term in the (2,2) diagonal entry; even if the total stays positive, the expression as written looks like it could be negative for some parameters, which would violate basic FIM properties. That needs a closer look or at least a comment.\n\nMinor issues: the abstract has a duplicated phrase, and some simulation figures lack error bars.\n\nBottom line: this deserves a serious referee. I would send it to peer review, with the expectation that the authors either supply a correct proof of the diagonal FIM or (more likely) reframe Proposition 1 as an approximation with a quantified error bound. The architecture and optimization are valuable enough that I'd rather see this repaired than rejected. If you're working on near-field ISAC or RIS-aided sensing, this is worth a reading-group slot.","headline":"Solid near-field ISAC architecture, but Proposition 1's diagonal-FIM proof rests on an invalid trace inequality and needs repair before the analytical claims hold.","tokens_in":25839,"tokens_out":2982,"would_cite":true,"duration_ms":28781,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that a closed-form squared position error bound, derived from a diagonal Fisher information approximation, lets near-field STARS-assisted ISAC systems be designed for both sensing accuracy and sensor deployment cost.","keywords":["integrated sensing and communication","near-field propagation","simultaneously transmitting and reflecting surface","squared position error bound","sensor deployment","beamforming design","Fisher information matrix","Cramér–Rao bound"],"falsifier":"Compute the exact Fisher information matrix from Eq. (16) numerically, without assuming the off-diagonal terms vanish, for a range of target angles and distances; if the normalized off-diagonal entries are not close to zero, or if inverting the full FIM gives an SPEB noticeably below the closed form of Proposition 1, the paper's core approximation is falsified.","tokens_in":24794,"feed_emoji":"📡","tokens_out":5200,"duration_ms":54250,"temperature":0.7,"pith_summary":"Near-field wireless signals carry the target's distance in the curvature of spherical wavefronts, so a surface that both reflects and transmits can act as a sensor array. This paper proposes mounting radio sensors directly on a simultaneously transmitting and reflecting surface (STARS) and claims two things: a closed-form squared position error bound (SPEB) that makes explicit how sensing accuracy depends on sensor spacing, sensor count, and beamforming, and a joint optimization algorithm that reaches the best sensing accuracy among its benchmarks while using the fewest sensors. The key step is treating the Fisher information matrix of the estimated position as diagonal, so angle and distance estimation decouple. The paper validates the bound against a numerical SPEB benchmark and reports that the proposed alternating optimization converges to a stationary point. A sympathetic reader would take away that near-field ISAC sensing performance can be designed analytically rather than tuned by simulation.","feed_headline":"Closed-form bound ties sensor layout to near-field sensing accuracy","feed_subtitle":"Paper's SPEB formula and joint algorithm minimize sensing error while cutting sensor cost.","key_machinery":"The load-bearing object is the squared position error bound of Proposition 1, obtained by transforming the polar-coordinate Fisher information matrix to Cartesian coordinates through the matrix $T$. The bound is assembled from three correlation factors, $a(\\mathbf{R}_{\\bar{X}_r})$, $b(\\mathbf{R}_{\\bar{X}_r}, \\mathbf{v}_{t,i})$, and $c(\\mathbf{R}_{\\bar{X}_r})$, which couple the beamforming covariance matrix to the transmit steering vector and to the integer symmetry vectors $\\mathbf{v}_{r,1}, \\mathbf{v}_{r,2}, \\mathbf{v}_{t,1}, \\mathbf{v}_{t,2}$, together with sums of powers of sensor indices. These factors make the dependence on sensor interval $d_s$ and sensor number $M_r$ explicit, and the claimed diagonal form of the FIM is what permits the closed-form expression.","core_discovery":"The central discovery is Proposition 1, a closed-form SPEB expression for the sensing-at-STARS near-field ISAC system. In the paper's derivation, the symmetry of the uniformly linear STAR and sensor arrays makes the angle-distance cross-terms of the Fisher information matrix vanish, leaving a diagonal FIM; the SPEB then separates into two terms governed by correlation factors between the echo covariance and the transmit steering-vector outer products. The paper claims this expression closely tracks the exact numerical SPEB, and that optimizing it produces the best sensing performance at the lowest sensor deployment cost among the tested schemes. It further claims that, under a stated condition on the beamforming correlation factors, the optimal sensor interval makes the sensor aperture exactly equal to the STAR aperture.","pith_inferences":["If the diagonal-FIM approximation survives exact numerical checks, the same closed-form machinery should extend to planar sensor layouts on STARS, where two angular coordinates plus distance would replace the single azimuth angle treated here.","The questionable trace inequality in Appendix A means the bound's advertised accuracy should be re-derived or re-proven before using it as a strict lower bound; the paper's simulations only show closeness at the tested operating points.","One testable extension is to replace the approximate SPEB in the optimization with a numerically inverted full FIM and compare the resulting sensor deployments; if deployments differ materially, the approximation is driving the design conclusions rather than the physics.","The deployment-cost trade-off formulation suggests a natural benchmark question: given a fixed hardware budget, how much sensing accuracy is lost by using the cheapest layout that still satisfies the communication rate constraint—something the paper's weighted cost function could answer parametrically."],"forward_implications":["The SPEB expression gives a direct design rule: for fixed beamforming, increasing the number of sensors or the sensor interval improves sensing accuracy, with sensor count having a larger effect than STAR element count.","When the beamforming correlation factors satisfy the condition in Proposition 2, the optimal sensor interval is achieved by matching the sensor aperture to the STAR aperture, which is a simple deployment prescription.","Because near-field wavefronts carry distance information in their phase, the sensing function can operate with narrowband signals rather than relying on wideband subcarriers for range resolution.","The proposed alternating optimization is claimed to converge to a stationary point of the weighted SPEB-plus-cost problem and to outperform random sensor deployment, reflecting-only RIS, and joint-beam-only ISAC baselines in both SPEB and cost.","The diagonal-FIM approximation implies that angle and distance estimation can be analyzed and optimized separately in this configuration."],"supporting_citations":[{"why":"Supplies the numerical SPEB benchmark (without the steering-vector approximation) against which the paper validates Proposition 1.","marker":"[26]"},{"why":"Defines the earlier STARS-ISAC framework with predefined sensor deployment that this paper extends by optimizing sensor placement.","marker":"[14]"},{"why":"Asks how many sensors a STARS-ISAC system needs, motivating the deployment-cost objective.","marker":"[27]"},{"why":"Gives the Fisher information formula for complex Gaussian observations used in the SPEB derivation.","marker":"[31]"},{"why":"Provides the trace inequality used to set the off-diagonal FIM entries to zero.","marker":"[39]"},{"why":"Provides the rank-one recovery theorem used to reconstruct the active beamformer from the SDR solution.","marker":"[36]"},{"why":"Justifies convergence of the penalty-based algorithm to a KKT point as the penalty terms vanish.","marker":"[37]"}],"fun_headline_variants":["Closed-form bound ties sensor spacing to near-field ISAC accuracy","Near-field ISAC: optimal sensor spacing in closed form","Joint sensor and beamforming design cuts cost in near-field ISAC","STARS near-field ISAC: closed-form bound optimizes sensor layout","Minimize sensing error and deployment cost in near-field ISAC"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing step is the claim that the off-diagonal entries of the Fisher information matrix vanish; the proof of that step uses a matrix trace inequality that does not generally hold, so the derived closed-form bound may be only an approximation with unknown error.","fun_headline_variants_meta":{"raw":{"variants":["Closed-form bound ties sensor spacing to near-field ISAC accuracy","Near-field ISAC: optimal sensor spacing in closed form","Joint sensor and beamforming design cuts cost in near-field ISAC","STARS near-field ISAC: closed-form bound optimizes sensor layout","Minimize sensing error and deployment cost in near-field ISAC"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000827,"raw_usage":{"total_tokens":3591,"prompt_tokens":900,"completion_tokens":2691,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":516,"completion_tokens_details":{"reasoning_tokens":2603}},"tokens_in":516,"tokens_out":2691,"duration_ms":19569,"temperature":1.0,"reasoning_tokens":2603,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T12:09:40.530470+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the exact Fisher information matrix from Eq. (16) numerically, without assuming the off-diagonal terms vanish, for a range of target angles and distances; if the normalized off-diagonal entries are not close to zero, or if inverting the full FIM gives an SPEB noticeably below the closed form of Proposition 1, the paper's core approximation is falsified.","supporting_citations":[{"cited_title":"Near-field integrated sensing and communications,","cited_arxiv_id":null,"evidence_quote":"Supplies the numerical SPEB benchmark (without the steering-vector approximation) against which the paper validates Proposition 1."},{"cited_title":"STARS enabled integrated sensing and communications,","cited_arxiv_id":null,"evidence_quote":"Defines the earlier STARS-ISAC framework with predefined sensor deployment that this paper extends by optimizing sensor placement."},{"cited_title":"STARS-ISAC: How many sensors do we need?","cited_arxiv_id":null,"evidence_quote":"Asks how many sensors a STARS-ISAC system needs, motivating the deployment-cost objective."},{"cited_title":"Trace and the sum of elements of a matrix","cited_arxiv_id":null,"evidence_quote":"Provides the trace inequality used to set the off-diagonal FIM entries to zero."},{"cited_title":"Penalty dual decomposition method for non- smooth nonconvex optimization-part I: Algorithms and convergence analysis,","cited_arxiv_id":null,"evidence_quote":"Justifies convergence of the penalty-based algorithm to a KKT point as the penalty terms vanish."}],"review_version":1}