Bibliographic record
Abstract
For a polynomial f ( x ) in ([inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="01i" /]) of degree d ≥ 3 let [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="02i" /] be the L function of the exponential sum of f mod p . Let NP [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="03i" /] denote the Newton polygon of [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="04i" /]. Let HP ([inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="05i" /]) denote the Hodge polygon of [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="06i" /], which is the lower convex hull in [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="07i" /] of the points ( n, n ( n +1)/2 d ) for 0 ≤ n ≤ d - 1. Let [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="08i" /] be the space of degree- d monic polynomials parameterized by their coefficients. Let GNP [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="09i" /] := [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="10i" /] NP [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="11i" /] be the lowest Newton polygon over [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="12i" /] if exists. We prove that for p large enough GNP [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="13i" /] exists and we give an explicit formula for it. We also prove that there is a Zariski dense open subset [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14i" /] defined over [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="15i" /] in [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="16i" /] such that for [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="17i" /] and for p large enough we have NP [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="18i" /] = GNP [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="19i" /]; furthermore, as p goes to infinity their limit exists and is equal to HP [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="20i" /]. Finally we prove analogous results for the space of polynomials f ( x ) = x d + ax with one parameter. In particular, for any nonzero a ∈ [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="21i" /] we show that lim p →∞ NP (( x d + ax ) ⊗ [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="22i" /]) = HP [inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23i" /].
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.004 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.009 | 0.003 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".