{"id":"W2141116537","doi":"10.1109/glocom.2004.1378109","title":"Design of edge-disjoint path protected WDM networks: asymptotic optimality of shortest path","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Shortest path problem; Heuristic; Mathematical optimization; Disjoint sets; Routing (electronic design automation); Equal-cost multi-path routing; Linear programming; Path (computing); Computer science; Wavelength-division multiplexing; K shortest path routing; Link-state routing protocol; Topology (electrical circuits); Mathematics; Computer network; Discrete mathematics; Combinatorics; Routing protocol; Theoretical computer science; Wavelength; Graph","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.0002097675,0.0002366114,0.0004208312,0.00007008587,0.00002364155,0.000007907074,0.0002803913,0.0002005416,0.00007475298],"category_scores_gemma":[0.0001338753,0.0002068816,0.00007196928,0.0004173254,0.0001638239,0.0001443959,0.00009319765,0.0002846719,0.000008724866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000733831,"about_ca_system_score_gemma":0.00001536929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003448876,"about_ca_topic_score_gemma":0.000003026049,"domain_scores_codex":[0.9985967,0.00003026616,0.0005607546,0.0002244855,0.0001800293,0.0004077606],"domain_scores_gemma":[0.9990862,0.000174677,0.00007782711,0.0005018674,0.00009373476,0.00006569599],"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.000015411,0.00006624452,0.0001970013,0.00004122564,0.00003765742,0.00000231385,0.00001776524,0.9784157,0.003465734,0.001406005,0.0002036028,0.01613134],"study_design_scores_gemma":[0.0002269114,0.0001557253,0.001257944,0.00009208848,0.00002158815,0.000003593744,0.00003602229,0.9889905,0.008058368,0.0008467029,0.00006501704,0.0002455311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01838736,0.0005565633,0.9776103,0.00003827687,0.00006225174,0.0006270098,0.000003712697,0.001159607,0.001554934],"genre_scores_gemma":[0.6019288,0.0001000608,0.397846,0.00000654818,0.00003608803,0.00003516108,0.000002497512,0.00002793315,0.00001689383],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5835414,"threshold_uncertainty_score":0.8436388,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01396470828690831,"score_gpt":0.2140604374559635,"score_spread":0.2000957291690552,"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."}}