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
Analytic Number Theory Research
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.

974 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.
974 works in the cohort · of 4,299,418page 2 of 20

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

afffundunlabeled
Calculating cyclotomic polynomials
Andrew Arnold, Michael Monagan
2011· article· lv· Mathematics of Computation· Mathematics
machine prediction:candidate · noneconsensus · none
27
citations
afffundunlabeled
Exponential sums over Mersenne numbers
William D. Banks, Alessandro Conflitti, John Friedlander, Igor E. Shparlinski
2003· article· en· Compositio Mathematica· Mathematics
machine prediction:candidate · noneconsensus · none
27
citations
affunlabeled
Roots of unity and nullity modulo 𝑛
Steven R. Finch, Greg Martin, Pascal Sebah
2010· article· en· Proceedings of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
27
citations
affunlabeled
The frequency and the structure of large character sums
Jonathan Bober, Leo Goldmakher, Andrew Granville, Dimitris Koukoulopoulos
2018· article· en· Journal of the European Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
26
citations
affunlabeled
SPECIAL VALUES OF THE POLYGAMMA FUNCTIONS
M. Ram Murty, N. Saradha
2009· article· en· International Journal of Number Theory· Mathematics
machine prediction:candidate · noneconsensus · none
25
citations
aboutno affunlabeled
Small Gaps Between Primes I
D. A. Goldston, C. Y. Yıldırım
2005· preprint· en· ArXiv.org· Mathematics
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
FOURTEEN OCTONARY QUADRATIC FORMS
Ayşe Alaca, Şaban Alaca, Kenneth S. Williams
2010· article· en· International Journal of Number Theory· Mathematics
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Polynomial values free of large prime factors
Cécile Dartyge, Gérald Tenenbaum, Greg Martin
2002· article· en· Periodica Mathematica Hungarica· Mathematics
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
A short note on sign changes
Jaban Meher, Karam Deo Shankhadhar, G. K. Viswanadham
2013· article· en· Proceedings - Mathematical Sciences· Mathematics
machine prediction:candidate · noneconsensus · none
24
citations
afffundunlabeled
Monic integer Chebyshev problem
Peter Borwein, Christopher Pinner, Igor E. Pritsker
2003· article· en· Mathematics of Computation· Mathematics
machine prediction:candidate · noneconsensus · none
23
citations
afffundunlabeled
[no title]
Michael A. Bennett, Vandita Patel, Samir Siksek
2017· article· en· Warwick Research Archive Portal (University of Warwick)· Mathematics
machine prediction:candidate · insufficient_payloadconsensus · none
22
citations
fundno affunlabeled
ℤ[] is Euclidean
Malcolm Harper
2004· article· en· Canadian Journal of Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Low lying zeros of Artin $$L$$ L -functions
Peter J. Cho, Henry H. Kim
2014· article· de· Mathematische Zeitschrift· Mathematics
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
Improvements to Turing’s method
Timothy S. Trudgian
2011· article· en· Mathematics of Computation· Mathematics
machine prediction:candidate · noneconsensus · none
21
citations
afffundno abstractunlabeled
Explicit zero density for the Riemann zeta function
Habiba Kadiri, Allysa Lumley, Nathan Ng
2018· article· en· Journal of Mathematical Analysis and Applications· Mathematics
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
A THREE SQUARES THEOREM WITH ALMOST PRIMES
Valentin Blomer, Jörg Brüdern
2005· article· en· Bulletin of the London Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
THE ILLUSORY SIEVE
John Friedlander, Henryk Iwaniec
2005· article· en· International Journal of Number Theory· Mathematics
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
On a Conjecture of Chowla and Milnor
Sanoli Gun, M. Ram Murty, Purusottam Rath
2011· article· en· Canadian Journal of Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
20
citations
← previousnext →

How this was built: Screen · Findings · About