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

fundno affunlabeled
Combinatorial Gray codes-an updated survey
2022· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Comparing the metric and strong dimensions of graphs
Gaia Moravcik, Ortrud R. Oellermann, Samuel Yusim
2017· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
Landmarks in Binary Tree Derived Architectures.
Paul Manuel, Bharati Rajan, Indra Rajasingh, M. Chris Monica
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Metric dimension of dual polar graphs
R. A. Bailey, Pablo Spiga
2023· article· en· Archiv der Mathematik· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
Circular Chromatic Number of Hypergraphs.
Changiz Eslahchi, Arash Rafiey
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
No-hole 2-distant colorings for unit interval graphs
Gerard J. Chang, Justie Su-Tzu Juan, Daphne Der‐Fen Liu
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Resolving Edge Colorings in Graphs.
Gary Chartrand, Varaporn Saenpholphat, Ping Zhang
2005· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
On several classes of monographs.
Kiki Ariyanti, Joseph F. Ryan
2007· article· en· The Australasian Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Coloring Eulerian Triangulations of the Klein Bottle
Daniel Král͏̌, Bojan Mohar, Atsuhiro Nakamoto, Ondřej Pangrác, Yusuke Suzuki
2011· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
The Radio Number of Edge-Joint Graphs.
Asim Naseem, Khurram Shabbir, Hani Shaker
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affunlabeled
Harmonic Mean Labeling for Some Special Graphs
S. S. Sandhya, S. Somasundaram
2013· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Sun toughness and P ≥3 -factors in graphs.
Sizhong Zhou
2019· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Some C 4 -supermagic graphs.
P. Jeyanthi, P. Selvagopal
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
A Note On Excellent Graphs.
N. S. Sridharan, M. Yamuna
2006· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
New Families of Graceful Graphs.
Maged Z. Youssef
2003· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
b-coloring of Cartesian product of odd graphs.
Rangaswami Balakrishnan, S. Francis Raj, T. Kavaskar
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Edge-Coloring of Split Graphs.
Sheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
On Connected Colourings of Graphs.
Amir Daneshgar, Hossein Hajiabolhassan, Navid Hamedazimi
2008· 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
Which Graphs Have Hall Number Two
Peter D. Johnson, Evan B. Wantland
2002· 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
← previousnext →

How this was built: Screen · Findings · About