{"id":"W2067366494","doi":"10.1016/j.jpdc.2008.01.001","title":"On the complexity and algorithm of grooming regular traffic in WDM optical networks","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Traffic grooming; Synchronous optical networking; Computer science; Wavelength-division multiplexing; Multiplexing; Multiplexer; Upper and lower bounds; Algorithm; Channel (broadcasting); Computer network; Time complexity; Wavelength; Mathematics; Telecommunications","routes":{"ca_aff":true,"ca_fund":true,"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.0002259544,0.0001186366,0.0003027015,0.00005282626,0.00007886317,0.0000119251,0.0001214243,0.00008155732,0.000001200141],"category_scores_gemma":[0.00009845962,0.00008480813,0.0000432875,0.0001841791,0.0002969222,0.00005338582,0.000057937,0.000457601,1.183854e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002793995,"about_ca_system_score_gemma":0.000005807473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.849886e-7,"about_ca_topic_score_gemma":0.00000115695,"domain_scores_codex":[0.9991592,0.00002469177,0.0004098956,0.00008369672,0.0001086191,0.0002138681],"domain_scores_gemma":[0.9993093,0.0004092694,0.0001028826,0.0000853461,0.00003747578,0.00005570358],"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.00002069663,0.00002504768,0.0003548914,0.00001120233,0.00002373349,0.00006299676,0.00004636308,0.9720032,0.00001822361,0.004603124,0.0001196293,0.02271092],"study_design_scores_gemma":[0.0004948087,0.00009696268,0.01165781,0.0001228389,0.000008604036,0.0002321538,0.0001442137,0.9830379,0.00001501898,0.004071895,0.00002430797,0.00009347797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5748588,0.0008517716,0.4240273,0.0001397597,0.00003779207,0.00003800005,0.000001733987,0.00002493928,0.00001991465],"genre_scores_gemma":[0.9448172,0.0002615039,0.05484807,0.00001185057,0.00005138596,3.416564e-7,0.000001662456,0.000007560255,4.159464e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3699584,"threshold_uncertainty_score":0.3458375,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02036499625000479,"score_gpt":0.2189781675200836,"score_spread":0.1986131712700789,"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."}}