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

affaboutunlabeled
Inverting the Pascal Matrix Plus One
Rita Aggarwala, Michael P. Lamoureux
2002· article· en· American Mathematical Monthly· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Design of signal-adapted biorthogonal filter banks
Wu-Sheng Lu, A. Antoniou
2001· article· en· IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Sparse FIR Filter Design via Partial 1-Norm Optimization
Aimin Jiang, Hon Keung Kwan, Yibin Tang, Yanping Zhu
2019· article· en· IEEE Transactions on Circuits & Systems II Express Briefs· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Matlab Code for the Discrete Hankel Transform
Natalie Baddour, Ugo Chouinard
2017· article· en· Journal of Open Research Software· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
A Class of Low-Complexity DCT-Like Transforms for Image and Video Coding
Thiago L. T. da Silveira, Diego Ramos Canterle, Diego F. G. Coelho, Vítor A. Coutinho, Fábio M. Bayer, Renato J. Cintra
2021· article· en· IEEE Transactions on Circuits and Systems for Video Technology· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Low-Complexity Loeffler DCT Approximations for Image and Video Coding
Diego F. G. Coelho, Renato J. Cintra, Fábio M. Bayer, Sunera Kulasekera, Arjuna Madanayake, Paulo Martinez +3 more
2018· article· en· Journal of Low Power Electronics and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
← previousnext →

How this was built: Screen · Findings · About