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 40 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. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

venueno affno abstractunlabeled
A space-filling complete graph.
John Ginsburg, Václav Linek
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Partitioning Trillion Edge Graphs on Edge Devices
Adil Chhabra, Florian Kurpicz, Christian Schulz, Dominik Schweisgut, Daniel Seemaier
2025· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Several definitions of matroids.
Jonah Blasiak, Jennifer M. Rowe, Lorenzo Traldi, Oded Yacobi
2005· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On the Decomposition of Graphs Into Cliques.
Gregory F. Bachelis, Troy Barcume, Xiang‐Ying Su
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Noncrossing matchings with fixed points.
Weiming Weng, Bo Liu
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Skewness, splitting number and vertex deletion of some toroidal meshes.
Cândido Ferreira Xavier de Mendonça Neto, Ademir Aparecido Constantino, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M.H. de Figueiredo
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On nice and injective-nice tournaments
Tina Rapke, K. Seyffarth
2017· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Wall cops and robbers
Fionn Mc Inerney
2021· preprint· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Independent sets in trees.
Min-Jen Jou
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Twins of rayless graphs
Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel
2009· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
The Maximum Size of C 4 -Free Planar Graphs.
Guofei Zhou, Yaojun Chen
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Jump-number of Means on Graphs
Christian Delhommé, Maurice Pouzet, Norbert Sauer
2000· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Dynamical 2-domination in Graphs.
Changiz Eslahchi, Hamid Reza Maimani, R. Torabi, Ruzbeh Tusserkani
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Trees With Given Degree Sequence in S-Order
Hua Wang, Shuai Yuan
2016· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The even adjacency split problem for graphs
Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J.B. Stehman
2000· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Cop number of random k-uniform hypergraphs
Joshua Erde, Mihyun Kang, Florian Lehner, Bojan Mohar, Dominik Schmid
2023· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The 2-star spectrum of stars.
Robert A. Beeler, Robert E. Jamison, Eric Mendelsohn
2009· article· es· Digital Commons - East Tennessee State University (East Tennessee State University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Colourings and games on sparse graphs
2024· dissertation· en· eScholarship@McGill (McGill)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About