{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005332273,0.0001700889,0.0001693391,0.00004588095,0.00002867205,0.00003120928,0.000147527,0.0001242212,0.00004605708],"category_scores_gemma":[0.00004390056,0.0001320127,0.00001734383,0.0002970373,0.00005715968,0.0001820305,0.00005144827,0.000301456,0.0000308751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007760489,"about_ca_system_score_gemma":0.000003833537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004546575,"about_ca_topic_score_gemma":0.0003314316,"domain_scores_codex":[0.9991134,0.000006815381,0.0001745044,0.0001797045,0.00007686998,0.0004486828],"domain_scores_gemma":[0.9995394,0.0001593498,0.00001362815,0.0002146435,0.00002005037,0.00005288429],"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.000007546163,0.00001102805,0.007724108,0.000003594177,0.000012052,0.00001262595,0.00001714943,0.9798118,0.00003823857,0.0008129153,0.0001145738,0.01143433],"study_design_scores_gemma":[0.0006665565,0.00005051688,0.005283924,0.00003889628,0.000004074693,0.000001687504,0.0002548513,0.9932929,0.00004371209,0.00009370675,0.00005509102,0.0002140691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2445373,0.0003080678,0.7477355,0.00006870644,0.000161778,0.0003926598,4.532178e-7,0.001815131,0.004980426],"genre_scores_gemma":[0.8639804,0.00005924935,0.1357815,0.00001681045,0.00002938047,0.00005240307,0.000002482656,0.00003052656,0.00004731765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6194431,"threshold_uncertainty_score":0.5383323,"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."}}