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
Journal of Mathematical 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.

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

Labels cover 0 of 18 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 18 of 18 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
A DICHOTOMY FOR THE NUMBER OF ULTRAPOWERS
Ilijas Farah, Saharon Shelah
2010· article· en· Journal of Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
54
citations
affunlabeled
SHEAF COHOMOLOGY IN o-MINIMAL STRUCTURES
Mário J. Edmundo, G. O. Jones, Nicholas J. Peatfield
2006· article· en· Journal of Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
29
citations
fundno affunlabeled
BOUNDING BY CANONICAL FUNCTIONS, WITH CH
Paul Larson, Saharon Shelah
2003· article· en· Journal of Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
The degree of nonminimality is at most 2
James Freitag, Rémi Jaoui, Rahim Moosa
2022· article· en· Journal of Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Decomposing Aronszajn lines
Keegan Dasilva Barbosa
2022· article· en· Journal of Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Enriching a predicate and tame expansions of the integers
Gabriel Conant, Christian d’Elbée, Yatir Halevi, Léo Jimenez, Silvain Rideau-Kikuchi
2023· article· en· Journal of Mathematical Logic· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Higher dimensional chain conditions
Stevo Todorčević, Jing Zhang
2024· article· en· Journal of Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Degrees of categoricity and treeable degrees
Barbara F. Csima, Dino Rossegger
2023· article· en· Journal of Mathematical Logic· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About