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
Coding theory and cryptography
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,096 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,096 works in the cohort · of 4,299,418page 8 of 22

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

affno abstractunlabeled
Quasi-cyclic codes over <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">F</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:math> and enumeration of defining polynomials
V. Ch. Venkaiah, T. Aaron Gulliver
2012· article· lv· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+research_integrity+insufficient_payloadconsensus · none
8
citations
affno abstractunlabeled
Maximal AMDS codes
T. L. Alderson, Aiden A. Bruen
2008· article· en· Applicable Algebra in Engineering Communication and Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
An M3 Public-Key Encryption Scheme
Hugh C. Williams
2007· article· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Simplex and MacDonald codes over $$R_{q}$$ R q
Karima Chatouh, Kenza Guenda, T. Aaron Gulliver, Lemnouar Noui
2016· article· en· Journal of Applied Mathematics and Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Status of three classes of sequences
Guang Gong, Z.L. Wang
2022· article· en· Cryptography and Communications· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Extremal Self-Dual Codes over Z6, Z8 and Z10
T. Aaron Gulliver, Masaaki Harada, Mariko Hagita
2005· article· en· AKCE International Journal of Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Basis decompositions of genus-one string integrals
Carlos Rodríguez, Oliver Schlotterer, Yong Zhang
2024· article· en· Journal of High Energy Physics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Generalized hyper-bent functions over <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mtext>GF</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
Amr Youssef
2007· article· lv· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+insufficient_payload
7
citations
afffundunlabeled
Computing isomorphisms and embeddings of finite fields
Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost
2018· article· en· Mathematics of Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
7
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
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
On interleaved sequences over finite fields
Shaoquan Jiang, Zongduo Dai, Guang Gong
2002· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Cyclotomic orthomorphisms of finite fields
Jordan Bell
2012· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
fundno affunlabeled
The asymptotic behavior of N-adic complexity
Andrew Klapper
2007· article· en· Advances in Mathematics of Communications· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Legendre pairs of lengths ℓ≡0(mod3)
Ilias Kotsireas, Christoph Koutschan
2021· article· en· Journal of Combinatorial Designs· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Toward a General Correlation Theorem
K.C. Gupta, Palash Sarkar
2005· article· en· IEEE Transactions on Information Theory· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
7
citations
affunlabeled
Constacyclic Codes over Finite Principal Ideal Rings
Aicha Batoul, Kenza Guenda, T. Aaron Gulliver
2017· book-chapter· en· Digital Kenyon (Kenyon College)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
7
citations
affno abstractunlabeled
Computing Sparse Multiples of Polynomials
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
2010· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
7
citations
fundno affunlabeled
Oblivious Transfer Based on the McEliece Assumptions
Rafael Dowsley, Jeroen van de Graaf, Jörn Müller‐Quade, Anderson C. A. Nascimento
2012· article· en· IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences· Computer Science
distilled prediction:candidate · stsconsensus · none
7
citations
afffundno abstractunlabeled
Cryptanalysis of three quantum money schemes
Andriyan Bilyk, Javad Doliskani, Zhiyong Gong
2023· article· en· Quantum Information Processing· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
On Efficient Normal Basis Multiplication
Arash Reyhani-Masoleh, M.A. Hasan
2000· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
7
citations

How this was built: Screen · Findings · About