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 11 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.

fundno affno abstractunlabeled
P-proper splittings
M. Rajesh Kannan
2017· article· la· Aequationes Mathematicae· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Optimal measures for Toeplitz matrices
Milan Hladnik, John Holbrook
2005· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
A new derivation of a formula by Kato
Brendan Ames, Hristo S. Sendov
2011· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Differential Calculus
Veselin Jungić, Petra Menz, Randall Pyke
2023· book· en· WORLD SCIENTIFIC eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
aboutno affunlabeled
Realizations of Multiassociahedra via Rigidity
Luis Crespo Ruiz, Francisco Santos
2024· article· lv· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Sign patterns with a nest of positive principal minors
D.D. Olesky, Michael J. Tsatsomeros, P. den Driessche
2011· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Maximizing traces of matrix functions
S.W. Drury
2004· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Persistently positive inverses of perturbed M-matrices
Ronald D. Haynes, Manfred R. Trummer, Shannon C. Kennedy
2007· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Iterative Signal Processing in Communications
Christian Schlegel, Peter Adam Hoeher, Owe Axelsson, Lance C. Pérez
2010· article· en· Journal of Electrical and Computer Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations

How this was built: Screen · Findings · About