{"id":"W2472435054","doi":"","title":"Survivable Traffic Grooming for Scheduled Demands","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Traffic grooming; Computer network; Computer science; Network topology; Path protection; Integer programming; Distributed computing; Set (abstract data type); Routing (electronic design automation); Wavelength-division multiplexing","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.00007595008,0.00009693397,0.0001172084,0.00003864944,0.00004277397,0.00001717804,0.0001398155,0.0001254386,0.0000703714],"category_scores_gemma":[0.00009702841,0.00008673842,0.0000376151,0.0001082348,0.00003495768,0.00009605168,0.00002082724,0.0001967375,0.00001943415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009674713,"about_ca_system_score_gemma":0.000002901859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.664551e-7,"about_ca_topic_score_gemma":0.0000454853,"domain_scores_codex":[0.9994593,0.000001147967,0.0001120827,0.0001107861,0.00004470408,0.0002719346],"domain_scores_gemma":[0.9996178,0.0001315252,0.000006994464,0.0001876479,0.00001883589,0.00003716897],"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.00002339007,0.00005083238,0.0004650027,0.0001617024,0.0000835331,0.000004235923,0.0000340333,0.5029836,0.09342996,0.1851896,0.003776976,0.2137971],"study_design_scores_gemma":[0.000446059,0.0000322476,0.0001203978,0.00000743514,0.000009728702,0.000003615455,0.0000736826,0.9587942,0.01477304,0.006238603,0.01921226,0.0002887645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6904657,0.00006137441,0.3007539,0.00007432641,0.0003999568,0.0001756683,0.000001353124,0.002602969,0.00546469],"genre_scores_gemma":[0.6644126,0.00000785896,0.3352833,0.000009448652,0.00005813013,0.00003582867,0.000001850674,0.00002222044,0.0001687958],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4558105,"threshold_uncertainty_score":0.353709,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007831167216415214,"score_gpt":0.2189164093496309,"score_spread":0.2110852421332156,"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."}}