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

affunlabeled
The metric dimension of circulant graphs
Tapendra BC, Shonda Dueck
2024· article· en· Opuscula Mathematica· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
List-Avoiding Orientations
Peter Bradshaw, Yaobin Chen, Hao Ma, Bojan Mohar, Hehui Wu
2024· article· en· COMBINATORICA· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Acquiring Maps of Interrelated Conjectures on Sharp Bounds
Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Ramiz Gindullin, Claude-Guy Quimper
2022· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Monitoring edge-geodetic sets in graphs
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Krishna R. Narayanan, Lekshmi Ramasubramony Sulochana
2025· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
On Zero Magic Sums of Integer Magic Graphs.
Chia‐Ming Lin, Tao-Ming Wang
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
The Fractional Local Metric Dimension of Graphs
Imran Javaid, Hira Benish, Muhammad Murtaza
2024· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
On product cordial graphs.
M. A. Seoud, E. F. Helmi
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
The hat guessing game on cactus graphs and cycles
Jeremy Chizewer, Ian Malcolm Johnson McInnis, Mehrdad Sohrabi, Shriya Kaistha
2024· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Spanning Paths in Fibonacci-Sum Graphs
Kyle Fox, William B. Kinnersley, Daniel C. McDonald, Nathan Orlow, Gregory J. Puleo
2014· article· en· ˜The œFibonacci quarterly· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
On Splitting Graphs.
T. N. Janakiraman, S. Muthammai, M. Bhanumathi
2007· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Algorithms and Data Structures
2005· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
Total Edge Irregularity Strength of q Tuple Book Graphs
Lucia Ratnasari, Sri Wahyuni, Yeni Susanti, Diah Junia Eksi Palupi
2021· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Trees Which Admit No alpha-labelings
Chin-Lin Shiue, Hui-Chuan Lu
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Some results on mod (integral) sum graphs.
Wenqing Dou, Gao Jing-zhen
2007· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Competitive routing in the half-theta_6-graph
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2012· article· en· University of Southern Denmark Research Portal (University of Southern Denmark)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About