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 19 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
Correction to: Algorithms and Data Structures
Anna Lubiw, Mohammad R. Salavatipour, Meng He
2022· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Two-Way Linear Probing Revisited
Luc Devroye, Ebrahim Malalla
2023· article· en· Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Implication of regular expressions
Alex Thomo
2011· article· en· Applied Mathematics Letters· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
GIL: a python package for designing custom indexing primers
Nicholas Mateyko, Omar Tariq, Xinyi E. Chen, Will Cheney, Asfar Lathif Salaudeen, Ishika Luthra +5 more
2023· article· en· Bioinformatics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Regular Expression Matching
Lucian Ilie
2014· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On the Ehrenfeucht–Mycielski sequence
Grzegorz Herman, Michael Soltys
2009· article· pl· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Reconstructing a suffix array
František Franěk, William F. Smyth
2005· article· en· Murdoch Research Repository (Murdoch University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Tight lower bounds for online labeling problem
Jan Bulánek, Michal Koucký, Michael Saks
2011· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
New Algorithms for the Spaced Seeds
Xin Gao, Shuai Cheng Li, Yinan Lu
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Evolving Schemas for Streaming XML
Maryam Shoaran, Alex Thomo
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Basic Video Compression Techniques
Ze-Nian Li, Mark S. Drew, Jiangchuan Liu
2014· book-chapter· en· Texts in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
CRUSH: A New Lossless Compression Algorithm
Evon Abu-Taieh, Issam AlHadid
2018· article· en· Modern Applied Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Information Theory of DNA Shotgun Sequencing
Seyed Abolfazl Motahari, Guy Bresler, David Tse
2012· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
aboutno affunlabeled
StringMasters 2009 & 2010 Special Issue
Jacqueline W. Daykin, Bruce Smyth, Lynette van Zijl
2012· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
1
citations
affunlabeled
Ordering cross-spread gathers
Stewart Trickett
2023· article· en· Geophysics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
A Faster V-order String Comparison Algorithm.
Ali Alatabbi, Jacqueline W. Daykin, Neerja Mhaskar, M. Sohel Rahman, William F. Smyth
2018· article· en· Prague Stringology Conference· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Multidimensional Included and Excluded Sums
Helen Xu, Sean Fraser, Charles E. Leiserson
2021· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About