{"id":"W2544267666","doi":"10.1109/rndm.2016.7608268","title":"ILP-based heuristic method for the multi-period survivable network augmentation problem","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Integer programming; Heuristic; Computer science; Mathematical optimization; Linear programming; Integer (computer science); Algorithm; 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.0002433707,0.0001435728,0.0001398775,0.00002202514,0.0001048505,0.00002334093,0.0001938083,0.00008025501,0.00006013538],"category_scores_gemma":[0.0001133561,0.00007604293,0.00005040354,0.0001440088,0.00005254364,0.00008444774,0.00002713973,0.00007391389,0.00002558339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006521223,"about_ca_system_score_gemma":0.000008903075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003939185,"about_ca_topic_score_gemma":0.0000446934,"domain_scores_codex":[0.999171,0.00001826823,0.0001903152,0.0001688686,0.00008238215,0.000369159],"domain_scores_gemma":[0.9985126,0.001120236,0.00002429467,0.0002732487,0.00003787897,0.00003177393],"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.00002353768,0.00001545544,0.0001773695,0.0000428493,0.00004622886,8.210112e-7,0.000007960731,0.8686401,0.001699567,0.0210111,0.004225067,0.1041099],"study_design_scores_gemma":[0.0008987036,0.00005210483,0.0001907208,0.00004110962,0.00002746021,9.866566e-7,0.00003176634,0.9724687,0.002589095,0.01218749,0.01129181,0.0002200051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001936906,0.0001630983,0.9963477,0.000814238,0.0001892362,0.0005951641,0.000006882356,0.001207822,0.0004822276],"genre_scores_gemma":[0.05742857,0.0000303013,0.9414027,0.00008090444,0.00008090797,0.0003677397,0.000003446679,0.00004111619,0.000564253],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1038899,"threshold_uncertainty_score":0.3100941,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02012000260206864,"score_gpt":0.2757686971073137,"score_spread":0.2556486945052451,"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."}}