MétaCan
Menu
Back to cohort

Tabulation of cubic function fields via polynomial binary cubic forms

2012· article· lv· W1998762286 on OpenAlexaff
Pieter Rozenhart, Michael J. Jacobson, Renate Scheidler

Bibliographic record

VenueMathematics of Computation · 2012
Typearticle
Languagelv
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsAlgorithmType (biology)AnnotationArtificial intelligenceComputer scienceMathematicsBiology

Abstract

fetched live from OpenAlex

We present a method for tabulating all cubic function fields over F q ( t ) \mathbb {F}_q(t) whose discriminant D D has either odd degree or even degree and the leading coefficient of − 3 D -3D is a non-square in F q ∗ \mathbb {F}_{q}^* , up to a given bound B B on deg ⁡ ( D ) \deg (D) . Our method is based on a generalization of Belabas’ method for tabulating cubic number fields. The main theoretical ingredient is a generalization of a theorem of Davenport and Heilbronn to cubic function fields, along with a reduction theory for binary cubic forms that provides an efficient way to compute equivalence classes of binary cubic forms. The algorithm requires O ( B 4 q B ) O(B^4 q^B) field operations as B → ∞ B \rightarrow \infty . The algorithm, examples and numerical data for q = 5 , 7 , 11 , 13 q=5,7,11,13 are included.

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.006
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: none
Teacher disagreement score0.071
Threshold uncertainty score0.237

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0030.004
Science and technology studies0.0010.001
Scholarly communication0.0030.005
Open science0.0020.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0710.028

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.019
GPT teacher head0.252
Teacher spread0.232 · 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

Citations4
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueMathematics of ComputationSame topicCoding theory and cryptographyFrench-language works237,207