{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001819262,0.001134222,0.0009047743,0.00195389,0.0005152897,0.0008297928,0.0009816487,0.0006265572,0.002322378],"category_scores_gemma":[0.005988998,0.0003595769,0.0005376929,0.001047819,0.0005570982,0.001447678,0.00070215,0.0008117256,0.0005752243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001008955,"about_ca_system_score_gemma":0.00116294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002695255,"about_ca_topic_score_gemma":0.001969877,"domain_scores_codex":[0.9991209,0.0003105428,0.00005886548,0.0001199645,0.0003369837,0.00005277886],"domain_scores_gemma":[0.9975929,0.001362385,0.0002082271,0.0001059957,0.0006818557,0.00004855294],"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.000087351,0.00003466315,0.0008757209,0.0001219994,0.00003959196,0.0000526271,0.00009369348,0.7389013,0.002753911,0.01321647,0.00161836,0.2422044],"study_design_scores_gemma":[0.00001676593,0.00004471378,0.0001835665,0.00001312378,0.000009127776,0.00004620713,0.00001356473,0.992156,0.001075031,0.005249083,0.001183907,0.000008891901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004097152,0.00008376136,0.9949243,0.00003338543,0.000007732203,0.00004785257,0.00002620862,0.0002561451,0.0005233737],"genre_scores_gemma":[0.1142098,0.0001933717,0.8839577,0.00001962278,0.00002045641,0.0002016451,0.0002074585,0.0001386418,0.00105109],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002695255,"threshold_uncertainty_score":0,"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."}}