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 5 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
Enhanced string covering
Tomáš Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W.F. Smyth +1 more
2013· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Compressed Data Structures for Dynamic Sequences
J. Ian Munro, Yakov Nekrich
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
afffundno abstractunlabeled
Computing the Longest Previous Factor
Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleń
2012· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
On the Structure of Small Motif Recognition Instances
Christina Boucher, Daniel G. Brown, Stéphane Durocher
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
A new tree inclusion algorithm
Yangjun Chen
2006· article· en· Information Processing Letters· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
afffundunlabeled
Closest string with outliers
Christina Boucher, Bin Ma
2011· article· en· BMC Bioinformatics· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
PHONI: Streamed Matching Statistics with Multi-Genome References
Christina Boucher, Travis Gagie, I Tomohiro, Dominik Köppl, Ben Langmead, Giovanni Manzini +3 more
2021· article· en· CINECA IRIS Institutial research information system (University of Pisa)· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affunlabeled
Time-Optimal Top-$k$ Document Retrieval
Gonzalo Navarro, Yakov Nekrich
2017· article· en· SIAM Journal on Computing· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
Strongly Universal String Hashing is Fast
Daniel Lemire, Owen Kaser
2013· article· en· The Computer Journal· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundno abstractunlabeled
Fixed topology alignment with recombination
Lusheng Wang, Bin Ma, Ming Li
2000· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
Joint Classification and Pairing of Human Chromosomes
P. Biyani, Xiaolin Wu, Abhijit Sinha
2005· article· en· IEEE/ACM Transactions on Computational Biology and Bioinformatics· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
String matching with alphabet sampling
Francisco Claude, Gonzalo Navarro, Hannu Peltola, Leena Salmela, Jorma Tarhio
2010· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
A SIMPLE ALPHABET-INDEPENDENT FM-INDEX
Szymon Grabowski, Gonzalo Navarro, Rafal Przywarski, Alejandro Salinger, Veli Mäkinen
2006· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Contrasting Sequence Groups by Emerging Sequences
Kang Deng, Osmar R. Zai͏̈ane
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Palindromic rich words and run-length encodings
Chuan Guo, Jeffrey Shallit, Arseny M. Shur
2016· article· en· Information Processing Letters· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
A Survey of Data Structures in the Bitprobe Model
Patrick K. Nicholson, Venkatesh Raman
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
afffundno abstractunlabeled
On the longest increasing subsequence of a circular list
Michael Albert, M. D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro
2006· article· en· Information Processing Letters· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
afffundunlabeled
PFP Compressed Suffix Trees
Christina Boucher, Ondřej Cvacho, Travis Gagie, Jan Holub, Giovanni Manzini, Gonzalo Navarro +1 more
2021· article· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Succinct representation of dynamic trees
Arash Farzan, J. Ian Munro
2010· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
afffundno abstractunlabeled
Fun-Sort—or the chaos of unordered binary search
Thérèse Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James King +1 more
2004· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations

How this was built: Screen · Findings · About