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
Journal of Number Theory
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.

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

Labels cover 0 of 245 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 245 of 245 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Transcendence of Sturmian or Morphic Continued Fractions
Jean‐Paul Allouche, J. L. Davison, Martine Queffélec, Luca Q. Zamboni
2001· article· en· Journal of Number Theory· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
82
citations
affno abstractunlabeled
Transcendental values of the digamma function
M. Ram Murty, N. Saradha
2007· article· en· Journal of Number Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
75
citations
afffundno abstractunlabeled
On Bost–Connes type systems for number fields
Marcelo Laca, Nadia S. Larsen, Sergey Neshveyev
2008· article· en· Journal of Number Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
40
citations
affno abstractunlabeled
On the distribution of rational functions along a curve over <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">F</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math> and residue races
Andrew Granville, Igor E. Shparlinski, Alexandru Zaharescu
2005· article· lv· Journal of Number Theory· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · insufficient_payload
34
citations
afffundno abstractunlabeled
Higher-order recurrences for Bernoulli numbers
Takashi Agoh, Karl Dilcher
2009· article· en· Journal of Number Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
32
citations
affno abstractunlabeled
On the critical points of modular forms
Hicham Saber, Abdellah Sebbar
2012· article· en· Journal of Number Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
23
citations
affno abstractunlabeled
Littlewood Pisot numbers
Keshav Mukunda
2005· article· en· Journal of Number Theory· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
22
citations
afffundno abstractunlabeled
Exceptional sets of hypergeometric series
Natália Archinard
2003· article· en· Journal of Number Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
20
citations
affno abstractunlabeled
Exhibiting SHA[2] on hyperelliptic Jacobians
Nils Bruin, E. V. Flynn
2005· article· en· Journal of Number Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
19
citations
afffundno abstractunlabeled
A problem of Chowla revisited
M. Ram Murty, V. Kumar Murty
2011· article· en· Journal of Number Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
19
citations
affno abstractunlabeled
Restricted linear congruences
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan, Roberto Tauraso, László Tóth
2016· article· en· Journal of Number Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
19
citations
affno abstractunlabeled
The primitive solutions to <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mn>9</mml:mn></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math>
Nils Bruin
2005· article· lv· Journal of Number Theory· Mathematics
distilled prediction:candidate · metaresearch+metaepi_narrow+metaepi_broad+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+open_science+research_integrity+insufficient_payload
19
citations
afffundno abstractunlabeled
Periods of orbits modulo primes
Amir Akbary, Dragos Ghioca
2009· article· en· Journal of Number Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
19
citations
affno abstractunlabeled
On p-adic Diamond–Euler Log Gamma functions
Min-Soo Kim, Su Hu
2013· article· en· Journal of Number Theory· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
15
citations

How this was built: Screen · Findings · About