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 16 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
GMMT: A Revocable Group Merkle Multi-tree Signature Scheme
Mahmoud Yehia, Riham AlTawy, T. Aaron Gulliver
2021· preprint· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_science+research_integrityconsensus · open_science
1
citations
fundno affunlabeled
Supersingular Isogeny-based Ring Signature
Maryam Sheikhi Garjan, N. Gamze ORHON KILIÇ, Murat Cenk
2023· article· en· International Journal of Information Security Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Ursa Minor: The Implementation Framework for Polaris
Mohammadtaghi Badakhshan, Guiwen Luo, Tanmayi Jandhyala, Guang Gong
2025· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
fundno affno abstractunlabeled
Linear Prover IOPs in Log Star Rounds
Noor Athamnah, Noga Ron‐Zewi, Ron D. Rothblum
2025· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
fundno affunlabeled
BLS12-381 Pairing Implementation with RAM Footprint Smaller than 4KB
Riku Anzai, Junichi Sakamoto, Naoki Yoshida, Tsutomu Matsumoto
2022· article· en· 2022 37th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Privacy aware web services in the cloud
Farshad Rahimi Asl, Fei Chiang, Wenbo He, Reza Samavi
2017· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Attribute-Based Encryption for Circuits.
S. Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
2013· preprint· en· DSpace@MIT (Massachusetts Institute of Technology)· Computer Science
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
1
citations
afffundunlabeled
Zero-knowledge trust negotiation
Bo Wang, Ruizhong Wei
2009· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Oblivious Turing Machine
Sofiane Azogagh, Victor Delfour, Marc‐Olivier Killijian
2024· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Tight Bounds for Simon's Algorithm.
Xavier Bonnetain
2020· preprint· en· IACR Cryptology ePrint Archive· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundno abstractunlabeled
Combinatorial repairability for threshold schemes
Douglas R. Stinson, Ruizhong Wei
2017· preprint· en· Designs Codes and Cryptography· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
fundno affunlabeled
Population Protocols with Unordered Data
Michael Blondin
2023· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
On The Zero-Trust Intranet Certification Problem
Danielle Botha-Badenhorst, André Martin McDonald, Graham David Barbour, Ethan Buckinjohn, Wian Gertenbach
2024· article· en· International Conference on Cyber Warfare and Security· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
RouterORAM: An O(1)-Latency and Client-Work ORAM
Sumit Kumar Paul, Deborah Knox
2025· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations

How this was built: Screen · Findings · About