{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":51,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":51,"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"},"query_hash":"7578520a9f7b","filters":{"venue":"Performance Evaluation"}},"results":[{"id":"W2129419521","doi":"10.1016/j.peva.2011.07.008","title":"Characterizing and modelling popularity of user-generated videos","year":2011,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":107,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Popularity; Upload; Computer science; Key (lock); Sampling (signal processing); Dynamics (music); Set (abstract data type); Data mining; Artificial intelligence; World Wide Web; Computer vision; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.0854509516755767,"gpt":0.291447457246911,"spread":0.2059965055713343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144713,0.00007271897,0.0001200321,0.00005793562,0.00006742767,0.00001055946,0.00005531223,0.00001824748,0.0002594566],"category_scores_gemma":[0.000001727708,0.00007167697,0.00002839645,0.0001208638,0.00001718214,0.000232847,0.00002731755,0.00005794524,0.000002785162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001227892,"about_ca_system_score_gemma":0.00001822741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001807224,"about_ca_topic_score_gemma":0.000002874355,"domain_scores_codex":[0.9993857,0.00004056961,0.000201395,0.0001233876,0.0001538011,0.00009516934],"domain_scores_gemma":[0.9995582,0.000005940875,0.0001324298,0.0001359434,0.0001465694,0.00002090045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004379745,0.0001311636,0.7726587,0.00003043979,0.0001078715,5.955281e-8,0.001909325,0.005468898,0.0225831,0.003378142,0.00003672221,0.1936518],"study_design_scores_gemma":[0.0001250392,0.00002409381,0.07280262,0.00002295267,0.00006472901,1.113184e-7,0.00002197965,0.8861547,0.03955484,0.001112318,0.00003620064,0.00008046546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9642838,0.00002585731,0.0341075,0.000005995839,0.0000224243,0.0001441058,0.000001888908,0.00002000467,0.001388443],"genre_scores_gemma":[0.9951748,0.000009637619,0.004641241,0.000005284052,0.00006929235,0.0000269005,0.00005143147,0.000006661466,0.00001471623],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8806857,"threshold_uncertainty_score":0.2922902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053359564","doi":"10.1016/s0166-5316(00)00032-8","title":"Temporal locality and its impact on Web proxy cache performance","year":2000,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Locality of reference; Locality; Computer science; Cache; Proxy (statistics); Principle of locality; Popularity; Term (time); Quantum nonlocality; Parallel computing; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.03325520145276156,"gpt":0.3008427003832225,"spread":0.2675874989304609,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001450561,0.0001714063,0.0001416023,0.00009012258,0.0002433197,0.0001199014,0.0002848284,0.00005954359,0.0001492009],"category_scores_gemma":[0.00002196832,0.0001350165,0.00004766893,0.0002519888,0.00002467467,0.001128535,0.00004248914,0.0001863367,0.0002910885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001418569,"about_ca_system_score_gemma":0.0001664146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002998911,"about_ca_topic_score_gemma":0.00000292026,"domain_scores_codex":[0.9984011,0.0001132936,0.0002207153,0.0003610153,0.0006362311,0.000267637],"domain_scores_gemma":[0.9993182,0.00002917788,0.00007086087,0.0003589956,0.000137137,0.00008558002],"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.000147824,0.0001173381,0.07940768,0.00004251252,0.00002359683,0.000001199975,0.0005921871,0.02240261,0.0006885669,0.0000926092,0.0004064867,0.8960774],"study_design_scores_gemma":[0.0004679503,0.000317207,0.1604486,0.00004769268,0.000009979653,0.00001146097,0.000003911839,0.8376588,0.0006722006,0.00002438883,0.0001855842,0.0001523002],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9961632,0.0002229123,0.0001631472,0.0002730701,0.0001441364,0.0003515097,0.000002513198,0.0001170176,0.002562517],"genre_scores_gemma":[0.9990262,0.00019672,0.00008372641,0.0001792568,0.00009460901,0.00004347368,0.00001228567,0.000007492411,0.0003562173],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8959251,"threshold_uncertainty_score":0.5505815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016840637","doi":"10.1016/s0166-5316(99)00070-x","title":"Use of α-stable self-similar stochastic processes for modeling traffic in broadband networks","year":2000,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Western University","funders":"","keywords":"Burstiness; Self-similarity; Computer science; Traffic generation model; Queue; Aggregate (composite); Range (aeronautics); Queueing theory; Marginal distribution; Real-time computing; Network packet; Mathematics; Statistics; Computer network; Random variable","retraction":null,"screen_n_in":null,"score":{"opus":0.04134902406865253,"gpt":0.2602165361400509,"spread":0.2188675120713984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000844694,0.0001201593,0.0001725788,0.00009246811,0.00009556391,0.00006958151,0.0002324674,0.00006344765,0.00002320293],"category_scores_gemma":[0.00005332341,0.0001175762,0.00003148567,0.0004760153,0.00001322088,0.001055878,0.00001248885,0.00008366854,0.000003604084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005596699,"about_ca_system_score_gemma":0.0002265708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003778923,"about_ca_topic_score_gemma":0.00002627502,"domain_scores_codex":[0.9988252,0.00005040631,0.0003377441,0.0002733881,0.0002504675,0.000262784],"domain_scores_gemma":[0.9991738,0.0001480758,0.00008370965,0.0002225765,0.0003339267,0.00003789871],"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.00003254035,0.00003724568,0.00006184691,0.00002190506,0.000004915186,3.380035e-8,0.0002280873,0.6418568,0.000001699957,0.00003377012,0.00002791776,0.3576932],"study_design_scores_gemma":[0.0008523263,0.0000933629,0.0002893684,0.00008837206,0.00002638063,0.0000014296,0.000005429943,0.9983577,0.000009496345,0.00007406808,0.00007329938,0.0001288025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5413751,0.0003915775,0.4574732,0.00009006749,0.00008042746,0.0005066922,8.30424e-7,0.00006048912,0.00002155173],"genre_scores_gemma":[0.9931542,0.000162695,0.006265393,0.00005359953,0.00008265108,0.0002154118,0.00001095364,0.000008902746,0.00004618306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4517791,"threshold_uncertainty_score":0.4794619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2191399453","doi":"10.1016/j.peva.2015.04.002","title":"On optimal policies for energy-aware servers","year":2015,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Green IT and Sustainability","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Computer science; Leverage (statistics); Energy (signal processing); Range (aeronautics); Routing (electronic design automation); Computer network; Server farm; Mathematical optimization; Energy cost; Distributed computing; Client–server model; Environmental economics; Economics; Mathematics; Engineering; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04328865261744076,"gpt":0.2841344741478501,"spread":0.2408458215304094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005276683,0.00008222537,0.00007269953,0.00005705866,0.00004898606,0.00001738603,0.00006270616,0.00004320944,0.00002177093],"category_scores_gemma":[0.00004728618,0.00007893266,0.00002811053,0.00008902892,0.00001269727,0.0001986253,0.000007772246,0.00003881328,0.00001438896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002796901,"about_ca_system_score_gemma":0.00005909185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001575603,"about_ca_topic_score_gemma":0.00001446038,"domain_scores_codex":[0.9993758,0.00001448858,0.00010684,0.00008704029,0.0002514809,0.0001643145],"domain_scores_gemma":[0.9995401,0.00002226435,0.00001493443,0.0001336638,0.0002393035,0.00004974947],"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.00005357485,0.00001565359,0.002139717,0.00006363332,0.00001196356,8.823859e-8,0.001063941,0.9338856,0.00002782145,0.0003944958,0.006163825,0.05617969],"study_design_scores_gemma":[0.000532345,0.00013122,0.004327827,0.00000771036,0.00001311733,4.579714e-7,0.0002673711,0.9905817,0.001541786,0.0005794817,0.001916978,0.0001000439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9905103,0.00004498892,0.006847451,0.00008084474,0.0002857257,0.0002076215,0.00000381881,0.0001110956,0.001908163],"genre_scores_gemma":[0.9993742,0.000005387838,0.0001754602,0.00003234949,0.0001028549,0.000131492,0.00004325857,0.00001285775,0.0001221703],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05669606,"threshold_uncertainty_score":0.321878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073969215","doi":"10.1016/j.peva.2009.07.004","title":"Rule-based automatic software performance diagnosis and improvement","year":2009,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Unified Modeling Language; Automation; Performance improvement; Software; Software engineering; Software performance testing; Software system; Programming language; Software construction","retraction":null,"screen_n_in":null,"score":{"opus":0.02022610406993803,"gpt":0.2701802380501783,"spread":0.2499541339802402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002015966,0.000268647,0.0002610814,0.0001941698,0.0004094453,0.0001737831,0.0004944718,0.0001120542,0.00005573979],"category_scores_gemma":[0.0001357759,0.0002261134,0.00006330796,0.0004893545,0.00005544841,0.001599399,0.00007688384,0.0001688132,0.0001024254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002353299,"about_ca_system_score_gemma":0.0002407037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008679067,"about_ca_topic_score_gemma":0.000001217968,"domain_scores_codex":[0.9974338,0.00008277075,0.0005071568,0.0005526981,0.0009888214,0.0004347564],"domain_scores_gemma":[0.9984792,0.00007716555,0.0002163531,0.0007783645,0.0003257358,0.000123197],"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.000006962692,0.00008162656,0.1046046,0.000130811,0.000006331793,2.771079e-7,0.0002546695,0.001706376,0.00008032635,0.00001210428,0.0001086976,0.8930072],"study_design_scores_gemma":[0.0006117537,0.0004700853,0.4398296,0.0001189891,0.0000152149,0.000003818821,0.000005637889,0.5541899,0.004324287,0.0001203917,0.0001070237,0.0002032515],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9769358,0.0003139613,0.02004265,0.000717273,0.0004517826,0.0009212061,0.000001405278,0.00045141,0.0001644827],"genre_scores_gemma":[0.983824,0.0001822023,0.0148815,0.0006054601,0.00009322318,0.0003669945,0.00001388885,0.00001000179,0.00002268376],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8928039,"threshold_uncertainty_score":0.9220638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095275942","doi":"10.1016/s0166-5316(01)00033-5","title":"Automated performance modeling of software generated by a design environment","year":2001,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Instituto de Telecomunicações","keywords":"Computer science; Automation; Workload; Implementation; Process (computing); Software; Exploit; Software engineering; Queueing theory; Embedded system; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04137847820431585,"gpt":0.2658680219485682,"spread":0.2244895437442524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002553563,0.000255709,0.0002916917,0.0001585622,0.0002632573,0.00005431727,0.0006242871,0.0001421165,0.00007577896],"category_scores_gemma":[0.00006965442,0.0002243689,0.00006533124,0.0005758035,0.00005404283,0.001399647,0.0001184369,0.0001496873,0.0001470244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002610651,"about_ca_system_score_gemma":0.0002125911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002405372,"about_ca_topic_score_gemma":3.9571e-7,"domain_scores_codex":[0.9970821,0.0002036318,0.0006838889,0.0005117687,0.001101736,0.0004168618],"domain_scores_gemma":[0.9984643,0.00004416028,0.0002662167,0.0007890871,0.0003464175,0.00008978842],"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.0000391019,0.0001057552,0.01876245,0.00006933176,0.00002239561,3.547698e-7,0.0004653472,0.868861,0.001756576,0.000002396622,0.0004275591,0.1094877],"study_design_scores_gemma":[0.0007047506,0.0002472724,0.007832681,0.00007621367,0.00001997032,0.00001578138,0.0000112553,0.9814666,0.009213785,0.00002245635,0.0001241118,0.0002651582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5803052,0.0002901047,0.4182756,0.00003992477,0.0001888771,0.0004687169,0.000001420057,0.0003659586,0.00006419473],"genre_scores_gemma":[0.9683185,0.0007140249,0.03058983,0.00004567861,0.00004904831,0.0001726128,0.00003758875,0.00001775454,0.00005491911],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3880134,"threshold_uncertainty_score":0.9149496,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4248477689","doi":"10.1016/j.peva.2009.11.003","title":"Rule-based automatic software performance diagnosis and improvement","year":2009,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Unified Modeling Language; Automation; Software; Software engineering; Software performance testing; Performance improvement; Software system; Programming language; Software construction","retraction":null,"screen_n_in":null,"score":{"opus":0.02022610406993803,"gpt":0.2701802380501783,"spread":0.2499541339802402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002015966,0.000268647,0.0002610814,0.0001941698,0.0004094453,0.0001737831,0.0004944718,0.0001120542,0.00005573979],"category_scores_gemma":[0.0001357759,0.0002261134,0.00006330796,0.0004893545,0.00005544841,0.001599399,0.00007688384,0.0001688132,0.0001024254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002353299,"about_ca_system_score_gemma":0.0002407037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008679067,"about_ca_topic_score_gemma":0.000001217968,"domain_scores_codex":[0.9974338,0.00008277075,0.0005071568,0.0005526981,0.0009888214,0.0004347564],"domain_scores_gemma":[0.9984792,0.00007716555,0.0002163531,0.0007783645,0.0003257358,0.000123197],"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.000006962692,0.00008162656,0.1046046,0.000130811,0.000006331793,2.771079e-7,0.0002546695,0.001706376,0.00008032635,0.00001210428,0.0001086976,0.8930072],"study_design_scores_gemma":[0.0006117537,0.0004700853,0.4398296,0.0001189891,0.0000152149,0.000003818821,0.000005637889,0.5541899,0.004324287,0.0001203917,0.0001070237,0.0002032515],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9769358,0.0003139613,0.02004265,0.000717273,0.0004517826,0.0009212061,0.000001405278,0.00045141,0.0001644827],"genre_scores_gemma":[0.983824,0.0001822023,0.0148815,0.0006054601,0.00009322318,0.0003669945,0.00001388885,0.00001000179,0.00002268376],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8928039,"threshold_uncertainty_score":0.9220638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968886330","doi":"10.1016/j.peva.2008.10.009","title":"Localization in time and space for wireless sensor networks: An efficient and lightweight algorithm","year":2008,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless sensor network; Scalability; Synchronization (alternating current); Overhead (engineering); Algorithm; Network packet; Real-time computing; Wireless; Key distribution in wireless sensor networks; Clock synchronization; Wireless network; Computer network; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01451944688210812,"gpt":0.242674935334071,"spread":0.2281554884519629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008136244,0.0001244511,0.0001355966,0.0001685814,0.0002311732,0.00006979373,0.000190479,0.00009423873,0.000005729356],"category_scores_gemma":[0.00003363037,0.0001205037,0.0000102454,0.0004897381,0.00008484376,0.0005552672,0.00009191951,0.0000683422,0.000006365987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008730499,"about_ca_system_score_gemma":0.00005188137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000360315,"about_ca_topic_score_gemma":0.000002870538,"domain_scores_codex":[0.9988225,0.00006968902,0.000211129,0.0003620189,0.0003175218,0.0002171733],"domain_scores_gemma":[0.9993636,0.00005576492,0.0001000385,0.000252872,0.0001855903,0.00004213641],"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.00001073175,0.00006177168,0.006577998,0.00001661841,0.000005332752,8.981822e-7,0.0007875991,0.5318825,0.00006005402,0.0003500996,0.0001736134,0.4600728],"study_design_scores_gemma":[0.0006233146,0.0001288791,0.007705237,0.00002988767,0.000005988326,0.00001649173,0.0000101419,0.9900399,0.00107312,0.00009375333,0.0001209115,0.0001523353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4291703,0.0002611369,0.5697716,0.0001461566,0.0000647892,0.0004529758,6.33636e-7,0.0001159976,0.00001644776],"genre_scores_gemma":[0.9429058,0.0003962969,0.05638107,0.00005262768,0.00007797472,0.00008962492,0.00003127346,0.00001281713,0.0000525212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5137355,"threshold_uncertainty_score":0.4913998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070837763","doi":"10.1016/j.peva.2004.09.005","title":"Software performance models from system scenarios","year":2004,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Unified Modeling Language; Sequence diagram; Activity diagram; Notation; Sequence (biology); Use Case Diagram; Software; Software engineering; Queueing theory; Programming language; Data mining; Class diagram","retraction":null,"screen_n_in":null,"score":{"opus":0.02939548859172325,"gpt":0.2485656793744829,"spread":0.2191701907827597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00185997,0.0003425459,0.0003515005,0.0001913335,0.000550716,0.0001928606,0.0008939021,0.0002004452,0.0000268473],"category_scores_gemma":[0.00006353797,0.000295855,0.0001149435,0.0006752092,0.00006777538,0.003965586,0.0002213666,0.0002831732,0.0006231845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009889852,"about_ca_system_score_gemma":0.0006008635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002132297,"about_ca_topic_score_gemma":0.00001124311,"domain_scores_codex":[0.9963295,0.0001090868,0.0006674038,0.0008012025,0.001534675,0.0005581293],"domain_scores_gemma":[0.9975448,0.00005023698,0.0002777117,0.001366151,0.0006079598,0.000153144],"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.00004459739,0.0001252628,0.02343106,0.0003207572,0.00004829917,0.000003199777,0.002967086,0.7237375,0.0001592602,0.0006390589,0.000096757,0.2484271],"study_design_scores_gemma":[0.001478459,0.0001569326,0.05469577,0.0004309821,0.00002892309,0.00002896317,0.00006816445,0.9386584,0.003189421,0.0007690006,0.00007736103,0.000417658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7351164,0.0002813525,0.2611967,0.0001255486,0.00126785,0.0006656253,0.000004827889,0.000728857,0.0006127634],"genre_scores_gemma":[0.9736267,0.00009362421,0.02551826,0.0001119911,0.0002885618,0.0002594607,0.00004698363,0.00002465406,0.0000297975],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2480095,"threshold_uncertainty_score":0.9999493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007604684","doi":"10.1016/j.peva.2007.02.004","title":"A new model for video traffic originating from multiplexed MPEG-4 videoconference streams","year":2007,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Videoconferencing; Burstiness; Variable bitrate; Autoregressive model; Real-time computing; Frame (networking); Computer network; Network packet; Multimedia; Bit rate; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07062651834011176,"gpt":0.3266894149817192,"spread":0.2560628966416075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001413906,0.0001844374,0.0001781911,0.0001791629,0.0002657209,0.0001545149,0.0008385167,0.00009945413,0.00001690633],"category_scores_gemma":[0.0003477279,0.0001679119,0.00006447116,0.0003276175,0.00002362925,0.0009200065,0.0001295007,0.0001576256,0.00002506289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001278133,"about_ca_system_score_gemma":0.0003066171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003561985,"about_ca_topic_score_gemma":0.00004392449,"domain_scores_codex":[0.9981212,0.00002720888,0.0003720956,0.0004939053,0.0006082269,0.0003773688],"domain_scores_gemma":[0.9985619,0.0002682449,0.0002150681,0.0005667486,0.0003066253,0.00008145758],"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.00002144846,0.00002048406,0.0002961797,0.000007722441,0.000007061765,1.890776e-7,0.0007375719,0.07959169,0.003707792,0.000878497,0.0004595126,0.9142718],"study_design_scores_gemma":[0.0009315339,0.00008116486,0.001425551,0.0000849252,0.00001473588,0.000001029456,0.00006155796,0.9640874,0.02861864,0.004220448,0.00025943,0.0002136247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4363521,0.00008669661,0.5623342,0.0001889451,0.0002025806,0.0003265879,0.000001823877,0.0003746342,0.0001324681],"genre_scores_gemma":[0.7653652,0.00001193694,0.2342572,0.00006858761,0.00008224591,0.00008206173,0.00001151841,0.000008661384,0.0001125753],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9140582,"threshold_uncertainty_score":0.6847249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999118623","doi":"10.1016/j.peva.2007.06.004","title":"Remote analysis of a distributed WLAN using passive wireless-side measurement","year":2007,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"University of Calgary","keywords":"Wi-Fi; Computer science; Computer network; Wireless; Wireless lan; Wireless WAN; Wireless network; Local area network; Wireless site survey; Wi-Fi array; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.08134839881142347,"gpt":0.3361951785067298,"spread":0.2548467796953063,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004108186,0.000118857,0.0002383357,0.0002767805,0.0001278601,0.00004642274,0.0003287046,0.00006131436,0.00001770483],"category_scores_gemma":[0.00005488144,0.0001085896,0.000095723,0.001873247,0.00002694001,0.0003906895,0.00006920332,0.00008924787,0.000003574272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002937522,"about_ca_system_score_gemma":0.0001583956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000635615,"about_ca_topic_score_gemma":0.0000845382,"domain_scores_codex":[0.9976513,0.0000981181,0.0004437662,0.0002658515,0.001273901,0.000267082],"domain_scores_gemma":[0.9982703,0.00004807427,0.0003542999,0.0004436475,0.0008227189,0.00006096655],"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.00005536591,0.00006269949,0.01519511,0.00003703791,0.0003602346,0.000001458927,0.0006158042,0.1812538,0.009767312,0.00032049,0.00003127029,0.7922994],"study_design_scores_gemma":[0.0002700549,0.0000482801,0.1673687,0.00005830548,0.0001992254,8.343153e-7,0.00001057418,0.8248115,0.006992908,0.00008543358,0.00004860985,0.0001056564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4196168,0.00002770884,0.5791897,0.00003417309,0.00007122919,0.0009343126,0.000001946816,0.00002284471,0.0001013172],"genre_scores_gemma":[0.9922362,0.000008573138,0.007577084,0.00002807362,0.00006432067,0.000053918,0.00002456783,0.000005036738,0.000002216182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7921938,"threshold_uncertainty_score":0.4428157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106086560","doi":"10.1016/s0166-5316(00)00029-8","title":"Optimized caching in systems with heterogeneous client populations","year":2000,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Server; Cache; Proxy (statistics); Proxy server; Multicast; Computer network; Bandwidth (computing); Content delivery; Workload; Distributed computing; False sharing; CPU cache; Cache algorithms; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0461798311964317,"gpt":0.2736159252846863,"spread":0.2274360940882546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000783561,0.00009310356,0.0001087309,0.0001154827,0.0001402241,0.0001205222,0.0002092842,0.00002923336,0.00003277233],"category_scores_gemma":[0.000006777972,0.00007904742,0.00002322877,0.0002485361,0.000009654525,0.0005890089,0.00001398872,0.00009668016,0.00005792564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001380132,"about_ca_system_score_gemma":0.00004976363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001925815,"about_ca_topic_score_gemma":0.00003331393,"domain_scores_codex":[0.9987864,0.0001198335,0.0002194848,0.0002373224,0.0004573666,0.0001795698],"domain_scores_gemma":[0.9995155,0.00001667383,0.00005676585,0.0003030694,0.00007294194,0.00003505473],"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.00002107606,0.00002464155,0.003766917,0.000004288538,0.000003335287,0.000001343375,0.0003442305,0.9425266,0.0000244412,0.00005919108,0.000009003826,0.05321496],"study_design_scores_gemma":[0.0007255065,0.00006988948,0.0153162,0.00006244598,0.000008511268,0.00002741531,0.0000107446,0.9835738,0.00002595404,0.00001426298,0.00005401751,0.0001112495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9766361,0.0001938356,0.02143066,0.00009302553,0.0002086125,0.0003257849,5.430088e-7,0.000077073,0.001034371],"genre_scores_gemma":[0.9980831,0.00003753065,0.001552221,0.00004842857,0.00003732554,0.00008336451,0.00001214525,0.000005797954,0.0001401137],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05310372,"threshold_uncertainty_score":0.322346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013072857","doi":"10.1016/j.peva.2004.07.017","title":"Network traffic behaviour in switched Ethernet systems","year":2004,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto","keywords":"Computer network; Computer science; Ethernet; Carrier Ethernet","retraction":null,"screen_n_in":null,"score":{"opus":0.02417788076314523,"gpt":0.2585583099961761,"spread":0.2343804292330308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001831118,0.0001320386,0.0001560769,0.00008344522,0.00009630813,0.0001076186,0.0003761372,0.00008450811,0.00001273118],"category_scores_gemma":[0.0000172424,0.0001267453,0.00003060788,0.0005165339,0.00001728262,0.0005361866,0.00003208044,0.0001707669,0.0001276297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002106086,"about_ca_system_score_gemma":0.0002197242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002147887,"about_ca_topic_score_gemma":0.00005617793,"domain_scores_codex":[0.9984187,0.00008401875,0.000317002,0.0003072183,0.0005424558,0.0003305925],"domain_scores_gemma":[0.9993414,0.00003501178,0.000110892,0.000327739,0.0001293281,0.000055644],"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.000007463181,0.00003165047,0.00226712,0.000003911257,0.000003036257,0.000001077275,0.0003592632,0.8208845,0.000008559467,0.001492394,0.00008730694,0.1748537],"study_design_scores_gemma":[0.00138222,0.0000775497,0.03842018,0.00007557972,0.00001176031,0.000007862862,0.00002340541,0.959514,0.00001329527,0.0002219286,0.00009916344,0.0001530491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9542494,0.0008337038,0.04232359,0.0005752826,0.0009693074,0.0005484532,2.538535e-7,0.0001580068,0.0003419417],"genre_scores_gemma":[0.9983776,0.00003370594,0.0009136986,0.0001287497,0.0002890615,0.0001870914,0.000007489445,0.00000868698,0.00005394483],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1747007,"threshold_uncertainty_score":0.5168525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112601556","doi":"10.1016/s0166-5316(02)00137-2","title":"Delimiting the range of effectiveness of scalable on-demand streaming","year":2002,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Fudan University","keywords":"Scalability; Range (aeronautics); Computer science; On demand; Computer network; Multimedia; Database; Engineering; Aerospace engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04085063400201436,"gpt":0.2722504911061278,"spread":0.2313998571041134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00262801,0.00008575686,0.0001382022,0.0001185172,0.00009944999,0.00001992306,0.0005483853,0.00004080549,0.0000129098],"category_scores_gemma":[0.0002411672,0.00006284242,0.00003019319,0.0005890454,0.00004735724,0.0002950196,0.000128844,0.00008627589,0.00002071793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000585999,"about_ca_system_score_gemma":0.0000168783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006352539,"about_ca_topic_score_gemma":0.000001670916,"domain_scores_codex":[0.9987255,0.0001459319,0.0002105963,0.0001854116,0.0005652648,0.0001673176],"domain_scores_gemma":[0.998768,0.0003583442,0.0001409661,0.0004715843,0.0002455279,0.00001553898],"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.00002095928,0.0000681365,0.02346834,0.0001209746,0.0000198418,2.25898e-7,0.0008353131,0.0907389,0.004179982,0.001010896,0.0001112679,0.8794252],"study_design_scores_gemma":[0.0002909519,0.0001840935,0.1283274,0.0002383867,0.00001078822,0.000001315968,0.00001988913,0.8160195,0.05458389,0.0002306575,0.00002509505,0.0000680943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9785609,0.0002143451,0.01872944,0.000202633,0.0001207633,0.0003895329,7.189983e-7,0.00006499295,0.001716699],"genre_scores_gemma":[0.9967691,0.00003846727,0.003068129,0.00002192547,0.00002150219,0.00005865626,8.305404e-7,0.000004628027,0.00001671203],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.879357,"threshold_uncertainty_score":0.2562639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028516246","doi":"10.1016/j.peva.2007.06.011","title":"On processor sharing and its applications to cellular data network provisioning","year":2007,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Provisioning; Processor sharing; Queue; Computer science; Telecommunications link; Scheduling (production processes); Computer network; Channel (broadcasting); Distributed computing; Shared resource; Queueing theory; Homogeneous; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0413587070893839,"gpt":0.3076007119872022,"spread":0.2662420048978184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001146966,0.0001229509,0.00009179534,0.00008701214,0.0001795156,0.00003669316,0.0002063392,0.00005119832,0.00001708604],"category_scores_gemma":[0.00007850942,0.0001324738,0.000006250855,0.0004461387,0.000006385242,0.0005122075,0.00008692032,0.000115513,0.00004772568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009334119,"about_ca_system_score_gemma":0.00001510769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.478406e-7,"about_ca_topic_score_gemma":0.000004671664,"domain_scores_codex":[0.9988835,0.000007334213,0.0002298599,0.000306486,0.0003084998,0.0002643491],"domain_scores_gemma":[0.9993184,0.00004940446,0.00004606209,0.0003666584,0.0001486362,0.0000707997],"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.00001027055,0.0000055954,0.0004257424,0.00004115501,0.000004408358,7.74784e-8,0.00007633048,0.8743315,0.000421852,0.0001460724,0.00009249311,0.1244445],"study_design_scores_gemma":[0.0001730113,0.00002705603,0.001412177,0.00009421628,0.00001634533,7.404878e-7,0.00001137789,0.9951366,0.001961187,0.0001342115,0.0008799099,0.0001531619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4812563,0.0005485605,0.5158182,0.00002331212,0.00012235,0.001049251,0.000002137672,0.0001986266,0.0009812627],"genre_scores_gemma":[0.9891649,0.000117442,0.009885458,0.00004593034,0.0003447349,0.0001786298,0.0001986514,0.00003523535,0.00002897001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5079086,"threshold_uncertainty_score":0.5402125,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090470428","doi":"10.1016/j.peva.2008.03.001","title":"Limited choice and locality considerations for load balancing","year":2008,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Queue; Load balancing (electrical power); Locality; Server; Routing (electronic design automation); Scheme (mathematics); Distributed computing; Exploit; Process (computing); Computer network; Mathematics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.06260934305467594,"gpt":0.2938731989068489,"spread":0.231263855852173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001187836,0.0001002468,0.0001248535,0.0001040123,0.0005872099,0.00005933245,0.00004297633,0.0000366376,0.0001307796],"category_scores_gemma":[0.001751181,0.00009961672,0.00003317128,0.000226012,0.00006063106,0.001353369,0.00003021614,0.00005933215,0.00004418752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007703694,"about_ca_system_score_gemma":0.00005045168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004220288,"about_ca_topic_score_gemma":0.00007383199,"domain_scores_codex":[0.9991319,0.00001554561,0.0002067925,0.0002071764,0.0002870141,0.000151579],"domain_scores_gemma":[0.9988769,0.0001978567,0.0001496797,0.0001562284,0.0006109999,0.000008305698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003019036,0.0003296272,0.5509704,0.0009411511,0.0002794625,0.000002789336,0.001437853,0.285048,0.007090559,0.02213548,0.01073259,0.1207301],"study_design_scores_gemma":[0.0006879179,0.000008666838,0.06973315,0.0000217938,0.0001263066,0.000002930924,0.00003601626,0.9196491,0.0002228085,0.006361301,0.003001673,0.0001483582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9911348,0.00007914923,0.006108761,0.0005484979,0.0001185125,0.0003898664,0.000001207177,0.0000848411,0.001534325],"genre_scores_gemma":[0.9974248,0.00001952462,0.0009953416,0.0008627729,0.0004874892,0.00009370948,0.00003406518,0.00001139985,0.00007088057],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6346011,"threshold_uncertainty_score":0.4516403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102966671","doi":"10.1016/j.peva.2006.01.001","title":"Discrete-time single-server finite-buffer queues under discrete Markovian arrival process with vacations","year":2006,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Markovian arrival process; Computer science; Queue; Markov process; Blocking (statistics); Queueing theory; Real-time computing; Discrete time and continuous time; Fraction (chemistry); Markov chain; Process (computing); Computer network; Mathematics; Statistics; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01655201620770077,"gpt":0.2544099327511873,"spread":0.2378579165434865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009011482,0.0002753735,0.0002295418,0.0002959554,0.0004513757,0.0002700966,0.0002481217,0.00007040303,0.0009320262],"category_scores_gemma":[0.0001278909,0.0002255959,0.0000733694,0.0008969203,0.0001044517,0.003347433,0.00005787582,0.0001475059,0.0004722664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001332739,"about_ca_system_score_gemma":0.00004947194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007970042,"about_ca_topic_score_gemma":0.0001880288,"domain_scores_codex":[0.99804,0.00004250375,0.000365859,0.0004214091,0.0007797192,0.0003505287],"domain_scores_gemma":[0.998614,0.00007121467,0.0003653385,0.0003980352,0.0005358533,0.00001556355],"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.0003040141,0.0001891225,0.04071399,0.0001999836,0.00009685238,0.000001257391,0.0001248842,0.9472619,0.001133131,0.004418767,0.0003690552,0.005187099],"study_design_scores_gemma":[0.0009613819,0.00004260767,0.058766,0.000163631,0.0005631119,0.000001458576,0.000187588,0.9176589,0.0007907104,0.01933804,0.0009350174,0.0005915032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9756998,0.0000426608,0.007859684,0.0009159353,0.00009329715,0.0004864085,0.000003384436,0.0002154471,0.01468342],"genre_scores_gemma":[0.9964947,0.000002261871,0.0003292631,0.0003208547,0.0008264872,0.0001406351,0.0005145579,0.00005174486,0.001319498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02960289,"threshold_uncertainty_score":0.9999813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2177526080","doi":"10.1016/j.peva.2015.11.001","title":"An alternative method for computing system-length distributions of BMAP/R/1 and BMAP/D/1 queues using roots","year":2015,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Mathematics; Markovian arrival process; Applied mathematics; Phase-type distribution; Laplace transform; Matrix (chemical analysis); Computation; Exponential function; Mathematical analysis; Algorithm; Queueing theory; Exponential distribution; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.07553246955462467,"gpt":0.3743877055334124,"spread":0.2988552359787878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004036142,0.0001381333,0.0002380023,0.0002019012,0.000259309,0.000082021,0.0001297813,0.00004269802,0.000005784473],"category_scores_gemma":[0.0004297735,0.0001327848,0.00004446316,0.0003425144,0.00004575447,0.00164347,0.00006048385,0.0000618711,0.000004208338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001633503,"about_ca_system_score_gemma":0.00004335141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001476348,"about_ca_topic_score_gemma":0.00002282641,"domain_scores_codex":[0.9987817,0.00008210656,0.0003456184,0.0002540973,0.0003550892,0.000181358],"domain_scores_gemma":[0.9981327,0.00009704895,0.0004955741,0.0001984999,0.001057012,0.00001914506],"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.0002633672,0.0001107877,0.01176898,0.0006560184,0.0001384688,3.149189e-7,0.0007297039,0.8669946,0.004741681,0.03260057,0.00003815898,0.08195738],"study_design_scores_gemma":[0.0006416341,0.00002970766,0.001335736,0.0001272422,0.0003213811,0.000001620752,0.0009340029,0.9916224,0.001477304,0.003225219,0.0001322451,0.000151448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6064889,0.00005092162,0.3927706,0.00002726045,0.000135473,0.0002996603,0.000006026303,0.00004499682,0.0001761818],"genre_scores_gemma":[0.9759235,0.000001760512,0.02333806,0.00002621109,0.0005354484,0.00002424464,0.0001295108,0.00001666368,0.000004594181],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3694346,"threshold_uncertainty_score":0.5414806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086785629","doi":"10.1016/j.peva.2011.10.001","title":"Optimal anticipative congestion control of flows with time-varying input stream","year":2011,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"European Social Fund; Ministerio de Ciencia e Innovación; Universidad Carlos III de Madrid; Eusko Jaurlaritza; European Commission; Comunidad de Madrid","keywords":"Computer science; Bottleneck; Network congestion; Flow control (data); Router; Probabilistic logic; Transmission (telecommunications); Computer network; Index (typography); Markov process; Markov chain; Markov decision process; Flow (mathematics); Mathematical optimization; Mathematics; Network packet; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02923529351829863,"gpt":0.250301701071222,"spread":0.2210664075529233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000909062,0.0001431709,0.0002022081,0.000102911,0.0001034502,0.00002662459,0.0002823354,0.00005546902,0.0001644901],"category_scores_gemma":[0.0000355077,0.0001182766,0.00003348378,0.0002786046,0.00005682972,0.0008201829,0.00002803492,0.0001041426,0.00006584225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004534528,"about_ca_system_score_gemma":0.0001716668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008796651,"about_ca_topic_score_gemma":0.000003086582,"domain_scores_codex":[0.9985726,0.0001378751,0.0002810382,0.0002714878,0.0005187694,0.0002181916],"domain_scores_gemma":[0.998785,0.00007236785,0.0002369176,0.0003039547,0.0005448911,0.00005691847],"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.000344731,0.0001575569,0.00827161,0.00001869581,0.00009210939,0.00000164263,0.002746104,0.1999653,0.000736459,0.0009179116,0.00004458483,0.7867033],"study_design_scores_gemma":[0.001780715,0.000553304,0.02486488,0.00006796502,0.00007230819,0.000005434788,0.0000142623,0.9704735,0.001983525,0.00002549956,0.00001459403,0.0001440173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6842934,0.00006887518,0.3130107,0.00005991458,0.0001153275,0.0004072459,0.000001530139,0.00007605575,0.001966945],"genre_scores_gemma":[0.9866503,0.00001294616,0.01307887,0.00004801679,0.00005976583,0.00009037949,0.000008022569,0.000008046687,0.00004359867],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7865593,"threshold_uncertainty_score":0.4823181,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971438357","doi":"10.1016/s0166-5316(02)00232-8","title":"A preemptive resume queue with an expiry time for retained service","year":2003,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Preemption; Computer science; Task (project management); Service (business); Flow (mathematics); Event (particle physics); Mathematics; Computer network; Physics; Engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.03054012263118326,"gpt":0.2756305327288212,"spread":0.2450904100976379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00214023,0.0001647697,0.0001665796,0.0001744559,0.0002780232,0.00009677922,0.0001467036,0.00005067539,0.0003614953],"category_scores_gemma":[0.0003006181,0.0001423496,0.00003535615,0.0006047417,0.0000261693,0.002822177,0.0000194503,0.0000739594,0.0002398358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008035107,"about_ca_system_score_gemma":0.00005443365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001838087,"about_ca_topic_score_gemma":0.00007872818,"domain_scores_codex":[0.9987964,0.00004962453,0.0002118749,0.000325402,0.0003786082,0.0002380719],"domain_scores_gemma":[0.9984761,0.00004863243,0.0002493589,0.0003396448,0.000873796,0.00001244548],"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.009536048,0.001075405,0.02728895,0.001767392,0.0007834339,0.00000505215,0.004711085,0.7307923,0.01517446,0.06239275,0.002251843,0.1442212],"study_design_scores_gemma":[0.001347019,0.00008699278,0.002252434,0.00006562038,0.0003174751,0.00000128306,0.0002961539,0.9838548,0.0008625378,0.007133938,0.003484336,0.0002974282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9859866,0.00002241545,0.004962082,0.0002602453,0.00006117809,0.0008217503,0.000001564229,0.0001266721,0.00775742],"genre_scores_gemma":[0.9951136,0.000001803547,0.002851767,0.0007819405,0.0003270259,0.00025627,0.0001682952,0.00003470063,0.0004646217],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2530624,"threshold_uncertainty_score":0.5804847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139509158","doi":"10.1016/j.peva.2009.12.008","title":"Symbolic partition refinement with automatic balancing of time and space","year":2010,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"","keywords":"Markov chain; Computer science; Partition (number theory); Markov model; Markov process; Preprocessor; State space; Theoretical computer science; Algorithm; Variable-order Markov model; Mathematics; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.01808420996405736,"gpt":0.2860252269698289,"spread":0.2679410170057716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001850297,0.00007536817,0.00009574337,0.00008441463,0.00007639766,0.00003368286,0.000149518,0.0000348148,0.000046868],"category_scores_gemma":[0.00009453501,0.00006272477,0.000009511238,0.000229856,0.00004290699,0.0006794618,0.00003796397,0.00008847104,0.00002754152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002874435,"about_ca_system_score_gemma":0.00006557164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006078686,"about_ca_topic_score_gemma":0.000004803537,"domain_scores_codex":[0.9990265,0.00006327531,0.0001899516,0.0001684549,0.0004347476,0.0001170128],"domain_scores_gemma":[0.9992433,0.00002533612,0.0001739335,0.0003424428,0.0001834434,0.00003153245],"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.00002358912,0.00009900237,0.01794327,0.0001987,0.00002371258,2.349061e-7,0.003249213,0.003148533,0.2234822,0.01315444,0.00008427589,0.7385928],"study_design_scores_gemma":[0.0002129981,0.0001116894,0.1464316,0.00003755491,0.00001238734,0.000007209904,0.000005494877,0.8076667,0.04527395,0.0001371267,0.00003661927,0.00006676171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9466123,0.00001299397,0.05185688,0.0001453535,0.0001262892,0.0002553069,4.048366e-7,0.00005754526,0.0009329556],"genre_scores_gemma":[0.7679006,0.00000754467,0.2319913,0.00001439441,0.00002224385,0.00003748062,0.000004098109,0.000003658889,0.00001866506],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8045181,"threshold_uncertainty_score":0.2557842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075246343","doi":"10.1016/s0166-5316(00)00065-1","title":"Evaluating layered distributed software systems with fault-tolerant features","year":2001,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed computing; Software fault tolerance; Fault tolerance; Software; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.04137402653265357,"gpt":0.3151699585172764,"spread":0.2737959319846228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003151645,0.0003119522,0.0003384296,0.0001504153,0.0005400626,0.0003150164,0.0007106636,0.0001450992,0.00003305911],"category_scores_gemma":[0.0002367098,0.000224685,0.00006915705,0.0009706924,0.00006085864,0.001602225,0.0001149527,0.0002608436,0.0001325457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003335182,"about_ca_system_score_gemma":0.0003673217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000976625,"about_ca_topic_score_gemma":0.00001513127,"domain_scores_codex":[0.9961405,0.0002845469,0.0005374305,0.0006694837,0.001825589,0.000542428],"domain_scores_gemma":[0.9973459,0.0001100455,0.0003233106,0.001034631,0.001060779,0.0001253739],"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.0001646949,0.0001345214,0.1509875,0.0002252654,0.00007055639,0.000006938234,0.001363316,0.540333,0.0002062897,0.00006866804,0.00056054,0.3058786],"study_design_scores_gemma":[0.001170958,0.0003626412,0.2182464,0.0002232014,0.00002829584,0.0001439086,0.00007688776,0.7787158,0.000274902,0.00003474066,0.0004027431,0.0003194937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.794502,0.0005490729,0.2022184,0.0001797602,0.00080031,0.001045631,0.000006392033,0.0004702749,0.0002281696],"genre_scores_gemma":[0.9910843,0.0000586628,0.007942531,0.000060721,0.0002266962,0.0003825734,0.00009810891,0.00002041681,0.0001260326],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3055591,"threshold_uncertainty_score":0.9162391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105538778","doi":"10.1016/j.peva.2008.02.001","title":"Algorithmic analysis of the discrete time GIX/GY/1 queueing system","year":2008,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; University of Manitoba","funders":"","keywords":"Markov chain; Queueing theory; Bulk queue; Computer science; Markov process; Queue; Mean value analysis; Layered queueing network; Applied mathematics; Mathematics; Discrete mathematics; Statistics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0183713595440142,"gpt":0.2451642803064485,"spread":0.2267929207624343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001501742,0.0001409227,0.0002883832,0.0004568361,0.0004120755,0.00003234384,0.0002876219,0.00004365695,0.0002572249],"category_scores_gemma":[0.0001447348,0.0001039205,0.0002163957,0.002529953,0.00008436111,0.001101488,0.0001014221,0.00009283693,0.0001836528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001244534,"about_ca_system_score_gemma":0.00003064906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008497519,"about_ca_topic_score_gemma":0.00001665715,"domain_scores_codex":[0.9984434,0.00005595883,0.0003839831,0.0002309738,0.0007021828,0.0001835261],"domain_scores_gemma":[0.9986151,0.00004156252,0.000512093,0.0004542567,0.0003702444,0.000006771229],"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.00006808962,0.00004895114,0.09424519,0.0002123969,0.001081451,0.000001234893,0.0004324674,0.8825476,0.003021164,0.00226093,0.0001893009,0.01589127],"study_design_scores_gemma":[0.000189561,0.000003396997,0.07688162,0.00005332433,0.001975416,9.714707e-7,0.00007808035,0.9200555,0.0003629493,0.00008688134,0.0001899229,0.000122366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9921359,0.00005360997,0.002103704,0.00009494349,0.0001460638,0.0002677075,0.000002007577,0.00008047181,0.005115591],"genre_scores_gemma":[0.9991066,0.000006623083,0.0001369256,0.00007679397,0.0002810987,0.00003317663,0.0000466009,0.00001530655,0.0002968921],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03750795,"threshold_uncertainty_score":0.4237754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977167986","doi":"10.1016/s0166-5316(02)00087-1","title":"A performance analysis of a discrete-time queueing system with server interruption for modeling wireless ATM multiplexer","year":2002,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Multiplexer; Queueing theory; Computer science; Computer network; Layered queueing network; Wireless; Queueing system; Real-time computing; Multiplexing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03147146219320217,"gpt":0.2537607558979556,"spread":0.2222892937047534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005443005,0.0002240558,0.0003652643,0.0003345643,0.0001160604,0.00002185067,0.0001125093,0.00009021971,0.00005659685],"category_scores_gemma":[0.00001021406,0.000209426,0.00008994256,0.0009506915,0.00002157713,0.001044387,0.0000160388,0.00009717154,0.00001253516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003641908,"about_ca_system_score_gemma":0.000009655137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005561837,"about_ca_topic_score_gemma":0.00001534331,"domain_scores_codex":[0.9984902,0.00003618358,0.0004773978,0.0002299603,0.000452659,0.0003135779],"domain_scores_gemma":[0.9991262,0.00003840762,0.0001644061,0.0002793048,0.000341943,0.00004974732],"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.00005743793,0.00001665911,0.005294557,0.0003261419,0.000258459,3.674759e-8,0.0007932252,0.9707983,0.0007694978,0.000008757001,0.000003406676,0.02167352],"study_design_scores_gemma":[0.0007075134,0.00006988423,0.002374965,0.0003228454,0.0008248705,0.000001411555,0.00009926949,0.9944559,0.0008841922,3.385327e-7,0.000002863419,0.0002559966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6785366,0.0001356472,0.3204204,0.000003123557,0.00007372291,0.000511934,0.000005885028,0.0001541345,0.000158547],"genre_scores_gemma":[0.9927648,0.0001249896,0.006404195,0.000003027548,0.00009022505,0.0003373116,0.0001935855,0.00005675994,0.00002510627],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3142282,"threshold_uncertainty_score":0.8540142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091797596","doi":"10.1016/s0166-5316(00)00015-8","title":"Optimal (N,T)-policy for M/G/1 system with cost structures","year":2000,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Timer; Computer science; Real-time computing; Operations research; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02062277970399923,"gpt":0.2823533980073662,"spread":0.261730618303367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007470648,0.0001424267,0.0001473635,0.0001976136,0.000311233,0.0001213016,0.0001416568,0.0000381173,0.0004024699],"category_scores_gemma":[0.00006131955,0.0001147742,0.00004299775,0.000461479,0.00003921192,0.001296389,0.00001425242,0.00005760411,0.0001797847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001315744,"about_ca_system_score_gemma":0.00004453994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000380511,"about_ca_topic_score_gemma":0.00001473638,"domain_scores_codex":[0.9989878,0.00001217128,0.0001892441,0.000226691,0.0003561294,0.0002279746],"domain_scores_gemma":[0.999306,0.00002495563,0.0001471084,0.0002198889,0.0002933048,0.000008795316],"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.000328429,0.00001198278,0.0007479755,0.0001535375,0.0000320375,2.212838e-7,0.00004477804,0.7729307,0.00003908339,0.01100762,0.0001585456,0.2145451],"study_design_scores_gemma":[0.0008758457,0.00002317833,0.003702597,0.00005555785,0.0001786854,0.000002523046,0.0001121433,0.9847334,0.0001823073,0.0006238775,0.009318619,0.0001912354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9776363,0.00002673687,0.007845179,0.0001976259,0.00007328626,0.0008242927,0.000002727276,0.0001595497,0.01323431],"genre_scores_gemma":[0.996348,0.00000389731,0.001326944,0.0002465268,0.001364178,0.0002706414,0.0001018507,0.00002501411,0.0003129307],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2143539,"threshold_uncertainty_score":0.4680356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006165916","doi":"10.1016/j.peva.2011.12.001","title":"Computing system-time and system-length distributions for MAP/D/1 queue using distributional Little’s law","year":2012,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Council of Scientific and Industrial Research, India","keywords":"Laplace transform; Computation; Queue; Computer science; Applied mathematics; Queueing theory; Bulk queue; Mathematics; Algorithm; Mathematical optimization; Mathematical analysis; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02793574997136396,"gpt":0.2786795499097621,"spread":0.2507437999383981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003751544,0.0001964685,0.0002459825,0.0001181558,0.00103573,0.0001611766,0.0001143605,0.00007473196,0.00003405207],"category_scores_gemma":[0.0001983676,0.0001937014,0.00007881058,0.0003087862,0.00008109387,0.002104504,0.00009741604,0.00009248976,0.0001244004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005048112,"about_ca_system_score_gemma":0.00002847374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006192927,"about_ca_topic_score_gemma":0.000005148571,"domain_scores_codex":[0.998476,0.00006069775,0.0003969558,0.0002581458,0.0003939325,0.0004142553],"domain_scores_gemma":[0.9987524,0.0001392321,0.0003671231,0.0002072891,0.0005067248,0.00002724335],"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.0002406587,0.000185735,0.01897994,0.003142958,0.0002491942,4.357051e-7,0.0001662584,0.05504206,0.00343373,0.9101195,0.0003454998,0.00809397],"study_design_scores_gemma":[0.0004854018,0.000006669523,0.002883002,0.0002613855,0.0004618739,0.000007229791,0.00020605,0.9929267,0.0001536106,0.0002597008,0.002107452,0.0002408919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8907686,0.0002630639,0.1063264,0.00009682981,0.000563415,0.000727061,0.00007508418,0.0002307432,0.0009487708],"genre_scores_gemma":[0.9955969,9.683799e-7,0.001353711,0.00004599841,0.001850908,0.00005800425,0.001049436,0.00002290823,0.00002116224],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9378847,"threshold_uncertainty_score":0.79661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985799965","doi":"10.1016/s0166-5316(02)00084-6","title":"A vacation model for the non-saturated Readers and Writers system with a threshold policy","year":2002,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04874494363695795,"gpt":0.2601385015211586,"spread":0.2113935578842007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000246172,0.00007857578,0.00005781061,0.00008577885,0.0001328103,0.00002855971,0.00004205246,0.0000350694,0.00000525482],"category_scores_gemma":[0.000006690789,0.00005733385,0.00001192593,0.0002717338,0.00002339023,0.0002451679,0.00000125842,0.00005848919,0.000003651987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008965616,"about_ca_system_score_gemma":0.0000226209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007023085,"about_ca_topic_score_gemma":0.00003057263,"domain_scores_codex":[0.9994862,0.000003749961,0.0001470762,0.00009143577,0.0001651946,0.0001063125],"domain_scores_gemma":[0.999643,0.00001967095,0.00002949828,0.0001267875,0.0001623079,0.00001875707],"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.00001284255,0.00000713732,0.000527065,0.0001177447,0.00002586097,1.551948e-8,0.00381919,0.9757687,0.0005564052,0.0005518137,0.0002618276,0.01835136],"study_design_scores_gemma":[0.000519276,0.00002152653,0.01687535,0.00003359808,0.00004567395,0.000001641974,0.0003782073,0.9817732,0.0002155174,0.000007501465,0.0000537579,0.00007473034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.879658,0.0001090454,0.1177945,0.0005729578,0.00006404991,0.001077688,0.00001462643,0.0001524238,0.0005566086],"genre_scores_gemma":[0.9986249,0.00006201326,0.0006049316,0.0000578666,0.00004111555,0.0004896506,0.00006306798,0.00001302833,0.00004348415],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1189668,"threshold_uncertainty_score":0.2338006,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963795908","doi":"10.1016/j.peva.2007.12.006","title":"A stochastic model for the throughput of non-persistent TCP flows","year":2008,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Throughput; Idle; Network packet; File transfer; Download; Flow (mathematics); File size; Transfer (computing); Stochastic modelling; Computer network; Parallel computing; Mathematics; Operating system; Wireless; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05952514272069574,"gpt":0.2785033849298072,"spread":0.2189782422091114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007325954,0.00008632604,0.0001100018,0.00003577545,0.000263589,0.00001541059,0.0003752688,0.00003149687,0.000007870879],"category_scores_gemma":[0.00003766756,0.0000613384,0.0000929895,0.0001594045,0.00003994754,0.0003048379,0.00003457887,0.00005898951,0.00001281427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004197988,"about_ca_system_score_gemma":0.0002116327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001890228,"about_ca_topic_score_gemma":0.000003217732,"domain_scores_codex":[0.9989785,0.000022903,0.0002095434,0.0001827246,0.0004445107,0.0001618079],"domain_scores_gemma":[0.9990687,0.0001285135,0.0001066983,0.0003388865,0.0003305565,0.00002665094],"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.00001541345,0.00001726983,0.00001904398,0.000004808779,0.00001471102,2.300663e-8,0.0009975174,0.7906907,0.00003914681,0.0002352219,0.0003286162,0.2076375],"study_design_scores_gemma":[0.0007326311,0.0001019007,0.0008102464,0.00001522085,0.00004270252,0.000004852971,0.0000160651,0.9980282,0.00004018403,0.00009083572,0.00004197034,0.00007518964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1729083,0.000243366,0.8253424,0.0004939967,0.0002701622,0.000599373,0.000001048933,0.00002739002,0.0001139429],"genre_scores_gemma":[0.9911606,0.00004429558,0.008126126,0.0001275181,0.0001010805,0.0002858271,0.000002992878,0.000005006541,0.0001465447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8182523,"threshold_uncertainty_score":0.2501307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996776639","doi":"10.1016/j.peva.2009.02.004","title":"Packet delay analysis for multichannel communication systems with MSW-ARQ","year":2009,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Transmission delay; Selective Repeat ARQ; Network packet; Automatic repeat request; Go-Back-N ARQ; Processing delay; Computer science; Hybrid automatic repeat request; Sliding window protocol; End-to-end delay; Real-time computing; Computer network; Algorithm; Transmission (telecommunications); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02060923248736774,"gpt":0.2606150488882069,"spread":0.2400058164008391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005546545,0.0001421182,0.0001843194,0.0001879716,0.0001422774,0.00004234867,0.0001143654,0.00006631446,0.00001011818],"category_scores_gemma":[0.00002144628,0.0001335162,0.00003906772,0.000690172,0.00001474525,0.0005023578,0.000005102158,0.00007919031,0.000007676175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001854574,"about_ca_system_score_gemma":0.00001650876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002321525,"about_ca_topic_score_gemma":0.00001560301,"domain_scores_codex":[0.9990555,0.00004113828,0.0002553121,0.0001523005,0.0002971739,0.0001985416],"domain_scores_gemma":[0.9991176,0.00005292418,0.00009204137,0.0003570647,0.0003427899,0.00003758972],"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.00002803943,0.0000129144,0.0009924374,0.00001781343,0.00008833642,3.302283e-8,0.0002373697,0.9777355,0.00006226715,0.00004858753,0.00007473839,0.02070196],"study_design_scores_gemma":[0.0006055515,0.00008437759,0.01081684,0.00004448447,0.0003515925,0.000001125512,0.00005456433,0.9874318,0.0002971375,0.0000313038,0.0001048006,0.0001764332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.390853,0.0005969161,0.6071721,0.0000328909,0.00007773399,0.0007404412,0.00000516469,0.0001888606,0.0003328434],"genre_scores_gemma":[0.9811013,0.0003579338,0.01754971,0.00001660869,0.00007327819,0.0002892601,0.0005647586,0.00002249313,0.00002463561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5902483,"threshold_uncertainty_score":0.5444631,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051948841","doi":"10.1016/j.peva.2007.02.001","title":"The use of the distributional Little’s law in the computational analysis of discrete-time GI/G/1 and GI/D/c queues","year":2007,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Discrete time and continuous time; Computer science; Relation (database); Distribution (mathematics); Simple (philosophy); Mathematics; Sample (material); Applied mathematics; Mathematical optimization; Real-time computing; Computer network; Mathematical analysis; Statistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03171521318396293,"gpt":0.2861872548592808,"spread":0.2544720416753178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003891549,0.00009022786,0.0001499072,0.0001451917,0.0003422328,0.00007562222,0.0002106693,0.00002904303,0.00004321996],"category_scores_gemma":[0.0003858122,0.00004842219,0.00009328734,0.001377851,0.000288547,0.0007425077,0.00007392802,0.0000891282,0.000004056719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004049926,"about_ca_system_score_gemma":0.00001826439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001402182,"about_ca_topic_score_gemma":0.0004583042,"domain_scores_codex":[0.998623,0.00008235373,0.0003840751,0.0001322768,0.0006455358,0.000132834],"domain_scores_gemma":[0.9984095,0.0006233856,0.0003862916,0.0002289089,0.0003479103,0.000004044414],"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.0001374828,0.00006554264,0.1356451,0.00003314896,0.0002698044,1.333567e-7,0.000319974,0.7496304,0.0001732578,0.1039363,0.00009344682,0.009695455],"study_design_scores_gemma":[0.0001243251,0.0000034911,0.3795162,0.00001509353,0.0004035374,1.601211e-7,0.0000811261,0.6142856,0.00003983927,0.004903162,0.000582557,0.00004486252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9959292,0.00006669913,0.002659046,0.0006796039,0.00004038142,0.000217686,0.0000106137,0.000007563238,0.0003892149],"genre_scores_gemma":[0.9994328,0.000007851417,0.0001048643,0.0002013521,0.00007476422,0.00001083231,0.0001402207,0.00000446983,0.00002282173],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2438712,"threshold_uncertainty_score":0.2632213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063203387","doi":"10.1016/s0166-5316(01)00029-3","title":"WINTRAC: a TCP window adjustment scheme for bandwidth management","year":2001,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Window (computing); HSTCP; Computer network; Bandwidth (computing); Scheme (mathematics); TCP global synchronization; Network congestion; Operating system; Mathematics; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.024510565279508,"gpt":0.2702046739707384,"spread":0.2456941086912304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001017329,0.000132968,0.0001184979,0.00008928229,0.0001794575,0.00007847609,0.0003588986,0.00004207077,0.00009549126],"category_scores_gemma":[0.00001342594,0.0001239094,0.00005660416,0.0002683098,0.00001672583,0.0005713836,0.00004964651,0.00006375559,0.0001159713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001152433,"about_ca_system_score_gemma":0.00005804495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.55577e-7,"about_ca_topic_score_gemma":0.000002393636,"domain_scores_codex":[0.9985476,0.00004230427,0.0002357136,0.0003373355,0.0005353731,0.000301714],"domain_scores_gemma":[0.999218,0.00003986052,0.00009453258,0.0003733058,0.0002087509,0.00006557735],"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.00003724529,0.00005148569,0.0005453433,0.00001345311,0.00002749161,5.644205e-7,0.00009750004,0.006954601,0.00003461444,0.004796972,0.00169262,0.9857481],"study_design_scores_gemma":[0.001818767,0.000129592,0.02269019,0.00003163146,0.00003757231,0.000006335387,0.00001429509,0.9566024,0.00009062417,0.0004392228,0.01798309,0.0001563083],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2052536,0.0006172857,0.7829232,0.002047933,0.001163802,0.001787225,9.884127e-7,0.0002308881,0.005975099],"genre_scores_gemma":[0.9709721,0.0002944813,0.02616009,0.0005103077,0.0003712877,0.0007594821,0.00001696353,0.000008808588,0.0009064953],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9855918,"threshold_uncertainty_score":0.5052877,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147021610","doi":"10.1016/j.peva.2007.10.004","title":"Buffer overflow asymptotics for multiplexed regulated traffic","year":2007,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Queue; Poisson distribution; Workload; FIFO (computing and electronics); Computer science; Network packet; Multiplexing; Queueing theory; Constant (computer programming); Upper and lower bounds; Computer network; Superposition principle; Buffer overflow; Topology (electrical circuits); Real-time computing; Mathematics; Telecommunications; Statistics; Combinatorics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02483083695767474,"gpt":0.2763144868650109,"spread":0.2514836499073362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002575428,0.0001423499,0.0001387091,0.0001095328,0.0002053886,0.00007781665,0.0003351424,0.00009456136,0.00002565585],"category_scores_gemma":[0.000101569,0.0001355728,0.00006607849,0.0003319262,0.00002626137,0.0005214546,0.00002769395,0.00009277298,0.00004837769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001163195,"about_ca_system_score_gemma":0.0001141479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.49186e-7,"about_ca_topic_score_gemma":0.000009508203,"domain_scores_codex":[0.99841,0.00004338466,0.0003253192,0.000320217,0.0005344072,0.0003666222],"domain_scores_gemma":[0.9987864,0.0001959198,0.0001225117,0.0003654113,0.0004494513,0.0000802892],"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.00005619047,0.00003970998,0.0003260803,0.000008323561,0.00001452901,2.187561e-7,0.0002225653,0.09941466,0.0005470574,0.00102148,0.0005529129,0.8977963],"study_design_scores_gemma":[0.001727011,0.0001339669,0.01894095,0.00001986311,0.00002720207,0.00000359447,0.000009214377,0.9756124,0.001322669,0.00008529836,0.001942338,0.0001755163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6138541,0.0001087836,0.3838616,0.0003038878,0.0007441969,0.0006532855,8.405794e-7,0.0001932254,0.000280065],"genre_scores_gemma":[0.9814643,0.0000136908,0.01767732,0.0001931405,0.0003063149,0.00006969601,0.00002446978,0.00001149551,0.000239544],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8976207,"threshold_uncertainty_score":0.5528497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026206839","doi":"10.1016/j.peva.2004.07.009","title":"Time-domain analysis of Web cache filter effects","year":2004,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cache; Computer science; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01727333747489877,"gpt":0.2551807127017554,"spread":0.2379073752268566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001027831,0.00008153894,0.0001587638,0.0002904806,0.00006924222,0.00002970542,0.0002731748,0.0000345159,0.0000326975],"category_scores_gemma":[0.00004072629,0.00007316442,0.0001011756,0.0008456957,0.00002337774,0.0004141383,0.00005325063,0.00006350199,0.0001013291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009777508,"about_ca_system_score_gemma":0.00009918885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001959796,"about_ca_topic_score_gemma":0.000007575158,"domain_scores_codex":[0.9988858,0.00008163456,0.0001801441,0.0001995602,0.0005196671,0.0001331758],"domain_scores_gemma":[0.9993095,0.00004799904,0.00009862259,0.0003684144,0.0001448068,0.00003068669],"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.00004455492,0.0002771847,0.01114487,0.0000830858,0.0009249115,0.000003369064,0.00454387,0.6114429,0.1702488,0.001290807,0.0003849816,0.1996107],"study_design_scores_gemma":[0.0005519108,0.00008343224,0.03926744,0.00002639778,0.000232639,0.000001062705,0.000006646438,0.951845,0.007707334,0.0001638368,0.00002228113,0.00009204986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9661938,0.0001012775,0.0324537,0.0001651611,0.0001320978,0.000143146,0.000001157562,0.00004716738,0.000762478],"genre_scores_gemma":[0.998358,0.000008928716,0.001406434,0.00009313965,0.00002733552,0.00002105443,0.00001636945,0.000003318536,0.00006546109],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3404021,"threshold_uncertainty_score":0.2983559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2947759080","doi":"10.1016/j.peva.2018.09.006","title":"Worst-case bounds and optimized cache on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e2260\" altimg=\"si453.gif\"><mml:mi>M</mml:mi></mml:math>th request cache insertion policies under elastic conditions","year":2018,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Cache; Bandwidth (computing); Cloud computing; Online algorithm; CPU cache; Upper and lower bounds; Competitive analysis; Average cost","retraction":null,"screen_n_in":null,"score":{"opus":0.03297753809922176,"gpt":0.2783680073841614,"spread":0.2453904692849396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001285747,0.0002655434,0.0001660484,0.0001898316,0.001021013,0.0004718853,0.0003356742,0.0002300966,0.0000229125],"category_scores_gemma":[0.0002778633,0.0002877532,0.0001278832,0.0003280207,0.0002592553,0.001198141,0.0002159755,0.0003395313,0.0003744317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007415008,"about_ca_system_score_gemma":0.0003241368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004865393,"about_ca_topic_score_gemma":0.0002457638,"domain_scores_codex":[0.9976432,0.0001442689,0.0004521791,0.0005311949,0.000788284,0.0004408121],"domain_scores_gemma":[0.9983836,0.0002667979,0.0003385888,0.0006613344,0.0001998071,0.0001498634],"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.0002374972,0.0001500538,0.00006736998,0.00007337701,0.0001094535,0.00003282335,0.002110079,0.01596963,0.001851265,0.9751371,0.000384125,0.003877249],"study_design_scores_gemma":[0.001038118,0.0006138052,0.001485335,0.0002560214,0.0001682856,0.000374852,0.0002392426,0.9937714,0.001237482,0.0004002855,0.0001303052,0.0002849152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9876586,0.0001660669,0.009917514,0.000503321,0.0007881903,0.0001168881,0.00003158116,0.0001610059,0.0006568255],"genre_scores_gemma":[0.9969317,0.0001526464,0.001199929,0.0007631771,0.0004657269,0.0001824342,0.0001978658,0.00003845777,0.00006803537],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9778017,"threshold_uncertainty_score":0.9999574,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071777054","doi":"10.1016/j.peva.2011.11.001","title":"Analysis of discrete-time MAP/G/1 queue under workload control","year":2011,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea","keywords":"Workload; Queue; Computer science; Idle; Service (business); Real-time computing; Queueing theory; Computer network; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02871462247219972,"gpt":0.2628722531438041,"spread":0.2341576306716044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001788876,0.0001573015,0.0003446262,0.0007089578,0.0001270665,0.00003527465,0.0002152504,0.00005800192,0.003772127],"category_scores_gemma":[0.0001213982,0.0001422241,0.000180649,0.001615478,0.00007261202,0.00141209,0.00004772603,0.0000821397,0.0005058139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005815832,"about_ca_system_score_gemma":0.00002031497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008542782,"about_ca_topic_score_gemma":0.00004549956,"domain_scores_codex":[0.9985943,0.00004304394,0.0003966899,0.0002589647,0.0004954045,0.0002115287],"domain_scores_gemma":[0.9986694,0.00004708135,0.0004603133,0.0003748999,0.0004379129,0.00001038259],"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.0007845702,0.0002951688,0.2468885,0.0001396843,0.003955923,0.000001122036,0.0006087188,0.6552299,0.002633543,0.009828167,0.000209284,0.07942541],"study_design_scores_gemma":[0.0004961675,0.00001075917,0.10736,0.00003695957,0.004553348,7.226701e-8,0.00008457716,0.8842512,0.0002185415,0.002708322,0.00009888021,0.0001812058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.972001,0.0001122168,0.01537867,0.0001225918,0.0001259381,0.0002889644,0.000002914705,0.00008403874,0.01188374],"genre_scores_gemma":[0.9989882,0.000007947387,0.000229633,0.0002913866,0.0001716889,0.00004070686,0.0000718926,0.00001633951,0.0001822686],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2290213,"threshold_uncertainty_score":0.9971386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083945769","doi":"10.1016/j.peva.2003.07.011","title":"Analyzing the effectiveness of fault-management architectures in layered distributed systems","year":2003,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Architecture; Distributed computing; Fault management; Systems architecture; Queueing theory; Fault (geology); Multitier architecture; Computer network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01600039442384952,"gpt":0.2751188423441918,"spread":0.2591184479203422,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008414771,0.0001241387,0.0001978431,0.0001462697,0.0001166637,0.00004733909,0.0004206958,0.00004795384,0.000003708099],"category_scores_gemma":[0.0001790688,0.00008036323,0.00004914161,0.0008751206,0.00004191656,0.0002244214,0.00005773831,0.0001156421,0.000009185326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001602499,"about_ca_system_score_gemma":0.00007047677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003974499,"about_ca_topic_score_gemma":0.000004632723,"domain_scores_codex":[0.9975659,0.001053569,0.0003795165,0.0002729385,0.0005087146,0.000219381],"domain_scores_gemma":[0.9988088,0.0002374736,0.0001520929,0.0005939846,0.000183631,0.00002404651],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00004359341,0.0000740993,0.2438029,0.0006423469,0.00003938027,5.500539e-7,0.0004793288,0.7254716,0.0002297395,0.001651796,0.00001054553,0.02755413],"study_design_scores_gemma":[0.0005680418,0.0000469646,0.5594013,0.0002158912,0.00001080391,0.000003670862,0.00005057676,0.4369944,0.002228816,0.0003375771,0.00004716731,0.00009478465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8734394,0.0004553664,0.1240723,0.00001588228,0.0004149748,0.0009527125,0.000001481739,0.00003769755,0.0006101436],"genre_scores_gemma":[0.999324,0.00003646759,0.0003702075,0.000003490495,0.0000142561,0.0002354252,0.000007288786,0.000004612471,0.00000425521],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3155984,"threshold_uncertainty_score":0.3277117,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977697622","doi":"10.1016/j.peva.2009.10.006","title":"CST: A new contention reduction scheme in all-optical packet switched star-based metro networks","year":2009,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Sahand University of Technology","keywords":"Computer science; Computer network; Network packet; Bandwidth (computing); Optical switch; Reduction (mathematics); Star network; Packet switching; Enhanced Data Rates for GSM Evolution; Network topology; Topology (electrical circuits); Electronic engineering; Telecommunications; Engineering; Ring network; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04253300776648729,"gpt":0.2916673871882909,"spread":0.2491343794218036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005750802,0.0002003863,0.0002108863,0.0002008434,0.00004283934,0.00003250025,0.0001267852,0.0002059171,0.00005087708],"category_scores_gemma":[0.0001557103,0.0002073629,0.00004800637,0.0005799769,0.00003608359,0.0005157868,0.00001196546,0.0003852143,0.00003059634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004666856,"about_ca_system_score_gemma":0.0000387632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002081896,"about_ca_topic_score_gemma":0.00001280449,"domain_scores_codex":[0.9985139,0.00002733899,0.0003844298,0.0002516398,0.0004121293,0.0004105657],"domain_scores_gemma":[0.9994634,0.00003582474,0.00005584289,0.0002742458,0.000100638,0.00007004229],"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.0000720246,0.00003491393,0.0007085436,0.00001078315,0.00001082245,6.05638e-7,0.00002830788,0.7611046,0.007585837,0.0001956983,0.0002759718,0.2299719],"study_design_scores_gemma":[0.001094217,0.0001718698,0.02683629,0.0000696732,0.00002901848,0.000001651351,0.00004161505,0.9647679,0.005635918,0.001027226,0.0001018256,0.0002228209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9026563,0.0004936093,0.09455863,0.0004865455,0.0002933471,0.000504192,4.703858e-7,0.0006132794,0.0003936249],"genre_scores_gemma":[0.9603491,0.0001643397,0.03910647,0.00005145774,0.0001724719,0.00005233217,0.00006940251,0.00002134094,0.00001312933],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.229749,"threshold_uncertainty_score":0.8456013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086767841","doi":"10.1016/j.peva.2009.03.001","title":"A performance analysis of discrete-time tandem queues with Markovian sources","year":2009,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Multiplexer; Computer science; Queue; Queueing theory; Multiplexing; Generating function; Tandem; Topology (electrical circuits); Markov process; Mathematics; Algorithm; Computer network; Discrete mathematics; Telecommunications; Statistics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01197467996192025,"gpt":0.2501685589656443,"spread":0.238193879003724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001592447,0.0002141858,0.0004088861,0.0008536087,0.0002380012,0.00008427299,0.0002417769,0.00005363351,0.0006494032],"category_scores_gemma":[0.00009582912,0.0001708003,0.0001264987,0.002618887,0.00008042558,0.002084265,0.00003431031,0.0001005764,0.00008265253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006730814,"about_ca_system_score_gemma":0.00002974357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002067,"about_ca_topic_score_gemma":0.00003250643,"domain_scores_codex":[0.9982086,0.00003140051,0.0004113082,0.0003190494,0.0007629847,0.0002667011],"domain_scores_gemma":[0.9985628,0.00003620272,0.0005541663,0.0003808759,0.0004522566,0.00001369679],"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.0003658897,0.0001101023,0.2684638,0.00007807837,0.0006293285,6.442418e-7,0.0002946368,0.6388977,0.001685061,0.0004256765,0.00006694618,0.08898214],"study_design_scores_gemma":[0.000326023,0.00005638121,0.2245167,0.00005846709,0.002371973,3.351021e-7,0.00006837527,0.771576,0.0004329027,0.0002026037,0.0001877757,0.0002023789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9899534,0.00005676236,0.0004741184,0.0001964032,0.00002745804,0.0002376992,0.000001251745,0.00009569178,0.008957204],"genre_scores_gemma":[0.9988557,0.00002319334,0.0002791271,0.0002430931,0.0002021266,0.00002154666,0.0001341482,0.00001523749,0.0002258139],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1326783,"threshold_uncertainty_score":0.7110509,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052011771","doi":"10.1016/j.peva.2004.09.004","title":"Iterative algorithms for performance evaluation of closed network models","year":2004,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Queueing theory; Computer science; Layered queueing network; Mathematical optimization; Mean value analysis; Algorithm; Sensitivity (control systems); G-network; Nonlinear system; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.07225961829479466,"gpt":0.3175862268961517,"spread":0.245326608601357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006389933,0.0002206309,0.0002812529,0.0002526577,0.0003586394,0.00007218729,0.0002119733,0.00008150599,0.0001268891],"category_scores_gemma":[0.0002524588,0.00021361,0.0001131428,0.0007725895,0.00006390271,0.00355812,0.00005301769,0.0001057859,0.00005044113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002706232,"about_ca_system_score_gemma":0.0001376985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001644213,"about_ca_topic_score_gemma":0.00001667425,"domain_scores_codex":[0.9975687,0.00004753661,0.0005254596,0.0003585556,0.00116965,0.0003300452],"domain_scores_gemma":[0.9966896,0.00005473522,0.0005968832,0.0003303585,0.002316688,0.00001176484],"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.0001144988,0.00004643128,0.000462855,0.0000746403,0.00004241949,2.910206e-8,0.0001818591,0.8800267,0.0001659254,0.004292919,0.00004163506,0.1145501],"study_design_scores_gemma":[0.002284663,0.00004939122,0.003264955,0.0001505209,0.0005661222,3.928829e-7,0.00007004775,0.9325348,0.001021313,0.05964346,0.0001797498,0.0002345645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9543251,0.0001719719,0.03973291,0.0001461504,0.0003774334,0.001437073,0.000003060218,0.00007197045,0.003734368],"genre_scores_gemma":[0.99357,0.0000280532,0.004289807,0.0001942291,0.001138014,0.000481546,0.0002333927,0.00003181142,0.00003311289],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1143155,"threshold_uncertainty_score":0.8710763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061075968","doi":"10.1016/j.peva.2005.09.005","title":"Multicast protocols for scalable on-demand download","year":2005,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Multicast; Computer science; Computer network; Download; Scalability; IP multicast; Protocol Independent Multicast; Distributed computing; World Wide Web; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.05015555241017577,"gpt":0.3423344134942851,"spread":0.2921788610841093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00145764,0.000124107,0.0001382194,0.00006098801,0.000209653,0.0001536756,0.0003721126,0.00005522063,0.00003480824],"category_scores_gemma":[0.00007133839,0.0001058372,0.00004645923,0.0002037561,0.00001790495,0.0008423459,0.00003238794,0.0000703932,0.0004643414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001131086,"about_ca_system_score_gemma":0.00008959899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001510435,"about_ca_topic_score_gemma":0.000002234289,"domain_scores_codex":[0.9985448,0.00004453721,0.0002841151,0.0003276707,0.000525948,0.0002729101],"domain_scores_gemma":[0.999018,0.00004649264,0.0001170716,0.0004353265,0.0003227986,0.00006026841],"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.00006553526,0.000236112,0.0008115432,0.00009088147,0.00001455913,1.761186e-7,0.000528118,0.04299614,0.001076902,0.002662859,0.01348951,0.9380277],"study_design_scores_gemma":[0.001309019,0.0001883215,0.003775193,0.00008439388,0.000004848197,0.000002378042,0.000004487202,0.9334407,0.005482122,0.00006409758,0.05550007,0.0001443556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2684711,0.0001378514,0.6744888,0.003173425,0.0006920234,0.04194761,0.00006517351,0.0003857551,0.0106383],"genre_scores_gemma":[0.9716021,0.000003308397,0.01084781,0.0002080814,0.0002380401,0.01682284,0.00002977213,0.00000557525,0.0002424324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9378833,"threshold_uncertainty_score":0.5968324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992579433","doi":"10.1016/s0166-5316(02)00225-0","title":"An alternative approach for analyzing finite buffer queues in discrete time","year":2003,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Markov chain; Representation (politics); Queue; Discrete time and continuous time; Computer science; State space; Matrix (chemical analysis); Product (mathematics); Applied mathematics; State (computer science); Novelty; Markov process; Discrete space; Mathematics; Algorithm; Statistical physics; Mathematical optimization; Statistics; Mathematical analysis; Physics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03094785403666733,"gpt":0.3001367638533035,"spread":0.2691889098166362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002754945,0.0001511304,0.0001839253,0.0003512127,0.0001659123,0.000112818,0.000152031,0.00004255353,0.0001752534],"category_scores_gemma":[0.0004633679,0.0001419735,0.00005661183,0.0005420245,0.00002947707,0.002574608,0.00001859822,0.00008711459,0.00006501628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009225829,"about_ca_system_score_gemma":0.00001894453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002635901,"about_ca_topic_score_gemma":0.0000133775,"domain_scores_codex":[0.9988336,0.00005988555,0.0002662932,0.0003175823,0.0002863362,0.000236299],"domain_scores_gemma":[0.9992416,0.00005945057,0.0002088064,0.0002316308,0.0002493954,0.000009107497],"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.00009651914,0.0000811709,0.01554783,0.00006778198,0.00003279318,1.887403e-7,0.0002022272,0.9649795,0.0007622485,0.004642101,0.00002729403,0.01356039],"study_design_scores_gemma":[0.000594731,0.0000161854,0.002213223,0.00002466004,0.0001010057,1.53235e-7,0.00009392054,0.9886708,0.0005165981,0.00713254,0.0004383561,0.0001978634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9181819,0.00004921861,0.07622842,0.00004247815,0.00007806236,0.0005698833,0.000002002169,0.00005327769,0.004794733],"genre_scores_gemma":[0.9953374,0.000007772771,0.003593484,0.0001476996,0.0002992468,0.0001957831,0.0002576366,0.00002374826,0.0001372809],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07715543,"threshold_uncertainty_score":0.5789509,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149285947","doi":"10.1016/j.peva.2011.01.002","title":"Improving densely deployed wireless network performance in unlicensed spectrum through hidden-node aware channel assignment","year":2011,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Australian Research Council; Multimedia University; National ICT Australia","keywords":"Computer network; Computer science; Channel (broadcasting); Node (physics); Hidden node problem; Wireless; Wireless network; Telecommunications; Wi-Fi array; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05690303108756405,"gpt":0.2684342550725546,"spread":0.2115312239849905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002272425,0.0003655928,0.0003544728,0.000131702,0.0003825411,0.0001435434,0.0009171425,0.0001786978,0.00006764045],"category_scores_gemma":[0.00001617849,0.0003499897,0.00007535334,0.0009158028,0.00005489069,0.002094599,0.0002604662,0.0003981646,0.00008912175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003751906,"about_ca_system_score_gemma":0.0002864247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001310801,"about_ca_topic_score_gemma":0.0001027895,"domain_scores_codex":[0.996442,0.0002529601,0.000661641,0.0007402031,0.000964546,0.0009386807],"domain_scores_gemma":[0.9984609,0.00006188537,0.0003867524,0.0008074463,0.0001772329,0.0001057752],"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.0004957139,0.0005249857,0.1369366,0.0004038375,0.00008014893,0.00002154216,0.01267846,0.1684432,0.0003580186,0.002120909,0.001102163,0.6768345],"study_design_scores_gemma":[0.001143059,0.0002714877,0.1361489,0.0002507447,0.00001576373,0.000009656056,0.00003364804,0.8571876,0.003813522,0.0006262987,0.00009170948,0.0004076854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8094835,0.0001661743,0.1821655,0.0002077282,0.0008914878,0.005294278,0.000001194773,0.0002699275,0.001520192],"genre_scores_gemma":[0.989536,0.0001433165,0.006472902,0.0002673096,0.0004296738,0.003061019,0.00001275805,0.0000377994,0.00003926343],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6887444,"threshold_uncertainty_score":0.9998952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101300912","doi":"10.1016/j.peva.2004.10.020","title":"Performance analysis of a novel hybrid push–pull algorithm with QoS adaptations in wireless networks","year":2005,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Quality of service; Queue; Computer network; Broadcasting (networking); Queueing theory; Scheme (mathematics); Algorithm; Push and pull; Wireless; Distributed computing; Wireless network; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0236943210063413,"gpt":0.2644651976376429,"spread":0.2407708766313016,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001284415,0.0001815339,0.0003502362,0.0004476183,0.0001203499,0.00006615192,0.000468867,0.0000543185,0.00001957208],"category_scores_gemma":[0.00001187029,0.0001615434,0.00006905015,0.002560891,0.00004682614,0.001396901,0.00005047715,0.0001580497,0.00000886024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001731248,"about_ca_system_score_gemma":0.0001634915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005780704,"about_ca_topic_score_gemma":0.00017243,"domain_scores_codex":[0.9978411,0.00005945844,0.0005667151,0.0003985177,0.0008082343,0.000325967],"domain_scores_gemma":[0.9985622,0.00004375786,0.0003281505,0.0005280491,0.0004764009,0.00006141867],"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.00001024468,0.0001113532,0.01022083,0.000008983923,0.0000635403,2.649846e-7,0.0003006022,0.629659,0.00004926989,0.00008912891,0.00002394366,0.3594628],"study_design_scores_gemma":[0.0008254567,0.00008134266,0.1958832,0.00007694391,0.0001069555,0.000004980768,0.00002233196,0.8024107,0.0002555217,7.506495e-7,0.0001658656,0.0001660086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5512673,0.0000734403,0.4479012,0.00007020437,0.0000962083,0.0002477951,0.0000106245,0.00002859474,0.0003046756],"genre_scores_gemma":[0.9794292,0.00008662335,0.02003749,0.00004360021,0.00009998427,0.0001456585,0.0001078267,0.00000885778,0.00004078052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4281619,"threshold_uncertainty_score":0.658755,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155470018","doi":"10.1016/j.peva.2013.05.007","title":"Performance analysis of an inventory–production system with shipment consolidation in the production facility","year":2013,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Warehouse; Production (economics); Consolidation (business); Computer science; Operations management; Operations research; Business; Engineering; Economics; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.03234956952043506,"gpt":0.2605799241472903,"spread":0.2282303546268552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004174433,0.0001550317,0.0002346946,0.0007103481,0.0002138412,0.00008373284,0.000192555,0.00004186822,0.0001075834],"category_scores_gemma":[0.0001890342,0.0001105713,0.00004895514,0.002082693,0.00007911536,0.004055317,0.00002257185,0.0001144222,0.0000663121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001983242,"about_ca_system_score_gemma":0.00003174243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002594041,"about_ca_topic_score_gemma":0.0003546855,"domain_scores_codex":[0.9980941,0.000130941,0.00044399,0.0003717263,0.0007760853,0.0001831701],"domain_scores_gemma":[0.9982563,0.00001961608,0.0004991679,0.000522995,0.0006941553,0.000007724735],"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.0001184202,0.0001415976,0.2413517,0.0002867409,0.000143992,1.146206e-7,0.0008177212,0.7213141,0.0008581783,0.0001853947,0.00001777349,0.03476428],"study_design_scores_gemma":[0.0001320501,0.00002313243,0.334709,0.00005129288,0.0006055988,6.464121e-7,0.00137278,0.6623436,0.0006026473,0.00002919082,0.00002483239,0.0001053089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9978049,0.00001470012,0.000228167,0.0002128872,0.0001541442,0.0009555852,7.477208e-7,0.00005497377,0.0005738295],"genre_scores_gemma":[0.9990849,0.000007829792,0.00007126057,0.00004444056,0.0001942099,0.0003459344,0.0002212653,0.000007542149,0.00002261763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09335731,"threshold_uncertainty_score":0.4508966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389262778","doi":"10.1016/j.peva.2023.102394","title":"Two families of indexable partially observable restless bandits and Whittle index computation","year":2023,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Observability; Observable; Computation; State space; State (computer science); Mathematical optimization; Index (typography); Computer science; Mathematics; Space (punctuation); Applied mathematics; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.2660736867315059,"gpt":0.4853507056563696,"spread":0.2192770189248636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072903,0.0001189262,0.0002405562,0.000535915,0.0002339635,0.000117344,0.0002824595,0.00006243857,0.0001504193],"category_scores_gemma":[0.001750611,0.00009828048,0.00003128504,0.00198002,0.0001482235,0.001085791,0.0001625862,0.0001359849,0.0002448908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006602677,"about_ca_system_score_gemma":0.0002232728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005146164,"about_ca_topic_score_gemma":0.0001144163,"domain_scores_codex":[0.9955756,0.0002460153,0.0005757788,0.0003924973,0.002903511,0.0003066128],"domain_scores_gemma":[0.9974915,0.0007227014,0.0002508168,0.0003130687,0.001150241,0.00007167183],"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.00007512296,0.00002444872,0.1468533,0.00002275291,0.000009765451,7.061972e-7,0.0007955398,0.5876799,0.000730489,0.00002718485,0.001125571,0.2626552],"study_design_scores_gemma":[0.0006100326,0.00006399362,0.3810369,0.00001983365,0.000005332641,9.625368e-7,0.0003901268,0.611694,0.002000306,0.003846345,0.0002611181,0.00007100448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.986559,0.0001040499,0.01151555,0.0001657375,0.0002732828,0.0004276207,0.000009041623,0.00005093808,0.0008947432],"genre_scores_gemma":[0.9984394,0.0001594311,0.0006095709,0.00001520458,0.00008079878,0.00006248015,0.00004180075,0.00001234255,0.0005789297],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2625842,"threshold_uncertainty_score":0.4007761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042076922","doi":"10.1016/s0166-5316(02)00203-1","title":"Automatic response performance monitoring for real-time software with nondeterministic behaviors","year":2003,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Bell (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Response time; Nondeterministic algorithm; Correctness; Real-time computing; Robustness (evolution); Software; Behavioral modeling; Reliability engineering; Artificial intelligence; Algorithm; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02457494913926627,"gpt":0.2951316720886818,"spread":0.2705567229494155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004798647,0.0003339915,0.0003420276,0.0002273666,0.0006096794,0.0001594316,0.0005750611,0.0001392645,0.00005224043],"category_scores_gemma":[0.0004524211,0.0002716714,0.0000857997,0.0006035153,0.00008098566,0.001602107,0.00005363949,0.0001578016,0.0001705685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000404726,"about_ca_system_score_gemma":0.0006982293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005232313,"about_ca_topic_score_gemma":6.240457e-7,"domain_scores_codex":[0.9968621,0.0002886071,0.0005787874,0.0006418605,0.00103932,0.0005892909],"domain_scores_gemma":[0.9975321,0.0003340868,0.0003055569,0.001050135,0.0006462316,0.0001319009],"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.0006495795,0.0003172182,0.4765859,0.0009020224,0.00006806351,0.000004111308,0.003682568,0.009628288,0.004900648,0.00003588439,0.0001597573,0.503066],"study_design_scores_gemma":[0.001656725,0.001346181,0.4079947,0.0003603745,0.00007582406,0.00005981732,0.00005053497,0.5700331,0.01768312,0.00003541301,0.0001656713,0.0005384921],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9752825,0.00004016795,0.02175147,0.00003503454,0.0007173177,0.001519434,0.000003075673,0.0004945305,0.0001564894],"genre_scores_gemma":[0.9338523,0.00003221742,0.06479561,0.00001455264,0.00008238055,0.0009620697,0.0000100145,0.00003318578,0.0002176888],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5604048,"threshold_uncertainty_score":0.9999735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1512467621","doi":"10.1016/j.peva.2005.11.006","title":"On the steady-state distribution","year":2006,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Steady state (chemistry); Poisson distribution; State (computer science); Distribution (mathematics); Computer science; Service (business); Partial differential equation; Process (computing); Flow (mathematics); Applied mathematics; Mathematics; Physics; Mathematical analysis; Statistics; Algorithm; Mechanics; Operating system; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.01988584985260453,"gpt":0.2525275857868322,"spread":0.2326417359342277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001549438,0.00009909672,0.00007234037,0.00006656655,0.0003366178,0.0001066333,0.0001235878,0.00002065232,0.000384405],"category_scores_gemma":[0.0001805801,0.00006908063,0.00004110582,0.0004076796,0.00003642038,0.0008005205,0.00002870368,0.00008540601,0.0009890873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008535128,"about_ca_system_score_gemma":0.00000989528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004160214,"about_ca_topic_score_gemma":0.00002463469,"domain_scores_codex":[0.9990573,0.00002504239,0.0001713447,0.0001545593,0.0004347373,0.0001569942],"domain_scores_gemma":[0.9993361,0.00006290468,0.0001708498,0.0002201146,0.0002074189,0.000002615455],"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.0001599463,0.0001326627,0.007448535,0.0000481773,0.00003073102,6.717593e-7,0.00004507106,0.6310297,0.0007322362,0.2607588,0.01262132,0.08699217],"study_design_scores_gemma":[0.0002630954,0.00000823268,0.02867008,0.00002633031,0.00007665141,2.345558e-7,0.00002763,0.8780347,0.0004869669,0.08529074,0.006974542,0.0001408157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9819766,0.00001634392,0.002959357,0.0008409975,0.0001455332,0.0002346545,0.000001927921,0.00007900546,0.01374558],"genre_scores_gemma":[0.9984593,0.000002384977,0.0000100903,0.0004330271,0.0004638984,0.0000569292,0.0002344813,0.000009986251,0.0003299076],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.247005,"threshold_uncertainty_score":0.9997888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068671295","doi":"10.1016/j.peva.2010.11.001","title":"Dynamic multiple-frame bandwidth provisioning with fairness and revenue considerations for Broadband Wireless Access Systems","year":2010,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; Qatar Foundation","keywords":"Bandwidth (computing); Broadband; Computer science; Provisioning; Computer network; Wireless broadband; Wireless; Frame (networking); Telecommunications; Wireless network","retraction":null,"screen_n_in":null,"score":{"opus":0.0160511307207771,"gpt":0.2685486629752878,"spread":0.2524975322545107,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004090935,0.0001724338,0.00017462,0.00009432387,0.0002387479,0.000178204,0.00007688922,0.0001001779,0.000007063462],"category_scores_gemma":[0.0001113122,0.0001608705,0.00001483875,0.0001599762,0.00005372703,0.0009568635,0.00001775458,0.0001889214,0.000001730657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000784459,"about_ca_system_score_gemma":0.00005677097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006526083,"about_ca_topic_score_gemma":0.0002336363,"domain_scores_codex":[0.9990216,0.00002516566,0.0002504482,0.0002343112,0.0002514664,0.0002169461],"domain_scores_gemma":[0.9991502,0.0001941588,0.00009850319,0.0002076251,0.0002959767,0.00005355186],"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.00002384988,0.00000861765,0.007535681,0.0001610798,0.00001547396,1.518348e-7,0.0003035478,0.9702506,0.005692016,0.00006047161,0.00004470269,0.01590381],"study_design_scores_gemma":[0.001071274,0.00004507199,0.01360288,0.0001449629,0.00004399974,0.00001725207,0.00004414187,0.9832992,0.001344142,0.0001052111,0.000060599,0.0002212946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7728805,0.0001166686,0.225142,0.0000183457,0.0004108953,0.001224995,0.00001703221,0.0001211893,0.00006830948],"genre_scores_gemma":[0.9888529,0.00008527727,0.01001304,0.000007393317,0.00009535372,0.0007588841,0.0001015195,0.00005110845,0.00003456387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2159723,"threshold_uncertainty_score":0.6560109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387501451","doi":"10.1016/j.peva.2023.102382","title":"Simulation modeling of Zoom traffic on a campus network: A case study","year":2023,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Zoom; Computer science; Multicast; Campus network; Server; Computer network; Network simulation; Network traffic simulation; Workload; Distributed computing; Network traffic control; Engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.08781161317920601,"gpt":0.3391762342046643,"spread":0.2513646210254583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002110608,0.0001202264,0.0001490025,0.0001671732,0.0002135251,0.00004741829,0.0002048007,0.00004916159,0.000008283722],"category_scores_gemma":[0.00009658036,0.0001113374,0.00004167619,0.001141571,0.000009078567,0.0003978517,0.00006960556,0.0001052381,0.00004745178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005976748,"about_ca_system_score_gemma":0.00007604737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002173171,"about_ca_topic_score_gemma":0.00002498207,"domain_scores_codex":[0.9983298,0.0001254921,0.0003296064,0.0003061813,0.0006530721,0.0002558582],"domain_scores_gemma":[0.9989417,0.0002410704,0.0001302871,0.0004123537,0.0002358765,0.00003870263],"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.00001206653,0.0000547866,0.001919809,0.000006231142,0.000008816514,0.00001118942,0.001715384,0.8421167,8.149407e-7,0.00001838017,0.00003626168,0.1540995],"study_design_scores_gemma":[0.0006342571,0.0003675116,0.003065012,0.00003624218,0.00002332171,0.00001179131,0.000188079,0.9954444,0.000002701093,0.0001051587,0.000005223629,0.0001162768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.915444,0.00004370459,0.0832052,0.00003130761,0.0004096108,0.0005849574,4.182489e-7,0.000228065,0.00005272987],"genre_scores_gemma":[0.998801,0.00001083296,0.0008804063,0.00003000485,0.0001711312,0.0000752822,0.000009092909,0.00001081957,0.0000114294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1539833,"threshold_uncertainty_score":0.4540209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W201333428","doi":"10.1016/j.peva.2010.05.001","title":"Editors’ introduction","year":2010,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Posthumanist Ethics and Activism","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.0393446048536928,"gpt":0.3603536695395603,"spread":0.3210090646858675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003361352,0.00004158129,0.00003935069,0.000042343,0.0005944326,0.00005861085,0.00009084366,0.00007860087,0.001246301],"category_scores_gemma":[0.0003920272,0.00004066767,0.00001623008,0.0001129812,0.0001150489,0.0004671329,0.000009128782,0.0002337934,0.0001926997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005365265,"about_ca_system_score_gemma":0.0001941879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000106517,"about_ca_topic_score_gemma":0.0003571009,"domain_scores_codex":[0.9990085,0.0000672216,0.0000805294,0.0001152652,0.0005932244,0.0001352345],"domain_scores_gemma":[0.9995107,0.00002628492,0.0000521509,0.0001161751,0.0002583587,0.00003632089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002856847,0.000151831,0.008558679,0.00001268337,0.0000168,1.837482e-7,0.03216669,0.0001324525,0.04980898,0.08012434,0.06115774,0.767841],"study_design_scores_gemma":[0.0001896434,0.00003198599,0.03815072,0.000003692643,0.00001662449,5.775548e-7,0.0003593793,0.008373859,0.004027043,0.003863194,0.9448535,0.0001297252],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9441811,0.000005480328,0.00003428982,0.007197524,0.01231195,0.0001663572,3.794223e-7,0.00005011036,0.03605285],"genre_scores_gemma":[0.9682551,0.00002168577,0.0001121436,0.00004633612,0.03099953,0.00002382738,0.000008953554,0.000004240278,0.000528192],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8836958,"threshold_uncertainty_score":0.9996667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}