{"id":"W2099779686","doi":"10.1109/icc.2011.5962606","title":"A Branch, Price and Cut Approach for Optimal Traffic Grooming in WDM Optical Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Solver; Wavelength-division multiplexing; Computer science; Traffic grooming; Integer programming; Mathematical optimization; Network topology; Integer (computer science); Binary number; Distributed computing; Computer network; Algorithm; Mathematics","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.0001035776,0.0001707868,0.0002221184,0.00007234402,0.00002883528,0.00001615436,0.0001448053,0.0001979641,0.000009797359],"category_scores_gemma":[0.00004265755,0.0001578891,0.00003439002,0.0001976212,0.00009585382,0.0001507021,0.00006015814,0.0002593213,0.00000115765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003159278,"about_ca_system_score_gemma":0.00000299847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000106623,"about_ca_topic_score_gemma":0.000007026955,"domain_scores_codex":[0.9990245,0.000004466648,0.0002112928,0.0002400829,0.00005467813,0.0004649828],"domain_scores_gemma":[0.9996347,0.0001125576,0.00001155562,0.000162529,0.00001187358,0.00006682953],"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.00003824841,0.00004574915,0.0001217945,0.00005817108,0.00001479075,0.000003943409,0.0001219983,0.9257149,0.00005836185,0.01086467,0.00009626747,0.06286112],"study_design_scores_gemma":[0.0004058065,0.00005674804,0.0003089416,0.00001304668,0.00000768052,0.00001068869,0.0001351434,0.9980976,0.0001653627,0.0004818322,0.0001002755,0.000216895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1148546,0.0004073163,0.8765463,0.00001156489,0.00005032832,0.0003410828,5.499784e-7,0.0007558448,0.007032428],"genre_scores_gemma":[0.5262918,0.0000519209,0.4735107,0.00001027612,0.00002735755,0.00006621302,0.000001501592,0.00002307175,0.00001708321],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4114373,"threshold_uncertainty_score":0.6438531,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01770082802321512,"score_gpt":0.2082201375886486,"score_spread":0.1905193095654334,"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."}}