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
Theory of Computing Systems
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.

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

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

affno abstractunlabeled
Efficient Exploration of Faulty Trees
2006· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
More Fun with Symmetric Venn Diagrams
2005· article· en· Theory of Computing Systems· Engineering
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Maintaining Privacy on a Line
2011· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · open_scienceconsensus · open_science
3
citations
affno abstractunlabeled
Fault-Tolerant Sequential Scan
2007· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Preface
2017· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Preface
2016· article· en· Theory of Computing Systems· Social Sciences
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
The Algebraic Theory of Parikh Automata
2017· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Algorithms in the W-Hierarchy
2007· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Visit-Bounded Stack Automata
2023· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Normality, Relativization, and Randomness
2025· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
← previous

How this was built: Screen · Findings · About