{"id":"W4210390153","doi":"10.1109/globecom46510.2021.9685672","title":"On Meeting a Maximum Delay Constraint","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Probabilistic logic; Latency (audio); Scheduling (production processes); Constraint (computer-aided design); Network packet; Computational complexity theory; Mathematical optimization; Distributed computing; Real-time computing; Algorithm; Computer network; Mathematics; Artificial intelligence; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001560349,0.0003052747,0.000323922,0.00005149025,0.0002959549,0.0001562091,0.0008965755,0.0001638032,0.0004338905],"category_scores_gemma":[0.0001390497,0.0003686069,0.0001077753,0.0007738515,0.0001928554,0.0002110927,0.0002410562,0.0004334306,0.0002715621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003641839,"about_ca_system_score_gemma":0.0001931353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000243849,"about_ca_topic_score_gemma":0.000489134,"domain_scores_codex":[0.9982834,0.0001927933,0.0004892379,0.0003402633,0.0002475186,0.0004467879],"domain_scores_gemma":[0.9970466,0.0002466396,0.00009798134,0.00205219,0.0003960293,0.0001605622],"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.00001397206,0.0002043566,0.0004619302,0.00004173158,0.0001705792,0.0000430867,0.000166911,0.7390797,0.001088749,0.1624123,0.00549263,0.09082407],"study_design_scores_gemma":[0.001026001,0.00005633415,0.0003984661,0.0005488601,0.00008578131,0.0001288332,0.0008180634,0.9468254,0.001932492,0.02373558,0.02335094,0.001093186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02952166,0.003336324,0.555184,0.001912999,0.001339761,0.0005637987,0.00034477,0.001036554,0.4067602],"genre_scores_gemma":[0.9468912,0.002556956,0.04984339,0.000216746,0.00005641043,0.00006843075,0.0002495339,0.00003395196,0.00008338937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9173695,"threshold_uncertainty_score":0.9998766,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02613627850838315,"score_gpt":0.2657200586599881,"score_spread":0.2395837801516049,"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."}}