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 12 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
Other Types of Coding
2024· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Algorithmic Prefix Complexity
Ming Li, Paul Vitányi
2019· book-chapter· en· Texts in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Algorithms and Computation, 20th International ymposium, ISAAC
Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortíz
2009· article· en· International Symposium on Algorithms and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Central Submonads and Notions of Computation
Titouan Carette, Louis Lemonnier, Vladimir Zamdzhiev
2022· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Abelian Groups Are Easier
Robert J. MacG. Dawson
2024· article· en· The Mathematical Intelligencer· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundaboutno affunlabeled
Oral history interview with Stephen Cook
Stephen Cook
2002· article· en· University of Minnesota Digital Conservancy (University of Minnesota)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Some Elementary Informal Set Theory
George Tourlakis
2024· book-chapter· en· Synthesis lectures on mathematics and statistics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Arithmetic in $$\mathbb{Q}[\sqrt{D}]$$
Mak Trifković
2013· book-chapter· en· Universitext· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
A Taste of Computability Theory
R. D. Tennent
2002· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Complexity and similarity in visual memory
Benoît Brisson, Michel‐Pierre Coll, Sébastien Tremblay
2010· article· en· Journal of Vision· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Structure in Machine Learning
Prakash Panangaden
2023· book-chapter· en· Outstanding contributions to logic· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Real Number Mathematics
William M. Farmer
2023· book-chapter· en· Computer science foundations and applied logic· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Automatic sequences and a lgebraic series
Jean Berstel, Christophe Reutenauer
2010· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Open determinacy for class games
Victoria Gitman, Joel David Hamkins
2015· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Sets, Sequences, and Counting
Tom Jenkyns, Ben Stephenson
2012· book-chapter· en· Undergraduate topics in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
The PI Index of Gated Amalgam.
Jianxiu Hao
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
The N-Fixed Point Property In Posets.
S. Parameshwara Bhatta, Shiju George
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Metastability and Metastasis
Kane X. Faucher
2013· book-chapter· en· Educational futures· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Human Computation
2014· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Essential mathematics for machine learning
Ali Araghian, Mohsen Razzaghi, Maryam Soltani, Kourosh Parand
2025· book-chapter· en· Elsevier eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Human Computation
Reda Alhajj, Jon Rokne
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Red Mercury Price
2025· dataset· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Strong computable type
Djamel Eddine Amir, Mathieu Hoyrup
2023· preprint· en· Computability· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
10.1145/3772318.3809019
AI Generated
2000· article· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
venueno affno abstractunlabeled
10.1016/b978-0-08-093827-1.50007-7
2000· book-chapter· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
← previousnext →

How this was built: Screen · Findings · About