{"id":"W2171275970","doi":"10.1109/26.864163","title":"Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles (\"p-cycles\")","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Spare part; Bounding overwatch; Computer science; Set (abstract data type); Upper and lower bounds; Work (physics); Computer network; Span (engineering); Mathematical optimization; Mathematics; Engineering; Structural engineering; Operations management; Artificial intelligence","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.002886326,0.0006056221,0.0005336122,0.001938691,0.001014328,0.002323458,0.001975917,0.001307354,0.006234109],"category_scores_gemma":[0.0181292,0.0006251929,0.000635517,0.001425073,0.005047152,0.005457556,0.002054706,0.001915076,0.0008153411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001788655,"about_ca_system_score_gemma":0.0009404411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001070815,"about_ca_topic_score_gemma":0.0005530284,"domain_scores_codex":[0.998268,0.0003885776,0.0001164916,0.0002924886,0.0006629474,0.0002714243],"domain_scores_gemma":[0.9863435,0.01007601,0.0006875028,0.001713782,0.0009389579,0.0002401526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004529317,0.00004641735,0.0003131927,0.0001048928,0.000008759095,0.00006010988,0.0001128581,0.06654831,0.002384924,0.9145548,0.0008891247,0.01493145],"study_design_scores_gemma":[0.0000275535,0.00009541173,0.0003872328,0.00007252018,0.00001490735,0.0002852263,0.000084536,0.2673576,0.006772439,0.7196956,0.005175801,0.0000311165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06804574,0.001189196,0.8938932,0.001236894,0.00008797442,0.0001098466,0.0001733974,0.0002822881,0.03498149],"genre_scores_gemma":[0.8695459,0.002320297,0.1222223,0.0003777884,0.0002236287,0.0003970765,0.0001951231,0.0002226878,0.00449528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006234109,"threshold_uncertainty_score":0.02085519,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04230451188184459,"score_gpt":0.292792079495629,"score_spread":0.2504875676137844,"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."}}