MétaCan
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.

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 1 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
On constructing permutations of finite fields
Amir Akbary, Dragos Ghioca, Qiang Wang
2010· article· en· Finite Fields and Their Applications· Computer Science
machine prediction:candidate · noneconsensus · none
199
citations
affunlabeled
Handbook of Finite Fields
Gary L. Mullen, Daniel Panario
2013· book· ru· Computer Science
machine prediction:candidate · noneconsensus · none
189
citations
affno abstractunlabeled
Equations over finite fields
Gary L. Mullen, Qiang Wang
2013· book· en· Computer Science
machine prediction:candidate · noneconsensus · none
92
citations
affno abstractunlabeled
Good S-Boxes Are Easy To Find
Carlisle Adams, S.E. Tavares
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
91
citations
affunlabeled
Constructions of Mutually Unbiased Bases
Andreas Klappenecker, Martin Roetteler
2003· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
90
citations
affno abstractunlabeled
Hyper-bent Functions
Amr Youssef, Guang Gong
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
89
citations
affno abstractunlabeled
Algorithms for Exponentiation in Finite Fields
Shuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup
2000· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
89
citations
affunlabeled
Polyphase Sequences With Low Autocorrelation
Peter Borwein, Roger Ferguson
2005· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
86
citations
affno abstractunlabeled
Integer Factoring
Arjen K. Lenstra
2000· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
76
citations
affno abstractunlabeled
On the statistical properties of Diffie-Hellman distributions
Ran Canetti, John Friedlander, Sergeĭ Konyagin, Michael Larsen, Daniel Lieman, Igor E. Shparlinski
2000· article· en· Israel Journal of Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
74
citations
affno abstractunlabeled
On self-dual codes over some prime fields
Koichi Betsumiya, S. Georgiou, T. Aaron Gulliver, Masaaki Harada, Christos Koukouvinos
2003· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
72
citations
affunlabeled
Character sums with exponential functions
John Friedlander, Jan Hansen, Igor E. Shparlinski
2000· article· en· Mathematika· Computer Science
machine prediction:candidate · noneconsensus · none
71
citations
affunlabeled
On the Construction of Skew Quasi-Cyclic Codes
Taher Abualrub, Ali Ghrayeb, Nuh Aydın, İrfan Şiap
2010· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
55
citations
affunlabeled
Permutation binomials over finite fields
Ariane M. Masuda, Michael E. Zieve
2009· article· lv· Transactions of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
55
citations
affno abstractunlabeled
On permutation polynomials of prescribed shape
Amir Akbary, Dragos Ghioca, Qiang Wang
2008· article· en· Finite Fields and Their Applications· Computer Science
machine prediction:candidate · noneconsensus · none
52
citations
afffundno abstractunlabeled
ETRU: NTRU over the Eisenstein integers
Katherine Jarvis, Monica Nevins
2013· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
New Maximal Arcs in Desarguesian Planes
Rudolf Mathon
2002· article· en· Journal of Combinatorial Theory Series A· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affunlabeled
Squaring in cyclotomic subgroups
Koray Karabina
2012· article· en· Mathematics of Computation· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations

How this was built: Screen · Findings · About