{"id":"d1ef26a6-e58f-45cb-b84f-722eb8b073cc","arxiv_id":"2507.12582","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"A robust resource allocation with outage constraints for pinching-antenna downlinks under user-location uncertainty, solved by geometric area analysis and PSO.","lead":"This paper designs a power-saving scheme for pinching-antenna systems when the base station only knows user positions approximately. It places the antenna and allocates power so that each user's outage probability stays below a threshold, and shows the method nearly matches an exhaustive search.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The bisection-based power calculation is derived only for intersecting circles (c ≥ b and c ≥ |b-r|); the paper asserts but never proves that its operating regime satisfies this, and for ε_o=0.5, b=0.1r the solution falls in the non-intersecting branch where Eq. (11) is undefined.","rationale":"The paper's central single-user result is Eq. (11) and the bisection to solve S4=ε_o π r^2. Eq. (11) is a two-circle lens formula, valid only when the circles intersect with |b-r| ≤ c ≤ b+r. The text only argues that small ε means the user center is inside the antenna circle (c ≥ b), which is necessary but not sufficient: for b<r/2 the circles can still be disjoint with the antenna circle inside the user disk while c>b. I verified a concrete bad case (ε_o=0.5, b=0.1r) where the root c=√0.5 r < r-b, so the arccos arguments in (5) and (9) leave [-1,1]. This does not overturn the default simulations (ε_o=0.01, r=3), where the root lies in the valid intersecting regime; hence the verdict remains CONDITIONAL. The reader's weakest assumption is the same gap, though the paper's condition should be strengthened from c≥b to c≥max(b,r-b), so I mark partial agreement.","tokens_in":7385,"tokens_out":25744,"duration_ms":280627,"concrete_test":"Run the published bisection on a single-user instance with r=1, b=0.1, ε_o=0.5. At the true solution c=√0.5, the circles do not intersect (c < r-b=0.9); evaluating Eq. (11) requires arccos(2.55) and arccos(-3.46), so the algorithm fails before finding the root. Repeat with ε_o=0.01 and b=0.1: c≈0.995>0.9, so Eq. (11) is valid, confirming the default regime. If the authors intend to claim ε_o≤0.5, they should instead state the largest ε_o for which the root is guaranteed to satisfy c≥max(b, r-b) for every b∈(0,r).","verdict_should_be":"UNCHANGED","load_bearing_attack":"The single-user power computation reduces the outage condition to S4(c)=ε_o π r^2 using the two-circle segment formula (11). That formula presupposes that the antenna-projection circle (radius c=sqrt(R^2-d^2)) and the user uncertainty circle (radius r, centers separated by b) intersect, with c between b and b+r; in particular it requires c ≥ |b-r| so that the arccos arguments in (5) and (9) lie in [-1,1]. The paper only states that a small ε_o makes the user-circle center lie inside the antenna circle (c ≥ b) and then takes [b,b+r] as the bisection interval. It never proves or even states the stricter intersection condition c ≥ r-b for b<r/2. The gap is real: take r=1, b=0.1, ε_o=0.5. The antenna circle is entirely contained in the user circle for all c ≤ 0.9, so the outage area is π(r^2-c^2); the root is c=√0.5≈0.707, which is below r-b=0.9. At this root the arccos arguments of (5) and (9) are -3.46 and 2.55, so the published S4 expression and bisection cannot be evaluated. Thus the algorithm as written is not a valid general solution of (4) unless the paper characterizes and enforces the intersecting-circles regime. The default simulations (ε_o=0.01, r=3) appear to lie in the valid regime, so this is a correctness/robustness gap rather than a refutation of the numerical claims; the discussion in Sec. IV that mentions ε_o≤0.5 is not supported by the derivation.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies a downlink pinching-antenna system in which each user's location is known only up to a circular uncertainty region with a uniform distribution. The goal is to minimize total transmit power subject to per-user outage-probability constraints. For a single user, the authors propose fixing the antenna's x-coordinate to the user's estimated coordinate (or the waveguide boundary), then computing the minimum transmit power by solving a geometric outage-area equation S4(c)=epsilon_o*pi*r^2 via bisection. For multiple users, the power allocation for a fixed antenna position is decomposed into K independent single-user problems, and the common antenna position is optimized with particle swarm optimization. Simulations compare the proposed scheme against a fixed-antenna baseline and an exhaustive one-dimensional search, reporting near-optimal performance of the PSO-based placement.","tokens_in":7831,"tokens_out":5115,"duration_ms":58978,"significance":"If the technical gaps identified below are closed, the paper would provide a useful and elegant treatment of robust resource allocation for pinching-antenna systems under location uncertainty. The geometric reduction of the outage constraint to a two-circle area calculation is a clean idea, and the use of an independent exhaustive-search benchmark gives a credible check on the PSO heuristic. The numerical results suggest substantial power savings from antenna repositioning, which is the main practical message. The manuscript currently lacks a formal characterization of the regime in which the central geometric formulas apply, and the bisection update is described with a sign error; these issues are local and fixable, but they must be addressed before the claims can be accepted as stated.","major_comments":[{"comment":"The sector and triangle formulas used to define S4 presuppose that the two circles intersect, i.e., that c >= |b-r| and c <= b+r. The paper's small-epsilon argument establishes only that the user-circle center lies inside the antenna circle (c >= b), which is not sufficient when b < r: in that case the stricter condition c >= r-b is needed. This is not a cosmetic issue. For example, with r=1, b=0.1, and epsilon_o=0.5, the antenna circle is entirely contained in the user circle for all c <= 0.9, so the outage area is pi*(r^2-c^2); the root is c = sqrt(0.5) = 0.707, which is below r-b = 0.9. At this root the arccos arguments in Eqs. (5) and (9) are outside [-1,1], so the published S4 expression and the bisection procedure cannot be evaluated. The authors should characterize the admissible (b, r, epsilon_o) regime, enforce it in the algorithm, and either derive formulas for the non-intersecting branch or explicitly restrict the setting to parameters where the intersecting-circle condition holds. In particular, the discussion in Section IV that invokes epsilon_o <= 0.5 is not supported by the derivation.","section":"Section III-A, bisection paragraph after Eq. (12)"},{"comment":"The bisection update is described with a sign error. The text states that if S4 at the midpoint is less than epsilon_o*pi*r^2, then 'the true value of c lies in the right half, and we update the upper bound.' Since S4 is a decreasing function of c, a value of S4 that is too small means that c is too large, so the true root lies to the left of the midpoint and the upper bound should be set to the midpoint. Conversely, if S4 is too large, the lower bound should be raised. As written, the described procedure would move the interval in the wrong direction and fail to converge to the root. This needs correction even though the default simulation parameters likely lie in the valid regime.","section":"Section III-A, paragraph on optimal xPin"},{"comment":"The claim that the optimal single-user antenna position is xPin = x_k (or xPin = L when x_k > L) is asserted rather than proved. The argument that this minimizes the distance to the estimated user center is intuitive, but the objective is the minimum power satisfying an outage-area constraint, which depends on the full two-circle geometry through b = sqrt((xPin-x_k)^2 + y_k^2). The proof should show that the required value of c (and hence the required power) is monotonically increasing in b, or provide a direct optimality argument. This point is load-bearing because the abstract and conclusion state that the single-user optimal antenna position is derived.","section":"Section III-A"}],"minor_comments":[{"comment":"The text says that for epsilon_o <= 0.5, 'the range of R satisfies b <= R <= b+r,' but the bisection variable is c = sqrt(R^2-d^2), not R. The condition should refer to c, and Section III-B does not actually contain the cited discussion; this appears to be a typo that should be corrected.","section":"Section II-A, user-location model"},{"comment":"The monotonicity statement 'it can be verified that S4 is a decreasing function of c' is used to justify the bisection but is not demonstrated. A brief argument based on the area of intersection of two circles as a function of their center distance would make the paper self-contained.","section":"Section II-A"},{"comment":"The model restricts the actual user location to the half-plane x >= 0, but the subsequent area calculations treat the uncertainty region as a full circle. If the uncertainty circle intersects the line x = 0, the outage area is a circular-segment calculation rather than the two-full-circle formula used here. The paper should state that the parameters are chosen so that this boundary effect is negligible, or handle it explicitly.","section":"Section IV"},{"comment":"The sentence 'recent research have illustrated' contains a subject-verb agreement error; it should be 'recent research has illustrated.'","section":"Abstract"}],"recommendation":"major_revision","confidential_remarks":"The paper is an early arXiv version and the main technical gap is the uncharacterized validity regime of the two-circle formula, together with a sign error in the bisection update. These are fixable within the paper's scope. The novelty relative to the cited pinching-antenna resource-allocation literature is incremental but acceptable for a letter if the correctness issues are resolved. I recommend major revision rather than rejection because the geometric approach is sound in the regime actually used in the default simulations, and the numerical claims are supported by the exhaustive-search comparison."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this is a solid, well-scoped paper on robust power allocation for pinching antennas under user-location uncertainty. The novelty is real—most prior pinching-antenna RA papers assume perfect user coordinates. The outage-constrained formulation and the geometric method for computing the outage area are new. It deserves peer review. But the paper as written has a correctness gap in the single-user power calculation that needs fixing before publication.\n\nWhat the paper does well: the decomposition into independent single-user subproblems for a fixed antenna position is correct; the two-circle area calculus in Eqs. (5)-(11) is standard but accurately applied in the regime where the circles intersect in the assumed way; and the simulations show the PSO placement closely tracks exhaustive search and beats a fixed antenna by a large margin. The authors are also honest about the prior-work gap, and the citations to the pinching-antenna RA literature are relevant.\n\nThe soft spots, in order of importance.\n\nFirst, the paper asserts that for small outage threshold ε_o the user-circle center lies inside the antenna circle (c≥b) and then uses [b,b+r] as the bisection interval, but it never proves the stricter condition c≥|b−r| that the formula (11) actually requires. The stress-test counterexample is valid: with r=1, b=0.1, ε_o=0.5, the root c≈0.707 is less than r−b=0.9, so the arccos arguments in (5) and (9) are outside [-1,1] and the published bisection cannot be evaluated. Since Section IV discusses ε_o up to 0.5, this isn't an edge case the authors can ignore. They need to characterize the valid regime or provide the correct alternative branch (e.g., the containment case) and adjust the bisection interval accordingly.\n\nSecond, the optimality of placing the antenna at xPin=x_k is asserted without proof. It is plausible for a uniform circular uncertainty region and free-space pathloss, but the paper does not justify it. This is a moderate issue; the multi-user PSO does not depend on it, so the main design survives.\n\nThird, the bisection description contains a sign error. The text says that if S4(mid) is less than the target, the true c lies in the right half and we update the upper bound. Since S4 is decreasing in c, the correct update is to set the upper bound to mid. This is easy to fix, but as written it inverts the search direction.\n\nFourth, the PSO is a black box: no hyperparameters, no code, no sensitivity analysis. For a heuristic that claims near-optimality, this is a reproducibility gap, not a correctness one.\n\nWho is this for? Researchers working on pinching-antenna resource allocation or robust position-aware communications. It is a serious piece of work, and the numerical claims for the default parameters (ε_o=0.01, r=3) appear to be in the valid regime. I would send it to a referee with expertise in geometric probability, and the revision should be major rather than minor because of the missing regime analysis.\n\nRecommendation: accept for peer review with a major-revision recommendation.","headline":"Useful robust-formulation paper for pinching antennas, with a real but fixable correctness gap in the outage-area computation.","tokens_in":8310,"tokens_out":5391,"would_cite":true,"duration_ms":53677,"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":"Under uncertain user locations, a pinching antenna can meet outage limits with near-optimal transmit power.","keywords":["pinching-antenna systems","imperfect channel state information","outage probability","transmit power minimization","particle swarm optimization","bisection method","geometric outage region","user-location uncertainty"],"falsifier":"Take a single user with uncertainty radius $r=3$ m and center distance $b=1$ m, compute the power prescribed by the bisection for a fixed $\\epsilon_o$, then Monte Carlo sample actual user positions uniformly inside the uncertainty circle and count the fraction of samples whose rate falls below the target; if the empirical outage fraction meaningfully exceeds $\\epsilon_o$, the geometric area reduction is not valid in that regime.","tokens_in":7189,"feed_emoji":"📡","tokens_out":13452,"duration_ms":147380,"temperature":0.7,"pith_summary":"The paper establishes a robust power-allocation rule for a downlink system in which one pinching antenna slides along a dielectric waveguide and each user's true position is known only within a circular uncertainty region. The central claim is that, under a small outage threshold, the minimum transmit power for a user is fixed by a geometric condition: the area of the uncertainty circle that lies outside the antenna's projected coverage circle must equal $\\epsilon_o\\pi r^2$. This converts each probabilistic outage constraint into a deterministic equation $S_4(c)=\\epsilon_o\\pi r^2$, solved by bisection, and it lets the multi-user problem split into $K$ independent single-user power computations once the antenna position is chosen. A particle swarm optimization loop then positions the antenna, and the reported simulations show power consumption close to exhaustive search and far below a fixed-antenna baseline. The value of the result is that pinching antennas remain attractive in the realistic case where location information is imperfect.","feed_headline":"Pinching-antenna placement cuts power under user-location uncertainty","feed_subtitle":"A bisection-and-geometry routine meets outage limits at near-exhaustive-search power.","key_machinery":"The workhorse is the projected coverage circle: Theorem 1 shows that the sphere of constant received rate centered at the pinching antenna intersects the user's uncertainty circle along an arc whose ground-plane radius is $c=\\sqrt{R^2-d^2}$, centered at $(x_{\\mathrm{Pin}},0,0)$. The area $S_4(c)$ of the uncovered part of the user circle is assembled from two sector areas and two congruent triangles, with Heron's formula for the triangle contribution, and its monotonicity justifies the bisection solution. This identity is what turns a probability constraint into a deterministic equation, and it makes the objective non-differentiable but cheap enough for particle swarm optimization to explore antenna positions.","core_discovery":"The specific discovery is that, for a fixed antenna position, the smallest power needed to keep user $k$ out of outage is $P_k^{\\min} = (2^{\\hat R_k}-1) R^2 \\sigma_k^2 / \\eta$, where $R$ is recovered from a pure area calculation. The paper proves that points at fixed rate from the pinching antenna project to a ground-plane circle of radius $c=\\sqrt{R^2-d^2}$, and that the outage region is the part of the user's uncertainty circle outside this projected circle. Writing its area as $S_4(c)=(\\pi-\\beta)r^2 + 2\\sqrt{s(s-b)(s-c)(s-r)}-\\alpha c^2$, with $\\alpha,\\beta$ from the law of cosines and $s$ the semi-perimeter, the outage constraint becomes $S_4(c)=\\epsilon_o\\pi r^2$. Since $S_4(c)$ is decreasing in $c$, bisection on $[b,b+r]$ gives $c$, then $R=\\sqrt{c^2+d^2}$, then the power directly. In the multi-user case this calculation is repeated for every user independently, and only the antenna position needs global optimization.","pith_inferences":["For outage probabilities above about $0.5$, the required coverage radius can fall below the center distance $b$, so the bisection interval $[b,b+r]$ and the stated area formula need a separate case analysis; the paper's numerical regime deliberately stays away from this.","The same geometric reduction would carry to other position-error distributions only if the outage region is still a circle complement; for Gaussian or elliptical errors the outage probability becomes an integral over the disk intersection that would need numerical evaluation.","The common single antenna position couples all users through the choice of $x_{\\mathrm{Pin}}$; allowing multiple pinching antennas or waveguides would break the per-user independence and enlarge the search space of the optimization.","A direct comparison of outage probability predicted by $S_4$ against Monte Carlo sampling over the uncertainty circle would isolate the geometric assumption from the optimization machinery, giving a clean test of the model."],"forward_implications":["At a fixed pinching-antenna position, the $K$-user power-minimization problem decomposes into $K$ independent single-user bisection solves, so the method scales without solving a coupled program.","Total transmit power grows roughly linearly with the radius of the user-location uncertainty when the center distance $b$ dominates $r$, because the required $R^2$ behaves as $b^2+2b\\delta r+\\delta^2 r^2+d^2$.","The required power is nearly insensitive to the allowed outage probability over the small-$\\epsilon_o$ range examined, because the feasible coverage radius only shifts within $[b,b+r]$.","The gap to a fixed antenna widens as target rates grow, since $P_k^{\\min}$ scales as $(2^{\\hat R_k}-1)R^2$ and the pinching antenna shrinks $R$ for each user.","Because the objective is non-differentiable, the same decomposition plus a swarm search applies to other per-user quality constraints that can be expressed as coverage-area equations."],"supporting_citations":[{"why":"Supplies the physical pinching-antenna concept of a movable antenna on a dielectric waveguide that the entire system model relies on.","marker":"[1]"},{"why":"Provides the operating principles of pinching antennas and motivates the LoS-dominated channel treatment.","marker":"[2]"},{"why":"Defines the pinching-antenna system architecture whose waveguide geometry is used in the model.","marker":"[3]"},{"why":"Frames resource allocation for pinching-antenna systems as the research area this robust-design study extends.","marker":"[4]"},{"why":"Gives the free-space rate model in (1) and the TDMA equal-time-allocation assumption used for the objective.","marker":"[7]"},{"why":"Supplies the low-complexity placement-design baseline and the channel assumptions the paper builds on.","marker":"[8]"},{"why":"Provides the common pinching-antenna position assumption and the position bound $[0,L]$ adopted in the problem.","marker":"[14]"},{"why":"Establishes the prior power-minimization setting whose perfect-CSI assumption this paper removes.","marker":"[15]"}],"fun_headline_variants":["Pinching-antenna power shrinks even when user positions are unknown","Outage-safe pinching-antenna placement cuts transmit power robustly","Bisection and PSO: pinching-antenna power under location uncertainty","Robust pinching-antenna design beats fixed antennas with uncertain users"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the outage threshold is small enough for the required coverage-circle radius to lie in the interval $[b,b+r]$, so the user-circle center is inside the coverage circle and the closed-form area formula applies; the paper asserts this regime without formally characterizing how small $\\epsilon_o$ must be.","fun_headline_variants_meta":{"raw":{"variants":["Pinching-antenna power shrinks even when user positions are unknown","Outage-safe pinching-antenna placement cuts transmit power robustly","Bisection and PSO: pinching-antenna power under location uncertainty","Robust pinching-antenna design beats fixed antennas with uncertain users"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001001,"raw_usage":{"total_tokens":4270,"prompt_tokens":1015,"completion_tokens":3255,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":631,"completion_tokens_details":{"reasoning_tokens":3174}},"tokens_in":631,"tokens_out":3255,"duration_ms":27924,"temperature":1.0,"reasoning_tokens":3174,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T16:44:54.951701+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a single user with uncertainty radius $r=3$ m and center distance $b=1$ m, compute the power prescribed by the bisection for a fixed $\\epsilon_o$, then Monte Carlo sample actual user positions uniformly inside the uncertainty circle and count the fraction of samples whose rate falls below the target; if the empirical outage fraction meaningfully exceeds $\\epsilon_o$, the geometric area reduction is not valid in that regime.","supporting_citations":[{"cited_title":"Pinching antenna using a dielectric waveguide as an antenna,","cited_arxiv_id":null,"evidence_quote":"Supplies the physical pinching-antenna concept of a movable antenna on a dielectric waveguide that the entire system model relies on."},{"cited_title":"Flexible-antenna systems: A pinching- antenna perspective,","cited_arxiv_id":null,"evidence_quote":"Gives the free-space rate model in (1) and the TDMA equal-time-allocation assumption used for the objective."},{"cited_title":"A Low-Complexity Placement Design of Pinching-Antenna Systems","cited_arxiv_id":"2502.14250","evidence_quote":"Supplies the low-complexity placement-design baseline and the channel assumptions the paper builds on."},{"cited_title":"Minimum data rate maximization for uplink pinching- antenna systems,","cited_arxiv_id":null,"evidence_quote":"Provides the common pinching-antenna position assumption and the position bound $[0,L]$ adopted in the problem."}],"review_version":1}