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 14 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 affno abstractunlabeled
Antimagic labelings of cycle powers.
Pak Ching Li
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A Note on Color Chains of Graphs.
Saeed Shaebani
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Strong Z 4p -Magic labeling.
V. L. Stella Arputha Mary, S. Navaneethakrishnan, A. Nagarajan
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On path-supermagic labelings of cycles
Toru Kojima
2016· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
New Classes of Graceful Graphs.
Bo Zhou
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
The Super Vertex-Graceful Labeling Of Graphs.
Zhen-Bin Gao, Xiaodong Zhang, Lijuan Xu
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On 2-strong edge coloring of some graphs
Shuang Wang
2007· article· en· Journal of Dalian Maritime University· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Tetravalent Normal Primitive Cayley Graphs.
Jing Jian Li, Bo Ling, Xiaodan Chen
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On the smallest edge defining sets of graphs.
Saieed Akbari, G. B. Khosrovshahi
2002· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On the Magic Space of Locally Finite Graphs.
Bikash Bhattacharjya, A. K. Lal
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On the alpha-labeling number of bipartite graphs
Saad I. El‐Zanati, Charles Vanden Eynden, Hung‐Lin Fu
2000· article· en· Utilitas Mathematica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A study on the chaotic numbers of graphs.
Nam-Po Chiang, Chien-Kuo Tzeng
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Injectively (Δ+1)-choosable graphs.
Seog‐Jin Kim, Won-Jin Park
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
L(2,1)-labeling of a circular graph
Dengju Ma, Han Ren, LV Da-mei
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Disproof of a Conjecture on List Coloring.
Baoyindureng Wu, Li Zhang
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Edge Friendly Labelings of Graph - I.
Deepa Sinha, Jaspreet Kaur
2016· article· it· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
L(2, 1)-labeling of Block Graphs.
B. S. Panda, Preeti Goel
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Heinz Quarter Mean Labeling of Some Special Graphs
S. Latha, Sandhya S.S
2024· article· en· International Journal of Mathematics Trends and Technology· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Minimizing b + D and well covered graphs.
Richard C. Brewster, Gary MacGillivray
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A Note on Edge Coloring of Graphs.
Saieed Akbari, Moharram N. Iradmusa, M. Jamaali
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On the choosability of bipartite graphs.
Guoping Wang, Qiongxiang Huang
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About