MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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
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 4 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

fundno affno abstractunlabeled
Intervals of totally nonnegative matrices
2013· article· en· Linear Algebra and its Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
afffundno abstractunlabeled
Companion matrix patterns
2014· article· en· Linear Algebra and its Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
A completely PPT map
2014· article· en· Linear Algebra and its Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
afffundno abstractunlabeled
Sums of orthogonal projections
2014· article· en· Journal of Functional Analysis· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Displacement rank of the Drazin inverse
2004· article· en· Journal of Computational and Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Polynomial numerical hulls of matrices
2007· article· en· Linear Algebra and its Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Complex symmetric stabilizing solution of the matrix equation <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mrow><mml:mi>X</mml:mi><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>⊤</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mi>Q</mml:mi></mml:mrow></mml:math>
2011· article· lv· Linear Algebra and its Applications· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+open_science+research_integrity+insufficient_payload
20
citations
affno abstractunlabeled
A note on the fixed-point iteration for the matrix equations <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mrow><mml:mi>X</mml:mi><mml:mo>±</mml:mo><mml:msup><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mo>∗</mml:mo></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mi>I</mml:mi></mml:mrow></mml:math>
2008· article· lv· Linear Algebra and its Applications· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
20
citations
affunlabeled
LU factoring of non-invertible matrices
2010· article· en· ACM communications in computer algebra· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
19
citations
affunlabeled
The Block Rational Arnoldi Method
2020· article· en· SIAM Journal on Matrix Analysis and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
18
citations
venueno affno abstractunlabeled
On Konhauser Matrix Polynomials.
2011· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
18
citations
← previousnext →

How this was built: Screen · Findings · About