MétaCan
Menu
Back to cohort
Record W4388841598 · doi:10.1016/j.rico.2023.100339

Optimal control of a rumor propagation model in online social network by considering influential nodes

2023· article· en· W4388841598 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueResults in Control and Optimization · 2023
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsUniversity of GuelphUniversity of Waterloo
Fundersnot available
KeywordsRumorHomogeneousControl (management)Government (linguistics)Computer scienceInternet privacyPublic relationsComputer securitySociologyPolitical scienceArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

Social networking platforms give people an opportunity to get in contact with each other irrespective of boundaries. Through these platforms, any individual can easily follow the ideas of other individuals like friends, relatives, politicians, actors, etc, and get in contact with them. In this paper, we examine rumor propagation with two types of infected people: highly influential people and ordinary people. Some ordinary people, blindly follow the messages shared by highly influential people. By using this concept we analyze the rumor-spreading model in networks (homogeneous and heterogeneous). We applied control strategies in homogeneous networks and observed that government policies to control rumor propagation can reduce its spread. Immunization in heterogeneous networks by giving proper information and education to people about facts can also reduce the spread and help people make the right decision when they come across a rumor.

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.

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.000
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.759
Threshold uncertainty score0.538

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.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.011
GPT teacher head0.258
Teacher spread0.248 · 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