{"id":"W4383888063","doi":"10.1080/03155986.2023.2228021","title":"An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks","year":2023,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Mathematical optimization; Computer science; Path (computing); Shortest path problem; Network topology; Routing (electronic design automation); Disjoint sets; Backup; Network planning and design; Topology (electrical circuits); Computer network; Mathematics; Theoretical computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001130473,0.0009037426,0.001033195,0.001544398,0.0005559436,0.001235918,0.001272375,0.001148055,0.004201045],"category_scores_gemma":[0.003236085,0.0005353109,0.0009548836,0.00151266,0.0007774786,0.001208377,0.001059907,0.001007493,0.0008071332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008531985,"about_ca_system_score_gemma":0.001188203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002159899,"about_ca_topic_score_gemma":0.002483504,"domain_scores_codex":[0.9992697,0.0002877112,0.00003115596,0.00009722602,0.0002424195,0.00007176125],"domain_scores_gemma":[0.9993242,0.0004007818,0.00006591171,0.00009363602,0.00009389293,0.00002163491],"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.00003608941,0.00003030192,0.0001449445,0.0001214698,0.0000265278,0.00004603135,0.00006823376,0.8961517,0.001928839,0.03270013,0.000877701,0.06786802],"study_design_scores_gemma":[0.000008919797,0.00002655633,0.00005279896,0.00001233968,0.000005450083,0.00004105925,0.00002339285,0.9799329,0.0005802887,0.01816174,0.001146765,0.00000791975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004586785,0.0001155945,0.9930851,0.0000500157,0.00001411001,0.00003755475,0.00004129644,0.0001290334,0.001940449],"genre_scores_gemma":[0.1302008,0.0002254309,0.8666647,0.00007339926,0.00002770449,0.000207775,0.0001896925,0.0001270402,0.002283473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004201045,"threshold_uncertainty_score":0.01405394,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06359307509712223,"score_gpt":0.3358745591270556,"score_spread":0.2722814840299334,"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."}}