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
Random Matrices and Applications
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.

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

Labels cover 0 of 489 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 489 of 489 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
The Non-Commutative Cycle Lemma
Craig E. Armstrong, James A. Mingo, Roland Speicher, J. Wilson
2009· article· en· Journal of Combinatorial Theory Series A· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Potential kernels for radial Dunkl Laplacians
Piotr Graczyk, Tomasz Luks, Patrice Sawyer
2021· preprint· en· Canadian Journal of Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
FREE INFINITE DIVISIBILITY FOR ULTRASPHERICALS
Octavio Arizmendi, Serban T. Belinschi
2013· preprint· en· Infinite Dimensional Analysis Quantum Probability and Related Topics· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Gaussian random matrices
Alexandru Nica, Roland Speicher
2006· book-chapter· en· Cambridge University Press eBooks· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Wiener densities for the Airy line ensemble
Duncan Dauvergne
2024· article· en· Proceedings of the London Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
The full rank condition for sparse random matrices
Amin Coja‐Oghlan, Pu Gao, Max Hahn‐Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien
2024· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Non-crossing cumulants of type B
Philippe Biane, Frederick M. Goodman, Alexandru Nica
2002· preprint· en· ArXiv.org· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Matrix deviation inequality for ℓp-norm
Yuan-Chung Sheu, Te-Chun Wang
2023· article· en· Random Matrices Theory and Application· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About