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
Author
Year range
→
Sort
Language
Type
Field
Venue
Topic
Digital Filter Design and Implementation
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.

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

Labels cover 0 of 557 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 557 of 557 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
An efficient split-radix FFT algorithm
Saad Bouguezel, M. Omair Ahmad, M.N.S. Swamy
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Multidimensional vector radix FHT algorithms
Saad Bouguezel, M.N.S. Swamy, M.O. Ahmad
2006· article· en· IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
fundno affunlabeled
On the Error-Free Computation of Fast Cosine Transform
2009· article· en· Bulgarian Digital Mathematics Library (BulDML) at IMI-BAS (Institute of Mathematics and Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
The radix-r one stage FFT kernel computation
Marwan A. Jaber, Daniel Massicotte
2008· article· en· Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
DCT approximations based on Chen’s factorization
Claudio Javier Tablada, Thiago L. T. da Silveira, Renato J. Cintra, Fábio M. Bayer
2017· article· en· Signal Processing Image Communication· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Fast Fourier Transform
Frits Agterberg
2023· book-chapter· en· Encyclopedia of earth sciences series/Encyclopedia of earth sciences· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Multithreaded implicitly dealiased convolutions
Malcolm Roberts, John C. Bowman
2017· article· en· Journal of Computational Physics· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
← previousnext →

How this was built: Screen · Findings · About