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
Acta Informatica
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.

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

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

affno abstractunlabeled
Sticky-free and overhang-free DNA languages
2003· article· en· Acta Informatica· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Even faster generalized LR parsing
2001· article· en· Acta Informatica· Computer Science
distilled prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
Solving #SAT using vertex covers
2007· article· en· Acta Informatica· Computer Science
distilled prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Weighted height of random trees
2008· article· en· Acta Informatica· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
On Abelian 2-avoidable binary patterns
2006· article· en· Acta Informatica· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
7
citations
affno abstractunlabeled
Early action in an Earley parser
2009· article· en· Acta Informatica· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Tree-systems of morphisms
2001· article· en· Acta Informatica· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
On the 3-tree core of plane graphs
2025· article· en· Acta Informatica· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About