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
Topic
Bayesian Modeling and Causal Inference
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.

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

Labels cover 2 of 961 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 961 of 961 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
Finding MAPs Using High Order Recurrent Networks
Emad A.M. Andrews, Anthony J. Bonner
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Prediction-Directed Compression of POMDPs
Abdeslam Boularias, Masoumeh Izadi, Brahim Chaib-draa
2008· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Causal Deep Q Networks
Elouanes Khelifi, Amir Saki, Usef Faghihi
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On the Construction of Trust Metrics
Jonathan Barzilai
2013· article· en· National Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Plausible Environment Reconstruction Using Bayesian Networks
Robert G. Price, Scott D. Goodwin
2006· article· en· Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affaboutunlabeled
Re
Michael A. McIsaac
2017· letter· war· Epidemiology· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
1
citations
affunlabeled
Fast Learning of Relational Dependency Networks
Oliver Schulte, Zhensong Qian, Arthur E. Kirkpatrick, Xiaoqian Yin, Yan V. Sun
2014· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Quasi deterministic POMDPs and DecPOMDPs
Camille Besse, Brahim Chaib-draa
2010· article· en· Adaptive Agents and Multi-Agents Systems· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Representation Discovery for MDPs Using Bisimulation Metrics
Sherry Ruan, Gheorghe Comanici, Prakash Panangaden, Doina Precup
2015· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Statistical Relational Learning
2014· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Junction Tree Representation
Yang Xiang
2002· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Subjectivity Detection
Reda Alhajj, Jon Rokne
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Probabilistic Logic Learning
Reda Alhajj, Jon Rokne
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Differentiable Algorithm for Marginalising Changepoints
Hyoung-Jin Lim, Gwonsoo Che, Wonyeol Lee, Hongseok Yang
2020· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Justifying Models
Macartan Humphreys, Alan M. Jacobs
2023· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Dependence Relation and Removable Classes
Cláudio L. Lucchesi, U. S. R. Murty
2024· book-chapter· en· Algorithms and computation in mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About