{"id":"W3039682304","doi":"10.1109/pimrc48278.2020.9217139","title":"Probabilistic Bounds on the End-to-End Delay of Service Function Chains using Deep MDN","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Queueing theory; Computer science; Probabilistic logic; End-to-end principle; Service (business); Task (project management); Function (biology); Layered queueing network; Statistical model; Mathematical optimization; Artificial intelligence; Computer network; Mathematics; Engineering","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.0004485161,0.0003041733,0.0003490263,0.00009241327,0.00016545,0.0002324877,0.001342696,0.0001754643,0.0001249555],"category_scores_gemma":[0.00006964606,0.000218886,0.0001412783,0.0005365979,0.00004837617,0.00008422016,0.0009121296,0.0005379065,0.00006914632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001055473,"about_ca_system_score_gemma":0.0003302773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001602388,"about_ca_topic_score_gemma":0.0003236162,"domain_scores_codex":[0.9978912,0.000195603,0.0004183902,0.0007570858,0.0004408001,0.000296852],"domain_scores_gemma":[0.997944,0.0003403778,0.0002382651,0.001038846,0.0002889894,0.0001495135],"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.00007472404,0.00009644662,0.00001808245,0.0001244119,0.0001509929,0.000005274293,0.001014163,0.4206239,0.0001352485,0.4523318,0.000731023,0.1246939],"study_design_scores_gemma":[0.0001608903,0.0001188826,0.0001719763,0.0001028667,0.00006097787,0.000004764234,0.00003824695,0.9902872,0.00002718845,0.007110647,0.001675197,0.000241092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01810031,0.00007647603,0.9589544,0.01686177,0.001169002,0.0008150503,0.00000475047,0.000265009,0.003753253],"genre_scores_gemma":[0.9862689,0.000004368625,0.005929726,0.007121763,0.0003772034,0.00007757738,0.000007695163,0.00001904193,0.0001937227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9681686,"threshold_uncertainty_score":0.8925912,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04185064687958321,"score_gpt":0.2450419093100612,"score_spread":0.203191262430478,"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."}}