{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006868031,0.000134669,0.0001856507,0.00006847129,0.0001269926,0.0002660425,0.001225384,0.00007195487,0.0001019847],"category_scores_gemma":[0.0001425334,0.0001335293,0.00008253825,0.0005142141,0.00003802641,0.0004925703,0.0004115693,0.0002383442,0.0000496829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005896841,"about_ca_system_score_gemma":0.00004615272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004306433,"about_ca_topic_score_gemma":0.0002182143,"domain_scores_codex":[0.9983546,0.0002061745,0.0003824765,0.0003048793,0.0005612033,0.000190644],"domain_scores_gemma":[0.9975913,0.0008537688,0.0002866251,0.0006404011,0.0005760113,0.00005184901],"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.00003153094,0.0001773183,0.0007027345,0.000009797281,0.00003751804,0.000001891939,0.0002377434,0.0007161669,0.0004275138,0.9654897,0.02403728,0.008130793],"study_design_scores_gemma":[0.002517456,0.0001184113,0.07173222,0.0007952469,0.00002267617,0.00002766426,0.0003873508,0.2826797,0.004052586,0.08619957,0.5501182,0.001348883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01178216,0.0002347034,0.4887358,0.4632678,0.0009919226,0.0001859458,0.000008444619,0.0001726641,0.0346206],"genre_scores_gemma":[0.9571981,0.0001207012,0.02478593,0.01518634,0.0004271472,0.00001176286,0.00002103153,0.000009710197,0.002239205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.945416,"threshold_uncertainty_score":0.5445169,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007670798,0.0001976527,0.000241934,0.0001880645,0.0002038853,0.0001644234,0.0003972595,0.00005111695,0.0005598256],"category_scores_gemma":[0.00008765861,0.0001803855,0.00007061031,0.0008179366,0.00004197869,0.000586354,0.00009899907,0.000143209,0.0001208311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001022412,"about_ca_system_score_gemma":0.00001766153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001999467,"about_ca_topic_score_gemma":0.006400371,"domain_scores_codex":[0.9981905,0.00004852132,0.0005173208,0.0004051465,0.0005968485,0.0002416611],"domain_scores_gemma":[0.9984134,0.0001995658,0.0003932921,0.0003689335,0.0006015808,0.00002320617],"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.0002162856,0.0002288102,0.001603054,0.00003893627,0.00007401377,0.000002384954,0.00003738633,0.8266921,0.0005902798,0.1678738,0.0003520166,0.002290984],"study_design_scores_gemma":[0.002749817,0.000138085,0.04728042,0.001121558,0.0004681011,0.00000609607,0.002443732,0.7851605,0.0002435314,0.08353631,0.07481186,0.002039982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8464521,0.00002129123,0.1302745,0.009417747,0.0004894465,0.0003418589,0.00002204606,0.0001904409,0.01279058],"genre_scores_gemma":[0.9875106,4.058567e-7,0.003394407,0.005936532,0.002014917,0.00004699451,0.0002737437,0.00002865718,0.0007937917],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1410585,"threshold_uncertainty_score":0.7355906,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001234577,0.0001540417,0.0002063451,0.00009608998,0.0001811828,0.0001481664,0.001293428,0.00006565706,0.0001036274],"category_scores_gemma":[0.0000943854,0.0001351147,0.00005384677,0.0006321683,0.00003833531,0.0004538681,0.0002757485,0.0002251309,0.00002422341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007765938,"about_ca_system_score_gemma":0.00004940143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001354591,"about_ca_topic_score_gemma":0.0003689022,"domain_scores_codex":[0.998216,0.0001527394,0.0005078464,0.0003137677,0.000580662,0.0002289691],"domain_scores_gemma":[0.9974653,0.000656202,0.0003886924,0.000543041,0.0008702022,0.00007662038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0007937002,0.0003801618,0.004191671,0.00004466613,0.0002350198,0.00001545579,0.003100019,0.01398676,0.001305337,0.8544308,0.001671768,0.1198447],"study_design_scores_gemma":[0.01492978,0.0008607413,0.4829175,0.006532783,0.00007103164,0.00008903068,0.002739953,0.3449713,0.01497644,0.01980788,0.1081945,0.003909167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05913223,0.0003348869,0.8991213,0.02297566,0.0005994916,0.0004226721,0.000003765256,0.0002168041,0.01719315],"genre_scores_gemma":[0.9614253,0.00009102698,0.03323156,0.004711177,0.0002163178,0.0000187854,0.00003543281,0.00001057609,0.0002598227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9022931,"threshold_uncertainty_score":0.5509816,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001093653,0.0001554506,0.000288845,0.00009028752,0.00005314975,0.00004178929,0.0006221014,0.0000703444,0.00002325848],"category_scores_gemma":[0.000195109,0.0001592956,0.00006370906,0.0003991453,0.00005602931,0.0001679116,0.0002306794,0.0001765816,0.000002481987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006476107,"about_ca_system_score_gemma":0.00003593959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002611838,"about_ca_topic_score_gemma":0.0001003115,"domain_scores_codex":[0.9979842,0.0001175641,0.0006902995,0.0003502082,0.0006009915,0.000256777],"domain_scores_gemma":[0.9962527,0.00240717,0.0004461017,0.0004077299,0.0004068963,0.00007940219],"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.0001322741,0.0001790213,0.0007363404,0.00009849103,0.00005576188,0.0000103577,0.0006280617,0.9574959,0.00056194,0.03322475,0.0000780762,0.006799075],"study_design_scores_gemma":[0.0007975937,0.0001539421,0.004996547,0.0007126607,0.00001593291,0.00002258704,0.000188072,0.981913,0.003830832,0.006392753,0.0005973155,0.0003787859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7459149,0.00005502448,0.2521253,0.0006284239,0.0004079181,0.0001424496,0.000007358591,0.00003368271,0.0006850208],"genre_scores_gemma":[0.9828457,0.00001699966,0.01565097,0.00130733,0.0001008981,0.000003106338,0.000007391272,0.00001061581,0.00005703005],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2369308,"threshold_uncertainty_score":0.6495885,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001702322,0.0002362093,0.0003120016,0.0001056006,0.000252835,0.0002383972,0.002102942,0.00008886393,0.000144466],"category_scores_gemma":[0.0001660868,0.0002211458,0.00008631094,0.00132848,0.00003966059,0.0003465365,0.0006028271,0.0003100306,0.00009562447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000119494,"about_ca_system_score_gemma":0.00005603028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001626375,"about_ca_topic_score_gemma":0.001904828,"domain_scores_codex":[0.9970399,0.0002642868,0.000623113,0.0004837248,0.001220785,0.000368207],"domain_scores_gemma":[0.995799,0.001209693,0.0003171652,0.0008673351,0.001695031,0.0001117582],"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.0001660539,0.0003095971,0.01731068,0.00002261553,0.0001268081,0.00000626704,0.0007803118,0.2744618,0.00008438923,0.6063113,0.07534991,0.02507033],"study_design_scores_gemma":[0.002931231,0.0003070655,0.2748905,0.002777486,0.00004139495,0.00001883795,0.0003189061,0.1266451,0.001152576,0.02346976,0.5653926,0.002054478],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05946077,0.0004636787,0.564625,0.3226354,0.001836014,0.0006585662,0.00001975372,0.0004297341,0.04987113],"genre_scores_gemma":[0.9417912,0.00008610106,0.04068701,0.01389314,0.0009020909,0.00008391186,0.00006168965,0.00002316522,0.002471665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8823305,"threshold_uncertainty_score":0.9018064,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003632999,0.0001592901,0.0002616493,0.0001439406,0.0001320736,0.00004960821,0.002408003,0.00008349444,0.00007695857],"category_scores_gemma":[0.0002832816,0.000132484,0.00009109212,0.00116796,0.0001201036,0.0001838787,0.0003733208,0.0004525012,0.000008609903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001206558,"about_ca_system_score_gemma":0.00003626461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006812024,"about_ca_topic_score_gemma":0.002579025,"domain_scores_codex":[0.9976003,0.0003917837,0.0008260747,0.0003159967,0.0005880022,0.0002778372],"domain_scores_gemma":[0.9946564,0.003772742,0.000426983,0.0008004118,0.0002903904,0.00005311339],"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.0001504923,0.0001915705,0.001005695,0.00001063612,0.00002840085,0.00000143866,0.0009538455,0.06356886,0.0002515406,0.916966,0.0002882486,0.01658329],"study_design_scores_gemma":[0.0007244922,0.00007038198,0.2153242,0.0009515884,0.000003548241,0.000002368406,0.0004106017,0.7488514,0.00033095,0.03236232,0.000653159,0.0003150564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3459269,0.0003098972,0.5959437,0.03897059,0.000996911,0.0004260866,0.000005918058,0.00007871554,0.01734128],"genre_scores_gemma":[0.9930875,0.0001532611,0.002528354,0.004064683,0.00006376045,0.000006508536,0.000008175885,0.000007490879,0.00008022861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8846037,"threshold_uncertainty_score":0.5402542,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001412592,0.0002164184,0.000306357,0.000296906,0.0001301858,0.0001403942,0.002600876,0.0001456274,0.00007759967],"category_scores_gemma":[0.0004913078,0.0002015131,0.0001141586,0.0006264137,0.00004334705,0.0003375067,0.0008449415,0.0002840885,0.00009340585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001264525,"about_ca_system_score_gemma":0.00003348933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005973951,"about_ca_topic_score_gemma":0.000351523,"domain_scores_codex":[0.9971712,0.0001070394,0.000791059,0.0006113496,0.0009582582,0.0003611429],"domain_scores_gemma":[0.997472,0.0006215128,0.0003234185,0.000913141,0.000525582,0.0001443087],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0008424514,0.001526582,0.01109872,0.0002089953,0.0003174226,0.00003056644,0.007688873,0.01532131,0.1515153,0.2056948,0.001300135,0.6044549],"study_design_scores_gemma":[0.003524976,0.0001483656,0.7861558,0.001105853,0.0000129535,0.00001465294,0.005872653,0.0333178,0.1473037,0.0167261,0.004353402,0.001463746],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7179808,0.00002184324,0.2714962,0.007521341,0.0007582199,0.0001428895,0.00001344016,0.0003475865,0.001717695],"genre_scores_gemma":[0.9319855,0.000005918735,0.06449588,0.002881862,0.00005554604,0.000008865397,0.000005893805,0.00001038796,0.0005501781],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7750571,"threshold_uncertainty_score":0.8217464,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003530883,0.000206963,0.0005015866,0.0001465067,0.00005126199,0.000007023288,0.0003657314,0.0001593402,0.00003247253],"category_scores_gemma":[0.00006857461,0.0002424141,0.0001402694,0.0003299807,0.00006701237,0.0002252923,0.00003832631,0.0001840037,0.000003099393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009736474,"about_ca_system_score_gemma":0.00002699553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002838416,"about_ca_topic_score_gemma":0.0000140664,"domain_scores_codex":[0.9981934,0.00004385431,0.0008951222,0.0002297188,0.0003973445,0.0002405016],"domain_scores_gemma":[0.997829,0.0008128386,0.0004184565,0.0002444153,0.000641981,0.00005333458],"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.0003119805,0.00009263555,0.000205094,0.0001759449,0.0001912846,7.549878e-7,0.0001757108,0.9850048,0.01058699,0.0004166681,0.00001849159,0.002819595],"study_design_scores_gemma":[0.001321065,0.0000302737,0.000467702,0.00036153,0.00001869222,0.00000247172,0.00006174636,0.9922102,0.005201043,0.0001100979,0.00001945724,0.0001957265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3054946,0.000206841,0.6933593,0.0001305403,0.0002702676,0.0002411877,0.00006659954,0.00006816536,0.0001625411],"genre_scores_gemma":[0.9617785,0.000229084,0.03751393,0.000101484,0.00009270332,0.00003004149,0.0001577772,0.00005216289,0.00004437212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6562839,"threshold_uncertainty_score":0.9885358,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052518,0.0001397173,0.0002046745,0.00008591708,0.00005489204,0.000009167708,0.0003134028,0.00009804025,0.00005704858],"category_scores_gemma":[0.0003574484,0.000126645,0.00008552968,0.000253877,0.00003394075,0.0001221365,0.00003426325,0.0001777263,0.000008789817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001006755,"about_ca_system_score_gemma":0.00001062063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001297659,"about_ca_topic_score_gemma":0.0000148076,"domain_scores_codex":[0.9986956,0.00004167987,0.0005661405,0.0001830517,0.0003436648,0.0001699143],"domain_scores_gemma":[0.9966403,0.002430234,0.000219547,0.0002825829,0.0003922827,0.00003510469],"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.0003340313,0.0000687495,0.00002761526,0.0001122517,0.00005446677,3.215623e-7,0.0004715334,0.9880384,0.002842042,0.005456041,0.00004346785,0.002551112],"study_design_scores_gemma":[0.0005457013,0.00003276845,0.0002838732,0.0004597354,0.000008498218,8.275629e-7,0.0003169966,0.9650086,0.02936492,0.003699179,0.00009266819,0.000186294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4837279,0.00003377896,0.5121498,0.001458515,0.0004842134,0.0003300006,0.00001819829,0.00008794867,0.001709686],"genre_scores_gemma":[0.9916992,0.00001366094,0.007420037,0.0004975319,0.0002198786,0.00001535353,0.00004894762,0.00003017136,0.0000551794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5079714,"threshold_uncertainty_score":0.5164433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}