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
Distributed Control Multi-Agent Systems
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,051 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,051 works in the cohort · of 4,299,418page 3 of 22

Labels cover 0 of 1,051 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,051 of 1,051 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
Adaptive range‐measurement‐based target pursuit
Barış Fi̇dan, Soura Dasgupta, Brian D. O. Anderson
2012· article· en· International Journal of Adaptive Control and Signal Processing· Computer Science
machine prediction:candidate · noneconsensus · none
66
citations
affunlabeled
Asynchronous Gradient Push
2020· article· en· IEEE Transactions on Automatic Control· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
affunlabeled
Adaptive Deployment of Mobile Robotic Networks
Jérôme Le Ny, George J. Pappas
2012· article· en· IEEE Transactions on Automatic Control· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affunlabeled
Robust Area Coverage with Connectivity Maintenance
Luca Siligardi, Jacopo Panerati, Marcel Kaufmann, Marco Minelli, Cinara Ghedini, Giovanni Beltrame +1 more
2019· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations
afffundno abstractunlabeled
Experiments in multirobot coordination
Joshua A. Marshall, T. Fung, Mireille E. Broucke, G.M.T. D’Eleuterio, Bruce A. Francis
2005· article· en· Robotics and Autonomous Systems· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations
fundno affno abstractunlabeled
Collaborative visual area coverage
Sotiris Papatheodorou, Anthony Tzes, Yiannis Stergiopoulos
2017· article· en· Robotics and Autonomous Systems· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations

How this was built: Screen · Findings · About