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

afffundunlabeled
Message-Observing Sessions
Ryan Kavanagh, Brigitte Pientka
2024· article· en· Proceedings of the ACM on Programming Languages· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Lifting lower bounds for tree-like proofs
Alexis Maciel, Phuong Nguyen, Toniann Pitassi
2013· article· en· Computational Complexity· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
HOL Light QE
Jacques Carette, William M. Farmer, Patrick Laskowski
2018· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
1
citations
affno abstractunlabeled
Extensional Higher-Order Logic Programming
Angelos Charalambidis, Konstantinos Handjopoulos, Panos Rondogiannis, William W. Wadge
2010· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
affunlabeled
Mutable WadlerFest DOT
Marianna Rapoport, Ondřej Lhoták
2016· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
1
citations
affunlabeled
Semi-Automation of Meta-Theoretic Proofs in Beluga
Johanna Schwartzentruber, Brigitte Pientka
2023· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
aboutno affunlabeled
The ICFP developer conference 2008
James Hook, Michael Sperber
2008· article· en· ACM SIGPLAN Notices· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
CORBA views: distributing objects with views
Hafedh Mili, Hamid Mcheick, Jamal Ahmad Dargham, Salah Sadou
2002· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Structures et modèles de calculs de réécriture
Germain Faure
2007· dissertation· fr· Publications Et Travaux Academiques de Lorraine (Universite de Lorraine)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+research_integrityconsensus · research_integrity
1
citations
affunlabeled
Toward Solving Equations in Kleene Algebras
François Lajeunesse-Robert, Béchir Ktari
2007· article· en· New Trends in Software Methodologies, Tools and Techniques· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Follow-Up on the Theory of Ether.
Thierry Delort
2007· article· en· Physics Essays· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Sum and Tensor of Quantitative Effects
Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon Plotkin
2024· article· en· Logical Methods in Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
A simple soundness proof for dependent object types
Marianna Rapoport, Ifaz Kabir, Paul He, Ondřej Lhoták
2017· preprint· en· Proceedings of the ACM on Programming Languages· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
1
citations
fundno affunlabeled
REST: Integrating Term Rewriting with Program Verification
Zachary Grannan, Niki Vazou, Eva Darulová, Alexander J. Summers
2022· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
affno abstractunlabeled
Liveness Properties
Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci +2 more
2001· book-chapter· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
1
citations
affunlabeled
Multi-polymorphic programming in bondi
Thomas Given-Wilson, F. Y. Huang, Barry Jay
2013· article· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
1
citations

How this was built: Screen · Findings · About