MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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
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 14 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Algorithms in the Ultra-Wide Word Model
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
3
citations
affno abstractunlabeled
Emanation Graph: A New t-Spanner.
2018· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
affunlabeled
Computational Discovery on Jupyter
2023· book· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
The Tandem Duplication Distance Is NP-Hard
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Compressing and indexing aligned readsets
2021· preprint· en· CINECA IRIS Institutial research information system (University of Pisa)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
Large-scale detection of repetitions
2014· article· en· Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Understanding is Compression
2024· preprint· en· Research Square· Computer Science
distilled prediction:candidate · scholarly_communication+open_science+research_integrityconsensus · none
3
citations
affunlabeled
Random suffix search trees
2003· article· en· Random Structures and Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
On a lemma of Crochemore and Rytter
2015· article· de· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Lower Bounds on Fast Searching
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
3
citations
afffundunlabeled
An FPT algorithm for timeline cover
2025· article· en· Journal of Computer and System Sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Should Static Search Trees Ever Be Unbalanced?
2010· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
3
citations
affno abstractunlabeled
Dynamic Succinct Ordered Trees
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About