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 13 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
Viral Genome Compression
Lucian Ilie, Liviu Tinta, Cristian D. Popescu, Kathleen A. Hill
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Stream Experiments: Toward Latency Hiding in GPGPU
Supada Laosooksathit, C. Leangsuksun, Abdelkader Baggag, Charles F. Chandler
2010· article· en· Parallel and Distributed Computing and Networks· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
String covering with optimal covers
Neerja Mhaskar, W.F. Smyth
2018· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Fast Structured Motif Search in DNA Sequences
Mihail Halachev, Nematollaah Shiri
2008· book-chapter· en· Communications in computer and information science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Time-Windowed Closest Pair
Timothy M. Chan, Simon Pratt
2015· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Compressed indexes for text with wildcards
Chris Thachuk
2012· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Evaluation of General Set Expressions
Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Probability Distillation: A Caveat and Alternatives.
Chin-Wei Huang, Faruk Ahmed, Kundan Kumar, Alexandre Lacoste, Aaron Courville
2019· article· en· Uncertainty in Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Improved Time and Space Bounds for Dynamic Range Mode
Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
The Longest Subsequence-Repeated Subsequence Problem
Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu
2023· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Non-uniform Random Variate Generation
Pierre L’Ecuyer
2025· book-chapter· en· International Encyclopedia of Statistical Science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
CSTs for Terabyte-Sized Data
Marco Antônio Oliva, Davide Cenzato, Massimiliano Rossi, Zsuzsanna Lipták, Travis Gagie, Christina Boucher
2022· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Two squares canonical factorization
Haoyue Bai, František Franěk, William F. Smyth
2014· article· en· Prague Stringology Conference· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
fundno affunlabeled
The Height of List-tries and TST
Nicolas Broutin, Luc Devroye
2007· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
On (a,b) pairs in random Fibonacci sequences
Kevin G. Hare, JOHN C. SAUNDERS
2018· article· en· Journal of Number Theory· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Incremental computation with names
Matthew A. Hammer, Jana Dunfield, Kyle Headley, Nicholas Labich, Jeffrey S. Foster, Michael Hicks +1 more
2015· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Restructuring ordered binary trees
William Evans, David Kirkpatrick
2000· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
4
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
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

How this was built: Screen · Findings · About