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
Rough Sets and Fuzzy Logic
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.

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

Labels cover 1 of 939 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 939 of 939 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
Q-closure spaces
Lili Shen
2015· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On the existence of balanced chain rule task sets
Haile Gilroy
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Incomplete Information
Joseph Agassi
2017· other· en· The Wiley-Blackwell Encyclopedia of Social Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Relations as Images
Mathieu Alain, Jules Desharnais
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Preface
Dominik Ślȩzak, Benjamin C. M. Fung, William K. Cheung
2015· article· la· Fundamenta Informaticae· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Introduction to Granular Computing
Stefania Tomasiello, Witold Pedrycz, Vincenzo Loia
2022· book-chapter· en· Big and integrated artificial intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Rough Sets and Data Mining
Jerzy W. Grzymala‐Busse, Wojciech Ziarko
2005· book-chapter· en· IGI Global eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Variable Precision Approximations of Rough Sets
Wojciech Ziarko
2021· book-chapter· en· Encyclopedia of Complexity and Systems Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Totally Bounded Elements in W*-probability Spaces
Jananan Arulseelan, Isaac Goldbring, Bradd Hart, Thomas Sinclair
2025· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Weak Dependencies in Approximation Spaces
Wojciech Ziarko, Xugunag Chen
2013· article· en· Fundamenta Informaticae· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
A critical study of attribute reducts.
2007· dissertation· en· oURspace (University of Regina)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Quantifying sequential subsumption
Hui Wang, Cees H. Elzinga, Zhiwei Lin, Jordan Vincent
2019· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Top-k Typicality Queries on Uncertain Data
Hua Ming, Jian Pei
2011· book-chapter· en· ˜The œKluwer international series on advances in database systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About