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
Topic
AI-based Problem Solving and Planning
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.

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

Labels cover 1 of 618 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 618 of 618 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
Prefacr
Lorenzo Magnani, Nancy J. Nersessian, Paul Thagard
2000· article· en· Foundations of Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Multiagent Systems
David Poole, Alan K. Mackworth
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Planning with Uncertainty
David Poole, Alan K. Mackworth
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Avoiding Re-Expansions in Suboptimal Best-First Search
Jingwei Chen, Nathan Sturtevant
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Uncertain reasoning at FLAIRS
Christoph Beierle, Cory J. Butz, Souhila Kaci
2015· article· en· Journal of Applied Logic· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Individuals and Relations
David Poole, Alan K. Mackworth
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Individuals and Relations
David Poole, Alan K. Mackworth
2010· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Planning with Certainty
David Poole, Alan K. Mackworth
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Agent Architectures and Hierarchical Control
David Poole, Alan K. Mackworth
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Reasoning with Uncertainty
David Poole, Alan K. Mackworth
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Preface
2020· article· en· Journal of Physics Conference Series· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Core GRADE for evidence syntheses
Tobias Braun
2025· article· de· physioscience· Computer Science
machine prediction:candidate · metaresearchconsensus · none
0
citations
affno abstractunlabeled
Uncertain Search with Knowledge Transfer
Woonghee Tim Huh, Michael Jong Kim, Mei-Chun Lin
2023· article· en· SSRN Electronic Journal· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
A computational framework for package planning
Michael Janzen
2006· article· en· International Journal of Knowledge-based and Intelligent Engineering Systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Abstracting situation calculus action theories
Bita Banihashemi, Giuseppe De Giacomo, Yves Lespérance
2025· article· en· Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Planning with Non-deterministic Actions in Jason
Josh Blondin, Babak Esfandiari
2024· book-chapter· en· Communications in computer and information science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Reports of the AAAI 2011 Conference Workshops
Noa Agmon, Vikas Agrawal, David W. Aha, Yiannis Aloimonos, Donagh Buckley, Prashant Doshi +27 more
2012· article· en· AI Magazine· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Searching for Solutions
David Poole, Alan K. Mackworth
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Introduction to MPI
Raymond J. Spiteri, Kyle Klenk
2025· book-chapter· en· CMS/CAIMS books in mathematics· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Learning with Uncertainty
David Poole, Alan K. Mackworth
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Retrospect and Prospect
David Poole, Alan K. Mackworth
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Generalizing and Executing Plans
Christian Muise
2021· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affgemma · no categorygpt · no categorymodels split
A library for constraint consistent learning
Jeevan Manavalan, Yuchen Zhao, Prabhakar Ray, Hsiu-Chin Lin, Matthew Howard
2020· article· en· Advanced Robotics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Mathematical Preliminaries and Notation
David Poole, Alan K. Mackworth
2017· other· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Propositions and Inference
David Poole, Alan K. Mackworth
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/s0029-7437(05)71328-8
2000· article· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Reasoning with Constraints
David Poole, Alan K. Mackworth
2017· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About