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
Cryptography and Data 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.

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

Labels cover 2 of 1,083 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 1,083 of 1,083 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
Decryption Failure Is More Likely After Success
Nina Bindel, John M. Schanck
2020· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Secure multi-party computation in large networks
Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia, Mahdi Zamani
2016· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Provably weak instances of Ring-LWE
Yara Elias, Kristin Lauter, Ekin Özman, Katherine E. Stange
2015· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
fundno affunlabeled
[no title]
Salman Beigi, Peter W. Shor, John Watrous
2011· article· en· Theory of Computing· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
19
citations
aboutno affno abstractunlabeled
Aggregating Falcon Signatures with LaBRADOR
Marius A. Aardal, Diego F. Aranha, Katharina Boudgoust, Sebastian Kolby, Akira Takahashi
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Compact Certificates of Collective Knowledge
Silvio Micali, Leonid Reyzin, Georgios Vlachos, Riad S. Wahby, Nickolai Zeldovich
2021· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
FHEW with Efficient Multibit Bootstrapping
Jean‐François Biasse, Luis Marco Ruiz
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Privacy Preserving Scheme for Location-Based Services
Youssef Gahi, Mouhcine Guennoun, Zouhair Guennoun, Khalil El‐Khatib
2012· article· en· Journal of Information Security· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
SPEcTRe
Jeremy Day, Yizhou Huang, Edward Knapp, Ian Goldberg
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
A New Protocol for the Nearby Friend Problem
Sanjit Chatterjee, Koray Karabina, Alfred Menezes
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
fundno affno abstractunlabeled
On the Feasibility of Extending Oblivious Transfer
Yehuda Lindell, Hila Zarosim
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
One-round secure comparison of integers
Blake Ian F., Kolesnikov Vladimir
2009· article· en· Journal of Mathematical Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Multi-prover proof of retrievability
Maura B. Paterson, Douglas R. Stinson, Jalaj Upadhyay
2018· article· en· DOAJ (DOAJ: Directory of Open Access Journals)· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Randomness versus Fault-Tolerance
Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
2000· article· en· Journal of Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Guessing Secrecy
Mohsen Alimomeni, Reihaneh Safavi–Naini
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Secure untraceable off-line electronic cash system
Yaser Baseri, Benyamin Takhtaei, Javad Mohajeri
2013· article· en· PolyPublie (École Polytechnique de Montréal)· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
afffundunlabeled
A Multivariate Blind Ring Signature Scheme
Dung Hoang Duong, Willy Susilo, Ha Thanh Nguyen Tran
2019· article· en· The Computer Journal· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations

How this was built: Screen · Findings · About