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
Computability, Logic, AI Algorithms
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.

805 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.
805 works in the cohort · of 4,299,418page 9 of 17

Labels cover 0 of 805 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 805 of 805 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.

aboutno affunlabeled
ACM Turing Award Lecture at SC22
2022· article· en· ACM SIGHPC Connect· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Persistence $K$-theory
Paul Biran, Octav Cornea, Jun Zhang
2024· article· en· Quantum Topology· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Intelligence in Machines
F. Richard Yu, Angela W. Yu
2022· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Software for "How to Bake a Quantum Pi"
Jacques Carette, Amr Sabry, Chris Heunen, Robin Kaarsgaard
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Vizing's Theorem in Near-Linear Time
Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2024· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Random gaps
James Hirschorn
2008· article· en· Transactions of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Approximability in the GPAC
Diogo Poças
2020· article· en· mediaTUM (Technical University of Munich)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Ring wormholes and time machines
Valeri P. Frolov, Pavel Krtouš, Andrei Zelnikov
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
A Note on Mutation Equivalence
Si‐Yang Maggie Liu, Jie Pan
2025· article· en· Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affvenueaboutunlabeled
Vavilov and Generative AI
Robert Diab
2025· article· en· Alberta Law Review· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On edge-disjoint Ramsey numbers of stars
Emma Jent, Ping Zhang
2025· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Jenks prize 2015 award citation
Erich Kaltofen
2016· article· en· ACM communications in computer algebra· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Cone Avoidance of Some Turing Degrees
Patrizio Cintioli
2017· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Growth in AI Knowledge
Joshua S. Gans
2025· preprint· en· SSRN Electronic Journal· Computer Science
machine prediction:candidate · bibliometricsconsensus · none
0
citations
aboutno affunlabeled
Yee-Hong Yang, Computing Science
2016· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
The Brain Agent.
Claude Frasson
2014· article· en· International Conference on Agents and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Coding Theory
Sean Gouglas, Stéfan Sinclair, Aimée Morrison
2006· book-chapter· en· University of Calgary Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A Tale of Discrete Mathematics
Joseph Kalil Khoury
2023· book· en· WORLD SCIENTIFIC eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
by
2003· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations

How this was built: Screen · Findings · About