{"id":"W2008671102","doi":"10.1109/iscas.2012.6271569","title":"Contingency constrained optimal power flow solutions in complex network power grids","year":2012,"lang":"en","type":"article","venue":"","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Mathematical optimization; Power flow; Network topology; Contingency; Computer science; Topology (electrical circuits); Flow network; Maximum flow problem; Power (physics); Power network; Multi-commodity flow problem; Graph theory; Graph; Electric power system; Mathematics; Theoretical computer science; Computer network","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004419821,0.0002270813,0.0003513337,0.00009013655,0.0001701903,0.00004709085,0.0002102653,0.00005152454,0.01613687],"category_scores_gemma":[0.00000495789,0.0002177317,0.0002068512,0.0004303005,0.0001076439,0.0002032771,0.000162319,0.0002210191,0.0001002723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003591999,"about_ca_system_score_gemma":0.00003264747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001420499,"about_ca_topic_score_gemma":0.00003244613,"domain_scores_codex":[0.9982013,0.00008600403,0.0004279236,0.0002375662,0.0001526937,0.0008945906],"domain_scores_gemma":[0.9992657,0.00008246757,0.00009547239,0.0003350199,0.00006721116,0.000154074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0000170571,0.0006337988,0.4373804,0.000002559716,0.0002500968,0.000001695506,0.00044515,0.00341449,0.0004007905,0.4082719,0.1434253,0.005756788],"study_design_scores_gemma":[0.003636474,0.0003215226,0.4524712,0.0001284033,0.0003538017,0.00001356436,0.002482904,0.1593661,0.0003876391,0.02397017,0.3534354,0.003432845],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.135437,0.0002670826,0.3593384,0.0004660444,0.0003329118,0.0005872356,0.00004212821,0.0003902678,0.5031389],"genre_scores_gemma":[0.9661227,0.000001155782,0.03267625,0.0001139083,0.0004692257,0.00003688562,0.0000931503,0.00002159601,0.0004651241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8306857,"threshold_uncertainty_score":0.9847625,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02192306031073601,"score_gpt":0.2679954357709825,"score_spread":0.2460723754602465,"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."}}