MétaCan
Menu
Back to cohort
Record W2070823145 · doi:10.1515/jmc.2011.007

Compact elliptic curve representations

2011· article· en· W2070823145 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of Mathematical Cryptology · 2011
Typearticle
Languageen
FieldComputer Science
TopicCryptography and Residue Arithmetic
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsMathematicsElliptic curveIsomorphism (crystallography)Prime (order theory)Upper and lower boundsCombinatoricsReduction (mathematics)Discrete mathematicsJacobian curvePure mathematicsSchoof's algorithmMathematical analysisQuarter periodGeometryCrystallographyChemistry

Abstract

fetched live from OpenAlex

Abstract Let y 2 = x 3 + ax + b be an elliptic curve over 𝔽 p , p being a prime number greater than 3, and consider a, b ∈ [1, p ]. In this paper, we study elliptic curve isomorphisms, with a view towards reduction in the size of elliptic curves coefficients. We first consider reducing the ratio a / b . We then apply these considerations to determine the number of elliptic curve isomorphism classes. Later we work on both coefficients. We introduce the number M ( p ) as the lower bound of all M ∈ ℕ such that each isomorphism class has a representative with max( a, b ) < M . Using results from the theory of uniform distributions, we prove upper and lower bounds of the form c 1 p 1/2 < M ( p ) < c 2 p 3/4 with explicit constants c 1 , c 2 > 0.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: Methods · Consensus signal: none
Teacher disagreement score0.725
Threshold uncertainty score0.303

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.048
GPT teacher head0.289
Teacher spread0.241 · 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