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
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 12 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.

afffundunlabeled
String Covering: A Survey
Neerja Mhaskar, W.F. Smyth
2023· article· en· Fundamenta Informaticae· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
fundno affunlabeled
The Cycles of the Multiway Perfect Shuffle Permutation
John Ellis, Hongbing Fan, Jeffrey Shallit
2002· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Range Majorities and Minorities in Arrays
Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2021· preprint· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Bit Recycling with Prefix Codes
Danny Dubé, Vincent Beaudoin
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
A Review of JavaScript Object Notation in Data Analysis
Miaochan Zhou
2022· review· en· Advances in Social Science, Education and Humanities Research/Advances in social science, education and humanities research· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Precision, Local Search and Unimodal Functions
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
2009· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Edit Distance Under Block Operations
Süleyman Cenk Şahinalp
2008· article· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Hamming distance for conjugates
Jeffrey Shallit
2008· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
On two open problems of 2-interval patterns
Shuai Cheng Li, Ming Li
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
String Matching in DNA Databases
Yangjun Chen
2018· article· en· Open Access Biostatistics & Bioinformatics· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Less space: Indexing for queries with wildcards
Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan
2014· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Randomized Algorithms
Jeff Edmonds
2008· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Ranked document selection
J. Ian Munro, Gonzalo Navarro, Rahul Shah, Sharma V. Thankachan
2019· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Two-Dimensional Block Trees
Nieves R. Brisaboa, Travis Gagie, Adrián Gómez‐Brandón, Gonzalo Navarro
2022· article· en· The Computer Journal· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Optimal search trees with 2-way comparisons?
Marek Chrobák, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2016· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Time-Windowed Closest Pair
Timothy M. Chan, Simon Pratt
2015· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
← previousnext →

How this was built: Screen · Findings · About