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
Journal of Symbolic Logic
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.

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

Labels cover 0 of 102 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 102 of 102 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
The strength of the rainbow Ramsey Theorem
Barbara F. Csima, Joseph R. Mileti
2009· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
37
citations
affunlabeled
Generic complexity of undecidable problems
Alexei Myasnikov, Alexander Rybalov
2008· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
36
citations
afffundunlabeled
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
Nikolay Bazhenov, Matthew Harrison‐Trainor, I. Sh. Kalimullin, Alexander Melnikov, Keng Meng Ng
2019· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
28
citations
affunlabeled
A new “feasible” arithmetic
Stephen J. Bellantoni, Martin Hofmann
2002· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
The complexity of resolution refinements
Joshua Buresh-Oppenheim, Toniann Pitassi
2007· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
18
citations
affunlabeled
FRAÏSSÉ LIMITS OF C*-ALGEBRAS
Christopher J. Eagle, Ilijas Farah, Bradd Hart, Borys Kadets, VLADYSLAV KALASHNYK, Martino Lupini
2016· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Definability in low simple theories
Ziv Shami
2000· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
18
citations
affunlabeled
SEMILATTICES AND THE RAMSEY PROPERTY
Miodrag Sokić
2015· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Computability of Fraïssé limits
Barbara F. Csima, Valentina Harizanov, Russell Miller, Antonio Montalbán
2011· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
A uniqueness theorem for iterations
Paul Larson
2002· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Weakly one-based geometric theories
Alexander Berenstein, Evgueni Vassiliev
2012· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Lexicographic exponentiation of chains
W. Charles Holland, Salma Kuhlmann, Stephen H. McCleary
2005· article· en· Journal of Symbolic Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
ALGEBRAIC GEOMETRY FOR MV-ALGEBRAS
L. P. Belluce, Antonio Di Nola, Giacomo Lenzi
2014· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Bounding homogenous models
Barbara F. Csima, Valentina Harizanov, Denis R. Hirschfeldt, Robert I. Soare
2007· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Schnorr triviality and genericity
Johanna N. Y. Franklin
2010· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Quantifier elimination in valued Ore modules
Luc Bélair, Françoise Point
2010· article· en· Journal of Symbolic Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
next →

How this was built: Screen · Findings · About