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
Author
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. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

afffundno abstractunlabeled
Bounded-Angle Minimum Spanning Trees
Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari
2021· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Separating OR, SUM, and XOR circuits
Magnus Find, Mika Göös, Matti J„ärvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
2016· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Vizing’s Theorem in Near-Linear Time
Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2025· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Randomised Composition and Small-Bias Minimax
Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre
2022· article· en· 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Testing Bounded Arboricity
Talya Eden, Reut Levi, Dana Ron
2018· preprint· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Polynomial size linear programs for problems in P
David Avis, Hans Raj Tiwary, Osamu Watanabe
2019· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
When Do Gomory--Hu Subtrees Exist?
Guyslain Naves, F. Bruce Shepherd
2022· preprint· en· SIAM Journal on Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Fragile Complexity of Adaptive Algorithms
Rolf Fagerberg, Prosenjit Bose, Pilar Cano, John Iacono, Stefan Langerman
2021· book-chapter· en· IT University Of Copenhagen (IT University of Copenhagen)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Separating OR, SUM, and XOR Circuits
Mika Göös, Matti J„ärvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
2013· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Criticality of Regular Formulas
Benjamin Rossman
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Minimum-Cost Single-Source 2-Splittable Flow
Stavros G. Kolliopoulos
2004· article· en· Electronic Notes in Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Reductions for the stable set problem
Edward C. Sewell, Sheldon H. Jacobson, Hemanshu Kaul
2011· article· en· Algorithmic operations research· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Subspace-Invariant AC^0 Formulas
Benjamin Rossman
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Explicit bounds for graph minors
Jim Geelen, Tony Huynh, R. Bruce Richter
2013· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
[no title]
Kaave Hosseini, Hamed Hatami, Shachar Lovett
2022· article· en· Theory of Computing· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
1
citations
fundno affunlabeled
[no title]
Thomas Watson
2015· article· en· Theory of Computing· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About