{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005879531,0.0006676519,0.0007685756,0.0009248556,0.0006045224,0.001052031,0.0009895877,0.0007784498,0.002880114],"category_scores_gemma":[0.002164088,0.0003213201,0.001026876,0.001021725,0.001189235,0.001199215,0.0008348814,0.001425098,0.0005965917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189337,"about_ca_system_score_gemma":0.001128137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003923705,"about_ca_topic_score_gemma":0.002974188,"domain_scores_codex":[0.9994656,0.0002137476,0.00003349489,0.00005492205,0.0001993181,0.00003287302],"domain_scores_gemma":[0.9993802,0.0004047864,0.00003913337,0.00006624235,0.00009011837,0.00001955459],"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.00002287822,0.00002913024,0.0004958631,0.000105793,0.00006119044,0.0001048466,0.00008958449,0.5545353,0.002272632,0.4040616,0.001803558,0.03641768],"study_design_scores_gemma":[0.00000983856,0.0000225162,0.00007340499,0.00001243065,0.00001173612,0.0000438552,0.000008749319,0.8726992,0.0004994496,0.122604,0.0040043,0.00001060199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002727028,0.0006393215,0.9918211,0.0002150484,0.0001213032,0.00002868346,0.00003593535,0.0002549512,0.004156649],"genre_scores_gemma":[0.5043789,0.004775531,0.4791733,0.0003108966,0.0004119856,0.0005367602,0.0003077402,0.0001768877,0.00992811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003923705,"threshold_uncertainty_score":0.009634972,"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."}}