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
Robotic Path Planning Algorithms
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,570 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.
1,570 works in the cohort · of 4,299,418page 5 of 32

Labels cover 1 of 1,570 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,570 of 1,570 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
Waiting with Jose, a vision-based mobile robot
Pantelis Elinas, Jesse Hoey, Darrell M. Lahey, Jefferson Montgomery, D. B. Murray, Stephen Se +1 more
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
Modeling and adaptive control of redundant robots
Brice Le Boudec, Maarouf Saad, Vahé Nerguizian
2006· article· en· Mathematics and Computers in Simulation· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affunlabeled
Energy Efficient Robot Rendezvous
Pawel Zebrowski, Yaroslav Litus, Richard Vaughan
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
afffundunlabeled
Obstacle Avoidance via Hybrid Feedback
Soulaimane Berkane, Andrea Bisoffi, Dimos V. Dimarogonas
2021· article· en· IEEE Transactions on Automatic Control· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
A new approach to cooperative pathfinding
Renee Jansen, Nathan Sturtevant
2008· article· en· Adaptive Agents and Multi-Agents Systems· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affunlabeled
Probability and Statistics
Gregory Dudek, Michael Jenkin
2010· other· en· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affunlabeled
Portal-Based True-Distance Heuristics for Path Finding
Meir Goldenberg, Ariel Felner, Nathan Sturtevant, Jonathan Schaeffer
2010· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affunlabeled
Experiences with an autonomous robot attending AAAI
François Michaud, Jean‐Nicolas Audet, Dominic Létourneau, Luc Lussier, C. Theberge-Turmel, S. Caron
2001· article· en· IEEE Intelligent Systems· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
← previousnext →

How this was built: Screen · Findings · About