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 12 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.

affno abstractunlabeled
Induced Forests in Some Distance-Regular Graphs
Karen Gunderson, Karen Meagher, Joy Morris, Venkata Raghu Tej Pantangi
2023· article· en· SSRN Electronic Journal· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Genus embeddings of two types of graphs.
Xiaolei Hao, Zhiguo Li, Zeling Shao
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On some metric properties of supertoken graphs
Edy Tri Baskoro, C. Dalfó, M.A. Fiol, Rinovia Simanjuntak
2025· article· en· Utilitas Mathematica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Combinatorial applications
2024· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affno abstractunlabeled
canada
2014· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
venueno affunlabeled
Some New Results on Super Heronian Mean
Labelling S. S. Sandhya, E. Ebin Raja Merly, G. D. Jemi
2017· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Preface: Special Issue on Combinatorial Optimization
Guohui Lin, Liying Kang, Guochuan Zhang
2019· article· en· Journal of the Operations Research Society of China· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
The edge-coloring of graphs with small genus
Hui-Lan Fan, Hung‐Lin Fu
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The Interval Constrained 3-Coloring Problem
Jarosław Byrka, Andreas Karrenbauer, Laura Sanità
2010· article· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Eccentric Coloring of a Graph
Medha Itagi Huilgol, Syed Asif Ulla S.
2015· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
$\ga$-Max Labelings of Graphs
Supaporn Saduakdee, Varanoot Khemmani
2017· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
The Integer-Magic Spectra of Trees
Alvaro Carbonero, Dylan Obata
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Some results on specific graphs.
Adel T. Diab, S.I. Nada
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Hyperbolicity theorems for correspondence colouring
Luke Postle, Evelyne Smith‐Roberge
2025· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Partitioning Trillion Edge Graphs on Edge Devices
Adil Chhabra, Florian Kurpicz, Christof Schulz, Dominik Schweisgut, Daniel Seemaier
2024· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Counterexamples to a conjecture of Harris on Hall ratio
Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, Jan Volec
2018· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Recognition of certain square geometric graphs.
Huda Chuangpishit, Jeannette Janssen
2015· article· en· Cologne Twente Workshop on Graphs and Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Group distance magic set of group vertex magic graphs
S. V. Bharanedhar, S. Balamoorthy, N. Kamatchi, S. Arumugam
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Tough-Maximum Graphs.
S.A. Choudum, N.Shanmuga Priya
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Uniformly Weighted Star-Factors of Graphs
Yunjian Wu, Qinglin Yu
2007· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Determination of the prime bound of a graph
Abderrahim Boussaïri, Pierre Ille
2014· preprint· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About