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

venueno affno abstractunlabeled
Enumeration of Labelled Essential Graphs.
Bertran Steinsky
2013· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Well-covered triangulations: Part IV
Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
2016· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
6
citations
affunlabeled
Lehman's Theorem and the Directed Steiner Tree Problem
Ahmad Abdi, Andreas Emil Feldmann, Bertrand Guenin, Jochen Könemann, Laura Sanità
2016· article· en· SIAM Journal on Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Paired versus double domination in K 1,r -free graphs
Paul Dorbec, Bert L. Hartnell, Michael A. Henning
2012· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On the maximum path length of AVL trees
Rolf Klein, Derick Wood
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
6
citations
affno abstractunlabeled
Cycle-maximal triangle-free graphs
Stéphane Durocher, David S. Gunderson, Pak Ching Li, Matthew Skala
2014· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Explicit bounds for graph minors
Jim Geelen, Tony Huynh, R. Bruce Richter
2018· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Counting unlabelled toroidal graphs with no <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-subdivisions
Andrei Gagarin, Gilbert Labelle, Pierre Leroux
2007· article· lv· Advances in Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
6
citations
venueno affno abstractunlabeled
Signed Edge Domination Numbers In Trees.
Hossein Karami, Abdollah Khodkar, Seyed Mahmoud Sheikholeslami
2009· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
venueno affno abstractunlabeled
A Study on Radial Graphs.
Kumarappan Kathiresan, G. Marimuthu
2010· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
The master equality polyhedron with multiple rows
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük
2010· article· en· Mathematical Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Maximum colored trees in edge-colored graphs
Valentin Borozan, W. Fernandez de la Véga, Yannis Manoussakis, Carlos A. Martinhon, Rahul Muthu, Hong Phong Pham +1 more
2019· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e117" altimg="si8.svg"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> -conjectures on the domination game and claw-free graphs
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
2021· article· lv· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · none
6
citations
venueno affno abstractunlabeled
Panpositionable Hamiltonian Graphs.
Shin-Shin Kao, Cheng‐Kuan Lin, Hua‐Min Huang, Lih‐Hsing Hsu
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Edge-Face Total Chromatic Number of Halin Graphs
Wai Hong Chan, Peter Che Bor Lam, Wai Chee Shiu
2009· article· en· SIAM Journal on Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Graphical Representations of Graphic Frame Matroids
Rong Chen, Matthew DeVos, Daryl Funk, Irene Pivotto
2015· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Hereditary dominating pair graphs
Nataša Pržulj, Derek G. Corneil, Ekkehard Köhler
2003· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
The game of Cops and Robber on circulant graphs
Shannon L. Fitzpatrick, John Paul Larkin
2017· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Matroid 3-connectivity and branch width
Jim Geelen, Stefan H. M. van Zwam
2015· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Deeply asymmetric planar graphs
V. A. Aksionov, O. V. Borodin, Leonid S. Mel’nikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft
2005· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Limited Packings in Graphs
Robert Gallant, Georg Günther, Bert L. Hartnell, Douglas F. Rall
2008· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
fundno affno abstractunlabeled
König–Egerváry Graphs are Non-Edmonds
P. Mark Kayll
2010· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs
Jurek Czyzowicz, Stefan Dobrev, Hernàn González-Aguilar, Evangelos Kranakis, Josef Opatrný, Ladislav Stacho +1 more
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
6
citations
affno abstractunlabeled
Paired-Domination in Claw-Free Graphs
Shenwei Huang, Liying Kang, Erfang Shan
2012· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On upper domination Ramsey numbers for graphs
Michael A. Henning, Ortrud R. Oellermann
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Strict chordal and strict split digraphs
Pavol Hell, César Hernández‐Cruz
2016· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On Well-Covered Cartesian Products
Bert L. Hartnell, Douglas F. Rall, Kirsti Wash
2018· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
← previousnext →

How this was built: Screen · Findings · About