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

affno abstractunlabeled
Approximating Modular Decomposition Is Hard
Michel Habib, Lalla Mouatadid, Mengchuan Zou
2020· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
afffundno abstractunlabeled
Mixing colourings in 2K2-free graphs
Carl Feghali, Owen Merkel
2022· article· en· Discrete Mathematics· 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
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
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
affunlabeled
Wavelength assignment on bounded degree trees of rings
Zhengbing Bian, Qian‐Ping Gu, Xiao Zhao
2004· article· en· International Conference on Parallel and Distributed Systems· 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
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
affvenueunlabeled
Network farthest-point diagrams
Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari +2 more
2013· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
On the complexity of digraph packings
Richard C. Brewster, Roméo Rizzi
2003· article· en· Information Processing Letters· 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
Brian Alspach and his work
Joy Morris, Mateja Šajna
2005· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
A note on r-equitable k-colorings of trees
Alain Hertz, Bernard Ries
2013· article· en· Yugoslav journal of operations research· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
A Note On Global Domination In Graphs.
S. Arumugam, R. Kala
2009· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Fast Searching on Complete k-partite Graphs
Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles
2016· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
4
citations
afffundno abstractunlabeled
The complexity of minimum-length path decompositions
Dariusz Dereniowski, Wiesław Kubiak, Yori Zwólš
2015· article· en· Journal of Computer and System Sciences· Computer Science
distilled prediction:candidate · noneconsensus · 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
affunlabeled
Linear layouts of weakly triangulated graphs
Asish Mukhopadhyay, S. Venugopal Rao, Sidharth Pardeshi, Srinivas Gundlapalli
2016· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
On i−-ER-critical graphs
E. J. Cockayne, Odile Favaron, Christina M. Mynhardt
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations

How this was built: Screen · Findings · About