{"id":"W2024996305","doi":"10.1007/s10479-012-1286-z","title":"Reformulation of a model for hierarchical divisive graph modularity maximization","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Heuristics; Mathematics; Random graph; Maximization; Quadratic equation; Combinatorics; Graph; Modularity (biology); Theory of computation; Discrete mathematics; Mathematical optimization; Algorithm","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001110547,0.00006815448,0.0001681385,0.0002818566,0.00019223,0.00002208598,0.0001537527,0.00003626259,0.00006341164],"category_scores_gemma":[0.00005892916,0.00006247751,0.000127717,0.0004636496,0.00009191436,0.0003126838,0.00007987986,0.0001306287,0.000001298429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008572772,"about_ca_system_score_gemma":0.00006153532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002379614,"about_ca_topic_score_gemma":0.0000176801,"domain_scores_codex":[0.9988708,0.0001198911,0.0003085367,0.0001244023,0.0003129068,0.0002634402],"domain_scores_gemma":[0.9982953,0.0001003877,0.00004173816,0.0002785185,0.001217197,0.00006685695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005390427,0.0006616573,0.01191814,0.00003029391,0.0001288216,1.670606e-8,0.001006999,0.2231523,0.005474767,0.744059,0.001548167,0.01196591],"study_design_scores_gemma":[0.0001136096,0.00005354137,0.002782405,0.0000134006,0.000009418774,4.141497e-8,0.00004728855,0.9228483,0.01470694,0.05928583,0.00007645777,0.00006277183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3325456,0.00004052408,0.6658154,0.0003296803,0.00000643415,0.0003900999,0.00006543227,0.000008768693,0.0007980395],"genre_scores_gemma":[0.9813948,0.00001250881,0.01795131,0.000008822217,0.00009451623,0.0001252415,0.0002217324,0.000009854679,0.0001812628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6996959,"threshold_uncertainty_score":0.2547759,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2897551384529904,"score_gpt":0.4873950097450737,"score_spread":0.1976398712920833,"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."}}