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

affno abstractunlabeled
Linicrypt in the Ideal Cipher Model
Zahra Javar, Bruce M. Kapron
2023· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affaboutunlabeled
Peltodytes tortulosus Roberts 1913
2009· article· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Side-Channel Based Runtime Intrusion Detection for Network Equipment
Arthur Grisel-Davy, Goksen U. Guler, Julian Dickert, Philippe Vibien, Waleed Khan, Jack A. Morgan +2 more
2024· book-chapter· en· Communications in computer and information science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
2n2222 a331 datasheet pdf
2024· other· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Efficient Key Management: Heuristics
Anne V. D. M. Kayem, Selim G. Akl, Patrick Martin
2010· book-chapter· en· Advances in information security· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
An Obfuscated Implementation of RC4
Roger Zahno, Amr Youssef
2012· book-chapter· en· Advances in intelligent systems and computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Where Security Began
Catherine H. Gebotys
2009· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
A mesh check-sum ABFT scheme for stream ciphers
Chang N. Zhang, Xiao Wei Liu
2009· article· en· International Journal of Communication Networks and Distributed Systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About