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
Cryptography and Communications
Topic
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.

41 results · 1 filter active ·
Results by year
20092025
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.
41 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 41 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 41 of 41 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
Asymptotic enumeration of correlation-immune boolean functions
E. Rodney Canfield, Zhicheng Gao, Catherine Greenhill, Brendan D. McKay, Robert W. Robinson
2010· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
New constructions of involutions over finite fields
Tailin Niu, Kangquan Li, Longjiang Qu, Qiang Wang
2019· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Unbiased complex Hadamard matrices and bases
Darcy Best, Hadi Kharaghani
2010· article· en· Cryptography and Communications· Engineering
machine prediction:candidate · noneconsensus · none
15
citations
afffundno abstractunlabeled
Optimal parameters for the WG stream cipher family
Kalikinkar Mandal, Guang Gong, Xinxin Fan, Mark D. Aagaard
2013· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
Status of three classes of sequences
Guang Gong, Z.L. Wang
2022· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
On encoding symbol degrees of array BP-XOR codes
Maura B. Paterson, Douglas R. Stinson, Yongge Wang
2015· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Unicyclic strong permutations
Claude Gravel, Daniel Panario, David Thomson
2019· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
The welch-gong stream cipher - evolutionary path
Nuša Zidarič, Kalikinkar Mandal, Guang Gong, Mark D. Aagaard
2023· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
On the counting of involutory MDS matrices
Susanta Kumar Samanta
2024· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Error analysis of weak Poly-LWE instances
Yao Chen, Benjamin M. Case, Shuhong Gao, Guang Gong
2018· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Characteristic digit-sum sequences
Aleksandr Tuxanidy, Qiang Wang
2017· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Additive codes with few weights
Daniel Panario, Murat Şahin, Qiang Wang
2024· article· en· Cryptography and Communications· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
New Turyn-type sequences
Stephen London, Ilias Kotsireas
2025· article· en· Cryptography and Communications· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About