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

venueno affno abstractunlabeled
On Infinite Kuratowski Theorems.
L. Boza, María Teresa Dávila, Eugenio M. Fedriani, R. Moyano
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Entropy-efficient finitary codings
Tom Meyerovitch, Yinon Spinka
2024· article· fr· Journal of Modern Dynamics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Non-computable Julia sets
Mark Braverman, Michael Yampolsky
2004· preprint· en· ArXiv.org· 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
affunlabeled
Toward a Model of Models: Part II
Mordechay Schlesinger, Robert D. Kent
2005· book-chapter· en· Kluwer Academic Publishers eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
aboutno affunlabeled
ACM Turing Award Lecture at SC22
2022· article· en· ACM SIGHPC Connect· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Bridging Generative Networks with the Common Model of Cognition
Robert West, Spencer Eckler, Brendan Conway-Smith, Nico Turcas, Eilene Tomkins-Flanagan, Matthew A. Kelly
2024· article· en· Proceedings of the AAAI Symposium Series· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Set Theory
Ilijas Farah, Ralf‐Dieter Schindler, Dima Sinapova, W. Hugh Woodin
2023· article· en· Oberwolfach Reports· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
A local study of embeddings of complexity one
Guillaume Bousquet, Lucy Moser-Jauslin
2004· book-chapter· en· CRM proceedings & lecture notes· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Linear orders with distinguished function symbol
Douglas Cenzer, Barbara F. Csima, Bakhadyr Khoussainov
2008· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Generative AI
Matthew Guzdial, Sam Snodgrass, Adam Summerville
2025· book-chapter· en· Synthesis lectures on games and computational intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Preliminaries
Ming Li, Paul Vitányi
2008· book-chapter· en· Texts in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Algorithmic Prefix Complexity
Ming Li, Paul Vitányi
2008· book-chapter· en· Texts in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Algorithmic Complexity
Ming Li, Paul Vitányi
2008· book-chapter· en· Texts in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Resource-Bounded Complexity
Ming Li, Paul Vitányi
2008· book-chapter· en· Texts in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Relatively computably enumerable reals
2010· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Essays on Coding Theory
Ian F. Blake
2024· book· en· Cambridge University Press eBooks· 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
affunlabeled
Communication Can Destroy Common Learning
Jakub Steiner, Colin Stewart
2008· preprint· en· RePEc: Research Papers in Economics· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affaboutunlabeled
A computational journey in the true north
Selim G. Akl
2019· article· en· International Journal of Parallel Emergent and Distributed Systems· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The planar Ramsey numbers PR(K4-e, Kk-e).
Yongqi Sun, Yuansheng Yang, Zhihai Wang
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
From Automatism to Autonomy
Ruochen Bo
2023· article· en· Conversations The Journal of Cavellian Studies· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Measuring complexities of classes of structures
Barbara F. Csima, Carolyn Knoll
2015· article· en· Annals of Pure and Applied Logic· 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

How this was built: Screen · Findings · About