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
Applicable Algebra in Engineering Communication and Computing
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.

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

Labels cover 0 of 29 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 29 of 29 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
On the geometry of polar varieties
Bernd Bank, M Giusti, Joos Heintz, Mohab Safey El Din, Éric Schost
2010· article· en· Applicable Algebra in Engineering Communication and Computing· Computer Science
machine prediction:candidate · noneconsensus · none
74
citations
affno abstractunlabeled
Multi-point evaluation in higher dimensions
Joris van der Hoeven, Éric Schost
2012· article· en· Applicable Algebra in Engineering Communication and Computing· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Greedy construction of DNA codes and new bounds
Nabil Bennenni, Kenza Guenda, T. Aaron Gulliver
2019· article· en· Applicable Algebra in Engineering Communication and Computing· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · 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
machine prediction:candidate · noneconsensus · none
7
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
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On the bit security of the Diffie-Hellman key
Ian F. Blake, Theo Garefalakis, Igor E. Shparlinski
2005· article· en· Applicable Algebra in Engineering Communication and Computing· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Algebraic and SAT models for SCA generation
Marlene Koelbing, Bernhard Garn, Enrico Iurlano, Ilias Kotsireas, Dimitris E. Simos
2023· article· en· Applicable Algebra in Engineering Communication and Computing· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
MWS and FWS codes for coordinate-wise weight functions
T. L. Alderson, Benjamin Morine
2023· article· en· Applicable Algebra in Engineering Communication and Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On the classification of non-exceptional APN functions
Nurdagül Anbar, Tekgül Kalaycı, Nihal Yurdakul
2024· article· en· Applicable Algebra in Engineering Communication and Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Linear label code of a root lattice using Gröbner bases
Malihe Aliasgari, Daniel Panario, Mohammad‐Reza Sadeghi
2023· article· en· Applicable Algebra in Engineering Communication and Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About