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
Embedded Systems Design Techniques
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.

754 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.
754 works in the cohort · of 4,299,418page 5 of 16

Labels cover 0 of 754 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 754 of 754 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
Incremental retiming for FPGA physical synthesis
Deshanand P. Singh, Valavan Manohararajah, Stephen D. Brown
2005· article· en· Proceedings. 42nd Design Automation Conference, 2005.· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Modeling and verification of DSP designs in HOL
Behzad Akbarpour
2005· dissertation· en· Spectrum Research Repository (Concordia University)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Logarithmic-Time FPGA Bitstream Analysis
Étienne Bergeron, Louis-David Perron, Marc Feeley, Jean‐Pierre David
2011· article· en· ACM Transactions on Reconfigurable Technology and Systems· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
ESys.Net
James Lapalme, E.M. Aboulhamid, Gabriela Nicolescu, Luc Charest, François-Raymond Boyer, Jean‐Pierre David +1 more
2004· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Intel SIM8-01: A Proto-PC
Zbigniew Stachniak
2007· article· en· IEEE Annals of the History of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Hybrid Prototyping of Multicore Embedded Systems
Ehsan Saboori, Samar Abdi
2013· article· en· Design, Automation & Test in Europe Conference & Exhibition (DATE), 2013· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations

How this was built: Screen · Findings · About