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
Logical Methods 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.

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

Labels cover 0 of 55 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 55 of 55 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
General Recursion via Coinductive Types
Venanzio Capretta
2005· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
140
citations
afffundunlabeled
Logics for Unranked Trees: An Overview
Leonid Libkin
2006· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
67
citations
affunlabeled
Formal Theories for Linear Algebra
Stephen Cook, Lila Fontes
2012· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
afffundunlabeled
A finer reduction of constraint problems to digraphs
Jakub Bulín, Dejan Delić, Marcel Jackson, Todd Niven
2015· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundunlabeled
On tractability and congruence distributivity
Emil W. Kiss, Matthew Valeriote
2007· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Completeness of the ZX-Calculus
Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart
2020· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
Abstract Model Repair
George Chatzieleftheriou, Borzoo Bonakdarpour, Panagiotis Katsaros, Scott A. Smolka
2015· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundunlabeled
Inferring Symbolic Automata
Dana Fisman, Hadar Frenkel, Sandra Zilles
2023· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Decidability for Sturmian words
Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey Shallit
2024· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundunlabeled
Formalizing Randomized Matching Algorithms
Dai Le, Stephen Cook
2012· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
fundno affunlabeled
Algebraic Notions of Termination
2011· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
LNL-FPC: The Linear/Non-linear Fixpoint Calculus
Bert Lindenhovius, Michael Mislove, Vladimir Zamdzhiev
2021· preprint· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Width and size of regular resolution proofs
Alasdair Urquhart
2012· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
fundno affunlabeled
Well Behaved Transition Systems
Michael Blondin, Alain Finkel, Pierre McKenzie
2017· preprint· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Semipullbacks of labelled Markov processes
Jan Pachl, Pedro Sánchez Terraf
2021· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Free complete Wasserstein algebras
Radu Mardare, Prakash Panangaden, Gordon Plotkin
2018· article· en· Logical Methods in Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
2-adjoint equivalences in homotopy type theory
Daniel Carranza, Jonathan Chang, Chris Kapulkin, Ryan Sandford
2021· preprint· en· Logical Methods in Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
A Denotational Semantics for SPARC TSO
Ryan Kavanagh, Stephen Brookes
2019· preprint· en· Logical Methods in Computer Science· Computer Science
machine 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
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Approximating Queries on Probabilistic Graphs
Antoine Amarilli, Timothy van Bremen, Octave Gaspard, Kuldeep S. Meel
2025· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
next →

How this was built: Screen · Findings · About