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
Annals of Mathematics and Artificial Intelligence
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.

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

Labels cover 0 of 44 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 44 of 44 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.

affno abstractunlabeled
Multi-robot collaboration for robust exploration
Ioannis Rekleitis, Gregory Dudek, Evangelos Milios
2001· article· en· Annals of Mathematics and Artificial Intelligence· Engineering
machine prediction:candidate · noneconsensus · none
162
citations
affno abstractunlabeled
Relational concept discovery in structured datasets
Marianne Huchard, Mohamed Rouane Hacene, Clément Roume, Petko Valtchev
2007· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
86
citations
affno abstractunlabeled
A description logic based situation calculus
Yilan Gu, Mikhail Soutchanski
2010· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Regular path queries under approximate semantics
Gösta Grahne, Alex Thomo
2006· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Database Repairs and Analytic Tableaux
Leopoldo Bertossi, Camilla Schwind
2003· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Generalized pattern extraction from concept lattices
Léonard Kwuida, Rokia Missaoui, Abdélilah Balamane, Jean Vaillancourt
2014· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Introduction
Jürgen Dix, Michael Fisher, Hector J. Levesque, Leon S. Sterling
2004· article· en· Annals of Mathematics and Artificial Intelligence
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
6
citations
afffundno abstractunlabeled
On the algebra of regular sets
Michael Winter, Torsten Hahmann, Michael Grüninger
2012· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Weight constraint programs with evaluable functions
Yisong Wang, Jia-Huai You, Fangzhen Lin, Li Yan Yuan, Mingyi Zhang
2010· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
A model for learning the news in social networks
Krishnan Rajagopalan, Venkatesh Srinivasan, Alex Thomo
2013· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Learning tractable NAT-modeled Bayesian networks
Yang Xiang, Qian Wang
2021· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Multi-resolution continuous normalizing flows
Vikram Voleti, Christopher C. Finlay, Adam M. Oberman, Christopher Pal
2024· article· en· Annals of Mathematics and Artificial Intelligence· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Filters-based revision
Maria Andrikopoulou, Theofanis Aravanis, James P. Delgrande, Panagis Karazeris, Pavlos Peppas
2025· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About