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 29 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 (r, s) domination number of a graph.
Alewyn P. Burger, Jan H. van Vuuren
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Linear Codes over Finite Chain Rings.
Hongwei Liu
2010· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On The Energy Of 3-Circulant Graphs.
Zhou Hou-qing, Qi Zhou
2013· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The Crossing Number of K 2, 4, n .
Pak Tung Ho
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Universal Graphs for Two Graph Properties.
Izak Broere, Tomáš Vetrík
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
New Classes of Combinatorial Identities.
Ashok Agarwal
2005· article· en· Ars Combinatoria· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
The Niche Category of Sparse Graphs.
Steve Bowser, Charles Cable
2003· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On Potentially C 2, 6 -graphic Sequences.
Haiyan Li, Chunhui Lai
2015· article· en· Ars Combinatoria· Computer Science
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
On the spectra of tricyclic graphs.
Ruifang Liu, Huicai Jia, Jinlong Shu
2011· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About