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
Topic
Optimization and Search Problems
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.

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

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

affno abstractunlabeled
Deterministic Rendezvous in Graphs
2006· article· en· Algorithmica· Computer Science
distilled prediction:candidate · noneconsensus · none
179
citations
affno abstractunlabeled
Graph exploration by a finite automaton
2005· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
176
citations
afffundno abstractunlabeled
Autonomous mobile robots with lights
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
145
citations
affno abstractunlabeled
Scheduling in the dark
2000· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
104
citations
afffundno abstractunlabeled
Distributed Computing by Oblivious Mobile Robots
2012· article· en· Synthesis lectures on distributed computing theory· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
99
citations
afffundunlabeled
Gathering Despite Mischief
2014· article· en· ACM Transactions on Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
74
citations
next →

How this was built: Screen · Findings · About