{"id":"W2107810785","doi":"10.1109/icc.2003.1204623","title":"Efficient path selection and fast restoration algorithms for shared restorable optical networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Path (computing); Node (physics); Selection (genetic algorithm); Distributed computing; Computer network; Optical mesh network; Routing (electronic design automation); Selection algorithm; Algorithm; Resource (disambiguation); Mesh networking; Routing protocol; Protocol (science); Wireless mesh network; Telecommunications; 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.001319512,0.0005458702,0.0004548008,0.0007108136,0.0006077833,0.0005460877,0.0008776171,0.0006113945,0.00105299],"category_scores_gemma":[0.002827777,0.0003209533,0.0002477924,0.0006439642,0.0008047678,0.001577062,0.0008431527,0.0007364879,0.0001963743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006390114,"about_ca_system_score_gemma":0.0007423621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001340432,"about_ca_topic_score_gemma":0.001805231,"domain_scores_codex":[0.9994922,0.0001570728,0.00002280017,0.00007148259,0.0001969189,0.0000595347],"domain_scores_gemma":[0.9985709,0.000757598,0.0002271509,0.0002039944,0.0002014168,0.00003897763],"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.000287793,0.00009576825,0.000734052,0.00008866479,0.00004138068,0.00005857702,0.0001630083,0.7584713,0.0144075,0.02486102,0.001540689,0.1992503],"study_design_scores_gemma":[0.00007640995,0.0001154105,0.0002268525,0.000007220498,0.00001345,0.00006255532,0.00003054066,0.9769061,0.004533241,0.01661124,0.001401634,0.00001537521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04718298,0.0004068308,0.9508306,0.0001139817,0.00002815312,0.00005318443,0.00002430893,0.0004666883,0.0008933294],"genre_scores_gemma":[0.5059631,0.0003322866,0.4916829,0.00004526435,0.00004805122,0.000162406,0.00008079963,0.00005902391,0.00162611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001340432,"threshold_uncertainty_score":0.006978333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01175378511342003,"score_gpt":0.2289644263544958,"score_spread":0.2172106412410758,"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."}}