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 9 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.

affunlabeled
Factorizations for difference operators
Jeffrey Bergen, Mark Giesbrecht, Pappur N Shivakumar, Yang Zhang
2015· article· en· Advances in Difference Equations· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Unicyclic strong permutations
Claude Gravel, Daniel Panario, David Thomson
2019· article· en· Cryptography and Communications· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Cycle structure of iterating Redei functions
Claudio Qureshi, Daniel Panario, Rodrigo S. V. Martins
2017· article· en· Advances in Mathematics of Communications· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Optimal Formally Self-Dual Codes over 𝔽 5 and 𝔽 7
Steven T. Dougherty, T. Aaron Gulliver, Masaaki Harada
2000· article· en· Applicable Algebra in Engineering Communication and Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Prime decompositions of regular prefix codes
Jurek Czyzowicz, Wojciech Frączak, Andrzej Pelc, Wojciech Rytter
2002· article· en· International Conference on Implementation and application of automata· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
venueno affunlabeled
Polynomials for Kloosterman Sums
S. Gurak
2007· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
6
citations
venueno affno abstractunlabeled
Classification of optimal binary self-orthogonal codes up to length 24
Iliya Bouyukliev, Stefka Bouyuklieva, T. Aaron Gulliver, Patric R. J. Östergård
2006· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
affunlabeled
On Higher Order Pyramidal Finite Elements
Liping Liu, Kevin B. Davies, Michal Křı́žek, Li Guan
2011· article· en· Advances in Applied Mathematics and Mechanics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
GAUSSIAN LAWS ON DRINFELD MODULES
Wentang Kuo, Yuru Liu
2009· article· en· International Journal of Number Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On linear complexity of sequences 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:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math>
Amr Youssef, Guang Gong
2006· article· lv· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
6
citations
affunlabeled
Space‐Time Trellis Codes
Tolga M. Duman, Ali Ghrayeb
2007· other· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
6
citations
affunlabeled
Irreducible polynomials and barker sequences
Peter Borwein, Erich Kaltofen, Michael J. Mossinghoff
2007· article· en· ACM communications in computer algebra· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Coprimitive sets and inextendable codes
T. L. Alderson, Aiden A. Bruen
2007· article· en· Designs Codes and Cryptography· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations

How this was built: Screen · Findings · About