{"id":"W2117051385","doi":"10.1109/icccn.2004.1401576","title":"Optimal priority-based lightpath allocation for survivable WDM networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Path protection; Computer science; Wavelength-division multiplexing; Computer network; Path (computing); Integer programming; Resource allocation; Distributed computing; Linear programming; Mathematical optimization; Wavelength; Mathematics; Algorithm","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.0001009625,0.0001410606,0.0001427082,0.00004417896,0.00005322781,0.00002520848,0.0001598356,0.000151677,0.00003017719],"category_scores_gemma":[0.00003618126,0.0001340519,0.00004735528,0.0001638948,0.00003100796,0.0001516871,0.00002112277,0.0001407385,0.00002461083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008405765,"about_ca_system_score_gemma":0.000008297186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001272444,"about_ca_topic_score_gemma":0.00001879076,"domain_scores_codex":[0.9992232,0.000004302516,0.000176606,0.0001628184,0.00007715612,0.0003558989],"domain_scores_gemma":[0.9995208,0.0001290833,0.00001554825,0.0002432717,0.00004413482,0.00004717589],"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.00000734997,0.00001396141,0.00004708751,0.00001281869,0.000007939686,2.637974e-7,0.000002821794,0.9660726,0.0001755887,0.006415009,0.001161589,0.02608304],"study_design_scores_gemma":[0.0002532536,0.00003792235,0.00007701921,0.000009467395,0.000007018999,4.030586e-7,0.000009577131,0.9628441,0.003444689,0.0002463112,0.03289181,0.0001783806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01272959,0.0003161479,0.9817308,0.0003580121,0.0001305287,0.0002960322,0.000001933736,0.002092113,0.00234486],"genre_scores_gemma":[0.4605225,0.00004078599,0.5389218,0.000065384,0.000161206,0.00006476268,0.00001469509,0.00002924998,0.0001796685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4477929,"threshold_uncertainty_score":0.5466477,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009063804064742956,"score_gpt":0.2256686357754354,"score_spread":0.2166048317106924,"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."}}