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

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

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

affno abstractunlabeled
Binary optimal linear rate 1/2 codes
T. Aaron Gulliver, Patric R. J. Östergård
2004· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Addressing the Petersen graph
Randall J. Elzinga, David A. Gregory, Kevin N. Vander Meulen
2004· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
17
citations
fundno affno abstractunlabeled
Combinatorial pseudo-triangulations
David Orden, Francisco Santos, Brigitte Servatius, Herman Servatius
2006· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Locating patterns in the de Bruijn torus
Victoria Horan, Brett Stevens
2015· article· nl· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Linearized Wenger graphs
Xiwang Cao, Mei Lu, Daqing Wan, Liping Wang, Qiang Wang
2015· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Cover starters for covering arrays of strength two
Jason R. Lobb, Charles J. Colbourn, Peter Danziger, Brett Stevens, José Torres-Jiménez
2011· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Altitude of regular graphs with girth at least five
Christina M. Mynhardt, Alewyn P. Burger, T.C. Clark, B. Falvai, N.D.R. Henderson
2005· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Bipartite rainbow Ramsey numbers
Linda Eroh, Ortrud R. Oellermann
2003· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Maximal arcs in Steiner systems S(2,4,v)
Malcolm Greig, Alexander Rosa
2003· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
A note on {4}-GDDs of type 210
Donald L. Kreher, Alan C. H. Ling, Rolf S. Rees, Clement Lam
2003· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Pancyclic BIBD block-intersection graphs
Aygul Mamut, David A. Pike, Michael Raines
2004· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
14
citations
afffundno abstractunlabeled
On the chromatic number of Latin square graphs
Nazli Besharati, Luis Goddyn, E. S. Mahmoodian, M. Mortezaeefar
2016· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
14
citations
afffundno abstractunlabeled
Finite Sholander trees, trees, and their betweenness
Vašek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer
2011· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Balanced k-colorings
Thérèse Biedl, Eowyn Čenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer +1 more
2002· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
On dijoins
Gérard Cornuéjols, Bertrand Guenin
2002· article· es· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Paley graphs have Hamilton decompositions
Brian Alspach, Darryn Bryant, Danny Dyer
2011· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Almost self-complementary circulant graphs
Edward Dobson, Mateja Šajna
2003· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Antimagic orientations of graphs with large maximum degree
Donglei Yang, Joshua Carlson, Andrew Owens, K. E. Perry, Inne Singgih, Zi‐Xia Song +2 more
2020· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations

How this was built: Screen · Findings · About