MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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 13 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
The Forcing Strong Metric Dimension of a Graph
R. Lenin, KM. Kathiresan, Martin Bača
2017· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
List injective Coloring of Planar Graphs.
Yuehua Bu, Chao Wang, Sheng Yang
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On Total Edge Irregularity Strength Of Graph.
K. Muthu Guru Packiam, T. Manimaran, A. Thuraiswamy
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On path partition dimension of trees.
Ruxandra Marinescu-Ghemeci
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Note on the choosability of bipartite graphs.
Guoping Wang, Qiongxiang Huang
2010· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On E 4 -Cordial Graphs.
M. I. Jinnah, S. Beena
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Antimagic labelings of Msbius grids.
Martin Bača, Yuqing Lin, Mirka Miller, Joseph F. Ryan
2006· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
New results on sum graph theory.
Haiying Wang, Chuantao Li
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A New Distance Measure between Graphs.
Heather Gavlas
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On list backbone coloring of graphs.
Wannapol Pimpasalee, Keaitsuda Maneeruk Nakprasit
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Entire Chromatic Number of 1-Tree.
Gui-Xiang Dong, Jianliang Wu
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On the tree with maximum general Randic Index.
Risheng Cui, Jin Guang-zhi, Yinglie Jin
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundvenueunlabeled
Perfect Matching and Zero-Sum 3-Magic Labeling
Yuanlin Li, Haobai Wang
2023· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Generation of Anti-Magic Graphs
S. Muthukkumar, K. Rajendran
2025· article· en· International Journal of Analysis and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Some new results on k-cordial labeling.
Maged Z. Youssef, Naseam A. AL-Kuleab
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On E k -cordial labeling.
Maged Z. Youssef
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Some α-graphs and odd graceful graphs.
M. A. Seoud, E. F. Helmi
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Signed (j, k)-domatic number of graphs.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About