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 Image and Video Retrieval Techniques
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,044 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,044 works in the cohort · of 4,299,418page 4 of 21

Labels cover 2 of 1,044 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,044 of 1,044 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
Order-Preserving Moves for Graph-Cut-Based Optimization
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu
2009· article· en· IEEE Transactions on Pattern Analysis and Machine Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
An Orientation Invariant Visual Homing Algorithm
David G. Churchill, Andrew Vardy
2012· article· en· Journal of Intelligent & Robotic Systems· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Optimal Image and Video Closure by Superpixel Grouping
Alex Levinshtein, Cristian Sminchisescu, Sven Dickinson
2012· article· en· International Journal of Computer Vision· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affunlabeled
PPHOCFS
Qingchen Zhang, Hua Zhong, Laurence T. Yang, Zhikui Chen, Fanyu Bu
2016· article· en· ACM Transactions on Multimedia Computing Communications and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
afffundunlabeled
SILICON SUPPORT VECTOR MACHINE WITH ON-LINE LEARNING
Roman Genov, Shantanu Chakrabartty, Gert Cauwenberghs
2003· article· en· International Journal of Pattern Recognition and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affunlabeled
Picking the best DAISY
S. Winder, Gang Hua, M. Brown
2009· article· en· 2009 IEEE Conference on Computer Vision and Pattern Recognition· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affunlabeled
Multiresolution Deep Belief Networks
Yichuan Tang, Abdelrahman Mohamed
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations

How this was built: Screen · Findings · About