{"id":"W4306251851","doi":"10.1016/j.egyr.2022.09.121","title":"Improved Laplacian Matrix based power flow solver for DC distribution networks","year":2022,"lang":"en","type":"article","venue":"Energy Reports","topic":"Optimal Power Flow Distribution","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Hong Kong Polytechnic University","keywords":"Solver; Computer science; Network topology; Convergence (economics); Topology (electrical circuits); Laplacian matrix; Mathematical optimization; Flow (mathematics); Power (physics); Matrix (chemical analysis); Power flow; Algorithm; Electric power system; Graph; Distributed computing; Mathematics; Theoretical computer science; Engineering; Electrical engineering; Computer network; Physics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002931375,0.0002091846,0.0002024356,0.00004570793,0.0002333129,0.00004352818,0.00009566623,0.0001010054,0.0003815379],"category_scores_gemma":[0.00003727791,0.0002462557,0.0001726719,0.0002351819,0.00001813696,0.0001144419,0.00005686218,0.0001757845,0.000001328884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003983715,"about_ca_system_score_gemma":0.000047896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002351872,"about_ca_topic_score_gemma":0.00002638301,"domain_scores_codex":[0.9986098,0.00002548819,0.0004021224,0.0003148928,0.0002106762,0.0004369948],"domain_scores_gemma":[0.9993014,0.00003459309,0.0001028099,0.0003925835,0.00006257661,0.0001060674],"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.00005360929,0.00004668157,0.00009901337,0.00001185897,0.00003823651,0.00009175557,0.000008584718,0.9515636,0.001457841,0.0003214173,0.04541715,0.0008902431],"study_design_scores_gemma":[0.000269038,0.0001099936,0.0001156071,0.000004178262,0.00002324819,0.00005585451,0.00001019581,0.7389613,0.00204708,0.00007173531,0.2580786,0.0002531115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01673529,0.0003569305,0.9773644,0.00008743094,0.003332737,0.0002641067,0.000541882,0.0006264181,0.0006907779],"genre_scores_gemma":[0.992029,0.000002915041,0.0008424861,0.00006408117,0.0001567455,0.0003493156,0.00606621,0.00005869486,0.0004305502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.976522,"threshold_uncertainty_score":0.999999,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003430047421010798,"score_gpt":0.1935782665372242,"score_spread":0.1901482191162134,"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."}}