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
Mathematical Structures in 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.

72 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.
72 works in the cohort · of 4,299,418page 1 of 2

Labels cover 0 of 72 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 72 of 72 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
Towards a quantum programming language
Peter Selinger
2004· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
496
citations
affunlabeled
Quantum weakest preconditions
Ellie D’Hondt, Prakash Panangaden
2006· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
156
citations
afffundunlabeled
Differential categories
Richard Blute, J.R.B. Cockett, R. A. G. Seely
2006· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
93
citations
affunlabeled
Modelling general recursion in type theory
Ana Bove, Venanzio Capretta
2005· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
85
citations
affunlabeled
Free compact 2-categories
Anne Preller, Joachim Lambek
2007· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
67
citations
affunlabeled
Introduction to linear bicategories
J.R.B. Cockett, Jürgen Koslowski, R. A. G. Seely
2000· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affunlabeled
Quantifying opacity
Béatrice Bérard, John Mullins, Mathieu Sassolas
2014· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affunlabeled
Lenses, fibrations and universal translations
Michael Johnson, Robert Rosebrugh, Richard J. Wood
2011· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affunlabeled
Spatiality for formal topologies
Nicola Gambino, Peter Schuster
2007· article· en· Mathematical Structures in Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
38
citations
affunlabeled
Modelling session types using contracts
Giovanni Bernardi, Matthew Hennessy
2014· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
afffundunlabeled
Integral categories and calculus categories
J.R.B. Cockett, Jean-Simon Pacaud Lemay
2018· article· en· Mathematical Structures in Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Boolean and classical restriction categories
Robin Cockett, Ernie Manes
2009· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
On computability and disintegration
Nathanael Ackerman, Cameron E. Freer, Daniel M. Roy
2016· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Towards a typed Geometry of Interaction
Esfandiar Haghverdi, Philip Scott
2010· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
A relational model of non-deterministic dataflow
Thomas Hildebrandt, Prakash Panangaden, Glynn Winskel
2004· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
Cartesian differential categories revisited
G. S. H. Cruttwell
2015· article· en· Mathematical Structures in Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
The logic of linear functors
Richard Blute, J.R.B. Cockett, R. A. G. Seely
2002· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Fast circular dictionary-matching algorithm
Tanver Athar, Carl Barton, Widmer Bland, Jia Gao, Costas S. Iliopoulos, Chang Liu +1 more
2015· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Minimisation and minimal realisation in Span(Graph)
Robert Rosebrugh, N. Sabadini, R. F. C. Walters
2004· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
The monoidal structure of Turing machines
Miklós Bartha
2013· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
aboutno affunlabeled
Introduction
M. BARR, P. J. SCOTT, R. A. G. SEELY
2000· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
4
citations
afffundunlabeled
Monoidal reverse differential categories
G. S. H. Cruttwell, Jonathan Gallagher, Jean-Simon Pacaud Lemay, Dorette Pronk
2022· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
next →

How this was built: Screen · Findings · About