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 3 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
Algorithmic Learning Theory
Sandra Zilles, Hans Ulrich Simon, Ronald Ortner
2016· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
afffundno abstractunlabeled
Descartes’ influence on Turing
Darren Abramson
2011· article· en· Studies in History and Philosophy of Science Part A· Computer Science
machine prediction:candidate · stsconsensus · none
13
citations
affunlabeled
Hilbert’s Tenth Problem in Coq
Dominique Larchey-Wendling, Yannick Forster
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Computability of Fraïssé limits
Barbara F. Csima, Valentina Harizanov, Russell Miller, Antonio Montalbán
2011· article· en· Journal of Symbolic Logic· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Computability of the Radon-Nikodym Derivative
Mathieu Hoyrup, Cristóbal Rojas, Klaus Weihrauch
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Equimorphy: the case of chains
C. Laflamme, M. Pouzet, R. Woodrow
2017· article· en· Archive for Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Timed Sets, Functional Complexity, and Computability
Robin Cockett, Joaquín Díaz Boïls, Jonathan Gallagher, Pavel Hrubeš
2012· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Lectures in Logic and Set Theory
George Tourlakis
2003· book· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Computational Complexity
Christopher Mole
2025· book-chapter· en· MIT Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
BALANCED SETS AND THE VECTOR GAME
Zhivko Nedev, Anthony Quas
2008· article· en· International Journal of Number Theory· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
venueno affunlabeled
Why Intermediality — if at all?
Hans Ulrich Gumbrecht
2011· article· en· Intermédialités Histoire et théorie des arts des lettres et des techniques· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Notes on Forcing Axioms
Stevo Todorčević, C. T. Chong, Q. Feng, Theodore A. Slaman, W. Hugh Woodin, Yue Yang
2013· book· en· Lecture notes series, Institute For Mathematical Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
The schematics of computation
Vincent S. Manis
2011· book· en· cIRcle (University of British Columbia)· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
venueno affunlabeled
Topos theoretic aspects of semigroup actions
Jonathon Funk, Pieter Hofstra
2010· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Algorithmic Randomness
2020· book· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
← previousnext →

How this was built: Screen · Findings · About