{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001467433,0.001042866,0.0009852757,0.0005316949,0.0003561122,0.0008380373,0.0008966223,0.0008455503,0.001665813],"category_scores_gemma":[0.004658306,0.0006082701,0.0004039407,0.0006247864,0.0009015056,0.00114008,0.0009361887,0.000779473,0.0002565729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071214,"about_ca_system_score_gemma":0.001189394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006588274,"about_ca_topic_score_gemma":0.0009106814,"domain_scores_codex":[0.9991769,0.0003511019,0.00002259651,0.000107798,0.0002406343,0.0001009812],"domain_scores_gemma":[0.999005,0.0006261974,0.0001709494,0.00006250503,0.00009228277,0.00004308788],"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.00003434209,0.00002799025,0.0001616202,0.00009115039,0.00001627542,0.00003192943,0.00002991713,0.9645487,0.002523007,0.01419036,0.000402403,0.01794225],"study_design_scores_gemma":[0.00001862934,0.00005756601,0.00005284167,0.000009293988,0.000006732681,0.00001601233,0.00001032298,0.9874724,0.0009113562,0.01075961,0.0006819119,0.00000330708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04235419,0.0003538294,0.9519535,0.0002159819,0.00002290749,0.0001006087,0.00005765756,0.0001591102,0.004782107],"genre_scores_gemma":[0.5857496,0.0008577305,0.4098582,0.0001225115,0.00006663058,0.0004283304,0.0001520799,0.000121375,0.002643572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001665813,"threshold_uncertainty_score":0.007772267,"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."}}