MétaCan
Menu
Back to cohort

<scp>pasos</scp> (parental allocation of singles in open systems): a computer program for individual parental allocation with missing parents

2005· article· en· W2148456535 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

VenueMolecular Ecology Notes · 2005
Typearticle
Languageen
FieldAgricultural and Biological Sciences
TopicGenetics and Plant Breeding
Canadian institutionsUniversité Laval
FundersCanada Research Chairs
KeywordsCorrectnessComputer scienceGenotypeMissing dataStatisticsBiologyGeneticsMathematicsProgramming languageMachine learningGene

Abstract

fetched live from OpenAlex

Abstract pasos is a parental allocation program designed to identify collected parents based on individual multilocus genotypes while detecting missing parents when a proportion of them have not been collected. It makes use of restricted error tolerance in order to distinguish between a partially incorrect genotype from a false parent's genotype. pasos also introduces the technique of sequence allocation allowing the user to obtain estimates of the proportion of missing parents and of allocation correctness. The pasos interface is very similar to the one found in papa , its closed system counterpart ( Duchesne et al . 2002 ). A help file thoroughly describes all technical terms such as error modelling, parameters and procedures. pasos can be downloaded free of charge from: http://www.bio.ulaval.ca/louisbernatchez/ .

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.263
Threshold uncertainty score0.284

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.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.032
GPT teacher head0.249
Teacher spread0.218 · 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