{"id":"W2067201651","doi":"10.1109/infcom.2013.6566857","title":"Shortest path versus multi-hub routing in networks with uncertain demand","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; University of British Columbia","funders":"","keywords":"Computer science; Routing (electronic design automation); Shortest path problem; Equal-cost multi-path routing; Static routing; Mathematical optimization; Multipath routing; Tree (set theory); Generalization; Network planning and design; Distributed computing; Computer network; Routing protocol; Mathematics; 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.003818789,0.001064973,0.0007870785,0.0009106221,0.0004829586,0.001057368,0.001209363,0.001299333,0.002021319],"category_scores_gemma":[0.01519448,0.0004958886,0.0005939952,0.0009387594,0.00135844,0.003404283,0.0009364331,0.001330599,0.0001502582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001712008,"about_ca_system_score_gemma":0.0006092326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002376424,"about_ca_topic_score_gemma":0.00191652,"domain_scores_codex":[0.9982738,0.000936161,0.00005809428,0.0003275864,0.0002116974,0.0001926132],"domain_scores_gemma":[0.9882044,0.008713435,0.001543157,0.000729288,0.0005220256,0.0002878213],"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.00005578239,0.00001756053,0.0004921127,0.00004181189,0.0000171743,0.00002563809,0.00002404563,0.9698665,0.0006104571,0.02162191,0.0002644251,0.006962599],"study_design_scores_gemma":[0.000006197948,0.00004855188,0.0002225178,0.000005709758,0.000007028456,0.0000177516,0.00002423875,0.9740943,0.0004107223,0.02488251,0.000272853,0.000007528302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1215056,0.0005336681,0.873458,0.000574459,0.00003950824,0.00006334786,0.0002282706,0.0001500057,0.003447129],"genre_scores_gemma":[0.9203382,0.0004400933,0.0776539,0.00008374292,0.00004482547,0.00006518958,0.000142031,0.00005098473,0.001180916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003818789,"threshold_uncertainty_score":0.02019596,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0137903905186623,"score_gpt":0.2202089847323197,"score_spread":0.2064185942136574,"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."}}