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
Proceedings of the AAAI Conference on 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.

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

Labels cover 0 of 1,046 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 1,046 of 1,046 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
Random Forests for Opponent Hand Estimation in Gin Rummy
Anthony Hein, May Jiang, Vydhourie Thiyageswaran, Michael Guerzhoy
2021· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Top-Down Deep Clustering with Multi-Generator GANs
Daniel de Mello, Renato Assunção, Fabrício Murai
2022· preprint· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
TDS+: Improving Temperature Discovery Search
Yeqin Zhang, Martin Müller
2015· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Efficient Temporal Planning Using Metastates
Andrew Coles, J. Christopher Beck
2019· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
From Actions to Programs as Abstract Actual Causes
Bita Banihashemi, Shakil M. Khan, Mikhail Soutchanski
2022· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Robust Training for AC-OPF (Student Abstract)
Fuat Can Beylunioğlu, Mehrdad Pirnia, P. Robert Duimering, Vijay Ganesh
2023· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Augmentation-Free Self-Supervised Learning on Graphs
Namkyeong Lee, Junseok Lee, Chanyoung Park
2022· preprint· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Rectangle Search: An Anytime Beam Search
Sofia Lemons, Wheeler Ruml, Rob Holte, Carlos Linares López
2024· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Auditable Algorithms for Approximate Model Counting
Kuldeep S. Meel, Supratik Chakraborty, S. Akshay
2024· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Delegation-Relegation for Boolean Matrix Factorization
Florent Avellaneda, Roger Villemaire
2024· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Reasoning About Actual Causes in Nondeterministic Domains
Shakil M. Khan, Yves Lespérance, Maryam Rostamigiv
2025· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Causally Consistent Normalizing Flow
Quan Zhou, Kangjie Lu, Meng Xu
2025· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Conference Committees
Carol M. Hamilton
2013· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Economics, Econometrics and Finance
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Bivariate Beta-LSTM
Kyungwoo Song, JoonHo Jang, Seung Jae Shin, Il‐Chul Moon
2020· preprint· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Model AI Assignments 2013
Todd W. Neller
2013· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations

How this was built: Screen · Findings · About