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 22 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.

afffundunlabeled
Anonymizing location-based RFID data
Jarmanjit Singh, Shi Qing, Harpreet Sandhu, Benjamin C. M. Fung
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Towards Privacy in Deep Learning
Florian Kerschbaum
2021· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Is It Privacy or Is It Access Control?
Sylvia L. Osborn
2014· book-chapter· en· Advances in information security, privacy, and ethics book series· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Anonymous Broadcast Messages
Dragan Lazić, Charlie Obimbo
2013· article· en· International Journal of Advanced Computer Science and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
CLiKC: A Privacy-Mindful Approach When Sharing Data
Esma Aı̈meur, Gilles Brassard, Jonathan Rioux
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Distributed Source Simulation With No Communication
Tomer Berg, Ofer Shayevitz, Young-Han Kim, Lele Wang
2020· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Trust Management XI
Babak Esfandiari
2017· book· en· IFIP advances in information and communication technology· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Me, Myself and I
Esma Aı̈meur, Alexis Tremblay
2018· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Temporally Extended Metrics for Markov Decision Processes.
Philip Amortila, Marc G. Bellemare, Prakash Panangaden, Doina Precup
2019· article· en· National Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About