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 18 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.

affunlabeled
Encoding Quadrilateral Meshes in 2.40 bits per Vertex.
Pawel Kosicki, Asish Mukhopadhyay
2004· article· en· Indian Conference on Computer Vision, Graphics and Image Processing· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Pseudo-inversion: closure properties and decidability
Da-Jung Cho, Yo-Sub Han, Shindong Kang, Hwee Kim, Sang‐Ki Ko, Kai Salomaa
2015· article· en· Natural Computing· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
FORMAL MODELLING OF VIRAL GENE COMPRESSION
Mark Daley, Ian McQuillan
2005· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
AmpliconTagger pipeline databases
Julien Tremblay
2019· dataset· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
New architectures for systolic hashing
G. Panneerselvam, G.A. Jullien, William C. Miller
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Non-repetitive Strings over Alphabet Lists
Neerja Mhaskar, Michael Soltys
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On Suffix Tree Detection
Amihood Amir, Eitan Kondratovsky, Avivit Levy
2023· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Pseudopower Avoidance
Ehsan Chiniforooshan, Lila Kari, Zhi Xu
2012· preprint· en· Fundamenta Informaticae· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Google and the Page Rank Algorithm
Christiane Rousseau, Yvan Saint-Aubin
2008· book-chapter· en· Springer undergraduate texts in mathematics and technology· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Prefix-Free Parsing for Merging Big BWTs
Diego Diaz-Domínguez, Travis Gagie, Veronica Guerrini, Ben Langmead, Zsuzsanna Lipták, Giovanni Manzini +2 more
2025· article· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Computing Maximal Covers for Protein Sequences
G. Brian Golding, Holly Koponen, Neerja Mhaskar, W.F. Smyth
2022· article· en· Journal of Computational Biology· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Two-way Linear Probing Revisited
Luc Devroye, Ebrahim Malalla
2023· preprint· en· Preprints.org· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Multidimensional Range Selection
Timothy M. Chan, Gelin Zhou
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Text Indexing and Searching in Sublinear Time
J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2017· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Alternative Algorithms for Lyndon Factorization
Sukhpal Singh Ghuman, Emanuele Giaquinta, Jorma Tarhio
2014· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Hierarchy Encoding with Multiple Genes
Martin F. van Bommel, Ping Wang
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Bumpless pipe dreams meet puzzles
Neil J. Y. Fan, Peter L. Guo, Rui Xiong
2025· article· en· Advances in Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Loop Free Generation of<i>K</i>-Ary Trees
Dominique Roelants van Baronaigien
2000· article· en· American Journal of Mathematical and Management Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Path Spectra and Forbidden Families.
Allen G. Fuller, Ronald J. Gould
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On the top-down tree inclusion
Yangjun Chen, Yibin Chen
2006· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Copy number variation
2009· article· en· ˜The œbiomedical & life sciences collection.· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Simple Balanced Binary Search Trees
2014· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
The Most Likely Object to be Seen Through a Window
Paz Carmi, Farah Chanchary, Anil Maheshwari, Michiel Smid
2019· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Introduction to the SK model
Dmitry Panchenko
2014· preprint· en· Current Developments in Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Efficient Parallel Boolean Expression Matching
Shuping Ji, Jianguo Yao, Wei Wang, Jun Wei, Hans‐Arno Jacobsen
2025· article· en· ACM Transactions on Database Systems· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About