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
Journal of Software Maintenance and Evolution Research and Practice
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.

30 results · 1 filter active ·
Results by year
20022011
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.
30 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 30 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 30 of 30 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
Supporting the analysis of clones in software systems
Cory Kapser, Michael W. Godfrey
2006· article· en· Journal of Software Maintenance and Evolution Research and Practice· Computer Science
machine prediction:candidate · noneconsensus · none
74
citations
affunlabeled
A user‐assisted approach to component clustering
Kamran Sartipi, Kostas Kontogiannis
2003· article· en· Journal of Software Maintenance and Evolution Research and Practice· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affunlabeled
Recovering business processes from business applications
Ying Zou, Jin Guo, King Chun Foo, Maokeng Hung
2009· article· en· Journal of Software Maintenance and Evolution Research and Practice· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Search‐based many‐to‐one component substitution
Nicolas Desnos, Marianne Huchard, Guy Tremblay, Christelle Urtado, Sylvain Vauttier
2008· article· en· Journal of Software Maintenance and Evolution Research and Practice· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Mismatch handling for COTS selection: a case study
Abdallah Mohamed, Guenther Ruhe, Armin Eberlein
2011· article· en· Journal of Software Maintenance and Evolution Research and Practice· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Special Issue on Web Site Evolution (WSE 2006)
Davide Bolchini, Thomas Dean, Damiano Distante, Scott Tilley
2007· article· en· Journal of Software Maintenance and Evolution Research and Practice· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Special Issue on Search‐Based Software Maintenance
Massimiliano Di Penta, Giuliano Antoniol, Mark Harman
2008· article· en· Journal of Software Maintenance and Evolution Research and Practice· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About