{"id":"W2119278397","doi":"10.1109/icc.2008.993","title":"Sizing Eligible Route Sets for Restorable Network Design and Optimization","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Sizing; Set (abstract data type); Path (computing); Network planning and design; Variety (cybernetics); Range (aeronautics); Test set; Linear programming; Mathematical optimization; Distributed computing; Computer network; Algorithm; Artificial intelligence; Engineering; 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.00006905421,0.00009966073,0.0001169811,0.0000278196,0.0001153455,0.00001381833,0.00006406019,0.00008800711,0.000004658993],"category_scores_gemma":[0.00004575217,0.00009606835,0.00001530408,0.0001559098,0.0000370613,0.0001567328,0.00002429137,0.00006989023,0.000002784214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003288168,"about_ca_system_score_gemma":0.000005231202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.672543e-7,"about_ca_topic_score_gemma":9.045024e-7,"domain_scores_codex":[0.9994344,0.000005114681,0.0001167623,0.0001264011,0.00004731513,0.0002699904],"domain_scores_gemma":[0.9996415,0.0001645069,0.00001162356,0.0001249029,0.00002222431,0.00003520505],"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.000006302789,0.000001954561,0.00006396767,0.000009227952,0.000007328135,0.000001749708,0.000008266967,0.9929627,0.00004112841,0.001297482,0.003922863,0.001677049],"study_design_scores_gemma":[0.0001614455,0.00003294309,0.00001381387,0.00001271692,0.000004851866,0.000007670007,0.00001106582,0.9937445,0.0004234805,0.003265749,0.002192754,0.0001290126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001785875,0.001127694,0.9945112,0.00005070077,0.00008890255,0.0002710937,5.851018e-7,0.001268626,0.0008952514],"genre_scores_gemma":[0.04434977,0.001089181,0.9542593,0.00003086031,0.00005095251,0.00004465503,0.000003582116,0.00002980634,0.000141836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04256389,"threshold_uncertainty_score":0.3917553,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02914132386069989,"score_gpt":0.2394998266192136,"score_spread":0.2103585027585137,"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."}}