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 6 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

afffundno abstractunlabeled
On the Wronskian combinants of binary forms
Abdelmalek Abdesselam, Jaydeep Chipalkatti
2006· article· en· Journal of Pure and Applied Algebra· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
The number of irreducible polynomials of degree <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si115.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi></mml:math> over <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si116.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:math> with given trace and constant terms
Behzad Omidi Koma, Daniel Panario, Qiang Wang
2010· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
12
citations
affno abstractunlabeled
Collinear Points in Permutations
Joshua Cooper, József Solymosi
2005· article· en· Annals of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Algebraic quantum synchronizable codes
Kenza Guenda, Giuliano G. La Guardia, T. Aaron Gulliver
2016· article· en· Journal of Applied Mathematics and Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
Wieferich pairs and Barker sequences, II
2014· article· en· LMS Journal of Computation and Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
On Senary Simplex Codes
Manish K. Gupta, David G. Glynn, T. Aaron Gulliver
2001· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
11
citations
venueno affno abstractunlabeled
Double Circulant Self-Dual Codes over GF(5).
T. Aaron Gulliver, Masaaki Harada
2000· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Computing Logarithms in GF (2n)
Ian F. Blake, R. C. Mullin, Scott A. Vanstone
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
11
citations
affno abstractunlabeled
Generating indecomposable permutations
Andrew D. King
2006· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
On Maximum Lee Distance Codes
T. L. Alderson, Svenja Huntemann
2013· article· en· Journal of Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affunlabeled
A modified KZ reduction algorithm
Jinming Wen, Xiao-Wen Chang
2015· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Enumerating Nondegenerate Permutations
Luke O’Connor
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
affno abstractunlabeled
A note on character sums in finite fields
Abhishek Bhowmick, Thai Le, Yuru Liu
2017· article· en· Finite Fields and Their Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Spectral Norm of Symmetric Functions
Anil Ada, Omar Fawzi, Hamed Hatami
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
affunlabeled
Stochastic chase decoder for reed-solomon codes
Romain Heloir, Camille Leroux, Saied Hemati, Matthieu Arzel, Warren J. Gross
2012· preprint· en· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations

How this was built: Screen · Findings · About