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
Low-power high-performance VLSI design
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.

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

Labels cover 2 of 955 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 955 of 955 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.

affunlabeled
Transistor capacitances
D.L. Pulfrey
2010· book-chapter· en· Cambridge University Press eBooks· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/b978-0-7506-0857-2.50022-8
2000· book-chapter· en· Time to knit· Engineering
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Formal verification of pulse-mode asynchronous circuits
Xiaohua Kong, R. Negulescu
2002· article· en· Proceedings of the ASP-DAC 2001. Asia and South Pacific Design Automation Conference 2001 (Cat. No.01EX455)· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Advance Program
2022· article· en· 2022 IEEE Asian Solid-State Circuits Conference (A-SSCC)· Engineering
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
EVE
William Chow, Jonathan Rose
2002· article· en· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
An improved fast method for computing capacitance
Lianning Song, A. Konrad
2004· article· en· COMPEL The International Journal for Computation and Mathematics in Electrical and Electronic Engineering· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Descanso Gardens summer festival (rose), 1955
2021· dataset· en· University of Southern California Digital Library· Engineering
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Reduced order modeling of delayed PEEC circuits
Francesco Ferranti, M. Nakhla, Giulio Antonini, Tom Dhaene, Luc Knockaert, Albert E. Ruehli
2011· article· en· 2011 IEEE MTT-S International Microwave Symposium· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Sensitivity of reliability of logic gates
Azam Beg, Ifrah Jaffri
2017· article· en· 2017 International Conference on Electrical and Computing Technologies and Applications (ICECTA)· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About