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
Numerical Methods 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.

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

Labels cover 0 of 452 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 452 of 452 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.

afffundunlabeled
A hybrid DBNS processor for DSP computation
G.A. Jullien, Vassil S. Dimitrov, Bingtian Li, William C. Miller, A. Lee, Mohammad Mahdi Ahmadi
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Formalization of Fixed-Point Arithmetic in HOL
Behzad Akbarpour, Sofiène Tahar, Abdelkader Dekdouk
2005· article· en· Formal Methods in System Design· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
EXACT AND OPTIMAL CONVEX HULLS IN 2D
H. Ratschek, Jon Rokne
2000· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
DC operating points of transistor circuits
Ljiljana Trajković
2012· article· en· Nonlinear Theory and Its Applications IEICE· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
A 2-digit DBNS filter architecture
J. Eskritt, Roberto Muscedere, G.A. Jullien, Vassil S. Dimitrov, William C. Miller
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
An Introduction to Modern Analysis
Vicente Montesinos, Peter Zizler, Václav Zizler
2015· book· en· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
fundno affno abstractunlabeled
Improving CAS capabilities: New rules for computing improper integrals
José Luis Galán–García, Gabriel Aguilera‐Venegas, María Ángeles Galán–García, Pedro Rodríguez–Cielos, I. Atencia
2016· article· en· Applied Mathematics and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
The K5 transcendental functions
Thomas W. Lynch, Arif Ahmed, Michael Schulte, T.K. Callaway, R. Tisdale
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations

How this was built: Screen · Findings · About