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
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 ·
Categories
Machine labels · sparse coverage
Evidence
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 1 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Pictorial Structures for Object Recognition
2004· article· en· International Journal of Computer Vision· Computer Science
distilled prediction:candidate · noneconsensus · none
2,199
citations
affno abstractunlabeled
Transforming Auto-Encoders
2011· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1,323
citations
afffundno abstractunlabeled
Semantic hashing
2008· article· en· International Journal of Approximate Reasoning· Computer Science
distilled prediction:candidate · noneconsensus · none
1,272
citations
affunlabeled
Recognising panoramas
2003· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
681
citations
affunlabeled
Learning to Find Good Correspondences
2018· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
546
citations
affunlabeled
Cartesian K-Means
2013· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
309
citations
affunlabeled
Picking the best DAISY
2009· article· en· 2009 IEEE Conference on Computer Vision and Pattern Recognition· Computer Science
distilled prediction:candidate · noneconsensus · none
260
citations
affno abstractunlabeled
Benchmarking Image Segmentation Algorithms
2009· article· en· International Journal of Computer Vision· Computer Science
distilled prediction:candidate · noneconsensus · none
184
citations
afffundaboutunlabeled
LSH ensemble
2016· article· en· Proceedings of the VLDB Endowment· Computer Science
distilled prediction:candidate · noneconsensus · none
136
citations
afffundunlabeled
Using the forest to see the trees
2010· article· en· Communications of the ACM· Computer Science
distilled prediction:candidate · open_scienceconsensus · open_science
129
citations
next →

How this was built: Screen · Findings · About