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 6 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.

afffundno abstractunlabeled
The diameter of protean graphs
Paweł Prałat
2007· article· en· Discrete Mathematics· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Polychromatic cliques
Pavol Hell, Juan José Montellano‐Ballesteros
2004· article· fr· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
10
citations
affno abstractunlabeled
Isotone relations revisited
Michael Roddy, Bernd S. W. Schröder
2005· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Volume requirements of 3D upward drawings
Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Regular graphs are not universal fixers
Alewyn P. Burger, Christina M. Mynhardt
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Adaptable chromatic number of graph products
Pavol Hell, Zhishi Pan, Tsai–Lien Wong, Xuding Zhu
2009· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Enumeration of planar two-face maps
Michel Bousquet, Gilbert Labelle, Pierre Leroux
2000· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
9
citations
affno abstractunlabeled
The order of hypotraceable oriented graphs
Susan A. van Aardt, Marietjie Frick, Peter Katrenič, Morten H. Nielsen
2011· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Independent protection in graphs
Bert L. Hartnell, Christina M. Mynhardt
2014· article· en· Discrete Mathematics· Social Sciences
distilled prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Balancedly splittable Hadamard matrices
Hadi Kharaghani, Sho Suda
2018· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Bhaskar Rao designs with block size four
G. Ge, Clement Lam
2003· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
On almost self-complementary graphs
Primož Potočnik, Mateja Šajna
2005· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
8
citations
affno abstractunlabeled
Minimum chromaticity of circulant graphs
Nenad Obradović, Joseph G. Peters, Goran Ružić
2005· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Domination of generalized Cartesian products
Stephen Benecke, Christina M. Mynhardt
2010· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Recolouring reflexive digraphs
Richard C. Brewster, Jae-baek Lee, Mark Siggers
2018· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
The chromatic number of 5-valent circulants
Mariusz Meszka, Roman Nedela, Alexander Rosa
2008· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Simply connected incidence algebras
Ibrahim Assem, Marı́a Inés Platzeck, María Julia Redondo, Sonia Trepode
2003· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affno abstractunlabeled
The level of nonmultiplicativity of graphs
Claude Tardif, Xuding Zhu
2002· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
8
citations
← previousnext →

How this was built: Screen · Findings · About