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

affvenueunlabeled
A Time and Place to Land
W. D. P. Stewart, J.L. Stephenson
2024· article· en· Inquiry Queen s Undergraduate Research Conference Proceedings· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Multi-hop Greedy Gossip with Eavesdropping
Deniz Üstebay, Boris N. Oreshkin, Mark Coates, Michael Rabbat
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Emergent homeomorphic curves in swarms
Peter T. Jardine, Sidney Givigi
2025· article· en· Automatica· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On Vehicle Placement to Intercept Moving Targets
Shaunak D. Bopardikar, Stephen L. Smith, Francesco Bullo
2010· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Bibliography
Hugh H. T. Liu, Bo Zhu
2018· other· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Introduction
Ziquan Yu, Youmin Zhang, Bin Jiang, Chun‐Yi Su
2023· book-chapter· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Command, control, and autonomous swarms
Simon P. Monckton, Gregory S. Broten
2005· article· en· Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About