{"id":"W2160877011","doi":"10.1109/icccn.2007.4317824","title":"A Min-Max Optimization Problem on Traffic Grooming in WDM Optical Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Traffic grooming; Synchronous optical networking; Wavelength-division multiplexing; Multiplexing; Computer science; Multiplexer; Computer network; Upper and lower bounds; Optimization problem; Offset (computer science); Node (physics); Linear programming; Algorithm; Mathematics; Engineering; Wavelength; Telecommunications; Physics; Optics","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.0001883035,0.0001779453,0.0001810918,0.0001563519,0.00002732058,0.00002108451,0.0001450318,0.0002343653,0.00003628219],"category_scores_gemma":[0.00005399221,0.0001683365,0.00003376279,0.0005018411,0.00005042903,0.0001171245,0.00003403164,0.0003881982,0.00001433811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001385468,"about_ca_system_score_gemma":0.00000324799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.314568e-7,"about_ca_topic_score_gemma":0.00005364783,"domain_scores_codex":[0.9988223,0.000005175452,0.0003112946,0.0002125244,0.0001194879,0.0005292117],"domain_scores_gemma":[0.9995,0.0002143229,0.00001510559,0.000189456,0.00001509978,0.0000659892],"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.00001527611,0.00003066137,0.00003142477,0.000008870748,0.000003970326,0.0000228662,0.00001469388,0.9222986,0.00002547173,0.005170713,0.0001066365,0.07227084],"study_design_scores_gemma":[0.000264096,0.00006685764,0.00007644584,0.00005227544,0.000003481413,0.000003521973,0.00007004098,0.9985611,0.00017992,0.000264605,0.0002491817,0.0002084218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02942597,0.0001237899,0.9477226,0.0001068789,0.0001206754,0.0002527433,1.857595e-7,0.001484726,0.02076246],"genre_scores_gemma":[0.5936173,0.00004701061,0.4061679,0.0000299054,0.00005006139,0.00001235648,0.000003096146,0.00003091184,0.0000414953],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5641913,"threshold_uncertainty_score":0.6864563,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00656918711677624,"score_gpt":0.2110454225543979,"score_spread":0.2044762354376217,"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."}}