{"id":"c2fb5bc7-a523-48c1-bdb9-61913d8e025a","arxiv_id":"2507.10173","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A matching-based algorithm for assigning waveguides and activating pinching antennas uses LoS blockages to raise sum rate over fixed-antenna baselines in simulated obstructed indoor settings.","lead":"This paper studies a system of small antennas placed along waveguides in a ceiling, where only one antenna per waveguide is switched on at a time. A matching algorithm picks which antenna to activate so each user gets a clear line-of-sight path while blockages block interfering signals to other users.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The LoS/distance proxy in Sec. III-C is asserted to imply the sum-rate preference, but it ignores NLoS path magnitudes; a switch satisfying (14) can decrease the sum rate, so Solution 2's performance claim is unsupported.","rationale":"The reader's weakest assumption is the same load-bearing point I would stress. The abstract's central claim requires both proposed solutions to improve throughput. Solution 1 is a standard matching search, but Solution 2's only theoretical justification is the Section III-C proxy, and that proxy is not a consequence of Eq. (7) because h_NLoS magnitudes are ignored. The simulation results in Figs. 3-5 show Solution 2 below Solution 1 for L=3, consistent with the proxy losing information, but those plots do not test the claimed sufficiency; a targeted counterexample or analytical counterexample would settle it. I therefore keep the reader's CONDITIONAL verdict: the paper is plausible and may be correct in an LoS-dominated regime, but the guarantee for Solution 2 is unproven and needs to be either proved under a stated condition on NLoS strength or explicitly downgraded to a heuristic. No adjustment to the reader's verdict is needed.","tokens_in":8222,"tokens_out":10457,"duration_ms":132364,"concrete_test":"Implement a one-step antenna-activation test with N=K=2 using Eqs. (1)-(7). Choose a current antenna m' on a waveguide that has no LoS to its assigned user but has a single strong NLoS path (place a scatterer close to both the user and m', with gain drawn from CN(0,1)). Choose an alternative antenna m'' on the same waveguide that is LoS to the user, slightly closer, and creates no additional LoS interference, so (14a)-(14c) hold with (14a) strict. Compute the actual sum rate under both activations for several scatterer realizations. If any realization yields a lower sum rate with m'', the claimed sufficiency of (14) is disproved.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section III-C claims that conditions (14a)-(14c), and analogously (16a)-(16c), are sufficient for the strict sum-rate preference in (11) and (10): if at least one inequality is strict and the other two are non-strict, the sum rate must increase. This is never derived from Eq. (7). In the channel model (3), h = phi h_LoS + h_NLoS, so the desired and interference powers in (7) depend on the NLoS magnitudes, not merely on LoS indicators and Euclidean distances. A switch can satisfy (14a) (new LoS to the user), (14b) (shorter distance), and (14c) (no more LoS interference links), while the current antenna enjoys a strong NLoS path via a nearby scatterer and the new antenna lacks it; the desired-signal loss can outweigh the LoS/interference-count gains, making the true sum rate decrease. The paper itself concedes in Sec. IV that Solution 2 is worse than Solution 1 when scatterers are present, but it never acknowledges that the sufficiency claim in (14) is false; this claim is the only theoretical basis for Solution 2's complexity-performance trade-off. Since Solution 2 is a core contribution, this unsupported proxy is load-bearing for the abstract's 'proposed solutions' claim.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This letter studies a downlink multi-waveguide pinching-antenna system with LoS blockages. With N=K users and waveguides, each waveguide activates one of M pre-installed pinching antennas, and the problem is to assign users to waveguides and to activate antennas so as to maximize the sum rate. The authors formulate an integer program and solve it approximately with a swap-based matching algorithm. Two preference designs are used: Solution 1 compares the true sum rates, while Solution 2 uses conditions on LoS indicators and distances to reduce computation. Simulations compare both solutions with fixed-location antennas and with a random initial state under varying transmit power, blockage radius, and number of scatterers. The paper claims that the proposed system and algorithms significantly improve throughput and that LoS blockages can be exploited for interference suppression.","tokens_in":8517,"tokens_out":5420,"duration_ms":61163,"significance":"If the claims are substantiated, the letter makes a useful practical contribution: it introduces a matching-theoretic local search for pinching-antenna activation and waveguide assignment under blockages, and the LoS/distance proxy (Solution 2) could offer a low-complexity alternative. The paper uses appropriate external baselines (fixed-location antennas and a random initial state), and it explicitly acknowledges in Section IV that Solution 2 underperforms Solution 1 when scatterers are present. However, the theoretical support for Solution 2 is currently missing, and the simulation evidence lacks error characterization. The central idea is plausible, but the manuscript needs to either prove or explicitly recharacterize the sufficiency conditions as heuristics before the complexity-performance trade-off claim is acceptable.","major_comments":[{"comment":"Section III-C, Eq. (14): The assertion that conditions (14a)-(14c), being non-strict with at least one strict inequality, imply the strict preference in (11) is not proved and is not implied by the channel model. Since h_{k,m,n} = phi_{k,m,n} h^LoS_{k,m,n} + h^NLoS_{k,m,n} in Eq. (3), the desired and interference powers in Eq. (7) depend on the NLoS magnitudes, not only on LoS indicators and distances. A switch satisfying (14a), (14b), and (14c) can lose a strong NLoS desired path and reduce the true sum rate. The paper itself states in Section IV that Solution 2 underperforms when scatterers are present, but this concession does not repair the unsupported sufficiency claim. Please either provide a rigorous derivation under explicit assumptions or label (14) as a heuristic and adjust the claims about Solution 2's performance.","section":"III-C"},{"comment":"Section III-C, Eq. (16): The same issue arises for the waveguide-swap conditions. A swap changes the desired and interference channels of both involved users and can trigger antenna re-activation on the affected waveguides; conditions (16a)-(16c) track only LoS indicators and distances, so they do not bound the true sum-rate change in Eq. (7). A swap satisfying all three conditions can decrease the sum rate when NLoS terms dominate. Consequently, the stability statement in Section III-D is only valid with respect to the proxy preference, not with respect to the sum-rate preference in Eq. (10). Please add a proof of the claimed implication or explicitly characterize the resulting matching as stable for the proxy preference only.","section":"III-C"},{"comment":"Section III-D: The convergence argument is sound in that each accepted swap strictly improves the relevant preference and the state space is finite, but the letter overstates what follows. For Solution 1, the terminal matching is a local optimum of the swap neighborhood, not a global optimum, and no optimality gap is given. For Solution 2, even the local-optimality statement is relative to the proxy preference once the issues in (14)/(16) are addressed. The sentence 'the resulting matching is, by Definition 3, always stable' should be qualified accordingly. In addition, the claimed complexity reduction to 1/(N(K+1)) of the original computational load should be derived from an explicit count of elementary operations.","section":"III-D"},{"comment":"Section IV, Figs. 3-5: The simulation curves appear to be generated from a single scatterer realization and a single random initial matching, with no error bars or averaging. Because the algorithm's outcome depends on the random initialization and the scatterer positions are random, the claim of 'significantly improving system throughput' needs either confidence intervals or averages over many independent trials, particularly for the L=3 case where Solution 2 is visibly below Solution 1.","section":"IV"}],"minor_comments":[{"comment":"Definition 1: The notation Psi: N -> K -> M is ambiguous; a standard function from N to K to M would return an element of M, whereas later lines treat Psi(k) as a pair (n,m). Please define the mapping more carefully.","section":"III-A"},{"comment":"The caption of Fig. 2 states that the proposed algorithm improves fairness, but no fairness metric is defined in the letter; either define the metric or remove the claim.","section":"IV"},{"comment":"The sentence 'This condition typically satisfied under the following scenarios' contains a grammatical error and, more importantly, the informal wording should be replaced by a precise statement of the claim, especially because the conditions are the basis of the proxy preference.","section":"III-C"},{"comment":"In Eq. (16b), the distance-change notation for the second user, such as Delta D^{n'}_{k',m'->k,m}, is used implicitly without a definition analogous to Eq. (15); please define it explicitly.","section":"III-C"},{"comment":"The equal power allocation P_t/K across waveguides is fixed in Eq. (5); this should be stated explicitly as an assumption in the problem formulation, since it restricts the optimum.","section":"II-B"}],"recommendation":"major_revision","confidential_remarks":"To the editor: This is a borderline letter. The topic is timely and the matching formulation is a reasonable fit for a letters venue, but the main theoretical claim about the LoS/distance proxy is unproven, and the simulations lack repeated-trial statistics. I recommend major revision rather than rejection because the core system concept is plausible and can be salvaged by recharacterizing Solution 2 as a heuristic and by adding averaged simulation results."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague — quick take on arXiv:2507.10173.\n\nThe paper does something genuinely useful: it extends the pinching-antenna line to multi-waveguide setups with LoS blockages and formulates the joint waveguide-assignment/antenna-activation problem. The matching-based algorithm for Solution 1 (sum-rate preference) is a reasonable local search: each swap is accepted only if it strictly raises sum rate, so it converges to a stable matching. That part is fine.\n\nThe real contribution is the second preference design, using LoS indicators and distances to avoid computing rates. The claim in Sec. III-C is that conditions (14) and (16) are sufficient for a strict sum-rate increase. That is not proven, and it is false when NLoS components are present. The channel is h = phi h_LoS + h_NLoS, and the sum rate depends on the magnitude of the whole channel. A switch can satisfy (14a–c) — new LoS path, shorter distance, fewer LoS interference links — while the old antenna had a strong NLoS path through a nearby scatterer and the new one doesn't. The desired-signal loss can outweigh the LoS gains. The paper later concedes Solution 2 underperforms with scatterers, but it never retreats from the sufficiency claim. That matters because convergence and stability of Solution 2 rely on monotone sum-rate improvement; if the proxy can accept a sum-rate-decreasing swap, the algorithm's termination is not guaranteed.\n\nSimulation methodology is thin: no error bars, no seed or placement details for scatterers and blockages beyond a figure, no comparison across random initializations. That said, the qualitative trend — pinching antennas exploiting blockages to suppress interference — is plausible and matches the intuition from the authors' earlier work.\n\nWho is this for? People working on flexible antennas and matching-based resource allocation. It is a letter, so the depth is limited, but the core question — whether cheap proxies can capture most of the gain — is worth asking, and the paper gives a starting point even if the answer is not rigorous.\n\nMy recommendation: read it if you care about pinching antennas, but treat Solution 2 as a heuristic. If you referee it, ask the authors to either prove (14) under mild conditions or reframe it as an approximate preference and bound the performance loss. A serious referee should engage with it; I would not desk-reject.","headline":"Useful incremental paper on pinching antennas with blockages; Solution 1 is solid, but Solution 2's LoS/distance proxy is sold as a theorem when it is a heuristic.","tokens_in":8996,"tokens_out":4453,"would_cite":true,"duration_ms":49054,"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":"This paper claims that selectively activating pre-installed pinching antennas can turn LoS blockages into a tool for interference suppression, and that a matching-based algorithm jointly assigning waveguides and antennas significantly…","keywords":["pinching antennas","line-of-sight blockages","waveguide assignment","antenna activation","matching theory","sum-rate maximization","interference suppression","near-field communications"],"falsifier":"Place strong scatterers so that the proxy-preferred antenna sits in a deep NLoS null for the served user while the original antenna has a strong NLoS component; if a swap satisfying conditions (14) or (16) reduces the true sum rate, the proxy's sufficiency claim fails. A direct exhaustive comparison over all matchings in a small 4-user, 4-waveguide grid would settle the issue.","tokens_in":8045,"feed_emoji":"📡","tokens_out":4404,"duration_ms":53543,"temperature":0.7,"pith_summary":"The paper studies a downlink where parallel waveguides, each carrying a set of pre-installed pinching antennas, serve an equal number of users in a room full of fixed obstacles. Its central claim is that deliberately choosing which antenna on which waveguide is active lets the system open line-of-sight paths to the desired user while leaving non-line-of-sight paths to other users, so the same blockages that hurt fixed antennas become a way to suppress interference. To make this choice, the paper formulates a sum-rate maximization problem over waveguide assignment and antenna activation, and solves it with a matching-based algorithm. The important practical message is that a low-complexity preference based only on LoS indicators and distances can approach the full sum-rate-based solution when scatterers are weak, at a fraction of the computational cost. If this holds, indoor millimeter-wave deployments could get large throughput gains from a modest amount of antenna-selection computation.","feed_headline":"Selective pinching antennas beat fixed antennas in blocked rooms","feed_subtitle":"A matching algorithm keeps LoS links for signals and NLoS paths for interference, lifting sum rate as blockages grow.","key_machinery":"The machinery is a three-sided one-to-one matching among users, waveguides, and pinching antennas, with swap-blocking pairs as the local improvement rule. A swap matching exchanges the waveguides of two users and, for each involved waveguide, re-evaluates all M antennas to decide whether to switch activation; a swap is accepted only if it strictly increases the total sum rate. The paper offers two preference designs: a sum-rate-based preference (Solution 1) and a LoS-and-distance proxy (Solution 2) that uses three inequalities, covering whether the new antenna creates a LoS link for the desired user, whether the user is closer to it, and whether the number of LoS interference links decreases, with at least one inequality strict and the others weak. The same proxy structure guides waveguide swaps, and the algorithm terminates when no swap-blocking pair survives a full cycle, which the paper equates with stability of the resulting matching.","core_discovery":"In an obstructed indoor downlink with K parallel waveguides, N = K single-antenna users, and M pre-installed pinching antennas per waveguide, the paper claims that LoS blockages are not merely obstacles but exploitable resources. By assigning each user to a unique waveguide and activating exactly one antenna per waveguide, the system can deliberately establish LoS links for desired signals while keeping NLoS links for interference, and a matching-based algorithm that repeatedly performs swap-blocking operations converges to a stable matching. The paper further claims that a simplified preference based only on LoS indicators and distances, rather than full sum-rate computation, approaches the sum-rate-based solution when scatterers are absent and still improves throughput when they are present, while reducing the number of computations to 1/[N(K+1)] of the rate-based approach. Simulation results in the paper show that both proposed solutions outperform fixed-location antennas, and the advantage grows as the blockage radius increases.","pith_inferences":["The sufficiency claim behind Solution 2 is the most delicate part: if a swap that improves the LoS-and-distance proxy ever lowers the true sum rate, one could repair the proxy by adding rough NLoS-path gain estimates to the three inequalities, keeping most of the complexity savings.","The same matching formulation transfers to other discrete-position flexible antennas, such as movable or fluid antennas with quantized positions, because it only relies on a finite set of candidate channel states.","Because the algorithm only accepts swaps that raise sum rate, it monotonically improves from any starting matching, so it could plausibly track slowly moving users by re-running over time; the paper does not test dynamic scenarios.","The result that blockages suppress interference suggests that deliberate placement of absorbing or reflective blockers could be co-designed with antenna activation, although the paper treats blockages as fixed environmental features."],"forward_implications":["Pinching-antenna systems with selective activation can outperform fixed-location antennas in obstructed environments even before any optimization, as the initial-state results show.","Larger blockage radii improve the achievable sum rate of the proposed solutions while degrading the fixed-antenna benchmark, so the benefit of pinching antennas widens as obstructions become more severe.","The LoS-and-distance proxy (Solution 2) runs at 1/[N(K+1)] the computations of the sum-rate-based preference and approaches its performance when scatterers are absent, offering a practical complexity-performance trade-off.","With many scatterers, Solution 2 still beats fixed antennas and the unoptimized initial state, but its gap to Solution 1 grows because the proxy ignores NLoS link quality.","The matching-based algorithm converges to a stable matching where no user and waveguide pair has an incentive to swap, providing a principled stopping point for the joint assignment and activation problem."],"supporting_citations":[{"why":"Establishes that LoS blockages can be a blessing rather than a curse for pinching antennas, directly motivating the interference-suppression mechanism proposed in this paper.","marker":"[4]"},{"why":"Introduces pinching antennas as flexible-antenna elements whose positions are selected along a waveguide, providing the physical basis for the system model.","marker":"[3]"},{"why":"Provides the multi-waveguide pinching-antenna model with pre-installed antennas, waveguide assignment, and antenna activation that this work extends to LoS blockages.","marker":"[9]"},{"why":"Supplies the near-field spherical-wave and NLoS scattered-path channel model used for the LoS and NLoS channel expressions.","marker":"[10]"},{"why":"Gives the existence theory for stable matchings in three-sided systems, underpinning the swap-blocking and core solution concept used in Algorithm 1.","marker":"[12]"}],"fun_headline_variants":["Pinching antennas turn LoS blockages into throughput wins","Blockages become allies: pinching antennas exploit LoS for higher sum rate","Pinching antennas use blockages to build LoS for signals, NLoS for interference","Matching algorithm lets pinching antennas turn blockages into sum-rate gains","Selective pinching antennas turn obstacles into interference shields"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that a switch to an antenna that is closer, with more LoS links for the desired user and fewer LoS links to others, always raises the total rate; the paper asserts this without proof and it ignores the strength of scattered NLoS paths.","fun_headline_variants_meta":{"raw":{"variants":["Pinching antennas turn LoS blockages into throughput wins","Blockages become allies: pinching antennas exploit LoS for higher sum rate","Pinching antennas use blockages to build LoS for signals, NLoS for interference","Matching algorithm lets pinching antennas turn blockages into sum-rate gains","Selective pinching antennas turn obstacles into interference shields"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000683,"raw_usage":{"total_tokens":3060,"prompt_tokens":865,"completion_tokens":2195,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":481,"completion_tokens_details":{"reasoning_tokens":2102}},"tokens_in":481,"tokens_out":2195,"duration_ms":17150,"temperature":1.0,"reasoning_tokens":2102,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T17:37:38.224764+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Place strong scatterers so that the proxy-preferred antenna sits in a deep NLoS null for the served user while the original antenna has a strong NLoS component; if a swap satisfying conditions (14) or (16) reduces the true sum rate, the proxy's sufficiency claim fails. A direct exhaustive comparison over all matchings in a small 4-user, 4-waveguide grid would settle the issue.","supporting_citations":[{"cited_title":"Flexible-ante nna systems: A pinching-antenna perspective,","cited_arxiv_id":null,"evidence_quote":"Introduces pinching antennas as flexible-antenna elements whose positions are selected along a waveguide, providing the physical basis for the system model."},{"cited_title":"N ear-field communications: A tutorial review,","cited_arxiv_id":null,"evidence_quote":"Supplies the near-field spherical-wave and NLoS scattered-path channel model used for the LoS and NLoS channel expressions."},{"cited_title":"Existence of stable matchings in some th ree-sided systems,","cited_arxiv_id":null,"evidence_quote":"Gives the existence theory for stable matchings in three-sided systems, underpinning the swap-blocking and core solution concept used in Algorithm 1."}],"review_version":1}