MétaCan
Menu
Back to cohort
Record W2542097418 · doi:10.1112/s0010437x19007036

Cohen–Lenstra heuristics for étale group schemes and symplectic pairings

2019· article· en· W2542097418 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

VenueCompositio Mathematica · 2019
Typearticle
Languageen
FieldMathematics
TopicAlgebraic Geometry and Number Theory
Canadian institutionsUniversity of TorontoMcGill University
Fundersnot available
KeywordsHeuristicsAbelian groupConjectureGroup (periodic table)Symplectic geometryConstant (computer programming)Function (biology)

Abstract

fetched live from OpenAlex

We generalize the Cohen–Lenstra heuristics over function fields to étale group schemes $G$ (with the classical case of abelian groups corresponding to constant group schemes). By using the results of Ellenberg–Venkatesh–Westerland, we make progress towards the proof of these heuristics. Moreover, by keeping track of the image of the Weil-pairing as an element of $\wedge ^{2}G(1)$ , we formulate more refined heuristics which nicely explain the deviation from the usual Cohen–Lenstra heuristics for abelian $\ell$ -groups in cases where $\ell \mid q-1$ ; the nature of this failure was suggested already in the works of Malle, Garton, Ellenberg–Venkatesh–Westerland, and others. On the purely large random matrix side, we provide a natural model which has the correct moments, and we conjecture that these moments uniquely determine a limiting probability measure.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.020
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0000.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.023
GPT teacher head0.279
Teacher spread0.256 · 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