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 3 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
Linear-Space Data Structures for Range Mode Query in Arrays
Timothy M. Chan, Stéphane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson
2013· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
Succinct Representation of Labeled Graphs
Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
2010· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affunlabeled
Improving the performance of list intersection
Dimitris Tsirogiannis, Sudipto Guha, Nick Koudas
2009· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
afffundno abstractunlabeled
How many double squares can a string contain?
Antoine Deza, František Franěk, Adrien Thierry
2014· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
Succinct encoding of arbitrary graphs
Arash Farzan, J. Ian Munro
2013· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Compressed String Dictionaries
Nieves R. Brisaboa, Rodrigo Cánovas, Francisco Claude, Miguel A. Martínez‐Prieto, Gonzalo Navarro
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Shorthand Universal Cycles for Permutations
Alexander E. Holroyd, Frank Ruskey, Aaron Williams
2011· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Reordering columns for smaller indexes
Daniel Lemire, Owen Kaser
2011· article· en· Information Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affno abstractunlabeled
Succinct Representations of Arbitrary Graphs
Arash Farzan, J. Ian Munro
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affunlabeled
Automatic method completion
R HILL, Jai Ram Rideout
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Fast construction of wavelet trees
J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
The Greedy Gray Code Algorithm
Aaron Williams
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affunlabeled
Jaudio: Additions And Improvements.
Daniel McEnnis, Cory McKay, Ichiro Fujinaga
2006· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
afffundno abstractunlabeled
The “runs” conjecture
Maxime Crochemore, Lucian Ilie, Liviu Tinta
2010· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
Periodicity in Streams
Funda Ergün, Hossein Jowhari, Mert Sağlam
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Approximate Range Mode and Range Median Queries
Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affunlabeled
Distributed information-theoretic clustering
Georg Pichler, Pablo Piantanida, Gerald Matz
2021· article· en· Information and Inference A Journal of the IMA· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
afffundno abstractunlabeled
Longest increasing subsequences in sliding windows
Michael Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortíz, Mohammad Ali Safari
2004· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
aboutno affunlabeled
Skip Context Tree Switching
Marc G. Bellemare, Joel Veness, Erik Talvitie
2014· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Approximate periods of strings
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, W.F. Smyth
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Walking on Real Numbers
Francisco J. Aragón Artacho, David H. Bailey, Jonathan M. Borwein, Peter Borwein
2012· article· en· The Mathematical Intelligencer· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affunlabeled
Faster and smaller inverted indices with treaps
Roberto Konow, Gonzalo Navarro, Charles L. A. Clarke, Alejandro López-Ortíz
2013· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations

How this was built: Screen · Findings · About