MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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 1 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Roman domination in graphs
E. J. Cockayne, Paul Dreyer, Sandra M. Hedetniemi, Stephen T. Hedetniemi
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
556
citations
affno abstractunlabeled
State transfer on graphs
Chris Godsil
2011· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
223
citations
afffundno abstractunlabeled
On the injective chromatic number of graphs
Geňa Hahn, Jan Kratochvı́l, Jozef Širáň, Dominique Sotteau
2002· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
134
citations
affno abstractunlabeled
The average connectivity of a graph
Lowell W. Beineke, Ortrud R. Oellermann, Raymond E. Pippert
2002· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
132
citations
affno abstractunlabeled
The metric dimension of Cayley digraphs
Melodie Fehr, Shonda Gosselin, Ortrud R. Oellermann
2006· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
118
citations
affno abstractunlabeled
Generalized cover-free families
D. R. Stinson, R. Wei
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
99
citations
affno abstractunlabeled
A note on <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-cop, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" overflow="scroll"><mml:mi>l</mml:mi></mml:math>-robber games on graphs
Geňa Hahn, Gary MacGillivray
2006· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity
88
citations
affno abstractunlabeled
Tight bounds on maximal and maximum matchings
Thérèse Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen Kobourov
2004· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
84
citations
affno abstractunlabeled
Lattice animals and heaps of dimers
Mireille Bousquet‐Mélou, Andrew Rechnitzer
2002· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
83
citations
affno abstractunlabeled
Induced matchings in intersection graphs
Kathie Cameron
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
83
citations
afffundno abstractunlabeled
The capture time of a graph
Anthony Bonato, Petr A. Golovach, G. Hahn, Jan Kratochvı́l
2008· article· en· Discrete Mathematics· Decision Sciences
distilled prediction:candidate · noneconsensus · none
74
citations
affno abstractunlabeled
On self-dual codes over some prime fields
Koichi Betsumiya, S. Georgiou, T. Aaron Gulliver, Masaaki Harada, Christos Koukouvinos
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
72
citations
affno abstractunlabeled
Contributions to zero-sum problems
Sukumar Das Adhikari, Yanhan Chen, John Friedlander, Sergeĭ Konyagin, Francesco Pappalardi
2005· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
63
citations
affno abstractunlabeled
Sums of powers of the degrees of a graph
Sebastian M. Cioabă
2006· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
58
citations
affno abstractunlabeled
The firefighter problem for cubic graphs
Andrew D. King, Gary MacGillivray
2009· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
57
citations
affno abstractunlabeled
Hedetniemi's conjecture — a survey
Norbert Sauer
2001· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
57
citations
afffundno abstractunlabeled
The coolest way to generate combinations
Frank Ruskey, Aaron Williams
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
55
citations
affno abstractunlabeled
Rebuilding convex sets in graphs
José Cáceres, Alberto Márquez, Ortrud R. Oellermann, María Luz Puertas
2005· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
52
citations
affno abstractunlabeled
Spanning spiders and light-splitting switches
Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
2004· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
51
citations
affno abstractunlabeled
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math>-Total labelling of graphs
Frédéric Havet, Min‐Li Yu
2007· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+research_integrity
48
citations
afffundno abstractunlabeled
Sweeping graphs with large clique number
Boting Yang, Danny Dyer, Brian Alspach
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
How to build a brick
Marcelo H. de Carvalho, Cláudio L. Lucchesi, U. S. R. Murty
2006· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
On the divisibility of graphs
Chı́nh T. Hoàng, Colin McDiarmid
2002· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
43
citations
next →

How this was built: Screen · Findings · About