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
Topic
Data Management and Algorithms
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,256 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,256 works in the cohort · of 4,299,418page 1 of 26

Labels cover 2 of 1,256 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,256 of 1,256 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
Data mining: concepts and techniques
Jiawei Han, Micheline Kamber
2012· article· en· Choice Reviews Online· Computer Science
machine prediction:candidate · noneconsensus · none
28,877
citations
affunlabeled
DBSCAN Revisited, Revisited
Erich Schubert, Jörg Sander, Martin Ester, Hans Peter Kriegel, Xiaowei Xu
2017· article· en· ACM Transactions on Database Systems· Computer Science
machine prediction:candidate · noneconsensus · none
2,625
citations
affunlabeled
CELF++
Amit Goyal, Wei Lu, Laks V. S. Lakshmanan
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
857
citations
affno abstractunlabeled
Approximate query processing using wavelets
Kaushik Chakrabarti, Minos Garofalakis, Rajeev Rastogi, Kyuseok Shim
2001· article· en· The VLDB Journal· Computer Science
machine prediction:candidate · noneconsensus · none
477
citations
afffundno abstractunlabeled
Computing contour trees in all dimensions
Hamish Carr, Jack Snoeyink, Ulrike Axen
2002· article· en· Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
460
citations
affunlabeled
Mapping data in peer-to-peer systems
Anastasios Kementsietsidis, Marcelo Arenas, Renée J. Miller
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
253
citations
afffundunlabeled
On composite lognormal-Pareto models
David P. M. Scollnik
2007· article· en· Scandinavian Actuarial Journal· Computer Science
machine prediction:candidate · noneconsensus · none
182
citations
affunlabeled
Trajectory similarity join in spatial networks
Shuo Shang, Lisi Chen, Zhewei Wei, Christian S. Jensen, Kai Zheng, Panos Kalnis
2017· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
179
citations
affunlabeled
MoveMine
Zhenhui Li, Jiawei Han, Ji Ming, Lu‐An Tang, Yintao Yu, Bolin Ding +2 more
2011· article· en· ACM Transactions on Intelligent Systems and Technology· Computer Science
machine prediction:candidate · noneconsensus · none
133
citations
affunlabeled
Keyword search in graphs
Mehdi Kargar, Aijun An
2011· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
132
citations
affno abstractunlabeled
From moments of sum to moments of product
Raymond Kan
2007· article· en· Journal of Multivariate Analysis· Computer Science
machine prediction:candidate · noneconsensus · none
131
citations
affno abstractunlabeled
Skyline Cardinality for Relational Processing
Parke Godfrey
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
120
citations
affunlabeled
Towards multidimensional subspace skyline analysis
Jian Pei, Yidong Yuan, Xuemin Lin, Wen Jin, Martin Ester, Qing Liu +4 more
2006· article· en· ACM Transactions on Database Systems· Computer Science
machine prediction:candidate · noneconsensus · none
117
citations
affunlabeled
Interactive query refinement
Chaitanya Mishra, Nick Koudas
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
99
citations
affunlabeled
Relaxing join and selection queries
Nick Koudas, Chen Li, Anthony K. H. Tung, Rares Vernica
2006· article· en· National University of Singapore· Computer Science
machine prediction:candidate · noneconsensus · none
95
citations
affunlabeled
Clusterability: A Theoretical Study
Margareta Ackerman, Shai Ben-David
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
94
citations
affunlabeled
BE-tree
Mohammad Sadoghi, Hans‐Arno Jacobsen
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
93
citations
next →

How this was built: Screen · Findings · About