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 2 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
Word-based self-indexes for natural language text
Antonio Fariña, Nieves R. Brisaboa, Gonzalo Navarro, Francisco Claude, Ángeles S. Places, Eduardo Rodríguez
2012· article· en· ACM Transactions on Information Systems· Computer Science
machine prediction:candidate · noneconsensus · none
79
citations
afffundno abstractunlabeled
Maximal repetitions in strings
Maxime Crochemore, Lucian Ilie
2007· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
76
citations
affno abstractunlabeled
Faster Adaptive Set Intersections for Text Searching
Jérémy Barbay, Alejandro López-Ortíz, Tyler Lu
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
74
citations
affno abstractunlabeled
A simple fast hybrid pattern-matching algorithm
František Franěk, Christopher G. Jennings, W.F. Smyth
2007· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
68
citations
affno abstractunlabeled
Succinct representations of permutations and functions
J. Ian Munro, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
2012· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
67
citations
affno abstractunlabeled
A note on the number of squares in a word
Lucian Ilie
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
65
citations
affunlabeled
Using the Generic Synteny Browser (GBrowse_syn)
Sheldon McKay, Ismael A. Vergara, Jason Stajich
2010· article· en· Current Protocols in Bioinformatics· Computer Science
machine prediction:candidate · noneconsensus · none
61
citations
affunlabeled
Pairwise sequence alignment algorithms
Waqar Haque, Alex Aravind, Bharath Reddy
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
affno abstractunlabeled
How many runs can a string contain?
Simon J. Puglisi, Jamie Simpson, W.F. Smyth
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
affunlabeled
Counting Abelian Squares
L. Bruce Richmond, Jeffrey Shallit
2009· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
affno abstractunlabeled
Efficient Fully-Compressed Sequence Representations
Jérémy Barbay, Francisco Claude, Travis Gagie, Gonzalo Navarro, Yakov Nekrich
2012· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
affunlabeled
Are updatable learned indexes ready?
Chaichon Wongkham, Baotong Lu, Chris Liu, Zhicong Zhong, Eric Lo, Tianzheng Wang
2022· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
afffundno abstractunlabeled
The coolest way to generate combinations
Frank Ruskey, Aaron Williams
2008· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
55
citations
affno abstractunlabeled
LPF Computation Revisited
Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleń
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
52
citations
afffundno abstractunlabeled
Fast pattern-matching on indeterminate strings
Jan Holub, W.F. Smyth, Shu Wang
2006· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
52
citations
affno abstractunlabeled
Succinct Representations of Functions
J. Ian Munro
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
fundno affunlabeled
Approximating Subtree Distances Between Phylogenies
Marı́a Luisa Bonet, Katherine St. John, Ruchi Mahindru, Nina Amenta
2006· article· en· Journal of Computational Biology· Computer Science
machine prediction:candidate · noneconsensus · none
50
citations
affno abstractunlabeled
Towards a Solution to the “Runs” Conjecture
Maxime Crochemore, Lucian Ilie, Liviu Tinta
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
50
citations
affunlabeled
Shortest-substring retrieval and ranking
Charles L. A. Clarke, Gordon V. Cormack
2000· article· en· ACM Transactions on Information Systems· Computer Science
machine prediction:candidate · noneconsensus · none
50
citations
afffundunlabeled
Correcting Illumina data
Michael Molnar, Lucian Ilie
2014· article· en· Briefings in Bioinformatics· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affunlabeled
Representing dynamic binary trees succinctly
J. Ian Munro, Venkatesh Raman, Adam Storm
2001· article· en· Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Succinct Representations of Dynamic Strings
Meng He, J. Ian Munro
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations

How this was built: Screen · Findings · About