{"id":"W2122575460","doi":"10.1109/icc.2001.936616","title":"Multiple path routing in networks with inaccurate link state information","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Private Network-to-Network Interface; Equal-cost multi-path routing; Static routing; Shortest path problem; Multipath routing; Network topology; Routing protocol; Path vector protocol; Dynamic Source Routing; Routing domain; Routing (electronic design automation); Destination-Sequenced Distance Vector routing; Policy-based routing; Distributed computing; Topology (electrical circuits); Mathematics; Theoretical computer science; Graph","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.0001846364,0.0001029208,0.0001066107,0.00006496295,0.00006581034,0.0001890902,0.0002701796,0.00003741146,0.00001954158],"category_scores_gemma":[0.00001632553,0.00007912356,0.00001766487,0.0004061428,0.00001420484,0.001324766,0.00005348713,0.0001585273,0.00007127932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002731574,"about_ca_system_score_gemma":0.00001337312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004392817,"about_ca_topic_score_gemma":0.0001266633,"domain_scores_codex":[0.9991574,0.0000384673,0.0002453896,0.0001446402,0.0001387193,0.0002754441],"domain_scores_gemma":[0.9994806,0.00009499157,0.00008940661,0.000216788,0.0000575175,0.0000606799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007514241,0.00001302553,0.004074899,0.000001393246,0.000004104172,0.000006848404,0.000665716,0.1875789,3.887245e-7,0.00475974,0.0003288221,0.8025587],"study_design_scores_gemma":[0.0008402779,0.00004855009,0.003283214,0.00002086123,0.000001038285,0.000004700832,0.00002086356,0.9942116,0.00000259787,0.00003829572,0.001404144,0.0001238357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01527996,0.00003925434,0.9803434,0.0009000852,0.0001161612,0.0001650775,3.165881e-7,0.0002220091,0.002933745],"genre_scores_gemma":[0.9916502,0.00002946406,0.00726427,0.0007643002,0.00004503476,0.00001671719,0.000001974296,0.000003525234,0.0002245185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9763702,"threshold_uncertainty_score":0.3226565,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00811868541328669,"score_gpt":0.1738082920769868,"score_spread":0.1656896066637001,"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."}}