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 2 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

afffundunlabeled
asprin: Customizing Answer Set Preferences without a Headache
Gerhard Brewka, James P. Delgrande, Javier Romero, Torsten Schaub
2015· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
98
citations
afffundunlabeled
Visual Relationship Detection With Deep Structural Ranking
Kongming Liang, Yuhong Guo, Hong Chang, Xilin Chen
2018· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
96
citations
afffundunlabeled
TIMERS: Error-Bounded SVD Restart on Dynamic Networks
Ziwei Zhang, Peng Cui, Jian Pei, Xiao Wang, Wenwu Zhu
2018· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
93
citations
afffundunlabeled
Planning Over Multi-Agent Epistemic States: A Classical Planning Approach
Christian Muise, Vaishak Belle, Paolo Felli, Sheila A. McIlraith, Tim Miller, Adrian R. Pearce +1 more
2015· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
89
citations
afffundunlabeled
Learning Cross-Modal Context Graph for Visual Grounding
Yongfei Liu, Bo Wan, Xiaodan Zhu, Xuming He
2020· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
84
citations
afffundunlabeled
Preferred Explanations: Theory and Generation via Planning
Shirin Sohrabi, Jorge A. Baier, Sheila A. McIlraith
2011· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
83
citations
affunlabeled
Diversity Transfer Network for Few-Shot Learning
Mengting Chen, Yuxin Fang, Xinggang Wang, Heng Luo, Yifeng Geng, Xinyu Zhang +3 more
2020· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
75
citations
affunlabeled
Complexity of and Algorithms for Borda Manipulation
Jessica Davies, George Katsirelos, Nina Narodytska, Toby Walsh
2011· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Economics, Econometrics and Finance
distilled prediction:candidate · noneconsensus · none
74
citations
affunlabeled
Low-Rank Linear Cold-Start Recommendation from Social Data
Suvash Sedhain, Aditya Krishna Menon, Scott Sanner, Lexing Xie, Darius Braziunas
2017· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
72
citations
fundno affunlabeled
Adaptive Polling for Information Aggregation
Thomas Pfeiffer, Xi Alice Gao, Yiling Chen, Andrew Mao, David G. Rand
2021· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
68
citations
afffundunlabeled
Solving Imperfect Information Games Using Decomposition
Neil Burch, Michael Johanson, Michael Bowling
2014· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
68
citations
affunlabeled
Patch-Wise Attention Network for Monocular Depth Estimation
Sihaeng Lee, Janghyeon Lee, Byungju Kim, Eojindl Yi, Junmo Kim
2021· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
66
citations
affunlabeled
Learning Structured Embeddings of Knowledge Bases
Antoine Bordes, Jason Weston, Ronan Collobert, Yoshua Bengio
2011· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
66
citations
affunlabeled
Crowdsensing Air Quality with Camera-Enabled Mobile Devices
Zhengxiang Pan, Han Yu, Chunyan Miao, Cyril Leung
2017· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
66
citations
afffundunlabeled
Finding Optimal Abstract Strategies in Extensive-Form Games
Michael Johanson, Nolan Bard, Neil Burch, Michael Bowling
2021· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
65
citations
affunlabeled
Partial-Expansion A* with Selective Node Generation
Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan Sturtevant +2 more
2021· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
63
citations
affunlabeled
Efficient Model-Driven Network for Shadow Removal
Yurui Zhu, Zeyu Xiao, Yanchi Fang, Xueyang Fu, Zhiwei Xiong, Zheng-Jun Zha
2022· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
58
citations
affunlabeled
Efficient Inference of Optimal Decision Trees
Florent Avellaneda
2020· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
53
citations
afffundunlabeled
Contextualized Non-Local Neural Networks for Sequence Learning
Pengfei Liu, Shuaichen Chang, Xuanjing Huang, Jian Tang, Jackie Chi Kit Cheung
2019· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
53
citations
aboutno affunlabeled
High-Quality Policies for the Canadian Traveler's Problem
Patrick Eyerich, Thomas Keller, Malte Helmert
2010· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Decision Sciences
distilled prediction:candidate · noneconsensus · none
51
citations
afffundunlabeled
Partial Label Learning with Batch Label Correction
Yan Yan, Yuhong Guo
2020· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
50
citations

How this was built: Screen · Findings · About