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

afffundunlabeled
Eulerian $k$-dominating reconfiguration graphs
Margaret-Ellen Messinger, A. Duane Porter
2025· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On the structure of certain intersection graphs
Kathie Cameron, Chı́nh T. Hoàng
2006· article· en· Information Processing Letters· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
D-irregularity Strength of a Graph
Faisal Susanto, Rinovia Simanjuntak, Edy Tri Baskoro
2024· article· en· Utilitas Mathematica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Signed star k-domatic number of a graph
2011· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Cycle transversals in bounded degree graphs
Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Signed total k-domination in graphs.
Haichao Wang, Erfang Shan
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Acyclic Coloring with Few Division Vertices
Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Star-uniform Graphs
Mikio Kanō, Yunjian Wu, Qinglin Yu
2007· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A Note on Spanning Eulerian Graphs.
Liangchen Li, Xiangwen Li
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The deduction model for Cops and Robber
2022· article· en· Memorial University Research Repository (Memorial University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Existential closure in uniform hypergraphs
Andrea C. Burgess, Robert D. Luther, David A. Pike
2024· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Interval Graphs
2016· article· en· Scholarship - Claremont (Claremont Colleges)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Large matchings in maximal 1-planar graphs
Thérèse Biedl, John Wittnebel
2024· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Interval Graphs
2016· article· Scholarship - Claremont (Claremont Colleges)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Semi-strict Chordal Digraphs
Jing Huang, Ying Ying Ye
2022· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Counting Bases
2006· dissertation· en· UWSpace (University of Waterloo)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Surjective polymorphisms of directed reflexive cycles
Isabelle Larivière, Benoît Larose, David Emmanuel Pazmiño Pullas
2023· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Splitter theorems for graph immersions
Matt DeVos, Mahdieh Malekian
2025· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About