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
Ars Combinatoria
Topic
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.

2,619 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.
2,619 works in the cohort · of 4,299,418page 11 of 53

Labels cover 1 of 2,619 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 2,619 of 2,619 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

venueno affno abstractunlabeled
The Radio Number of Edge-Joint Graphs.
Asim Naseem, Khurram Shabbir, Hani Shaker
2018· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
A Note On Global Domination In Graphs.
S. Arumugam, R. Kala
2009· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Hypercube-Anti-Ramsey Numbers of Q 5 .
Jens-P. Bode, Dorothee Grimm, Arnfried Kemnitz
2013· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Some results in step domination of graphs.
Yair Caro, Arieh Lev, Y. Roditty
2003· article· en· Ars Combinatoria· Computer Science
distilled 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
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Gromov Hyperbolicity of Regular Graphs.
Juan C. Hernández‐Gómez, José M. Rodrı́guez, José M. Sigarreta, Yadira Torres-Nuñez, María Villeta
2017· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Note on a Turan-type problem on distances.
Xueliang Li, Jing Ma, Yongtang Shi, Jun Yue
2015· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Bondage number in oriented graphs.
Erfang Shan, Liying Kang
2007· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
On Irregularity In Graphs.
Julie Haviland
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affvenueno abstractunlabeled
Spanning trees with bounded total excess
Hikoe Enomoto, Yukichika Ohnishi, Katsuhiro Ota
2011· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Complete Arcs In Moulton Planes Of Odd Order.
Vito Abatangelo, Bambina Larato
2011· article· en· Ars Combinatoria· Engineering
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
On Equitable Coloring of Sun let Graph Families.
K. Kaliraj, J. Vernold Vivin, M M Akbar
2012· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
On the half of a Riordan array.
Sheng-Liang Yang, Yan-Xue Xu, Xiao Gao
2017· article· en· Ars Combinatoria· Mathematics
distilled 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
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affno abstractunlabeled
Existence of HSOLSSOMs with type h n and 1 n u 1 .
R. Julian R. Abel, F.E. Bennett, Hantao Zhang, Lie Zhu
2000· article· en· Ars Combinatoria· Engineering
distilled prediction:candidate · noneconsensus · none
4
citations
venueno affunlabeled
Circular Chromatic Number of Hypergraphs.
Changiz Eslahchi, Arash Rafiey
2004· article· en· Ars Combinatoria· Computer Science
distilled 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
distilled prediction:candidate · insufficient_payloadconsensus · none
4
citations
← previousnext →

How this was built: Screen · Findings · About