MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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
Topic
Spreadsheets and End-User Computing
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.

127 results · 1 filter active ·
Results by year
20002025
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.
127 works in the cohort · of 4,299,418page 2 of 3

Labels cover 0 of 127 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 127 of 127 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.

affaboutunlabeled
Potty Parity
Setareh Farajollahzadeh
2025· article· en· Management Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Using LINGO for Business Students
David M. Tulett, Ginger Y. Ke
2022· article· en· Operations Research Forum· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affvenueunlabeled
TRACEABILITY IN MEDICAL DEVICES DESIGN & MANUFACTURING
Joseph Neelamkavil, Ajit Pardasani, Michael Kernahan
2011· article· en· Proceedings of the Canadian Engineering Education Association (CEEA)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Dialing In Problems
Kenneth Ireland, Al Cuoco
2023· book-chapter· en· Undergraduate texts in mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Roald dahl küsschen küsschen pdf
2024· other· de· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Interest made simple with arrays
Richard Brown
2000· article· en· ACM SIGAPL APL Quote Quad· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Mathematica Player 6
H.J. Hindin
2009· article· en· Mathematics and computer education· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
aboutno affunlabeled
Bohemian (Canadian 107900)
2011· other· en· OhioLink ETD Center (Ohio Library and Information Network)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
ManyBabies
2017· other· en· Open Science Framework· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affvenueno abstractunlabeled
Real‐world problems or real‐world settings?
Jean Dionne, Roberta Mura
2004· article· en· Canadian Journal of Science Mathematics and Technology Education· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Inefficiency
Christopher P. Chambers, Alan D. Miller
2011· article· en· SSRN Electronic Journal· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Artediellus scaber Knipowitsch 1907
2021· article· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/b978-0-434-98613-2.50029-4
2000· book-chapter· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
aboutno affunlabeled
cit 0407 pdf
2024· other· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
The Excel object model
Bernard V. Liengme
2016· book-chapter· en· Morgan & Claypool Publishers eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Increased Bandwidth: Program Planning Evaluation Cycle
Bree Bode, Nicole Jess, Sarah Panken, Marci Scott
2025· article· en· Journal of Nutrition Education and Behavior· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Dinoderus minutus
2007· article· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Sample SNAP Math Fair Projects
Andy Liu
2017· book-chapter· en· Springer texts in education· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About