{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007379659,0.0001224748,0.0001194233,0.00004730156,0.00008741413,0.00004061053,0.00005651257,0.0001502316,0.000005116552],"category_scores_gemma":[0.00003586045,0.0001155862,0.00002202458,0.0002043462,0.00003817304,0.00007547167,0.00002293334,0.0001484413,0.000003660042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001459085,"about_ca_system_score_gemma":0.000007046891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004473955,"about_ca_topic_score_gemma":0.00003199271,"domain_scores_codex":[0.9993255,0.000003053472,0.0001507209,0.0001608001,0.00008073636,0.0002791825],"domain_scores_gemma":[0.9997295,0.00004996524,0.00001331948,0.0001084624,0.00004333047,0.00005544675],"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.000009714565,0.00001285449,0.00001901692,0.00001096204,0.000006127487,7.040981e-7,0.0000172019,0.981458,0.0003326224,0.009141336,0.0001600814,0.008831399],"study_design_scores_gemma":[0.0003704435,0.0001120506,0.0002167845,0.00002186504,0.000007613219,0.00000557595,0.00006030874,0.9967448,0.0004196891,0.001520689,0.0003720115,0.0001482113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06474201,0.0001888274,0.9331151,0.00008767886,0.0001518313,0.0002949614,0.000002029125,0.001101063,0.0003165282],"genre_scores_gemma":[0.6307607,0.0000283052,0.368989,0.0000119669,0.00008684323,0.00006473989,0.000009913448,0.00002326568,0.00002527932],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5660187,"threshold_uncertainty_score":0.4713468,"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."}}