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 7 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
Numerical Integration
Robert M. Corless, Nicolas Fillion
2013· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
A new kind of companion matrix
Eunice Y. S. Chan, Robert M. Corless
2017· article· en· Electronic Journal of Linear Algebra· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Spectral Characterization of Algebraic Elements
Thomas Ransford, Michael White
2001· article· en· Bulletin of the London Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Scalable adaptive cubic regularization methods
Jean‐Pierre Dussault, Tangi Migot, Dominique Orban
2023· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Corners of normal matrices
Rajendra Bhatia, Man-Duen Choi
2006· article· en· Proceedings of the Indian Academy of Sciences - Section A· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
New Results on D‐Optimal Matrices
2012· article· en· Journal of Combinatorial Designs· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
An algebraic equation for linear operators
C. T. Ng, Weinian Zhang
2005· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Positivity and matrix semigroups
Janez Bernik, Mitja Mastnak, Heydar Radjavi
2010· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Sign patterns that require or allow power-positivity
Minerva Catral, Leslie Hogben, D.D. Olesky, P. van den Driessche
2009· article· en· Electronic Journal of Linear Algebra· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Polynomial bounds for small matrices
Michel Crouzeix, Frank Gilfeather, John Holbrook
2013· article· en· Linear and Multilinear Algebra· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Sparse inertially arbitrary patterns
Michael Cavers, Kevin N. Vander Meulen, Loretta Vanderspek
2009· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Derivatives of compound matrix valued functions
Brendan Ames, Hristo S. Sendov
2015· article· en· Journal of Mathematical Analysis and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
fundno affno abstractunlabeled
On Cullis’ determinant for rectangular matrices
Yoshiomi Nakagami, Haruo Yanai
2007· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About