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 International Conference on Automated Planning and Scheduling
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.

93 results · 1 filter active ·
Results by year
20092025
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.
93 works in the cohort · of 4,299,418page 2 of 2

Labels cover 0 of 93 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 93 of 93 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

afffundunlabeled
Exploiting N-Gram Analysis to Predict Operator Sequences
Christian Muise, Sheila A. McIlraith, Jorge A. Baier, Michael E. Reimer
2009· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
The Two-Edged Nature of Diverse Action Costs
Gaojian Fan, Martin Müller, Robert C. Holte
2017· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Long-Run Stability in Dynamic Scheduling
Daria Terekhov, Tony Tran, Douglas G. Down, J. Christopher Beck
2012· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Engineering
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
The Complexity of Partial-Order Plan Viability Problems
Xing Tan, Michael Grüninger
2014· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Jump Point Search with Temporal Obstacles
Shuli Hu, Daniel Harabor, Graeme Gange, Peter J. Stuckey, Nathan Sturtevant
2021· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Temporal-Difference Search in Computer Go
David Silver, Richard S. Sutton, Martin Mueller
2013· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Lagrangian Decomposition for Optimal Cost Partitioning
Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin
2021· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Multi-Robot Connected Fermat Spiral Coverage
Jingtao Tang, Hang Ma
2024· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Predicting the Effectiveness of Bidirectional Heuristic Search
Nathan Sturtevant, Shahaf Shperberg, Ariel Felner, Jingwei Chen
2020· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
An Optimal Constraint Programming Approach to the Open-Shop Problem
Arnaud Malapert, Hadrien Cambazard, Christelle Guéret, Narendra Jussien, André Langevin, Louis-Martin Rousseau
2013· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Engineering
distilled prediction:candidate · noneconsensus · none
4
citations
fundno affunlabeled
Robust and Adaptive Planning under Model Uncertainty
Apoorva Sharma, J. Michael Harrison, Matthew Tsao, Marco Pavone
2019· preprint· en· Proceedings of the International Conference on Automated Planning and Scheduling· Decision Sciences
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundunlabeled
Biased Exploration for Satisficing Heuristic Search
Ryo Kuroiwa, J. Christopher Beck
2022· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
New Exact Methods for Solving Quadratic Traveling Salesman Problem
Yuxiao Chen, Anubhav Pratap Singh, Ryo Kuroiwa, J. Christopher Beck
2025· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Exact Multi-objective Path Finding with Negative Weights
Saman Ahmadi, Nathan Sturtevant, Daniel Harabor, Mahdi Jalili
2024· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Program Committee
Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert
2011· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Engineering
distilled prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Priority-Based Search for the Virtual Network Embedding Problem
Yi Zheng, Hang Ma, Sven Koenig, Erik Kline, T. K. Satish Kumar
2023· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
aboutno affunlabeled
Preface
Ronen I. Brafman, Héctor Geffner, Joerg Hofman, Henry Kautz
2021· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
A Logical Semantics for PDDL+
Vitaliy Batusov, Mikhail Soutchanski
2021· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Frontmatter
Roman Barták, Andrea Orlandini, Mauro Vallati, Sven Koenig, Roni Stern
2023· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Preface
Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert
2011· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Organizing Committee
Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert
2011· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
W-restrained Bidirectional Bounded-Suboptimal Heuristic Search
Dor Atzmon, Shahaf Shperberg, Netanel Sabah, Ariel Felner, Nathan Sturtevant
2023· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Parallelizing Multi-objective A* Search
Saman Ahmadi, Nathan Sturtevant, Andrea Raith, Daniel Harabor, Mahdi Jalili
2025· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Generalizing Action Justification and Causal Links to Policies
Sarath Sreedharan, Christian Muise, Subbarao Kambhampati
2023· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Program Committee
Steve Chien, N. Minh, Alan Fern, Wheeler Ruml
2014· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About