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 44 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
The Co-PI index of some compound graphs.
Xuehong Yin, Hong Bian, Haizheng Yu
2016· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Maximum Minimal k-rankings of Cycles.
Victor Kostyuk, Darren A. Narayan
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Pebbling Graph Products.
Maggy Tomova, Cindy Wyels
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A Decomposition for Simple Polygons.
Marilyn Breen
2003· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
The Mean Integrity of Paths and Cycles.
Claus Ernst, Beth Rountree
2010· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
The Induced Matching Extendability of C 2n (1, k).
XU Hua-feng, Xianhui Bo
2010· article· en· Ars Combinatoria· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On (l, m)-Walk-regular Digraphs.
Wen Liu
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A note on B-T unitals in PG(2, q 2 ).
Angela Aguglia
2010· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A Note on Set Families and Codes.
Jing-Feng Xu, Jian Liu
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Excess Problem for Modular Lattices.
Tetsuya Ab
2002· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
The cordiality of the complement of a graph.
Liping Xu, Zhishan Liu, Li Zhi
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
List injective Coloring of Planar Graphs.
Yuehua Bu, Chao Wang, Sheng Yang
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On Total Edge Irregularity Strength Of Graph.
K. Muthu Guru Packiam, T. Manimaran, A. Thuraiswamy
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Infinite Symmetric Groups.
Tahsin Öner
2012· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On path partition dimension of trees.
Ruxandra Marinescu-Ghemeci
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About