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

affunlabeled
Binary Gray Codes with Long Bit Runs
Luis Goddyn, Pavol Gvozdjak
2003· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affunlabeled
A new family of Gold-like sequences
Khoongming Khoo, Guang Gong, Douglas R. Stinson
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affno abstractunlabeled
SQIsign2D–West
Andrea Basso, Pierrick Dartois, Luca De Feo, Antonin Leroux, Luciano Maino, Giacomo Pope +2 more
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Dickson polynomials over finite fields
Qiang Wang, Joseph L. Yucas
2012· article· en· Finite Fields and Their Applications· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affunlabeled
Codes and Supersymmetry in One Dimension
Charles F. Doran, Michael Faux, S. James Gates, Tristan Hübsch, Kevin Iga
2011· article· en· UWA Profiles and Research Repository (University of Western Australia)· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affno abstractunlabeled
Asymptotic enumeration of correlation-immune boolean functions
E. Rodney Canfield, Zhicheng Gao, Catherine Greenhill, Brendan D. McKay, Robert W. Robinson
2010· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affunlabeled
Codes and supersymmetry in one dimension
2011· article· en· Advances in Theoretical and Mathematical Physics· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
A bound on the size of separating hash families
Simon R. Blackburn⋆, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha
2008· article· en· Journal of Combinatorial Theory Series A· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
afffundunlabeled
ON SOME CLASSES OF PERMUTATION POLYNOMIALS
Amir Akbary, SEAN ALARIC, Qiang Wang
2008· article· en· International Journal of Number Theory· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
fundno affunlabeled
MULTIPLICATIVE ORDER OF GAUSS PERIODS
Omran Ahmadi, Igor E. Shparlinski, José Felipe Voloch
2010· article· en· International Journal of Number Theory· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
On the Key Equation Over a Commutative Ring
Graham H. Norton, Ana Sălăgean
2000· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Factoring Polynomials Over Local Fields
Sebastian Pauli
2001· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Orthogonal designs and MDS self-dual codes
Masaaki Haeada, Hadi Khaeaghani
2006· article· en· The Australasian Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations

How this was built: Screen · Findings · About