MétaCan
Menu
Back to cohort
Record W4225566301 · doi:10.5206/mt.v2i1.14421

The art of algorithmic guessing in gfun

2022· preprint· en· W4225566301 on OpenAlexvenueno aff
Sergey Yurkevich

Bibliographic record

VenueMaple Transactions · 2022
Typepreprint
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsnot available
FundersAgence Nationale de la Recherche
KeywordsComputer science

Abstract

fetched live from OpenAlex

The technique of guessing can be very fruitful when dealing with sequences which arise in practice. This holds true especially when guessing is performed algorithmically and efficiently. The ideal tool for it exists as a package named gfun in the software Maple. In this text we explore and explain some of gfun's possibilities and illustrate them on two examples from recent mathematical research by the author and his collaborators.

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.010
metaresearch head score (Gemma)0.047
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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.016
Threshold uncertainty score0.053

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0100.047
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.003
Bibliometrics0.0030.003
Science and technology studies0.0030.017
Scholarly communication0.0060.019
Open science0.0030.007
Research integrity0.0040.011
Insufficient payload (model declined to judge)0.0160.005

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.017
GPT teacher head0.259
Teacher spread0.242 · 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

Citations0
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueMaple TransactionsSame topicEvolutionary Algorithms and ApplicationsFrench-language works237,207