MétaCan
Menu
Back to cohort
Record W3174221081 · doi:10.4153/s0008439521000448

An elliptic curve analogue of Pillai’s lower bound on primitive roots

2021· article· en· W3174221081 on OpenAlexvenueno aff
Steven Jin, Lawrence C. Washington

Bibliographic record

VenueCanadian Mathematical Bulletin · 2021
Typearticle
Languageen
FieldMathematics
TopicAnalytic Number Theory Research
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsElliptic curveInteger (computer science)Order (exchange)CombinatoricsPrime (order theory)Riemann hypothesisUpper and lower boundsPure mathematicsMathematical analysis

Abstract

fetched live from OpenAlex

Abstract Let $E/\mathbb {Q}$ be an elliptic curve. For a prime p of good reduction, let $r(E,p)$ be the smallest non-negative integer that gives the x-coordinate of a point of maximal order in the group $E(\mathbb {F}_p)$ . We prove unconditionally that $r(E,p)> 0.72\log \log p$ for infinitely many p, and $r(E,p)> 0.36 \log p$ under the assumption of the Generalized Riemann Hypothesis. These can be viewed as elliptic curve analogues of classical lower bounds on the least primitive root of a prime.

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.003
metaresearch head score (Gemma)0.023
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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.013
Threshold uncertainty score0.043

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.023
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0040.003
Science and technology studies0.0030.007
Scholarly communication0.0040.008
Open science0.0020.005
Research integrity0.0010.007
Insufficient payload (model declined to judge)0.0130.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.

Opus teacher head0.043
GPT teacher head0.320
Teacher spread0.278 · 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

Citations0
Published2021
Admission routes1
Has abstractyes

Explore more

Same venueCanadian Mathematical BulletinSame topicAnalytic Number Theory ResearchFrench-language works237,207