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 16 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
Common Substrings in Random Strings
Eric Blais, Mathieu Blanchette
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Bidirectional Sequential Decoding
Kaiping Li, S. KaIlel
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Algorithms to Compute the Lyndon Array.
František Franěk, A. S. M. Sohidull Islam, M. Sohel Rahman, William F. Smyth
2016· article· en· Murdoch Research Repository (Murdoch University)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Inverted Treaps
Roberto Konow, Gonzalo Navarro, Charles L. A. Clarke, Alejandro López-Ortíz
2017· article· en· ACM Transactions on Information Systems· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Uniform Resource Identifier
Ling Liu, M. TAMER ÖZSU
2009· book-chapter· en· Encyclopedia of Database Systems· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
2
citations
affno abstractunlabeled
A prefix array for parameterized strings
Richard Beal, Donald Adjeroh, W.F. Smyth
2016· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Closest String and Substring Problems
Lusheng Wang, Ming Li, Bin Ma
2014· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Optimum String Match Choices in LZSS
Graham Little, James J. Diamond
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Hardware Accelerator for Genomic Sequence Alignment
Jason Chiang, Michael Studniberg, Jack O. Shaw, Stephen Seto, Kevin Truong
2006· article· en· Conference proceedings· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Space Efficient Construction of Lyndon Arrays in Linear Time
Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, Ian Munro +1 more
2019· preprint· en· Repository KITopen (Karlsruhe Institute of Technology)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Document retrieval with one wildcard
Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
2016· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Compressed depth sequences
Travis Gagie
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
The Generalized Alice HH Vs Bob HT Problem
Svante Janson, Mihai Nica, Simon Nicholas. Segert
2025· article· en· Journal of Theoretical Probability· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Recursive Prefix-Free Parsing for Building Big BWTs
Marco Antônio Oliva, Travis Gagie, Christina Boucher
2023· preprint· en· bioRxiv (Cold Spring Harbor Laboratory)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Unshuffling a Square is NP-Hard
Sam Buss, Michael Soltys
2012· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Succincter Text Indexing with Wildcards
Chris Thachuk
2011· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About