{"id":"W2767812464","doi":"10.1109/tnet.2019.2940888","title":"Curing Epidemics on Networks Using a Polya Contagion Model","year":2019,"lang":"en","type":"preprint","venue":"IEEE/ACM Transactions on Networking","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Curing (chemistry); Computer science; Mathematical optimization; Gradient descent; Network structure; Operations research; Mathematics; Artificial intelligence; Distributed computing; Artificial neural network; Materials science","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001561305,0.0009875214,0.001173044,0.0009500323,0.0007872817,0.001639583,0.001481054,0.001960869,0.002372989],"category_scores_gemma":[0.004523493,0.0005698405,0.001012774,0.0005848988,0.002300376,0.001846991,0.00170583,0.00173506,0.0002669338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001310045,"about_ca_system_score_gemma":0.0006860381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004920194,"about_ca_topic_score_gemma":0.002820277,"domain_scores_codex":[0.9992864,0.000344648,0.00002821833,0.00009836755,0.0001325081,0.0001099729],"domain_scores_gemma":[0.9975657,0.001648714,0.0003592478,0.0001093466,0.0001418657,0.0001751143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003216129,0.00003439469,0.000259143,0.00002893107,0.00001824383,0.0001102917,0.00006877512,0.9458827,0.001297789,0.04995966,0.0003129608,0.001995011],"study_design_scores_gemma":[0.000005310614,0.00001183053,0.00003843252,0.000002463824,0.000004180004,0.00000839539,0.000009141557,0.9916357,0.00009362579,0.008026873,0.0001596812,0.000004426402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1468653,0.0007208068,0.8362372,0.001030121,0.0001070165,0.0001006348,0.0001143252,0.0002162532,0.01460836],"genre_scores_gemma":[0.9634326,0.0007048524,0.02674993,0.0001555765,0.00007762555,0.0001489503,0.00005983828,0.00006612032,0.008604621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004920194,"threshold_uncertainty_score":0.009783089,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06640543453596294,"score_gpt":0.3193502258574131,"score_spread":0.2529447913214502,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}