{"id":"W2949525853","doi":"10.48550/arxiv.1302.7028","title":"Shortest Path versus Multi-Hub Routing in Networks with Uncertain Demand","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; University of British Columbia","funders":"","keywords":"Computer science; Shortest path problem; Routing (electronic design automation); Equal-cost multi-path routing; Mathematical optimization; Generalization; Tree (set theory); Static routing; Network planning and design; Heuristic; Distributed computing; Operations research; Computer network; Routing protocol; Mathematics; Theoretical computer science; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001080663,0.0004912168,0.000480054,0.0001970186,0.00006835332,0.00004966907,0.0006555833,0.0006203948,0.00002015553],"category_scores_gemma":[0.00004949595,0.0005210347,0.00008853316,0.0006102877,0.00018773,0.0002039587,0.0006234659,0.001494876,0.00002644702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004747312,"about_ca_system_score_gemma":0.00003136562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000911888,"about_ca_topic_score_gemma":0.0004278878,"domain_scores_codex":[0.9982197,0.00003699055,0.0002413776,0.0007463006,0.00006684864,0.0006888281],"domain_scores_gemma":[0.9987658,0.0002218496,0.00008959012,0.0007370785,0.00006078301,0.0001248696],"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.00005466694,0.0000290078,0.008882232,0.00003415012,0.00008150447,0.0003584556,0.00003066564,0.9850718,0.000003935283,0.004757761,0.0000358231,0.0006600136],"study_design_scores_gemma":[0.001081422,0.0000527538,0.001816046,0.0002795533,0.00005902663,0.000001698908,0.000236195,0.9947247,0.000008027414,0.001075132,0.00004445461,0.0006209921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4819073,0.0002280551,0.5149199,0.000008931544,0.0003439596,0.0004316537,0.000005700272,0.001090061,0.001064486],"genre_scores_gemma":[0.9866862,0.0006884017,0.01233357,0.000007970571,0.00006428221,0.000005998275,0.00002565506,0.00007731159,0.0001105937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5047789,"threshold_uncertainty_score":0.9997241,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0519402430498451,"score_gpt":0.1829045160151725,"score_spread":0.1309642729653274,"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."}}