{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00155294,0.001034571,0.001016542,0.0005992797,0.0004328658,0.001158133,0.001370152,0.001103555,0.004620937],"category_scores_gemma":[0.003049793,0.0006147464,0.0009738003,0.0007842761,0.0008299442,0.001070752,0.001133975,0.002228479,0.0004359585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086457,"about_ca_system_score_gemma":0.00163935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004351504,"about_ca_topic_score_gemma":0.003945296,"domain_scores_codex":[0.9994171,0.000272689,0.00001754462,0.00008559674,0.0001122785,0.00009491029],"domain_scores_gemma":[0.9984871,0.001096888,0.0001232518,0.0000636822,0.0001671862,0.00006181598],"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.00001765475,0.00001807931,0.00007788814,0.00004334198,0.000008077576,0.0000444795,0.00001872211,0.9842007,0.0003237537,0.008874462,0.0007337302,0.00563912],"study_design_scores_gemma":[0.000004204057,0.000009834803,0.00001161665,0.000004052722,0.000002924712,0.000007340639,0.000006122703,0.9955817,0.0000915597,0.003981183,0.0002977574,0.000001655226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00635489,0.0002043956,0.9885709,0.0002661751,0.00003630033,0.00007708635,0.0001091163,0.0001212873,0.004259919],"genre_scores_gemma":[0.4723682,0.0007879045,0.51885,0.0003491069,0.0001209828,0.0008243825,0.0005093153,0.0001989037,0.005991204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004620937,"threshold_uncertainty_score":0.01545858,"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."}}