{"id":"W4393352772","doi":"10.3390/systems12040117","title":"Resilient Network Design: Disjoint Shortest Path Problem for Power Transmission Application","year":2024,"lang":"en","type":"article","venue":"Systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Computer science; Disjoint sets; Redundancy (engineering); Constrained Shortest Path First; Mathematical optimization; Integer programming; Routing (electronic design automation); Path (computing); Distributed computing; K shortest path routing; Graph; Algorithm; Theoretical computer science; Computer network; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001291356,0.001514679,0.0008645793,0.001516608,0.0008781943,0.001327318,0.001787095,0.001923311,0.007441043],"category_scores_gemma":[0.005650486,0.0005553666,0.001277774,0.00268501,0.0006901412,0.002291196,0.0009871296,0.001386883,0.001196107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001619296,"about_ca_system_score_gemma":0.001635768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00598453,"about_ca_topic_score_gemma":0.008332054,"domain_scores_codex":[0.9990007,0.0003386602,0.00004489179,0.0003258274,0.0002078648,0.00008204375],"domain_scores_gemma":[0.9987929,0.0006723067,0.000157308,0.0001657416,0.000150876,0.00006090023],"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.0000928999,0.00008223814,0.0007294478,0.0004647667,0.00005922995,0.0001686744,0.00007800316,0.8845951,0.0009920807,0.0195928,0.02958153,0.0635632],"study_design_scores_gemma":[0.00002997852,0.00003406069,0.0002741334,0.00004037715,0.00002048063,0.0001165189,0.00007392704,0.9335599,0.0008048275,0.05003973,0.01499156,0.00001452276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05195165,0.002430269,0.9124707,0.003554966,0.0003777259,0.0004189174,0.009768327,0.002025964,0.01700137],"genre_scores_gemma":[0.367078,0.001999283,0.6080042,0.000417841,0.0002156435,0.0008774546,0.01345937,0.0005853196,0.007362896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007441043,"threshold_uncertainty_score":0.02489275,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01695647514377104,"score_gpt":0.260923422866855,"score_spread":0.243966947723084,"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."}}