{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002159785,0.0001138787,0.0002313565,0.0001607579,0.00008906765,0.00001783028,0.0003777939,0.00009894138,0.000001712941],"category_scores_gemma":[0.00004786178,0.0001143292,0.00002420835,0.0005317398,0.0001292049,0.0001158876,0.00005016044,0.0006327019,2.909325e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001003614,"about_ca_system_score_gemma":0.00002233129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006088796,"about_ca_topic_score_gemma":0.00003415358,"domain_scores_codex":[0.9990866,0.00007123235,0.0004992848,0.00007750729,0.00006509692,0.0002003214],"domain_scores_gemma":[0.998522,0.0007479091,0.0001443929,0.0004374276,0.0001178035,0.00003045591],"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.000005404762,0.00005543154,0.00407274,0.000003630114,0.0000175098,6.617228e-7,0.00002748272,0.9892113,0.00162532,0.002303712,0.00004470495,0.002632055],"study_design_scores_gemma":[0.0002803167,0.00006997617,0.017893,0.0003048799,0.00001965679,0.00003546611,0.00009797383,0.9691434,0.001365771,0.01059489,0.00003558819,0.00015909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1751876,0.001821113,0.8199742,0.0001751723,0.00005303468,0.0001973955,0.000001798935,0.0001556971,0.00243405],"genre_scores_gemma":[0.9276919,0.0008540216,0.07138575,0.00001119476,0.00002516947,0.000007077138,0.000002460365,0.00002010023,0.000002346645],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7525043,"threshold_uncertainty_score":0.4662209,"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."}}