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 40 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
Problems on Hall t-chromaticity.
M. M. Cropper, Peter D. Johnson
2005· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Decoding Goppa Codes with MAGMA.
Giorgio Faina, Massimo Giulietti
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Sp-Sets with Multiplier p.
Bernt Lindström
2001· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Fano Quads in Projective Planes.
R. G. Stanton, William L. Kocay
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
A Characterization Of Connected Matroids.
M. M. Shikare, B. N. Waphare
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A Note on Star Arboricity of Crowns.
Ming-Ju Lee, Chiang Lin
2008· article· en· Ars Combinatoria· Chemistry
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Sphere-of-Influence Graphs on a Sphere.
Ewa Kubicka, Grzegorz Kubicki
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Fuzzy K-ideals of K-algebras.
Muhammad Akram, N. O. Alshehri
2011· article· en· Ars Combinatoria· Decision Sciences
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
k-Connected Graphs Without K 4 .
Xiang-Jun Li
2015· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affvenueunlabeled
The 2 -burning Number of a Graph
Catherine Jacobs, Margaret-Ellen Messinger, Ann N. Trenk
2024· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On Co-PI Index of Graphs.
G. Sharmiladevi, V. Kaladev
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On endotype of bipartite graphs.
Weimin Li
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A Note of k-Rotation Graphs.
Erich Prisner
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
A Note on Edge Coloring of Graphs.
Saieed Akbari, Moharram N. Iradmusa, M. Jamaali
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Subgraphs And Similarity Of Vertices.
Saravanabalagi Ramachandran, P. Bhanumathy
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Minimizing b + D and well covered graphs.
Richard C. Brewster, Gary MacGillivray
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About