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
graph theory and CDMA systems
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,464 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,464 works in the cohort · of 4,299,418page 1 of 30

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

affunlabeled
SCMA Codebook Design
Mahmoud Taherzadeh, Hosein Nikopour, Alireza Bayesteh, Hadi Baligh
2014· article· en· Engineering
distilled prediction:candidate · noneconsensus · none
642
citations
affno abstractunlabeled
Cycle Decompositions of K and K−I
Brian Alspach, Heather Gavlas
2001· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
261
citations
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
afffundno abstractunlabeled
On the injective chromatic number of graphs
Geňa Hahn, Jan Kratochvı́l, Jozef Širáň, Dominique Sotteau
2002· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
134
citations
fundno affunlabeled
On Linear Layouts of Graphs
Vida Dujmović, David R. Wood
2004· article· en· Discrete Mathematics & Theoretical Computer Science· Engineering
distilled prediction:candidate · noneconsensus · none
116
citations
affno abstractunlabeled
On constant composition codes
Wensong Chu, Charles J. Colbourn, Peter J. Dukes
2005· article· en· Discrete Applied Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
102
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
affno abstractunlabeled
Packing Non-Zero A-Paths In Group-Labelled Graphs
Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis Goddyn, Michael Lohman, Paul Seymour
2006· article· en· COMBINATORICA· Engineering
distilled prediction:candidate · noneconsensus · none
70
citations
affno abstractunlabeled
On generalized separating hash families
Douglas R. Stinson, Ruizhong Wei, K. Chen
2007· article· en· Journal of Combinatorial Theory Series A· Engineering
distilled prediction:candidate · noneconsensus · none
63
citations
afffundno abstractunlabeled
Tree-like Properties of Cycle Factorizations
I. P. Goulden, Alexander Yong
2002· article· en· Journal of Combinatorial Theory Series A· Engineering
distilled prediction:candidate · noneconsensus · none
61
citations
affno abstractunlabeled
A Characterization of Weakly Bipartite Graphs
Bertrand Guenin
2001· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
53
citations
affno abstractunlabeled
Spanning spiders and light-splitting switches
Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
2004· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
51
citations
afffundno abstractunlabeled
Covering arrays on graphs
Karen Meagher, Brett Stevens
2005· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
50
citations
affno abstractunlabeled
Resolving sets for Johnson and Kneser graphs
R. A. Bailey, José Cáceres, Delia Garijo, Antonio González, Alberto Márquez, Karen Meagher +1 more
2012· article· en· European Journal of Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Divisible design graphs
Willem H. Haemers, Hadi Kharaghani, Maaike A. Meulenberg
2010· article· en· Journal of Combinatorial Theory Series A· Engineering
distilled prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
The packing property
Gérard Cornuéjols, Bertrand Guenin, François Margot
2000· article· en· Mathematical Programming· Engineering
distilled prediction:candidate · noneconsensus · none
43
citations
afffundno abstractunlabeled
Williamson matrices up to order 59
W. H. Holzmann, Hadi Kharaghani, B. Tayfeh‐Rezaie
2008· article· en· Designs Codes and Cryptography· Engineering
distilled prediction:candidate · noneconsensus · none
39
citations
afffundunlabeled
Quantum conical designs
Matthew A. Graydon, D. M. Appleby
2016· article· en· Journal of Physics A Mathematical and Theoretical· Engineering
distilled prediction:candidate · noneconsensus · none
38
citations
next →

How this was built: Screen · Findings · About