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 9 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. 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
A note on tolerance graph recognition
Ryan Hayward, Ron Shamir
2004· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Cycle spaces in topological spaces
Antoine Vella, R. Bruce Richter
2008· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Minimal trees and monophonic convexity
José Cáceres, Ortrud R. Oellermann, María Luz Puertas
2012· article· en· Discussiones Mathematicae Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Cycles intersecting edge-cuts of prescribed sizes
Tomáš Kaiser, Riste Škrekovski
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
afffundno abstractunlabeled
Packing Steiner trees
Matt DeVos, Jessica McDonald, Irene Pivotto
2016· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
On the Spanning Ratio of Theta-Graphs
Prosenjit Bose, André van Renssen, Sander Verdonschot
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
On the Recognition of General Partition Graphs
Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Packing r-Cliques in Weighted Chordal Graphs
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2005· article· en· Annals of Operations Research· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
fundno affno abstractunlabeled
On Frank's conjecture on k-connected orientations
Olivier Durand de Gevigney
2020· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
fundno affunlabeled
Computing Minimal Triangulations in Time
Pinar Heggernes, Jan Arne Telle, Yngve Villanger
2005· article· en· BMC Health Services Research· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Disjoint cocircuits in matroids with large rank
James F. Geelen, A.M.H. Gerards, Geoff Whittle
2003· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Upper Bounds for α-Domination Parameters
Andrei Gagarin, Anush Poghosyan, Vadim Zverovich
2009· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
Excluding a group-labelled graph
Jim Geelen, Bert Gerards
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Join-Irreducible Boolean Functions
Moncef Bouaziz, Miguel Couceiro, Maurice Pouzet
2010· article· en· Order· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Dynamic graph coloring
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen +1 more
2017· book-chapter· en· Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Immersing complete digraphs
Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide
2012· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
Pancyclicity and NP-completeness in planar graphs
Mingchu Li, Derek G. Corneil, Eric Mendelsohn
2000· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Finding and listing induced paths and cycles
Chı́nh T. Hoàng, Marcin Kamiński, Joe Sawada, R. Sritharan
2012· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Circular chromatic index of graphs of maximum degree 3
Peyman Afshani, Ghandehari Mahsa, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu
2005· article· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Finding houses and holes in graphs
Chı́nh T. Hoàng, R. Sritharan
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Twins of rayless graphs
Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel
2010· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Ordering without Forbidden Patterns
Pavol Hell, Bojan Mohar, Arash Rafiey
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Proximity, remoteness and girth in graphs
Mustapha Aouchiche, Pierre Hansen
2017· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
venueno affno abstractunlabeled
On Irregularity of Graphs.
Bo Zhou, Wei Luo
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
venueno affunlabeled
Clique graphs of Helly circular arc graphs.
Guillermo Durán, Min Chih Lin
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
← previousnext →

How this was built: Screen · Findings · About