MétaCan
Menu
Back to cohort
Record W2963477335 · doi:10.2140/ant.2010.4.1077

On the minimal ramification problem for semiabelian groups

2010· article· en· W2963477335 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueAlgebra & Number Theory · 2010
Typearticle
Languageen
FieldMathematics
TopicFinite Group Theory Research
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsRamificationPure mathematicsArithmeticAlgebra over a field

Abstract

fetched live from OpenAlex

It is now known that for any prime [math] and any finite semiabelian [math] -group [math] , there exists a (tame) realization of [math] as a Galois group over the rationals [math] with exactly [math] ramified primes, where [math] is the minimal number of generators of [math] , which solves the minimal ramification problem for finite semiabelian [math] -groups. We generalize this result to obtain a theorem on finite semiabelian groups and derive the solution to the minimal ramification problem for a certain family of semiabelian groups that includes all finite nilpotent semiabelian groups [math] . Finally, we give some indication of the depth of the minimal ramification problem for semiabelian groups not covered by our theorem.

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.004
metaresearch head score (Gemma)0.003
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
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.058
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.003
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.001
Insufficient payload (model declined to judge)0.0070.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.036
GPT teacher head0.319
Teacher spread0.283 · 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