{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00295284,0.0008574766,0.001234197,0.000816493,0.0009764131,0.00105935,0.001092867,0.0008637629,0.0004657342],"category_scores_gemma":[0.01083821,0.0005379808,0.0003621626,0.00178717,0.001043134,0.004047927,0.0007295235,0.0006806708,0.0001342267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008912074,"about_ca_system_score_gemma":0.0005876216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002111598,"about_ca_topic_score_gemma":0.002139949,"domain_scores_codex":[0.9987765,0.0005795949,0.00004633433,0.0001374522,0.0002933401,0.0001667119],"domain_scores_gemma":[0.9911383,0.006750986,0.000953355,0.0006953336,0.0003873456,0.00007470309],"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.0000934198,0.00002442504,0.0007990852,0.00006294787,0.00003602616,0.0001085862,0.00006436798,0.9749467,0.003290407,0.004928999,0.0002092286,0.01543578],"study_design_scores_gemma":[0.00000806079,0.00005220167,0.0002552823,0.000005495361,0.00001330745,0.00007689991,0.00001803027,0.9915553,0.00171824,0.006016782,0.0002715145,0.000009064666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3982206,0.001818794,0.5973218,0.0003763337,0.00006175871,0.00005358024,0.0001077751,0.000445218,0.001594109],"genre_scores_gemma":[0.938932,0.0009175861,0.05925348,0.00003670071,0.00004807115,0.00004414564,0.00008748344,0.00003292471,0.0006476801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00295284,"threshold_uncertainty_score":0.0156163,"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."}}