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 3 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
Bounded vertex coloring of trees
Mark Jarvis, Bing Zhou
2001· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Secure domination critical graphs
P.J.P. Grobler, Christina M. Mynhardt
2008· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Tough graphs and hamiltonian circuits
Vašek Chvátal
2006· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Construction of new extremal self-dual codes
T. Aaron Gulliver, Masaaki Harada, Jon-Lark Kim
2003· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
On the monotonicity of the broadcast function
Hovhannes A. Harutyunyan, Arthur L. Liestman
2003· article· en· Discrete Mathematics· Computer Science
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
Broadcasts and domination in trees
E. J. Cockayne, Sarada Herke, Christina M. Mynhardt
2010· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Planarity of iterated line graphs
M. Ghebleh, Mahdad Khatirinejad
2007· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Cyclic BSEC of block size 3
Ruizhong Wei
2002· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Extensions of the Critical Theorem
Thomas Britz
2005· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Tandem-win graphs
Nancy E. Clarke, Richard J. Nowakowski
2005· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Applications of integer relation algorithms
Jonathan M. Borwein, Petr Lisoněk
2000· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Hex and combinatorics
Ryan Hayward, Jack van Rijswijck
2006· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
20
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
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
Perfect dexagon triple systems
C.C. Lindner, A. Rosa
2007· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
19
citations

How this was built: Screen · Findings · About