{"id":"W2152595820","doi":"10.1155/2012/546301","title":"ILP Model and Relaxation-Based Decomposition Approach for Incremental Topology Optimization in<i>p</i>-Cycle Networks","year":2012,"lang":"en","type":"article","venue":"Journal of Computer Networks and Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Survivability; Network topology; Computer science; Decomposition; Relaxation (psychology); Set (abstract data type); Topology (electrical circuits); Mathematical optimization; Mathematics; Computer network","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.0002391027,0.0001010948,0.0001822814,0.00009413315,0.0001079456,0.00002810498,0.0002025907,0.0001170832,5.551386e-7],"category_scores_gemma":[0.000007152596,0.00009943508,0.00003369525,0.0001265077,0.00009424407,0.000267868,0.00009323965,0.0002843528,2.84429e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004677226,"about_ca_system_score_gemma":0.000006178076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.8126e-7,"about_ca_topic_score_gemma":0.000002732814,"domain_scores_codex":[0.9993218,0.00003785644,0.0003428066,0.00006162783,0.00004827063,0.0001875967],"domain_scores_gemma":[0.9992927,0.0002485242,0.0001176061,0.0002250046,0.00005592335,0.00006025662],"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.0000135064,0.00005544591,0.001029696,0.00000756686,0.00001650602,7.088049e-8,0.00003491684,0.9858301,0.000003807433,0.002826041,0.00009531721,0.01008697],"study_design_scores_gemma":[0.0004696108,0.00005193409,0.000690749,0.00003125581,0.00002175448,0.00001426848,0.00002653992,0.9978389,0.000001408516,0.0006942591,0.00006198796,0.00009736296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00889406,0.004636406,0.9858973,0.0001914713,0.00008771085,0.0001579692,0.000001023663,0.00004605963,0.00008800632],"genre_scores_gemma":[0.5355102,0.00119383,0.4631346,0.00005643673,0.00006944337,0.00001170611,0.00001457241,0.000008892586,3.417609e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5266161,"threshold_uncertainty_score":0.4054845,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01390469748092558,"score_gpt":0.2519544971366065,"score_spread":0.2380497996556809,"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."}}