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 15 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
Spanning trees in subcubic graphs.
Rui Li, Qing Cui
2014· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
On Strongly Multiplicative Graphs
M. A. Seoud, A. E. A. Mahran
2015· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
Partitioning a strong tournament into k cycles.
Hao Li, Jinlong Shu
2004· article· en· Ars Combinatoria· Decision Sciences
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
venueno affno abstractunlabeled
Adding evidence to the Erdos-Faber-Lovasz conjecture.
David Romero, Abdón Sánchez-Arroyo
2007· article· en· Ars Combinatoria· Economics, Econometrics and Finance
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
venueno affno abstractunlabeled
Common multiples of paths and stars
Zhen-Chun Chen, Tay-Woei Shyu
2019· article· en· Ars Combinatoria· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
Szeged Index of a Zig-zag Polyhex Nanotube.
B. Manoochehrian, Hassan Yousefi-Azari, Али Реза Ашрафи
2008· article· hu· Ars Combinatoria· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
venueno affno abstractunlabeled
Double Orderings of (0, 1)-Matrices.
Adolf Mader, Otto Mutzbauer
2001· article· en· Ars Combinatoria· Engineering
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On the Cordiality of the t-ply Pt(u, v).
Mahesh M. Andar, Samina Boxwala, Nirmala B. Limaye
2005· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On Connected Colourings of Graphs.
Amir Daneshgar, Hossein Hajiabolhassan, Navid Hamedazimi
2008· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
Total chromatic number of folded hypercubes.
Meirun Chen, Xiaofeng Guo, Shaohui Zhai
2013· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
venueno affno abstractunlabeled
On the generalized antiaverage problem.
Bing Yao, Ming Yao, Hui Cheng
2010· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On Incidence Graphs.
Zhang Zhong-fu, Bing Yao, Jing Li, Linzhong Liu, Jianfang Wang, Bao-gen XU
2008· article· en· Ars Combinatoria· Computer Science
distilled 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
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
venueno affunlabeled
Trees With Path-Stable Center.
Paolo Dulio, Virgilio Pannone
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
The Labelings Of A Variation Of Banana Trees.
Gao Zhenbin
2010· article· en· Ars Combinatoria· Agricultural and Biological Sciences
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
Super Vertex-magic Total Labelings of W3, n.
Xi Yue, Yuansheng Yang, Mominul, Liping Wang
2008· article· it· Ars Combinatoria· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
venueno affno abstractunlabeled
Obstruction Sets for Outer-Bananas-Surface Graphs.
L. Boza, Eugenio M. Fedriani, Juan Núñez Valdés
2004· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On the Cordiality of Corona Graphs.
Mahesh M. Andar, Samina Boxwala, Nirmala B. Limaye
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About