{"id":"W1606800778","doi":"10.48550/arxiv.1101.1237","title":"Statistical Analysis of Link Scheduling on Long Paths","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Burstiness; Network calculus; Computer science; Scheduling (production processes); Network packet; Upper and lower bounds; Key (lock); Mathematical optimization; Computer network; Distributed computing; Quality of service; Mathematics","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.0002548767,0.0002415721,0.0005202012,0.0004983714,0.00007372154,0.00004819752,0.001283033,0.000243305,0.00008704857],"category_scores_gemma":[0.00003776943,0.0002673108,0.0003091894,0.0009753447,0.0001029985,0.0001106127,0.0006491107,0.0005084712,0.00004974818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007015847,"about_ca_system_score_gemma":0.0001536021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006295383,"about_ca_topic_score_gemma":0.00003848919,"domain_scores_codex":[0.9983001,0.0001609643,0.0002539741,0.000897871,0.0001145812,0.0002725519],"domain_scores_gemma":[0.9980048,0.0002797702,0.000287422,0.00108348,0.0001791618,0.0001653854],"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.0000303944,0.00006714831,0.003480569,0.00001609212,0.0006756941,0.0001628746,0.00006861227,0.5102809,0.000001151793,0.4700261,0.00001514374,0.01517534],"study_design_scores_gemma":[0.0002637728,0.00007722432,0.00979552,0.00005612367,0.0008674049,4.31849e-7,0.000009905084,0.9795318,0.00001021248,0.009084623,0.00003330371,0.0002696522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1248461,0.00004350737,0.8723248,0.00003519668,0.0003219712,0.0001192496,0.0000200001,0.0001256256,0.002163548],"genre_scores_gemma":[0.9950964,0.00007593678,0.004278178,0.00007302245,0.00006406429,6.2212e-7,0.00002183655,0.000009282446,0.0003805898],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8702504,"threshold_uncertainty_score":0.9999779,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06254985274719062,"score_gpt":0.1913590126259968,"score_spread":0.1288091598788062,"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."}}