{"id":"W4406142535","doi":"10.1137/1.9781611978322.179","title":"Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Shortest path problem; Enhanced Data Rates for GSM Evolution; Path (computing); Computer science; Fault tolerance; Computer network; Distributed computing; Artificial intelligence; Theoretical computer science","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007770777,0.0005381484,0.0009152166,0.0000550039,0.0005445737,0.0002328594,0.000437968,0.001197861,6.776973e-7],"category_scores_gemma":[0.00006001238,0.0004636684,0.0004419322,0.000035516,0.0002148179,0.0001053116,0.0002056224,0.0005005941,7.029539e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008517236,"about_ca_system_score_gemma":0.0002792683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006144941,"about_ca_topic_score_gemma":0.000007754146,"domain_scores_codex":[0.9977048,0.000007044518,0.0008422092,0.0007953282,0.0002557356,0.0003948834],"domain_scores_gemma":[0.9977574,0.0009331457,0.0004978891,0.0005697014,0.0001030601,0.0001387941],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001738864,0.0001355783,0.00007504316,0.006691072,0.001011043,9.971234e-7,0.01275889,0.00001641527,0.00114885,0.6673651,0.02457504,0.2860481],"study_design_scores_gemma":[0.01846854,0.001430076,0.00002072679,0.003537643,0.001634372,0.00001729998,0.001311306,0.07741208,0.00486318,0.3605885,0.5262817,0.004434566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007144413,0.0007572841,0.931889,0.001070348,0.002216946,0.02487929,0.002251187,0.001119766,0.02867176],"genre_scores_gemma":[0.2307187,0.0003257469,0.6030313,0.0008843403,0.01051651,0.006559646,0.001258229,0.0005513313,0.1461542],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5017067,"threshold_uncertainty_score":0.9997815,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04328389692450102,"score_gpt":0.2444305453343053,"score_spread":0.2011466484098043,"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."}}