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

afffundno abstractunlabeled
Semidefinite programming for permutation codes
Mathieu Bogaerts, Peter J. Dukes
2014· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Cyclic inequivalence of cascaded GMW-sequences
Solomon W. Golomb, Guang Gong, Zong Duo Dai
2000· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
On Negacyclic Codes of Length 8 p s over F p m + u F p m
Youssef Ahendouz, Ismail Akharraz
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Lexicodes over rings
Kenza Guenda, T. Aaron Gulliver, S. Arash Sheikholeslam
2013· article· en· Designs Codes and Cryptography· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Ternary Extremal Four-Negacirculant Self-Dual Codes
Masaaki Harada, Keita Ishizuka, Hadi Kharaghani
2024· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
On coefficients of polynomials over finite fields
Amela Muratović-Ribić, Qiang Wang
2011· article· en· Finite Fields and Their Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Affine Reflection Group Codes
Terasan Niyomsataya, Ali Miri, Monica Nevins
2008· article· en· IEEE Transactions on Information Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Worst-Case Redundancy of Solid Codes
Helmut Jürgensen, Stavros Konstantinidis
2005· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Computing all factorizations in ***
Howard Cheng, George Labahn
2001· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About