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
Cryptography and Residue Arithmetic
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.

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

Labels cover 0 of 438 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 438 of 438 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Drinfeld Modules in SageMath
David Ayotte, Xavier Caruso, Antoine Leudière, Joseph Musleh
2023· article· en· ACM communications in computer algebra· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
2
citations
affunlabeled
Compact elliptic curve representations
Mathieu Ciet, Jean-Jacques Quisquater, Francesco Sica
2011· article· en· Journal of Mathematical Cryptology· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Faster Complete Addition Laws for Montgomery Curves
Reza Rezaeian Farashahi, Mojtaba Fadavi, Soheila Sabbaghian
2024· article· en· IACR Transactions on Cryptographic Hardware and Embedded Systems· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Saving Fusion Levels in Lenke 1/2 AR Curves
Michael W. Brown, Arun R. Hariharan, Tracey L. Bryan, David S. Feldman, Craig R. Louer, John S. Vorhies +11 more
2025· article· en· Spine· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
PEARL-SCALLOP: Parameter Extension Applicable in Real Life for SCALLOP
Bill Allombert, Jean‐François Biasse, Jonathan Komada Eriksen, Péter Kutas, Christopher Leonardi, Aurel Page +2 more
2024· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Subquadratic-Time Algorithms for Normal Bases
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
2021· preprint· en· Computational Complexity· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Implementing the Tangent Graeffe Root Finding Method
Joris van der Hoeven, Michael Monagan
2020· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Torus-based compression by factor 4 and 6.
Koray Karabina
2010· preprint· en· IACR Cryptology ePrint Archive· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Faster Explicit Formulas for Computing Pairings over Ordinary Curves.
Diego F. Aranha, Koray Karabina, Patrick Longa, Catherine H. Gebotys, Julio César López-Hernández
2010· preprint· en· IACR Cryptology ePrint Archive· Computer Science
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
1
citations
affno abstractunlabeled
An Elliptic Curve Trapdoor System.
Edlyn Teske
2003· preprint· en· IACR Cryptology ePrint Archive· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Fault attacks on pairing-based protocols revisited.
Sanjit Chatterjee, Koray Karabina, Alfred Menezes
2014· preprint· en· NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_scienceconsensus · sts
0
citations
affunlabeled
ps-pat/Moonshine.jl: v0.3.3
2025· other· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Arithmetic of Generalized Jacobians.
Isabelle Déchène
2006· preprint· en· IACR Cryptology ePrint Archive· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About