MétaCan
Menu
Back to cohort
Record W2964930675 · doi:10.1515/jqas-2019-0047

Route identification in the National Football League

2019· article· en· W2964930675 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

VenueJournal of Quantitative Analysis in Sports · 2019
Typearticle
Languageen
FieldComputer Science
TopicTime Series Analysis and Forecasting
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsComputer scienceLeagueFootballIdentification (biology)MaximizationCluster analysisSet (abstract data type)OffensiveTree (set theory)Function (biology)Sequence (biology)Tracking (education)Data miningArtificial intelligenceOperations researchMathematical optimizationMathematicsGeography

Abstract

fetched live from OpenAlex

Abstract Tracking data in the National Football League (NFL) is a sequence of spatial-temporal measurements that varies in length depending on the duration of the play. In this paper, we demonstrate how model-based curve clustering of observed player trajectories can be used to identify the routes run by eligible receivers on offensive passing plays. We use a Bernstein polynomial basis function to represent cluster centers, and the Expectation Maximization algorithm to learn the route labels for each of the 33,967 routes run on the 6963 passing plays in the data set. With few assumptions and no pre-existing labels, we are able to closely recreate the standard route tree from our algorithm. We go on to suggest ideas for new potential receiver metrics that account for receiver deployment and movement common throughout the league. The resulting route labels can also be paired with film to enable streamlined queries of game film.

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.004
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.085
Threshold uncertainty score0.270

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.004
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.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.037
GPT teacher head0.312
Teacher spread0.275 · 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