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
Lecture notes in computer science
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.

11,332 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.
11,332 works in the cohort · of 4,299,418page 64 of 227

Labels cover 8 of 11,332 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 11,332 of 11,332 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.

affno abstractunlabeled
I/O-Efficient Undirected Shortest Paths
Ulrich Meyer, Norbert Zeh
2003· article· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Predictive Analysis on Tracking Emails for Targeted Marketing
Xiao Luo, Revanth Nadanasabapathy, A. Nur Zincir‐Heywood, Keith Gallant, Janith Peduruge
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Privacy and Ethical Challenges in Big Data
Sébastien Gambs
2019· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Monte-Carlo Methods in Pool Strategy Game Trees
Will Leckie, Michael Greenspan
2007· book-chapter· en· Lecture notes in computer science· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
One-Class Genetic Programming
Robert Curry, Malcolm I. Heywood
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Bio-inspired Navigation of Mobile Robots
Lei Wang, Simon X. Yang, Mohammad Biglarbegian
2012· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Minimizing Cache Usage in Paging
Alejandro López-Ortíz, Alejandro Salinger
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Programs Using Syntax with First-Class Binders
Francisco Ferreira, Brigitte Pientka
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Relational Mathematics for Relative Correctness
Jules Desharnais, Nafi Diallo, Wided Ghardallou, Marcelo F. Frias, Ali Jaoua, Ali Mili
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Mining Web Logs to Improve Web Caching and Prefetching
Qiang Yang, Henry Haining Zhang, Ian Tian Yi Li, Ye Lü
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
A Unified Conflict Resolution Algorithm
Amir H. Chinaei, Hamid R. Chinaei, Frank Wm. Tompa
2007· book-chapter· en· Lecture notes in computer science· Social Sciences
machine prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Faster Alias Set Analysis Using Summaries
Nomair A. Naeem, Ondřej Lhoták
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Generating Ambient Behaviors in Computer Role-Playing Games
Maria Cutumisu, Duane Szafron, Jonathan Schaeffer, Matthew McNaughton, Thomas Roy, Curtis Onuczko +1 more
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Spectral Norm of Symmetric Functions
Anil Ada, Omar Fawzi, Hamed Hatami
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
PressureMove: Pressure Input with Mouse Movement
Kang Shi, Sriram Subramanian, Pourang Irani
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Improvements to AdaBoost Dynamic
Érico N. de Souza, Stan Matwin
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
← previousnext →

How this was built: Screen · Findings · About