{"id":"W2128448269","doi":"10.1109/infcom.1996.493351","title":"Robust non-probabilistic bounds for delay and throughput in credit-based flow control","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Computer science; Throughput; Flow control (data); Flow (mathematics); Computer network; Artificial intelligence; Mathematics; Telecommunications","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.01516343,0.002180061,0.001453183,0.002351409,0.001135736,0.004015346,0.002695319,0.001836083,0.002261624],"category_scores_gemma":[0.06579658,0.000939378,0.001480033,0.00149753,0.005234033,0.005188162,0.003048733,0.003823121,0.0003599526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005806428,"about_ca_system_score_gemma":0.002623944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004181821,"about_ca_topic_score_gemma":0.002170774,"domain_scores_codex":[0.9911926,0.001989679,0.0004002013,0.001190482,0.004240489,0.0009864727],"domain_scores_gemma":[0.9370881,0.04800252,0.00467485,0.004492738,0.004992641,0.0007491725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002436473,0.00004574064,0.0004897203,0.0001365538,0.00007995337,0.00006131676,0.0001122453,0.8585702,0.008097233,0.1195729,0.0003282026,0.01226242],"study_design_scores_gemma":[0.00001441079,0.00005999151,0.0001821263,0.00002276187,0.00001845175,0.00001814461,0.000007624039,0.9607284,0.002799622,0.03579338,0.0003261724,0.0000288587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01966478,0.001485362,0.9751875,0.0003565026,0.00008858545,0.00004947894,0.0001076171,0.000388486,0.002671671],"genre_scores_gemma":[0.9225493,0.001062526,0.07410523,0.0001763291,0.0001852439,0.0002152789,0.0001329012,0.0001637666,0.00140948],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01516343,"threshold_uncertainty_score":0.0801928,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02268111210440919,"score_gpt":0.2094337725646921,"score_spread":0.1867526604602829,"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."}}