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
Complexity and Algorithms in Graphs
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.

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

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

afffundno abstractunlabeled
Bounded-Angle Minimum Spanning Trees
2021· article· en· Algorithmica· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Separating OR, SUM, and XOR circuits
2016· article· en· Journal of Computer and System Sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Randomised Composition and Small-Bias Minimax
2022· article· en· 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
2
citations
fundno affunlabeled
Testing Bounded Arboricity
2018· preprint· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
fundno affunlabeled
When Do Gomory--Hu Subtrees Exist?
2022· preprint· en· SIAM Journal on Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+research_integrity+insufficient_payloadconsensus · none
2
citations
affno abstractunlabeled
Fragile Complexity of Adaptive Algorithms
2021· book-chapter· en· IT University Of Copenhagen (IT University of Copenhagen)· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
2
citations
affunlabeled
Separating OR, SUM, and XOR Circuits
2013· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affunlabeled
Criticality of Regular Formulas
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affno abstractunlabeled
Minimum-Cost Single-Source 2-Splittable Flow
2004· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
venueno affunlabeled
Reductions for the stable set problem
2011· article· en· Algorithmic operations research· Computer Science
distilled prediction:candidate · stsconsensus · none
1
citations
fundno affunlabeled
Subspace-Invariant AC^0 Formulas
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · none
1
citations
fundno affunlabeled
Explicit bounds for graph minors
2013· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
fundno affunlabeled
[no title]
2022· article· en· Theory of Computing· Computer Science
distilled prediction:candidate · stsconsensus · none
1
citations
fundno affunlabeled
[no title]
2015· article· en· Theory of Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About