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 25 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 existence of trades of large volumes.
Abdolhossein Hoorfar, G. B. Khosrovshahi
2004· article· en· Ars Combinatoria· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On Vertex Matching Polynomial of Graphs.
Gholam Hossein Fath-Tabar, Amir Loghman
2012· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On Harmonious Graphs of Order 6.
M. A. Seoud, Maged Z. Youssef
2002· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The Ramsey Numbers R(C ≤n , K m ).
Yali Wu, Yongqi Sun, Zhiguo Liu
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The planar Ramsey numbers PR(K4-e, Kk-e).
Yongqi Sun, Yuansheng Yang, Zhihai Wang
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The Properties of Transformation Digraphs D xyz .
Xiujuan Zhang, Juan Liu, Long Yan, Jixiang Meng
2012· article· en· Ars Combinatoria· 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
venueno affno abstractunlabeled
Harmonic index of graphs with more than one cut-vertex.
J. Amalorpava Jerline, L. Benedict Michaelraj, K. Dhanalakshmi, P Syamala
2017· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
More maps of p-gons with a ring of q-gons.
Tomáš Madaras, Roman Soták
2007· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On the matching polynomial of theta graphs.
Hailiang Zhang, Jinlong Shu
2012· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Defensive alliances in circulant graphs.
Gabriela Araujo‐Pardo, Lali Barrière
2014· article· en· Ars Combinatoria· Mathematics
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 affno abstractunlabeled
The Singular Chromatic Number of a Graph.
Kyle Kolasinski, Jianwei Lin, Chira Lumduanhom, Bryan Phinezy, Futaba Okamoto
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On the Recursive Sequence Order-k.
Tugba Parpar, Ayşe Nallı
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Triangle-Free Polyconvex Graphs
Daniel C. Isaksen, Beth Robinson
2002· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Partial Diallel Cross Block Designs.
Kuey Chung Choi, Sudhir Gupta, Young Nam Son
2002· article· en· Ars Combinatoria· Decision Sciences
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
venueno affno abstractunlabeled
On wy-Perfect Graphs.
Gabriela Araujo‐Pardo, Christian Rubio-Montiel
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About