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
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 ·
Categories
Machine labels · sparse coverage
Evidence
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
109 works in the cohort · of 4,299,418page 1 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Maxima in hypercubes
2005· article· en· Random Structures and Algorithms· Mathematics
distilled prediction:candidate · noneconsensus · none
46
citations
affunlabeled
On the swapping algorithm
2002· article· en· Random Structures and Algorithms· Physics and Astronomy
distilled prediction:candidate · insufficient_payloadconsensus · none
45
citations
affunlabeled
Counting the onion
2004· article· en· Random Structures and Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
32
citations
affunlabeled
On the girth of random Cayley graphs
2009· article· en· Random Structures and Algorithms· Mathematics
distilled prediction:candidate · noneconsensus · none
28
citations
affunlabeled
The height of increasing trees
2008· article· en· Random Structures and Algorithms· Mathematics
distilled prediction:candidate · noneconsensus · none
28
citations
affunlabeled
Nash equilibria in random games
2007· article· en· Random Structures and Algorithms· Decision Sciences
distilled prediction:candidate · noneconsensus · none
26
citations
afffundunlabeled
Simple permutations mix even better
2007· article· en· Random Structures and Algorithms· Mathematics
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Analysis of random LC tries
2001· article· en· Random Structures and Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affunlabeled
One line and n points
2003· article· en· Random Structures and Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Finding Adam in random growing trees
2016· preprint· en· Random Structures and Algorithms· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
12
citations
affunlabeled
Regular subgraphs of random graphs
2006· article· en· Random Structures and Algorithms· Mathematics
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Degenerate random environments
2012· article· en· Random Structures and Algorithms· Mathematics
distilled prediction:candidate · noneconsensus · none
12
citations
next →

How this was built: Screen · Findings · About