MétaCan
Menu
Back to cohort
Record W2061425254 · doi:10.1112/s1461157000000681

Computing Zeta Functions of Artin–schreier Curves over Finite Fields

2002· article· en· W2061425254 on OpenAlexaff
Alan G. B. Lauder, Daqing Wan

Bibliographic record

VenueLMS Journal of Computation and Mathematics · 2002
Typearticle
Languageen
FieldComputer Science
TopicCryptography and Residue Arithmetic
Canadian institutionsToronto Metropolitan University
FundersLorentz CenterNational Natural Science Foundation of ChinaEngineering and Physical Sciences Research CouncilDivision of Mathematical SciencesNational University of SingaporeNational Science Foundation
KeywordsMathematicsSupersingular elliptic curveElliptic curveFinite fieldAffine transformationEdwards curveHyperelliptic curve cryptographyRiemann zeta functionJacobian matrix and determinantHyperelliptic curvePolynomialSchoof's algorithmPure mathematicsApplied mathematicsMathematical analysisDiscrete mathematicsQuarter period

Abstract

fetched live from OpenAlex

Abstract The authors present a practical polynomial-time algorithm for computing the zeta function of certain Artin–Schreier curves over finite fields. This yields a method for computing the order of the Jacobian of an elliptic curve in characteristic 2, and more generally, any hyperelliptic curve in characteristic 2 whose affine equation is of a particular form. The algorithm is based upon an efficient reduction method for the Dwork cohomology of one-variable exponential sums.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.005
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.001
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0010.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0050.001

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.

Opus teacher head0.023
GPT teacher head0.252
Teacher spread0.229 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations30
Published2002
Admission routes1
Has abstractyes

Explore more

Same venueLMS Journal of Computation and MathematicsSame topicCryptography and Residue ArithmeticFrench-language works237,207