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
Journal of Combinatorial Designs
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.

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

Labels cover 0 of 162 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 162 of 162 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Small latin squares, quasigroups, and loops
Brendan D. McKay, Alison Meynert, Wendy Myrvold
2006· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
159
citations
afffundunlabeled
Hadamard Matrices of Order 32
Hadi Kharaghani, B. Tayfeh‐Rezaie
2012· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
76
citations
affunlabeled
Covering arrays with mixed alphabet sizes
Lucia Moura, John Stardom, Brett Stevens, Alan Williams
2003· article· en· Journal of Combinatorial Designs· Computer Science
distilled prediction:candidate · noneconsensus · none
62
citations
affunlabeled
Group construction of covering arrays
Karen Meagher, Brett Stevens
2004· article· en· Journal of Combinatorial Designs· Computer Science
distilled prediction:candidate · noneconsensus · none
55
citations
affunlabeled
Cops and Robbers on Graphs Based on Designs
Anthony Bonato, Andrea C. Burgess
2012· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
27
citations
afffundunlabeled
Variable strength covering arrays
Sebastian Raaphorst, Lucia Moura, Brett Stevens
2018· article· en· Journal of Combinatorial Designs· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Common intersection designs
Joo‐Young Lee, Douglas R. Stinson
2005· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Mixed covering arrays on graphs
Karen Meagher, Lucia Moura, Latifa Zekaoui
2007· article· en· Journal of Combinatorial Designs· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
afffundunlabeled
On the Hamilton–Waterloo Problem with Odd Orders
Andrea C. Burgess, Peter Danziger, Tommaso Traetta
2016· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Complex Spherical Designs and Codes
Aidan Roy, Sho Suda
2013· article· en· Journal of Combinatorial Designs· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
23
citations
afffundunlabeled
Bush-type Hadamard matrices and symmetric designs
Zvonimir Janko, Hadi Kharaghani, Vladimir D. Tonchev
2001· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
Commuting decompositions of complete graphs
Saieed Akbari, Allen Herman
2006· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
Class-uniformly resolvable designs
Peter Danziger, Brett Stevens
2001· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
On DRC‐covering of K<sub>n</sub> by cycles
Jean‐Claude Bermond, David Coudert, Min‐Li Yu
2003· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
On list coloring Steiner triple systems
Penny Haxell, Martin Pei
2009· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Orthogonal designs via computational algebra
Ilias Kotsireas, Christos Koukouvinos
2006· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Sperner Partition Systems
P. C. Li, Karen Meagher
2012· article· en· Journal of Combinatorial Designs· Mathematics
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Generalized covering designs and clique coverings
R. A. Bailey, Andrea C. Burgess, Michael Cavers, Karen Meagher
2011· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
Triple Systems are Eulerian
Mateja Šajna, Andrew Wagner
2016· article· en· Journal of Combinatorial Designs· Engineering
distilled prediction:candidate · noneconsensus · none
8
citations
next →

How this was built: Screen · Findings · About