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 4 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
Unshuffling a square is NP-hard
Sam Buss, Michael Soltys
2013· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
Succinct ordinal trees based on tree covering
Meng He, J. Ian Munro, Srinivasa Rao Satti
2012· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Euclidean strings
John Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Universal Succinct Representations of Trees?
Arash Farzan, Rajeev Raman
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
fundno affunlabeled
Dynamic lightweight text compression
Nieves R. Brisaboa, Antonio Fariña, Gonzalo Navarro, José R. Paramá
2010· article· en· ACM Transactions on Information Systems· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Data Mining in E-Learning
Khaled M. Hammouda, Mohamed S. Kamel
2007· book-chapter· en· Advanced information and knowledge processing· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Parallelizing Feature Selection
Jerffeson Souza, Stan Matwin, Nathalie Japkowicz
2006· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affunlabeled
VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
Anne Bergeron, Sylvie Hamel
2002· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affunlabeled
String regularities with don't cares
C.S. Iliopoulos, M. R. Mohamed, L. Mouchard, K. Perdikuri, Bill Smyth, A. Tsakalidis
2002· preprint· en· Murdoch Research Repository (Murdoch University)· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Sorting multisets and vectors in-place
J. Ian Munro, Venkatesh Raman
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affunlabeled
Locality-Based pruning methods for web search
Edleno Silva de Moura, Celia Francisca dos Santos, Bruno Araujo, Altigran Soares da Silva, Pável Calado, Mário A. Nascimento
2008· article· en· ACM Transactions on Information Systems· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
fundno affno abstractunlabeled
FM-index of alignment: A compressed index for similar strings
Joong Chae Na, Hyunjoon Kim, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard +1 more
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affunlabeled
Partial-Expansion A* with Selective Node Generation
Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan Sturtevant +2 more
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Rpair: Rescaling RePair with Rsync
Travis Gagie, I Tomohiro, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Yoshimasa Takabatake
2019· book-chapter· en· CINECA IRIS Institutial research information system (University of Pisa)· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Enhanced string covering
Tomáš Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W.F. Smyth +1 more
2013· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Compressed Data Structures for Dynamic Sequences
J. Ian Munro, Yakov Nekrich
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
← previousnext →

How this was built: Screen · Findings · About