MétaCan
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.

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 6 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
On the hardness of full Steiner tree problems
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2015· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
About the minimum mean cycle-canceling algorithm
Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke
2014· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Dynamic Coresets
Timothy M. Chan
2009· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
fundno affunlabeled
Graph Clustering using Effective Resistance
Vedat Levi Alev, Nima Anari, Lap Chi Lau, Shayan Oveis Gharan
2017· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
fundno affunlabeled
On List Recovery of High-Rate Tensor Codes
Swastik Kopparty, Nicolas Resch, Noga Ron‐Zewi, Shubhangi Saraf, Shashwat Silas
2020· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
Formalizing Randomized Matching Algorithms
Dai Le, Stephen Cook
2012· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
A little advice can be very helpful
Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi
2012· article· en· Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Separations in Proof Complexity and TFNP
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere +1 more
2022· article· en· 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Heap Building Bounds
Zhentao Li, Bruce A. Reed
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Beyond Submodular Maximization via One-Sided Smoothness
Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd
2021· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Preconditioning for the Geometric Transportation Problem
Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Using core beliefs for point-based value iteration
Masoumeh T. Izadi, Ajit Rajwade, Doina Precup
2005· article· en· International Joint Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Succinct Posets
J. Ian Munro, Patrick K. Nicholson
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
fundno affno abstractunlabeled
Complexity Bounds on General Hard-Core Predicates
Mikael Goldmann, Mats Näslund, Alexander Russell
2001· article· en· Journal of Cryptology· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Cache-Oblivious Planar Shortest Paths
Hema Jampala, Norbert Zeh
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Submodular Maximization With Limited Function Access
Andrew Downie, Bahman Gharesifard, Stephen L. Smith
2022· article· en· IEEE Transactions on Automatic Control· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About