{"id":"W1990570693","doi":"10.1109/icdm.2011.132","title":"SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model","year":2011,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":505,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Maximization; Greedy algorithm; Computer science; Set (abstract data type); Time complexity; Running time; Algorithm; Approximation algorithm; Simple (philosophy); Mathematical optimization; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001488079,0.0001072752,0.0001030768,0.00003122133,0.0001413977,0.00002919307,0.0002292337,0.00002229918,0.0001298767],"category_scores_gemma":[7.473715e-7,0.00007137932,0.00008607768,0.0001267345,0.00003672048,0.00008183071,0.00005625077,0.00006359099,0.000005241751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001101943,"about_ca_system_score_gemma":0.00002229716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001378372,"about_ca_topic_score_gemma":0.000006981156,"domain_scores_codex":[0.9993645,0.00001380702,0.0001616979,0.0001891363,0.00009793092,0.0001729317],"domain_scores_gemma":[0.9994118,0.00002181897,0.0000606224,0.0003509556,0.0001112802,0.00004356692],"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.000006248986,0.0002125851,0.0006913787,0.00000123714,0.00004471546,5.805515e-8,0.0004288138,0.8142594,0.00007952841,0.16113,0.0003046701,0.02284137],"study_design_scores_gemma":[0.00009440455,0.00002787596,0.0001999604,0.00000243439,0.00003167735,6.58532e-8,0.0001563883,0.9568723,0.001311997,0.04114507,0.00005831763,0.00009945682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0910709,0.000004925773,0.9058926,0.00002486612,0.00001096803,0.0002524671,0.0000096214,0.00008035275,0.002653267],"genre_scores_gemma":[0.8745739,5.172855e-7,0.1249145,0.0001321899,0.00008731043,0.00006352672,0.00002918081,0.00001403441,0.0001848652],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.783503,"threshold_uncertainty_score":0.2910764,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04184048520806127,"score_gpt":0.2850095289828672,"score_spread":0.243169043774806,"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."}}