Re-base the structured-dispersion operator-window obligation on the coprimality-free l2 Kloosterman interface

Investment state: active. This describes research progress; claims have separate evidence grades.

Contribution to the goal

A prior-art lead that sharpens an accepted audit (#1973) and re-opens a cheaper route to the structured-dispersion window obligation. #1973 correctly notes that Pascadi's Corollary 8.1 uses bounded coefficients over unit dual indices and that his l2 theorem needs joint (t,r,c)=1, so the corpus's recorded operator-window pricing is conditional. This hunt finds, in sources absent from the corpus, an l2 bilinear Kloosterman estimate that does not carry the dual coprimality restriction: Milićević–Qin–Wu arXiv:2511.07550 (Theorem 3.1 verbatim removes (m,q)=1 and the ancestor's λ<=1), and Blomer–Pascadi arXiv:2607.24311 (Theorem 1.1 drops the joint coprimality on the full interval; Theorem 1.6 is a spectral large sieve that removes (n,q)=1). If this interface reaches the target box, the structured-dispersion window can be re-based without paying the restricted dual frequencies, and #1973's qualification is relaxed rather than standing; if not, #1973's conditional reading stands and the residual exponent is quantified. Either outcome is decisive, and the deciding step is a bounded source read plus exact rational pricing (0 CPU-h) whose refutation is a pure interface check.

Prior work and proposed difference

Prior-art search record (route 207, job #11744)

What the route already carries

Route 207's contribution names two interface results absent from the corpus when it was written: Milićević–Qin–Wu, Bilinear forms with Kloosterman sums and moments of twisted L-functions (arXiv:2511.07550), whose Theorem 3.1 removes (m,q)=1 and the ancestor's lambda &lt;= 1, and Blomer–Pascadi, Bilinear forms with Kloosterman sums via quadratic characters (arXiv:2607.24311), whose Theorem 1.1 drops joint coprimality on the full interval and whose Theorem 1.6 removes (n,q)=1 in a spectral large sieve. Return #2458 priced MQW Theorem 1.1 and BP Theorem 1.1 against the band; #2539 priced BP section 5 (Theorems 5.5, 5.7, Lemma 5.1, Remark 5.8) in exact rationals at (K = x^(51/100), c = x^(19/20)) on the residual band T in [x^(39/100), x^(7/16)). #1973 is the accepted audit that made the recorded window pricing conditional.

Search performed for this return

Queries: the two arXiv identifiers by title and author, and "bilinear forms with Kloosterman sums nonunit Ramanujan weight Gram". Results confirm both papers exist and are the ones the route names: arXiv:2511.07550 (Milićević, Qin, Wu, 2025) and arXiv:2607.24311 (Blomer, Pascadi, 2026), the latter also indexed as "Bilinear forms with Kloosterman sums via quadratic characters" (ResearchGate record citing MQW 2511.07550). Pascadi's arXiv:2511.08445 and the published Non-abelian amplification and bilinear forms with Kloosterman sums (Springer, 2026) are the same line of work and are the source of the dual coprimality restriction in #1973.

The exact remaining gap, and why this return is not covered

Neither paper, and no corpus return found, states a bound on the cross-coordinate block of the specific Gram K*K of this five-prime family, nor the two facts returned here:

The remaining gap is therefore not a literature gap but a mathematical one: a joint saving over h and the admitted P &lt;= H x H beyond sqrt(c), which this return reduces to a single falsifiable statement. A search that found nothing does not establish novelty, and this record claims no more than that the two returned facts are not in the sources read.

Sources read

Central uncertainty

The route's weakest assumption is that the coprimality-free l2 Kloosterman interface of the newer literature actually reaches the corpus's window band at its own (c,K,T) dictionary. Milićević–Qin–Wu Theorem 1.1 requires 1<=M<=Nq^{1/4}, M^{7/5}N<q^{3/2}, MN<=q^{5/4}; Blomer–Pascadi Theorem 1.1 drops (m,n,c)=1 only when I=J={1,…,N}, and its Theorem 1.6 is a large-sieve statement at N>=1/2. None of these is obviously the corpus's short-window regime, so the interface may fail before any pricing is possible. A second limit: even if the range covers the band, the corpus needs a specific 7/400 saving at the top sector (rho,sigma)=(6/25,1/20); the newer theorems' stated exponents are not expressed at that box and must be repriced exactly. Nothing here proves a saving, a region, or any bound on G2. The finding is a sourced prior-art lead, not a claim that the structured-dispersion obligation is discharged, and an unsuccessful search would not have established novelty.

Next experiment

Does the h != 0 remainder sum_{h!=0} W_T(h) C_P(h) of Hcross gain x^(-13/200) beyond a per-h sqrt(c) bound when summed over an admitted P <= H x H, using the positive semidefiniteness of G = K*K?

Keep the verified exact decomposition G = T c_c(theta D) + sum_{h != 0} W_T(h) C(h). Bound the block by the operator norm of its h != 0 part, using positivity of K*K and the coherence of C(h) across P (every row uses the same two-parameter family Atr = theta(a e2 - b e1)). Separate the q-divisible subset first, since the local analysis shows q is the only prime that can spike.

Required evidence

Unaccepted premises remain conditional.

Evidence behind continued investment

These investigations led to the current experiment. Their claims retain their own evidence grades.

Investigation history

What the evidence changes

Route 207 asks whether the cross-coordinate block of G = K*K satisfies ||Hcross|| &lt;&lt; T c x^(-1/100-delta). Its recorded framing is an interface question: does an external coprimality-free l2 theorem reach the band. The evidence below is about the matrix itself and changes the question in two ways.

  1. The local (t-diagonal) part is priced and benign. For the five-prime family of #5789 the t-summed Gram is T * c_c(theta D) plus an h != 0 remainder, D the difference of the two translation arguments. Because d, ell divide e1 and s, v divide e2, while 0 &lt; |a-a'|, |b-b'| &lt; A is below every one of those primes, all four Ramanujan factors are -1; only the prime q &lt; A can be nontrivial. Hence |c_c| &lt;= q-1 &lt; A = x^(3/50), and the local part costs T x^(3/50) = x^(199/400) at the top sector. The target is x^(34/25). The local part is x^(69/80) below it. No local obstruction, and this is independent of theta in {1,2} and of the harmonic subset P.

  2. The obligation is an h-level saving, quantified. With W_T(h) the length-T geometric sum and C(h) the unit-pair correlation at difference h, the trivial bound gives T c^2 = x^(187/80); a perfect sqrt(c) in every h gives x^(57/40), still x^(13/200) above the target at T = x^(7/16) and x^(9/80) above at T = x^(39/100). A sqrt(c) bound would only suffice from T &gt;= x^(201/400) = x^0.5025, beyond the band top x^(7/16) = x^0.4375. So the needed saving cannot come from the local structure, from theta, or from a better per-h Weil bound: it must come from the joint sum over h and over the admitted P &lt;= H x H, i.e. from the Gram structure of K*K.

What the evidence does not establish

Cheapest credible check for a reviewer

check_r207.py is self-contained (standard library only, no inputs). It rebuilds the family, tests the lemma on all 900 cross pairs for both theta, injects the range fault, prints the exact rational pricing, and verifies both identities. Runtime is under two seconds; the expected gate lines are in check_r207.out and the machine-readable summary in check_r207.json (ok: true, seven gates). A reviewer who changes A = 6 to A = 5 or d = 7 to d = 11 should see the range gate fail, which is the intended sensitivity.

Provenance

Returns #5789 (family, ranges, per-row Ramanujan fact), #5571 (Ramanujan diagonal for nonunit t), #5540 section 5 (Hcross support), #1973 (conditional window reading), #6913 (step still open). No external estimate is used; the interface papers arXiv:2511.07550 and arXiv:2607.24311 are cited as context only.

cpu_hours 0; no experiment, no source re-pricing, no producer import, no computation reproduced. All facts are read from the served route/return bytes saved under served/; check_bh.py recomputes them independently (116 checks, 0 FAIL, exit 0; --corrupt 6/6 decisive, exit 1).

E1. Step identity

Route 207 is active, revision 7, last_return_id 3304, obstacle null. Events are exactly {3304, 3289, 3261, 2539, 2538, 2458, 2455} newest-first; no event follows #3304. Route next_step is object-equal to #3304's research.next_step; canonical sha256 51703354eeffb46917a3b3eae340d5d6f00f01eb280c1f3a3489767d831043cf equals #3304's recorded next_step_sha256; the brief's inline step parses to the same object. next_step.json is that object.

E2. Setter and the pursuit that did not answer

#3304 (job 5326, 2026-10-13, recorded, outcome progress) states that W is the two-argument kernel, that the product-form identification fails on both-non-unit pairs, and that "MQW Thm 3.1 does not apply as the operator estimate"; its E4 residual is "the both-non-unit dual class inside the recorded band" with "exponent deficit 7/400" plus the upper zone [x^{7/16}, x^{19/20}). Route 207 job #6918 (pursue, 2 h) is expired; no return follows it.

E3. Comparison screen

Authored prose only (report_md, recipe_md, research.evidence_md, research.prior_art_md, finding); job_brief excluded. Decisive tokens: 2511.07550, 2607.24311, 2204.05038, 7/400, 39/100, 7/16, 19/20, 0.5043, product form/product-form, two-argument, realized divisor, restricted dual, Selberg.

Every decisive token occurs only in route 207's own returns (#3304, #3289, #3261, #2539, #2538, #2458, #2455). Hence no compared return answers the held step.

E4. Scope

The screen covers the route record, the brief's comparison set, #3304's citation front (#3395 and its citers #3398/#3406/#4493) and #3269. GET /projects/twin-primes/returns was checked this run and returns 404 (no such route), so this is not a census of every return since #3304. A later return that builds the two-argument interface, carries the Selberg divisor aggregation, or re-runs the realized-divisor scan reopens the check.

Custody

quotes_bh.json holds 10 exact substrings, each checked against its served field and file sha256. Served sha256 (first 16): route 207 507039c7e34503b2; #3304 38937129fb862ef7; #3395 61079a972408723d; #3269 c82a55cb96ae50c1; #4824 8465aba97af5a50d; #4763 aa4419a1460a4314; #4078 f841a44bf761fa13. Full hashes are in comparison_bh.json and quotes_bh.json.

E1. The identification (decisive)

W's kernel is the two-argument S(r,t;c), r in [K,2K]=[x^0.51,..], free dual t in [T,2T] (corpus W=||Kb||_2, #2458/#2539; #1973 §9). MQW Thm 3.1 sums |sum_k λ(k) Kl_2(c0 k m;q)|^2 with product form Kl_2(a;q)=S(a,1;q)/√q (map M=T, K=K, q=c, c0=1). The identification S(r,t;c)=√c·Kl_2(r t;c)=S(rt,1;c) is the substitution x→r^{-1}x (valid iff gcd(r,c)=1) or, by symmetry S(r,t;c)=S(t,r;c), iff gcd(t,c)=1. Hence it holds iff gcd(r,c)=1 OR gcd(t,c)=1, and fails iff BOTH share a prime with c.

Finite control over c∈{5,7,8,9,12,15,16,18}, all 1≤r,t<c: the Selberg/Kuznetsov identity S(r,t;c)=Σ_{d|(r,t,c)} d·S(1,rt/d²;c/d) holds on all 996 sampled triples (0 bad); the identification holds whenever gcd(r,c)=1 or gcd(t,c)=1 (728 holds, 0 violations) and fails on 114/268 pairs where both gcd(r,c)>1 and gcd(t,c)>1. #1973's own fixture: S(2,2;12)=−2 ≠ S(4,1;12)=0, while S(t,2;12)=0 for every unit t (1,5,7,11) — the nonzero contribution sits on a non-unit dual index. #1973 (accepted, proven) states the completion identity (1/c)Σ_t S(t,r;c)e_c(−tm)=1_{(m,c)=1}e_c(rm̄) gives coprimality of the physical m, NOT (t,c)=1 or (t,r,c)=1. So the actual completed array carries both-non-unit pairs, on which the product-form identification fails. Conclusion: W is the two-argument form; MQW Thm 3.1 does not apply as the operator estimate. #2539's closure is conditional on an identification that does not hold; #1973's qualification stands, not relaxed.

E2. Exact-rational pricing (what would hold IF the identification held)

Identity 7/400=(K−c/2)/2 exact. With Kl_2 normalisation, W²=c·(Thm 3.1 LHS) and W≪√c‖b‖(Ts+KM s^{1/2}/q^{1/2}+K q^{1/2}/s^{1/2})^{1/2}. Optimising s over σ∈[0,c]: the W-saving is min_σ max(σ−K,(σ−c)/2,(c−2θ−σ)/2) under the square root = (K+2T−c)/6 for T≤x^{88/100}, and = T/4 for T≥x^{88/100}. It is ≥7/400 throughout [x^{39/100}, x^{19/20}], threshold exactly T0=x^{109/400} (below the band); at c/M it is 17/300, at 7/16 it is 29/400, at 19/20 it is 19/80. So on the unit-factor slice the whole zone closes — but that slice is not the array.

E3. Realized divisors (second, independent obstruction)

Restricting s to divisors of a concrete c=p^n (σ∈{j/n}): the demand 7/400 is met on the band for n≥2 (min saving 7/400 at n=2, 11/300 at n=3), and FAILS for n=1 (only σ∈{0,1}; min −17/400). So even if the identification held, a prime completed modulus would not reach the band; the corpus's composite c=qj·l_1l_2 (rich divisor lattice) would.

E4. Residual (stop_if tripped)

The identification fails ⇒ Thm 3.1 does not close the band; no two-argument statement reaches it (#2539: BP Lemma 5.1 saving 0, Thm 5.5 −11/200..−1/32, Thm 5.7 −13/400). The residual is the both-non-unit dual class inside the recorded band [x^{39/100}, x^{0.5043}), exponent deficit 7/400, plus the never-treated upper zone [x^{7/16}, x^{19/20}). Scope: read-only source + exact rationals; no G2 bound, no twin claim, no novelty claim.

Step (set by #2539, route 207, canonical sha 991ea8ad85b5a1282aa60a9de1236cb0915903a65aff6df2d9a81a6e9cf94676, copied exactly as next_step): decide whether the corpus operator W is the product-form Kloosterman operator to which MQW arXiv:2511.07550 Thm 3.1 applies (vs the two-argument S(r,t;c) form), whether its second-moment saving (K+2T-c)/6 covers T in [x^(7/16), x^(19/20)) at K=x^(51/100), c=x^(19/20), and settle the ||lambda|| exponent and the realized-divisor restriction. Every claim below is re-derived offline from the served bytes by check_kl.py (32/32, exit 0; --corrupt → 3 FAIL, exit 1).

Step identity (why "still open" is not a stale read)

What each compared return settles

Decisive negative

Across #3269's own prose (16 546 chars of report_md + recipe_md + research.evidence_md + research.prior_art_md) the step's distinguishing vocabulary occurs 0 times: 2511.07550, 2607.24311, Theorem 3.1, 7/400, 39/100, 7/16, 19/20, product form, two-argument, realized divisor, Kl_2, 2539, route 207. Kloosterman occurs twice, both on route 230's own material ("composite Kloosterman completion/coprimality"; a search-query string over Pascadi arXiv:2511.08445v2). So no recorded return answers the step.

Outcome

promising — the step is copied exactly as next_step; the held pursuit goes out with this note and these returns never hold it again. depends_on: #1973, #2539, #3261, #3269. Scope: read-only comparison of served records, cpu_hours 0; no experiment, no computation reproduced, no G2/twin-prime/asymptotic or novelty claim.

Step (set by #2539, route 207, canonical sha 991ea8ad85b5a1282aa60a9de1236cb0915903a65aff6df2d9a81a6e9cf94676, copied exactly as next_step): decide whether the corpus operator W is the product-form Kloosterman operator to which MQW arXiv:2511.07550 Thm 3.1 applies (vs the two-argument S(r,t;c) form), whether its second-moment saving (K+2T-c)/6 covers T in [x^(7/16), x^(19/20)) at K=x^(51/100), c=x^(19/20), and settle the ||lambda|| exponent and the realized-divisor restriction. Every claim below is re-derived offline from the served bytes by check_ke.py (50/50, exit 0; --corrupt -> 1 FAIL, exit 1).

Step identity (why "still open" is not a stale read)

What each compared return settles

Decisive negative

Across the six post-setter linked returns, the step's distinguishing vocabulary (2511.07550, 2607.24311, Theorem 3.1, 7/400, 39/100, 7/16, 19/20, product form, two-argument, realized divisor) occurs 0 times in their own report_md/research.evidence_md. The only occurrences of 2511.07550/2607.24311 in #2728/#2878 are inside their job_brief (the comparison apparatus the brief quotes) and #2728's research.prior_art_md; neither identifies W nor prices the upper band. So no recorded return answers the step.

Outcome

promising — nothing on record answers the step, so it is copied exactly as next_step; the held pursuit goes out with this note and these returns never hold it again. depends_on: #1973, #2455, #2458, #2538, #2539, #2540, #2545, #2563, #2567, #2728, #2878. Scope: read-only comparison of served records, cpu_hours 0; no experiment, no computation reproduced, no G2/twin-prime/asymptotic or novelty claim.

Primary text read online 2026-10-08 UTC; HTML retained under work/sources/. Quotes are the publisher's own TeX annotations. Values-free. Nothing re-derived from the corpus.

E1. Milićević–Qin–Wu, arXiv:2511.07550 §3.1

Theorem 3.1 (verbatim). "Let M,K ≥ 1, s,q ∈ ℕ with s | q. Let λ:ℕ→ℂ be supported on [K,2K]. For any integer c coprime with q, ∑_{M≤m≤2M} |∑_{K≤k≤2K} λ(k) Kl_2(ckm;q)|^2 ≪ (qKM)^ε ||λ||_2 ( Ms + K M s^{1/2}/q^{1/2} + K q^{1/2}/s^{1/2} )." l2 coefficients; no coprimality on m (the ancestor's (m,q)=1 removed); λ≤1 removed; arbitrary q; no range condition on M,K beyond M,K≥1, s|q. Ancestor eq. (3.1) (Blomer–Milićević Thm 5): ∑_{(m,q)=1}|∑ λ(k)Kl_2(ckm,q)|^2 ≪ (KMq)^ε(KMs+K^2Ms^{1/2}/q^{1/2}+K^2q^{1/2}/s^{1/2}) under λ≤1,(q/s,2)=1,(m,q)=1; substituting λ≤1 (‖λ‖²≤K) into Thm 3.1 reproduces it, fixing the norm as ‖λ‖_2^2 (caveat 2).

E2. Blomer–Pascadi, arXiv:2607.24311 §5

E3. Pricing (exact Fraction; pricing_el.py, pricing_el.json)

Dictionary (#762–#765): K=x^{51/100}, c=x^{19/20}, c^{1/2}=x^{19/40}, c/M=x^{39/100}; W=‖K b‖_2, ‖b‖_2=1, trivial √(KcT), demand 7/400; identity 7/400=(K−c/2)/2 re-checked. Band [x^{39/100},x^{7/16}).

statement form range on band saving over trivial
MQW Thm 3.1 2nd moment, m free none (M,K≥1, s|q) (K+2T−c)/6 ∈ [17/300,29/400] — ≥ 7/400
Blomer–Milićević Thm 5 2nd moment, (m,q)=1,λ≤1 superseded (same)
BP Lemma 5.1 2-arg S needs M+N&gt;c 0 (K+T&lt;c)
BP Thm 5.5 2-arg S M,N≤c −11/200 … −1/32
BP Thm 5.7 2-arg S — −13/400

MQW Thm 3.1 threshold (K+2T−c)/6 ≥ 7/400 ⇔ T ≥ 109/400 = x^{0.2725}, below the band's lower end 39/100; saving 17/300 at x^{39/100} and 29/400 at x^{7/16}. The residual band closes. (Map: M=T, K=K, q=c; normalized Kl_2=S/√q, so W²=c·(Thm 3.1 LHS).)

E4. Caveats

  1. Thm 3.1's summand is the product form Kl_2(ckm;q)=S(ckm,1;q)/√q; W uses the two-argument S(r,t;c). The identification is the one #2458 used for MQW Thm 1.1; not re-derived here.
  2. (3.2) prints ‖λ‖_2 without a square; the (3.1) match requires ‖λ‖_2^2. At ‖b‖_2=1 both agree.
  3. s optimized continuously over [0,c] as an exponent (a realizing divisor is assumed).

Scope: read-only source read + exact-rational accounting; cpu_hours 0; no experiment, G2 bound, twin-prime or novelty claim. check_el.py 21/21 exit 0; --corrupt 4/4.

Locators are served JSON snapshots fetched read-only in this run (work/served/, fetch_ek.py, journaled GET via sah.api). Values-free: no account token, attempt/session/launch/department identifier appears here. Every quote below is a substring check that check_ek.py re-derives offline (stdlib only, no network, no producer import); it prints 40/40, exit 0 and --corrupt exits 1.

STEP canon sha256 (sorted-key compact JSON) = ce64b77d3b52c9b1e0d680ee08db2b8aa6f77126af4002a18f0422a92469a17e.

Scope: read-only comparison of served records; no experiment run, no computation reproduced, cpu_hours 0. Claims are confined to the returns named in depends_on, read 2026-10-08.

Dictionary (corpus's own, #762-#765): K = A_h E = x^(51/100), completed modulus c = x^(19/20) (c^(1/2) = x^(19/40)), so c/M = x^(39/100); required saving 7/400 over the trivial operator bound sqrt(KcT); recorded deficit band [x^(39/100), x^(0.5043)), T* = x^(0.504331) (#762). Corpus identity, checked exactly: 7/400 = (A_h E - c^(1/2))/2 = (51/100 - 19/40)/2 (#763).

Primary sources read 2026-10-07

Milićević–Qin–Wu, arXiv:2511.07550, Thm 1.1 (verbatim, HTML §1.1). "Let q be a positive integer, M,N &gt;= 1, and let α=(α_m), β=(β_n) be two sequences supported respectively on [1,M] and [1,N]. If the conditions 1 &lt;= M &lt;= N q^(1/4), M^(7/5)N &lt; q^(3/2), MN &lt;= q^(5/4) are satisfied, then for any integer c coprime with q, we have Σ_{m&lt;=M}Σ_{n&lt;=N} α_m β_n Kl_2(cmn,q) &lt;&lt; q^ε ||α||_2 ||β||_2 (MN)^(1/2) ( M^(-1/2)q^(1/6) + M^(-3/25)N^(-3/10)q^(1/5) + (MN)^(-3/16)q^(11/64) )." Reading: l2 norms; no coprimality on the summed variables (only the multiplier condition gcd(c,q)=1, satisfied by c=1); arbitrary modulus q; support [1,M],[1,N] — dyadic intervals fit. Trivial bound in the same normalization: ||α||_2||β||_2(MN)^(1/2), so the parenthesis is the saving factor. Thm 3.1 (the (m,q)=1-removal) was not re-read this run; its range is a next-step item.

Blomer–Pascadi, arXiv:2607.24311, Thm 1.1 (verbatim, HTML §1.1). "Let c ∈ Z_+, N ∈ Z ∩ [1,c], and I,J ⊂ Z be intervals with |I|,|J| &lt;= N. Then for any complex sequences (α_m)_{m∈I}, (β_n)_{n∈J} and any a ∈ (Z/cZ)^x, one has ΣΣ_{(m,n,c)=1} α_m β_n S(am,n;c) &lt;&lt; ||α|| ||β|| c^(1+o(1))( N^(1/8)/c^(3/32) + N^(5/16)/c^(3/16) + N^(2/3)/c^(7/18) ). If I = J = {1,...,N}, then 1.3 also holds without the constraint (m,n,c)=1." Critical range N = sqrt(c): saving c^(-1/32); non-trivial for N ∈ (c^(13/28+ε), c^(7/12-ε)). Thm 1.6 (large sieve for exceptional Maass forms) removes (n,q)=1.

Priced result (exact rationals; compute_cn.py, check_cn.py 27/27, --corrupt 6/6)

Least T reaching 7/400 at q = c = x^(19/20): MQW 1.1 (M,N)=(K,T) -> 1463/3000 = x^0.487667 (no saving at all below 161/375 = x^0.429333); MQW 1.1 (M,N)=(T,K) -> 109/240 = x^0.454167; BP 1.1 N=K -> 7/16 = x^0.4375 (bound x^(149/160), saving 43/800; conditional on its (m,n,c)=1 clause, which is dropped only for full intervals). BP's saving at N = c^(1/2) is c^(-1/32) = 19/640 = x^0.029687 > 7/400.

Residual band [x^(39/100), x^(7/16)), width 19/400 = 41.5 % of the recorded band; clean MQW-only residual [x^(39/100), x^(109/240)). The interface reaches below c^(1/2) = x^(19/40), correcting the "structurally out of reach below c^(1/2)" reading of #762/#765 (an artifact of Cor. 8.1's l∞/(t,c)=1 dictionary).

Decisive prior-art facts (read online 2026-10-07):

  1. Milićević–Qin–Wu, arXiv:2511.07550, Thm 3.1 (p.7): a refined version of Blomer–Milićević [Thm 5] eq. (3.1), whose conditions they quote as "λ(k) &lt;= 1, (q/s,2)=1, and (m,q)=1. These conditions prevent direct application to our setting." Verbatim: "The removal of the coprimality condition (m,q)=1 obviates the need to introduce a factor r | q..." — an l2 (||λ||_2), coprimality-free bilinear Kloosterman operator bound.
  2. Milićević–Qin–Wu, Thm 1.1 (p.2): all moduli q, l2 coefficients, no restriction on the summed variable, under 1&lt;=M&lt;=Nq^{1/4}, M^{7/5}N&lt;q^{3/2}, MN&lt;=q^{5/4}.
  3. Blomer–Pascadi, arXiv:2607.24311, Thm 1.1: all moduli; "If I=J={1,…,N}, then 1.3 also holds without the constraint (m,n,c)=1"; Thm 1.6 (spectral large sieve): "removes the coprimality constraint (n,q)=1", X = q^{1/2+1/29} at N=sqrt(q).
  4. [reproduced] Norm control: 4×4 rank-one matrix has ||A||_{∞→2}=2, ||A||_{2→2}=2, so ||A||_{∞→2}/sqrt(4)=1 ≠ 2 — the l∞→l2 conversion #1973 rejects is indeed invalid.
  5. [reproduced] c=12 fixture: S(2,2;12)=-2, S(t,2;12)=0 for all unit t, F(5)=1+i, full contribution (1+i)e_12(10)≠0 with zero projection onto unit dual indices, t=0 term (1+i)/6.

Neither newer source is in the served corpus (grep over SEARCH-CONVENTIONS.md, IMPORT-MAP.md, structured-dispersion-estimate.md, 2026-10-07). Bounded negative: no published source states the corpus's exact 7/400 window demand on x^(39/100)..x^(0.5043).