MétaCan
Menu
Back to cohort

Exact Randomization Technique

2014· other· en· W4240638944 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

VenueWiley StatsRef: Statistics Reference Online · 2014
Typeother
Languageen
FieldMathematics
TopicStatistical Methods in Clinical Trials
Canadian institutionsUniversity of New Brunswick
Fundersnot available
KeywordsRandomizationStatisticShufflingExact testBootstrapping (finance)Test statisticResamplingComputer scienceRestricted randomizationStatistical hypothesis testingStatisticsSufficient statisticExact statisticsAlgorithmMathematicsRandomized controlled trialEconometricsMedicine

Abstract

fetched live from OpenAlex

Abstract The exact randomization technique is a distribution‐free, computationally‐intensive statistical method of dealing with small samples and uncertain distributions. The technique was first proposed by Fisher in 1935 as a method of dealing with small biological samples. Because of the computational demands, only the recent development of powerful desktop computers permits researchers to regularly use this technique. Suppose two sets of observations are recorded and labeled according to whether they come from a treatment or a control group. The concept of randomization is based on the observation that a conventional test statistic (e.g. a t statistic) can be interpreted as a typical draw from the distribution of test statistics that would be generated from randomly shuffling the treatment and control labels among the observed data. In fact, the exact randomization test is essentially a controlled example of bootstrapping.

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.003
metaresearch head score (Gemma)0.073
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Meta-epidemiology (narrow), Research integrity, Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.455
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.073
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0030.000
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0140.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.343
GPT teacher head0.522
Teacher spread0.179 · 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