{"id":"f74972b0-6390-4f11-9354-ebb0d95d461c","arxiv_id":"2512.21962","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"A five-constraint linear program certifies network nonlocality in a 6-party 4-source ring of single-photon W states, reporting infeasibility outside beamsplitter transmissivity t in (0,0.292) union (0.708,1).","lead":"The paper builds a linear-programming test that flags correlations in a quantum network as impossible to explain with independent classical sources, and applies it to a 6-party ring of single-photon W states. A specialist would read it for a potentially cheaper alternative to inflation-based network-nonlocality witnesses, but the strategy space used in the proof is narrower than the full network-local set.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The LP's strategy space is restricted by Def. 1 to target-party assignments; the paper only shows every outcome has some strategy, not that every network-local model is representable, so infeasibility does not certify network nonlocality under Eq. (32).","rationale":"The reader's weakest assumption correctly identifies the load-bearing gap: the strategy space in Definition 1 is strictly narrower than the full network-local model of Eq. (32), and the paper does not prove completeness of this restriction. My reading of the manuscript confirms this. The LP's constraints are derived by making assertions about hidden-variable values from observed outcome patterns (Theorem 1 and Eq. 66), but these assertions are valid only under the photon-number-conserving, target-party response model of Def. 1. The paper's verification step (Step 1) explicitly only checks that each outcome has at least one strategy in D, which is insufficient: a network-local model with more detailed hidden variables could reproduce the same statistics while failing to satisfy the derived constraints, making the LP a witness against a restricted model rather than against network-locality. This is not a mere paraphrase of the central claim; it is a failure of the soundness proof. The internal algebra for the restricted model is coherent, but without a proof that the restriction is without loss of generality (or an explicit reframing of the result as certifying single-photon network nonlocality), the headline claim is unsupported. Therefore, I agree with the reader's REJECT verdict. The proposed concrete test—re-deriving Eq. (66) from Eq. (32) without Def. 1—would directly settle whether the gap is real.","tokens_in":22274,"tokens_out":8101,"duration_ms":86308,"concrete_test":"Independently re-derive Eq. (66) directly from the full network-local decomposition Eq. (32) without invoking Definition 1. If the derivation fails—i.e., if one cannot express µ(λ_m = A_n) solely in terms of observed outcome probabilities without assuming each source's hidden variable is a three-valued target-party assignment and each party's response depends only on the number of received photons—then the LP constraints are not necessary conditions for network-locality, and the central claim is refuted. Alternatively, construct a network-local p(a) for the 6-party, 4-source ring network using hidden variables with additional degrees of freedom (e.g., λ_m ∈ {A_u,A_v,A_w}×{0,1}) and run the paper's LP; if the LP reports infeasibility for this known network-local distribution, the witness is unsound.","verdict_should_be":"REJECT","load_bearing_attack":"The central claim—that LP infeasibility certifies network nonlocality—is unsound because the LP tests a restricted hidden-variable model, not the full network-local set of Eq. (32). Definition 1 restricts each λ_m to a three-valued 'target party' and implicitly assumes a party's response depends only on the number of received photons. The standard network-local model (Eq. 32) permits arbitrary λ_m domains and arbitrary response functions p_n(a_n|λ_m, λ_m'). The paper's own Step 1 verification (Sec. V) only establishes that every realizable outcome has at least one strategy in D ('we have verified our enumeration produced at least one strategy in the support of every realizable outcome'), not that every network-local model's strategies are representable in D. The derivations of Classes 3–5, especially Eq. (66) and Eq. (80), rely on Theorem 1, which infers the value of λ_m from the pattern of zero outputs. This inference is only valid under the restricted response functions of Def. 1; a general network-local model could produce the same observed p(a) with stochastic response functions that do not satisfy the photon-number-conservation condition, breaking the link between observed outcome probabilities and the hidden-variable marginals µ(λ_m). Consequently, the LP constraints are not necessary conditions for network-locality, and infeasibility does not imply p(a) is outside the network-local set.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a linear-programming witness for network nonlocality. It defines an auxiliary distribution q(a,λ) on a restricted outcome subset O_S and strategy set S, and imposes five classes of linear constraints: distribution validity, marginal agreement with observed p(a), strategy distribution, conditional independence, and domain asymmetry. The claim is that infeasibility of this LP is a sufficient certificate that p(a) is not network-local. The method is specialized to ring networks with tripartite single-photon W states and click/no-click detectors, and is demonstrated for a 6-party, 4-source ring, where the LP is reported infeasible for approximately t∈(0,0.292)∪(0.708,1).","tokens_in":22610,"tokens_out":9333,"duration_ms":104988,"significance":"If valid, the approach would be a significant practical alternative to inflation: the decision-variable count is |O_S|·|S| rather than the combinatorial clone count, and the paper provides explicit analytic constraint forms and a comparison of ECOS, SCS, and GLPK. The derivations leading to Eq. (66) are internally consistent for the specific token strategy model defined in Def. 1. However, the central gap is that this strategy model is a strict subset of the network-local models of Eq. (32); the paper does not prove that every network-local decomposition can be represented in D. The witness therefore does not certify standard network nonlocality as claimed.","major_comments":[{"comment":"The central claim (Sec. III, before Eq. (15)) that LP infeasibility implies p(a) is network-nonlocal requires that the LP constraints are satisfied by every distribution admitting the decomposition in Eq. (32). Definition 1 restricts each λ_m to a three-valued 'target party' and the image construction in Step 1 assumes a party's output depends only on how many photons it receives. Eq. (32) permits arbitrary λ_m domains and arbitrary response functions p_n(a_n|λ_m,λ_m'), including stochastic and photon-number-nonconserving response functions. The verification in Step 1 ('there exists a valid strategy λ_j∈D for every realizable outcome a_i∈O') is only a support condition F(D)=O; it does not show that an arbitrary network-local model can be expressed as a convex mixture over D. Hence Classes 1–5 are not necessary conditions for network locality, and the numerical infeasibility in Sec. VI do","section":"Sec. III, V (Def. 1)"},{"comment":"Theorem 1 infers λ_m=A_n from the pattern of zeros in O_S. This inference is valid only for the token model of Def. 1, where a source's λ_m value is the party receiving a photon and a receiving party must produce a click. Under Eq. (32), a network-local model may have p_n(0|λ_m,λ_m')>0 or may output L/R/2 according to an arbitrary function of the two incoming λ's; the observed zero pattern then carries no information about λ_m. Therefore the marginals μ(λ_m=A_n) computed from p(a) via Eq. (66) are not the marginals of a general network-local model, and the strategy-distribution and domain-asymmetry constraints built on them are not necessary for network locality. This is a load-bearing gap in the derivation of Classes 3 and 5.","section":"Sec. V (Thm. 1, Eq. (66))"}],"minor_comments":[{"comment":"The sentence 'For any value of T>0, the program is infeasible' is confusing; the tolerance-minimized LP is feasible by construction for sufficiently large T. Please rephrase to state that the exact LP with zero tolerances is infeasible and T is the minimal total violation required.","section":"Sec. VI (Results)"},{"comment":"The axes and the meaning of T should be given in the caption; currently only transmissivity t is mentioned.","section":"Fig. 5"},{"comment":"The reduction of inputs to fixed settings by mapping inputs to outputs of new parties may change the network structure; a reader would benefit from a precise statement of how the LP constraints adapt when inputs are present.","section":"Sec. III, footnote 3"},{"comment":"The strategy labels λ_0...λ_29 and the notation F(λ)↦O_S would be easier to follow if the table also explained in text that each outcome pattern has two supporting strategies.","section":"Sec. VI, Table I"}],"recommendation":"reject","confidential_remarks":"The paper's technical content around Eq. (66) may be useful if reframed as a witness for a restricted photon-token local model. In its current form, the central claim of certifying standard network nonlocality is not supported; I recommend rejection rather than major revision because closing the gap would require changing the object of certification."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The thing to know: the five-constraint LP framework is a concrete, clearly presented contribution, and the explicit ring-network derivations are internally consistent. But the paper does not prove that the LP tests the full network-local set of Eq. (32). Definition 1 restricts each hidden variable lambda_m to a three-valued \"which party gets the photon\" token; a general network-local model allows arbitrary lambda_m domains and arbitrary response functions. The verification in Step 1 only checks that every observed outcome has some token strategy in its support. That is necessary but not sufficient for the LP constraints to be necessary conditions for network locality. So an infeasible LP rules out only the restricted token model, not all network-local models. The stress-test note lands.\n\nCredit where due: the five classes are laid out cleanly, and the derivations of Eq. (66), Eq. (80), and the uniform mu(lambda) in the 6-party case are careful. The idea of isolating outcome subsets O_S and using zero patterns to infer lambda_m values is clever and may be useful for building witnesses in specific photonic networks. The comparison to inflation is fair, and the scaling argument is sensible.\n\nThe main soft spot is the completeness gap. The paper says infeasibility is a sufficient condition to rule out a network-local model, but it only rules out the restricted model from Def. 1. That is a load-bearing issue, not a paraphrase. A second, minor issue: no code or data accompany the numerical feasibility results, so the infeasibility intervals and tolerance sums are not independently checkable. Also, the phrase \"arbitrary networks\" oversells the method: classes 3–5 depend on network-specific structure and on the photon-number-conservation assumption with fewer photons than parties.\n\nWho should read this? People working on network-nonlocality witnesses might take the LP construction as a starting point for restricted models, and the explicit example is useful for understanding what such a witness can and cannot do. But as a certification of standard network nonlocality, the central claim is not supported as written.\n\nI would send it to peer review. The flaw is real and likely fixable—either by proving completeness or by honestly reframing the result as a witness for single-photon token models, which would still have value. The paper is serious and technically engaged, just overclaimed.","headline":"Useful LP construction for a restricted token model, but the completeness gap makes the network-nonlocality claim unproven.","tokens_in":23095,"tokens_out":3157,"would_cite":false,"duration_ms":38385,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P40","81P15","90C05"],"pacs":["03.65.Ud","03.67.-a"],"model":"deepseek-v4-flash","headline":"A linear program can certify network nonlocality in arbitrary networks by testing an auxiliary distribution q(a,λ) with five classes of linear constraints; infeasibility proves the observed correlations are not network-local.","keywords":["network nonlocality","linear program witness","network-local correlations","ring network","single-photon W state","domain asymmetry","hidden-variable enumeration","sufficient criteria"],"falsifier":"For a transmissivity in the certified range (say t=0.1), exhibit an explicit network-local model of the general form in Eq. (32) — arbitrary hidden-variable domains and arbitrary response functions — whose outcome distribution equals the quantum p(a) computed from Eq. (31). If such a model exists, the LP's infeasibility would be an artifact of the restricted strategy space rather than a certificate of network nonlocality.","tokens_in":22129,"feed_emoji":"⚛️","tokens_out":5604,"duration_ms":51999,"temperature":0.7,"pith_summary":"The paper introduces a linear-programming witness for network nonlocality: five classes of linear constraints on an auxiliary distribution q(a,λ) defined over a restricted set of outcomes and the hidden-variable strategies that produce them. If no q(a,λ) satisfies the constraints while matching the observed probabilities p(a), the authors conclude p(a) is network-nonlocal. The constraint classes are designed to be network-agnostic in kind, with explicit forms tailored to each network. They demonstrate the method on a six-party, four-source ring network distributing single-photon W states, where each party uses a tunable beamsplitter; the LP becomes infeasible for beamsplitter transmissivities t∈(0,0.292)∪(0.708,1), which they present as a certification of network nonlocality. The approach's decision variables scale as the number of observed outcomes times the number of restricted strategies, avoiding the combinatorial growth of existing approaches.","feed_headline":"LP infeasibility certifies network nonlocality in a six-party ring","feed_subtitle":"Five linear constraint classes expose nonlocal correlations that escape existing combinatorial methods.","key_machinery":"The machinery is the auxiliary distribution q(a,λ) defined on the outcome subset O_S (where the number of single-click outputs equals the number of photons) and its pre-image S in the enumerated strategy space D, together with the five constraint classes: distribution validity, marginal agreement with p(a), strategy distribution derived from inferred λ-marginals, conditional independence for parties sharing the same hidden-variable pair, and domain asymmetry that equates differences between disjoint pre-image regions with statistics computable from p(a). Theorems 1 and 2 provide the bridge from outcome patterns to hidden-variable values: because there are fewer photons than parties, zero-cli","core_discovery":"The central claim is that network nonlocality can be witnessed by linear programming once the hidden-variable space is carefully enumerated and the outcome set is restricted to events where each single photon is detected as a click at a distinct party. Under this restriction, Theorems 1 and 2 show that the positions of zero-click outcomes reveal the value of individual source variables λ_m, letting the authors express strategy probabilities, conditional independence, and 'domain asymmetry' as linear constraints on q(a,λ). For the six-party, four-source ring network, the resulting LP is infeasible for t∈(0,0.292)∪(0.708,1), certifying that the observed correlations cannot be produced by a net","pith_inferences":["The paper leaves open whether the restricted strategy space (target-party-valued λ_m and photon-count-only responses) covers all network-local models; if it does not, the infeasibility at t∈(0,0.292)∪(0.708,1) could be a false positive. A proof of completeness for the enumeration, or a counterexample, would settle whether the witness is sound in general.","The success of the witness appears tied to the 'fewer photons than parties' structure, which makes hidden variables partially observable from zero-click patterns; similar LP witnesses may exist for other networks with conserved quantities that allow such inference.","The uniform strategy distribution and analytic domain asymmetries found for the six-party ring suggest symmetry reductions could scale the approach to larger rings without full enumeration.","The same five constraint classes could be adapted to detect full or genuine network nonlocality once the relevant network-structured notions are defined, since the constraints already enforce source independence among all sources."],"forward_implications":["If the LP infeasibility genuinely reflects network nonlocality, then for the six-party, four-source ring, the W-state correlations at beamsplitter transmissivities in (0,0.292) and (0.708,1) are certified nonlocal using only observed probabilities and the tunable parameter.","The five constraint classes provide a general template for constructing network-nonlocality witnesses: classes 1 and 2 are generic for any network, while classes 3–5 are adapted to the network's structure.","The decision-variable count |O_S|·|S| is upper bounded by d^N · P^M, meaning the witness can handle networks where existing combinatorial approaches become intractable.","The witness is sufficient but not necessary: a feasible LP does not imply network-locality, so the feasible regions (including t=0 and t=1) do not establish locality."],"fun_headline_variants":["LP infeasibility certifies nonlocality in a six-party ring","Five constraint classes yield an LP witness for network nonlocality","Network nonlocality witnessed via LP infeasibility","LP infeasibility exposes nonlocal correlations in ring networks","Ring network nonlocality certified by a linear program"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The load-bearing premise is that the enumeration of hidden-variable strategies — each source variable limited to naming one of its three target parties, and each party's response depending only on how many photons it receives — can represent every network-local model of the observed statistics; the paper only proves that every realizable outcome has at least one such strategy, not that no network-local model is lost by the restriction.","fun_headline_variants_meta":{"raw":{"variants":["LP infeasibility certifies nonlocality in a six-party ring","Five constraint classes yield an LP witness for network nonlocality","Network nonlocality witnessed via LP infeasibility","LP infeasibility exposes nonlocal correlations in ring networks","Ring network nonlocality certified by a linear program"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00117,"raw_usage":{"total_tokens":4653,"prompt_tokens":699,"completion_tokens":3954,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":443,"completion_tokens_details":{"reasoning_tokens":3871}},"tokens_in":443,"tokens_out":3954,"duration_ms":30824,"temperature":1.0,"reasoning_tokens":3871,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T13:58:33.710431+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For a transmissivity in the certified range (say t=0.1), exhibit an explicit network-local model of the general form in Eq. (32) — arbitrary hidden-variable domains and arbitrary response functions — whose outcome distribution equals the quantum p(a) computed from Eq. (31). If such a model exists, the LP's infeasibility would be an artifact of the restricted strategy space rather than a certificate of network nonlocality.","supporting_citations":[],"review_version":1}