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
Random Structures and Algorithms
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.

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

Labels cover 0 of 109 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 109 of 109 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
Clique coloring of binomial random graphs
Colin McDiarmid, Dieter Mitsche, Paweł Prałat
2018· article· en· Random Structures and Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Smoothed analysis of balancing networks
Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
2010· article· en· Random Structures and Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Routing complexity of faulty networks
Omer Angel, Itaï Benjamini, Eran Ofek, Udi Wieder
2007· article· en· Random Structures and Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Kemeny's constant for nonbacktracking random walks
Jane Breen, Nolan Faught, Cory Glover, Mark Kempton, Adam Knudson, Alice Oveson
2023· article· en· Random Structures and Algorithms· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
5
citations
fundno affunlabeled
The diameter of inhomogeneous random graphs
Nicolás Fraiman, Dieter Mitsche
2018· article· en· Random Structures and Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Self‐avoiding walk on the hypercube
Gordon Slade
2022· article· en· Random Structures and Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
The stripping process can be slow: Part I
Pu Gao, Michael Molloy
2018· article· en· Random Structures and Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
The rank of sparse random matrices
Amin Coja‐Oghlan, Alperen A. Ergür, Pu Gao, Samuel Hetterich, Maurice Rolvien
2022· article· en· Random Structures and Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Random suffix search trees
Luc Devroye, Ralph Neininger
2003· article· en· Random Structures and Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
A percolating hard sphere model
Codina Cotar, Alexander E. Holroyd, David Revelle
2008· article· en· Random Structures and Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Root estimation in Galton–Watson trees
Anna Brandenberger, Luc Devroye, Marcel K. Goh
2022· preprint· en· Random Structures and Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Network delay inference from additive metrics
Shankar Bhamidi, Ram Rajagopal, Sébastien Roch
2010· preprint· en· Random Structures and Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Multiple choice tries and distributed hash tables
Luc Devroye, Gábor Lugosi, Gahyun Park, Wojciech Szpankowski
2008· article· en· Random Structures and Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
The height of record‐biased trees
Benoît Corsini
2022· preprint· en· Random Structures and Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Leaf Stripping on Uniform Attachment Trees
Louigi Addario‐Berry, Anna Brandenberger, Simon Briend, Nicolas Broutin, Gábor Lugosi
2025· article· en· Random Structures and Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About