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
HAL (Le Centre pour la Communication Scientifique Directe)
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.

21,501 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.
21,501 works in the cohort · of 4,299,418page 22 of 431

Labels cover 57 of 21,501 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 21,501 of 21,501 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
Quantum Programming with Inductive Datatypes
Romain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev
2020· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Supporting Assurance Case Development Using Generative AI
Torin Viger, Logan Murphy, Simon Diemert, Claudio Menghi, Alessio Di, Marsha Chećhik
2023· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Engineering
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Du nom des images d'Isis polymorphe
Laurent Bricault
2006· preprint· fr· HAL (Le Centre pour la Communication Scientifique Directe)· Social Sciences
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
How do we teach Modelling and Model-Driven Engineering? A survey
Federico Ciccozzi, Michalis Famelis, Gerti Kappel, Leen Lambers, Sébastien Mosser, Richard F. Paige +6 more
2018· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
A Fitted-Q Algorithm for Budgeted MDPs
Nicolas Carrara, Romain Laroche, Jean-Léon Bouraoui, Tanguy Urvoy, Olivier Pietquin
2018· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
EcoSD Annual Workshop - Consequential LCA
Isabelle Blanc
2015· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Engineering
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
"Do-It-Together”: Towards the Factories of the Future
Laurent Dupont, Fédoua Kasmi, Joshua M. Pearce, Roland Ortt
2021· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Social Sciences
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Having Fun With 31.521 Shell Scripts
Nicolas Jeannerod, Yann Régis-Gianas, Ralf Treinen
2017· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Maximum Edge-Disjoint Paths in $k$-sums of Graphs
Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd
2013· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Vous avez dit développement durable?
Corinne Gendron
2012· preprint· fr· HAL (Le Centre pour la Communication Scientifique Directe)· Social Sciences
machine prediction:candidate · noneconsensus · none
3
citations
affaboutunlabeled
Autochtonies vues de France et du Québec
Marie Salaün, Natacha Gagné, Martin Thibault
2009· preprint· fr· HAL (Le Centre pour la Communication Scientifique Directe)· Social Sciences
machine prediction:candidate · noneconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About