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 2 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
Vertex domination of generalized Petersen graphs
B. Javad Ebrahimi, Nafiseh Jahanbakht, E. S. Mahmoodian
2009· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
On the complexity of crossings in permutations
Thérèse Biedl, Franz J. Brandenburg, Xiaotie Deng
2008· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affno abstractunlabeled
The cluster deletion problem for cographs
Yong Gao, Donovan R. Hare, James Nastos
2013· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
On the girth of digraphs
Jian Shen
2000· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
Oriented trees in digraphs
Louigi Addario‐Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce Reed, Stéphan Thomassé
2013· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
A criterion for the half-plane property
David G. Wagner, Yehua Wei
2008· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
afffundno abstractunlabeled
Two results on the digraph chromatic number
Ararat Harutyunyan, Bojan Mohar
2012· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
37
citations
afffundno abstractunlabeled
Efficient domination in circulant graphs
K. Reji Kumar, Gary MacGillivray
2013· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
Grooming in unidirectional rings: K4−e designs
Jean‐Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min‐Li Yu
2004· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
36
citations
fundno affno abstractunlabeled
Rooted directed path graphs are leaf powers
Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter J. Papadakos
2009· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
afffundno abstractunlabeled
Well-covered circulant graphs
Jason I. Brown, Richard Hoshino
2010· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Matrix partitions of perfect graphs
Tomás Feder, Pavol Hell
2006· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
On a conjecture about the Randić index
Mustapha Aouchiche, Pierre Hansen
2006· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Labeling trees with a condition at distance two
Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi
2006· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Bipartite Ramsey numbers and Zarankiewicz numbers
Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann
2000· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
31
citations
fundno affno abstractunlabeled
DP-3-coloring of some planar graphs
Runrun Liu, Sarah Loeb, Yuxue Yin, Gexin Yu
2018· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
HGDDs with block size four
Gennian Ge, Rong Wei
2003· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
31
citations
afffundno abstractunlabeled
Locating a robber on a graph
Suzanne M. Seager
2012· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
Maximal bifix decoding
Valérie Berthé, Clelia De Felice, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
2015· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
fundno affno abstractunlabeled
On generalized constraints and certificates
Lisa Hellerstein
2001· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
On cop-win graphs
Geňa Hahn, François Laviolette, Norbert Sauer, Robert Woodrow
2002· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
← previousnext →

How this was built: Screen · Findings · About