{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001941797,0.0001359631,0.0001785111,0.0006275875,0.0002753834,0.0004890134,0.000275591,0.0001851064,0.000004207247],"category_scores_gemma":[0.0002669827,0.0001277124,0.00002401148,0.0009009053,0.00007711044,0.002254439,0.00008826704,0.0003594504,0.00002021944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001421254,"about_ca_system_score_gemma":0.0000430072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002957896,"about_ca_topic_score_gemma":0.00001218523,"domain_scores_codex":[0.998438,0.00004934403,0.0005912781,0.0001232318,0.0003593363,0.0004388306],"domain_scores_gemma":[0.9989677,0.0003432455,0.00003747929,0.0002876198,0.0002837139,0.00008025958],"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.00001908219,0.000009207931,0.0010035,0.0001151504,0.000009146825,3.92281e-7,0.0003568593,0.9651267,0.00008810919,0.02005941,0.0009698173,0.01224261],"study_design_scores_gemma":[0.0002938774,0.00007604378,0.004495988,0.00005433694,0.000001028872,0.000004994186,0.001802055,0.9850163,0.00001647976,0.0001100684,0.007979357,0.0001494598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2842715,0.0005518302,0.696359,0.0003053388,0.0004359671,0.005026651,0.0001881544,0.001783105,0.01107834],"genre_scores_gemma":[0.9844957,0.0004062529,0.01281792,0.00001933081,0.00007842295,0.0009512159,0.001184929,0.0000185029,0.00002773651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7002242,"threshold_uncertainty_score":0.520796,"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."}}