{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001632608,0.00007028467,0.0001362766,0.0002957275,0.0003104839,0.0002077855,0.0001514415,0.00001376098,0.00000462777],"category_scores_gemma":[0.00002875367,0.00006474096,0.00006566782,0.001066894,0.0001138106,0.00047785,0.00004131418,0.0002205992,1.341981e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005205281,"about_ca_system_score_gemma":0.00007629663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004857325,"about_ca_topic_score_gemma":0.00001093534,"domain_scores_codex":[0.9991397,0.00008473597,0.0003422345,0.0001050847,0.0001989283,0.0001293657],"domain_scores_gemma":[0.9991382,0.000273136,0.0001653912,0.00005677833,0.0003182646,0.00004827807],"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.00001057611,0.0000428672,0.009503187,0.00001459869,0.00002190826,5.310786e-7,0.0001650612,0.886949,0.0001696198,0.01127106,0.00005070915,0.09180089],"study_design_scores_gemma":[0.00008265756,0.00003330675,0.02587169,0.000029545,0.00001465162,0.000005399456,0.00002754364,0.6893895,0.00005675126,0.2844225,0.00002163302,0.0000448735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2736172,0.00009078937,0.7260103,0.00008330634,0.00008421587,0.0000723234,0.000002079576,0.0000101486,0.00002967313],"genre_scores_gemma":[0.9478218,0.000002404318,0.05195143,0.00001031916,0.0001974448,0.000003888016,0.000006743028,0.000004192515,0.000001799634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6742046,"threshold_uncertainty_score":0.264006,"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."}}