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
Proceedings of the American Mathematical Society
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.

630 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.
630 works in the cohort · of 4,299,418page 11 of 13

Labels cover 0 of 630 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 630 of 630 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
Polynomial Gauss sums
Stephen D. Cohen, Michael Dewar, John Friedlander, Daniel Panario, Igor E. Shparlinski
2005· article· en· Proceedings of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
A probabilistic version of Rosenthal’s inequality
С. В. Асташкин, Konstantin Tikhomirov
2013· article· en· Proceedings of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
A note on the selfsimilarity of limit flows
Beomjun Choi, Robert Haslhofer, Or Hershkovits
2020· preprint· en· Proceedings of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
A tight structure theorem for sumsets
Andrew Granville, Aled Walker
2021· preprint· lv· Proceedings of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Fake mu’s
Greg Martin, Michael J. Mossinghoff, Timothy S. Trudgian
2022· article· lv· Proceedings of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Approximating rational points on surfaces
Brian Lehmann, David McKinnon, Matthew Satriano
2024· preprint· lv· Proceedings of the American Mathematical Society· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Tracial approximation is stable
George A. Elliott, Qingzhai Fan
2017· article· en· Proceedings of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
An unusual continued fraction
Dzmitry Badziahin, Jeffrey Shallit
2015· preprint· en· Proceedings of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Helson Sets of Synthesis Are Ditkin Sets
Antony To-Ming Lau, A. Ülger
2017· article· en· Proceedings of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Characterizations of cancellable groups
Matthew Harrison‐Trainor, Meng-Che Ho
2019· preprint· lv· Proceedings of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
On free subgroups in division rings
Jason P. Bell, Jairo Z. Gonçalves
2019· preprint· fi· Proceedings of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Spanning trees in pseudorandom graphs via sorting networks
Joseph Hyde, Natasha Morrison, Alp Müyesser, Matías Pavez‐Signé
2025· article· lv· Proceedings of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Sufficient conditions for a problem of Polya
Abhishek Bharadwaj, Aprameyo Pal, Veekesh Kumar, R. Thangadurai
2024· article· lv· Proceedings of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Infinite monochromatic sumsets for colourings of the reals
Péter Komjáth, Imre Leader, Paul A. Russell, Saharon Shelah, Dániel T. Soukup, Zoltán Vidnyánszky
2018· preprint· en· Proceedings of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About