{"id":"W2051621878","doi":"10.1109/glocom.2006.402","title":"OPN08-03: Backup Path Re-optimizations for Shared Path Protection in Multi-domain Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Concordia University","funders":"","keywords":"Backup; Computer science; Path (computing); Distributed computing; Scalability; Computer network; Path protection; Routing (electronic design automation); Domain (mathematical analysis); Mathematics; Wavelength-division multiplexing; Operating system","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":[],"consensus_categories":[],"category_scores_codex":[0.0001017814,0.0001988188,0.0002103472,0.00008913267,0.00008370847,0.0000408076,0.0001609547,0.0002293612,0.00002967277],"category_scores_gemma":[0.00006387481,0.0002111213,0.00006205244,0.000441887,0.00003994922,0.0001738099,0.00004921165,0.0002506922,0.0000168942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001930156,"about_ca_system_score_gemma":0.000007369359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002932451,"about_ca_topic_score_gemma":0.0003327217,"domain_scores_codex":[0.9988695,0.00001541943,0.0003288313,0.0002561908,0.00007990251,0.0004501466],"domain_scores_gemma":[0.9995807,0.00005927994,0.00003983255,0.0002463519,0.0000368268,0.00003701786],"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.0000107268,0.00004554886,0.0002883137,0.0000247662,0.000006914576,0.000004374805,0.00001247078,0.9909839,0.0001290404,0.001662084,0.001806977,0.005024884],"study_design_scores_gemma":[0.0006280513,0.00003775844,0.001592459,0.00005919835,0.00000587761,0.000002047982,0.00005893798,0.9870209,0.00003683506,0.006727346,0.003568089,0.0002625595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006030834,0.0003903855,0.9903759,0.0001537588,0.0002350693,0.0009533351,0.00003858686,0.001168514,0.0006536231],"genre_scores_gemma":[0.3139525,0.00006776743,0.6849446,0.00002547336,0.0001333491,0.0006041055,0.0001185803,0.00006499488,0.00008866323],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3079217,"threshold_uncertainty_score":0.8609278,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01543176107092761,"score_gpt":0.2257224338156821,"score_spread":0.2102906727447545,"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."}}