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 10 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
Primality of Some graphs.
M. A. Seoud, A. El Sonbaty, A. E. A. Mahran
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
The Niche Category of Sparse Graphs.
Steve Bowser, Charles Cable
2003· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Rooted General Maps on All Surfaces.
Wenzhong Liu, Yanpei Liu
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
On the number of regular edge labelings
Kevin Buchin, Bettina Speckmann, Sander Verdonschot
2014· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
On 0-Rotatable Graceful Caterpillars
Atílio G. Luiz, C.N. Campos, R. Bruce Richter
2020· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
The domatic numbers of factors of graphs.
Teresa W. Haynes, Michael A. Henning
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Proper Nearly Perfect Sets in Graphs.
Changiz Eslahchi, Hamid Reza Maimani, R. Torabi, Ruzbeh Tusserkani
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
The Threshold Dimension and Irreducible Graphs
Mol Lucas, M. H., Ortrud R. Oellermann
2023· article· en· DOAJ (DOAJ: Directory of Open Access Journals)· Computer Science
machine prediction:candidate · noneconsensus · none
1
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
1
citations
venueno affno abstractunlabeled
On the Three Color Ramsey Numbers R(Cm, C4, C4).
Yongqi Sun, Yuansheng Yang, Xiaohui Lin, Wenping Zheng
2007· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The Geo-Number Of A Graph.
A. P. Santhakumaran, P. Titus
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Product Cordial Sets of Long Grids
Ebrahim Salehi, Yaroslav Mukhin
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Sobre a coloração total semiforte
Atílio G. Luiz
2014· dissertation· pt· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
New Families of Graceful Disconnected Graphs.
M. A. Seoud, Maged Z. Youssef
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundvenueno affunlabeled
Distinguishing homomorphisms of infinite graphs
Anthony Bonato, Dejan Delić
2012· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On Binary DCP Labeling
A. Lourdusamy
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Bounds for the boxicity of Mycielski graphs
Akira Kamibeppu
2018· article· en· Contributions to Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On Tades of Disjoint Union of Some Graphs
A. Lourdusamy, F. Joy Beaula, F. Patrick
2023· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About