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
Electronic Proceedings in Theoretical Computer Science
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.

131 results · 1 filter active ·
Results by year
20092025
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.
131 works in the cohort · of 4,299,418page 3 of 3

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

affunlabeled
A Theory of Lazy Imperative Timing
2018· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
0
citations
fundno affunlabeled
A Symmetry Property of Christoffel Words
2024· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Dagger-Drazin Inverses
2025· article· en· Electronic Proceedings in Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Counting Polyominoes in a Rectangle b x h
2024· article· en· Electronic Proceedings in Theoretical Computer Science· Materials Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
LLT Polynomials and Hecke Algebra Traces
2024· article· en· Electronic Proceedings in Theoretical Computer Science· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Power Quotients of Plactic-like Monoids
2024· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Logical foundations of Smart Contracts
2025· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Initial Semantics for Strengthened Signatures
2012· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Transition Complexity of Incomplete DFAs
2010· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
0
citations
affunlabeled
On a New Notion of Partial Refinement
2013· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
← previous

How this was built: Screen · Findings · About