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
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 3 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.

affunlabeled
A* search with inconsistent heuristics
Zhifu Zhang, Nathan Sturtevant, Robert C. Holte, Jonathan Schaeffer, Ariel Felner
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Partial Pattern Databases
K O Anderson, Robert C. Holte, Jonathan Schaeffer
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
afffundno abstractunlabeled
Case learning for CBR-based collision avoidance systems
Yuhong Liu, Chunsheng Yang, Yu-Bin Yang, Fuhua Lin, Xuanmin Du, Takayuki Itō
2010· article· en· Applied Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
The 2023 International Planning Competition
Ayal Taitler, Ron Alford, Joan Espasa, Gregor Behnke, Daniel Fišer, Michael Gimelfarb +6 more
2024· article· en· AI Magazine· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affunlabeled
Multiple agents moving target search
Mark Goldenberg, Alexander Kovarsky, Xiao‐Meng Wu, Jonathan Schaeffer
2003· article· en· International Joint Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
Non-Deterministic Planning With Conditional Effects
Christian Muise, Sheila A. McIlraith, Vaishak Belle
2014· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
Planning Via Random Walk-Driven Local Search
Fan Xie, Hootan Nakhost, Martin Müller
2012· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Exhaustive and Semi-Exhaustive Procedural Content Generation
Nathan Sturtevant, Matheus J. Ota
2018· article· en· Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Enriching Non-Parametric Bidirectional Search Algorithms
Shahaf Shperberg, Ariel Felner, Nathan Sturtevant, Solomon Eyal Shimony, Avi Hayoun
2019· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
On Planning with Preferences in HTN
Shirin Sohrabi, Sheila A. McIlraith
2009· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
afffundunlabeled
Searching Without a Heuristic: Efficient Use of Abstraction
Bradford Larsen, Ethan Burns, Wheeler Ruml, Robert C. Holte
2010· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
afffundunlabeled
Bootstrap Learning of Heuristic Functions
Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte
2010· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
afffundunlabeled
Predicting Solution Cost with Conditional Probabilities
Levi H. S. Lelis, Roni Stern, Shahab Jabbari Arfaee
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations

How this was built: Screen · Findings · About