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 2 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.

afffundunlabeled
Oracle size
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2006· preprint· en· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affunlabeled
Lower bounds for local approximation
Mika Göös, Juho Hirvonen, Jukka Suomela
2013· article· en· Journal of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
The cluster deletion problem for cographs
Yong Gao, Donovan R. Hare, James Nastos
2013· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
DERANDOMIZATION: A BRIEF OVERVIEW
Valentine Kabanets
2004· article· en· WORLD SCIENTIFIC eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
Reducing the complexity of reductions
M. Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
2001· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Concavity cuts for disjoint bilinear programming
Stéphane Alarie, Charles Audet, Brigitte Jaumard, Gilles Savard
2001· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
afffundunlabeled
Learning Algorithms from Natural Proofs
Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova
2016· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affno abstractunlabeled
Optimal 3-terminal cuts and linear programming
Kevin K. H. Cheung, William H. Cunningham, Lawrence Tang
2005· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affunlabeled
On the theory of average case complexity
Shalev Ben-David, Benny Chor, Oded Goldreich, Michael Luby
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
Mining Circuit Lower Bound Proofs for Meta-Algorithms
Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
2015· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affunlabeled
The VPN conjecture is true
Navin Goyal, Neil Olver, F. Bruce Shepherd
2008· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affunlabeled
Packing element-disjoint steiner trees
Joseph Cheriyan, Mohammad R. Salavatipour
2007· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
afffundunlabeled
A logarithmic approximation for unsplittable flow on line graphs
Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour
2009· article· en· Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
fundno affunlabeled
On the usefulness of predicates
Per Austrin, Johan Håstad
2013· article· en· ACM Transactions on Computation Theory· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
afffundunlabeled
Structure of Protocols for XOR Functions
Hamed Hatami, Kaave Hosseini, Shachar Lovett
2018· article· en· SIAM Journal on Computing· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
The capacitated max k-cut problem
Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli
2007· article· en· Mathematical Programming· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
← previousnext →

How this was built: Screen · Findings · About