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
Privacy-Preserving Technologies in Data
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,809 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,809 works in the cohort · of 4,299,418page 26 of 37

Labels cover 7 of 1,809 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,809 of 1,809 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
Issues in Access Control and Privacy for Big Data
Sylvia L. Osborn, Daniel Servos, Motahera Shermin
2021· book-chapter· en· Encyclopedia of Complexity and Systems Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
A Unifying Framework for Federated Learning
Saber Malekmohammadi, Kiarash Shaloudegi, Zeou Hu, Yaoliang Yu
2022· book-chapter· en· Adaptation, learning, and optimization· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Secure itemset hiding in smart city sensor data
Gautam Srivastava, Jerry Chun‐Wei Lin, Guo Lin
2023· article· en· Cluster Computing· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Extending SQL to Support Privacy Policies
Kambiz Ghazinour, Sampson Pun, Maryam Majedi, Amir H. Chinaci, Ken Barker
2010· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
De-identification is not always enough
Atiquer Rahman Sarkar, Yao-Shun Chuang, Noman Mohammed, Xiaoqian Jiang
2024· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
The Effects of Ant Colony Optimization on Graph Anonymization
Gautam Srivastava, Evan Citulsky, Kyle Tilbury, Ashraf M. Abdelbar, Toshiyuki Amagasa
2016· article· en· Open Journal Systems (Global Science & Technology Forum)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About