{"id":"W2066787887","doi":"10.1049/ip-gtd:20030797","title":"Reliability evaluation algorithm for complex medium voltage electrical distribution networks based on the shortest path","year":2003,"lang":"en","type":"article","venue":"IEE Proceedings - Generation Transmission and Distribution","topic":"Power System Reliability and Maintenance","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"National Science Foundation","keywords":"Shortest path problem; Node (physics); Reliability (semiconductor); Algorithm; Computer science; Path (computing); Circuit breaker; Complex network; Topology (electrical circuits); Graph theory; Graph; Dijkstra's algorithm; Voltage; Mathematics; Theoretical computer science; Engineering; Power (physics); Computer network; Structural engineering","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.001971894,0.0002603756,0.0002182332,0.00002917871,0.000455387,0.000137335,0.00009464825,0.0002201219,0.00004333323],"category_scores_gemma":[0.0003897093,0.0001943313,0.0001029992,0.0003150147,0.00006589807,0.0001895851,0.000003938921,0.0002208985,0.000001978154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003213348,"about_ca_system_score_gemma":0.00006708129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003211012,"about_ca_topic_score_gemma":0.00000104136,"domain_scores_codex":[0.9982746,0.00006777128,0.0004504531,0.0004191507,0.0004294252,0.0003585612],"domain_scores_gemma":[0.9989817,0.0001277773,0.00007740465,0.0001436068,0.0005058823,0.0001636315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004232065,0.001299121,0.001100944,0.0006576936,0.0001171767,0.000001824972,0.0005044029,0.1796992,0.1518286,0.05938257,0.2272007,0.3777846],"study_design_scores_gemma":[0.0007334049,0.0001434816,0.001457947,0.00004560547,0.00005333725,0.000003580587,0.00002653254,0.9493151,0.01057416,0.0004904145,0.03692935,0.0002270791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01100633,0.0002089485,0.9859267,0.0004579207,0.0003428522,0.001433365,0.0002347083,0.0001880062,0.0002011075],"genre_scores_gemma":[0.9958457,0.00008035725,0.001068871,0.0001195748,0.0001681411,0.000455133,0.002227431,0.00001994405,0.00001481966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9848579,"threshold_uncertainty_score":0.7924602,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02054915439409869,"score_gpt":0.2360056777139689,"score_spread":0.2154565233198702,"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."}}