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
Limits and Structures in Graph Theory
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.

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

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

afffundunlabeled
Finding dense minors using average degree
Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte
2024· article· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Stability and exact Turan numbers for matroids
Hong Liu, Sammy Luo, Peter Nelson, Kazuhiro Nomoto
2017· preprint· en· arXiv (Cornell University)· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
fundno affunlabeled
Trois résultats en théorie des graphes
2022· dissertation· fr· Papyrus : Institutional Repository (Université de Montréal)· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+insufficient_payloadconsensus · none
0
citations
venueno affno abstractunlabeled
On k-Ramsey Numbers of Unicyclic-Star Graphs.
Daniel Johnston, Chira Lumduanhom, Ping Zhang
2018· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
A Sidon-type condition on set systems
Peter J. Dukes, Jane Wodlinger
2013· preprint· en· Journal of Combinatorics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
fundno affunlabeled
On the minimum order of k-cop-win graph
2012· preprint· en· University of Minnesota Digital Conservancy (University of Minnesota)· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
venueno affunlabeled
How to Play Dundee
Kevin Litwack, Oleg Pikhurko, Suporn Pongnumkul
2014· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The number of possibilities for random dating
Aaron Abrams, Rod Canfield, Andrew Granville
2008· article· en· Journal of Combinatorial Theory Series A· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Acyclic and Frugal Colourings of Graphs.
Ross J. Kang, Tobias Müller
2008· article· en· Data Archiving and Networked Services (DANS)· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
On Obstacle Numbers
Vida Dujmović, Pat Morin
2015· preprint· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · research_integrityconsensus · none
0
citations
affvenueunlabeled
Freiman's theorem for solvable groups
Terence Tao
2010· article· en· Contributions to Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
ε-Kronecker Sets
Colin C. Graham, Kathryn E. Hare
2012· book-chapter· en· CMS books in mathematics· Mathematics
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
The Method of Conditional Expectations
Michael Molloy, Bruce Reed
2002· book-chapter· en· Algorithms and combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Extremal Number of Arborescences
2025· article· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Kneser’s theorem in -finite abelian groups
Pierre‐Yves Bienvenu, François Hennecart
2022· article· en· Canadian Mathematical Bulletin· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Meyniel's conjecture on graphs of bounded degree
Seyyed Aliasghar Hosseini, Bojan Mohar, Sebastián González Hermosillo de la Maza
2021· preprint· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
0
citations
venueno affunlabeled
Graphs embedded into finite projective planes
Keith E. Mellinger, Ryan Vaughn, Oscar Vega
2015· article· en· Contributions to Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Disperse hypergraphs
Lior Gishboliner, Ethan Honest
2025· article· en· Combinatorics Probability Computing· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Repeated columns and an old chestnut
R.P. Anstee, Linyuan Lü
2013· preprint· en· arXiv (Cornell University)· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations

How this was built: Screen · Findings · About