MétaCan
Menu
Back to cohort
Record W2109407938 · doi:10.1145/1040034.1040041

ANTS VI

2004· article· en· W2109407938 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

VenueACM SIGSAM Bulletin · 2004
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsWilfrid Laurier University
Fundersnot available
KeywordsPresentation (obstetrics)Library scienceWeb siteComputer scienceOperations researchWorld Wide WebEngineeringThe Internet

Abstract

fetched live from OpenAlex

The Algorithmic Number Theory Symposium (ANTS) meetings are held bianually since 1994, and have become the premier international forum for the presentation of new research in Computational Number Theory. Previous ANTS conferences have been held as follows: ANTS I, 1994, Cornell University, USA, ANTS II, 1996, University of Bordeaux, France, ANTS III, 1998 Reed College, USA, ANTS IV, 2000, University of Leiden, Netherlands, ANTS V, 2002, University of Sydney, Australia. ANTS VI was held on June 13-18, 2004 at the University of Vermont in the United States, http://web.ew.usna.edu/~ants. ANTS VII is scheduled to be held in Berlin in the summer of 2006. Below are six poster abstracts presented during ANTS VI. We thank the organizers for the opportunity to publish the ANTS VI posters. We hope to help bring this work to a wider audience, not only to computational number theorists, but throughout the Symbolic Computation community.

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 categoriesInsufficient payload (model declined to judge)
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.592
Threshold uncertainty score0.999

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.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.014
GPT teacher head0.227
Teacher spread0.213 · 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