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
Advanced Database Systems and Queries
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.

1,036 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.
1,036 works in the cohort · of 4,299,418page 12 of 21

Labels cover 2 of 1,036 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 1,036 of 1,036 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
Object Oriented Data Analysis
J. O. Ramsay
2023· article· en· The American Statistician· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
XML parsing
Matthias Nicola, Jasmi John
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Types for REWERSE reasoning and query languages I3-D4
Horatiu Cirstea, Emmanuel Coquery, Włodzimierz Drabent, François Fages, Claude Kirchner, Luigi Liquori +2 more
2005· preprint· fr· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Past Indeterminacy in Data Warehouse Design
Christina Khnaisser, Luc Lavoie, Anita Burgun, Jean‐François Éthier
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Optimal Policies to Obtain the Most Join Results
Nariankadu D. Shyamalkumar, Ralph P. Russo, Ramon Lawrence
2007· article· en· Journal of Theoretical Probability· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Counting embeddings of a chain into a binary tree.
Małgorzata Kuchta, Michał Morayne, Jarosław Niemiec
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
XML Tree Pattern, XML Twig Query
Laks V. S. Lakshmanan
2009· book-chapter· en· Encyclopedia of Database Systems· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Types of Stream Processing Algorithms
Lukasz Golab
2019· book-chapter· en· Encyclopedia of Big Data Technologies· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Generic Approach to Internationalization of Websites
Tomasz Müldner, Darcy G. Benoit, Fei Wang
2004· article· en· IASTED Conference on Software Engineering and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Refactoring-Aware Block Tracking in Commit History
Nikolaos Tsantalis, Pouria Alikhanifard
2024· article· en· IEEE Transactions on Software Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Indexing on Non-Volatile Memory
Kaisong Huang, Tianzheng Wang
2023· book· en· SpringerBriefs in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
XML Schema Integration to Facilitate E-Commerce
Louise Lane, Kalpdrum Passi, Sanjay Madria, Mukesh Mohania
2011· book-chapter· en· IGI Global eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Computing Shapley Values for Dynamic Data
Haocheng Xia, Jiayao Zhang, Qiheng Sun, Jinfei Liu, Kui Ren, Li Xiong +1 more
2025· article· en· IEEE Transactions on Knowledge and Data Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations

How this was built: Screen · Findings · About