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 Testing and Debugging Techniques
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.

996 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.
996 works in the cohort · of 4,299,418page 7 of 20

Labels cover 2 of 996 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 996 of 996 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.

fundno affunlabeled
BloomUnit
Peter Alvaro, Andrew J. Hutchinson, Neil Conway, William R. Marczak, Joseph M. Hellerstein
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
On Sufficiency of Mutants
Akbar Siami Namin, James H. Andrews
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Fast dynamic casting
Michael Gibbs, Bjarne Stroustrup
2005· article· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Testing k-Safe Petri Nets
Gregor von Bochmann, Guy-Vincent Jourdan
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
Dynamic determinacy analysis
Max Schäfer, Manu Sridharan, Julian Dolby, Frank Tip
2013· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
fundno affunlabeled
Nessie
Ellen Arteca, Sebastian Harner, Michael Pradel, Frank Tip
2022· article· en· Proceedings of the 44th International Conference on Software Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundunlabeled
On the Caching Schemes to Speed Up Program Reduction
Yongqiang Tian, Xueyan Zhang, Yiwen Dong, Zhenyang Xu, Mengxiao Zhang, Yu Jiang +2 more
2023· article· en· ACM Transactions on Software Engineering and Methodology· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Implementing MSC Tests with Quiescence Observation
Sergiy Boroday, Alexandre Petrenko, Andreas Ulrich
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Bordeaux: A Tool for Thinking Outside the Box
Vajih Montaghami, Derek Rayside
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Parallelizing top-down interprocedural analyses
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sriram K. Rajamani
2012· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Automatically Repairing Concurrency Bugs with ARC
David Kelk, Kevin Jalbert, Jeremy S. Bradbury
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations

How this was built: Screen · Findings · About