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 10 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
Compressed Representations of Graphs
J. Ian Munro, Patrick K. Nicholson
2016· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Lossless data compression by large models
Ziguang Li, Xuliang Wang, Haibo Hu, Cole Wyeth, Dongbo Bu, Quan Yu +3 more
2025· article· en· Nature Machine Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
On the string matching with k mismatches
Yangjun Chen, Yujia Wu
2018· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
A Data-Aware FM-index
Hongwei Huo, Longgang Chen, Heng Zhao, Jeffrey Scott Vitter, Yakov Nekrich, Qiang Yu
2014· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Enumerating Neighbour and Closest Strings
Naomi Nishimura, Narges Simjour
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Data Structures for Path Queries
Meng He, J. Ian Munro, Gelin Zhou
2016· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Independence of Tabulation-Based Hash Classes
Toryn Q. Klassen, Philipp Woelfel
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Wheeler Maps
Andrej Baláž, Travis Gagie, Adrián Goga, Simon Heumos, Gonzalo Navarro, Alessia Petescia +1 more
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About