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 11 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
Brooks' theorem for 2-fold coloring
Jacob A. White
2022· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
List circular backbone colouring
Frédéric Havet, Andrew D. King
2014· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On geometric constructions of (k, g)-graphs
András Gács, Tamás Héger
2008· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Total Labelings of Graphs with Prescribed Weights
Martin Bača, Mirka Miller, Oudone Phanalasy, Joe Ryan, Andrea Semaničová–Feňovčíková, Anita Abildgaard Sillasen
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
k4-e supermagic labeling of triangular ladders
D. Froncek
2025· article· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Toughness and (a,b)-parity factors in graphs
Qiuju Bian
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Royal Colorings of Graphs
Gary Chartrand, James Hallas, Ping Zhang
2023· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
STAR SUPER EDGE MAGIC DEFICIENCY OF GRAPHS
KM. Kathiresan, S Sabarimalai Madha
2017· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Degree Splitting of Heronian Mean Graphs
S. S. Sandhya, E. Ebin Raja Merly, Shetty Deepa
2016· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Chromatic Coloring of Distance Graphs V
V. Yegnanarayanan, George Barnabas, Bryan Freyberg
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
There are not too many magic configurations
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On multiset dimension of cylindrical graphs
Reginaldo M. Marcelo, Mark Anthony C. Tolentino, Agnes D. Garciano, Jude C. Buot
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
List coloring with requests
Zdenĕk Dvořák, Sergey Norin, Luke Postle
2019· preprint· en· Journal of Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About