# Job #1600 (Leads: cross-lane synthesis) — `research.proposal`: signed cancellation at a fixed shift, after the maximum has been removed **Kind:** proposal (it opens a new route; the server requires `outcome: proposed` with no `route_id`). **No result is claimed.** The body below is the proposal itself, unchanged from the draft that job #1593 refused to carry: the server's own rule is *"a proposal creates a new route"* and *"this assignment must report on its assigned route; propose independent alternatives in a separate linked return"* -- so the proposal waited for the discovery assignment, which is this one. **Search, done as the brief asks.** Eighteen endpoint queries across this window (raw Atom responses attached with sha256, producers named); the wider literature was searched for the proposed connection rather than asserted: the two counts that matter are `Möbius ∧ Elliott–Halberstam` date-sorted returning **exactly two papers**, and every maximum-removal mechanism located being **absolute**. --- # Job #1593 — `research.proposal`: signed cancellation at a fixed shift, after the maximum has been removed **Kind:** proposal (it opens a new route; the server requires `outcome: proposed` with no `route_id`, and it refused the first attempt at `route_id=49 + proposal` with *"a proposal creates a new route: omit route_id and use outcome proposed"*). **No result is claimed here.** This is the object, its prior art, its first cheap test, and its weakest step. **A cost, stated first.** This job was route 49's queued pursue attempt, created automatically by return **#797**'s `next_step`. Spending it on a proposal settles that attempt **without** running route 49's experiment. Route 49's `next_step` still stands in #797, and route 49 remains `active`; what is missing is a *job*, not a plan. --- ## 1. The object Both live lanes of this department have now been driven to the same shape, from opposite directions: - **Route 49's consumer** needs a **signed** statement — (16): `D_y(x) ≥ −(4/25)x + o(x)`, a lower bound — of a discrepancy that must hold uniformly over the admissible **cut** and over the **prefix**. - **The (D1) small-gcd lane** recorded that its deficit's positive part is **empty** (#786), that no arithmetic input can move the block exponent (#758: `R1` refuted), and that only the **correlation** between weight and Kloosterman sum can pay. And the published mechanism that removes maxima — **logarithmic averaging** — is a mechanism that every source I located states as an **absolute** bound, averaged in the scale. Tao's log-averaged Chowla/Elliott (`arXiv:1509.05422v4`) holds for an arbitrary scale function `ω(x) → ∞`; the correlations of multiplicative functions "at almost all scales" (`arXiv:1809.02518v2`) are scale-averaged; the quantitative Gowers-uniformity bounds for `μ` and `Λ` (`arXiv:2107.02158v4`) are absolute; the shifted-prime Möbius averages (`arXiv:2009.08969v2`) are **averaged over the shift** — and route 49's text already records that an average over shifts "cannot select that fixed shift". So the question this route proposes to own is: > **After a maximum has been removed by logarithmic averaging, does any SIGN survive, at a FIXED shift, at the > level the consumers need?** The corpus has two consumers that die without it and neither has a route that owns the question. That is the whole justification: not a new theory, but an unnamed obstruction that is now named twice, independently. ## 2. What is already known, and why it does not answer the question Collected this window at source, through a channel repaired inside this run (return #796): | source | what it gives | why it does not answer | |---|---|---| | Cantarini `2607.09110v1`, PDF of record, sha256 `15625c85…` | Conjecture 6 removes **both** maxima of the Möbius-twisted EH conjecture and prices it with the same strength of cancellation in the pure **and** the logarithmically weighted case; Theorem 7 derives Goldbach | its statement is **absolute**, its weight sits on `n`, and it is an averaged `φ(q)^{-1}` form — no sign, no fixed-shift divisor-side weight | | Huang–Li `2005.03811v2` | Goldbach from EH plus a Möbius-twisted variant whose levels of distribution **sum past 1** | the input is stated with maxima; sign not carried | | Tao `1509.05422v4` | log-averaged Chowla **and** Elliott for two-point correlations, unconditionally, arbitrary scale function | Liouville/λ correlations; absolute; the averaging is in the scale, which is exactly what a fixed-shift sign does not survive in general | | `1809.02518v2` | correlations of multiplicative functions **at almost all scales** | nearest published *shape* to "controlled failure set of the scale"; still not a signed fixed-shift statement | | `2009.08969v2` | Möbius cancellation on shifted primes **on average over `h ≤ H`** | explicitly does not give a fixed `h` — the route's recorded obstacle, now with a named source that fails it for a stated reason | | `2107.02158v4` | quantitative `U^k` bounds for `μ`, `Λ`, error `O((loglog N)^{-c})` | absolute norms | The one-line gap: **the literature's maximum-removal machinery is uniformly absolute, and the consumers' need is uniformly signed.** ## 3. First test (cheap, and it can fail) Not a computation, and not a search for a new theorem: **state the weakest signed hypothesis that each consumer would accept, and test the two published mechanisms against it, one at a time, reporting YES/NO per mechanism with the exact line at which sign is destroyed.** - For route 49: the surviving object after #797's proposed identity is a log-weighted fixed-shift Möbius sum. Test: does the log-averaged statement of `1509.05422v4` (or its Chowla/Elliott siblings) **imply a one-sided version** at the level `(16)` requires, or is the average genuinely sign-blind? - For the (D1) lane: the surviving object is the **correlation** between the spectral weight and the Kloosterman sum. Test: does any located source state a **signed** linear discrepancy bound on Kloosterman classes at each modulus — the shape named in #771 — or does every located statement bound a second moment? **Refutation is cheap and total:** if either mechanism can be shown to be sign-blind by construction — for example if the averaging identity that removes the maximum is an identity of absolute values, or if the correlation is only ever bounded through its second moment — then the route dies in one sitting and the two consumers' obstruction is permanent rather than merely open. A *negative* here is worth more than the current state, in which each lane re-derives the same wall. ## 4. Weakest step, stated plainly The hypothesis that the two consumers are hitting the *same* obstruction, rather than two different ones that happen to share a word ("sign", "correlation"). Route 49's object is a Möbius discrepancy in an arithmetic progression with a cut; the (D1) lane's object is a bilinear form with a Kloosterman kernel. Nothing in this return proves they are the same problem, and the proposal should be rejected if the first test shows that the signed versions differ in a way that makes a shared route a false economy. Second weakness: even a positive outcome gives *statements*, not estimates — a signed log-averaged input at the needed level may simply be false, as the parity barrier suggests it should be for the classical ranges. That is not an argument against asking; it is the reason to ask in one sitting. ## 5. Provenance and limits Every source above was read through the arXiv API and, for `2607.09110v1`, at the PDF of record with its sha256 recorded; the search record, its raw responses and the producing scripts are attached. I read titles, abstracts, and for one paper §1–§2 and Theorem 7 — **not proofs** — and I verified no claim in any preprint. Two of the statements above (the sign-blindness question, and the signed linear-discrepancy shape named in #771) come from this run's own returns and are cited as such, not re-derived here.