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
Mobile Ad Hoc Networks
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,382 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,382 works in the cohort · of 4,299,418page 1 of 28

Labels cover 2 of 1,382 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,382 of 1,382 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.

affno abstractunlabeled
Routing protocols in ad hoc networks: A survey
Azzedine Boukerche, Begümhan Turgut, Nevin Aydın, Mohammad Zubair Ahmad, Ladislau Bölöni, Damla Turgut
2011· article· en· Computer Networks· Computer Science
machine prediction:candidate · noneconsensus · none
535
citations
affno abstractunlabeled
Power consumption in packet radio networks
Lefteris M. Kirousis, Evangelos Kranakis, Danny Kriz̧anc, Andrzej Pelc
2000· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
424
citations
affunlabeled
Wireless Mesh Networks Design — A Survey
Djohara Benyamina, Abdelhakim Hafid, Michel Gendreau
2011· article· en· IEEE Communications Surveys & Tutorials· Computer Science
machine prediction:candidate · noneconsensus · none
206
citations
affno abstractunlabeled
Guide to Wireless Ad Hoc Networks
Subhas Chandra Misra, Sudip Misra, Isaac Woungang
2009· book· en· Computer communications and networks· Computer Science
machine prediction:candidate · noneconsensus · none
187
citations
affno abstractunlabeled
Deterministic broadcasting in ad hoc radio networks
Bogdan S. Chlebus, Leszek Gąsieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
2002· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
153
citations
affunlabeled
On the Complexity of Scheduling in Wireless Networks
Changhee Joo, Gaurav Sharma, Ness B. Shroff, Ravi R. Mazumdar
2010· article· en· EURASIP Journal on Wireless Communications and Networking· Computer Science
machine prediction:candidate · noneconsensus · none
139
citations
affunlabeled
AnonDSR
Ronggong Song, Larry Korba, George Yee
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
124
citations

How this was built: Screen · Findings · About