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
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 14 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
Algorithms in the Ultra-Wide Word Model
Arash Farzan, Alejandro López-Ortíz, Patrick K. Nicholson, Alejandro Salinger
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Emanation Graph: A New t-Spanner.
Bardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal
2018· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Computational Discovery on Jupyter
Neil J. Calkin, Eunice Y. S. Chan, Robert M. Corless
2023· book· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
The Tandem Duplication Distance Is NP-Hard
Manuel Lafond, Binhai Zhu, Peng Zou
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Compressing and indexing aligned readsets
Travis Gagie, Garance Gourdel, Giovanni Manzini
2021· preprint· en· CINECA IRIS Institutial research information system (University of Pisa)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Variance partition that eludes intuition
Jay S. Kaufman
2025· article· en· SSM - Population Health· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Maximal unbordered factors of random strings
Patrick Hagge Cording, Travis Gagie, Mathias Bæk Tejs Knudsen, Tomasz Kociumaka
2020· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Smoothed heights of tries and patricia tries
Weitian Tong, Randy Goebel, Guohui Lin
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Efficient chaining of seeds in ordered trees
Julien Allali, Cédric Chauve, Pascal Ferraro, Anne-Laure Gaillard
2011· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
r5r: Rapid Realistic Routing with 'R5'
Marcus Saraiva, Rafael H. M. Pereira, Daniel Herszenhut, Matthew Conway
2020· dataset· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
A hashing technique using separate binary tree
Mehedi Masud, Gopal Das, Anisur Rahman, Arunashis Ghose
2006· article· en· Data Science Journal· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Fast protein database as a service with kAAmer
Maxime Déraspe, Sébastien Boisvert, François Laviolette, Paul H. Roy, Jacques Corbeil
2020· preprint· en· bioRxiv (Cold Spring Harbor Laboratory)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Large-scale detection of repetitions
W. F. Smyth
2014· article· en· Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Understanding is Compression
Ming Li, Ziguang Li, Chao Huang, Xuliang Wang, Haibo Hu, Cole Wyeth +4 more
2024· preprint· en· Research Square· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Fast string sorting using order-preserving compression
Alejandro López-Ortíz, Mehdi Mirzazadeh, Mohammad Ali Safari, Hossein Sheikhattar
2005· article· en· ACM Journal of Experimental Algorithmics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Random suffix search trees
Luc Devroye, Ralph Neininger
2003· article· en· Random Structures and Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
On Recognizing a String on an Anonymous Ring
Evangelos Kranakis, Danny Kriz̧anc, Flaminia L. Luccio
2000· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
On a lemma of Crochemore and Rytter
Haoyue Bai, Antoine Deza, František Franěk
2015· article· de· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Computing Autotopism Groups of Partial Latin Rectangles
Rebecca J. Stones, Raúl Manuel Falcón Ganfornina, Daniel Kotlar, Trent G. Marbach
2020· article· en· ACM Journal of Experimental Algorithmics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Lower Bounds on Fast Searching
Donald Stanley, Boting Yang
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
An FPT algorithm for timeline cover
Dondi Riccardo, Manuel Lafond
2025· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Should Static Search Trees Ever Be Unbalanced?
Prosenjit Bose, Karim Douïeb
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Grayscale Two-Dimensional Lempel-Ziv Encoding
Nathanael J. Brittain, Mahmoud R. El-Sakka
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Palindrome Recognition In The Streaming Model
Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer
2014· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Dynamic Succinct Ordered Trees
Arash Farzan, J. Ian Munro
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Tabular construction of balanced codes
I.J. Fair, C Jamieson
2013· article· en· Electronics Letters· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About