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
Electronic Communications in Probability
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.

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

Labels cover 0 of 37 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 37 of 37 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
On Variance Conditions for Markov Chain CLTs
Olle Häggström, Jeffrey S. Rosenthal
2007· article· en· Electronic Communications in Probability· Mathematics
machine prediction:candidate · noneconsensus · none
38
citations
afffundunlabeled
Variably Skewed Brownian Motion
Martin T. Barlow, Krzysztof Burdzy, Haya Kaspi, Avi Mandelbaum
2000· article· en· Electronic Communications in Probability· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
30
citations
affunlabeled
Lipschitz percolation
Nicolas Dirr, Patrick Dondl, Geoffrey Grimmett, Alexander E. Holroyd, Michael Scheutzow
2010· article· en· Electronic Communications in Probability· Mathematics
machine prediction:candidate · noneconsensus · none
29
citations
affunlabeled
The size of a pond in 2D invasion percolation
Jacob van den Berg, Antal A. Járai, Bálint Vágvölgyi
2007· article· en· Electronic Communications in Probability· Mathematics
machine prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
On free stable distributions
Takahiro Hasebe, Alexey Kuznetsov
2014· article· en· Electronic Communications in Probability· Mathematics
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Recurrence of multiply-ended planar triangulations
Ori Gurel-Gurevich, Asaf Nachmias, Juan Souto
2017· article· en· Electronic Communications in Probability· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
A Cramér–Wold theorem for mixtures
Ricardo Fraiman, Leonardo Moreno, Thomas Ransford
2025· article· en· Electronic Communications in Probability· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Burning random trees
Luc Devroye, Austin Eide, Paweł Prałat
2025· article· en· Electronic Communications in Probability· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Critical wetting in the (2+1)D solid-on-solid model
Joseph Chen, Reza Gheissari, Eyal Lubetzky
2024· article· en· Electronic Communications in Probability· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About