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
Designs Codes and Cryptography
Topic
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.

159 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.
159 works in the cohort · of 4,299,418page 3 of 4

Labels cover 0 of 159 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 159 of 159 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.

afffundno abstractunlabeled
Anonymity in shared symmetric key primitives
Gregory M. Zaverucha, Douglas R. Stinson
2010· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Sharper bounds on four lattice constants
Jinming Wen, Xiao-Wen Chang
2022· article· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
A Family of Complete Caps in PG (n, 2)
Petr Lisoněk, Mahadad Khatirinejad
2005· article· en· Designs Codes and Cryptography· Mathematics
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Group divisible designs in MOLS of order ten
Peter J. Dukes, Leah Howard
2012· article· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Lexicodes over rings
Kenza Guenda, T. Aaron Gulliver, S. Arash Sheikholeslam
2013· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
On orthogonal generalized equitable rectangles
H. Cao, Jeffrey H. Dinitz, Donald L. Kreher, Douglas R. Stinson, Ruizhong Wei
2009· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Diagonally cyclic equitable rectangles
Anthony B. Evans, David Fear, Rebecca J. Stones
2014· article· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Nets of Small Degree Without Ovals
David A. Drake, Wendy Myrvold
2004· article· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Constructions for retransmission permutation arrays
Jeffrey H. Dinitz, Maura B. Paterson, Douglas R. Stinson, Ruizhong Wei
2012· article· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Unbiased weighing matrices of weight 9
Makoto Araya, Masaaki Harada, Hadi Kharaghani, Sho Suda, Wenbao Yu
2025· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Near-factorizations of dihedral groups
Donald L. Kreher, Maura B. Paterson, Douglas R. Stinson
2025· article· en· Designs Codes and Cryptography· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Covers and partial transversals of Latin squares
Darcy Best, Trent G. Marbach, Rebecca J. Stones, Ian M. Wanless
2018· preprint· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Maximal nonassociativity via fields
Petr Lisoněk
2020· preprint· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About