{"id":"W2405015892","doi":"10.1090/conm/588/11713","title":"Using graph partitioning for efficient network modularity optimization","year":2013,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Modularity (biology); Mathematics; Graph; Graph partition; Theoretical computer science; Combinatorics; Computer science; Biology; Evolutionary biology","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004398088,0.0006558769,0.001223466,0.00009433171,0.0001496504,0.0001414655,0.0003533753,0.0004137406,0.0004850275],"category_scores_gemma":[0.00006248899,0.0006226639,0.0006080265,0.0004173141,0.0003672871,0.00007760185,0.00007970941,0.0003458812,0.00004383282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001274002,"about_ca_system_score_gemma":0.00005445287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001862965,"about_ca_topic_score_gemma":4.736705e-7,"domain_scores_codex":[0.997737,0.0000460441,0.0008186193,0.0004217332,0.0003685764,0.0006080188],"domain_scores_gemma":[0.9983073,0.0002654573,0.000488642,0.0006529231,0.00007944505,0.0002062541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002750148,0.0003151977,0.00000868656,0.004865346,0.0007686384,0.00000252297,0.0006932493,0.1674005,0.0001049557,0.01584348,0.8096312,0.000363445],"study_design_scores_gemma":[0.0002183575,0.00004201039,3.735146e-7,0.0009707833,0.0001332197,0.000005529465,0.0002354663,0.9762144,0.00005280793,0.01576161,0.005654569,0.0007108506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003846567,0.0008577224,0.8944768,0.00001579426,0.0001387687,0.00194377,0.00008458137,0.002090578,0.1003535],"genre_scores_gemma":[0.001997518,0.000138622,0.9847984,0.00009582873,0.0004572647,0.0006105385,0.0001291118,0.001186762,0.01058596],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8088139,"threshold_uncertainty_score":0.9996225,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04073829152176674,"score_gpt":0.2655487648933539,"score_spread":0.2248104733715872,"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."}}