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
Matrix Theory 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,077 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,077 works in the cohort · of 4,299,418page 2 of 22

Labels cover 1 of 1,077 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,077 of 1,077 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
On a matrix decomposition of Hartwig and Spindelböck
Oskar Maria Baksalary, George P. H. Styan, Götz Trenkler
2009· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affunlabeled
Bridging positivity and S-matrix bootstrap bounds
Joan Elias Miró, Andrea L. Guerrieri, Mehmet Asım Gümüş
2023· article· en· Journal of High Energy Physics· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
fundno affunlabeled
Multidimensional operator multipliers
Kate Juschenko, Ivan G. Todorov, Lyudmila Turowska
2009· article· en· Transactions of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Modifying the power method in max algebra
L. Elsner, P. van den Driessche
2001· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
affunlabeled
Numerical optimization
W. John Braun, Duncan J. Murdoch
2016· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
Applied Integral Transforms
M.Ya. Antimirov, Andrei Kolyshkin, Rémi Vaillancourt
2007· book· en· CRM monograph series· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
Numerical range of linear pencils
Panayiotis Psarrakos
2000· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Convex analysis on Cartan subspaces
Adrian S. Lewis
2000· article· en· Nonlinear Analysis· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
venueno affunlabeled
Characterizations of Outer Generalized Inverses
Long Wang, N. Castro-González, Jianlong Chen
2016· article· en· Canadian Mathematical Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations

How this was built: Screen · Findings · About