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
Journal of Network and Computer Applications
Topic
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.

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

Labels cover 0 of 75 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 75 of 75 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
Machine-to-Machine (M2M) communications: A survey
Pawan Kumar Verma, Rajesh Verma, Arun Prakash, Ashish Agrawal, Kshirasagar Naik, Rajeev Tripathi +4 more
2016· article· en· Journal of Network and Computer Applications· Engineering
machine prediction:candidate · noneconsensus · none
212
citations
affno abstractunlabeled
An agent-based approach to security service
Elhadi Shakshuki, Zhonghai Luo, Jing Gong
2004· article· en· Journal of Network and Computer Applications· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Adaptive security protocol selection for mobile computing
Bruno P. S. Rocha, Daniel N.O. Costa, Rande A. Moreira, Cristiano Rezende, Antônio A. F. Loureiro, Azzedine Boukerche
2010· article· en· Journal of Network and Computer Applications· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Advanced topics in cloud computing
Keqiu Li, Laurence T. Yang, Xuemin Lin
2010· article· en· Journal of Network and Computer Applications· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
afffundno abstractunlabeled
MuSC: A multi-stage service chains embedding approach
Imane El Mensoum, Omar Abdul Wahab, Nadjia Kara, Claes Edstrom
2020· article· en· Journal of Network and Computer Applications· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
Towards automating overlay network management
Ibrahim Al‐Oqily, A. Karmouch
2008· article· en· Journal of Network and Computer Applications· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
Detecting feature interactions in CPL
Yiqun Xu, Luigi Logrippo, Jacques Sincennes
2005· article· en· Journal of Network and Computer Applications· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
The design and implementation of a MOO
Ivan Tomek
2000· article· en· Journal of Network and Computer Applications· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations

How this was built: Screen · Findings · About