{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002783235,0.0001587747,0.0002338755,0.00006957889,0.0001101502,0.0001770072,0.0003477407,0.00008167583,0.0000617581],"category_scores_gemma":[0.00006123889,0.0001374697,0.00005914974,0.0002086789,0.00006614153,0.0002411544,0.00002973445,0.0001012438,0.00001849318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003638443,"about_ca_system_score_gemma":0.00004101854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001796853,"about_ca_topic_score_gemma":0.0001479692,"domain_scores_codex":[0.9987686,0.00004072275,0.0002547317,0.0004303939,0.0001491127,0.0003564442],"domain_scores_gemma":[0.9989517,0.0004827332,0.00004834366,0.0003309865,0.00008094301,0.0001053199],"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.00008515496,0.0003515872,0.001065425,0.00005622009,0.00004410007,0.00003956103,0.0002995823,0.3542394,0.00002750641,0.06052494,0.02775583,0.5555107],"study_design_scores_gemma":[0.003440372,0.0001523262,0.000413477,0.00001605594,0.00001057208,0.000005790117,0.000005028497,0.9919967,0.000003298468,0.0008558722,0.00292361,0.000176898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002826398,0.0002730606,0.9910178,0.003422347,0.0003663031,0.000507493,0.000004660622,0.0001380907,0.00144385],"genre_scores_gemma":[0.9395405,0.000007176242,0.05795711,0.001728825,0.0001573092,0.000146562,0.00000172159,0.000009277526,0.0004515123],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9367141,"threshold_uncertainty_score":0.560585,"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."}}