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
Information Processing Letters
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.

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

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

affno abstractunlabeled
Cuckoo hashing: Further analysis
2003· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
89
citations
affno abstractunlabeled
The state complexity of and
2006· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
A new tree inclusion algorithm
2006· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Signature files and signature trees
2002· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Dynamic Shannon coding
2006· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Pattern expressions and pattern automata
2004· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
On planar path transformation
2007· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Flying over a polyhedral terrain
2007· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
next →

How this was built: Screen · Findings · About