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

affunlabeled
Proof Complexity and Beyond
Albert Atserias, Jakob Nordstr”öm, Toniann Pitassi, Alexander Razborov
2018· article· en· Oberwolfach Reports· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Formalization of Brownian motion in Lean
Rémy Degenne, David Ledvinka, Etienne Marion, Peter Pfaffelhuber
2025· preprint· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Information Distance and Applications
Ming Li
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
The Hyperdimensional Tar Pit
Poul-Henning Kamp
2012· article· en· Queue· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Cordial Forests
Feston Kastrati, Wendy Myrvold, Lucas D. Panjer, Aaron Williams
2023· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Games and Algebras
S.J. Harris, Vern I. Paulsen
2024· book-chapter· en· Operator Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Asymptotic Growth
2024· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The Puzzling Asymmetry
2018· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Normality, Relativization, and Randomness
Wesley Calvert, Elvira Mayordomo, Daniel Turetsky, Java Darleen Villano
2025· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Blum Static Complexity and Encoding Spaces
Cezar Câmpeanu
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Second Incompleteness Theorem
George Tourlakis
2003· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
The Incompressibility Method
Ming Li, Paul Vitányi
2019· book-chapter· en· Texts in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Set Theory
Ilijas Farah, Ralf Schindler, Dima Sinapova, W. Hugh Woodin
2025· article· en· Oberwolfach Reports· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Occurrence Download
2018· dataset· en· Global Biodiversity Information Facility· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Algorithmic Complexity
Ming Li, Paul Vitányi
2019· book-chapter· en· Texts in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Philetus Melander
2016· article· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Approximability in the GPAC
Diogo Poças, J. I. Zucker
2019· preprint· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
TuringLang/Turing.jl: v0.40.0
2025· other· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Degrees of categoricity and treeable degrees
Barbara F. Csima, Dino Rossegger
2023· article· en· Journal of Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Introduction to Programming
Ben Stephenson
2025· book-chapter· en· Texts in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Degrees of categoricity above limit ordinals
Barbara F. Csima, Michael Deveau, Matthew Harrison‐Trainor, Mohammad Assem Mahmoud
2019· preprint· en· Computability· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Toric Geometry
Jürgen Hausen, Milena Hering, Nathan Ilten, Diane Maclagan
2023· article· de· Oberwolfach Reports· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
The Economics of Artificial Intelligence
Jim Euchner, Ajay Agrawal
2025· article· en· Research-Technology Management· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Inductive Sets and Types
William M. Farmer
2025· book-chapter· en· Computer science foundations and applied logic· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Von Neumann Algebras
Kenneth R. Davidson
2025· book-chapter· en· CMS/CAIMS books in mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About