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 63 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
On Senary Simplex Codes
Manish K. Gupta, David G. Glynn, T. Aaron Gulliver
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Amortizing Rate-1 OT and Applications to PIR and PSI
Melissa Chase, Sanjam Garg, Mohammad Hajiabadi, Jialin Li, Peihan Miao
2021· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Algorithms and Data Structures
2011· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Mining Software Components from Object-Oriented APIs
Anas Shatnawi, Abdelhak-Djamel Seriai, Houari Sahraoui, Zakarea Alshara
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Anonymous k-Show Credentials
Mohamed Layouni, Hans Vangheluwe
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Monte-Carlo Methods in Pool Strategy Game Trees
Will Leckie, Michael Greenspan
2007· book-chapter· en· Lecture notes in computer science· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
I/O-Efficient Undirected Shortest Paths
Ulrich Meyer, Norbert Zeh
2003· article· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Minimizing Cache Usage in Paging
Alejandro López-Ortíz, Alejandro Salinger
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
One-Class Genetic Programming
Robert Curry, Malcolm I. Heywood
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Derandomization of Euclidean Random Walks
Ilia Binder, Mark Braverman
2007· book-chapter· en· Lecture notes in computer science· Mathematics
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Corrective Enforcement of Security Policies
Raphaël Khoury, Nadia Tawbi
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
ε-Near Collections
James F. Peters, Maciej Borkowski
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Directed Reachability for Infinite-State Systems
Michael Blondin, Christoph Haase, Philip Offtermatt
2021· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Merging of XML Documents
Wanxia Wei, Mengchi Liu, Shijun Li
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
← previousnext →

How this was built: Screen · Findings · About