{"id":"W2122183147","doi":"10.1109/jsac.2006.1613770","title":"Design of WDM networks under economy of scale pricing and shortest path routing","year":2006,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Shortest path problem; Equal-cost multi-path routing; Computer science; Constrained Shortest Path First; Private Network-to-Network Interface; K shortest path routing; Link-state routing protocol; Topology (electrical circuits); Mathematical optimization; Routing (electronic design automation); Network topology; Computer network; Mathematics; Routing protocol; Combinatorics; Theoretical computer science","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.001293765,0.0005815593,0.0007815477,0.0004203978,0.0004328947,0.001112685,0.001191309,0.0008556047,0.00156502],"category_scores_gemma":[0.002787265,0.0006252654,0.0003853778,0.0006125701,0.0008876532,0.001404804,0.001187481,0.0006521223,0.0001923078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001630015,"about_ca_system_score_gemma":0.001442444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009821674,"about_ca_topic_score_gemma":0.001146795,"domain_scores_codex":[0.9990765,0.0003805185,0.00002694992,0.000124736,0.0002469601,0.0001443063],"domain_scores_gemma":[0.9994135,0.0002707268,0.0001231632,0.00005480853,0.0000881573,0.00004958479],"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.00005532681,0.0000390416,0.0002835737,0.00009084415,0.00002259421,0.00008088211,0.00004399921,0.9183808,0.005264131,0.05466016,0.0007099819,0.02036868],"study_design_scores_gemma":[0.00001650941,0.00003914851,0.00007256684,0.000005353047,0.000006580362,0.00001720655,0.00001569853,0.9802838,0.0006118201,0.01812694,0.0008000609,0.00000432502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0963287,0.0004189281,0.8906949,0.0005875474,0.00005103943,0.0002090728,0.00009419245,0.0002116789,0.01140398],"genre_scores_gemma":[0.8084393,0.0005070504,0.186518,0.0001163939,0.00005435134,0.0003274837,0.00006300442,0.00006918937,0.003905363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001630015,"threshold_uncertainty_score":0.01182657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01841689077588731,"score_gpt":0.2394966195544701,"score_spread":0.2210797287785828,"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."}}