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

fundno affunlabeled
Uniform generation of random regular graphs
Pu Gao, Nicholas Wormald
2015· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Suffix trees and string complexity
Luke O’Connor, Tim Snider
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Partition Tree Weighting
Joel Veness, Martha White, Michael Bowling, András György
2012· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Lossless Compression Algorithms
Ze-Nian Li, Mark S. Drew, Jiangchuan Liu
2014· book-chapter· en· Texts in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
OVERLAY PROBLEMS FOR MUSIC AND COMBINATORICS 1,2
Julien Allali, Pavlos Antoniou, Pascal Ferraro, Costas S. Iliopoulos, Spiros Michalakopoulos
2010· preprint· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Enhanced static Fano coding
Luis Rueda, B. John Oommen
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Parameterized strategy pattern
Ognjen Sobajic, Mahmood Moussavi, Behrouz H. Far
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Low space data structures for geometric range mode query
Stéphane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
ART-Owen Scrambling
Abdalla G. M. Ahmed, Matt Pharr, Peter Wonka
2023· article· en· ACM Transactions on Graphics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Fast searches in a recommendation session
Yingwei Wang, N. Cercone
2002· article· en· Mathematical and Computer Modelling· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Permuted scaled matching
Ayelet Butman, Noa Lewenstein, J. Ian Munro
2016· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Path queries on functions
Travis Gagie, Meng He, Gonzalo Navarro
2018· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Semantic data compression
Gary Promhouse, Malcolm J. Bennett
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Forest in the Clouds: Navigating Big Data with GRP and RFC
Dhritiman Mukherjee, Aman Anand, R. L. Banik, Ritwik Satpati, S. K. Bhattacharyya, P. Paul
2024· book-chapter· en· Lecture notes in networks and systems· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
aboutno affunlabeled
PPM compression without escapes
Peter Fenwick
2011· article· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About