MétaCan
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.

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 42 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. 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
On the smallest edge defining sets of graphs.
Saieed Akbari, G. B. Khosrovshahi
2002· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Stratified Graphs and Distance Graphs.
Sarah Spence Adams
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Phi-Strong (weak) domination in a graph.
V. Swaminathan, Pugazhenthan Thangaraju
2003· article· en· Ars Combinatoria· Decision Sciences
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
The edge-coloring of graphs with small genus
Hui-Lan Fan, Hung‐Lin Fu
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Tetravalent Normal Primitive Cayley Graphs.
Jing Jian Li, Bo Ling, Xiaodan Chen
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Resonance of Plane Bipartite Graphs.
Jingrong Chen, Heping Zhang
2007· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Dominating cycles in triangle-free graphs.
Kenta Ozeki, Tomoki Yamashita
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Hyperbolic Modified Pell Functions.
E. Gökçen Koçer
2007· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
cλ-optimally connected mixed Cayley graph.
Luihuan Chen, Jixiang Meng, Yingzhi Tian
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Signed (j, k)-domatic number of graphs.
Seyed Mahmoud Sheikholeslami, Lutz Volkmann
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Upper signed k-domination number in graphs.
Zhou Ligang, Erfang Shan, Yancai Zhao
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Some α-graphs and odd graceful graphs.
M. A. Seoud, E. F. Helmi
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
The crossing number of P(10, 3) is six.
R. Bruce Richter
2007· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
P m U P k -equipackable paths and cycles.
Liandi Zhang, Yanfei Wang, Yuqin Zhang
2017· article· ca· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About