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
Topic
Advanced Graph Theory Research
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.

2,515 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.
2,515 works in the cohort · of 4,299,418page 24 of 51

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

afffundunlabeled
Vertex-critical graphs in co-gem-free graphs
Iain Beaton, Ben Cameron
2025· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · none
3
citations
afffundno abstractunlabeled
Dualities and Dual Pairs in Heyting Algebras
Jan Foniok, Jaroslav Nešetřil, Aleš Pultr, Claude Tardif
2010· article· en· Order· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundvenueunlabeled
On the real roots of domination polynomials
Jason I. Brown, Iain Beaton
2021· article· en· Contributions to Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Optimal-size clique transversals in chordal graphs
\n
Jacob W. Cooper, Andrzej Grzesik, Daniel Král͏̌
2018· article· en· Warwick Research Archive Portal (University of Warwick)· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
3
citations
affunlabeled
Cooperative Colorings of Forests
Peter Bradshaw
2023· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
fundno affunlabeled
On the Book Thickness of k-Trees
Vida Dujmović, David R. Wood
2011· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · none
3
citations
venueno affno abstractunlabeled
Total chromatic number of folded hypercubes.
Meirun Chen, Xiaofeng Guo, Shaohui Zhai
2013· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
afffundno abstractunlabeled
Recognizing even-cycle and even-cut matroids
Bertrand Guenin, Cheolwon Heo
2023· article· en· Mathematical Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Small Chvátal Rank
Tristram Bogart, Annie Raymond, Rekha R. Thomas
2010· article· en· Mathematical Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Conflict-Free Graph Orientations with Parity Constraints
Sarah Cannon, Mashhood Ishaque, Csaba D. Tóth
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · none
3
citations
affunlabeled
Exact Finite Difference Schemes
Lih-Ing Roeger
2014· other· en· Contemporary mathematics - American Mathematical Society· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
3
citations
venueno affunlabeled
The number of total dominating sets in binary trees
Opeyemi Oyewumi, Adriana Roux, Stephan Wagner
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Reconfiguration over Tree Decompositions
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna
2014· preprint· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
3
citations
afffundunlabeled
Web Bases in Degree Two From Hourglass Plabic Graphs
Christian Gaetz, Oliver Pechenik, Stephan Pfannerer, Jessica Striker, Joshua P. Swanson
2025· preprint· en· International Mathematics Research Notices· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_science+research_integrityconsensus · open_science
3
citations
venueno affno abstractunlabeled
Number of disjoint 5-cycles in graphs.
Kotaro Hayashi
2010· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Minimum Diameter k-Steiner Forest
Wei Ding, Ke Qiu
2018· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
3
citations
affunlabeled
On ‐connected graphs
Olivier Durand de Gevigney, Zoltán Szigeti
2018· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
Domination numbers of m-cactus chains
Snježana Majstorović, Antoaneta Klobučar, Tomislav Došlić
2016· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Complexity of greedy edge-colouring
Frédéric Havet, Ana Karolinna Maia, Min‐Li Yu
2015· article· en· Journal of the Brazilian Computer Society· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Automorphism group and diameter of a graph
Peter Dankelmann, David Erwin, Simon Mukwembi, B. G. Rodrigues, E. Mwambene, Gert Sabidussi
2011· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About