{"id":"67108ffb-4047-45eb-9cb8-f3c875fc219f","arxiv_id":"2501.00472","paper_version":2,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Under transmit beamforming, the CRB-minimizing receive array is unique (clustered at aperture edges), while the transmit array can be chosen freely, enabling a jointly optimal sparse geometry with a contiguous nonredundant sum co-array.","lead":"This paper finds the receive array geometry that best minimizes the Cramér-Rao bound for estimating one target's angle in an active MIMO sensing system, given an optimal transmit waveform. It then shows that the transmit array can vary freely while keeping the same bound, and uses that freedom to build a sparse array with a contiguous nonredundant sum co-array.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1's uniqueness is stated too strongly: because the CRB depends only on the receive array's translation-invariant spatial variance, every translate of the clustered array is also a solution of (9), so the receive array is unique only up to translation.","rationale":"The paper's main derivation is otherwise clean: given the beamforming-optimal waveform (5) and the condition chi_r>chi_t, the CRB reduces to (6), so minimizing the CRB is equivalent to maximizing the receive spatial variance. Lemma 1 is the key combinatorial step, and although its proof is omitted, the statement is true and can be verified by a standard exchange argument: move the innermost sensor toward the nearer endpoint; the variance strictly increases unless the array already has N/2 sensors at each end. The more serious formal gap is that Lemma 1 solves a fixed-window problem while (9) is an aperture-length problem; because chi is translation-invariant, all translates are optimal. This makes the theorem's 'unique' claim literally false. The authors can repair this by stating 'unique up to translation' and by correcting the arg min/arg max typo in (7). The Corollary's co-array contiguity proof checks out. The numerical study is illustrative. Overall the reader's CONDITIONAL verdict is appropriate; no change to the verdict is needed, but the revision should address the qualifier and the lemma statement.","tokens_in":8606,"tokens_out":33025,"duration_ms":334836,"concrete_test":"Run the following minimal check: set Nt=1, Nr=2, L=3 in problem (9). The Tx has one sensor so chi_t=0 and the constraint chi_r>chi_t holds for any nontrivial Dr. Compute the CRB from (6) for Dr={0,3} and for Dr={1,4}. Both have |Dr|=2, aperture exactly 3, and chi_r=2.25, hence identical CRB; the second array is not equal to K_3^2={0,3}. This directly contradicts the literal uniqueness statement of Theorem 1. A broader check is to enumerate all Nr-element integer subsets with max-min<=L for small L,Nr and verify that the maximizers of chi are precisely the translates of K_L^Nr; this also confirms that Lemma 1 is correct after changing 'arg min' to 'arg max'.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Problem (9) constrains the receive aperture by max Dr - min Dr <= L, not by fixing Dr within {0,...,L}. Lemma 1, however, maximizes chi(Dr) over the fixed window U_{L+1}. The spatial variance chi in (3) is invariant under translation of the whole array. Hence for any integer a, Dr(a) = {a,...,a+Nr/2-1} union {a+L-Nr/2+1,...,a+L} satisfies |Dr|=Nr, aperture <= L, and chi(Dr(a)) = chi(K_L^Nr). In fact every translate attains the same value in (8) and therefore the same CRB in (6). Thus Theorem 1's statement that the solutions are precisely D_r* = K_L^Nr is literally false: the solution set is a one-parameter family of translates. The proof silently normalizes the aperture window to [0,L] without stating the w.l.o.g. translation. A related formal defect is that Lemma 1 writes K_L^N as 'arg min chi' while the surrounding text and Theorem 1 require 'arg max chi'; this sign error should be corrected. These issues do not overturn the geometric conclusion that sensors should be clustered at the two ends of the aperture, but they do require a precise 'unique up to translation' formulation and a corrected Lemma 1.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies joint transmit/receive array geometry and transmit waveform design for a single-target active sensing system, with the goal of minimizing the Cramér-Rao lower bound (CRB) of the target angle. Using prior optimal waveform results, the authors show that for a class of optimal waveforms corresponding to transmit beamforming, the CRB depends only on the receive array's spatial variance. Under a constraint on receive aperture and an even number of receive sensors, they claim that the unique CRB-optimal receive geometry is a clustered array with sensors placed at the two ends of the aperture, while the transmit array can be chosen freely subject to a spatial-variance inequality. They then propose a specific sparse transmit array that yields a contiguous and nonredundant sum co-array, and illustrate the results with numerical MLE comparisons.","tokens_in":8863,"tokens_out":3936,"duration_ms":39359,"significance":"If the central claims hold, the paper provides a clean characterization of CRB-optimal receive array geometry in active sensing and introduces a sparse array configuration with attractive identifiability properties. The derivation builds on externally established CRB formulas (Stoica-Nehorai, Forsythe-Bliss, Li et al.) and the variance computations in Eqs. (8) and (12) are straightforward and correct. The equal-sums-of-squares perspective linking equal CRBs to Diophantine solutions is a nice insight. However, the uniqueness statement in Theorem 1 is too strong as written because it ignores translation invariance, and the key Lemma 1 is asserted without proof or citation. These are load-bearing issues, but they are fixable by reformulating the theorem and providing a proof of Lemma 1, so the paper's geometric insight is likely salvageable.","major_comments":[{"comment":"The statement that the solutions to (9) are precisely D_r* = K_L^{Nr} is not correct as written. The constraint in (9) is max D_r - min D_r <= L, not fixing the array to lie in {0,...,L}, and the CRB in Eq. (6) depends on the spatial variance chi(D_r), which is invariant under translation of D_r. Hence, for any integer a, the array D_r(a) = {a,...,a+Nr/2-1} union {a+L-Nr/2+1,...,a+L} has the same aperture and the same spatial variance as K_L^{Nr}, so it also achieves the same CRB and satisfies all constraints. The proof silently normalizes the aperture window to [0,L] without stating this w.l.o.g. step. The theorem should be reformulated as 'unique up to translation', or the optimization problem should be stated over translation equivalence classes.","section":"Section 3.2, Theorem 1 (Eq. (10))"},{"comment":"Lemma 1 is the sole basis for the optimality and claimed uniqueness of the clustered receive array in Theorem 1, but the proof is omitted ('follows directly via negation') and no citation is provided. This is a nontrivial combinatorial extremal claim and cannot be accepted without proof. In addition, Eq. (7) writes K_L^N as the arg min of chi(D), while the surrounding text and Theorem 1 require arg max; this sign error must be corrected. The authors should supply a complete proof (e.g., an exchange argument or an explicit derivation) or replace the lemma with a referenced result.","section":"Section 3.2, Lemma 1 (Eq. (7))"}],"minor_comments":[{"comment":"The sentence 'can be show to reduce' should read 'can be shown to reduce'.","section":"Section 2.2"},{"comment":"The word 'nonredudant' should be 'nonredundant'.","section":"Figure 1 caption"},{"comment":"The example '12+82 = 42+72' would be clearer if typeset as 1^2 + 8^2 = 4^2 + 7^2; the current plain-text representation is ambiguous.","section":"Section 3.1"},{"comment":"The notation 'Let L = U_{L+1}' is confusing because the letter L is used both for the aperture constraint and for the set. Consider denoting the set by U_{L+1} directly.","section":"Section 3.2, Lemma 1 setup"}],"recommendation":"major_revision","confidential_remarks":"The paper appears to be a conference-length contribution, and the main technical idea is sound in spirit. The major issues (translation invariance in Theorem 1 and the unproved Lemma 1) are addressable within the manuscript's scope and do not require new experiments or a change of approach. I see no concern about novelty or fit with a signal processing venue, provided the authors tighten the statements and give a proof of Lemma 1."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Punchline: the core result is right—under an aperture constraint, the CRB-optimal receive array is the clustered array—but the uniqueness claim is stated too strongly because spatial variance is translation-invariant.\n\nWhat is actually new: the paper shows that array geometries with equal sums of squares achieve equal CRBs under the optimal waveform, which connects array design to number theory. The bigger contribution is Corollary 1: a Tx array that, together with the optimal clustered Rx array, gives a contiguous nonredundant sum co-array while still minimizing the single-target CRB. That specific construction is new and practically useful. The derivation from the known optimal waveform (Forsythe-Bliss, Li et al.) to the CRB depending only on receive spatial variance is clean and transparent. The appendix proof of the co-array property checks out.\n\nSoft spots, in proportion: the load-bearing Lemma 1 is stated without proof ('follows directly via negation'). For a uniqueness claim, that is a real gap; a citation or a short proof is needed. More importantly, the stress-test is correct: problem (9) constrains only aperture, and chi is invariant under translation, so every translate of K_L^Nr is also a solution. Theorem 1's statement that the solutions are precisely D_r* = K_L^Nr is literally false; the proof silently normalizes the array window to [0,L]. This is fixable by saying 'unique up to translation,' but it is a genuine formal error. Also, Lemma 1 writes 'arg min' where the text says maximizing; that sign error should be corrected. Feasibility is only characterized by a sufficient condition, but the authors acknowledge that, so it is a minor limitation.\n\nNone of this overturns the main message: put receive sensors at the two ends of the aperture. The paper is a solid theoretical contribution to MIMO radar and ISAC array design. I'd send it to a serious referee; with the translation caveat and a proof of Lemma 1, it should be publishable. The numerical study is illustrative rather than exhaustive, which is appropriate here.","headline":"Aperture-optimal receive array is clustered, but the uniqueness claim needs 'up to translation' and Lemma 1 needs a proof.","tokens_in":9404,"tokens_out":3369,"would_cite":true,"duration_ms":32014,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["94A12"],"pacs":[],"model":"deepseek-v4-flash","headline":"Under aperture and sensor-number constraints, the receive array that minimizes the single-target angle Cramér–Rao bound is uniquely the two-ended clustered array, while the transmit array and waveform keep their freedom.","keywords":["active sensing","Cramer-Rao bound","MIMO radar","array geometry design","sparse arrays","waveform design","sum co-array","spatial variance"],"falsifier":"Enumerate all subsets of $\\{0,\\dots,L\\}$ of size $N$ for even $N$ and small $L$ (say $N=4$, $L=8$) and compute the spatial variance of each; if any subset beats $K_L^N$, Lemma 1 and hence Theorem 1 are false.","tokens_in":8378,"feed_emoji":"📡","tokens_out":8703,"duration_ms":80460,"temperature":0.7,"pith_summary":"Under the single-target active sensing model, this paper tries to pin down which transmit/receive array geometries and which transmit waveforms together minimize the Cramér–Rao lower bound for angle estimation. It claims that, given a fixed receive aperture and sensor count, the optimal receive array is unique: the clustered array $K_L^{N_r}=U_{N_r/2}\\cup (L-U_{N_r/2})$, which packs sensors at the two edges of the aperture to maximize spatial variance $\\chi_r$. The transmit array, by contrast, can be any geometry whose spatial variance stays below $\\chi_r$, and the optimal waveform is coherent beamsteering toward the target. The paper then chooses a particular transmit array that keeps this optimality and makes the sum co-array contiguous and nonredundant, which matters for identifying multiple targets when independent waveforms are used. A sympathetic reader would care because this turns the CRB minimization into a concrete aperture-limited design rule: put receive sensors at the edges, and use the remaining transmit freedom to repair the co-array.","feed_headline":"Clustered receive array uniquely minimizes angle-estimation bound","feed_subtitle":"Under aperture and sensor limits, the optimal receiver hugs the edges, while the transmitter keeps design freedom.","key_machinery":"The load-bearing object is the clustered array $K_L^N=U_{N/2}\\cup(L-U_{N/2})$, together with the spatial variance $\\chi(D)$ defined in (3). Lemma 1 asserts that, for even $N$, this two-ended cluster maximizes $\\chi$ among all $N$-element subsets of the aperture $\\{0,\\dots,L\\}$; the paper states that the proof follows directly by negation and omits it. Around that lemma the argument wraps two further mechanisms: the optimal-waveform reduction (from [12] and [13]) that collapses the CRB to $\\sigma^2/(2|\\gamma|^2N_tN_r\\chi_r)$, and the sum co-array construction in Corollary 1 that rescales the transmit array by $N_r/2$ to tile $U_{N_tN_r}$ without redundancy.","core_discovery":"On the paper's own terms, the central discovery is Theorem 1: for even $N_r$, every solution of the joint optimization problem (9) has the form $S^\\star=u a_t^H(\\omega)/\\sqrt{N_t}$, $D_r^\\star=K_L^{N_r}$, and an arbitrary transmit array with $|D_t|=N_t$ and $\\chi(D_t)<\\chi(D_r^\\star)$. The CRB reduces, after substituting the optimal waveform, to $\\sigma^2/(2|\\gamma|^2 N_t N_r \\chi_r)$, so the receive geometry enters only through its spatial variance; maximizing that variance under the aperture constraint yields the two-ended clustered array. Corollary 1 then fixes $L=(N_t+1)N_r/2-1$ and chooses $D_t^\\star=(N_r/2)U_{N_t}$, which satisfies the variance condition and produces the contiguous, nonredundant sum co-array $D_\\Sigma=U_{N_tN_r}$. A parallel observation is that receive arrays with equal sums of squares of their centered positions give equal CRBs, so the CRB does not uniquely separate all geometries.","pith_inferences":["The variance-maximizing lemma is stated only for even $N_r$; an analogous one-sided cluster likely covers odd $N_r$, which would make the uniqueness statement in Theorem 1 hold for all sensor counts.","Because the optimal waveform (5) needs the true target angle, a practical realization would first estimate the angle and then reconfigure; the paper notes this but does not analyze the two-stage or iterative version.","The equal-sum-of-squares degeneracy offers a controlled experimental handle: pick two arrays with identical CRB but different beampatterns and probe where maximum-likelihood estimation breaks down, isolating geometry effects beyond the bound.","For automotive radar, the result suggests placing receive elements near the array ends rather than in a uniform line; whether this survives near-field, multipath, and mounting constraints is an open engineering question."],"forward_implications":["Any system that wants the lowest single-target angle CRB at a given aperture and receive sensor count must use the clustered receive array; no other receive geometry can match it.","The transmit array is not pinned down by the CRB, so designers can choose it to satisfy other criteria, such as co-array contiguity, without sacrificing the bound.","With the specific choice $D_t^\\star=(N_r/2)U_{N_t}$ and $L=(N_t+1)N_r/2-1$, the sum co-array is the full contiguous ULA $U_{N_tN_r}$, allowing up to $N_tN_r/2$ targets to be identified when full-rank waveforms are transmitted.","Orthogonal transmit waveforms are not generally optimal for single-target CRB; coherent beamsteering is, as long as the receiver's spatial variance exceeds the transmitter's.","Distinct receive geometries with equal spatial variance (constructed from equal sums of squares) achieve identical CRBs but can differ substantially in threshold-region estimation behavior."],"supporting_citations":[{"why":"Supplies the optimal waveform family (5) and the CRB simplification (6) that the joint optimization inherits.","marker":"[12]"},{"why":"Extends the optimal waveform characterization and the condition $\\chi_r > \\chi_t$; cited for the claim that orthogonal waveforms are not generally CRB-optimal.","marker":"[13]"},{"why":"Gives the monostatic MIMO measurement model (1) and the sum co-array identifiability setup used later.","marker":"[20]"},{"why":"Supplies the parameter-identifiability condition based on the sum co-array that Corollary 1 exploits.","marker":"[21]"},{"why":"Provides the Cramér–Rao bound formula for the single-target model with nuisance parameters.","marker":"[22]"},{"why":"States the sufficient condition (contiguous sum co-array plus full-column-rank waveform) for identifying $K$ targets.","marker":"[23]"}],"fun_headline_variants":["Cluster receive array, free transmit array: CRB minimum","Equal sums of squares give equal CRBs in active sensing","Jointly optimal array and waveform: receiver clusters, transmitter free","Optimal receive array hugs edges; transmit array keeps freedom","Novel sparse array: CRB-optimal and nonredundant co-array"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument stands on the unproved combinatorial lemma that, for an even number of sensors in a fixed aperture, pushing the sensors to the two ends maximizes their spread; if any other placement had a larger spread, the claimed uniqueness of the optimal receive array would collapse.","fun_headline_variants_meta":{"raw":{"variants":["Cluster receive array, free transmit array: CRB minimum","Equal sums of squares give equal CRBs in active sensing","Jointly optimal array and waveform: receiver clusters, transmitter free","Optimal receive array hugs edges; transmit array keeps freedom","Novel sparse array: CRB-optimal and nonredundant co-array"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000752,"raw_usage":{"total_tokens":3344,"prompt_tokens":942,"completion_tokens":2402,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":558,"completion_tokens_details":{"reasoning_tokens":2313}},"tokens_in":558,"tokens_out":2402,"duration_ms":16538,"temperature":1.0,"reasoning_tokens":2313,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T22:50:22.057582+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate all subsets of $\\{0,\\dots,L\\}$ of size $N$ for even $N$ and small $L$ (say $N=4$, $L=8$) and compute the spatial variance of each; if any subset beats $K_L^N$, Lemma 1 and hence Theorem 1 are false.","supporting_citations":[{"cited_title":"A note on most fa- vorable array geometries for DOA estimation and array interpolation,","cited_arxiv_id":null,"evidence_quote":"Supplies the optimal waveform family (5) and the CRB simplification (6) that the joint optimization inherits."},{"cited_title":"Range compression and waveform optimization for MIMO radar: A Cram´ er–Rao bound based study,","cited_arxiv_id":null,"evidence_quote":"Extends the optimal waveform characterization and the condition $\\chi_r > \\chi_t$; cited for the claim that orthogonal waveforms are not generally CRB-optimal."},{"cited_title":"Waveform correlation and optimization issues for MIMO radar,","cited_arxiv_id":null,"evidence_quote":"Gives the monostatic MIMO measurement model (1) and the sum co-array identifiability setup used later."},{"cited_title":"Radar waveform opti- mization for target parameter estimation in cooperative radar-communications systems,","cited_arxiv_id":null,"evidence_quote":"Supplies the parameter-identifiability condition based on the sum co-array that Corollary 1 exploits."},{"cited_title":"Op- timal and robust waveform design for MIMO-OFDM channel sensing: A Cram´ er-Rao bound perspective,","cited_arxiv_id":null,"evidence_quote":"Provides the Cramér–Rao bound formula for the single-target model with nuisance parameters."},{"cited_title":"Transmit waveform design based on the Cram´ er-Rao lower bound,","cited_arxiv_id":null,"evidence_quote":"States the sufficient condition (contiguous sum co-array plus full-column-rank waveform) for identifying $K$ targets."}],"review_version":1}