{"id":"W4408319783","doi":"10.1002/cjce.25650","title":"Robust optimization of chemical process networks based on Louvain‐ <scp>KBICD</scp> community division rewiring algorithm","year":2025,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Division (mathematics); Benchmark (surveying); Computer science; Key (lock); Division algorithm; Algorithm; Process (computing); Node (physics); Identification (biology); Optimization algorithm; Optimization problem; Mathematical optimization; Mathematics; Engineering","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009661916,0.001083523,0.0008018948,0.0006988987,0.0005816228,0.0009161295,0.001045482,0.001057674,0.001256134],"category_scores_gemma":[0.001996272,0.0004226003,0.0007299262,0.0004769792,0.000763265,0.001023655,0.00110921,0.0007948118,0.0001510935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001297813,"about_ca_system_score_gemma":0.001386957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01268437,"about_ca_topic_score_gemma":0.007367677,"domain_scores_codex":[0.9995803,0.0001029922,0.00001868364,0.0001324347,0.0001002934,0.00006520515],"domain_scores_gemma":[0.9993317,0.0002982312,0.000105622,0.00005890418,0.0001701441,0.00003537548],"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.00001773013,0.00001218172,0.000335803,0.00001804626,0.00001657432,0.00002130584,0.00001606937,0.9863228,0.001181666,0.00215077,0.0001545705,0.009752482],"study_design_scores_gemma":[0.000003200969,0.000008714357,0.00005583204,0.000001376472,0.000002361516,0.000002964585,0.000002793165,0.9989589,0.0003177656,0.0005518718,0.00009252949,0.000001702769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06668988,0.0002046313,0.9280171,0.0002323923,0.00003013703,0.00007244987,0.00005421609,0.0003398863,0.004359254],"genre_scores_gemma":[0.8542401,0.0001190589,0.1424688,0.00008587341,0.00001265028,0.0001730282,0.0001431664,0.00006812251,0.002689112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01268437,"threshold_uncertainty_score":0.02522111,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01471105845913417,"score_gpt":0.2360604531337872,"score_spread":0.221349394674653,"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."}}