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

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
Solving the Sigma-Tau Problem
Joe Sawada, Aaron Williams
2019· article· en· ACM Transactions on Algorithms· Engineering
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
On a Decomposition of Complete Graphs
Hadi Kharaghani, R. Torabi
2003· article· en· Graphs and Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
10
citations
afffundunlabeled
Cayley Graphs of Order <i>27p</i> Are Hamiltonian
Ebrahim Ghaderpour, Dave Witte Morris
2011· article· lv· International Journal of Combinatorics· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
affno abstractunlabeled
V(m,t)'s for m=4,5,6
Christopher Ling, Youxiong Lu, Glynda Rees
2000· article· en· Journal of Statistical Planning and Inference· Engineering
distilled prediction:candidate · noneconsensus · none
10
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
affno abstractunlabeled
Periodic Golay Pairs of Length 72
Dragomir Ž. Ðoković, Ilias Kotsireas
2015· book-chapter· en· Springer proceedings in mathematics & statistics· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
venueno affno abstractunlabeled
On Candelabra Quadruple Systems.
Shaopu Zhang
2011· article· en· Ars Combinatoria· Engineering
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
D-Optimal Matrices of Orders 118, 138, 150, 154 and 174
Dragomir Ž. Ðoković, Ilias Kotsireas
2015· book-chapter· en· Springer proceedings in mathematics & statistics· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
afffundno abstractunlabeled
Finite polytopes have finite regular covers
Barry Monson, Egon Schulte
2013· article· en· Journal of Algebraic Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Super-simple cyclic designs with small values
Kejun Chen, Ruizhong Wei
2006· article· en· Journal of Statistical Planning and Inference· Engineering
distilled prediction:candidate · noneconsensus · none
9
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
affno abstractunlabeled
Lehman matrices
Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2008· article· en· Journal of Combinatorial Theory Series B· Engineering
distilled prediction:candidate · noneconsensus · none
8
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

How this was built: Screen · Findings · About