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

afffundno abstractunlabeled
On well-covered triangulations: Part III
Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
2010· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
fundno affunlabeled
Minimum degree condition forcing complete graph immersion
Matt DeVos, Zdenĕk Dvořák, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide
2011· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affno abstractunlabeled
Boxicity and cubicity of product graphs
L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad
2015· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Stable skew partition problem
Simone Dantas, Celina M.H. de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed
2004· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Oriented star packings
Richard C. Brewster, Pavol Hell, Roméo Rizzi
2007· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Proof of the Clustered Hadwiger Conjecture
Vida Dujmović, Louis Esperet, Pat Morin, David R. Wood
2023· preprint· en· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
8
citations
venueno affno abstractunlabeled
On the upper broadcast domination number.
Isma Bouchemakh, Nasreddine Fergani
2017· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
8
citations
affunlabeled
A Polynomial Excluded-Minor Approximation of Treedepth
Ken‐ichi Kawarabayashi, Benjamin Rossman
2018· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affunlabeled
Forced Orientation of Graphs
Babak Farzad, Mohammad Mahdian, E. S. Mahmoodian, Amin Saberi, Bardia Sadri
2011· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
venueno affno abstractunlabeled
Tree Domination in Graphs.
Xue-gang Chen, Liang Sun, Alice A. McRae
2004· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Recolouring reflexive digraphs
Richard C. Brewster, Jae-baek Lee, Mark Siggers
2018· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Acyclic colorings of graph subdivisions revisited
Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman
2012· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
On Routing in VLSI Design and Communication Networks
Tamás Terlaky, Anthony Vannelli, Hu Zhang
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
afffundno abstractunlabeled
Cyclic colorings of plane graphs with independent faces
Jernej Azarija, Rok Erman, Daniel Král͏̌, Matjaž Krnc, Ladislav Stacho
2011· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Homomorphism bounded classes of graphs
Timothy Marshall, Reza Nasraser, Jaroslav Nešetřil
2005· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Domination of generalized Cartesian products
Stephen Benecke, Christina M. Mynhardt
2010· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
fundno affno abstractunlabeled
How to recycle your facets
Samuel Fiorini
2006· article· en· Discrete Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Treewidth of Grid Subsets
Eli Berger, Zdenĕk Dvořák, Sergey Norin
2017· article· en· COMBINATORICA· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Vertex-critical <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e185" altimg="si23.svg"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo linebreak="goodbreak" linebreakstyle="after">+</mml:mo><mml:mi>ℓ</mml:mi><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>-free and vertex-critical (gem, co-gem)-free graphs
Tala Abuadas, Ben Cameron, Chı́nh T. Hoàng, Joe Sawada
2023· article· lv· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaresearch+metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+open_science+research_integrity+insufficient_payload
8
citations
affno abstractunlabeled
On uniform k-partition problems
Paolo Dell’Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi
2005· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
8
citations
affno abstractunlabeled
Minimum chromaticity of circulant graphs
Nenad Obradović, Joseph G. Peters, Goran Ružić
2005· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
venueno affno abstractunlabeled
Limited packing vs tuple domination in graphs.
Doost Ali Mojdeh, Babak Samadi, S. M. Hosseini Moghaddam
2017· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Planar graph bipartization in linear time
Samuel Fiorini, Nadia Hardy, Bruce Reed, Adrian Vetta
2005· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Distance-two colourings of Barnette graphs
Tomás Feder, Pavol Hell, Carlos Subi
2020· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About