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
Topic
Software System Performance and Reliability
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.

1,099 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.
1,099 works in the cohort · of 4,299,418page 11 of 22

Labels cover 1 of 1,099 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 1,099 of 1,099 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.

affunlabeled
A Model for Performance Evaluation
Amir Antonie, Andrew Mathus
2022· article· en· Journal of Computing and Natural Science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Towards dependable clients
Masoomeh Rudafshani, Paul A. S. Ward
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
System Monitoring with Metric-Correlation Models
Miao Jiang, Mohammad A. Munawar, Thomas Reidemeister, Paul A. S. Ward
2011· article· en· IEEE Transactions on Network and Service Management· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Methods for Routine Monitoring
W.G. Alberts, D. T. Bartlett, J.-L. Chartier, C. R. Hirning, J.C. McDonald, H. Schraube +1 more
2001· article· en· Journal of the ICRU· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Towards a Classification of Log Parsing Errors
Issam Sedki, Abdelwahab Hamou‐Lhadj, Otmane Aı̈t Mohamed, Naser Ezzati‐Jivan
2023· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About