Number Theory · arXiv:2611.16358 v1 · submitted 12 Nov 2026 · 9 references
Optimal Sample Complexity for Genus-Two Zeta Functions from Noisy Random Euler Products
The paper says
“We study exact recovery of the Hasse–Weil zeta numerator from repeated noisy observations of a randomized Euler product.”
more of the abstract
For a genus-two curve over 𝔽q, we attach independent symmetric signs to its closed points and observe the logarithm of the resulting product at tq = c/√q, where 0 < c < 1/√12 is fixed. For every fixed, known additive noise density f satisfying √f ∈ H1(ℝ), we prove that the minimax number of independent observations required for exact recovery with error probability at most δ has order q4log(1/δ). No moment condition is imposed on the noise, so the result includes Cauchy readout. The upper bound estimates the phase of an empirical characteristic function and uses the separation of the integral Weil coefficients. The matching lower bound compares the full observation laws for two actual curves with ordinary, absolutely simple Jacobians. It combines a binomial comparison with a uniform bound on the closed-point tail. Thus access to the full observations does not improve the sample order attained by the phase estimator. The result concerns the information in a specified observation channel. It does not assume an efficient implementation of that channel.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
The passes disagreed. Reader: holds up. Skeptic: holds up only with conditions. Referee: major revision.
Matching minimax bounds for recovering genus-two zeta numerators from noisy scalar observations; clean, honest, and technically sound. This line is wrong
3 major objections · 9 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 9 references say.
The paper says, at §5.1, Lemma 5.2 and §6
The review did not quote this passage.
A classifier read this sentence of the paper as acknowledging the concern (probability 0.65):
“This is a counterexample to removing Sobolev regularity fromthat lemma, not to the minimax rate itself.”
Pith says: Objection 1 of 3 · major
The lower bound (Theorem 1.1) depends critically on the Sobolev regularity condition √f ∈ H^1(R) via Lemma 5.2. The paper acknowledges that the uniform law on [-1,1] violates this condition (Section 6), but it does not verify that any other common noise density (e.g., Laplace, logistic, Student's t with finite variance) satisfies it.
more of objection 1
The only examples given are Cauchy (which does satisfy H^1) and Gaussian (which also satisfies H^1). The paper claims the result holds for 'every fixed, known additive noise density f satisfying √f ∈ H^1(R)', but provides no general criterion or test to determine whether a given density meets this condition. This is a load-bearing concern because the lower bound collapses if the noise density does not satisfy the Sobolev regularity, and the paper does not demonstrate that the condition is satisfied by a broad class of densities beyond the two examples. The reader's weakest_assumption correctly identifies this as fragile, but the paper's own acknowledgment does not resolve the concern; it merely flags the limitation. The concrete test would be to check whether a specific density, such as the Laplace distribution (f(x) = (1/2) exp(-|x|)), satisfies √f ∈ H^1(R). If it does not, then the lower bound does not apply to that noise, and the claim of optimal sample complexity for 'every fixed, known additive noise density f satisfying √f ∈ H^1(R)' would be misleading because the condition is not easily verifiable and may exclude many natural densities. If it does, the paper should provide a proof or reference. I recommend that the authors either (a) provide a sufficient condition or a simple test for √f ∈ H^1(R) (e.g., f positive, differentiable, with square-integrable derivative of √f), or (b) explicitly verify that a few more common densities (e.g., Laplace, logistic) satisfy the condition, or (c) discuss the scope of the condition more precisely, noting that the lower bound is proved only for densities satisfying this Sobolev regularity, and that the upper bound holds without it. This would clarify the applicability of the result.
The paper says, at §4.1, Lemma 4.1 and the existence of the hard pair for all q ≥ 3
The review did not quote this passage.
Pith says: Objection 2 of 3 · major
The lower bound relies on the existence of two curves C_+, C_- with zeta numerators P_±(T) = 1 + T ± T^2 + qT^3 + q^2 T^4 for every prime power q ≥ 3, with ordinary, absolutely simple Jacobians. The proof cites [4, Appendix, Step 2] and [4, Theorem 1.2(2) and Table 1.2] and [5, Theorem 6].
more of objection 2
While these references are published and presumably contain the necessary results, the paper does not reproduce the argument that for every q ≥ 3, the isogeny class with these Weil polynomials contains a genus-two Jacobian that is ordinary and absolutely simple. The reader's weakest_assumption notes that the existence is cited rather than proved. However, the paper does provide an explicit example over F_3 (Section 4.3) as a check. The concern is whether the cited references indeed guarantee existence for all q ≥ 3, including q that are not prime (i.e., prime powers). The paper states 'for every prime power q ≥ 3' in Lemma 4.1. The references [4] and [5] are about abelian surfaces over finite fields; [4, Theorem 1.2] gives conditions for existence of genus-two Jacobians in isogeny classes. The paper should verify that the specific polynomials P_± satisfy the conditions of [4, Theorem 1.2] for all prime powers q ≥ 3, not just primes. The argument in Lemma 4.1 uses the factorization and the condition that D = 8q+1-4b ≡ 5 (mod 8) is not a square, which holds for all q ≥ 3? For q a prime power, 8q+1-4b with b=±1 gives 8q+5 or 8q-3. Are these always non-squares? For q=4 (a prime power), 8*4+5=37, which is not a square; 8*4-3=29, not a square. For q=8, 8*8+5=69, not a square; 8*8-3=61, not a square. It seems plausible, but the paper should either provide a brief verification or cite a result that covers all prime powers. This is a minor load-bearing point because the lower bound is only claimed for q ≥ q_0(W) (which may be larger than 3), but the existence for all q ≥ 3 is used in Proposition 5.4 and the proof of Theorem 1.1. I recommend that the authors add a short argument or reference to show that the polynomials P_± are indeed realized by ordinary absolutely simple Jacobians for all prime powers q ≥ 3 (or at least for all q ≥ q_0(W)).
The paper says, at §5.2, Proposition 5.4 and the Hellinger bound
The review did not quote this passage.
Pith says: Objection 3 of 3 · major
The proof of Proposition 5.4 decomposes the Hellinger distance into four steps and bounds each using the triangle inequality and Cauchy-Schwarz. The bound for the third step (degree-two block) uses Lemma 5.3 (binomial comparison) and gives squared cost at most 27 q^{-4}.
more of objection 3
However, the derivation of the constant 27 is not fully explained. The paper states: 'Since Hellinger distance is symmetric, (5.4) gives squared cost at most 27 q^{-4}.' The calculation: from Lemma 5.3, H^2(R_{N-2}, R_{N-2+2}) ≤ 2/((N-2+1)(N-2+2)) = 2/((N-2+1)(N-2+2)). With N-2 = (q^2 - q - 2)/2, we have N-2+1 = (q^2 - q)/2 and N-2+2 = (q^2 - q + 2)/2. Then H^2 ≤ 2 / ( ((q^2 - q)/2) * ((q^2 - q + 2)/2) ) = 8 / ((q^2 - q)(q^2 - q + 2)). For q ≥ 3, this is ≤ 8 / ((q^2 - q)^2) = 8 / (q^2(q-1)^2) ≤ 8 / (q^2 * 4) = 2/q^2? Wait, that gives O(q^{-2}), not O(q^{-4}). But the paper claims squared cost at most 27 q^{-4}. There is a missing factor: the Hellinger distance is between the laws of h_2 R_{N-2} and h_2 R_{N-2+2}, where h_2 = arctanh(t_q^2) ≈ t_q^2 = c^2/q. The scaling by h_2 changes the Hellinger distance? The paper says 'multiplication by a nonzero scalar does not change an f-divergence.' Is that true for Hellinger distance? For a random variable X and a constant a ≠ 0, the Hellinger distance between the laws of aX and aY is not necessarily the same as between X and Y; it scales? Actually, if we consider the densities, scaling by a changes the support and the density by a factor 1/|a|. The Hellinger distance is invariant under invertible linear transformations? Let's check: For random variables X and Y with densities p_X, p_Y, the density of aX is (1/|a|) p_X(x/a). Then the Hellinger distance between aX and aY is ∫ (√(p_{aX}) - √(p_{aY}))^2 = ∫ ( (1/√{|a|}) √{p_X(x/a)} - (1/√{|a|}) √{p_Y(x/a)} )^2 dx = (1/|a|) ∫ (√{p_X(x/a)} - √{p_Y(x/a)})^2 dx = ∫ (√{p_X(u)} - √{p_Y(u)})^2 du, after change of variable u = x/a. So indeed Hellinger distance is scale-invariant. So the scaling by h_2 does not affect the Hellinger distance between the sign-sum laws. Therefore the bound from Lemma 5.3 applies directly to the laws of R_{N-2} and R_{N-2+2}, and then after convolution with the common noise and other blocks, the Hellinger distance is at most the original Hellinger distance (by contraction).
9 minor objections
The paper says, at §5.2, Proposition 5.4
Pith says: minor objection 1 of 9
The derivation of the constant 27 q^{-4} for the degree-two block comparison is not explained. Please expand the calculation to show how Lemma 5.3 and the values of N_2^- yield this bound. This would improve reproducibility.
The paper says, at §4.1, Lemma 4.1
Pith says: minor objection 2 of 9
The proof cites [4, Appendix, Step 2] and [4, Theorem 1.2(2) and Table 1.2] and [5, Theorem 6] for the existence of ordinary, absolutely simple Jacobians for all prime powers q ≥ 3. It would be helpful to briefly indicate why these references apply to all prime powers, not just primes, or to note that the argument works for any q ≥ 3 (including prime powers) because the conditions involve only the Weil polynomial and the discriminant condition.
show 7 more
The paper says, at §3.2, Proposition 3.2
Pith says: minor objection 3 of 9
The estimator uses the frequency ω satisfying 0 < ω ≤ 1/2 and |φ_W(ω)| ≥ 1/2. The existence of such ω is guaranteed by continuity of φ_W at 0. However, the paper does not discuss how to choose ω in practice given only the known noise density. This is a minor omission; a brief remark would suffice.
The paper says, at §5.1, Lemma 5.2
Pith says: minor objection 4 of 9
The condition √f ∈ H^1(R) implies that f is absolutely continuous? The paper should note that this condition is equivalent to f being absolutely continuous with derivative f' such that ∫ (f')^2 / f dx < ∞ (if f>0). This is a standard fact; a reference would be helpful.
The paper says, at §6
Pith says: minor objection 5 of 9
The paper states that for the uniform law on [-1,1], H^2(Law(W+h), Law(W)) = |h| for |h| ≤ 2. This is correct, but it would be useful to note that this violates the quadratic bound (5.2) because the Hellinger distance is linear in h, not quadratic. This is a counterexample to the lemma, not to the minimax rate, as the paper correctly notes.
The paper says, at §1, Introduction
Pith says: minor objection 6 of 9
The definition of d_c = (1/4) min{c^4, 2c^2(1-12c^2)} > 0. For c close to 1/√12, the term 2c^2(1-12c^2) becomes very small, making d_c small. The paper might note that the upper bound constant depends on d_c^{-2}, which blows up as c approaches 1/√12. This is expected and not a flaw.
The paper says, at §4.3
Pith says: minor objection 7 of 9
The explicit example over F_3 is a nice verification. However, the paper should clarify that this example is not needed for the proof but serves as an illustration. Also, the field F_9 is described as F_3[z]/(z^2+1), but z^2 = 2 in F_3? Actually, in F_3, 2 = -1, so z^2 = -1, which is consistent. The example is correct.
The paper says, at §5.3, Proposition 5.7
Pith says: minor objection 8 of 9
This proposition provides an independent check for Gaussian noise. It is not used in the main theorem but is a nice addition. The proof sketch is clear.
The paper says, at General
Pith says: minor objection 9 of 9
The paper is well-written and the logic is clear. The notation is consistent. The references are appropriate.
What would settle it
Compute the H^1 Sobolev norm of sqrt(f) for the Laplace density f(x) = (1/2) exp(-|x|). Specifically, evaluate J_W = ∫ ( (d/dx) sqrt(f(x)) )^2 dx. If J_W is finite, then the condition holds and the lower bound applies. If J_W is infinite, then the lower bound does not apply to Laplace noise, and the paper's claim of optimal sample complexity for 'every fixed, known additive noise density f satisfying sqrt(f) in H^1(R)' would be false for this density, unless the upper bound also fails (which it does not, as the upper bound requires no density condition). This test would settle whether the condition is satisfied by a common density not explicitly checked in the paper.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 13 Nov 2026
- Reader holds up
- Skeptic partly agrees: says it holds up only with conditions The lower bound's reliance on the Sobolev regularity sqrt(f) in H^1(R) is acknowledged but the paper does not verify that the specific noise densities for which the bound is claimed actually satisfy this condition; the uniform-law counterexample shows the condition is not vacuous, but the paper…
- Editor wrote the verdict above
- Referee major revision: 3 major objections, 9 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
This paper is a clean, self-contained piece of information-theoretic arithmetic geometry. It proves matching upper and lower bounds on the number of noisy scalar observations needed to recover the zeta numerator of a genus-two curve over a finite field. The result is new, the proof is honest, and the constants are explicit. The upper bound uses a clever phase estimator that works without any moment assumptions on the noise, and the lower bound constructs a genuine hard pair of curves with ordinary absolutely simple Jacobians and compares their full observation laws via Hellinger distance. The paper is careful about what it does and does not claim: it flags the Sobolev condition on the noise density as load-bearing for the lower bound, gives a counterexample (uniform law) where it fails, and notes that atomic or noiseless readouts are not covered. The stress-test concern about verifying the H1 condition for common densities is real but not a flaw in the paper: the authors state the condition as a hypothesis, prove the bound under it, and give two examples (Cauchy, Gaussian) that satisfy it. They do not claim a general criterion, and the reader can check any specific density. The paper's own Section 6 is unusually frank about limitations. The only soft spot worth mentioning is that the lower bound's dependence on the Howe–Nart–Ritzenthaler and Howe–Zhu existence results for the hard pair over all q >= 3 is cited rather than proved here, but that is standard and the citation is to published, peer-reviewed work. The paper deserves a serious referee. I would cite it if I worked on zeta recovery or information-theoretic number theory. It is not a reading-group paper for a general audience, but a specialist would learn from it. Recommend peer review with no special urgency.
The strongest objection
The lower bound (Theorem 1.1) depends on Lemma 5.2, which requires sqrt(f) in H^1(R). The paper acknowledges that the uniform law on [-1,1] violates this (Section 6), but does not verify that any other common noise density (e.g., Laplace, logistic, Student's t with finite variance) satisfies the condition. The only examples given are Cauchy (which does satisfy H^1) and Gaussian (which also satisfies H^1). The paper claims the result holds for 'every fixed, known additive noise density f satisfying sqrt(f) in H^1(R)', but provides no general criterion or test to determine whether a given density meets this condition. This is a load-bearing concern because the lower bound collapses if the noise density does not satisfy the Sobolev regularity, and the paper does not demonstrate that the condition is satisfied by a broad class of densities beyond the two examples. The reader's weakest_assumption correctly identifies this as fragile, but the paper's own acknowledgment does not resolve the concern; it merely flags the limitation. The concrete test would be to check whether a specific density, such as the Laplace distribution (f(x) = (1/2) exp(-|x|)), satisfies sqrt(f) in H^1(R). If it does not, then the lower bound does not apply to that noise, and the claim of optimal sample complexity for 'every fixed, known additive noise density f satisfying sqrt(f) in H^1(R)' would be misleading because the condition is not easily verifiable and may exclude many natural densities. If it does, then the concern is mitigated but not eliminated, as the paper would still lack a general method to verify the condition.
The reader's weakest_assumption correctly identifies the Sobolev regularity condition as load-bearing. However, the reader's verdict is ACCEPT, implying that the condition is not a red flag. I partially agree: the condition is acknowledged, but the paper does not verify that it holds for a broad class of densities beyond the two examples (Cauchy and Gaussian). The paper claims the result holds for 'every fixed, known additive noise density f satisfying sqrt(f) in H^1(R)', but provides no general criterion or test to determine whether a given density meets this condition. This is a concern because the lower bound collapses if the condition fails, and the paper does not demonstrate that the condition is satisfied by many natural densities. The concrete test would check a specific density (Laplace) to see if the condition holds. If it does, the concern is mitigated; if it does not, the claim is misleading. Therefore, the verdict should be CONDITIONAL: accept only if the authors provide a verification that the condition holds for a broader class of densities, or at least provide a general criterion for checking the condition. The paper's own acknowledgment of the uniform-law counterexample shows they are aware of the limitation, but they do not address it beyond that. The concrete test would settle whether the condition is restrictive or not.
The referee's report
If correct, the result is significant because it establishes the minimax optimal sample complexity for a nontrivial arithmetic inference problem, showing that the full observation channel does not improve over a simple phase estimator. The matching bounds are derived from structural properties of the Weil coefficients and the noise regularity, without imposing moment conditions. The paper is rigorous in its derivations and provides explicit constants. The lower bound is particularly notable for its use of actual curves (ordinary, absolutely simple Jacobians) and a careful Hellinger comparison that handles the infinite tail. The result is a contribution to the intersection of arithmetic statistics, information theory, and statistical inference.
Pith's reading of the paper (a machine's summary, not the authors')
A genus-two curve over a finite field F_q is described, for counting purposes, by its zeta function, which is encoded by just two integers (a,b) called Weil coefficients. This paper asks how hard it is to learn those two integers from a noisy oracle. Each sample is a random number: the logarithm of a product over the curve's closed points with independent random signs, plus a noise term of known distribution with no moment condition, so even Cauchy readout is allowed. The main theorem says the number of observations needed to recover (a,b) exactly, with failure probability at most delta, grows like q^4 log(1/delta). Two separate arguments give matching bounds. A constructive upper bound estimates the phase of an empirical characteristic function: possible signal means differ by at least d_c/q^2 because the Weil coefficients are integers, so once the noise is averaged out the correct value wins. A lower bound builds two genuinely different curves whose observation laws are nearly identical, at squared Hellinger distance about q^-4, so no estimator can separate them with fewer than order q^4 samples. The hard pair is realized by curves with ordinary, absolutely simple Jacobians using published classification results, and an explicit F_3 example that can be checked by hand is given. Two caveats are honest ones. First, the lower bound needs the noise density to be smooth enough, its square root in H^1: for uniform noise on [-1,1] the key inequality fails, though the rate may still hold. Second, the bound measures how much information the channel carries, not the cost of computing the estimate, and the recipe searches over all candidate polynomials.
Core claim. Theorem 1.1 (eq. 1.6): under fixed c in (0,1/sqrt(12)), fixed known noise density f with sqrt(f) in H^1(R), and the phase-observation channel (1.2)-(1.4), for every prime power q >= q0(W) and 0 < delta < 1/8 we have (q^4/(2 K_W)) log(1/(4 delta)) <= m*(q,c,W,delta) <= ceil(2^12 omega^-2 d_c^-2 q^4 log(4/delta)). If correct, the minimax sample complexity for exact recovery of the genus-two Hasse-Weil numerator is Theta_{c,W}(q^4 log(1/delta)) uniformly over all genus-two curves over F_q, with no moment assumption on the readout noise, and this holds even when curves are restricted to those with ordinary, absolutely simple Jacobians.
The premise it rests on. The Sobolev regularity condition sqrt(f) in H^1(R) on the known noise density, which Lemma 5.2 needs for the quadratic Hellinger bound (5.2) and the translation-smoothing inequality (5.3), and which the lower-bound mechanism of Proposition 5.4 depends on for the mean and tail steps (costs J_W c^8 q^-4 and J_W q^-4). This is load-bearing for the matching lower bound, and the paper itself documents (Section 6) that the uniform law on [-1,1] violates it, with H^2 = |h|, so the lemma genuinely requires the smoothness; absent it, the lower bound as proved collapses even though the rate might still hold. A second fragile premise, of equal weight, is the cited existence (Howe-Nart-Ritzenthaler [4], Howe-Zhu [5]) of the hard pair of curves carrying the exact closed-point differences (4.5) for every prime power q >= 3, the F_3 example being only a check at one field.
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
We study exact recovery of the Hasse–Weil zeta numerator from repeated noisy observations of a randomized Euler product. For a genus-two curve over 𝔽q, we attach independent symmetric signs to its closed points and observe the logarithm of the resulting product at tq = c/√q, where 0 < c < 1/√12 is fixed. For every fixed, known additive noise density f satisfying √f ∈ H1(ℝ), we prove that the minimax number of independent observations required for exact recovery with error probability at most δ has order q4log(1/δ). No moment condition is imposed on the noise, so the result includes Cauchy readout. The upper bound estimates the phase of an empirical characteristic function and uses the separation of the integral Weil coefficients. The matching lower bound compares the full observation laws for two actual curves with ordinary, absolutely simple Jacobians. It combines a binomial comparison with a uniform bound on the closed-point tail. Thus access to the full observations does not improve the sample order attained by the phase estimator. The result concerns the information in a specified observation channel. It does not assume an efficient implementation of that channel.
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-11-13
The authors' main claim, as the classifier picked it out 1.00
“For every fixed, known additive noise density $f$ satisfying $\sqrt{f}\in H^1(\mathbb{R})$, we prove that the minimax number of independent observations required for exact recovery with error probability at most $\delta$ has order $q^4\log(1/\delta)$.”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.89 · human participants 0.01 · controlled comparison 0.07 · randomized assignment 0.24 · states quantitative result 0.98 · compares with prior results 0.34 · mentions code or data availability 0.02
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| We study exact recovery of the Hasse--Weil zeta numerator from repeated noisy observations of a randomized Euler product. | contribution 0.95 | 0.89 | 0.08 | asserted 0.84 |
| For a genus-two curve over $\mathbb{F}_q$, we attach independent symmetric signs to its closed points and observe the logarithm of the resulting product at $t_q=c/\sqrt q$, where $0<c<1/\sqrt{12}$ is fixed. | method 0.94 | 0.66 | 0.04 | asserted 0.85 |
| For every fixed, known additive noise density $f$ satisfying $\sqrt{f}\in H^1(\mathbb{R})$, we prove that the minimax number of independent observations required for exact recovery with error probability at most $\delta$ has order $q^4\log(1/\delta)$. | result 0.99 | 0.94 | 0.88 | asserted 1.00 |
| No moment condition is imposed on the noise, so the result includes Cauchy readout. | contribution 0.39 | 0.80 | 0.04 | asserted 1.00 |
| The upper bound estimates the phase of an empirical characteristic function and uses the separation of the integral Weil coefficients. | method 0.99 | 0.87 | 0.06 | asserted 0.99 |
| The matching lower bound compares the full observation laws for two actual curves with ordinary, absolutely simple Jacobians. | method 0.96 | 0.87 | 0.06 | asserted 0.99 |
| It combines a binomial comparison with a uniform bound on the closed-point tail. | method 0.99 | 0.84 | 0.04 | asserted 0.97 |
| Thus access to the full observations does not improve the sample order attained by the phase estimator. | interpretation 0.75 | 0.87 | 0.23 | asserted 1.00 |
| The result concerns the information in a specified observation channel. | limitation 0.52 | 0.36 | 0.05 | asserted 0.97 |
| It does not assume an efficient implementation of that channel. | limitation 0.93 | 0.36 | 0.03 | asserted 0.99 |
What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 7,461 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
References (9)
- [4] E. W. Howe, E. Nart, and C. Ritzenthaler,Jacobians in isogeny classes of abelian surfaces over finite fields, Ann. Inst. Fourier (Grenoble)59(2009), 239–289, doi:10.5802/aif.2430 on Pithdoi:10.5802/aif.2430
- [5] E. W. Howe and H. J. Zhu,On the existence of absolutely simple abelian varieties of a given dimension over an arbitrary field, J. Number Theory92(2002), 139–163, doi:10.1006/jnth.2001.2697 on Pithdoi:10.1006/jnth.2001.2697
- [1] M. Bilu, R. Das, and S. Howe,Zeta statistics and Hadamard functions, Adv. Math.407(2022), 108556, doi:10.1016/j.aim.2022.108556 on Pithdoi:10.1016/j.aim.2022.108556
- [2] S. Chidambaram and T. Keller,Point counts of abelian varieties over finite fields determining their zeta function, preprint (2026), arXiv:2606.28989 on PithPith's reviewarXiv
- [3] L. Devroye, M. Lerasle, G. Lugosi, and R. I. Oliveira,Sub-Gaussian mean estimators, Ann. Statist.44 (2016), 2695–2725, doi:10.1214/16-AOS1440 on Pithdoi:10.1214/16-aos1440
- [6] L. Le Cam and G. L. Yang,Asymptotics in Statistics: Some Basic Concepts, 2nd ed., Springer, New York, 2000, doi:10.1007/978-1-4612-1166-2 on Pithdoi:10.1007/978-1-4612-1166-2
- [7] W. Sawin,A refined random matrix model for function field L-functions, Duke Math. J.175(2026), 1163–1263, doi:10.1215/00127094-2025-0049 on Pithdoi:10.1215/00127094-2025-0049
- [8] H. Stichtenoth,Algebraic Function Fields and Codes, 2nd ed., Graduate Texts in Mathematics254, Springer, Berlin–Heidelberg, 2009, doi:10.1007/978-3-540-76878-4 on Pithdoi:10.1007/978-3-540-76878-4
- [9] V. Zacharovas,The estimate of χ2-distance between binomial and generalized binomial distributions, Theory Probab. Appl.64(2019), 444–455, doi:10.1137/S0040585X97T989593. Department of Mathematical Sciences, College of Science and Engineering, Ritsumeikan University, Kusatsu, S... on Pithdoi:10.1137/s0040585x97t989593
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment