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
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 4 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
Measure-driven keyword-query expansion
Nikos Sarkas, Nilesh Bansal, Gautam Das, Nick Koudas
2009· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
A concept geometry for conceptual spaces
John T. Rickard
2006· article· en· Fuzzy Optimization and Decision Making· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
L-ToPSS – Push-Oriented Location-Based Services
Ioana Burcea, Hans‐Arno Jacobsen
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
Computing closed skycubes
Chedy Raïssi, Jian Pei, Thomas Kister
2010· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affunlabeled
Parallel Computation of Skyline Queries
Adan Cosgaya-Lozano, Andrew Rau‐Chaplin, Norbert Zeh
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affgemma · no categorygpt · no categorymodels split
GeoSearcher: Location‐based ranking of search engine results
Carolyn Watters, Ghada Amoudi
2002· article· en· Journal of the American Society for Information Science and Technology· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affunlabeled
Orthogonal query recommendation
Hossein Vahabi, Margareta Ackerman, David Loker, Ricardo Baeza‐Yates, Alejandro López-Ortíz
2013· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
Integrating XML data sources using approximate joins
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh Srivastava, Ting Yu
2006· article· en· ACM Transactions on Database Systems· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Counting distance permutations
Matthew Skala
2008· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
Efficient integration of road maps
Eliyah Safra, Yaron Kanza, Yehoshua Sagiv, Yerach Doytsher
2006· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
Network Voronoi Diagram Based Range Search
Kefeng Xuan, Geng Zhao, David Taniar, Bala Srinivasan, Maytham Safar, Marina L. Gavrilova
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
(Approximate) uncertain skylines
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Predicting the size of IDA*ʼs search tree
Levi H. S. Lelis, Sandra Zilles, Robert C. Holte
2013· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Ranking queries on uncertain data
Hua Ming, Jian Pei, Xuemin Lin
2010· article· en· The VLDB Journal· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affunlabeled
Size-Constrained Weighted Set Cover
Lukasz Golab, Flip Korn, Feng Li, Barna Saha, Divesh Srivastava
2015· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Probabilistic Graph Summarization
Nasrin Hassanlou, Maryam Shoaran, Alex Thomo
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations

How this was built: Screen · Findings · About