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
Time Series Analysis and Forecasting
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.

560 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.
560 works in the cohort · of 4,299,418page 5 of 12

Labels cover 0 of 560 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 560 of 560 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
CurrentClean
Zheng Zheng, Tri Minh Quach, Ziyi Jin, Fei Chiang, Mostafa Milani
2019· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
4
citations
affno abstractunlabeled
Exploratory Data Analysis
Daniela Galatro, Stephen Dawe
2023· book-chapter· en· Synthesis lectures on mechanical engineering· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
fundvenueno affunlabeled
Detection of patterns in noisy time series
Maureen Tingley, Linda McLean
2001· article· en· Canadian Journal of Statistics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affunlabeled
Trajectory Clustering in an Intersection by GDTW
Lei Gao, Lu Wei, Jian Yang, Jinhong Li
2022· article· en· Journal of Advanced Transportation· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueaboutno affunlabeled
THE MILLMAN FIREBALL ARCHIVE
Martin Beech
2003· article· en· Journal of the Royal Astronomical Society of Canada· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Granular autoencoders: concepts and design
Witold Pedrycz, Rami Al‐Hmouz, Abdullah Balamash, Ali Morfeq
2019· article· en· Soft Computing· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Real-time Lookahead Control Policies
Vadim Bulitko, Ilya Levner, Russell Greiner
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About