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

venueno affunlabeled
Fixed mesh shape reduces variability in codend size selection
Zita Bak-Jensen, Bent Herrmann, Juan Santos, Nadine Jacques, Valentina Melli, Jordan P. Feekings
2022· article· en· Canadian Journal of Fisheries and Aquatic Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Repetition Complexity of Words
Lucian Ilie, Sheng Yü, Kaizhong Zhang
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Combinatorial Pattern Matching
Raffaele Giancarlo, David Sankoff
2000· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
Universal finitary codes with exponential tails
Nate Harvey, Alexander E. Holroyd, Yuval Peres, Dan Romik
2006· article· en· Proceedings of the London Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Array Range Queries
Matthew Skala
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Analysis of random LC tries
Luc Devroye
2001· article· en· Random Structures and Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Document Listing on Versioned Documents
Francisco Claude, J. Ian Munro
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
14
citations
affunlabeled
Algorithms and Complexity on Indexing Founder Graphs
Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
2022· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
aboutno affunlabeled
FPGA systolic array GZIP compressor
Ovidiu Plugariu, Alexandru Dumitru Gegiu, Lucian Petrică
2017· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
Movi: a fast and cache-efficient full-text pangenome index
Mohsen Zakeri, Nathaniel K. Brown, Omar Ahmed, Travis Gagie, Ben Langmead
2023· preprint· en· bioRxiv (Cold Spring Harbor Laboratory)· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
A Fast and Small Subsampled R-Index
2020· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
On hardness of several string indexing problems
Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
Free energy coding
Brendan J. Frey, Geoffrey E. Hinton
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Efficient Regular Polygon Dissections
Evangelos Kranakis, Danny Kriz̧anc, Jorge Urrutia
2000· article· en· Geometriae Dedicata· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Textual image compression
Ian H. Witten, Tim Bell, Matt Harrison, Mark James, Alistair Moffat
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Compressing multisets using tries
Vincent Gripon, Michael Rabbat, Vitaly Skachek, Warren J. Gross
2012· preprint· en· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Succinct Representation of Labeled Graphs
Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Range Majority in Constant Time and Linear Space
Stéphane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
A Simple Fast Hybrid Pattern-Matching Algorithm
František Franěk, Christopher G. Jennings, William F. Smyth
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Palindrome recognition using a multidimensional tape
Thérèse Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, MohammadTaghi Hajiaghayi, Tomáš Vinař
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
New complexity results for the k-covers problem
Costas S. Iliopoulos, Manal Mohamed, W.F. Smyth
2011· article· en· Information Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
← previousnext →

How this was built: Screen · Findings · About