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
Mathematical functions and polynomials
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.

580 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.
580 works in the cohort · of 4,299,418page 5 of 12

Labels cover 0 of 580 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 580 of 580 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.

affunlabeled
A PROBLEM ABOUT MAHLER FUNCTIONS
Boris Adamczewski, Jason P. Bell
2013· preprint· en· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Polynomial approximation of symmetric functions
Markus Bachmayr, Geneviève Dusson, Christoph Ortner, Jack Thomas
2023· article· lv· Mathematics of Computation· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Griffiths polynomials of Racah type
Nicolas Crampé, L. Frappat, Julien Gaboriaud, E. Ragoucy, Luc Vinet, Meri Zaimi
2024· article· en· Journal of Mathematical Physics· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
A NOTE ON BARKER POLYNOMIALS
Peter Borwein, Tamás Erdélyi
2012· article· en· International Journal of Number Theory· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On Euler–Maclaurin formula
François Dubeau
2015· article· en· Journal of Computational and Applied Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Critical Measures on Higher Genus Riemann Surfaces
Marco Bertola, Alan Groot, Arno B. J. Kuijlaars
2023· article· en· Communications in Mathematical Physics· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
← previousnext →

How this was built: Screen · Findings · About