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
Advanced Authentication Protocols 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.

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

Labels cover 1 of 260 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 260 of 260 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
WPA3 Connection Deprivation Attacks
Karim Lounis, Mohammad Zulkernine
2020· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
A Protocol for Secure Public Instant Messaging
Mohammad Mannan, Paul C. van Oorschot
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
A flaw in the electronic commerce protocol SET
Srečko Brlek, Sardaouna Hamadou, John Mullins
2005· article· en· Information Processing Letters· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Safely Exporting Keys from Secure Channels
Christina Brzuska, Håkon Jacobsen, Douglas Stebila
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
afffundunlabeled
Secure machine‐type communications in LTE networks
Chengzhe Lai, Rongxing Lu, Hui Li, Dong Zheng, Xuemin Shen
2015· article· en· Wireless Communications and Mobile Computing· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Where EAP security claims fail
Katrin Hoeper, Lidong Chen
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations

How this was built: Screen · Findings · About