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
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 8 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

venueno affno abstractunlabeled
On Infinite Kuratowski Theorems.
2004· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundunlabeled
Entropy-efficient finitary codings
2024· article· fr· Journal of Modern Dynamics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Non-computable Julia sets
2004· preprint· en· ArXiv.org· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+insufficient_payloadconsensus · none
1
citations
affunlabeled
Toward a Model of Models: Part II
2005· book-chapter· en· Kluwer Academic Publishers eBooks· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+research_integrityconsensus · research_integrity
1
citations
aboutno affunlabeled
ACM Turing Award Lecture at SC22
2022· article· en· ACM SIGHPC Connect· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+insufficient_payloadconsensus · open_science
1
citations
affunlabeled
Set Theory
2023· article· en· Oberwolfach Reports· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Mathematics in Computer Science: After 10 Years
2017· article· en· Mathematics in Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_scienceconsensus · open_science
1
citations
affno abstractunlabeled
Generative AI
2025· book-chapter· en· Synthesis lectures on games and computational intelligence· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Preliminaries
2008· book-chapter· en· Texts in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
1
citations
affno abstractunlabeled
Algorithmic Prefix Complexity
2008· book-chapter· en· Texts in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · none
1
citations
affno abstractunlabeled
Algorithmic Complexity
2008· book-chapter· en· Texts in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · none
1
citations
affno abstractunlabeled
Resource-Bounded Complexity
2008· book-chapter· en· Texts in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · none
1
citations
affno abstractunlabeled
Relatively computably enumerable reals
2010· article· en· Archive for Mathematical Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Essays on Coding Theory
2024· book· en· Cambridge University Press eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Persistence $K$-theory
2024· article· en· Quantum Topology· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
1
citations
affunlabeled
Communication Can Destroy Common Learning
2008· preprint· en· RePEc: Research Papers in Economics· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+research_integrityconsensus · none
1
citations
affaboutunlabeled
A computational journey in the true north
2019· article· en· International Journal of Parallel Emergent and Distributed Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
From Automatism to Autonomy
2023· article· en· Conversations The Journal of Cavellian Studies· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Emergent AI Minds: A Phenomenological Study
2025· preprint· en· SSRN Electronic Journal· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+research_integrityconsensus · none
1
citations
affno abstractunlabeled
A Note on Tractability and Artificial Intelligence
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
affunlabeled
Random gaps
2008· article· en· Transactions of the American Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About