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 33 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
Edge Friendly Labelings of Graph - I.
Deepa Sinha, Jaspreet Kaur
2016· article· it· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
The Monophonic-triangular Number of a Graph
G.Princeton Lazarus, K. Selvakumar, P. Titus
2024· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
New Ways to Balance Numbers
Noah Lebowitz- Lockard, Joseph Vandehey
2024· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Nilpotent Covers of Dihedral Groups
Kimeu Arphaxad Ngwava, Nick Gill
2024· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On the Eccentric Graph of Trees
Sezer Sorgun, Esma Elyemani
2024· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Primitive star decompositions of graphs
Alan R. Denton, Michael W. Schroeder
2025· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Hub Cover Pebbling Number
A. Lourdusamy, F. Joy Beaula, F. Patrick
2024· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On Tades of Disjoint Union of Some Graphs
A. Lourdusamy, F. Joy Beaula, F. Patrick
2023· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Counting nodes in Smolyak grids
Jocelyn Minini, Micha Wasem
2025· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About