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 2 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
Ontic Pancomputationalism
Gualtiero Piccinini, Neal G. Anderson
2018· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Architectures for Arithmetic
Jamie I. D. Campbell, Lynette J. Epp
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
aboutno affunlabeled
Formal Functions in Perspective
2015· book· en· Boydell and Brewer eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
East-West paths to unconventional computing
Andrew Adamatzky, Selim G. Akl, Mark Burgin, Cristian S. Calude, José Félix Costa, Mohammad Mahdi Dehshibi +14 more
2017· review· en· Progress in Biophysics and Molecular Biology· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affunlabeled
Difference randomness
Johanna N. Y. Franklin, Keng Meng Ng
2010· article· en· Proceedings of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
The Minimum Oracle Circuit Size Problem
Eric Allender, Dhiraj Holden, Valentine Kabanets
2016· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
A probability perspective
Eric C. R. Hehner
2010· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
afffundunlabeled
Chain conditions in computable rings
Chris J. Conidis
2010· article· en· Transactions of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
Perfect Strategies for Non-Local Games
Martino Lupini, Laura Mančinska, Vern I. Paulsen, David E. Roberson, Simone Severini, Ivan G. Todorov +1 more
2020· article· en· Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
fundno affno abstractunlabeled
Independence in computable algebra
Matthew Harrison‐Trainor, Alexander Melnikov, Antonio Montalbán
2015· article· en· Journal of Algebra· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Computability of analog networks
John V. Tucker, J. I. Zucker
2006· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
On computability and disintegration
Nathanael Ackerman, Cameron E. Freer, Daniel M. Roy
2016· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
An Approach to Bounded Rationality
Eli Ben‐Sasson
2007· article· en· The MIT Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
venueno affunlabeled
Expansions in Complex Bases
Vilmos Komornik, Paola Loreti
2007· article· en· Canadian Mathematical Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
A minimal pair of 𝐾-degrees
Barbara F. Csima, Antonio Montalbán
2005· article· en· Proceedings of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Horizons of the Mind. A Tribute to Prakash Panangaden
Franck van Breugel, Elham Kashefi, Catuscia Palamidessi, Jan Rutten
2014· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
afffundunlabeled
INFORMATION DISTANCE AND ITS APPLICATIONS
Ming Li
2007· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Degree spectra and immunity properties
Barbara F. Csima, I. Sh. Kalimullin
2010· article· en· Mathematical logic quarterly· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Software Documents: Comparison and Measurement.
Tom Arbuckle, Adam Balaban, Dennis Peters, Mark Lawford
2007· article· en· Software Engineering and Knowledge Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
fundno affunlabeled
Sums of numbers with small partial quotients
S. Astels
2001· article· en· Proceedings of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
← previousnext →

How this was built: Screen · Findings · About