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
Annals of Pure and Applied 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.

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

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

fundno affno abstractunlabeled
Around definable types in p-adically closed fields
Pablo Andújar Guerrero, Will Johnson
2024· article· en· Annals of Pure and Applied Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Measuring complexities of classes of structures
Barbara F. Csima, Carolyn Knoll
2015· article· en· Annals of Pure and Applied Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Can you take Komjath's inaccessible away?
Hossein Lamei Ramandi, Stevo Todorčević
2024· article· en· Annals of Pure and Applied Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Definable principal congruences and solvability
Paweł M. Idziak, Keith A. Kearnes, Emil W. Kiss, Matthew Valeriote
2008· article· en· Annals of Pure and Applied Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
New-from-old full dualities via axiomatisation
Brian Davey, Jane G. Pitkethly, Ross Willard
2018· preprint· en· Annals of Pure and Applied Logic· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
fundno affno abstractunlabeled
Construction schemes: Transferring structures from ω to ω1
Jorge Antonio Cruz Chapital, Osvaldo Guzmán González, Stevo Todorčević
2025· article· en· Annals of Pure and Applied Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Bi-colored expansions of geometric theories
Saeed Jalili, Massoud Pourmahdian, Mohsen Khani
2024· article· en· Annals of Pure and Applied Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Some variations on the splitting number
Saharon Shelah, Juris Steprāns
2023· article· en· Annals of Pure and Applied Logic· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Preface
Carsten Butz
2000· article· en· Annals of Pure and Applied Logic
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
← previous

How this was built: Screen · Findings · About