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 Parallel and Distributed Computing
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.

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

Labels cover 0 of 76 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 76 of 76 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
Replica selection strategies in data grid
Rashedur M. Rahman, Reda Alhajj, Ken Barker
2008· article· en· Journal of Parallel and Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
affno abstractunlabeled
Sorting and election in anonymous asynchronous rings
Paola Flocchini, Evangelos Kranakis, Danny Kriz̧anc, Flaminia L. Luccio, Nicola Santoro
2003· article· en· Journal of Parallel and Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Survey of federated learning in intrusion detection
Hao Zhang, Junwei Ye, Wei Huang, Ximeng Liu, Jason Gu
2024· article· en· Journal of Parallel and Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
Computing all the best swap edges distributively
Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
2008· article· en· Journal of Parallel and Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
QoS and data relaying for wireless sensor networks
Sylvia Tai, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl
2007· article· en· Journal of Parallel and Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Mixed precision support in HPC applications: What about reliability?
Alessio Netti, Yang Peng, Patrik Omland, Michael Paulitsch, Jorge Parra, Gustavo Espinosa +3 more
2023· article· en· Journal of Parallel and Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations

How this was built: Screen · Findings · About