MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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
Polynomial and algebraic computation
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.

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

Labels cover 1 of 656 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 656 of 656 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
Efficient decomposition of separable algebras
Wayne Eberly, Mark Giesbrecht
2003· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Not seeing the roots for the branches
David J. Jeffrey, A. C. Norman
2004· article· en· ACM SIGSAM Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
A bound for the Rosenfeld–Gröbner algorithm
Oleg Golubitsky, M. V. Kondratieva, Marc Moreno Maza, Alexey Ovchinnikov
2008· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Using Sparse Interpolation in Hensel Lifting
Michael Monagan, Baris Tuncer
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
fundno affunlabeled
George Boole's Deductive System
Frank Markham Brown
2009· article· en· Notre Dame Journal of Formal Logic· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
An equivalence theorem for regular differential chains
François Boulier, François Lemaire, Adrien Poteaux, Marc Moreno Maza
2018· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
afffundno abstractunlabeled
Computing critical points for invariant algebraic systems
Jean‐Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2022· article· en· Journal of Symbolic Computation· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
← previousnext →

How this was built: Screen · Findings · About