{"arxiv_id":"2611.16358","title":"Optimal Sample Complexity for Genus-Two Zeta Functions from Noisy Random Euler Products","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 $\\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. 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)$. 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.","primary_cat":"math.NT","cross_cats":["math.ST","stat.TH"],"submitted_at":"2026-11-12T06:17:24+00:00","latest_version":1,"source":"arxiv","source_label":"arXiv","source_url":null,"has_pdf":true,"has_source":false,"verdict":"ACCEPT","confidence":"MODERATE","one_line_summary":"For a genus-two curve over F_q, exact recovery of the Hasse-Weil numerator from noisy random Euler product readouts has minimax sample complexity Theta_{c,W}(q^4 log(1/delta)) under Sobolev-regular noise.","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","upvotes":0,"downvotes":0,"pith_score":0,"inbound_count":0,"_links":{"html":"https://pith.science/paper/2611.16358","verdict":"/api/v1/verdicts/2611.16358"}}