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
Real-Time Systems Scheduling
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.

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

Labels cover 0 of 429 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 429 of 429 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
Safe Task Interruption for FPGAs
Sameh Attia, Vaughn Betz
2019· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
10.1016/b978-2-294-76306-9.50026-0
2000· book-chapter· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
CAN Tools
Marco Di Natale, Haibo Zeng, Paolo Giusto, Arkadeb Ghosal
2011· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Modeling Error Control Protocols
Fayez Gebali
2015· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Control Loops in RTLinux
Victor Yodaiken, Matt Sherer, E. Hilton
2005· book-chapter· en· Birkhäuser Boston eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
UBE2K Purification
Jacob McAuley, Rachel Harding, C.H. Arrowsmith, A.M. Edwards
2019· dataset· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Component-Based Web Applications
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Loop torsors. Theory and applications
Philippe Gille, Vladimir Chernousov, Arturo Pianzola
2024· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
UBE2K Purification
Jacob McAuley, Rachel Harding, C.H. Arrowsmith, A.M. Edwards
2019· dataset· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Integrating Schedulability Analysis with UML-RT
Qimin Gao, Lyndon J. Brown, Luiz Fernando Capretz
2015· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About