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
Cryptographic Implementations and Security
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.

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

Labels cover 0 of 504 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 504 of 504 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
The Simeck Family of Lightweight Block Ciphers.
Gangqiang Yang, Bo Zhu, Valentin Suder, Mark D. Aagaard, Guang Gong
2015· preprint· en· IACR Cryptology ePrint Archive· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Key Recovery Attack Against 2.5-Round $$\pi $$ -Cipher
Christina Boura, Avik Chakraborti, Gaëtan Leurent, Goutam Paul, Dhiman Saha, Hadi Soleimany +1 more
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
ADS-B Broadcast Authentication
Haomiao Yang, Hongwei Li, Xuemin Shen
2022· book-chapter· en· Wireless networks· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Modern Cryptography for ADS-B Systems
Haomiao Yang, Hongwei Li, Xuemin Shen
2022· book-chapter· en· Wireless networks· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
ERINDALE: A Polynomial Based Hashing Algorithm
V. Kumar Murty, Nikolajs Volkovs
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
On the Sosemanuk Related Key-IV Sets
Aleksandar Kircanski, Amr Youssef
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Using RC4-BHF to Construct One-way Hash Chains
Qian Yu, Chang N. Zhang
2013· book-chapter· en· Lecture notes in electrical engineering· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Comparison of boolean function design
Khoongming Khoo, Hian-Kiat Lee, Guang Gong
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About