{"id":"W4394566534","doi":"10.1016/j.jocs.2024.102283","title":"Analyzing modularity maximization in approximation, heuristic, and graph neural network algorithms for community detection","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; University of Toronto","funders":"","keywords":"Modularity (biology); Heuristic; Computer science; Maximization; Artificial neural network; Graph; Algorithm; Theoretical computer science; Artificial intelligence; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005841146,0.001050995,0.0009804174,0.002472717,0.0007825893,0.001154438,0.001632893,0.001363318,0.001015463],"category_scores_gemma":[0.03424062,0.0004478073,0.0007472278,0.002013074,0.001451532,0.002631232,0.001397601,0.001219735,0.0001828477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002555601,"about_ca_system_score_gemma":0.001469807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005478443,"about_ca_topic_score_gemma":0.007402597,"domain_scores_codex":[0.9973678,0.001335776,0.00008349912,0.0004189718,0.0006173537,0.0001767029],"domain_scores_gemma":[0.9876696,0.009025818,0.001073912,0.001019268,0.0009846274,0.000226688],"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.0001250089,0.00008306451,0.004497434,0.0001185425,0.00009124591,0.00004291293,0.0000953207,0.9397035,0.0009746091,0.01501739,0.0008293157,0.03842166],"study_design_scores_gemma":[0.000006296028,0.00002270221,0.0003554974,0.000007584471,0.00000665771,0.00001527325,0.00001549321,0.9916486,0.0004239086,0.007333739,0.0001609072,0.000003397657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2006726,0.0009598176,0.7936063,0.0005938969,0.0000504239,0.0001129885,0.0001738192,0.0005161837,0.003313954],"genre_scores_gemma":[0.7138524,0.0002978032,0.2841491,0.0001341161,0.00003869284,0.0001638654,0.0004262007,0.0001013546,0.000836458],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005841146,"threshold_uncertainty_score":0.0308913,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02007541510059331,"score_gpt":0.3009437318896196,"score_spread":0.2808683167890264,"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."}}