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 9 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
Coloring permutation-gain graphs
Daniel Slilaty
2021· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Prime labeling on Knödel graphs W 3, n .
Kh. Md. Mominul Haque, Lin Xiaohui, Yuansheng Yang, Zhao Pingzhong
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
A Survey of Nordhaus-Gaddum Type Relations
Mustapha Aouchiche, Pierre Hansen
2010· article· fr· Les Cahiers du GERAD· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On Connected m-K 2 -Residual Graphs.
Huiming Duan, Bo Zeng, Jin Liying
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Uniform Step Magic Squares Revisited.
Livinus U. Uko
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Recognizing H-Graphs - Beyond Circular-Arc Graphs
Deniz Ağaoğlu Çağırıcı, Onur Çağırıcı, Jan Derbisz, Tim A. Hartmann, Petr Hliněný, Jan Kratochvı́l +2 more
2023· article· en· Jagiellonian University Repository (Jagiellonian University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Clique-chromatic Numbers of Line Graphs.
Tanawat Wichianpaisarn, Chariya Uiyyasathian
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Unique basis graphs.
Behrooz Bagheri Gh., Mohsen Jannesari, Behnaz Omoomi
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Fuzzy Anti-Magic Labeling on Comb and Twing Graphs
S. Selvarasu, Shanmuga Sundari Murugan
2024· article· en· Mathematical Modelling and Engineering Problems· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
λ'-optimal regular graphs with two orbits.
Huiqiu Lin, Weihua Yang, Jixiang Meng
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On Weak Magic Graphs.
G. Santhosh
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On γ-labeling the almost-bipartite graph P m +e.
Ryan C. Bunge, Saad I. El‐Zanati, W. O'Hanlon, Charles Vanden Eynden
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On the E k -cordiality of some graphs.
Qing Liu, Zhishan Liu, Haiping Wu
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Toughness and [a, b]-factors in graphs.
Renying Chang, Yan Zhu, Guizhen Liu
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
List circular backbone colouring
Frédéric Havet, A. R. King
2014· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On Large Harmonious Graphs.
Hui-Chuan Lu
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Set-magic labelings of infinite graphs.
N.M. Singhi, G.R. Vijayakumar, N. Usha Devi
2002· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Super Lehmer-3 Mean Labeling
S. Somasundaram, S. S. Sandhya, T. S. Pavithra
2016· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Self-complementary magic squares.
Gek L. Chia, Angeline Lee
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
New Bounds for Facial Nonrepetitive Colouring
Prosenjit Bose, Vida Dujmović, Pat Morin, Lucas Rioux-Maldague
2017· preprint· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On k-edge-magic labelings of maximal outerplanar graphs
Gee-Choon Lau, ‎Saeid Alikhani, Sin-Min Lee, William L. Kocay
2015· article· en· AKCE International Journal of Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
A Labeling Problem on the Plane Graphs Pa, b.
Kumarappan Kathiresan, R. Ganesan
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On Resolving Acyclic Partitions of Graphs.
Varaporn Saenpholphat, Ping Zhang
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On super edge magic deficiency of kite graphs.
Ali Ahmad, Muhammad Kamran Siddiqui, Muhammad Faisal Nadeem, Muhammad Imran
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About