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
4OR
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.

26 results · 1 filter active ·
Results by year
20032023
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.
26 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 26 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 26 of 26 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.

affno abstractunlabeled
Bilevel programming: A survey
Benoît Colson, Patrice Marcotte, Gilles Savard
2005· article· en· 4OR· Computer Science
machine prediction:candidate · noneconsensus · none
453
citations
affno abstractunlabeled
Shared mobility systems
Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo
2015· article· en· 4OR· Engineering
machine prediction:candidate · noneconsensus · none
110
citations
affno abstractunlabeled
Ten notes on equal-processing-time scheduling
Philippe Baptiste, Peter Brucker, Sigrid Knust, VadimG. Timkovsky
2004· article· en· 4OR· Engineering
machine prediction:candidate · noneconsensus · none
54
citations
affno abstractunlabeled
Chemical trees enumeration algorithms
Roberto Aringhieri, Pierre Hansen, Federico Malucelli
2003· article· en· 4OR· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Variations on the Roy-Gallai theorem
D. de Werra, Pierre Hansen
2005· article· en· 4OR· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations

How this was built: Screen · Findings · About