MétaCan
Menu
Back to cohort
Record W3182344762 · doi:10.1109/cbms52027.2021.00038

Learning Health Systems: An Anonymous Network Routing Protocol

2021· article· en· W3182344762 on OpenAlexaff
Thibaud Ecarot, Benoît Fraikin, Luc Lavoie, Mark McGilchrist, Jean‐François Éthier

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicInternet Traffic Analysis and Secure E-voting
Canadian institutionsUniversité de Sherbrooke
Fundersnot available
KeywordsComputer scienceIdentifierAnonymityComputer securityRouting protocolProtocol (science)CompromiseComputer networkIdentification (biology)Routing (electronic design automation)

Abstract

fetched live from OpenAlex

Learning Healthcare Systems are an emerging approach to healthcare research as translated into practice. For this purpose, a strong interconnection comes to be a necessity when dealing with healthcare services, research and knowledge transfer all at once. Practically, these connections imply that a routing protocol should guarantee anonymity to entities in compliance with both laws and ethical requirements while restricting the quantity of information obtainable had an entity been compromised. In order to bring more protection and meet all the requirements, a new message routing protocol is offered to allow the use of data access paths and to resist traffic analysis security threats. The protocol protects the addresses and roles pertaining to entities from any lurking malevolent minds by implementing proxies into a mix-network. Moreover, flows of synthetic datasets and contents identifiers are handled separately so as to curb any risk of re-identification. A model of this protocol is provided in the form of a multi-objective optimization problem, natively integrating objectives of minimizing both latency and entropy of the information exchanged. The assessment of this model shows that the constrained separation of data flows has a minimal impact on delay times, which not only reveals to be an acceptable compromise but also significantly increases security in data access.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.974
Threshold uncertainty score0.581

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.019
GPT teacher head0.288
Teacher spread0.269 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicInternet Traffic Analysis and Secure E-votingFrench-language works237,207