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 19 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
Algorithms for Cut Problems on Trees
Iyad Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu +4 more
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
5
citations
venueno affno abstractunlabeled
F-factor and Vertex-disjoint F in a graph.
Ken‐ichi Kawarabayashi
2002· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Some Bounds on Alliances in Trees.
Ararat Harutyunyan
2010· article· en· Cologne Twente Workshop on Graphs and Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Elementary block of plane bipartite graphs
Peter Che Bor Lam, Wai Chee Shiu, Heping Zhang
2003· article· en· HKBU Institutional Repository (Hong Kong Baptist University)· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Linkless and Flat Embeddings in 3-Space
Ken‐ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar
2012· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Recognizing Even-Cycle and Even-Cut Matroids
Cheolwon Heo, Bertrand Guenin
2020· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
afffundno abstractunlabeled
Graphs with a Minimal Number of Convex Sets
Jason I. Brown, Ortrud R. Oellermann
2013· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Toughness of $K_{a,t}$-Minor-free Graphs
Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota
2011· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Embedding trees into graphs of large girth
Penny Haxell, Tomasz Łuczak
2000· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Ordering without forbidden patterns
Pavol Hell, Bojan Mohar, Arash Rafiey
2014· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
Exponents of vertex-transitive digraphs
Jian Shen, David A. Gregory
2000· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affno abstractunlabeled
Note on acyclic colorings of graphs.
Rui Xu
2004· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Star-Uniform Graphs
Mikio Kanō, Yunjian Wu, Qinglin Yu
2010· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
On universally easy classes for NP-complete problems
Erik D. Demaine, Alejandro López-Ortíz, J. Ian Munro
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
5
citations
venueno affno abstractunlabeled
Maximum number of 3-paths in a graph.
Owen Byer
2001· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Packing paths in digraphs
Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Roméo Rizzi, Anders Yeo
2003· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affno abstractunlabeled
Staying True to Trees
Christian Diehm
2008· article· en· Environmental Philosophy· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
5
citations
affunlabeled
Search Numbers in Networks with Special Topologies
Boting Yang, Runtao Zhang, Yi Cao, Farong Zhong
2019· article· en· Journal of Interconnection Networks· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Parameterized Algorithms for the Happy Set Problem
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2020· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
5
citations
afffundno abstractunlabeled
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml16" display="inline" overflow="scroll" altimg="si16.gif"><mml:mi>k</mml:mi></mml:math>-broadcast domination and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml17" display="inline" overflow="scroll" altimg="si16.gif"><mml:mi>k</mml:mi></mml:math>-multipacking
Michael A. Henning, Gary MacGillivray, Frank Yang
2018· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+research_integrity
5
citations
fundvenueno affunlabeled
A survey of graph burning
Anthony Bonato
2021· preprint· en· Contributions to Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
On a DAG Partitioning Problem
Soroush Alamdari, Abbas Mehrabian
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
afffundunlabeled
Yes, the “missing axiom” of matroid theory is lost forever
Dillon Mayhew, Mike Newman, Geoff Whittle
2018· preprint· lv· Transactions of the American Mathematical Society· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_science+insufficient_payloadconsensus · none
5
citations
affno abstractunlabeled
Simpler Projective Plane Embedding
Wendy Myrvold, Jianping Roth
2000· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
Hamiltonian Properties of Generalized Halin Graphs
Shabnam Malik, Ahmad Mahmood Qureshi, Tudor Zamfirescu
2009· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
5
citations
affvenueno abstractunlabeled
Vertex-Disjoint Paths in Graphs
Yoshimi Egawa, Katsuhiro Ota
2001· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
note on total co-independent domination in trees
Abel Cabrera Martínez, Frank A. Hernández Mira, José M. Sigarreta, Ismael G. Yero
2024· article· en· Contributions to Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
The structure of claw-free binary matroids
Peter Nelson, Kazuhiro Nomoto
2018· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · open_scienceconsensus · open_science
5
citations
afffundunlabeled
Homomorphisms of signed graphs: An update
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
5
citations

How this was built: Screen · Findings · About