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 9 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
Dynamic Shannon Coding
Travis Gagie
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundunlabeled
Flexible protein database based on amino acid k-mers
Maxime Déraspe, Sébastien Boisvert, François Laviolette, Paul H. Roy, Jacques Corbeil
2022· article· en· Scientific Reports· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
A fast algorithm to generate Beckett-Gray codes
Joe Sawada, Dennis Wong
2007· article· en· Electronic Notes in Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
A Graphical XQuery Language Using Nested Windows
Zheng Qin, Benjamin Bin Yao, Ying‐Bin Liu, Michael McCool
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
A True Random Generator Using Human Gameplay
Mohsen Alimomeni, Reihaneh Safavi–Naini, Setareh Sharifian
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
On the Longest Common Rigid Subsequence Problem
Bin Ma, Kaizhong Zhang
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Fast circular dictionary-matching algorithm
Tanver Athar, Carl Barton, Widmer Bland, Jia Gao, Costas S. Iliopoulos, Chang Liu +1 more
2015· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Generating bracelets with fixed content
Saira Karim, Joe Sawada, Zareen Alamgir, Syed Muhammad Husnine
2012· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
fundno affunlabeled
On Nonlinear Learned String Indexing
Paolo Ferragina, Marco Frasca, Giosuè Cataldo Marinò, Giorgio Vinciguerra
2023· article· en· IEEE Access· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
A d-Step Approach for Distinct Squares in Strings
Antoine Deza, František Franěk, Mei Jiang
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
Towards a practical O(n logn) phylogeny algorithm
Jakub Truszkowski, Yanqi Hao, Daniel G. Brown
2012· article· en· Algorithms for Molecular Biology· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
How Suboptimal Is the Shannon Code?
Hamed Narimani, Mohammadali Khosravifard, T. Aaron Gulliver
2012· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
RECONSTRUCTING A SUFFIX ARRAY
František Franěk, William F. Smyth
2006· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On Hardness of Several String Indexing Problems
Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan
2014· book-chapter· en· Lecture notes in computer science· 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
← previousnext →

How this was built: Screen · Findings · About