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
Designs Codes and Cryptography
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.

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

Labels cover 0 of 159 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 159 of 159 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.

affunlabeled
A Latin square autotopism secret sharing scheme
Rebecca J. Stones, Ming Su, Xiaoguang Liu, Gang Wang, Sheng Hsien Lin
2015· article· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
On binary Kloosterman sums divisible by 3
Kseniya Garaschuk, Petr Lisoněk
2008· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
On-line secret sharing
2011· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Improved distinguishers for HC-128
Paul Stankovski, Sushmita Ruj, Martin Hell, Thomas Johansson
2011· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
afffundno abstractunlabeled
On tight bounds for binary frameproof codes
Chuan Guo, Douglas R. Stinson, Tran van Trung
2015· article· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
14
citations
afffundno abstractunlabeled
Mutually unbiased weighing matrices
Darcy Best, Hadi Kharaghani, Hugh Ramp
2014· article· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Packing Arrays and Packing Designs
Brett Stevens, Eric Mendelsohn
2002· article· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
On a Bound of Cover-Free Families
Xiao Ma, Ruizhong Wei
2004· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
On generalized Howell designs with block size three
R. Julian R. Abel, R. A. Bailey, Andrea C. Burgess, Peter Danziger, Eric Mendelsohn
2015· article· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Some primality tests that eluded Lucas
Eric L. F. Roettger, Hywel C Williams, R. Kent Guy
2015· article· en· Designs Codes and Cryptography· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
On the maximality of linear codes
T. L. Alderson, András Gács
2009· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Secure simultaneous bit extraction from Koblitz curves
Xinxin Fan, Guang Gong, Berry Schoenmakers, Francesco Sica, Andrey Sidorenko
2018· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Codes with girth 8 Tanner graph representation
Amin Sakzad, Mohammad‐Reza Sadeghi, Daniel Panario
2009· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
On τ-adic representations of integers
Nevine Ebeid, M.A. Hasan
2007· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Coprimitive sets and inextendable codes
T. L. Alderson, Aiden A. Bruen
2007· article· en· Designs Codes and Cryptography· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations

How this was built: Screen · Findings · About