Pith. sign in

REVIEW 2 major objections 2 minor 9 references

Reviewed by Pith at T0; open to challenge.

T0 means a machine referee read the full paper against a public rubric. The mark states how deep the mechanical check went, never who wrote it. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.3

Smoothing techniques bound |ζ(1+it)| by (1/2) log t + 1.57 for t ≥ 3.

2026-07-03 18:36 UTC pith:DWN45BIM

load-bearing objection The paper sharpens two explicit bounds on |ζ(1+it)| by smoothing an integral from the Riemann-Siegel formula instead of using the triangle inequality, but the claimed constants rest on tight control of the smoothing remainders. the 2 major comments →

arxiv 2607.01424 v1 pith:DWN45BIM submitted 2026-07-01 math.NT

Utilizing Smoothing Techniques to Bound |zeta(1+it)|

Andrew Christensen , Kyle Pratt This is my paper
classification math.NT MSC 11M06
keywords Riemann zeta functionexplicit boundsRiemann-Siegel formulasmoothing techniquesDirichlet series
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes improved explicit upper bounds for |ζ(1+it)| on the line Re(s)=1 by replacing the direct triangle inequality with a smoothed version of the integral representation from the Riemann-Siegel formula. This averaging reduces the peak contribution of oscillatory terms enough to produce fully numerical constants. The resulting inequalities are |ζ(1+it)| ≤ (1/2) log t + 1.57 for all t ≥ 3 and the sharper |ζ(1+it)| ≤ (1/3) log t + 2 log log t − 1.16 for t ≥ 10^8. A sympathetic reader cares because these bounds are ready for immediate insertion into arithmetic estimates that require concrete control of zeta on the 1-line.

Core claim

By introducing a smoothing operator into the integral representation coming from the Riemann-Siegel formula, the maximum contribution of the integrand is reduced enough to prove |ζ(1+it)| ≤ (1/2) log t + 1.57 for all t ≥ 3 and the stronger |ζ(1+it)| ≤ (1/3) log t + 2 log log t − 1.16 for t ≥ 10^8.

What carries the argument

Smoothing operator applied to the Riemann-Siegel integral representation, which replaces the triangle inequality with an averaged bound that controls oscillations more tightly.

Load-bearing premise

The smoothing function is chosen so that the resulting explicit bound from the integral has no additional error terms that would cancel the improvement over the unsmoothed case.

What would settle it

Numerical evaluation of |ζ(1 + it)| at any t = 10^9 that exceeds (1/2) log(10^9) + 1.57 would disprove the first stated bound.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • The stated inequalities hold uniformly for every real t in the given ranges.
  • The constants are fully explicit and numerical, with no unspecified O(1) terms remaining.
  • The method applies the same Riemann-Siegel starting point as earlier work but obtains smaller leading coefficients through the smoothing step.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Further refinement of the smoothing kernel could potentially lower the leading coefficient below 1/3 for even larger t ranges.
  • The explicit constants allow direct substitution into error-term estimates for the prime-counting function π(x) without additional logarithmic losses.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 2 minor

Summary. The manuscript claims to prove sharpened explicit upper bounds on |ζ(1+it)| for t ≥ 3 by replacing the triangle inequality with a smoothing operator applied to an integral representation obtained from the Riemann-Siegel formula. The stated results are |ζ(1+it)| ≤ (1/2) log t + 1.57 for t ≥ 3 and |ζ(1+it)| ≤ (1/3) log t + 2 log log t − 1.16 for t ≥ 10^8.

Significance. If the error analysis is complete, the explicit constants would improve upon prior triangle-inequality bounds and supply usable numerical estimates for applications in analytic number theory that require concrete majorants. The methodological choice of smoothing is standard but here yields tighter additives than previous work.

major comments (2)
  1. [derivation of the smoothed integral representation] The central claim rests on showing that every remainder arising from the smoothing kernel, cutoff, and integration by parts is absorbed into the additive constants 1.57 and −1.16 without exceeding them. This verification is load-bearing for the explicit bounds, especially near t = 3 and t = 10^8, and must appear explicitly in the derivation that follows the Riemann-Siegel truncation.
  2. [choice of smoothing operator and parameter selection] The paper must demonstrate that the smoothing function and its parameters are chosen independently of the target bound (i.e., no post-hoc adjustment of constants to fit the claimed inequalities). Any dependence would reduce the result to a numerical observation rather than a proved estimate.
minor comments (2)
  1. Clarify the precise form of the smoothing kernel (e.g., its support and decay) already in the abstract or introduction.
  2. Add a short table or paragraph comparing the new constants with the best previously published explicit bounds at the same t-values.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments on our manuscript. We address each major comment below and are prepared to revise the paper accordingly to improve the clarity of the error analysis.

read point-by-point responses

  1. Referee: [derivation of the smoothed integral representation] The central claim rests on showing that every remainder arising from the smoothing kernel, cutoff, and integration by parts is absorbed into the additive constants 1.57 and −1.16 without exceeding them. This verification is load-bearing for the explicit bounds, especially near t = 3 and t = 10^8, and must appear explicitly in the derivation that follows the Riemann-Siegel truncation.

    Authors: We agree that the absorption of all remainder terms into the stated additive constants must be verified explicitly, particularly at the boundary values t=3 and t=10^8. The full derivation appears in Sections 3–4 following the Riemann-Siegel truncation, with Lemmas 3.2–3.5 bounding each contribution from the kernel, cutoff, and integration by parts. To make this verification more prominent, we will insert a dedicated subsection immediately after the truncation step that tabulates the individual error contributions and confirms they remain below 1.57 (for t≥3) and −1.16 (for t≥10^8). revision: yes

  2. Referee: [choice of smoothing operator and parameter selection] The paper must demonstrate that the smoothing function and its parameters are chosen independently of the target bound (i.e., no post-hoc adjustment of constants to fit the claimed inequalities). Any dependence would reduce the result to a numerical observation rather than a proved estimate.

    Authors: The smoothing kernel (a standard Fejér-type kernel) and its width parameter are fixed in Section 2 solely by the requirement that the smoothed integral reproduces the main term of the Riemann-Siegel formula while controlling the truncation error; this choice precedes and is independent of the final additive constants. The constants 1.57 and −1.16 are subsequently obtained as rigorous upper bounds on the resulting analytic error expressions, not by fitting. We will add an explicit paragraph in Section 2 stating this a-priori selection criterion and confirming the absence of post-hoc adjustment. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper derives explicit upper bounds for |ζ(1+it)| by applying a smoothing operator to an integral representation obtained from the Riemann-Siegel formula, replacing the triangle inequality with a more refined estimate. No step reduces a claimed bound to a fitted parameter of itself, a self-citation chain, or an ansatz smuggled from prior work by the same authors. The constants 1.57 and -1.16 are presented as explicit outputs of the error analysis rather than inputs; the derivation relies on standard analytic estimates and does not rename or presuppose the target inequality. This is the normal case of a self-contained explicit bound in analytic number theory.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The derivation rests on standard analytic properties of the zeta function and the Riemann-Siegel formula; no new free parameters, axioms, or invented entities are introduced in the abstract.

pith-pipeline@v0.9.1-grok · 5638 in / 975 out tokens · 24268 ms · 2026-07-03T18:36:17.586703+00:00 · methodology

0 comments
read the original abstract

We demonstrate an improved explicit upper bound of $|\zeta(1+it)|$ for $3 \leq t \leq 10^9$ using smoothing techniques. Our method sharpens previous bounds relying on the Riemann--Siegel formula and the triangle inequality. In particular, we prove that for $t\geq 3$, \begin{align*} |\zeta(1+it)| \leq \frac{1}{2}\log t + 1.57 \end{align*} and for $t \geq 10^8$, \[ |\zeta(1+it)|\leq \frac{1}{3}\log t + 2\log \log t -1.16 . \]

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

9 extracted references · 9 canonical work pages · 1 internal anchor

  1. [1]

    Utilizing Smoothing Techniques to Bound zeta-1 + it , June 2026

    Andrew Christensen and Kyle Pratt. Utilizing Smoothing Techniques to Bound zeta-1 + it , June 2026. https://github.com/AndrewChristensenJ/Utilizing_Smoothing_Techniques_to_Bound_zeta-1_it

    work page 2026

  2. [2]

    https://dlmf.nist.gov/, Release 1.2.6 of 2026-03-15

    NIST Digital Library of Mathematical Functions . https://dlmf.nist.gov/, Release 1.2.6 of 2026-03-15. F. W. J. Olver, A. B. Olde Daalhuis , D. W. Lozier, B. I. Schneider, R. F. Boisvert, C. W. Clark, B. R. Miller, B. V. Saunders, H. S. Cohl, and M. A. McClain, eds

    work page 2026

  3. [3]

    Vinogradov's integral and bounds for the R iemann zeta function

    Kevin Ford. Vinogradov's integral and bounds for the R iemann zeta function. Proc. London Math. Soc. (3) , 85(3):565--633, 2002

    work page 2002

  4. [4]

    The ternary Goldbach problem

    Harald Andres Helfgott. The ternary G oldbach problem, 2015. https://arxiv.org/abs/1501.05438

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  5. [5]

    Ghaith A. Hiary. An explicit van der C orput estimate for (1/2+it) . Indag. Math. (N.S.) , 27(2):524--533, 2016

    work page 2016

  6. [6]

    Hiary, Nicol Leong, and Andrew Yang

    Ghaith A. Hiary, Nicol Leong, and Andrew Yang. Explicit bounds for the R iemann zeta-function on the 1-line. Funct. Approx. Comment. Math. , 73(1):53--89, 2025

    work page 2025

  7. [7]

    Hiary, Dhir Patel, and Andrew Yang

    Ghaith A. Hiary, Dhir Patel, and Andrew Yang. An improved explicit estimate for (1/2+it) . J. Number Theory , 256:195--217, 2024

    work page 2024

  8. [8]

    Tables of M ellin transforms

    Fritz Oberhettinger. Tables of M ellin transforms . Springer-Verlag, New York-Heidelberg, 1974

    work page 1974

  9. [9]

    An explicit upper bound for | (1+it) |

    Dhir Patel. An explicit upper bound for | (1+it) | . Indag. Math. (N.S.) , 33(5):1012--1032, 2022

    work page 2022