MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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

fundno affunlabeled
The Tractable Cognition Thesis
Iris van Rooij
2008· article· en· Cognitive Science· Computer Science
machine prediction:candidate · noneconsensus · none
297
citations
venueno affunlabeled
Can GPT-3 Pass a Writer’s Turing Test?
Katherine Elkins, Jon Chun
2020· article· en· Journal of Cultural Analytics· Computer Science
machine prediction:candidate · noneconsensus · none
205
citations
affunlabeled
Scale-free geometry in OO programs
Alex Potanin, James Noble, Marcus Frean, Robert Biddle
2005· article· en· Communications of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
198
citations
fundno affunlabeled
MIP* = RE
Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John C. Wright, Henry Yuen
2021· article· en· Communications of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
167
citations
affunlabeled
Artificial Intelligence Review
Amal Kilani, Ahmed Ben Hamida, Habib Hamam
2017· book-chapter· en· IGI Global eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
137
citations
affno abstractunlabeled
On the similarity metric and the distance metric
Shihyen Chen, Bin Ma, Kaizhong Zhang
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
126
citations
affno abstractunlabeled
Bayes' theorem
Jorge López Puga, Martin Krzywinski, Naomi Altman
2015· article· en· Nature Methods· Computer Science
machine prediction:candidate · noneconsensus · none
113
citations
affunlabeled
The strength of weak integrated information theory
Pedro A. M. Mediano, Fernando E. Rosas, Daniel Bor, Anil K. Seth, Adam B. Barrett
2022· review· en· Trends in Cognitive Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
107
citations
affunlabeled
Experimental Determination of Ramsey Numbers
Zhengbing Bian, Fabián A. Chudak, William G. Macready, Lane Clark, Frank Gaitan
2013· article· en· Physical Review Letters· Computer Science
machine prediction:candidate · noneconsensus · none
100
citations
affunlabeled
The similarity metric
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul Vitányi
2003· article· en· UvA-DARE (University of Amsterdam)· Computer Science
machine prediction:candidate · noneconsensus · none
98
citations
afffundunlabeled
Non-computable Julia sets
Mark Braverman, Michael Yampolsky
2005· article· en· Journal of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
97
citations
affno abstractunlabeled
Factorization Machines
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
71
citations
afffundunlabeled
Complexity Theory for Operators in Analysis
Akitoshi Kawamura, Stephen Cook
2012· article· en· ACM Transactions on Computation Theory· Computer Science
machine prediction:candidate · noneconsensus · none
60
citations
affunlabeled
Skill set analysis in knowledge structures
Günther Gediga, Ivo Düntsch
2002· article· en· British Journal of Mathematical and Statistical Psychology· Computer Science
machine prediction:candidate · noneconsensus · none
58
citations
afffundunlabeled
Computability of Julia Sets
Mark Braverman, Michael Yampolsky
2008· article· en· Moscow Mathematical Journal· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
affno abstractunlabeled
Mathematics in Computer Science
Dardo Goyeneche, Ilias Kotsireas, Padraig Ó Catháin
2013· paratext· en· Mathematics in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
54
citations
afffundunlabeled
Reclaiming AI as a Theoretical Tool for Cognitive Science
Iris van Rooij, Olivia Guest, Federico Adolfi, Ronald de Haan, Antonina Kolokolova, Patricia Rich
2024· article· en· Computational Brain & Behavior· Computer Science
machine prediction:candidate · noneconsensus · none
54
citations
fundno affno abstractunlabeled
Applying MDL to learn best model granularity
Qiong Gao, Ming Li, Paul Vitányi
2000· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
afffundunlabeled
A synchronous game for binary constraint systems
Se-Jin Kim, Vern I. Paulsen, Christopher Schafhauser
2018· article· en· Journal of Mathematical Physics· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Descriptional Complexity of Formal Systems
Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Introduction to Turing categories
J.R.B. Cockett, Pieter Hofstra
2008· article· en· Annals of Pure and Applied Logic· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
Is complexity a source of incompleteness?
Cristian S. Calude, Helmut Jürgensen
2005· article· en· Advances in Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affunlabeled
Reflective Artificial Intelligence
Peter R. Lewis, Ştefan Sarkadi
2024· article· en· Minds and Machines· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affunlabeled
All realizability is relative
Pieter Hofstra
2006· article· en· Mathematical Proceedings of the Cambridge Philosophical Society· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affunlabeled
The strength of the rainbow Ramsey Theorem
Barbara F. Csima, Joseph R. Mileti
2009· article· en· Journal of Symbolic Logic· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affunlabeled
The Complexity of Forecast Testing
Lance Fortnow, Rakesh Vohra
2008· article· en· Econometrica· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
afffundunlabeled
Designing ecosystems of intelligence from first principles
Karl Friston, Maxwell JD Ramstead, Alex Kiefer, Alexander Tschantz, Christopher L. Buckley, Mahault Albarracin +14 more
2024· article· en· Collective Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affunlabeled
Deterministic Complexity and Entropy
M.R. Titchener, Radu Nicolescu, Ludwig Staiger, Aaron Gulliver, Ulrich Speidel
2004· article· en· ResearchSpace (University of Auckland)· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
next →

How this was built: Screen · Findings · About