MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
Sort
Language
Type
Field
Venue
ACM Transactions on Computing Education
Topic
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

26 results · 1 filter active ·
Results by year
20092025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
26 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 26 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 26 of 26 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Learning IS Child’s Play
Hadi Hosseini, Maxwell Hartt, Mehrnaz Mostafapour
2019· article· en· ACM Transactions on Computing Education· Psychology
machine prediction:candidate · noneconsensus · none
45
citations
affunlabeled
Creativity in CS1: A Literature Review
Sadia Sharmin
2021· review· en· ACM Transactions on Computing Education· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Teaching Software Product Lines
Mathieu Acher, Roberto E. Lopez-Herrejon, Rick Rabiser
2017· article· en· ACM Transactions on Computing Education· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Student Performance on the BDSI for Basic Data Structures
Kevin C. Webb, Daniel Zingaro, Soohyun Nam Liao, Cynthia Taylor, Cynthia Lee, Michael Clancy +1 more
2021· article· en· ACM Transactions on Computing Education· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Adding Test Generation to the Teaching Machine
Michael Bruce-Lockhart, Theodore S. Norvell, Pierluigi Crescenzi
2009· article· en· ACM Transactions on Computing Education· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Multi-Institutional Study on Impostor Phenomenon
Sophia Krause-Levy, Andrew Petersen, Oladele O. Campbell, William G. Griswold, Leo Porter, Oluwatoyin Adelakun-Adeyemo +15 more
2025· article· en· ACM Transactions on Computing Education· Psychology
machine prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About