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 5 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.

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
affno abstractunlabeled
Antimatroids, Betweenness, Convexity
Vašek Chvátal
2008· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Rk-hist
Todd Eavis, Alex López
2007· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
24
citations
affunlabeled
Interactive navigation of open data linkages
Erkang Zhu, Ken Q. Pu, Fatemeh Nargesian, Renée J. Miller
2017· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Maximum Split Clustering Under Connectivity Constraints
Pierre Hansen, Brigitte Jaumard, Christophe Meyer, Bruno Simeone, Valeria Doring
2003· article· en· Journal of Classification· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Succinct representation of labeled graphs
Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affunlabeled
k-Nearest Neighbors Queries in Time-Dependent Road Networks
Lívia Almada Cruz, Mário A. Nascimento, José Antônio Fernandes de Macêdo
2012· article· en· Cadernos de Linguística e Teoria da Literatura (Universidade Federal de Minas Gerais)· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Immersed Visual Data Mining: Walking the Walk
Ayman Ammoura, Osmar R. Zai͏̈ane, Yuan Ji
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
Iceberg-cube computation with PC clusters
Raymond T. Ng, Alan Wagner, Yu Yin
2001· article· en· ACM SIGMOD Record· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
A Supervised Learning Approach to Entity Search
Guoping Hu, Jun Liu, Hang Li, Yunbo Cao, Jian‐Yun Nie, Jianfeng Gao
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Logic-oriented fuzzy clustering
Witold Pedrycz, George Vukovich
2002· article· en· Pattern Recognition Letters· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
On Approximate Range Counting and Depth
Peyman Afshani, Timothy M. Chan
2009· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Query processing of multi-way stream window joins
Moustafa A. Hammad, Walid G. Aref, Ahmed K. Elmagarmid
2006· article· en· The VLDB Journal· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
URank
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen–Chuan Chang
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Signature files and signature trees
Yangjun Chen
2002· article· en· Information Processing Letters· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
afffundunlabeled
Disdyakis Triacontahedron DGGS
John Hall, Lakin Wecker, Benjamin Ulmer, Faramarz Samavati
2020· article· en· ISPRS International Journal of Geo-Information· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affaboutunlabeled
An ontology-based framework for geospatial clustering
Xin Wang, Wei Gu, Danielle Ziébelin, Howard J. Hamilton
2010· article· en· International Journal of Geographical Information Systems· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations

How this was built: Screen · Findings · About