{"id":"W1650786556","doi":"10.1109/pesgm.2015.7286611","title":"Dynamic graph based DG allocation for congestion mitigation in radial distribution networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Optimal Power Flow Distribution","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Graph; Mathematical optimization; Distributed generation; Shortest path problem; Time horizon; Motion planning; Path (computing); Distributed computing; Power (physics); Mathematics; Computer network; Artificial intelligence; Theoretical computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0003084357,0.0001277801,0.0001132266,0.00007228286,0.00002750135,0.00003545516,0.00006111507,0.0001472356,0.000006680037],"category_scores_gemma":[0.00008961614,0.0001470481,0.00004226622,0.0002817063,0.00002326239,0.0002562914,0.000004909547,0.00009569927,0.00001048876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005162841,"about_ca_system_score_gemma":0.00003029962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002503981,"about_ca_topic_score_gemma":0.00015752,"domain_scores_codex":[0.9992297,0.00002640006,0.0002398248,0.0001574994,0.0001182818,0.0002282523],"domain_scores_gemma":[0.9995984,0.00004531715,0.00003028634,0.000120612,0.0001170017,0.00008831188],"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.00005277066,0.00002916043,0.0008642339,0.00002036069,0.000006495467,4.184149e-7,0.00001536636,0.9902371,0.0005608563,0.001552001,0.002763793,0.003897479],"study_design_scores_gemma":[0.001152247,0.00007086975,0.01226077,0.0000199913,0.00001287854,8.34251e-7,0.00002287325,0.9844933,0.0005990117,0.0005350533,0.0006679358,0.0001642388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1578967,0.00007272849,0.8403851,0.0001842523,0.0005172067,0.0004480256,0.0000818643,0.0002716066,0.0001424671],"genre_scores_gemma":[0.9901934,0.000007155472,0.001896345,0.00002114961,0.00004935298,0.0001236121,0.007680314,0.00001872999,0.000009925645],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8384888,"threshold_uncertainty_score":0.5996446,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00858183128106332,"score_gpt":0.2220274825215558,"score_spread":0.2134456512404925,"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."}}