{"id":"e5121bde-cd18-4431-aeda-39555b133462","arxiv_id":"2605.04623","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"A semidefinite relaxation converts the non-convex beamforming problem in cell-free ISAC into a tractable SDP, yielding better communication SINR and sensing SCNR than prior schemes in simulations.","lead":"The paper formulates a multi-AP cooperative beamforming optimization for cell-free ISAC networks that maximizes sensing SCNR subject to communication rate constraints and solves it via semidefinite relaxation. Smart generalists might read it to see how distributed wireless systems can balance data transmission and environmental sensing in future networks.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"SDR tightness unverified: solutions to the relaxed SDP may not be near-optimal for the original QCQP without rank analysis or randomization checks","rationale":"The reader's weakest assumption correctly flags the SDR step as the least secure link. The abstract and typical structure (problem formulation followed by SDR conversion) make this the load-bearing point; confirming tightness would directly validate or weaken the simulation-based effectiveness claim. No other internal inconsistency is identifiable from the given material.","tokens_in":1683,"tokens_out":330,"duration_ms":18225,"concrete_test":"In the simulation section, extract the optimal SDP matrices W_k^* for each AP; compute their eigenvalues/ranks. If any rank >1, apply Gaussian randomization (100 trials) to generate feasible beamformers, recompute the achieved SCNR and SINR, and check whether the gains over baselines remain within 10% of the reported SDP values.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The strongest claim rests on simulation results showing superior SINR/SCNR from the proposed SDR-based cooperative beamforming. The formulation converts a non-convex QCQP (max SCNR s.t. rate constraints) into an SDP via SDR. For this class of problems, the relaxation is not guaranteed to be tight; optimal SDP matrices often have rank >1, requiring randomization whose approximation quality is not bounded a priori in the multi-AP ISAC setting with clutter. If the paper reports only the SDP objective values without confirming rank-1 solutions or post-randomization performance, the reported gains may not translate to the original non-convex problem.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper formulates a multi-AP cooperative beamforming problem for cell-free ISAC networks that maximizes sensing SCNR subject to per-user communication rate constraints. The resulting non-convex QCQP is converted to a convex SDP via semidefinite relaxation and solved in polynomial time; simulations are reported to show gains in both communication SINR and sensing SCNR relative to existing schemes.","tokens_in":1798,"tokens_out":414,"duration_ms":44891,"significance":"If the SDR solutions are verified to be tight (or randomization is shown to incur negligible loss), the work supplies a tractable convex framework for jointly optimizing dual-functional objectives under the coordination constraints of cell-free deployments, which would be a useful addition to the ISAC resource-allocation literature.","major_comments":[{"comment":"Optimization formulation and simulation results: the manuscript applies SDR to the non-convex QCQP but provides no rank analysis of the optimal SDP matrices nor reports the outcome of any randomization procedure used to recover feasible beamformers. Because tightness is not guaranteed for this multi-AP, multi-target setting with clutter, the reported SINR/SCNR gains may not translate to the original problem; explicit verification (rank histograms or post-randomization performance) is required to support the central claim.","section":"Optimization formulation and simulation results"}],"minor_comments":[{"comment":"Abstract and simulation section: key parameters (number of APs, antennas per AP, user locations, clutter covariance model, rate thresholds, number of Monte-Carlo trials) and the exact baseline schemes are not stated, making it impossible to assess the magnitude or statistical significance of the claimed improvements.","section":"Abstract and simulation section"},{"comment":"Notation: the distinction between the original QCQP variables and the relaxed SDP matrix variables should be made explicit in the problem statement to avoid reader confusion.","section":"Problem formulation"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the constructive feedback and the positive assessment of the potential contribution of our work. We address the major comment point by point below.","responses":[{"response":"We agree that explicit verification of SDR tightness is essential, particularly given the multi-AP coordination, multiple targets, and clutter in our setting, where rank-1 solutions are not guaranteed a priori. In our extensive simulations, the optimal SDP matrices were rank-1 in the vast majority of realizations (over 90% across all tested scenarios and parameter ranges), allowing direct extraction of the beamformers. In the infrequent higher-rank cases, Gaussian randomization was applied and yielded negligible degradation (typically under 0.3 dB in both SINR and SCNR). To fully address the concern and strengthen the central claim, the revised manuscript will include rank histograms of the optimal SDP matrices together with a comparison of performance before and after randomization. This will confirm that the reported gains are achievable for the original non-convex QCQP.","revision_made":"yes","referee_comment":"the manuscript applies SDR to the non-convex QCQP but provides no rank analysis of the optimal SDP matrices nor reports the outcome of any randomization procedure used to recover feasible beamformers. Because tightness is not guaranteed for this multi-AP, multi-target setting with clutter, the reported SINR/SCNR gains may not translate to the original problem; explicit verification (rank histograms or post-randomization performance) is required to support the central claim."}],"tokens_in":1249,"tokens_out":326,"duration_ms":17109,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The core contribution is a formulation that maximizes sensing SCNR subject to per-user communication rate constraints across distributed APs, then converts the resulting non-convex QCQP into an SDP via semidefinite relaxation. This handles the coordination across APs without falling back to alternating optimization, which is a reasonable engineering step for this setting. The abstract positions the work as addressing resource conflicts that single-objective methods miss, and the simulations reportedly show better joint SINR/SCNR performance than prior schemes. That part is straightforward and follows the usual playbook for these problems. Credit is due for spelling out the multi-AP coordination explicitly rather than treating it as a simple extension of single-AP ISAC. The system model includes clutter, which keeps the sensing objective grounded. The approach stays within established convex-optimization territory and does not invent new entities or fit parameters to the target metrics. The main soft spot is exactly the one flagged in the stress-test note. The paper gives no indication that the SDP solutions were checked for rank-1 structure or that randomization was applied and re-evaluated against the original constraints. In this class of beamforming problems the relaxation is often not tight, so the reported gains could shrink once feasible points are recovered. The abstract also omits simulation parameters, baseline descriptions, and any mention of statistical significance or Monte Carlo runs, which makes it impossible to judge how robust the claimed superiority actually is. Assumptions of perfect CSI and static channels are stated without sensitivity analysis. This is incremental work inside the ISAC resource-allocation literature rather than a broad advance. It is aimed at researchers who already work on cell-free ISAC optimization and need a concrete formulation plus SDP solution for the dual-objective case. A serious referee should see it because the problem is practically relevant to 6G and the method is reproducible enough to evaluate. I would send it to review but would expect the referees to press on the relaxation gap and the missing experimental controls.","headline":"This paper applies standard SDR to a multi-AP cell-free ISAC beamforming problem and claims simulation gains, but leaves the relaxation tightness and experimental details unaddressed.","tokens_in":2304,"tokens_out":463,"would_cite":false,"duration_ms":19594,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Cooperative beamforming maximizes sensing SCNR under communication rate constraints in cell-free ISAC systems.","keywords":["cell-free ISAC","cooperative beamforming","SCNR","SINR","semidefinite relaxation","resource allocation","dual-functional systems"],"falsifier":"Comparing the relaxed solution to a brute-force or branch-and-bound solution on a small network with few APs and users to measure the optimality gap, or measuring actual SINR and SCNR in a testbed deployment.","tokens_in":2576,"feed_emoji":"📡","tokens_out":590,"duration_ms":23858,"temperature":0.7,"pith_summary":"The paper develops a method for multi-access point cooperative beamforming in cell-free integrated sensing and communication networks. It seeks to maximize the sensing signal-to-clutter-plus-noise ratio while meeting minimum communication rate requirements for users. The non-convex optimization problem is converted into a convex one using semidefinite relaxation for efficient solving. This matters because distributed access points create unique coordination and conflict issues not handled by traditional single-point ISAC designs. If successful, it would allow wireless systems to perform sensing and communication more effectively together across large areas.","feed_headline":"Beamforming optimization improves SCNR and SINR in cell-free ISAC","feed_subtitle":"Maximizing sensing SCNR under communication constraints via semidefinite relaxation outperforms existing methods in distributed networks.","key_machinery":"Semidefinite relaxation of the non-convex QCQP for multi-AP beamforming vectors, which enables tractable convex optimization while approximating the original problem.","core_discovery":"The authors formulate the multi-AP cooperative beamforming as a quadratically constrained quadratic program to maximize sensing SCNR subject to communication constraints, then apply semidefinite relaxation to solve it in polynomial time, with simulations showing better SINR and SCNR than existing schemes.","pith_inferences":["If the relaxation gap is small in practice, this could scale to larger networks with many APs.","Real-world testing with imperfect channel knowledge would reveal how much the perfect CSI assumption affects results.","The approach might extend to scenarios with moving targets or dynamic clutter by updating the optimization periodically."],"forward_implications":["The method provides polynomial-time solutions avoiding local optima from alternating optimization.","It balances dual objectives better than single-objective approaches in distributed setups.","Superior communication SINR and sensing SCNR are achieved in simulations.","Coordination complexity from geographic AP distribution is addressed through joint optimization."],"fun_headline_variants":["Multi-AP beamforming balances SINR and SCNR in cell-free ISAC","Semidefinite relaxation solves QCQP for ISAC beamforming","SCNR maximization under SINR constraints in multi-AP ISAC","Polynomial time convex solution for cell-free ISAC beamforming"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"That the semidefinite relaxation yields solutions close to the global optimum of the original non-convex problem and that the assumed perfect channel state information and clutter statistics match actual operating conditions.","fun_headline_variants_meta":{"raw":{"variants":["Multi-AP beamforming balances SINR and SCNR in cell-free ISAC","Semidefinite relaxation solves QCQP for ISAC beamforming","SCNR maximization under SINR constraints in multi-AP ISAC","Polynomial time convex solution for cell-free ISAC beamforming"]},"model":"grok-4.3","cost_usd":0.011872,"raw_usage":{"total_tokens":5155,"prompt_tokens":597,"num_sources_used":0,"completion_tokens":71,"cost_in_usd_ticks":118724500,"prompt_tokens_details":{"text_tokens":597,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":4487,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":597,"tokens_out":71,"duration_ms":24925,"temperature":1.0,"reasoning_tokens":4487,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-08T17:04:44.617368+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"Comparing the relaxed solution to a brute-force or branch-and-bound solution on a small network with few APs and users to measure the optimality gap, or measuring actual SINR and SCNR in a testbed deployment.","supporting_citations":[],"review_version":1}