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

aboutno affunlabeled
Walks in the Quarter Plane with Multiple Steps
Manuel Kauers, Rika Yatchak
2015· article· fr· Discrete Mathematics & Theoretical Computer Science· Engineering
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Super-simple (ν, 5, 5) Designs
Kejun Chen, Ruizhong Wei
2006· article· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
26
citations
afffundno abstractunlabeled
Bounds on permutation codes of distance four
Peter J. Dukes, Natalie Sawchuck
2009· article· en· Journal of Algebraic Combinatorics· Engineering
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Common intersection designs
Joo‐Young Lee, Douglas R. Stinson
2005· article· en· Journal of Combinatorial Designs· Engineering
machine prediction:candidate · noneconsensus · none
25
citations
afffundunlabeled
Generating potentially nilpotent full sign patterns
In‐Jae Kim, D.D. Olesky, Bryan L. Shader, P. van den Driessche, Hein van der Holst, Kevin N. Vander Meulen
2009· article· en· Electronic Journal of Linear Algebra· Engineering
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Integer least squares
Sanzheng Qiao
2008· article· en· Engineering
machine prediction:candidate · noneconsensus · none
24
citations
afffundno abstractunlabeled
Circuits and Expressions with Nonassociative Gates
Cristopher Moore, Denis Thérien, François Lemieux, Joshua Berman, Arthur A. Drisko
2000· article· en· Journal of Computer and System Sciences· Engineering
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Bicolouring Steiner systems S(2,4,v)
Mario Gionfriddo, Lorenzo Milazzo, A. Rosa, Vitaly Voloshin
2004· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
24
citations
afffundno abstractunlabeled
Computing Rational Forms of Integer Matrices
Mark Giesbrecht, Arne Storjohann
2002· article· en· Journal of Symbolic Computation· Engineering
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Circulant partial Hadamard matrices
R. Craigen, Gabriel Faucher, Richard M. Low, T. Wares
2013· article· en· Linear Algebra and its Applications· Engineering
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Cyclic BSEC of block size 3
Ruizhong Wei
2002· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
Bush-type Hadamard matrices and symmetric designs
Zvonimir Janko, Hadi Kharaghani, Vladimir D. Tonchev
2001· article· en· Journal of Combinatorial Designs· Engineering
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Poset edge-labellings and left modularity
Peter R. W. McNamara, Hugh Thomas
2004· article· en· European Journal of Combinatorics· Engineering
machine prediction:candidate · noneconsensus · none
21
citations
venueno affno abstractunlabeled
Multidecompositions of the complete graph.
Atif A. Abueida, Mike Daven
2004· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Extremal properties of ray-nonsingular matrices
geun-ho Lee, Judith J. McDonald, Bryan L. Shader, Michael J. Tsatsomeros
2000· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
20
citations
afffundunlabeled
Ideal Clutters That Do Not Pack
Ahmad Abdi, Kanstantsin Pashkovich, Gérard Cornuéjols
2017· article· en· Mathematics of Operations Research· Engineering
machine prediction:candidate · noneconsensus · none
20
citations
afffundno abstractunlabeled
Existence of (v,{5,w∗},1)-PBDs
F.E. Bennett, Yanxun Chang, Gennian Ge, Malcolm Greig
2003· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Further explorations into ternary complementary pairs
R. Craigen, S. Georgiou, Will Gibson, Christos Koukouvinos
2006· article· en· Journal of Combinatorial Theory Series A· Engineering
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Perfect dexagon triple systems
C.C. Lindner, A. Rosa
2007· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Doubly regular digraphs and symmetric designs
Yury J. Ionin, Hadi Kharaghani
2003· article· en· Journal of Combinatorial Theory Series A· Engineering
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Combinatorial designs
Douglas R. Stinson
2008· article· en· ACM SIGACT News· Engineering
machine prediction:candidate · noneconsensus · none
19
citations

How this was built: Screen · Findings · About