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
Lecture notes in computer science
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.

11,332 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.
11,332 works in the cohort · of 4,299,418page 24 of 227

Labels cover 8 of 11,332 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 11,332 of 11,332 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
High Performance Computing and Applications
Yan Chen, Wu Zhang
2016· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Copying and Comparing: Problems and Solutions
Peter Grogono, Markku Sakkinen
2000· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Architectural Technical Debt: A Grounded Theory
Roberto Verdecchia, Philippe Kruchten, Patricia Lago
2020· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
fundno affno abstractunlabeled
Computer Aided Verification
2007· book· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Preimage Attacks on Reduced-Round Stribog
Riham AlTawy, Amr Youssef
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Vision Language Models are blind
Pooyan Rahmanzadehgervi, Logan Bolton, Mohammad Reza Taesiri, Anh Totti Nguyen
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Feature Selection with Adjustable Criteria
JingTao Yao, Ming Zhang
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
An Exploration of Location Error Estimation
David Dearman, Alex Varshavsky, Eyal de Lara, Khai N. Truong
2007· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Temporal Logic Model Checking in Alloy
Amirhossein Vakili, Nancy A. Day
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
P-OPT: Program-Directed Optimal Cache Management
Xiaoming Gu, Tongxin Bai, Yaoqing Gao, Chengliang Zhang, Roch Archambault, Chen Ding
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
ΧChek: A Multi-valued Model-Checker
Marsha Chećhik, Arie Gurfinkel, Benet Devereux
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Fast Brain Matching with Spectral Correspondence
Hervé Lombaert, Leo Grady, Jon̈athan R. Polimeni, Farida Chériet
2011· article· en· Lecture notes in computer science· Neuroscience
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Where Is the AI? AI Literacy for Educators
Lesley Wilton, Stephen Ip, Meera Sharma, Frank Fan
2022· book-chapter· en· Lecture notes in computer science· Social Sciences
machine prediction:candidate · noneconsensus · none
28
citations
← previousnext →

How this was built: Screen · Findings · About