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

venueno affno abstractunlabeled
Irreducible cyclic codes of length 2pn.
Anuradha Sharma, Gurmeet K. Bakshi, V. C. Dumir, Madhu Raka
2007· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Generating subfields
Mark van Hoeij, Jürgen Klüners, Andrew Novocin
2012· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
On ternary Kloosterman sums modulo 12
Kseniya Garaschuk, Petr Lisoněk
2008· article· en· Finite Fields and Their Applications· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
Theory and Applications of Finite Fields
Gary L. Mullen, Svetla Nikova⋆, Daniel Panario, Leo Storme
2012· book· en· Contemporary mathematics - American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
venueno affno abstractunlabeled
Cross recurrence relations for r-Lah numbers.
Hacène Belbachir, Amine Belkhir
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Linear transformation shift registers
Michael Dewar, Daniel Panario
2003· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
Blocking sets, minimal codes and trifferent codes
Anurag Bishnoi, Jozefien D’haeseleer, Dion Gijswijt, Aditya Potukuchi
2024· article· en· Journal of the London Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
Optimal parameters for the WG stream cipher family
Kalikinkar Mandal, Guang Gong, Xinxin Fan, Mark D. Aagaard
2013· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Counting hyperelliptic curves
Enric Nart
2009· article· en· Advances in Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations

How this was built: Screen · Findings · About