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 6 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
On the Cordiality of Corona Graphs.
Mahesh M. Andar, Samina Boxwala, Nirmala B. Limaye
2006· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On the super edge-magic deficiency of a star forest.
Abdul Qudair Baig, Edy Tri Baskoro, Andrea Semaničová–Feňovčíková
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
Coloring The Line.
Arnfried Kemnitz, Massimiliano Marangio
2007· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On Incidence Graphs.
Zhang Zhong-fu, Bing Yao, Jing Li, Linzhong Liu, Jianfang Wang, Bao-gen XU
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
On Balance Index Sets of Rooted Trees.
Harris Kwong
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Splitting Numbers of Grids
Dwight Duffus, Bill Sands
2005· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
A sharp lower bound on the number of non-equivalent colorings of graphs of order <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si8.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi></mml:math> and maximum degree <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si11.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mn>3</mml:mn></mml:math>
Romain Absil, Eglantine Camby, Alain Hertz, Hadrien Mélot
2016· article· lv· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
L(2, 1)-labeling of flower snark and related graphs.
Chunling Tong, Xiaohui Lin, Yuansheng Yang, Zhengwei Hou
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
An Expansion Technique on Super Edge-Magic Total Graphs.
I Wayan Sudarsana, Edy Tri Baskoro, Saladin Uttunggadewa, Dasa Ismaimuza
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
Weak Edge Detour Number of a Graph.
A. P. Santhakumaran, S. Athisayanathan
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
Integral Sum Graphs from a Class of Trees.
Wenjie He, Lixin Wang, Honghai Mi, Yufa Shen, Xinkai Yu
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
On Regular Distance Magic Graphs of Odd Order
Adam Silber, Petr Kovář, Pavla Kabelíková–Hrušková, Michal Kravčenko
2023· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
Magic graphs with pendant edges.
Anak Agung Gede Ngurah, Edy Tri Baskoro, Ioan Tomescu
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
On vertex-coloring edge-weighting of graphs
Hongliang Lu, Xu Yang, Qinglin Yu
2009· article· en· Frontiers of Mathematics in China· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
Super Vertex-magic Total Labelings of W3, n.
Xi Yue, Yuansheng Yang, Mominul, Liping Wang
2008· article· it· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Proper orientations and proper chromatic number
Yaobin Chen, Bojan Mohar, Hehui Wu
2023· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
New graceful familes of bipartite graphs.
Shung-Liang Wu
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
Group Irregular Labelings of Disconnected Graphs
Marcin Anholcer, Sylwia Cichacz-Przenioslo
2017· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
Magic coverings and the Kronecker product
Susana-Clara López, Francesc Antoni Muntaner Batle, Miquel Rius Font
2009· article· en· Utilitas Mathematica· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On the Gracefulness of the Digraphs n-C m .
Xirong Xu, Jirimutu, Lei Wang, Min Zhao
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
Recognizing Tenacious Graphs Is NP-Hard.
Seyed Morteza Dadvand, Dara Moazzami, Ali Moeini
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
Resolvability in Hypergraphs
Imran Javaid, Azeem Haider, Muhammad Salman, Sadaf Mehtab
2023· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On Prime Graphs.
M. A. Seoud, A. El Sonbaty, A. E. A. Mahran
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About