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
Graph Labeling and Dimension Problems
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.

807 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.
807 works in the cohort · of 4,299,418page 3 of 17

Labels cover 1 of 807 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 807 of 807 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 affunlabeled
Cycles and Paths Related Vertex-Equitable Graphs
Saima Nazeer, Najma Sultana, Ebenezer Bonyah
2023· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
venueno affno abstractunlabeled
Fibonacci Graceful Graphs.
Kumarappan Kathiresan, S. Amutha
2010· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Magic Labelings on Cycles and Wheels
Andrew Baker, Joe Sawada
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
venueno affunlabeled
A Problem on Edge-magic Labelings of Cycles
Susana-Clara López, Francesc-Antoni Muntaner-Batle, Miquel Rius–Font
2013· article· en· Canadian Mathematical Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
venueno affno abstractunlabeled
On Skolem-Graceful and Cordial Graphs.
Maged Z. Youssef
2006· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
venueno affno abstractunlabeled
On Super Edge-Magic Graphs.
Suh-Ryung Kim, Ji Yeon Park
2006· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
venueno affunlabeled
Some More Results on Root Square Mean Graphs
S. S. Sandhya, S. Somasundaram, S. Anusa
2015· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
venueno affno abstractunlabeled
On a Prime Labeling Conjecture.
M. Shumuga Sundaram, R. Ponraj, S. Somasundaram
2006· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
venueno affunlabeled
On the Local Colorings of Graphs.
Behnaz Omoomi, Ali Pourmiri
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
venueno affno abstractunlabeled
Constructing distance magic graphs from regular graphs
Dalibor Fronček, Petr Kovář, Tereza Kovářová
2011· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
venueno affno abstractunlabeled
Graceful labelings of cyclic snakes.
Christian Barrientos
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
venueno affno abstractunlabeled
List Edge Colorings of Outerplanar Graphs.
Andrea Hackmann, Arnfried Kemnitz
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Graph Theory
Jim Geelen, Daniel Král͏̌
2023· article· en· Oberwolfach Reports· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Derived colourings of graphs
Benjamin Seamone
2012· dissertation· en· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
venueno affno abstractunlabeled
On Antimagic Labeling For Power of Cycles.
Ming-Ju Lee, Chiang Lin, Wei-Han Tsai
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Computing in Combinatorial Optimization
William J. Cook
2019· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
venueno affunlabeled
Total Coloring of Series-Parallel Graphs.
Jianliang Wu, HU Dai-qiang
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
venueno affno abstractunlabeled
Two Classes of Graceful Graphs.
Kumarappan Kathiresan
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations

How this was built: Screen · Findings · About