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

affunlabeled
Erasure-Resilient Sublinear-Time Graph Algorithms
Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Nithin Varma
2021· preprint· en· ACM Transactions on Computation Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Complexity Column
Andreǐ A. Bulatov
2025· article· en· ACM SIGLOG News· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On the Reducibility of Submodular Functions
Jincheng Mei, Hao Zhang, Bao‐Liang Lu
2016· article· en· International Conference on Artificial Intelligence and Statistics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
PODC 2019 Review
Naama Ben-David, Yi‐Jun Chang, Michal Dory, Dean Leitersdorf
2019· article· en· ACM SIGACT News· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Testing convexity of functions over finite domains
Aleksandrs Belovs, Eric Blais, Abhinav Bommireddi
2019· preprint· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Subspace-Invariant AC$^0$ Formulas
Benjamin Rossman
2019· preprint· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Extremely uniform branching programs.
Michaël Cadilhac, Andreas Krebs, Pierre McKenzie
2014· article· en· NCMA· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affaboutunlabeled
Zigzag Form over Families of Parametric Matrices
Robert M. Corless, Marc Moreno Maza, Steven E. Thornton
2015· article· en· ACM communications in computer algebra· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Galled Perfect Transfer Networks
2024· article· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
The Branch-and-Bound Tree Closure
2025· article· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Probabilistic optimization in graph-problems
Cécile Murat, Vangélis Th. Paschos
2010· article· en· Algorithmic operations research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Linear Arrangement Problems and Interval Graphs
Alain Quilliot, Djamal Rebaïne
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About