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
Security in Wireless Sensor 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.

285 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.
285 works in the cohort · of 4,299,418page 2 of 6

Labels cover 0 of 285 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 285 of 285 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
Implementing RSA for sensor nodes in smart cities
Lirong Qiu, Zhe Liu, Geovandro C. C. F. Pereira, Hwajeong Seo
2017· article· en· Personal and Ubiquitous Computing· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
A hierarchical key pre‐distribution scheme for fog networks
Pooneh Nikkhah Bahrami, Hamid Haj Seyyed Javadi, Tooska Dargahi, Ali Dehghantanha, Kim‐Kwang Raymond Choo
2018· article· en· Concurrency and Computation Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
On the Worst-Case Inefficiency of CGKA
Alexander Bienstock, Yevgeniy Dodis, Sanjam Garg, Garrison Grogan, Mohammad Hajiabadi, Paul Rösler
2022· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Recognition in a Low-Power Environment
J. Hammell, André Weimerskirch, J. Girão, Dirk Westhoff
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
afffundno abstractunlabeled
DHT-Based Detection of Node Clone in Wireless Sensor Networks
Zhijun Li, Guang Gong
2010· book-chapter· en· Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Logarithmic Keying of Communication Networks
Mohamed G. Gouda, Sandeep S. Kulkarni, Ehab S. Elmallah
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
Self-Healing Group Key Distribution
Muhammad Junaid Bohio, Ali Miri
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations

How this was built: Screen · Findings · About