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
Author
Year range
Sort
Language
Type
Field
Venue
Topic
Logic, programming, and type systems
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.

928 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.
928 works in the cohort · of 4,299,418page 18 of 19

Labels cover 1 of 928 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 928 of 928 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
A Base Logic
Dav M. Gabbay, John Woods
2005· book-chapter· en· ˜A œpractical logic of cognitive systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Scratch-Style Relational Algebra and Calculus
Levi Meston, Jalal Kawash
2021· article· en· 2021 International Conference on Computational Science and Computational Intelligence (CSCI)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Decorated corelations
Brendan Fong
2018· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Proofs and countermodels in BI's pointer logic
Didier Galmiche, Julien Gobillot, Daniel Méry
2004· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Certified Compilers à la Carte
Oghenevwogaga Ebresafe, Ian Zhao, Ende Jin, Charles Jian, Yizhou Zhang
2025· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A Pattern Language For Parsing
Yun Mai, Michel de Champlain
2003· book-chapter· en· Kluwer international series in engineering and computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
A Note on Principia’s *38 on Operations
Gregory Landini
2021· article· en· Russell the Journal of Bertrand Russell Studies· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/s0024-7804(97)81480-7
2000· article· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Towards Specifying Symbolic Computation
Jacques Carette, William M. Farmer
2019· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Contextual Refinement Types
Antoine Gaulin, Brigitte Pientka
2023· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Equivalence Checking Benchmark
2021· article· en· OSF Preprints (OSF Preprints)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The poor man's proof assistant
Joseph Eremondi
2013· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Editorial
Daniel Kroening, Tiziana Margaria, Jim Woodcock
2011· editorial· es· Formal Aspects of Computing· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Basic Java programming constructs
David Yevick
2012· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About