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

afffundno abstractunlabeled
A note on the connected game coloring number
Peter Bradshaw
2023· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
afffundunlabeled
Subdivision and graph eigenvalues
Hitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada, Hanmeng Zhan
2025· article· en· Linear Algebra and its Applications· Computer Science
distilled prediction:candidate · noneconsensus · 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
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
afffundunlabeled
Universality in minor-closed graph classes
Tony Huynh, Bojan Mohar, Robert Šámal, Carsten Thomassen, David R. Wood
2021· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · 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
affunlabeled
Cooperative Colorings of Forests
Peter Bradshaw
2023· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · 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
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
fundno affunlabeled
[no title]
Ryan O’Donnell, Tselil Schramm
2021· article· en· Theory of Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
Trees With Path-Stable Center.
Paolo Dulio, Virgilio Pannone
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
Total domination in Kr-covered graphs.
Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt
2004· article· en· Ars Combinatoria· 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
affunlabeled
Overlap number of graphs
Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier, Kevin G. Milans, Christopher Stocker, Jennifer Vandenbussche +1 more
2011· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
The Properties of Middle Digraphs.
Juan Liu, Xindong Zhang, Jixiang Meng
2011· 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
affno abstractunlabeled
A note on graph minors and strong products
Zefang Wu, Xu Yang, Qinglin Yu
2010· article· en· Applied Mathematics Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
fundno affno abstractunlabeled
The crossing number of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si8.gif" display="inline" overflow="scroll"><mml:msubsup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mspace width="0.16667em"/><mml:mi>□</mml:mi><mml:mspace width="0.16667em"/><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>
Marián Klešč, Daniela Kravecová
2011· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaresearch+metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+open_science+research_integrity+insufficient_payload
3
citations
fundno affunlabeled
On a Generalization of Spikes
2019· article· en· SIAM Journal on Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Packing Trees in Communication Networks
Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
3
citations
afffundno abstractunlabeled
Arithmetic Circuits and Polynomial Replacement Systems
Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
2000· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Eternal and Secure Domination in Graphs
William F. Klostermeyer, Christina M. Mynhardt
2020· book-chapter· en· Developments in mathematics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
The cost of perfection for matchings in graphs
Emílio Vital Brazil, Celina M.H. de Figueiredo, Guilherme D. da Fonseca, Diana Sasaki
2014· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On the complexity of recognizing tenacious graphs.
Ali Golshani, Dara Moazzami, Saeed Akhoondian Amiri
2017· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About