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
Electronic Notes in Theoretical Computer Science
Topic
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.

63 results · 1 filter active ·
Results by year
20002020
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.
63 works in the cohort · of 4,299,418page 1 of 2

Labels cover 0 of 63 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 63 of 63 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
Distributed Measurement-based Quantum Computation
Vincent Danos, Ellie D’Hondt, Elham Kashefi, Prakash Panangaden
2007· article· en· Electronic Notes in Theoretical Computer Science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
Algebra and Sequent Calculus for Epistemic Actions
Alexandru Baltag, Bob Coecke, Mehrnoosh Sadrzadeh
2005· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affunlabeled
A Practical Approach to Partial Functions in CVC Lite
Sergey Berezin, Clark Barrett, Igor Shikanian, Marsha Chećhik, Arie Gurfinkel, David L. Dill
2005· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
fundno affunlabeled
A Denotational Semantics for SPARC TSO
Ryan Kavanagh, Stephen Brookes
2018· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
aboutno affunlabeled
Probabilistic Guarded Commands Mechanized in HOL
Joe Hurd, Annabelle McIver, Carroll Morgan
2005· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
A New Method for Transforming Timed Automata
Ahmed Khoumsi, Lucien Ouédraogo
2005· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
A Semantics for Timed MSC
Tong Zheng, Ferhat Khendek, Loı̈c Hélouët
2002· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
ASF+SDF parsing tools applied to ELAN
Mark van den Brand, Christophe Ringeissen
2000· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Timed Sets, Functional Complexity, and Computability
Robin Cockett, Joaquín Díaz Boïls, Jonathan Gallagher, Pavel Hrubeš
2012· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Pauli Measurements are Universal
Vincent Danos, Elham Kashefi
2007· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
On Coloring a Class of Claw-free Graphs
Yingjun Dai, Angèle M. Foley, Chı́nh T. Hoàng
2019· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Programming with Quantum Communication
Anya Tafliovich, Eric C. R. Hehner
2009· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
aboutno affunlabeled
Non-deterministic Semantics in Polynomial Format
Walter Carnielli, Mariana Matulovic
2014· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Source Transformation for Concurrency Analysis
Timothy A. Cassidy, James R. Cordy, Thomas Dean, Juergen Dingel
2005· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Contraction of the ITCPN state space
Hanifa Boucheneb, G Berthelot
2002· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
A Technique for Verifying Measurements
Keye Martin, Prakash Panangaden
2008· article· en· Electronic Notes in Theoretical Computer Science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Type-Safe Code Transformations in Haskell
Louis-Julien Guillemette, Stefan Monnier
2007· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Unitary Theories, Unitary Categories
Pieter Hofstra, Robin Cockett
2010· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
aboutno affunlabeled
Preface
Andrea Corradini, Marina Lenisa, Ugo Montanari
2001· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Induction, Coinduction, and Adjoints
Robin Cockett, Luigi Santocanale
2003· article· en· Electronic Notes in Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
4
citations
aboutno affunlabeled
Preface
Andrzej Skowron, Marcin Szczuka
2003· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Bisimulation for Feller-Dynkin Processes
Linan Chen, Florence Clerc, Prakash Panangaden
2019· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Towards the Correctness of Security Protocols
Mourad Debbabi, Mohamed Mejri
2003· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Geodesic Paths Approach to Color Image Enhancement
M. Szczepański, Bogdan Smołka, Damian Ślusarczyk, Konstantinos N. Plataniotis, A.N. Venetsanopoulos
2001· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations

How this was built: Screen · Findings · About