{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008715636,0.0001364429,0.0001576337,0.00004640834,0.00006481881,0.000100869,0.00008703874,0.00009493186,0.000006053303],"category_scores_gemma":[0.000009631902,0.0001214555,0.00005795258,0.0002538981,0.000008221167,0.00007089751,0.000006930817,0.00009226822,0.00001995881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009692053,"about_ca_system_score_gemma":0.00002139888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002896248,"about_ca_topic_score_gemma":2.828054e-7,"domain_scores_codex":[0.9989924,0.00007467745,0.0003230221,0.0002342418,0.0001348317,0.0002407812],"domain_scores_gemma":[0.9995172,0.0001500629,0.00002233278,0.000199841,0.00003885167,0.0000717282],"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.000004929157,0.000006058206,0.00001565716,0.0003397136,0.00002046586,9.890502e-7,0.0002544242,0.9794478,0.003538324,0.001100263,0.004624957,0.01064645],"study_design_scores_gemma":[0.00007876138,0.00003386061,0.00002483943,0.0003306321,0.00001675124,0.000006047845,0.00002404739,0.9420491,0.0003399915,0.0002055686,0.0567477,0.0001427191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001499415,0.003832477,0.9922915,0.00006187321,0.0006797725,0.001426277,0.000007545623,0.0009195686,0.0006311014],"genre_scores_gemma":[0.7325509,0.00004781416,0.2659707,0.000006926918,0.0002255679,0.0006986744,0.00002801082,0.00009671164,0.0003747012],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.732401,"threshold_uncertainty_score":0.4952813,"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."}}