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 26 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
Forbidden Induced Subgraphs for Toughness
Katsuhiro Ota, Gabriel Sueiro
2012· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Point determining digraphs, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>-matrix partitions, and dualities in full homomorphisms
Pavol Hell, César Hernández‐Cruz
2014· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
3
citations
affunlabeled
Stack and Queue Layouts via Layered Separators
Vida Dujmović, Fabrizio Frati
2016· preprint· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · open_science
3
citations
affno abstractunlabeled
A note on graph minors and strong products
Zefang Wu, Xu Yang, Qinglin Yu
2010· article· en· Applied Mathematics Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
The list linear arboricity of graphs
Ringi Kim, Luke Postle
2021· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
On ‐connected graphs
Olivier Durand de Gevigney, Zoltán Szigeti
2018· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
fundno affunlabeled
[no title]
Ryan O’Donnell, Tselil Schramm
2021· article· en· Theory of Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Planar Packing of Binary Trees
Markus Geyer, Michael M. Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
On minimum cost edge searching
Dariusz Dereniowski, Danny Dyer
2013· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communication+insufficient_payloadconsensus · none
3
citations
affno abstractunlabeled
Eternal and Secure Domination in Graphs
William F. Klostermeyer, Christina M. Mynhardt
2020· book-chapter· en· Developments in mathematics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Fast recoloring of sparse graphs
Nicolás Bousquet, Guillem Perarnau
2015· preprint· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
venueno affno abstractunlabeled
Constrained switchings in cubic graphs.
Avapa Chantasartrassmee, Narong Punnim
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Maximum linear arrangement of directed graphs
Kathryn Nurse
2019· dissertation· en· Summit (Simon Fraser University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
Join colourings of chordal graphs
Pavol Hell, Pei-Lan Yen
2015· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
A Note on Schnyder’s Theorem
2010· article· en· Order· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
2
citations
afffundno abstractunlabeled
A 0.5358-approximation for Bandpass-2
Liqin Huang, Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin
2013· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
On the Density of Trigraph Homomorphisms
Pavol Hell
2007· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affno abstractunlabeled
Recoloring some hereditary graph classes
Manoj Belavadi, Kathie Cameron
2024· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations

How this was built: Screen · Findings · About