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
Advanced Software Engineering Methodologies
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,299 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,299 works in the cohort · of 4,299,418page 7 of 26

Labels cover 1 of 1,299 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,299 of 1,299 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
Enhanced Use Case Map Traversal Semantics
Jason Kealey, Daniel Amyot
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
On the Contributions of an End-to-End AOSD Testbed
Phil Greenwood, Alessandro Garcia, Awais Rashid, Eduardo Figueiredo, Cláudio Sant’Anna, Nélio Cacho +20 more
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Composing features and resolving interactions
Jonathan D. Hay, Joanne M. Atlee
2000· article· en· ACM SIGSOFT Software Engineering Notes· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Unifying Software and Product Configuration: A Research Roadmap
Arnaud Hubaux, Dietmar Jannach, Conrad Drescher, Tomi Männistö, Krzysztof Czarnecki, Patrick Heymans +1 more
2012· preprint· en· Oxford University Research Archive (ORA) (University of Oxford)· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Strategic Models for Business Intelligence
Lei Jiang, Daniele Barone, Daniel Amyot, John Mylopoulos
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
afffundunlabeled
Towards Autonomic GIPSY
Emil Vassev, Joey Paquet
2008· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Abstract Operational Semantics for Use Case Maps
Jameleddine Hassine, Juergen Rilling, Rachida Dssouli
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Change Propagation due to Uncertainty Change
Rick Salay, Jan Gorzny, Marsha Chećhik
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
← previousnext →

How this was built: Screen · Findings · About