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
Topic
Stochastic processes and statistical mechanics
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.

705 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.
705 works in the cohort · of 4,299,418page 9 of 15

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

affunlabeled
On the Markov Chain Binomial Model
M. N. Islam, C. D. O'Shaughnessy
2013· article· en· Applied Mathematics· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
2
citations
afffundunlabeled
Root estimation in Galton–Watson trees
Anna Brandenberger, Luc Devroye, Marcel K. Goh
2022· preprint· en· Random Structures and Algorithms· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundunlabeled
Spreadable arrays and martingale structures
B. Gail Ivanoff, N. C. Weber
2005· article· en· Journal of the Australian Mathematical Society· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
The Brownian motion on A``(ℝ) and quasi-local theorems
Valentin Konakov, Stéphane Menozzi, Stanislav Molchanov
2019· other· en· Contemporary mathematics - American Mathematical Society· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
Symmetric cooperative motion in one dimension
Louigi Addario‐Berry, Erin Beckman
2023· article· en· Probability Theory and Related Fields· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Hyperbolic radial spanning tree
David Coupier, Lucas Flammant, Viet Chi Tran
2024· article· en· Stochastic Processes and their Applications· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On broadcasting time in the model of travelling agents
Reaz Huq, Bogumił Kamiński, Atefeh Mashatan, Paweł Prałat, Przemysław Szufel
2020· preprint· en· Discrete Applied Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundunlabeled
Self-avoiding walk on the complete graph
Gordon Slade
2020· preprint· en· Journal of the Mathematical Society of Japan· Mathematics
distilled prediction:candidate · research_integrityconsensus · none
1
citations
affunlabeled
Pegging Graphs Yields a Small Diameter
Stefanie Gerke, Angelika Steger, Nicholas Wormald
2010· article· en· Combinatorics Probability Computing· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations

How this was built: Screen · Findings · About