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
Algorithms and Data Compression
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.

1,336 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.
1,336 works in the cohort · of 4,299,418page 11 of 27

Labels cover 0 of 1,336 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 1,336 of 1,336 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
Enumerating Neighbour and Closest Strings
Naomi Nishimura, Narges Simjour
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Independence of Tabulation-Based Hash Classes
Toryn Q. Klassen, Philipp Woelfel
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Pfp-fm: an accelerated FM-index
Aaron Hong, Marco Antônio Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie
2024· article· en· Algorithms for Molecular Biology· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Algorithmic Folding Complexity
Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi +3 more
2011· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Randomized Algorithms
2024· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Improved Two-Way Bit-parallel Search
Branislav Ďurian, Tamanna Chhabra, Sukhpal Singh Ghuman, Tommi Hirvola, Hannu Peltola, Jorma Tarhio
2014· article· en· Prague Stringology Conference· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Computing covers using prefix tables
Ali Alatabbi, M. Sohel Rahman, W.F. Smyth
2015· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Computing matching statistics on Wheeler DFAs
Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, Marinella Sciortino
2023· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Automatic Move Pruning Revisited
Neil Burch, Robert C. Holte
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
venueno affno abstractunlabeled
Conditional expectation algorithms for covering arrays
Charles J. Colbourn
2014· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Longest Path Distance in Random Circuits
Nicolas Broutin, Omar Fawzi
2012· article· en· Combinatorics Probability Computing· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Selection and Sorting in the “Restore” Model
Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2018· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
AutoVerus: Automated Proof Generation for Rust Code
Chenyuan Yang, X. Li, Md Rakib Hossain Misu, Jianan Yao, Yeyun Gong, Chris Hawblitzel +6 more
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
fundno affunlabeled
The Cycles of the Multiway Perfect Shuffle Permutation
John Ellis, Hongbing Fan, Jeffrey Shallit
2002· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
← previousnext →

How this was built: Screen · Findings · About