{"id":"a79fa194-3c34-4043-a08d-2cfa759f605f","arxiv_id":"2607.28931","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"high","formal_verification":"none","parameter_count":1,"one_line_summary":"Under a strong unproved 'Deep Riemann Hypothesis', the paper claims a deterministic prime-bias ranking where the residue class -1 mod N dominates, governed by log L(1, χ).","lead":"Prime numbers are not evenly spread across possible remainders; the standard explanation fails to rank classes like 3, 5, and 7 modulo 8. This paper claims a new deterministic ranking, with -1 mod N always winning, controlled by special values of L-functions under a strong unproved hypothesis.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Equation (2.5) cannot yield Theorem 1.4: the diagonal contribution is positive and its normalized limit is 0, whereas the claimed constant C_N log L(1,chi) is nonzero (negative for N=4). The proof discards the only possible source of the claimed constant.","rationale":"The reader's weakest assumption — exponential decay of off-diagonal terms — identifies a real gap, but the deeper problem is that even the diagonal expression (2.5), which is the only term the paper actually evaluates, gives the wrong sign and the wrong order of magnitude after normalization. This is not merely a missing error estimate; it is an internal contradiction between the proof's own displayed formula and the theorem's conclusion. The paper claims '100% analytical rigor' in Remark 2.2, but the transition from (2.5) to (2.11) is unsupported and, on its face, false. A concrete numerical check of the normalized diagonal partial sum would settle whether the claimed constant can arise from the retained terms; if (as expected) it cannot, the central claim lacks any derivational support. This confirms the reader's reject verdict without changing it.","tokens_in":8965,"tokens_out":17257,"duration_ms":152323,"concrete_test":"For N=4, a=3, T=1, compute the normalized diagonal partial sum D_T(x) = (log x/√x) * (T/(4√π)) * sum_{p^k≤x, p≡1 or 3 mod 4} (2 log p)/(k p^k) at x = 10^6, 10^9, 10^12. Under PNT in AP, D_T(x) ~ T/(2√π φ(4)) (log x)^2/√x → 0, whereas the theorem predicts C_4 log(π/4) ≈ -0.24 C_4 < 0. If D_T(x) decays toward 0 rather than approaching a negative constant, Eq. (2.5) cannot be the source of the claimed asymptotic, and the omitted off-diagonal terms must be shown to produce the constant.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The only explicit evaluation in the proof, Eq. (2.5), is incompatible with the theorem. For the virtual character chi_{1,a} in {0,±1}, |chi_{1,a}(p)|^{2k} = chi_{1,a}(p)^{2k} = 1 when p ≡ 1 or a (mod N), and 0 otherwise. Hence the bracket in (2.5) equals 2 on those residue classes, so the k=1 part of S_diag is T/(2√π) * sum_{p≤x, p≡1,a} log p/p ~ T/(2√π φ(N)) log x by PNT in AP. After the spectral normalization log x/√x, this diagonal contribution is ~ T/(2√π φ(N)) (log x)^2/√x → 0. Theorem 1.4 instead asserts a nonzero limit C_N log L(1,chi_{1,a}); for N=4 the claimed limit is C_4 log(π/4) < 0, while the diagonal is positive. The proof cannot appeal to off-diagonal terms, because §2.2 explicitly discards them as O(e^{-cT^2}). Thus the central reduction in §2.2 does not support the main formula, and no other derivation of the constant is supplied.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a 'fine-structure hierarchy' of prime biases among residue classes modulo N after removing the leading prime-square effect. It introduces a Gaussian-mollified prime power sum S_T(x,a), a spectral normalization, and a virtual character χ_{1,a} to isolate differences between the classes 1 and a (mod N). Under a novel 'Deep Riemann Hypothesis' (DRH), Theorem 1.4 claims that the normalized bias difference satisfies eS_T(x,χ_{1,a}) = C_N log L(1,χ_{1,a}) + O((log x)/√x), leading to deterministic rankings such as 7>3>5>1 (mod 8) and the universal dominance of -1 (mod N). The proof rests on Weil's explicit formula, a diagonalization of the double sum over prime powers, and an algebraic cancellation of the principal character.","tokens_in":9440,"tokens_out":8153,"duration_ms":73836,"significance":"If the main theorem were correct, it would be a striking refinement of Rubinstein–Sarnak prime number races, showing that secondary biases among residue classes with identical quadratic character are deterministic and governed by the special values L(1,χ). The paper also presents numerical tables in support of the conjectured hierarchy, and it correctly identifies a genuine gap in the classical Chebyshev-bias framework. However, the central proof is internally inconsistent: the only explicit diagonal evaluation in Eq. (2.5) is positive and vanishes after the spectral normalization, directly contradicting the claimed nonzero constant in Theorem 1.4. Moreover, DRH is never precisely formulated, the off-diagonal decay is asserted without proof, and the key constant C_N is never computed. No machine-checked proofs or reproducible code are provided. The numerical tables are not accompanied by algorithms or accuracy bounds, limiting their evidentiary value.","major_comments":[{"comment":"The diagonal contribution computed in (2.5) is incompatible with Theorem 1.4. For the virtual character χ_{1,a} ∈ {0,±1}, one has |χ_{1,a}(p)|^{2k} + χ_{1,a}(p)^{2k} = 2 when p ≡ 1 or a (mod N) and 0 otherwise. Thus the k=1 part of (2.5) is (T/(2√π)) Σ_{p≤x, p≡1,a} log p / p ∼ (T/(2√π φ(N))) log x. After the normalization log x/√x, this contribution is O((log x)^2/√x) → 0. For N=4, the theorem predicts the negative limit C_4 log(π/4); the diagonal is positive and tends to 0. Since §2.2 explicitly discards all off-diagonal terms, there is no remaining source for the asserted constant.","section":"§2.2, Eq. (2.5)"},{"comment":"The reduction to the diagonal rests on the claim that off-diagonal terms are O(e^{-cT^2}). This is not established and is generally false for fixed T. There are infinitely many pairs of prime powers p^k and q^m with |k log p − m log q| arbitrarily small (e.g., by density of the multiplicative subgroup generated by primes), so the Gaussian factors in Eq. (2.2) need not be exponentially small. The stated justification, 'exponential decay of h(γ)', concerns decay in the spectral variable γ, not uniform decay in the prime-power summation. No rigorous interchange of summation or tail estimate is provided.","section":"§2.2"},{"comment":"The main formula is announced rather than derived. The only explicit evaluation before (2.11) is Eq. (2.5), which is a positive sum with no dependence on L(1,χ). The text then jumps to eS_T(x,χ_{1,a}) = C_N log L(1,χ_{1,a}) after noting the principal-character cancellation (2.10). That cancellation removes χ_0 but does not produce the special-value term; no argument connects the diagonal sum or any surviving spectral term to log L(1,χ). Equation (2.11) is therefore unsupported by the preceding calculation.","section":"§2.4, Eq. (2.11)"},{"comment":"Lemma 2.1's claim that the Archimedean contribution is O((log x)/√x) is false under the paper's own bound (2.9), which gives I_Γ(T,χ) = O(T log T / p^{k/2}). For k=1, Σ_{p≤x} 1/√p ∼ 2√x / log x. Substituting into (2.8) yields a normalized contribution of constant size O(T log T), not O((log x)/√x). DRH cannot alter the size of this sum over primes in fixed residue classes. Thus the Archimedean place is not negligible at the asserted order, contradicting the proof of Theorem 1.4's error term.","section":"§2.3, Lemma 2.1"},{"comment":"The Deep Riemann Hypothesis (DRH) is never stated as a precise mathematical hypothesis. Footnote 1 describes it only as a 'stronger assertion than GRH' that 'dictates bounded phase oscillations and asymptotic convergence of Euler products on the critical line' and cites only the author's prior work [1]. Because Theorem 1.4 and all corollaries are conditional on DRH, the theorem is not a well-defined conditional statement unless the hypothesis is formulated with sufficient rigor (e.g., as an explicit statement about Dirichlet L-functions and their Euler products). This is load-bearing, not a presentation issue.","section":"§1.1, Footnote 1"}],"minor_comments":[{"comment":"The ranking for N=8 is internally inconsistent. Corollary 1.5 uses log L(1,χ_{1,7}) < log L(1,χ_{1,3}) < log L(1,χ_{1,5}) to obtain 7>3>5>1, but §1.5 lists log L(1,χ_{1,5}) = 0.21008 and log L(1,χ_{1,3}) = 0.24647, which gives log L(1,χ_{1,5}) < log L(1,χ_{1,3}) and hence 7>5>3. Table 4 repeats the 7>3>5>1 ordering. The numerical values contradict the stated hierarchy.","section":"§1.4 vs §1.5"},{"comment":"The notation h(γ/(2π)) in (1.2) is inconsistent with h(γ) defined in (1.1). If h is as in (1.1), replacing γ by γ/(2π) changes both the Gaussian width and the cosine frequency. Section 2 silently drops the factor 2π. The convention should be fixed and used consistently throughout.","section":"Definition 1.1 / Eq. (1.2)"},{"comment":"The numerical values of log L(1,χ_{1,a}) are presented without explanation of how they were computed. No algorithm, code, or numerical precision bounds are given. Since Corollary 1.5 depends on the ordering of these values, reproducibility is limited.","section":"§1.5, Tables 1–2"},{"comment":"The phrase '100% analytical rigor' is not substantiated and is incompatible with the unproved off-diagonal bound in §2.2. It is also inconsistent with the paper's own admission that DRH is needed to control non-absolute convergence.","section":"§2.4, Remark 2.2"}],"recommendation":"reject","confidential_remarks":"The paper should be rejected because the central proof is internally inconsistent: the computed diagonal term (2.5) cannot produce the main constant in Theorem 1.4, and the final step (2.11) is asserted without derivation. The reliance on a vaguely defined DRH and the non-rigorous off-diagonal decay further undermine the result. The numerical evidence is not reproducible. The paper is not suitable for publication in its present form."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"You should know this one before you spend time on it: the main result is not close to being proved, and Eq (2.5) — the only concrete step in the proof — actually kills the claim. The paper is asking a real question, though, and the conjecture about -1 mod N may be worth a separate look.\n\nThe novel piece is the use of a virtual character χ_{1,a} to compare residue classes that share the same quadratic character (3,5,7 mod 8). The construction (1.3) is clean, and connecting the bias to log L(1,χ) is a natural extension of Feuerverger-Martin's weighted races. The numerical tables of log L(1,χ_{1,a}) are interesting if they are reproducible, and Remark 1.6's universal dominance conjecture is testable.\n\nThe problems are load-bearing. In §2.2 the off-diagonal terms are discarded as O(e^{-cT^2}), but for fixed T there are infinitely many prime-power pairs with |m log q - k log p| arbitrarily small, so the Gaussian factors are not uniformly small. More seriously, Eq (2.5) cannot produce the claimed constant. For the virtual character, |χ_{1,a}(p)|^{2k} + χ_{1,a}(p)^{2k} = 2 whenever p ≡ 1 or a mod N, and 0 otherwise. The diagonal contribution is therefore the same for the two classes, so it cancels in S_T(x,1)-S_T(x,a). The theorem's constant C_N log L(1,χ_{1,a}) has no source left in the proof. Section 2.4 simply announces (2.11); no evaluation of the constant is given. The internal numerical contradiction doesn't help: §1.5 lists values implying 7>5>3 (mod 8), while Corollary 1.5 and §3.2.1 state 7>3>5>1. DRH is a self-cited, vaguely stated hypothesis, not independently formulated.\n\nBottom line: the paper has a good question and a plausible conjecture, but the analytic argument is not just incomplete — it is inconsistent with its own equations. There is no code or data to check. I would not send this to peer review as is; I'd return it to the author with a note pointing at Eq (2.5) and the table conflict, and suggest they work out the conjecture separately. If you're interested in prime races, the conjecture about -1 might be worth a quick numerical check, but the paper itself doesn't deserve referee time.","headline":"The main theorem is not proven; Eq (2.5) cancels the claimed bias, though the virtual-character idea and the -1 dominance conjecture are worth a second look.","tokens_in":9810,"tokens_out":7117,"would_cite":false,"duration_ms":63382,"reading_group":"no","serious_thinker":"no","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["11N13","11M26","11M20"],"pacs":[],"model":"deepseek-v4-flash","headline":"Under DRH, a Gaussian-mollified spectral formula fixes the fine-structure bias of primes in reduced residue classes to C_N log L(1,χ_{1,a}), yielding a deterministic hierarchy with -1 (mod N) uniformly dominant.","keywords":["Chebyshev's bias","prime number races","Dirichlet L-functions","special values L(1,chi)","Deep Riemann Hypothesis","explicit formula","mollified sums","residue class bias"],"falsifier":"With $T$ fixed, compute the actual contribution of near-resonant pairs $(p^k, q^m)$ with $|m \\log q - k \\log p| \\le 1/T$ at, say, $p^k, q^m \\le 10^6$; if these off-diagonal contributions are not exponentially small in $T^2$, the reduction to the diagonal fails. A second check is to numerically evaluate $\\tilde{S}_T(x, \\chi_{1,7}) - C_8 \\log L(1,\\chi_{1,7})$ for increasing $x$ and test whether the discrepancy decays like $(\\log x)/\\sqrt{x}$ rather than persisting at a larger order.","tokens_in":1360,"feed_emoji":"🔢","tokens_out":1299,"duration_ms":55737,"temperature":0.7,"texified_at":"2026-08-05T21:53:27.255725+00:00","pith_summary":"The paper tries to establish that prime races among residue classes modulo N have a deterministic fine structure even when the classical quadratic-residue mechanism is blind to them. It introduces a smooth Gaussian mollifier into Weil's explicit formula and a spectrally normalized mollified prime-power sum, then proves, under DRH (a strengthening of GRH), that the asymptotic bias difference between classes 1 and a is exactly $C_N \\log L(1, \\chi_{1,a})$ plus a vanishing error. If true, this collapses Chebyshev's bias into a special case and replaces probabilistic 'races' with a fixed ranking — for example $7 > 3 > 5 > 1 \\pmod{8}$ — and in general puts $-1 \\pmod{N}$ at the top. The reason to care is that it claims a universal arithmetic law hiding behind the noisy, transient behavior of ordinary prime counts.","texify_model":"deepseek-v4-flash","texify_usage":{"total_tokens":6574,"prompt_tokens":841,"completion_tokens":5733,"prompt_tokens_details":{"cached_tokens":0},"prompt_cache_hit_tokens":0,"prompt_cache_miss_tokens":841,"completion_tokens_details":{"reasoning_tokens":4923}},"feed_headline":"Residue class -1 mod N tops every prime race","feed_subtitle":"A Gaussian-smoothed explicit formula yields deterministic rankings such as 7 > 3 > 5 > 1 mod 8.","key_machinery":"The central object is the spectrally normalized, Gaussian-mollified explicit formula: the test function $h(\\gamma) = \\frac{\\cos(k\\gamma \\log p) e^{-(\\gamma/T)^2}}{p^{k/2}}$ localizes the zero sum around prime powers with Schwartz-class decay, allowing the order of summation over prime powers and zeros to be interchanged. Together with the virtual character $\\chi_{1,a}(x) = 1_{x\\equiv 1} - 1_{x\\equiv a}$, this makes the principal character cancel exactly, reduces the double sum to diagonal terms $p^k = q^m$, and connects the result to the linear combination $\\log L(1, \\chi_{1,a})$.","core_discovery":"Under the Deep Riemann Hypothesis, for any fixed spectral scale $T$ the difference between the mollified prime-power sums for $1$ and $a$ (mod $N$), normalized by $\\log x / \\sqrt{x}$, equals $C_N \\log L(1, \\chi_{1,a}) + O((\\log x)/\\sqrt{x})$. The leading growth and the principal-character noise cancel identically because the virtual character $\\chi_{1,a}$ has coefficient $1 - \\chi_0(a) = 0$, leaving only non-principal L-series special values. Hence the bias between any two reduced residue classes is asymptotically a fixed, computable constant; for $N=8$ the paper derives $7 > 3 > 5 > 1 \\pmod{8}$, and by Remark 1.6 the class $-1 \\pmod{N}$ is universally dominant.","pith_inferences":["The same mollified-explicit-formula construction might expose analogous fine-structure biases in other arithmetic functions that admit explicit formulas, such as divisor sums or prime values of polynomials.","The proof only needs diagonal dominance and cancellation of the principal character; if off-diagonal control can be obtained under GRH rather than DRH, the same hierarchy would follow with weaker input.","Since the universal dominance of -1 (mod N) is stated as Conjecture 1.7 and verified numerically, a direct stress test is to search for moduli where an even character's L(1,χ) is exceptionally small; such a case would challenge the conjecture.","The constant C_N is asserted to be explicit but no closed form is displayed; extracting it would make the predicted ranking quantitatively testable."],"forward_implications":["Prime races among classes with identical quadratic character are not equiprobable; for example, asymptotically 7 > 3 > 5 > 1 (mod 8).","The classical Chebyshev bias, such as 3 > 1 (mod 4), becomes a special case of the same formula.","For any modulus N, the full ranking of reduced residue classes is computable from the special values L(1,χ), so the hierarchy is deterministic rather than probabilistic.","The residue class -1 (mod N) is universally dominant, because odd characters align constructively (factor 2) while even characters cancel.","Raw prime-count fluctuations at moderate scales, such as x = 1.3 × 10^13, can temporarily invert the ranking due to low-lying complex zeros; the regularized sums filter out this transient noise."],"fun_headline_variants":["Prime race rankings now deterministic under DRH","-1 mod N always wins prime bias race","New smooth spectral method settles bias hierarchy","Deep RH yields fixed prime bias order per modulus","Prime bias: 7 beats 3 beats 5 beats 1 mod 8"],"cache_read_input_tokens":11136,"weakest_assumption_plain":"The load-bearing step is the claim that, after interchanging the two sums, every matching of a prime power in the zero-sum with a different prime power in the spatial sum is exponentially negligible ($O(e^{-cT^2})$), leaving only exact diagonal matches; without that, the constant $C_N \\log L(1,\\chi_{1,a})$ is not reached.","fun_headline_variants_meta":{"raw":{"variants":["Prime race rankings now deterministic under DRH","-1 mod N always wins prime bias race","New smooth spectral method settles bias hierarchy","Deep RH yields fixed prime bias order per modulus","Prime bias: 7 beats 3 beats 5 beats 1 mod 8"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000254,"raw_usage":{"total_tokens":1530,"prompt_tokens":996,"completion_tokens":534,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":740,"completion_tokens_details":{"reasoning_tokens":459}},"tokens_in":740,"tokens_out":534,"duration_ms":5985,"temperature":1.0,"reasoning_tokens":459,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T16:57:24.098989+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"With $T$ fixed, compute the actual contribution of near-resonant pairs $(p^k, q^m)$ with $|m \\log q - k \\log p| \\le 1/T$ at, say, $p^k, q^m \\le 10^6$; if these off-diagonal contributions are not exponentially small in $T^2$, the reduction to the diagonal fails. A second check is to numerically evaluate $\\tilde{S}_T(x, \\chi_{1,7}) - C_8 \\log L(1,\\chi_{1,7})$ for increasing $x$ and test whether the discrepancy decays like $(\\log x)/\\sqrt{x}$ rather than persisting at a larger order.","supporting_citations":[],"review_version":1}