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 14 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
A note on the thickness of K l, m, n .
Yan Yang
2014· 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 affunlabeled
CONDITIONAL MATCHING PRECLUSION FOR THE STAR GRAPHS
Eddie Cheng, László Lipták, Lih Hsing Hsu, Jiann-Mean Tan, Cheng‐Kuan Lin
2015· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On the Erdos-Faber-Lovasz Conjecture.
John Mitchem, Randolph L. Schmidt
2010· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
3
citations
venueno affno abstractunlabeled
On Ruehr's Identities.
Horst Alzer, Helmut Prodinger
2018· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
3
citations
venueno affno abstractunlabeled
Weak Edge Detour Number of a Graph.
A. P. Santhakumaran, S. Athisayanathan
2011· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On the Balaban Index of Trees.
Shuxian Li, Bo Zhou
2011· article· en· Ars Combinatoria· Mathematics
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
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
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
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
Residual Closeness Of Splitting Networks.
Tufan Turacı, Vecdi Aytaç
2017· article· en· Ars Combinatoria· Computer Science
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
Spanning trees in subcubic graphs.
Rui Li, Qing Cui
2014· 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 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
← previousnext →

How this was built: Screen · Findings · About