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

venueno affno abstractunlabeled
The digraphs from finite fields.
Yangjiang Wei, Gaohua Tang
2011· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Low complexity binary words avoiding $(5/2)^+$-powers
James D. Currie, Narad Rampersad
2025· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · sts
0
citations
affunlabeled
Strictly chained (p,q)-ary partitions
Laurent Imbert, Fabrice Philippe
2012· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Codes and noncommutative stochastic matrices
Sylvain Lavallée, Dominique Perrin, Vladimir Retakh, Christophe Reutenauer
2010· article· en· Journal of Noncommutative Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The Density of Ternary Barker Sequences
Tomas Boothby
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/b978-044488002-4/50018-x
2000· book-chapter· en· Time to knit· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Abstract only
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
2010· article· en· ACM communications in computer algebra· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
0
citations
affno abstractunlabeled
Kneser–Hecke-Operators for Codes over Finite Chain Rings
Amy Feaver, Anna Haensch, Jingbo Liu, Gabriele Nebe
2016· book-chapter· en· Association for Women in Mathematics series· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Victor Timofeevich Markov (21.06.1948–15.07.2019)
Nikolai Adrianov, В. А. Артамонов, И. Н. Балаба, Yu. A. Bahturin, L. A. Bokut, V. V. Borisenko +39 more
2022· article· de· Journal of Mathematical Sciences· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+insufficient_payloadconsensus · none
0
citations
fundno affunlabeled
The reflection complexity of sequences over finite alphabets
Jean‐Paul Allouche, John M. Campbell, Jeffrey Shallit, Manon Stipulanti
2024· preprint· en· Open Repository and Bibliography (University of Liège)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Semisymmetric Cubic Graphs Of Order 10p n .
Азам Бабаи, Behrooz Khosravi
2017· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Randomness and Discrepancy Transforms
Guang Gong
2006· book-chapter· en· Kluwer Academic Publishers eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Historical Introduction
Solomon W. Golomb, Guang Gong
2005· book-chapter· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
CIRI-CIRI POLINOMIAL PERMUTASI ATAS FINITE FIELD
Aini Suri Talita, Sri Mardiyati, Helen Burhan
2013· article· id· UG Jurnal· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
← previousnext →

How this was built: Screen · Findings · About