{"id":"W2006177467","doi":"10.1103/physreve.81.046102","title":"Loops and multiple edges in modularity maximization of networks","year":2010,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":44,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Maximization; Null model; Null (SQL); Mathematics; Random graph; Modularity (biology); Clique; Combinatorics; Clique problem; Discrete mathematics; Computer science; Pathwidth; Mathematical optimization; Graph; Line graph","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.003999338,0.0006120431,0.000699069,0.00147598,0.0007821751,0.001157731,0.001592558,0.001257164,0.001324533],"category_scores_gemma":[0.02454817,0.0006033297,0.0007191268,0.0009052551,0.003303102,0.004250072,0.001806857,0.001171193,0.0002644276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001235156,"about_ca_system_score_gemma":0.0005765873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00122422,"about_ca_topic_score_gemma":0.0009286444,"domain_scores_codex":[0.9981117,0.001184676,0.00004018798,0.0002575582,0.0002594834,0.0001462893],"domain_scores_gemma":[0.9874894,0.009554991,0.0009786512,0.0009727231,0.0006206135,0.0003836113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001431121,0.00006623456,0.002001812,0.000102933,0.00004613821,0.0001345784,0.000314018,0.3451065,0.002818314,0.6339415,0.0008520837,0.01447275],"study_design_scores_gemma":[0.00001338608,0.00002041384,0.0003092843,0.000008119197,0.000007215168,0.00003985109,0.00002600359,0.5916052,0.0005882666,0.4070386,0.0003319411,0.00001179793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1523223,0.0003747856,0.8428476,0.00049443,0.00001816705,0.00003733136,0.0000555682,0.000166768,0.003683046],"genre_scores_gemma":[0.9131156,0.0003281676,0.08477277,0.0000873893,0.0000438029,0.0001155571,0.00007615909,0.00008064942,0.001380066],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003999338,"threshold_uncertainty_score":0.02115077,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01103124952420767,"score_gpt":0.2855459455967111,"score_spread":0.2745146960725035,"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."}}