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
Coding theory and cryptography
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,096 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,096 works in the cohort · of 4,299,418page 4 of 22

Labels cover 0 of 1,096 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,096 of 1,096 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
Aperiodic propagation criteria for Boolean functions
Lars Eirik Danielsen, T. Aaron Gulliver, Matthew G. Parker
2006· article· en· Information and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
La suite de Thue--Morse le long des multiples d'entiers
Johannes F. Morgenbesser, Jeffrey Shallit, Thomas Stoll
2011· article· fr· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
K-Comma Codes and Their Generalizations
Bo Cui, Lila Kari, Shinnosuke Seki
2011· article· en· Fundamenta Informaticae· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
The Coolest Way to Generate Binary Strings
Brett Stevens, Aaron Williams
2013· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
afffundunlabeled
On some permutation polynomials over finite fields
Amir Akbary, Qiang Wang
2005· article· en· International Journal of Mathematics and Mathematical Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Selected Areas in Cryptography – SAC 2016
Howard M. Heys, Roberto Avanzi
2017· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
fundno affno abstractunlabeled
Homogeneous weights and exponential sums
José Felipe Voloch, Judy L. Walker
2003· article· en· Finite Fields and Their Applications· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
afffundunlabeled
Efficient Composited de Bruijn Sequence Generators
Bo Yang, Kalikinkar Mandal, Mark D. Aagaard, Guang Gong
2017· article· en· IEEE Transactions on Computers· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Quaternary Golay sequence pairs II: odd length
Richard G. Gibson, Jonathan Jedwab
2010· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
New Nonbinary Self-Dual Codes
T. Aaron Gulliver, Masaaki Harada
2008· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Binary optimal linear rate 1/2 codes
T. Aaron Gulliver, Patric R. J. Östergård
2004· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
On binary Kloosterman sums divisible by 3
Kseniya Garaschuk, Petr Lisoněk
2008· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Maximum weight spectrum codes
T. L. Alderson, Alessandro Neri
2018· article· en· Advances in Mathematics of Communications· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
← previousnext →

How this was built: Screen · Findings · About