{"id":"W1955612129","doi":"10.1109/mascot.1998.693680","title":"Approaches to link-state alternate path routing in connection-oriented networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Distributed computing; Routing protocol; Static routing; Dynamic Source Routing; Routing (electronic design automation); Path vector protocol; Policy-based routing; Path (computing); Equal-cost multi-path routing","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.0002980084,0.0001454965,0.0001653679,0.00009751291,0.00009081334,0.0001337703,0.0004137795,0.00005002798,0.00004237029],"category_scores_gemma":[0.0000249418,0.0001318074,0.00004644312,0.0006210377,0.00001432584,0.0002399904,0.0001224382,0.0001916841,0.0001105818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004049021,"about_ca_system_score_gemma":0.000007588759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000498953,"about_ca_topic_score_gemma":0.00009342479,"domain_scores_codex":[0.9986148,0.00007701858,0.0002894687,0.0004405869,0.0001643037,0.0004138272],"domain_scores_gemma":[0.9993286,0.0001087843,0.00005835057,0.0003274785,0.00003200367,0.0001448345],"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.000006614428,0.0000507512,0.002405077,0.000001270722,0.00001197327,0.00002287681,0.0006519404,0.2122156,0.000002827834,0.08831505,0.0007214067,0.6955946],"study_design_scores_gemma":[0.0004585281,0.00004699532,0.0006272392,0.00001945422,0.000001716618,0.000008387208,0.00002572607,0.9967428,0.00001006221,0.0002451667,0.001641341,0.0001725876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01781016,0.0001003318,0.9711001,0.00347035,0.0006204513,0.0002334438,3.342802e-7,0.0003161171,0.006348731],"genre_scores_gemma":[0.9902067,0.00002140394,0.006522151,0.001102188,0.0002003465,0.00003605907,9.420161e-7,0.000008964369,0.001901203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9723966,"threshold_uncertainty_score":0.537495,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04617681811543407,"score_gpt":0.2044559585630178,"score_spread":0.1582791404475838,"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."}}