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 Mathematical Modeling in Engineering
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.

682 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.
682 works in the cohort · of 4,299,418page 2 of 14

Labels cover 0 of 682 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 682 of 682 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.

fundno affunlabeled
Existence and longtime behavior of a biofilm model
Messoud Efendiev, Sergey Zelik, Hermann J. Eberl
2008· article· en· Communications on Pure &amp Applied Analysis· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
afffundno abstractunlabeled
Heat Invariants of the Steklov Problem
Iosif Polterovich, David A. Sher
2013· article· en· Journal of Geometric Analysis· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
afffundunlabeled
Random homogenization of an obstacle problem
Luis Caffarelli, Antoine Mellet
2007· article· en· Annales de l Institut Henri Poincaré C Analyse Non Linéaire· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Regularity theorems for parabolic equations
Yu. A. Semënov
2005· article· en· Journal of Functional Analysis· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affunlabeled
Computational Methods for Extremal Steklov Problems
Eldar Akhmetgaliyev, Chiu‐Yen Kao, Braxton Osting
2017· article· en· SIAM Journal on Control and Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
GENERIC model of active advection
Jian Gu, Miroslav Grmela
2007· article· en· Journal of Non-Newtonian Fluid Mechanics· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
afffundunlabeled
Form estimates for the 𝑝(𝑥)-Laplacean
W. Allegretto
2007· article· lv· Proceedings of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Gradient bounds for a thin film epitaxy equation
Dong Li, Zhonghua Qiao, Tao Tang
2016· article· en· Journal of Differential Equations· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations

How this was built: Screen · Findings · About