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

affno abstractunlabeled
Generalized inflations and null extensions
Qiang Wang, Shelly L. Wismath
2004· article· en· Discussiones Mathematicae - General Algebra and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
venueno affno abstractunlabeled
On Some Conjectures by Rabinowitz.
Krzysztof Kołodziejczyk, Daria Olszewska
2006· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Imitation Game: Threshold or Watershed?
Eric Neufeld, Sonje Finnestad
2020· article· en· Minds and Machines· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
fundno affno abstractunlabeled
Fundamentals of Computation Theory
Henning Fernau, Klaus Jansen
2023· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Reversible Computation
Gerhard W. Dueck, D. Michael Miller
2013· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Small clones and the projection property
Maurice Pouzet, Ivo G. Rosenberg
2010· article· en· Algebra Universalis· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Computer Algebra in Scientific Computing
François Boulier, Matthew England, Ilias Kotsireas, Timur Sadykov, Evgenii V. Vorozhtsov
2023· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Implementing artificial consciousness
Leonard Dung, Luke Kersten
2024· article· en· Mind & Language· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
On the distribution of Lachlan nonsplitting bases
S. Barry Cooper, Angsheng Li, Xiaoding Yi
2002· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Computability of the Radon-Nikodym derivative
Mathieu Hoyrup, Cristóbal Rojas, Klaus Weihrauch
2011· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Ramsey Results Involving the Fibonacci Numbers
Hayri Ardal, David S. Gunderson, Veselin Jungić, Bruce Landman, Kevin Williamson
2008· article· en· ˜The œFibonacci quarterly· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Future Prospects for Computer-Assisted Mathematics
David H. Bailey, Jonathan M. Borwein
2005· article· en· University of North Texas Digital Library (University of North Texas)· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
VTC: A Second-Order Theory for TC
Phuong Nguyen, Stephen Cook
2004· article· en· TSpace· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Encoding Arguments
Pat Morin, Wolfgang Mulzer, Tommy Reddad
2017· review· en· ACM Computing Surveys· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
How computation explains
Andrew Richmond
2024· article· en· Mind & Language· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
aboutno affunlabeled
Introduction
M. BARR, P. J. SCOTT, R. A. G. SEELY
2000· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
4
citations
affunlabeled
Introduction
Shai Shalev‐Shwartz, Shai Ben-David
2014· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
4
citations
affunlabeled
The settling-time reducibility ordering
Barbara F. Csima, Richard A. Shore
2007· article· en· Journal of Symbolic Logic· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Beyond the building blocks model
Eric Margolis, Stephen Laurence
2011· article· en· Behavioral and Brain Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
fundno affunlabeled
COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
Matthew Harrison‐Trainor, Alexander Melnikov, Russell Miller, Antonio Montalbán
2017· preprint· en· Journal of Symbolic Logic· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About