MétaCan
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.

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 Engineering Research
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.

3,468 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.
3,468 works in the cohort · of 4,299,418page 47 of 70

Labels cover 10 of 3,468 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 3,468 of 3,468 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
ReqWiki
Bahar Sateli, Srinivasan Sembakkam Rajivelu, Elian Angius, René Witte
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
OSDC
Umme Hunny, Mohammad Zulkernine, Komminist Weldemariam
2013· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
4
citations
affunlabeled
Refactoring clones: A new perspective
Nikolaos Tsantalis, Giri Panamoottil Krishnan
2013· article· en· Computer Science
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
affaboutunlabeled
PBS tool demonstration report on xfig
T. Parry, Hsuanling Lee, J.B. Tran
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Dynamic round-trip GUI maintenance
Peng Li, Eric Wohlstadter
2008· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Discussion on the Results of the Detection of Design Defects
Naouel Moha, Yann‐Gaël Guéhéneuc, Laurence Duchien, Anne-Françoise Le Meur
2007· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Automated Grading of Use Cases
Mohsen Hosseinibaghdadabadi, Omar Alam, Nicolas Almerge, Jörg Kienzle
2023· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About