{"id":"W2123732273","doi":"10.1109/milcom.1989.103926","title":"Application of stochastic automaton theory for routing in a packet-switched network","year":2003,"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":"McGill University","funders":"","keywords":"Shortest path problem; Computer science; Routing (electronic design automation); Equal-cost multi-path routing; Network packet; Queue; Private Network-to-Network Interface; Automaton; K shortest path routing; Link-state routing protocol; Static routing; Constrained Shortest Path First; Algorithm; Computer network; Theoretical computer science; Routing protocol; 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.0008446875,0.00007905479,0.0001446726,0.00003598105,0.00004092484,0.00001984958,0.0002330776,0.00004603881,0.000005058397],"category_scores_gemma":[0.00007106857,0.00007104583,0.00004222689,0.0003034514,0.00001671395,0.00009131347,0.00002043934,0.00005192777,0.000006257595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001855092,"about_ca_system_score_gemma":0.00005265034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002890696,"about_ca_topic_score_gemma":0.00001038985,"domain_scores_codex":[0.9991633,0.00007652477,0.0002376824,0.0002133889,0.00008893284,0.0002201261],"domain_scores_gemma":[0.9991049,0.0004596842,0.00009635831,0.0002535644,0.00005003128,0.00003548729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008152148,0.0000221807,0.0001551714,0.000003779465,0.000004998388,9.259193e-8,0.00008540667,0.01923708,0.0000458658,0.8494433,0.00006667146,0.1309274],"study_design_scores_gemma":[0.000542067,0.0000288988,0.0002704395,0.00001541922,0.000003921204,0.000001364488,0.00002813086,0.951114,0.00005538947,0.04770646,0.000148353,0.0000855787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004148852,0.00007167189,0.9940916,0.0001365919,0.0001066505,0.0004023109,2.865095e-7,0.0001148663,0.0009272117],"genre_scores_gemma":[0.9664439,5.682577e-7,0.03317765,0.0001375284,0.00003718007,0.0001102887,9.578278e-7,0.000005331869,0.00008659354],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9622951,"threshold_uncertainty_score":0.2897165,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007834335224280928,"score_gpt":0.2280088901083067,"score_spread":0.2201745548840258,"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."}}