MétaCan
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.

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

affunlabeled
Enumération des 2-arbres k-gonaux
Gilbert Labelle, Cédric Lamathe, Pierre Leroux
2002· book-chapter· fr· Birkhäuser Basel eBooks· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
4
citations
venueno affno abstractunlabeled
On normal quotients of transitive graphs.
Mikhail Muzychuk
2001· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
On the DAG Decomposition
Yangjun Chen, Yibin Chen
2015· article· en· British Journal of Mathematics & Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
A Simple Algorithm for Minimum Cuts in Near-Linear Time
Nalin Bhardwaj, Antonio Molina Lovett, Bryce Sandlund
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affunlabeled
Grünbaum colorings of even triangulations on surfaces
Michal Kotrbčı́k, Naoki Matsumoto, Bojan Mohar, Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki +1 more
2017· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Bondage number in oriented graphs.
Erfang Shan, Liying Kang
2007· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
fundno affunlabeled
On Essentially 4-Edge-Connected Cubic Bricks
Nishad Kothari, Marcelo H. de Carvalho, Cláudio L. Lucchesi, Charles H. C. Little
2020· preprint· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+research_integrityconsensus · none
4
citations
affno abstractunlabeled
Edge-disjoint spanners in tori
Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
A geometric zero-one law
Robert H. Gilman, Yuri Gurevich, Alexei Miasnikov
2009· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Fast searching on cactus graphs
Yuan Xue, Boting Yang, Sandra Zilles, Lusheng Wang
2023· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Parameterized algorithms for the Happy Set problem
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2021· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Proximity and remoteness in graphs: A survey
Mustapha Aouchiche, Bilal Ahmad Rather
2024· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Pure pairs VI. Excluding an ordered tree
Paul Seymour
2022· article· en· Oxford University Research Archive (ORA) (University of Oxford)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · open_science
4
citations
afffundno abstractunlabeled
Global cycle properties of locally isometric graphs
Adam Borchert, Skylar Nicol, Ortrud R. Oellermann
2016· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
fundno affunlabeled
The Windy Postman Problem on Series-Parallel Graphs
Francisco Javier Zaragoza Martínez
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_scienceconsensus · sts
4
citations
affno abstractunlabeled
On a cycle partition problem
Morten H. Nielsen
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
On the Structure of (Even Hole, Kite)-Free Graphs
Dallas J. Fraser, Angèle M. Hamel, Chı́nh T. Hoàng
2018· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
The structure of 2-separations of infinite matroids
Elad Aigner‐Horev, Reinhard Diestel, Luke Postle
2015· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Ferrers dimension of grid intersection graphs
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
2015· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Some results in step domination of graphs.
Yair Caro, Arieh Lev, Y. Roditty
2003· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Tree-width of graphs without a 3×3 grid minor
Étienne Birmelé, J. A. Bondy, Bruce A. Reed
2008· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
DIAMETER-CONSTRAINED STEINER TREES
Wei Ding, Guohui Lin, Guoliang Xue
2011· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Uniformly dissociated graphs
Boštjan Brešar, Bert L. Hartnell, Douglas F. Rall
2017· article· en· Ars Mathematica Contemporanea· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Factor d-domatic colorings of graphs
Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Minimal obstructions to 2-polar cographs
Pavol Hell, César Hernández‐Cruz, Cláudia Linhares Sales
2018· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
4
citations
affno abstractunlabeled
Improved bottleneck domination algorithms
Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu
2006· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
On the oriented diameter of planar triangulations
Debajyoti Mondal, Indra Rajasingh
2024· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Recognizing Balanceable Matrices
Michele Conforti, Giacomo Zambelli
2005· article· en· Mathematical Programming· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
4
citations
affno abstractunlabeled
Universality of intervals of line graph order
Jiřı́ Fiala, Jan Hubička, Yangjing Long
2014· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
On Irregularity In Graphs.
Julie Haviland
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations

How this was built: Screen · Findings · About