{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":9,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":9,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"620e6307a0e7","filters":{"venue":"International Workshop on Quality of Service"}},"results":[{"id":"W2016312880","doi":"10.1109/iwqos.2006.250480","title":"How Practical is Network Coding?","year":2006,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1402,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science","authors":[{"name":"Mea Wang","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.104847326543095,"gpt":0.3769582704969661,"spread":0.2721109439538711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01117011,0.0009291281,0.000832401,0.0008919036,0.00155701,0.004181968,0.002922284,0.005190862,0.007954271],"category_scores_gemma":[0.0859345,0.0007162907,0.0004913526,0.001131175,0.008015076,0.01667651,0.003006765,0.00428496,0.00217998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002222837,"about_ca_system_score_gemma":0.002724081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003294477,"about_ca_topic_score_gemma":0.002079946,"domain_scores_codex":[0.988345,0.006585382,0.0003124766,0.001070484,0.002885961,0.0008006548],"domain_scores_gemma":[0.9472517,0.03605157,0.002055156,0.00940448,0.004141598,0.001095504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002581735,0.00009539601,0.002393011,0.0004491213,0.0001003931,0.0002017489,0.0005463015,0.03209536,0.001302661,0.7973518,0.02740136,0.1378045],"study_design_scores_gemma":[0.00005051173,0.0000605242,0.0002880663,0.0002228933,0.00001988533,0.0002929818,0.0004756873,0.0284889,0.001151587,0.9406681,0.02824471,0.00003619649],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02907392,0.01366624,0.7027149,0.1808232,0.003008526,0.0001510074,0.0003300908,0.001132646,0.06909952],"genre_scores_gemma":[0.7498939,0.01024956,0.2166687,0.008390275,0.002442712,0.000387436,0.0003324231,0.0005782086,0.01105681],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01117011,"threshold_uncertainty_score":0.05907393,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116690616","doi":"10.1109/iwqos.2006.250477","title":"An End-to-End Probabilistic Network Calculus with Moment Generating Functions","year":2006,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":234,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Network calculus; Computer science; Server; Probabilistic logic; Statistical time division multiplexing; Multiplexing; Queueing theory; Theoretical computer science; Moment (physics); Scalability; Algorithm; Calculus (dental); Computer network; Quality of service; Artificial intelligence; Telecommunications","authors":[{"name":"Markus Fidler","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02675253059035481,"gpt":0.2914396552845807,"spread":0.2646871246942259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005028647,0.001026388,0.0009802207,0.000930211,0.001356647,0.003619874,0.00260172,0.001501698,0.003301782],"category_scores_gemma":[0.006403842,0.0006676233,0.001509928,0.001274812,0.002470077,0.004963274,0.002708295,0.003848122,0.001017343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002134645,"about_ca_system_score_gemma":0.002563594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002056885,"about_ca_topic_score_gemma":0.00168022,"domain_scores_codex":[0.9970543,0.0007832833,0.000179005,0.000411149,0.00130749,0.0002648223],"domain_scores_gemma":[0.9978241,0.001090328,0.0001999728,0.0003290388,0.0004147173,0.0001419712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001662234,0.00002038524,0.00006766065,0.0000189669,0.000009331904,0.00007328472,0.00006542978,0.04352319,0.0007874722,0.9484708,0.0007550342,0.006191867],"study_design_scores_gemma":[0.00001255064,0.00003963,0.00006587363,0.00001558527,0.0000232867,0.0001011118,0.0000163465,0.4989048,0.001168439,0.4913539,0.008271929,0.00002656256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00143862,0.00006265477,0.995375,0.0001384928,0.00004796272,0.00002402054,0.00004664997,0.0001344477,0.00273223],"genre_scores_gemma":[0.303899,0.0008116656,0.6809066,0.000473295,0.0005779597,0.0004295787,0.0002353545,0.000261992,0.01240452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005028647,"threshold_uncertainty_score":0.02659434,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099597159","doi":"10.1109/iwqos.2007.376547","title":"Parallelized Progressive Network Coding With Hardware Acceleration","year":2007,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; PowerPC; Linear network coding; SIMD; x86; Speedup; Parallel computing; Computer architecture; Computer network; Operating system; Network packet","authors":[{"name":"Hassan Shojania","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09776376773168913,"gpt":0.3754989711180038,"spread":0.2777352033863146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003698291,0.0005628808,0.0002798729,0.0005034829,0.0002727895,0.0006066328,0.001088764,0.0002627336,0.004749296],"category_scores_gemma":[0.001216498,0.0001645111,0.0002976101,0.0006647336,0.0004068247,0.0007415267,0.0006729275,0.0006135684,0.001149193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006774602,"about_ca_system_score_gemma":0.001322517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005331166,"about_ca_topic_score_gemma":0.006210273,"domain_scores_codex":[0.99968,0.00004919064,0.00001590318,0.00003873934,0.0001587981,0.0000573595],"domain_scores_gemma":[0.9993818,0.000160767,0.00003742734,0.0001690757,0.0002242445,0.00002676942],"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.0006342803,0.0002148836,0.001475771,0.0002535678,0.00005058566,0.000332922,0.0003543683,0.4019065,0.08083324,0.06515504,0.01170717,0.4370816],"study_design_scores_gemma":[0.0000580152,0.00007525065,0.0001766938,0.0000113184,0.00000980652,0.00007788178,0.00002219703,0.9582549,0.02632016,0.007590561,0.007391484,0.00001179351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05662078,0.0001981028,0.9183137,0.0001847055,0.00007693761,0.0001191814,0.0001380816,0.008064414,0.01628409],"genre_scores_gemma":[0.3967542,0.0001547726,0.592838,0.00008633755,0.0000362977,0.0002256144,0.0004110627,0.0003464447,0.00914725],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005331166,"threshold_uncertainty_score":0.01588798,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108773413","doi":"10.1109/iwqos.2007.376548","title":"Probabilistic Field Coverage using a Hybrid Network of Static and Mobile Sensors","year":2007,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Probabilistic logic; Wireless sensor network; Distributed computing; Overhead (engineering); Real-time computing; Exploit; Computer network; Engineering","authors":[{"name":"Dan Wang","is_ca":true},{"name":"Jiangchuan Liu","is_ca":true},{"name":"Qian Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03383180869374273,"gpt":0.3232705276578743,"spread":0.2894387189641316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009585575,0.0006131104,0.0007445286,0.0007723972,0.000510139,0.0008292221,0.001422083,0.000918429,0.0008643047],"category_scores_gemma":[0.002278032,0.0005834984,0.0005339811,0.0008513364,0.0007593535,0.001776036,0.001357365,0.0005025738,0.0002097915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007255569,"about_ca_system_score_gemma":0.0004567929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001549881,"about_ca_topic_score_gemma":0.001488479,"domain_scores_codex":[0.9990659,0.0002739418,0.00003021998,0.0002451656,0.0002797906,0.0001049479],"domain_scores_gemma":[0.9990589,0.0005087025,0.0001338996,0.0001040215,0.0001268012,0.00006763631],"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.0002778731,0.00008533888,0.001821112,0.00009042968,0.00006010802,0.0002364085,0.0001336356,0.9126811,0.01826722,0.01885139,0.0006055806,0.04688979],"study_design_scores_gemma":[0.00001969689,0.0001096543,0.0002685354,0.000004596029,0.00001652799,0.00008655134,0.00002490172,0.993317,0.001583166,0.003841072,0.0007173604,0.00001086588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05635859,0.0003135813,0.9407073,0.0001815368,0.0000272628,0.00004766003,0.000034824,0.0002295948,0.002099468],"genre_scores_gemma":[0.898309,0.0003678225,0.09836559,0.00008949466,0.00006184517,0.0001330121,0.00005729635,0.00003127007,0.002584579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001549881,"threshold_uncertainty_score":0.005264282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122471890","doi":"10.1109/iwqos.2006.250447","title":"Echelon: Peer-to-Peer Network Diagnosis with Network Coding","year":2006,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Peer-to-peer; Linear network coding; Troubleshooting; Network topology; Server; Computer network; Distributed computing; Leverage (statistics); Dissemination; Telecommunications; Artificial intelligence; Network packet","authors":[{"name":"Chuan Wu","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0679937543639916,"gpt":0.3419990575953241,"spread":0.2740053032313325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002850251,0.0006400193,0.001054769,0.001003449,0.0008506265,0.001299723,0.002146556,0.001266437,0.001613788],"category_scores_gemma":[0.013243,0.0004019551,0.0004636764,0.0007321192,0.002180528,0.002573175,0.002950701,0.001578179,0.0003737575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001841783,"about_ca_system_score_gemma":0.002346051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006377168,"about_ca_topic_score_gemma":0.003540641,"domain_scores_codex":[0.997597,0.0006905053,0.0001163241,0.0004913766,0.0008983271,0.0002064325],"domain_scores_gemma":[0.9936988,0.003442697,0.0006211268,0.001121976,0.0008839753,0.0002314048],"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.000551129,0.0001260937,0.002054414,0.0001794385,0.00006039947,0.0004181886,0.0003247398,0.7408109,0.01403303,0.06819841,0.003396819,0.1698464],"study_design_scores_gemma":[0.00002083822,0.00003426355,0.00008023225,0.00001053493,0.000005346809,0.00005939307,0.00001988556,0.9810838,0.002877899,0.014862,0.0009321374,0.00001368628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01281607,0.0002309588,0.9828857,0.000248254,0.00009196936,0.0001755287,0.00008514216,0.001944306,0.00152203],"genre_scores_gemma":[0.6703594,0.0002403394,0.3265315,0.0003444793,0.00006714725,0.0002451475,0.0002201077,0.0001341623,0.001857642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006377168,"threshold_uncertainty_score":0.01507372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096199330","doi":"10.1109/iwqos.2007.376546","title":"On the Resilience-Complexity Tradeoff of Network Coding in Dynamic P2P Networks","year":2007,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Coding (social sciences); Resilience (materials science); Theoretical computer science; Computational complexity theory; Distributed computing; Computer network; Algorithm; Mathematics","authors":[{"name":"Di Niu","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1036516254987189,"gpt":0.370040041402382,"spread":0.2663884159036631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002311694,0.0005677787,0.0005022106,0.0009804645,0.000682168,0.0009498444,0.000641613,0.001083411,0.001174077],"category_scores_gemma":[0.02252586,0.0003186487,0.0003506352,0.0007702209,0.002349984,0.002870989,0.001182801,0.001063717,0.0001117612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002059355,"about_ca_system_score_gemma":0.0007029555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002284924,"about_ca_topic_score_gemma":0.001271312,"domain_scores_codex":[0.9988911,0.0005031082,0.00003046195,0.00009480859,0.0003146834,0.0001658064],"domain_scores_gemma":[0.9722937,0.02511453,0.001021463,0.0007107446,0.0006283124,0.0002311774],"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.0001197152,0.00003527615,0.0008987451,0.00007484616,0.00001926944,0.0001246565,0.0001753829,0.8523899,0.006603829,0.1292158,0.0004148007,0.00992775],"study_design_scores_gemma":[0.00001064842,0.0000531669,0.0004468172,0.00001650214,0.00000870341,0.00008211672,0.00004487771,0.9501483,0.001610037,0.04727729,0.0002841237,0.00001733907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3411077,0.001837053,0.6374156,0.00322083,0.00008250256,0.00008021139,0.000145535,0.0002367211,0.01587391],"genre_scores_gemma":[0.9782724,0.0006557642,0.02024002,0.00007329744,0.00004157704,0.00004510198,0.00002291747,0.00003178921,0.0006170424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002311694,"threshold_uncertainty_score":0.01494175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023693619","doi":"10.1109/iwqos.2007.376565","title":"Structuring Multi-Layer Scalable Streams to Maximize Cient-Perceived Quality","year":2007,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Granularity; Encoding (memory); Structuring; ENCODE; Coding (social sciences); Heuristic; Scalable Video Coding; Bandwidth (computing); Distributed computing; Algorithm; Computer network; Artificial intelligence","authors":[{"name":"Cheng-Hsin Hsu","is_ca":true},{"name":"Mohamed Hefeeda","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.121571265558767,"gpt":0.38606988110158,"spread":0.264498615542813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008804846,0.0008386417,0.0007539996,0.0005226404,0.0003680017,0.0008128018,0.0007833358,0.0006686657,0.001669155],"category_scores_gemma":[0.002640918,0.0003461952,0.0003041124,0.0005613362,0.0003721173,0.001297537,0.000783827,0.0007729351,0.0003543198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008973966,"about_ca_system_score_gemma":0.001101404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001836711,"about_ca_topic_score_gemma":0.003055809,"domain_scores_codex":[0.9996306,0.00006931981,0.00002525948,0.00006345887,0.0001593491,0.00005201453],"domain_scores_gemma":[0.9992648,0.0003045085,0.0001161601,0.00009437462,0.0001694462,0.00005081224],"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.0003363296,0.0002582496,0.001859804,0.000144007,0.00004058459,0.0001588389,0.000245923,0.5204461,0.0945744,0.01404878,0.003783508,0.3641034],"study_design_scores_gemma":[0.00002642424,0.0000491968,0.0002955427,0.000006298121,0.000008191409,0.00005216843,0.00005039455,0.9796175,0.01564262,0.003431414,0.0008120411,0.000008209167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05009107,0.0001476445,0.946767,0.0001245238,0.00001835724,0.0001382251,0.00004294898,0.0008270639,0.001843193],"genre_scores_gemma":[0.3929816,0.0002302213,0.6045783,0.00007718239,0.00003363726,0.0001163131,0.000123721,0.0001641471,0.001694887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001836711,"threshold_uncertainty_score":0.006511092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102325130","doi":"10.1109/iwqos.2008.22","title":"Dynamic Control of Tunable Sub-Optimal Algorithms for Scheduling of Time-Varying Wireless Networks","year":2008,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Queue; Schedule; Algorithm; Dynamic priority scheduling; Asymptotically optimal algorithm; Mathematical optimization; Distributed computing; Computer network; Mathematics","authors":[{"name":"Mahdi Lotfinezhad","is_ca":true},{"name":"Ben Liang","is_ca":true},{"name":"E.S. Sousa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02259317062480769,"gpt":0.2842929873294574,"spread":0.2616998167046497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001226117,0.0007252303,0.0005467461,0.0004014139,0.0003849423,0.0009937339,0.0008534021,0.000447533,0.0009716543],"category_scores_gemma":[0.005605798,0.0002620908,0.0002914695,0.0003985038,0.001066423,0.0007305441,0.0009289871,0.0009798201,0.0001495338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001324128,"about_ca_system_score_gemma":0.001186467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00245375,"about_ca_topic_score_gemma":0.001786786,"domain_scores_codex":[0.9993953,0.0001589251,0.00002919204,0.0001548364,0.0001750809,0.00008670532],"domain_scores_gemma":[0.9979997,0.00118892,0.0004187677,0.0001167895,0.0002037892,0.00007191818],"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.00006015996,0.00003012188,0.0002691943,0.00004163393,0.00001641394,0.00002721082,0.00006555061,0.9319323,0.006046519,0.04234119,0.0003334702,0.01883616],"study_design_scores_gemma":[0.00000312505,0.00001134928,0.00002548929,0.00000164037,0.00000120546,0.000002592858,0.000002971803,0.9969116,0.0003789728,0.002515616,0.0001439454,0.000001551248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02481706,0.0001662377,0.9724726,0.0001269393,0.00003314817,0.0000310081,0.00001251836,0.0001376737,0.00220287],"genre_scores_gemma":[0.942394,0.0002586054,0.05558511,0.00005973653,0.00002924469,0.0001006304,0.0000226624,0.00004946932,0.00150058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00245375,"threshold_uncertainty_score":0.009607315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990395834","doi":"10.1109/iwqos.2007.376551","title":"On the Stability Region of Linear-Memory Scheduling for Time Varying Channels","year":2007,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Fair-share scheduling; Dynamic priority scheduling; Mathematical optimization; Processor scheduling; Two-level scheduling; Distributed computing; Rate-monotonic scheduling; Round-robin scheduling; Time complexity; Parallel computing; Algorithm; Resource (disambiguation); Computer network; Mathematics; Quality of service","authors":[{"name":"Mahdi Lotfinezhad","is_ca":true},{"name":"Ben Liang","is_ca":true},{"name":"E.S. Sousa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05453556149124307,"gpt":0.3143575415357443,"spread":0.2598219800445012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003417904,0.0009742963,0.001002919,0.00110482,0.0007724013,0.00184733,0.000958101,0.0008342588,0.003009421],"category_scores_gemma":[0.02364524,0.0004670083,0.0006665702,0.0006713744,0.00252794,0.001892612,0.001250388,0.00167986,0.0003598562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001709932,"about_ca_system_score_gemma":0.00139424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003980733,"about_ca_topic_score_gemma":0.001260219,"domain_scores_codex":[0.9991042,0.0003800141,0.00002539653,0.0001224291,0.0001892649,0.0001786721],"domain_scores_gemma":[0.9715641,0.02426428,0.001980589,0.0004664585,0.001282554,0.0004419437],"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.00055261,0.0001188878,0.001331079,0.0002098165,0.00008735426,0.0002155767,0.0005062144,0.7831448,0.01023308,0.1898204,0.00182972,0.01195042],"study_design_scores_gemma":[0.00002365472,0.00005001762,0.0002590396,0.00002958256,0.00001444799,0.00002435564,0.00005038838,0.9662101,0.001252016,0.03179576,0.0002758941,0.00001466309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2808414,0.003678509,0.6887071,0.002115352,0.00007289209,0.0001414553,0.0002056501,0.0003921749,0.02384554],"genre_scores_gemma":[0.9790259,0.001408583,0.0164873,0.0001850566,0.00009571285,0.0001369234,0.0001023809,0.0001096584,0.002448383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003980733,"threshold_uncertainty_score":0.01807582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}