{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Youmna Borghol","is_ca":false},{"name":"Siddharth Mitra","is_ca":false},{"name":"Sébastien Ardon","is_ca":false},{"name":"Niklas Carlsson","is_ca":false},{"name":"Derek L. Eager","is_ca":true},{"name":"Anirban Mahanti","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003159814,0.0007474176,0.0007587456,0.002897508,0.0003919853,0.001100212,0.00106139,0.001129258,0.000747899],"category_scores_gemma":[0.02323677,0.0002925001,0.0004747961,0.002269865,0.0004075426,0.002411998,0.000491277,0.0005846772,0.0002706283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001021755,"about_ca_system_score_gemma":0.0004700584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0116753,"about_ca_topic_score_gemma":0.009573685,"domain_scores_codex":[0.9983798,0.0006844467,0.0001051704,0.000303197,0.0004023267,0.0001250461],"domain_scores_gemma":[0.9748656,0.02101348,0.001333582,0.001062852,0.001323922,0.0004006536],"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.0007297666,0.0004400468,0.06391644,0.0002193218,0.0002228426,0.0001693944,0.0001870601,0.8541774,0.007779613,0.00215174,0.001063262,0.06894305],"study_design_scores_gemma":[0.000002287865,0.00004292581,0.002390702,0.000001739308,0.000008955739,0.00003248106,0.00001282195,0.9963776,0.0008300862,0.0002460047,0.00005071488,0.000003561657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.882515,0.0005219692,0.114195,0.0002208313,0.00003505687,0.00008322066,0.0007919621,0.0005772533,0.001059706],"genre_scores_gemma":[0.9901388,0.000132403,0.008721408,0.000008355565,0.00002388511,0.00002047917,0.0005817137,0.00002622655,0.0003469522],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0116753,"threshold_uncertainty_score":0.0232147,"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","authors":[{"name":"Anirban Mahanti","is_ca":true},{"name":"Derek L. Eager","is_ca":true},{"name":"Carey Williamson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003372499,0.0004045978,0.0004936621,0.0009810289,0.0007943038,0.001264923,0.0007409941,0.0007712477,0.001462853],"category_scores_gemma":[0.0220162,0.0002989871,0.0002317459,0.001994117,0.0008492129,0.001885055,0.0005541986,0.0006297532,0.0002023211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001700213,"about_ca_system_score_gemma":0.001291362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006641279,"about_ca_topic_score_gemma":0.005298886,"domain_scores_codex":[0.9974217,0.0009672981,0.000158442,0.0002319942,0.0009175486,0.0003028788],"domain_scores_gemma":[0.9701869,0.02269771,0.002046576,0.00163408,0.002721012,0.0007137136],"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.01461847,0.002130909,0.1858697,0.0007836546,0.0005175701,0.001719474,0.0009066802,0.4355541,0.2112227,0.01164802,0.003233989,0.1317948],"study_design_scores_gemma":[0.0001585534,0.002071938,0.03985699,0.00002747977,0.0003783132,0.001290094,0.0004113748,0.8531421,0.09966688,0.001849166,0.001071848,0.000075351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9893942,0.0009643866,0.006745994,0.000178175,0.00002657955,0.00001903599,0.0001287528,0.0002200818,0.002322746],"genre_scores_gemma":[0.9984024,0.000118611,0.0009356871,0.0000104965,0.00001667371,0.000005760764,0.00005060756,0.00002779934,0.0004319521],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006641279,"threshold_uncertainty_score":0.01783574,"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","authors":[{"name":"José R. Gallardo","is_ca":true},{"name":"Dimitrios Makrakis","is_ca":true},{"name":"Luis Orozco–Barbosa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002607864,0.000601608,0.0005681771,0.0007829764,0.0004427713,0.0007743923,0.0007329492,0.0008130733,0.0004253873],"category_scores_gemma":[0.008769869,0.0003299306,0.0004879327,0.0006101368,0.0006909533,0.0008644761,0.0004725798,0.0006363303,0.00007827768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001036793,"about_ca_system_score_gemma":0.0005393912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004326454,"about_ca_topic_score_gemma":0.002282528,"domain_scores_codex":[0.9992682,0.00043675,0.00003779513,0.00005579827,0.0001487962,0.00005271511],"domain_scores_gemma":[0.9966067,0.002452554,0.0003006611,0.0001528495,0.0003992925,0.00008789906],"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.00003624694,0.00004310831,0.0007819621,0.00001672002,0.00001986945,0.00004819185,0.00002846564,0.971023,0.001654539,0.02153696,0.0001032921,0.004707711],"study_design_scores_gemma":[0.000001335757,0.000007062079,0.00003734383,9.148064e-7,0.000002238914,0.000003255263,0.000001268894,0.9986545,0.0001342637,0.001138061,0.00001858994,0.00000124823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2771008,0.0003590339,0.7180364,0.0002116743,0.00006847911,0.00008824192,0.00005568029,0.0001766222,0.003903222],"genre_scores_gemma":[0.9875137,0.0001323733,0.01182296,0.00002205179,0.0000142341,0.00002344251,0.00002214327,0.00001314565,0.0004359181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004326454,"threshold_uncertainty_score":0.01379186,"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","authors":[{"name":"Vincent J. Maccio","is_ca":true},{"name":"Douglas G. Down","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0125283,0.002510836,0.003263662,0.002273705,0.001411001,0.004192872,0.002399746,0.002132418,0.008263067],"category_scores_gemma":[0.04879623,0.001041054,0.001048134,0.002132676,0.003236481,0.005534422,0.002866698,0.00290584,0.0004514816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007309626,"about_ca_system_score_gemma":0.006675495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01085517,"about_ca_topic_score_gemma":0.006925348,"domain_scores_codex":[0.991206,0.00523659,0.0003136852,0.0006102272,0.001234282,0.001399149],"domain_scores_gemma":[0.9670706,0.02863996,0.0006918677,0.0009234039,0.001950363,0.0007238952],"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.0005850613,0.0002521651,0.0006544642,0.0001879128,0.00006423095,0.00004391154,0.0001032214,0.9019023,0.0007457601,0.06731062,0.003453285,0.02469697],"study_design_scores_gemma":[0.0000433432,0.00006095693,0.0001816386,0.00003834216,0.00002719157,0.00001508039,0.00008486446,0.9540704,0.000421271,0.04457805,0.000468255,0.00001067383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.164428,0.004917552,0.7750664,0.008668525,0.0006042111,0.0006367273,0.0004860384,0.0005811794,0.04461136],"genre_scores_gemma":[0.9170129,0.002120473,0.07458881,0.0005680646,0.0003463317,0.0001714999,0.000231817,0.0002162772,0.004743853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0125283,"threshold_uncertainty_score":0.06625676,"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","authors":[{"name":"Jing Xu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002562567,0.0009103275,0.001484915,0.003014541,0.0005622011,0.001591028,0.0019936,0.001140957,0.002425415],"category_scores_gemma":[0.01088183,0.0003620002,0.0007382949,0.001120467,0.0004946084,0.001277742,0.0005801611,0.001065877,0.001432627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007518708,"about_ca_system_score_gemma":0.001100791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00583026,"about_ca_topic_score_gemma":0.004891054,"domain_scores_codex":[0.9968089,0.0005513494,0.0002572048,0.0007301716,0.00144194,0.000210324],"domain_scores_gemma":[0.9906613,0.004782646,0.0006515868,0.0009948272,0.002729337,0.0001803711],"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.0007882669,0.0005221368,0.00839822,0.0002431949,0.000149753,0.0003452725,0.0001433706,0.07331173,0.0312282,0.002470398,0.004612143,0.8777874],"study_design_scores_gemma":[0.00005326845,0.0001810909,0.00315697,0.00002578797,0.0001053719,0.0001885806,0.00002539925,0.9697574,0.02318241,0.002139071,0.001153725,0.00003102387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08098613,0.0006483516,0.8969257,0.000217141,0.0001474415,0.0002267957,0.0003971519,0.01631324,0.004138101],"genre_scores_gemma":[0.6584794,0.0001762498,0.3381472,0.0001273829,0.00005510885,0.0001269765,0.0005523273,0.0001878328,0.00214754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00583026,"threshold_uncertainty_score":0.01355231,"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","authors":[{"name":"Murray Woodside","is_ca":true},{"name":"Curtis Hrischuk","is_ca":true},{"name":"Bran Selić","is_ca":false},{"name":"Stefan Bayarov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134378,0.001038512,0.0006142146,0.0009752422,0.0004451119,0.001346344,0.001333693,0.0007972521,0.001851288],"category_scores_gemma":[0.005314312,0.0005771701,0.0007243531,0.0004606845,0.0005712745,0.001056069,0.0004636525,0.0007638365,0.0004943039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001403831,"about_ca_system_score_gemma":0.001606767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007260784,"about_ca_topic_score_gemma":0.004204028,"domain_scores_codex":[0.998812,0.0004102403,0.00004102361,0.0001198211,0.0004893837,0.0001275986],"domain_scores_gemma":[0.9971032,0.001721047,0.0002996396,0.0004156969,0.0004130779,0.00004733893],"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.00004969393,0.00004885366,0.0006363486,0.00003009089,0.00001202118,0.00003020615,0.00004995574,0.98032,0.002965363,0.004570398,0.0002521693,0.01103505],"study_design_scores_gemma":[0.000003561569,0.00001168331,0.0000919049,0.000001426045,0.000004370031,0.000004754494,0.000002121377,0.9975253,0.001338245,0.0008638819,0.0001505935,0.000002158912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2676963,0.0001996279,0.7186906,0.0001525223,0.00002891988,0.0001196041,0.0002502294,0.006331771,0.006530401],"genre_scores_gemma":[0.9272265,0.0001152813,0.07039729,0.00001755402,0.0000164981,0.00009577833,0.00022424,0.0003106289,0.001596271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007260784,"threshold_uncertainty_score":0.01443702,"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","authors":[{"name":"Jing Xu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002562567,0.0009103275,0.001484915,0.003014541,0.0005622011,0.001591028,0.0019936,0.001140957,0.002425415],"category_scores_gemma":[0.01088183,0.0003620002,0.0007382949,0.001120467,0.0004946084,0.001277742,0.0005801611,0.001065877,0.001432627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007518708,"about_ca_system_score_gemma":0.001100791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00583026,"about_ca_topic_score_gemma":0.004891054,"domain_scores_codex":[0.9968089,0.0005513494,0.0002572048,0.0007301716,0.00144194,0.000210324],"domain_scores_gemma":[0.9906613,0.004782646,0.0006515868,0.0009948272,0.002729337,0.0001803711],"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.0007882669,0.0005221368,0.00839822,0.0002431949,0.000149753,0.0003452725,0.0001433706,0.07331173,0.0312282,0.002470398,0.004612143,0.8777874],"study_design_scores_gemma":[0.00005326845,0.0001810909,0.00315697,0.00002578797,0.0001053719,0.0001885806,0.00002539925,0.9697574,0.02318241,0.002139071,0.001153725,0.00003102387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08098613,0.0006483516,0.8969257,0.000217141,0.0001474415,0.0002267957,0.0003971519,0.01631324,0.004138101],"genre_scores_gemma":[0.6584794,0.0001762498,0.3381472,0.0001273829,0.00005510885,0.0001269765,0.0005523273,0.0001878328,0.00214754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00583026,"threshold_uncertainty_score":0.01355231,"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","authors":[{"name":"Horácio A.B.F. Oliveira","is_ca":true},{"name":"Azzedine Boukerche","is_ca":true},{"name":"Eduardo F. Nakamura","is_ca":false},{"name":"Antônio A. F. Loureiro","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001763611,0.0008713715,0.0009089785,0.001109583,0.0006172513,0.001094413,0.001189967,0.0009564693,0.001908798],"category_scores_gemma":[0.00558425,0.0002840691,0.0003998067,0.001210328,0.000623768,0.002215595,0.001454198,0.0006837284,0.0007738383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001003648,"about_ca_system_score_gemma":0.001513472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002099326,"about_ca_topic_score_gemma":0.002307506,"domain_scores_codex":[0.9985953,0.000457748,0.00007502477,0.0001689014,0.0005860763,0.0001170527],"domain_scores_gemma":[0.9977882,0.00106601,0.0002606215,0.0004004164,0.0004108585,0.00007394607],"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.001306734,0.0002528538,0.001661538,0.0002485579,0.0001244966,0.00008811342,0.0001318813,0.4273897,0.03392066,0.02398261,0.003878472,0.5070145],"study_design_scores_gemma":[0.00006742249,0.0002078703,0.0002962374,0.000007092865,0.00003890699,0.00008549646,0.00002686343,0.9850819,0.009930096,0.003100915,0.00114267,0.00001452591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02144523,0.0003698226,0.9756171,0.0001222621,0.0000512477,0.00006564245,0.00002540751,0.001253158,0.001050351],"genre_scores_gemma":[0.4202828,0.0005352526,0.5756141,0.0000634786,0.00008336415,0.000198342,0.0001596414,0.0001711068,0.002891849],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002099326,"threshold_uncertainty_score":0.009326994,"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","authors":[{"name":"Dorin B. Petriu","is_ca":true},{"name":"Murray Woodside","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002294655,0.001449253,0.0006279848,0.001557555,0.000299203,0.00143478,0.001431971,0.001547675,0.005162429],"category_scores_gemma":[0.01689851,0.0005858607,0.0009690763,0.001327802,0.0006570804,0.003191547,0.000905478,0.001625805,0.001517779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001236224,"about_ca_system_score_gemma":0.0006262556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002307756,"about_ca_topic_score_gemma":0.001842033,"domain_scores_codex":[0.9981773,0.0009732107,0.0000748464,0.0001470401,0.0004792022,0.0001484041],"domain_scores_gemma":[0.992578,0.005764142,0.0004223064,0.0004142892,0.0006933686,0.0001278988],"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.00004440301,0.00004732427,0.0004814418,0.00006812089,0.00002160679,0.00007111664,0.00008625539,0.9079162,0.0002524309,0.07472271,0.001733488,0.01455475],"study_design_scores_gemma":[0.000007410642,0.00002818586,0.0002126563,0.00001753903,0.000009916252,0.00003175916,0.00001622924,0.946521,0.000141473,0.05144387,0.001563058,0.000006782971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1032103,0.001055337,0.8327985,0.001801622,0.0001427092,0.0003246005,0.001554012,0.001338846,0.05777407],"genre_scores_gemma":[0.9331793,0.0009543705,0.05726593,0.0001247341,0.0001182976,0.0004577177,0.001439974,0.0001806694,0.006279065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005162429,"threshold_uncertainty_score":0.01727003,"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","authors":[{"name":"Aggelos Lazaris","is_ca":false},{"name":"Polychronis Koutsakis","is_ca":true},{"name":"M. Paterakis","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002487462,0.002019738,0.001328184,0.001682634,0.0006983003,0.002250511,0.003196405,0.002058368,0.002901883],"category_scores_gemma":[0.004833755,0.0004882367,0.0009843052,0.0014227,0.0009685553,0.003976598,0.0009775506,0.001956803,0.001165019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002545115,"about_ca_system_score_gemma":0.001450891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004640068,"about_ca_topic_score_gemma":0.004425522,"domain_scores_codex":[0.9973622,0.0008182124,0.0001063856,0.0003700218,0.00101452,0.0003286604],"domain_scores_gemma":[0.9963157,0.001626111,0.0002572789,0.0003782418,0.001253872,0.0001688479],"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.0006894724,0.0004846549,0.001294515,0.0002155072,0.000137734,0.0004142956,0.0001455896,0.8598273,0.02556613,0.05783303,0.004279564,0.04911232],"study_design_scores_gemma":[0.000009253987,0.00003798106,0.0000419787,0.000003002754,0.00001934815,0.00003852428,0.000004270702,0.9964253,0.0009698017,0.001917754,0.0005264078,0.000006354509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03511548,0.0006279252,0.9566818,0.0004770639,0.0002748363,0.0002177417,0.000263626,0.0006746121,0.00566683],"genre_scores_gemma":[0.7240793,0.001868857,0.2433414,0.0004790346,0.0007950752,0.0007340509,0.0008064775,0.0005296991,0.02736608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004640068,"threshold_uncertainty_score":0.01846623,"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","authors":[{"name":"Aniket Mahanti","is_ca":true},{"name":"Carey Williamson","is_ca":true},{"name":"Martin Arlitt","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007387084,0.0005643129,0.0007396498,0.000654255,0.0004726633,0.0007929757,0.001247609,0.0006125313,0.001891653],"category_scores_gemma":[0.001658088,0.0001953084,0.000314689,0.0004561172,0.000495352,0.0008701527,0.0006385588,0.0005011019,0.0004952396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008870964,"about_ca_system_score_gemma":0.0003597387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001376217,"about_ca_topic_score_gemma":0.0008739075,"domain_scores_codex":[0.9992245,0.0001607123,0.00001971633,0.0001581543,0.0003495688,0.0000872259],"domain_scores_gemma":[0.9986842,0.000535911,0.0001105173,0.0002389924,0.0003418991,0.00008850973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.003505951,0.001229321,0.02892642,0.0002352101,0.0001754853,0.0007578582,0.0004767642,0.1599031,0.6915046,0.003254446,0.00113004,0.1089007],"study_design_scores_gemma":[0.000113214,0.0018028,0.01644862,0.000008961394,0.0001020819,0.0003174793,0.000154166,0.8618013,0.1176415,0.0008380458,0.000734629,0.00003713821],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8457229,0.0001218567,0.1481863,0.0001077198,0.00003829406,0.00006970864,0.0000951915,0.0018579,0.003800102],"genre_scores_gemma":[0.9964566,0.00001370348,0.002893195,0.0000104803,0.000008563241,0.000011751,0.00003004571,0.0000371312,0.0005385559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001891653,"threshold_uncertainty_score":0.006436348,"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","authors":[{"name":"Derek L. Eager","is_ca":true},{"name":"Michael C. Ferris","is_ca":false},{"name":"Mary K. Vernon","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008650792,0.001322594,0.00228523,0.001411038,0.001625286,0.002864737,0.002734257,0.001609402,0.001169142],"category_scores_gemma":[0.03007697,0.0008892167,0.000559069,0.002681799,0.002266074,0.004053352,0.001410472,0.00105613,0.0002020645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005973097,"about_ca_system_score_gemma":0.00418554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02026824,"about_ca_topic_score_gemma":0.01201343,"domain_scores_codex":[0.9921414,0.003808325,0.0004987096,0.0007800015,0.001539406,0.001232157],"domain_scores_gemma":[0.96106,0.02851143,0.001676847,0.004053793,0.003530111,0.001167791],"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.002234159,0.000508014,0.004853329,0.0001221155,0.0001492984,0.0001364491,0.0001539833,0.9612775,0.004884398,0.003877418,0.001189126,0.02061436],"study_design_scores_gemma":[0.0001134028,0.0001696301,0.0007377723,0.000003748114,0.00004802172,0.0000434636,0.00004294839,0.9953628,0.002228318,0.001138644,0.00009916172,0.000012155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.919677,0.00126,0.07485718,0.0004038805,0.00006390196,0.0002143286,0.0002384737,0.001173673,0.002111521],"genre_scores_gemma":[0.9781617,0.000185821,0.020765,0.00003285539,0.00003245893,0.0000578712,0.0001423221,0.00008392927,0.0005380881],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02026824,"threshold_uncertainty_score":0.04575032,"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","authors":[{"name":"Tony Field","is_ca":false},{"name":"Uli Harder","is_ca":false},{"name":"Peter G. Harrison","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002022977,0.0004028168,0.000356258,0.001315757,0.0004254072,0.0006129029,0.0004871197,0.0004223212,0.0006400489],"category_scores_gemma":[0.0104585,0.0001549479,0.0001611962,0.0009380977,0.0004874427,0.0007982244,0.0002848192,0.0003698274,0.0001090052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001476407,"about_ca_system_score_gemma":0.0003941754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006935146,"about_ca_topic_score_gemma":0.003978935,"domain_scores_codex":[0.9984577,0.0006166495,0.00007592511,0.0001103236,0.0005437154,0.0001957601],"domain_scores_gemma":[0.9918408,0.005209403,0.0005331183,0.0003380367,0.001785026,0.0002935603],"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.003562801,0.00096634,0.07803035,0.0002465986,0.000134479,0.0006523252,0.001096139,0.7765287,0.06673148,0.006605665,0.001629496,0.06381563],"study_design_scores_gemma":[0.00001607198,0.0003772827,0.01910973,0.00001157023,0.00003327028,0.0001583592,0.0001833663,0.9673035,0.01166618,0.0008361363,0.0002867717,0.00001766435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9941701,0.00009366138,0.004676194,0.00004012579,0.000008402892,0.00001284745,0.00004848451,0.0000758213,0.000874372],"genre_scores_gemma":[0.9991193,0.00003227816,0.0005195499,0.000004603699,0.00000362796,0.000004496085,0.00006331605,0.00001037785,0.0002423951],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006935146,"threshold_uncertainty_score":0.01378959,"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","authors":[{"name":"Haonan Tan","is_ca":false},{"name":"Derek L. Eager","is_ca":true},{"name":"Mary K. Vernon","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01680646,0.001154719,0.001217893,0.002726252,0.0006292367,0.002732552,0.001583049,0.00208768,0.001844571],"category_scores_gemma":[0.06740903,0.0002597713,0.0003616388,0.002073788,0.001357166,0.004519591,0.001370194,0.001152925,0.0003251477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001342412,"about_ca_system_score_gemma":0.000931182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001400521,"about_ca_topic_score_gemma":0.001034741,"domain_scores_codex":[0.9855172,0.005633662,0.0009536399,0.001024278,0.006011051,0.0008602323],"domain_scores_gemma":[0.9204618,0.06451887,0.002239093,0.005235183,0.006271421,0.001273644],"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.008118346,0.001460412,0.03208013,0.002208425,0.0007081764,0.0005624031,0.000791953,0.2671976,0.05934375,0.04021848,0.006523523,0.5807869],"study_design_scores_gemma":[0.0003995126,0.008269637,0.03430191,0.0006054714,0.0006216377,0.0009629866,0.001605556,0.8030475,0.08772847,0.05308094,0.009208851,0.0001675491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8216355,0.01769622,0.1073053,0.003619518,0.0003003894,0.0003741898,0.0006645657,0.001641674,0.04676271],"genre_scores_gemma":[0.9877431,0.001381729,0.009533354,0.0001061138,0.0001472958,0.00004682559,0.0003067132,0.0001076225,0.0006272118],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01680646,"threshold_uncertainty_score":0.08888209,"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","authors":[{"name":"Yujing Wu","is_ca":true},{"name":"Carey Williamson","is_ca":true},{"name":"Jingxiang Luo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005103582,0.001463796,0.001670656,0.001604564,0.001132761,0.002153632,0.001527648,0.001125412,0.004717142],"category_scores_gemma":[0.01856984,0.0003714954,0.0005322618,0.004503529,0.001793983,0.002905748,0.00216491,0.00165917,0.0005125214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001653743,"about_ca_system_score_gemma":0.0009886911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003631074,"about_ca_topic_score_gemma":0.00330165,"domain_scores_codex":[0.9970439,0.001466195,0.00008941978,0.0001664976,0.0009160393,0.0003179793],"domain_scores_gemma":[0.9893914,0.007964917,0.000418566,0.0008288425,0.00119444,0.000201709],"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.0003912773,0.0002094696,0.001471063,0.0001363531,0.00005695318,0.0001551888,0.0001484744,0.6592575,0.002901013,0.1955676,0.008205237,0.1314997],"study_design_scores_gemma":[0.000007974128,0.00005723576,0.0002820725,0.00001676592,0.00002095708,0.00006851251,0.00005321266,0.93705,0.000921193,0.05913469,0.002377215,0.00001019185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08204162,0.004863812,0.8655086,0.002341436,0.0005322749,0.0001463386,0.0001442566,0.0003535784,0.04406819],"genre_scores_gemma":[0.855189,0.005120523,0.1242294,0.0005428381,0.0009791282,0.0001293244,0.000135522,0.0002954117,0.01337879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005103582,"threshold_uncertainty_score":0.02699065,"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","authors":[{"name":"Yu-Tong He","is_ca":true},{"name":"Douglas G. Down","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00979823,0.0005410379,0.001662822,0.001121353,0.002317286,0.002858359,0.002958291,0.001379832,0.008243688],"category_scores_gemma":[0.04524804,0.0005952825,0.0007546232,0.001586672,0.003972658,0.009388119,0.003093141,0.00242294,0.0005188865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002203712,"about_ca_system_score_gemma":0.001887038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003306053,"about_ca_topic_score_gemma":0.004054486,"domain_scores_codex":[0.9934022,0.00391534,0.0001646821,0.0003831833,0.001607889,0.0005266284],"domain_scores_gemma":[0.9684391,0.02545756,0.0009031058,0.002442363,0.001936933,0.000820891],"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.0006857684,0.000228909,0.002164089,0.00012843,0.00006392756,0.0002142638,0.0005346299,0.2958444,0.00344893,0.6543303,0.002608045,0.03974841],"study_design_scores_gemma":[0.00002866991,0.00007362112,0.0003660009,0.00001712568,0.00002436565,0.00005209443,0.0001008442,0.7815053,0.001149893,0.2154913,0.001168738,0.00002201299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09129493,0.0009064318,0.892319,0.002097727,0.0001338854,0.00009614749,0.00003886415,0.0001960554,0.01291703],"genre_scores_gemma":[0.9303676,0.0002586289,0.06240343,0.0002616893,0.0002516118,0.0001119855,0.00002415585,0.000124518,0.006196381],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00979823,"threshold_uncertainty_score":0.05181861,"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","authors":[{"name":"Umesh Gupta","is_ca":false},{"name":"S. K. Samanta","is_ca":false},{"name":"R. K. Sharma","is_ca":false},{"name":"M. L. Chaudhry","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01041737,0.001007707,0.0020922,0.001453638,0.001184581,0.004412375,0.003079462,0.00144017,0.002105859],"category_scores_gemma":[0.02469881,0.0007200893,0.0005792522,0.001711505,0.002224879,0.004243787,0.001032297,0.001135665,0.0002214833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005551286,"about_ca_system_score_gemma":0.004462315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009015123,"about_ca_topic_score_gemma":0.005085682,"domain_scores_codex":[0.9947187,0.001968166,0.0002534856,0.0006180828,0.001437767,0.001003718],"domain_scores_gemma":[0.9744998,0.01815883,0.002051575,0.000859432,0.0032529,0.001177512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001503075,0.0002610756,0.003682672,0.0001520501,0.0000927553,0.0002661998,0.0001974691,0.8702644,0.004055992,0.1063377,0.0009420731,0.01224448],"study_design_scores_gemma":[0.00001862416,0.00003646846,0.000203634,0.000002835902,0.00001314455,0.0000159368,0.00001345938,0.9956866,0.0003891745,0.003577156,0.00003455779,0.000008307058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5159456,0.0009458387,0.4773539,0.0009078198,0.0001991757,0.0001301764,0.0002219552,0.0005279953,0.00376759],"genre_scores_gemma":[0.9916602,0.0001627348,0.007267477,0.00002632689,0.00005120874,0.0000269597,0.00005048449,0.00001420218,0.000740464],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01041737,"threshold_uncertainty_score":0.05509299,"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","authors":[{"name":"Umesh Gupta","is_ca":false},{"name":"Gagandeep Singh","is_ca":false},{"name":"M. L. Chaudhry","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001690175,0.00115278,0.001199695,0.002400359,0.001073409,0.001591835,0.002898622,0.001398217,0.006163148],"category_scores_gemma":[0.01037403,0.0006964921,0.000780825,0.002472899,0.0007315337,0.002674014,0.001117133,0.002435539,0.001954155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002015578,"about_ca_system_score_gemma":0.002596871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0146353,"about_ca_topic_score_gemma":0.01411096,"domain_scores_codex":[0.9988172,0.0002540419,0.00007051119,0.0002007982,0.0005314995,0.0001260293],"domain_scores_gemma":[0.9969411,0.001166914,0.0002390997,0.0005075923,0.001011856,0.0001333125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005558875,0.0004860417,0.005997926,0.0003725353,0.0002571448,0.0001968725,0.0006260809,0.3961318,0.03791286,0.1186711,0.006291628,0.4325],"study_design_scores_gemma":[0.00003314027,0.0000415317,0.0005234868,0.00001090464,0.00001678112,0.00004635539,0.00002757767,0.9846849,0.005263821,0.007527481,0.001789557,0.00003446322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007516861,0.00004583028,0.9896624,0.00004181348,0.00004065068,0.00004554076,0.00008699381,0.001780773,0.000779231],"genre_scores_gemma":[0.1430857,0.00008294818,0.8522241,0.00008642093,0.00003968012,0.0001924128,0.0002614628,0.0005974736,0.003429823],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0146353,"threshold_uncertainty_score":0.02910024,"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","authors":[{"name":"Peter Jacko","is_ca":false},{"name":"Brunilde Sansò","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004256989,0.00119938,0.001081191,0.0006345224,0.0006078861,0.001676526,0.000999663,0.0009364358,0.001217313],"category_scores_gemma":[0.009366525,0.000362847,0.0003287278,0.0004999145,0.001281588,0.001135021,0.001074818,0.001002038,0.00006644497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001641237,"about_ca_system_score_gemma":0.002057824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01231486,"about_ca_topic_score_gemma":0.005604753,"domain_scores_codex":[0.9984479,0.000559556,0.0000650275,0.0002391299,0.0003578813,0.0003305274],"domain_scores_gemma":[0.9949477,0.003453712,0.0004312755,0.0001670405,0.0007692539,0.0002310562],"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.0003250994,0.00009110819,0.0003210662,0.00003134931,0.00001722339,0.00003174106,0.00003517069,0.9860311,0.002402673,0.003366891,0.0001048341,0.0072418],"study_design_scores_gemma":[0.000008223064,0.0000726783,0.00007233527,0.000001544526,0.000005647761,0.000002470759,0.000005058952,0.9986534,0.0006868321,0.0004718829,0.00001696523,0.000002967027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4076216,0.0004734961,0.5870395,0.0003064047,0.0001058144,0.0001095728,0.00004283043,0.000247119,0.004053675],"genre_scores_gemma":[0.9933468,0.0000541912,0.00603471,0.00001257001,0.0000118094,0.00001666069,0.00001063372,0.000008692225,0.0005038597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01231486,"threshold_uncertainty_score":0.02448636,"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","authors":[{"name":"Steve Drekic","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068506,0.0007173277,0.001068499,0.001203674,0.001626898,0.003780721,0.002843231,0.001803859,0.00419096],"category_scores_gemma":[0.01134197,0.0004722873,0.0005567537,0.001192332,0.001074876,0.002273337,0.0009727636,0.00139588,0.0006949307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002161591,"about_ca_system_score_gemma":0.004693986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007587065,"about_ca_topic_score_gemma":0.004715401,"domain_scores_codex":[0.9976887,0.0006528444,0.0001687759,0.0003205093,0.0008001922,0.0003690337],"domain_scores_gemma":[0.9925425,0.003132572,0.0004785062,0.0008808617,0.001952639,0.001012971],"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.01681996,0.003637985,0.01560929,0.0005065359,0.0002184528,0.002311441,0.000959035,0.483938,0.08922714,0.1429926,0.008392151,0.2353873],"study_design_scores_gemma":[0.0004951967,0.001498124,0.0009924833,0.00001701232,0.00009669205,0.0002586338,0.00006838477,0.9769154,0.01158912,0.006226632,0.001781531,0.00006095158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3123307,0.0006300221,0.6769244,0.0009525128,0.0004205109,0.0005968935,0.0003070098,0.002151028,0.005686895],"genre_scores_gemma":[0.9117186,0.0001220063,0.08337844,0.0001385631,0.0001023844,0.00008018999,0.00009353788,0.0000521976,0.004314033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007587065,"threshold_uncertainty_score":0.03622985,"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","authors":[{"name":"Ralf Wimmer","is_ca":false},{"name":"Salem Derisavi","is_ca":true},{"name":"Holger Hermanns","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003131416,0.001133312,0.001248779,0.00121879,0.001027449,0.001582986,0.002108307,0.0007683398,0.006038005],"category_scores_gemma":[0.01231448,0.0006148738,0.0007333803,0.001044638,0.002900789,0.002851175,0.003177193,0.001470284,0.001023753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00159859,"about_ca_system_score_gemma":0.002756562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00477322,"about_ca_topic_score_gemma":0.006241404,"domain_scores_codex":[0.9957812,0.001303071,0.0001803634,0.0004480961,0.001707676,0.0005795847],"domain_scores_gemma":[0.9917971,0.004239649,0.0004719368,0.002158798,0.001118867,0.0002135933],"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.001811405,0.0003074358,0.001709194,0.0004603928,0.00009317567,0.0002134501,0.0009165719,0.4820072,0.08460415,0.1496849,0.003277542,0.2749147],"study_design_scores_gemma":[0.0002040773,0.0001683419,0.000305779,0.00004417382,0.00006380277,0.00005324092,0.0001287156,0.872668,0.05528115,0.06799519,0.003046909,0.00004066782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03125475,0.00007254064,0.9634889,0.00008432703,0.00003908373,0.00007842795,0.00004272178,0.002393622,0.002545658],"genre_scores_gemma":[0.6613423,0.00006608706,0.3351761,0.00005197299,0.00002328177,0.0001655321,0.0001484302,0.0008785956,0.002147713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006038005,"threshold_uncertainty_score":0.02019918,"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","authors":[{"name":"Olivia Das","is_ca":true},{"name":"C.M. Woodside","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005148638,0.0009478412,0.000660297,0.0009830714,0.0003426523,0.001377908,0.001058494,0.0008698136,0.0008790998],"category_scores_gemma":[0.02323058,0.0003292089,0.0003763242,0.0005752385,0.0006569301,0.001710197,0.0009934357,0.0006273318,0.0001557648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001502731,"about_ca_system_score_gemma":0.001187272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002102681,"about_ca_topic_score_gemma":0.001974986,"domain_scores_codex":[0.9964221,0.001722111,0.0002626905,0.0001678195,0.001140775,0.0002844905],"domain_scores_gemma":[0.9780129,0.01443797,0.001867423,0.001356793,0.003390106,0.0009348746],"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.004990222,0.00107726,0.03599764,0.0002755364,0.0002835705,0.0002552635,0.0002988418,0.7994556,0.04627714,0.00295141,0.0004050382,0.1077325],"study_design_scores_gemma":[0.00008724732,0.002059734,0.00588086,0.00001004811,0.000113886,0.00004772168,0.00009692996,0.9685698,0.02135215,0.001604781,0.0001565766,0.00002021469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9547427,0.00009608029,0.04349572,0.00006211466,0.00001429332,0.00007102477,0.00003140076,0.0003497299,0.001136936],"genre_scores_gemma":[0.9903619,0.00002284861,0.009304759,0.000005434894,0.000006119142,0.00002336713,0.00003667492,0.00001497614,0.0002239612],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005148638,"threshold_uncertainty_score":0.02722889,"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","authors":[{"name":"Attahiru Sule Alfa","is_ca":true},{"name":"Qi‐Ming He","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002472286,0.0005841071,0.0007326077,0.001282087,0.0008658895,0.002060744,0.00182114,0.001142666,0.003145806],"category_scores_gemma":[0.008909224,0.0004479636,0.0006381287,0.000795197,0.001646072,0.001839098,0.001826803,0.001696563,0.0002495442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003119022,"about_ca_system_score_gemma":0.002735736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006895585,"about_ca_topic_score_gemma":0.004705669,"domain_scores_codex":[0.9990968,0.000334328,0.00002518145,0.0000897669,0.0003073346,0.0001467229],"domain_scores_gemma":[0.9966242,0.002318562,0.0002758685,0.0001529619,0.0004703624,0.0001579963],"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.0000526495,0.00005464172,0.000934103,0.000058079,0.00002077628,0.00007074833,0.0001057186,0.4153715,0.0007764969,0.5713323,0.002075442,0.009147398],"study_design_scores_gemma":[0.0000073076,0.000006573457,0.0001854306,0.000005571706,0.000003618252,0.00001012277,0.00001201408,0.9237291,0.00007790588,0.07569446,0.0002629038,0.000005097461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1379262,0.0009689094,0.8386034,0.002517826,0.0001434174,0.0001113192,0.0001837914,0.000212372,0.01933282],"genre_scores_gemma":[0.912671,0.0005395298,0.07790696,0.0002375758,0.0002161259,0.0001309045,0.0002314482,0.00007411163,0.007992474],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006895585,"threshold_uncertainty_score":0.02263021,"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","authors":[{"name":"M. Mehmet Ali","is_ca":true},{"name":"Xinyi Zhang","is_ca":true},{"name":"J.F. Hayes","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002582068,0.001012812,0.0009564884,0.0007433018,0.0008020871,0.001512249,0.001589366,0.001170366,0.001549949],"category_scores_gemma":[0.006984643,0.0004522318,0.0006359884,0.0006206039,0.001017746,0.00111631,0.0006345711,0.00123311,0.000183472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00280831,"about_ca_system_score_gemma":0.001735952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01625367,"about_ca_topic_score_gemma":0.003827066,"domain_scores_codex":[0.9992679,0.0002914366,0.00002743433,0.000106938,0.0001806874,0.000125669],"domain_scores_gemma":[0.9974015,0.001731524,0.0002018791,0.0001274849,0.0003889326,0.0001486763],"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.00006440649,0.00005464482,0.0004038274,0.00003340024,0.00001732653,0.0000433382,0.00004034117,0.9836821,0.001973441,0.01052984,0.0002024758,0.002954881],"study_design_scores_gemma":[0.000001471863,0.000006769983,0.00003101111,5.102375e-7,0.000002722771,0.000002238821,0.000001759916,0.9995199,0.000102116,0.0003107098,0.00001947214,0.000001257899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1927291,0.0008107994,0.7992122,0.0005722774,0.0001139053,0.0001235181,0.0001156038,0.0003614718,0.005961286],"genre_scores_gemma":[0.9811215,0.0002754952,0.01692091,0.00003903859,0.00006830225,0.00003709993,0.00004178368,0.00003761372,0.001458255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01625367,"threshold_uncertainty_score":0.03231817,"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","authors":[{"name":"Attahiru Sule Alfa","is_ca":true},{"name":"Wei Li","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002754196,0.0008237059,0.001100764,0.00122068,0.00151665,0.00189339,0.001322816,0.001782427,0.004279068],"category_scores_gemma":[0.005885232,0.0003908482,0.0003968984,0.0007999113,0.001112495,0.001475197,0.0008865247,0.0008509759,0.0003516907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004167113,"about_ca_system_score_gemma":0.005065254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01483907,"about_ca_topic_score_gemma":0.01085343,"domain_scores_codex":[0.9977044,0.0008476677,0.00008177508,0.0002829166,0.0002715442,0.0008116157],"domain_scores_gemma":[0.9963463,0.001823956,0.0003719534,0.0002162019,0.0007285911,0.0005129643],"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.001571139,0.0003032388,0.002027181,0.0001610185,0.00005336321,0.0001671685,0.0001439242,0.9251845,0.007348366,0.03171651,0.006308367,0.02501529],"study_design_scores_gemma":[0.0000392914,0.00008789,0.0003595447,0.000009220333,0.00002038627,0.00002297865,0.00004202375,0.9906396,0.00125455,0.007306349,0.0002066634,0.00001161468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5308264,0.001008441,0.4438874,0.003418937,0.000261757,0.0005770625,0.0005949729,0.001393972,0.01803087],"genre_scores_gemma":[0.968582,0.0001025009,0.02899652,0.0001858313,0.00005889381,0.00006851133,0.00007542373,0.00004963534,0.001880639],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01483907,"threshold_uncertainty_score":0.03023463,"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","authors":[{"name":"Gagandeep Singh","is_ca":false},{"name":"M. L. Chaudhry","is_ca":true},{"name":"Umesh Gupta","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004644795,0.0005549066,0.0006927087,0.001866774,0.0009361329,0.001621612,0.001755979,0.0006941506,0.002205512],"category_scores_gemma":[0.0230284,0.000578477,0.0006767836,0.001352813,0.0008997328,0.002888146,0.001190517,0.001316465,0.0003402412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002885355,"about_ca_system_score_gemma":0.001913046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01577984,"about_ca_topic_score_gemma":0.01015311,"domain_scores_codex":[0.9992068,0.0002453775,0.00003909048,0.0001310408,0.0002613545,0.0001163551],"domain_scores_gemma":[0.9925903,0.005170561,0.0003653179,0.0005217266,0.0009679915,0.0003840632],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003037687,0.0001524235,0.009085471,0.0000601899,0.00004090211,0.00009569232,0.000183119,0.8974936,0.002676648,0.05201794,0.001061981,0.03682837],"study_design_scores_gemma":[0.000002562392,0.000005784349,0.0001846284,9.094527e-7,0.000001312811,0.000003799917,0.000006748448,0.9964135,0.000233554,0.00311676,0.00002838776,0.000002041294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1920306,0.0001301939,0.8050542,0.000224383,0.00003157379,0.00004423541,0.00009129987,0.001035724,0.001357737],"genre_scores_gemma":[0.9003974,0.0001058712,0.09800328,0.0000562419,0.00004473685,0.00006217206,0.0002179417,0.0001365559,0.0009758375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01577984,"threshold_uncertainty_score":0.031376,"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","authors":[{"name":"Eric Xu","is_ca":false},{"name":"Attahiru Sule Alfa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00743139,0.001654008,0.004920549,0.002042689,0.002474057,0.00619071,0.007635545,0.006010756,0.03960937],"category_scores_gemma":[0.01903591,0.001453618,0.002376836,0.002351908,0.004406294,0.007794448,0.003569912,0.004431169,0.00449039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005862225,"about_ca_system_score_gemma":0.004352907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03363429,"about_ca_topic_score_gemma":0.01745881,"domain_scores_codex":[0.9951062,0.001785439,0.0001789693,0.0007349915,0.0003366187,0.001857675],"domain_scores_gemma":[0.9832329,0.009892032,0.001356034,0.001030715,0.002048667,0.002439588],"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.0009856654,0.0004163794,0.002608678,0.0002461133,0.0001220768,0.0004797933,0.0008750055,0.4129268,0.001206055,0.5493811,0.01774856,0.01300375],"study_design_scores_gemma":[0.0001912557,0.0001574814,0.0007433562,0.00003466556,0.00006643203,0.000104116,0.0004396994,0.9001929,0.0002033033,0.09546597,0.002329485,0.00007131875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3919078,0.001742569,0.4954512,0.01966323,0.0007189428,0.0007090296,0.004701086,0.001477673,0.08362837],"genre_scores_gemma":[0.914506,0.0005228355,0.01211912,0.0005594246,0.0002682392,0.0002586235,0.0005260134,0.0002105387,0.07102915],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03960937,"threshold_uncertainty_score":0.1325065,"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","authors":[{"name":"François Baccelli","is_ca":false},{"name":"David McDonald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005945842,0.001692622,0.00175306,0.001566346,0.0007578474,0.002705781,0.003470854,0.00272906,0.002128252],"category_scores_gemma":[0.01776572,0.001028684,0.001154958,0.001437535,0.002198294,0.002685309,0.001195943,0.002567332,0.0004724374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004622457,"about_ca_system_score_gemma":0.002369498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01522801,"about_ca_topic_score_gemma":0.007675025,"domain_scores_codex":[0.9963845,0.001257873,0.0001564038,0.0005755318,0.001105042,0.0005206202],"domain_scores_gemma":[0.990903,0.006143608,0.0008270736,0.0004863311,0.001327016,0.0003129831],"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.00004500142,0.00003651085,0.0003218038,0.00002719603,0.00002379816,0.0000557897,0.00003475262,0.952932,0.001005689,0.04310005,0.0004316646,0.001985806],"study_design_scores_gemma":[0.000003450716,0.000005387674,0.00004620117,0.000001975455,0.000004901165,0.000005946517,0.000001558255,0.9970408,0.00007318154,0.002760525,0.0000517939,0.000004184503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05132471,0.0005293105,0.9436104,0.0007760346,0.0001303213,0.0001125552,0.0003257962,0.0004222395,0.00276864],"genre_scores_gemma":[0.9601458,0.0007214751,0.03210336,0.0001639539,0.0002596991,0.000260116,0.0003362983,0.0001266044,0.005882573],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01522801,"threshold_uncertainty_score":0.03353846,"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","authors":[{"name":"Jun Li","is_ca":true},{"name":"Yiqiang Q. Zhao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002727324,0.001163344,0.0008183191,0.001091978,0.0005295569,0.00133218,0.0008584792,0.0005320553,0.003263034],"category_scores_gemma":[0.006569401,0.0003491043,0.0004468309,0.001106253,0.000696455,0.001425104,0.0009031615,0.0007762752,0.0003465371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002276149,"about_ca_system_score_gemma":0.001855449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007512877,"about_ca_topic_score_gemma":0.005312389,"domain_scores_codex":[0.9988019,0.0003046895,0.00003805136,0.0001088688,0.0005179528,0.000228414],"domain_scores_gemma":[0.9963543,0.002501962,0.000177339,0.0001402709,0.0007718523,0.00005436279],"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.0002231229,0.00006850182,0.0008271929,0.0001077872,0.0000528272,0.00008607801,0.0000953604,0.9407091,0.007320529,0.02063739,0.0009878568,0.02888421],"study_design_scores_gemma":[0.000003628393,0.00003690373,0.0001404666,0.000003115174,0.000008439139,0.00001930096,0.0000131207,0.9977466,0.0008965514,0.0009476028,0.0001794793,0.000004559648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1114329,0.001954157,0.8783771,0.0003608959,0.0001115924,0.0001027814,0.0001300881,0.0002782063,0.007252296],"genre_scores_gemma":[0.9517351,0.001018789,0.04220203,0.00008121141,0.0001158097,0.00009386208,0.00008735192,0.00009785415,0.004568081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007512877,"threshold_uncertainty_score":0.01651472,"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","authors":[{"name":"Nam Kyu Kim","is_ca":false},{"name":"M. L. Chaudhry","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008309372,0.0008444106,0.00109112,0.001661642,0.001120465,0.002196764,0.00274436,0.001303404,0.001704201],"category_scores_gemma":[0.03531739,0.0006839429,0.0009908009,0.00146637,0.003948821,0.00495067,0.00250811,0.003254187,0.0002699423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002045524,"about_ca_system_score_gemma":0.001923172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005854699,"about_ca_topic_score_gemma":0.004682896,"domain_scores_codex":[0.9982572,0.001006776,0.00007094077,0.0001112505,0.0004168249,0.0001369725],"domain_scores_gemma":[0.9812295,0.01549076,0.0004639117,0.001058088,0.001141289,0.0006164165],"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.0001284328,0.0001122801,0.001279625,0.00005778949,0.00003645147,0.0001074294,0.0001327385,0.3432485,0.0007579811,0.6315134,0.001694307,0.02093109],"study_design_scores_gemma":[0.000005942092,0.0000079771,0.00005829277,0.000004964235,0.000002446036,0.000006068554,0.000006242927,0.9323301,0.000109846,0.06730204,0.0001605186,0.000005561207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0480186,0.0009704417,0.9433267,0.00182576,0.0003046051,0.00003793542,0.00002790261,0.0001689496,0.00531915],"genre_scores_gemma":[0.8094064,0.001269859,0.1839359,0.0005817718,0.0005529228,0.0001387243,0.00007872321,0.0001492631,0.003886501],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008309372,"threshold_uncertainty_score":0.04394472,"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","authors":[{"name":"James Aweya","is_ca":true},{"name":"Michel Ouellette","is_ca":true},{"name":"Delfin Y. Montuno","is_ca":true},{"name":"Zhonghui Yao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003024755,0.001547556,0.0009903093,0.002379837,0.001009212,0.001706621,0.003025242,0.0008509791,0.004645361],"category_scores_gemma":[0.008086705,0.0005659369,0.0003467458,0.001427382,0.0005998702,0.002402653,0.001036812,0.001409797,0.000974306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001410966,"about_ca_system_score_gemma":0.002164066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006972249,"about_ca_topic_score_gemma":0.005934517,"domain_scores_codex":[0.997038,0.0007097637,0.0001760085,0.0002582043,0.001347943,0.0004701127],"domain_scores_gemma":[0.99599,0.001034243,0.0003221306,0.000917824,0.001311878,0.0004239604],"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.009830643,0.002637501,0.01050648,0.0008656916,0.0007321116,0.0005947667,0.0004056305,0.09684732,0.1140481,0.01433692,0.05019814,0.6989967],"study_design_scores_gemma":[0.0009101835,0.002126222,0.006360079,0.00005195274,0.0003705894,0.0005991743,0.00008923614,0.8395915,0.1283337,0.003310178,0.01803371,0.0002235168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3597681,0.002118043,0.4808535,0.0004494728,0.0009522637,0.002877052,0.003217273,0.1304372,0.01932705],"genre_scores_gemma":[0.8277935,0.0004264955,0.1567869,0.0001848522,0.0001030893,0.000594859,0.002802752,0.002773791,0.008533754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006972249,"threshold_uncertainty_score":0.01599663,"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","authors":[{"name":"Yu Ying","is_ca":false},{"name":"Fabrice Guillemin","is_ca":false},{"name":"Ravi R. Mazumdar","is_ca":true},{"name":"Catherine Rosenberg","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007045852,0.001085296,0.0009947972,0.002482252,0.0007441966,0.002292968,0.002237651,0.001188786,0.003879332],"category_scores_gemma":[0.05089786,0.0004759727,0.0004781181,0.001702335,0.002018122,0.003652381,0.001973951,0.001887123,0.0003840083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003848974,"about_ca_system_score_gemma":0.001902394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00428232,"about_ca_topic_score_gemma":0.002892631,"domain_scores_codex":[0.9976931,0.0008082138,0.00006368547,0.0002256232,0.0008717956,0.0003375512],"domain_scores_gemma":[0.9776912,0.01703553,0.001005517,0.001479909,0.002303102,0.0004847546],"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.0007742778,0.0003093303,0.004118177,0.0003596431,0.0001467754,0.0003031275,0.0006497267,0.5564247,0.01536061,0.3497054,0.006165806,0.06568247],"study_design_scores_gemma":[0.00001149676,0.0000332004,0.0003843091,0.00002624773,0.0000294089,0.00005769686,0.00002725602,0.9762116,0.001564767,0.02128057,0.0003588421,0.00001447321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2560183,0.00541719,0.7131554,0.001097274,0.0002271404,0.0001057492,0.000174651,0.001449848,0.02235452],"genre_scores_gemma":[0.9622625,0.001112659,0.03120772,0.0001803688,0.0001605282,0.00008168109,0.0000939553,0.0002013657,0.004699235],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007045852,"threshold_uncertainty_score":0.03726244,"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","authors":[{"name":"Guangwei Bai","is_ca":true},{"name":"Carey Williamson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006248873,0.000367496,0.0003568396,0.0005376252,0.0001990246,0.0005048631,0.0003927495,0.0004438501,0.002390319],"category_scores_gemma":[0.005458856,0.0001357469,0.0002635439,0.0007083447,0.0002724012,0.0006904635,0.0001993505,0.0005541904,0.0002946747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005904225,"about_ca_system_score_gemma":0.0005033725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003888821,"about_ca_topic_score_gemma":0.002382348,"domain_scores_codex":[0.9997078,0.00007180873,0.000008415968,0.000033937,0.0001303643,0.0000476032],"domain_scores_gemma":[0.9961389,0.002834944,0.0001701676,0.0002398498,0.000547904,0.00006820366],"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.0007711877,0.0002773362,0.003803665,0.0002064977,0.0001033099,0.0002707247,0.0001198404,0.8159949,0.1045054,0.01725193,0.001896419,0.05479881],"study_design_scores_gemma":[0.00000598491,0.0000281604,0.001115476,0.000002905723,0.00001266539,0.00003938951,0.00001174244,0.9897482,0.008194485,0.0006523482,0.0001835543,0.00000507707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6421658,0.001173789,0.347017,0.0003204325,0.00007704541,0.00004521398,0.0002771838,0.0009989523,0.007924623],"genre_scores_gemma":[0.9803225,0.0003500172,0.01678936,0.00005022885,0.00002960081,0.00001582593,0.0001615816,0.000108072,0.002172883],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003888821,"threshold_uncertainty_score":0.00799644,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009361381,0.002106903,0.001930473,0.002924348,0.00181272,0.005153146,0.003328071,0.001786934,0.01048052],"category_scores_gemma":[0.03760803,0.0008324371,0.0008572625,0.004880225,0.001854845,0.005489295,0.00196197,0.001672854,0.001668843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009076434,"about_ca_system_score_gemma":0.009892692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02760163,"about_ca_topic_score_gemma":0.03845059,"domain_scores_codex":[0.9841652,0.00420536,0.0008138277,0.001613391,0.004401563,0.004800616],"domain_scores_gemma":[0.9415887,0.03770392,0.003481207,0.007899008,0.007625383,0.001701851],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003721118,0.0004339195,0.00284395,0.0003782309,0.0001502367,0.00012571,0.0001521584,0.9266325,0.004959615,0.01582532,0.01635648,0.02842073],"study_design_scores_gemma":[0.000120748,0.0003084257,0.001418701,0.00004402531,0.00008026514,0.00009046538,0.0001866439,0.9849526,0.005096043,0.006378357,0.001277904,0.00004581835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7559654,0.009050325,0.1337371,0.003411805,0.0005902037,0.0005315094,0.01167031,0.01039833,0.07464522],"genre_scores_gemma":[0.9596687,0.0006968968,0.031087,0.0002371364,0.0001111371,0.0001542292,0.002717016,0.0008016198,0.004526319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02760163,"threshold_uncertainty_score":0.06585443,"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","authors":[{"name":"Se Won Lee","is_ca":false},{"name":"Ho Woo Lee","is_ca":false},{"name":"Jung Woo Baek","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738662,0.0005635786,0.0007824852,0.0008191254,0.0005921284,0.001592213,0.001270495,0.0005105656,0.001950323],"category_scores_gemma":[0.00582017,0.0002306699,0.0004410346,0.0006678028,0.0008101437,0.001198601,0.0006073062,0.0007007218,0.0001194864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002326162,"about_ca_system_score_gemma":0.00200067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01359387,"about_ca_topic_score_gemma":0.004164617,"domain_scores_codex":[0.9990469,0.0002066311,0.0000225113,0.0001203921,0.0003687009,0.0002348601],"domain_scores_gemma":[0.9979092,0.001075288,0.000199324,0.00008741793,0.0005848086,0.0001438807],"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.0002494431,0.00009904631,0.002866637,0.0001406374,0.00005130865,0.0002289983,0.000146748,0.8823724,0.009082593,0.08924729,0.001676372,0.01383854],"study_design_scores_gemma":[0.000001466607,0.000006357346,0.000154561,9.523027e-7,0.000002939415,0.000005774712,0.000006197819,0.9982858,0.0001666456,0.001330048,0.00003746246,0.000001807981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3157379,0.001207754,0.6720107,0.0009706589,0.0002222241,0.0001070416,0.0001735752,0.0004405108,0.009129725],"genre_scores_gemma":[0.9908431,0.0001828924,0.006825988,0.00004686552,0.00006261373,0.00001844597,0.00004237829,0.00002894946,0.001948947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01359387,"threshold_uncertainty_score":0.02702945,"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","authors":[{"name":"Olivia Das","is_ca":true},{"name":"C.M. Woodside","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007074345,0.0007093117,0.0004424631,0.001461017,0.0004243626,0.001257118,0.0009665824,0.001157755,0.0006802311],"category_scores_gemma":[0.04427672,0.0002661389,0.0002663973,0.0008619213,0.001087109,0.00236411,0.0005752375,0.0007032014,0.0001077598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001765983,"about_ca_system_score_gemma":0.0008636675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004864185,"about_ca_topic_score_gemma":0.003173158,"domain_scores_codex":[0.9964913,0.002193005,0.0001605813,0.000129676,0.0006758639,0.0003494653],"domain_scores_gemma":[0.949989,0.04182725,0.002293824,0.001976169,0.003308041,0.0006056508],"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.001633775,0.0004812865,0.03444766,0.0001196486,0.0001765233,0.00009329327,0.0002352554,0.8668146,0.008414804,0.008652027,0.0005526606,0.07837854],"study_design_scores_gemma":[0.00003393668,0.0003361739,0.005201476,0.000008205623,0.00005484956,0.00002493579,0.0001058745,0.9855868,0.004216284,0.004304732,0.0001145715,0.00001227614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.977971,0.0003846456,0.01979934,0.0002626397,0.00001541777,0.00001336215,0.00001764946,0.0001744409,0.001361438],"genre_scores_gemma":[0.9966097,0.00004394873,0.003181549,0.000008621001,0.000007645654,0.000004549339,0.00001847273,0.00000774034,0.0001176878],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007074345,"threshold_uncertainty_score":0.03741312,"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","authors":[{"name":"Akbar Ghaffarpour Rahbar","is_ca":false},{"name":"Oliver Yang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204172,0.0003658785,0.0006264431,0.0008409579,0.0007087188,0.0009691806,0.001428045,0.0004662386,0.002167055],"category_scores_gemma":[0.001580844,0.0001468634,0.0002715963,0.0009251023,0.0006177771,0.001185976,0.0008743122,0.0006470944,0.0003307065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008472968,"about_ca_system_score_gemma":0.001516921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002260023,"about_ca_topic_score_gemma":0.003737586,"domain_scores_codex":[0.9990964,0.0001873023,0.00004944196,0.00007670176,0.0004490836,0.0001410616],"domain_scores_gemma":[0.9985396,0.0003895517,0.0001285585,0.0003217121,0.0004320965,0.0001885329],"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.004408344,0.001130383,0.003409818,0.0004038622,0.0002071758,0.0002039941,0.0002474193,0.1270657,0.2637659,0.03806932,0.01202691,0.5490612],"study_design_scores_gemma":[0.0002316429,0.001174664,0.00152806,0.00001182293,0.0001148689,0.0002959259,0.00006634744,0.9090443,0.0777519,0.003511388,0.006223708,0.00004540011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3578683,0.00115503,0.6243517,0.0004639614,0.0004088368,0.0002927206,0.0002696584,0.004474577,0.01071522],"genre_scores_gemma":[0.9222488,0.0001690898,0.07437053,0.0001108287,0.000105724,0.00005022573,0.0001611721,0.00006778292,0.002715823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002260023,"threshold_uncertainty_score":0.007249475,"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","authors":[{"name":"Xiaofeng Song","is_ca":true},{"name":"M. Mehmet Ali","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006563407,0.001252936,0.001512309,0.00209353,0.0008626497,0.002946963,0.002057136,0.001439967,0.002445985],"category_scores_gemma":[0.01912861,0.0006705531,0.0009045428,0.001869899,0.001814923,0.002607502,0.001415276,0.001354985,0.0002996852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004669345,"about_ca_system_score_gemma":0.003062483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007974653,"about_ca_topic_score_gemma":0.002638669,"domain_scores_codex":[0.9973693,0.000908092,0.00008534775,0.0002612244,0.000951773,0.0004242501],"domain_scores_gemma":[0.9865764,0.01026438,0.0007184272,0.0004294112,0.001564506,0.0004467144],"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.0002743055,0.0001169275,0.001118215,0.0000708916,0.00006921309,0.0000979756,0.000095408,0.8861901,0.002854147,0.09618634,0.0009163755,0.01201016],"study_design_scores_gemma":[0.000004582088,0.00002576608,0.0001225887,0.000003106884,0.000008934494,0.00001135558,0.000006141543,0.9943458,0.0002102185,0.005195686,0.00005939514,0.000006311251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.240836,0.002907119,0.7432451,0.001396339,0.0001973531,0.0001095174,0.0001523181,0.0004900363,0.01066612],"genre_scores_gemma":[0.9829071,0.0005429978,0.0132438,0.00007903304,0.0001530777,0.00003096419,0.00006392763,0.00004738539,0.002931797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007974653,"threshold_uncertainty_score":0.03471106,"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","authors":[{"name":"Zinovi L. Krougly","is_ca":true},{"name":"David A. Stanford","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01285297,0.001850618,0.002208613,0.002598753,0.00128615,0.00270918,0.003507451,0.002731081,0.003062392],"category_scores_gemma":[0.05426283,0.001336412,0.001300021,0.002300744,0.002461504,0.003694688,0.003718838,0.002898668,0.0006214236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004264268,"about_ca_system_score_gemma":0.003729097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008765041,"about_ca_topic_score_gemma":0.004895463,"domain_scores_codex":[0.9940361,0.003827985,0.0002014856,0.0003476752,0.0011767,0.0004100678],"domain_scores_gemma":[0.9606686,0.03272314,0.001206147,0.001567746,0.003301999,0.0005324624],"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.00008928429,0.00006839928,0.0003287683,0.00005335778,0.00003296444,0.00002222436,0.00007871117,0.9397238,0.0003460568,0.03377493,0.0006034215,0.0248781],"study_design_scores_gemma":[0.000006318002,0.00001051924,0.00001975185,0.000006049338,0.000004524346,0.000003379909,0.000004110751,0.9884255,0.0001343494,0.01128643,0.00009578611,0.000003303812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004282099,0.0001274362,0.9941275,0.00007017918,0.00001717881,0.0000489627,0.00001783858,0.0002571961,0.001051525],"genre_scores_gemma":[0.3821205,0.0004567218,0.6131501,0.0001057143,0.0001056377,0.0007166822,0.0002531578,0.0003479036,0.002743643],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01285297,"threshold_uncertainty_score":0.06797379,"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","authors":[{"name":"Niklas Carlsson","is_ca":true},{"name":"Derek L. Eager","is_ca":true},{"name":"Mary K. Vernon","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004524762,0.001031815,0.001643769,0.001774813,0.001618768,0.001362852,0.002168132,0.001223089,0.003495754],"category_scores_gemma":[0.01031945,0.0003912342,0.0003947624,0.001773626,0.0007628346,0.003399135,0.002186576,0.001046425,0.0004044283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002279647,"about_ca_system_score_gemma":0.001566502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00337911,"about_ca_topic_score_gemma":0.00285162,"domain_scores_codex":[0.9962112,0.001042483,0.000233379,0.000208437,0.001730383,0.0005741487],"domain_scores_gemma":[0.9913085,0.003900588,0.0004972414,0.002171993,0.001684793,0.0004369271],"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.01023722,0.003104544,0.006146587,0.001119153,0.0004405322,0.0005603306,0.0007038422,0.5338843,0.08413038,0.03470942,0.01972014,0.3052435],"study_design_scores_gemma":[0.0005315574,0.001514894,0.001610354,0.00003352112,0.0001699904,0.0002223098,0.0002206286,0.9493536,0.03216632,0.01049398,0.003631327,0.00005160718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8270441,0.00278846,0.1389027,0.001162627,0.0003728227,0.00104068,0.001173872,0.00525912,0.02225548],"genre_scores_gemma":[0.9604614,0.0004491709,0.03527583,0.00006706001,0.00008904765,0.0002541623,0.0005495326,0.0001938335,0.002660125],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004524762,"threshold_uncertainty_score":0.02392954,"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","authors":[{"name":"Attahiru Sule Alfa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003113732,0.001223545,0.001524724,0.002252879,0.000701149,0.003044484,0.003453704,0.001799006,0.003582818],"category_scores_gemma":[0.009429098,0.000488284,0.001447201,0.001861745,0.001665399,0.003867183,0.001411648,0.00187004,0.0004010209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002152384,"about_ca_system_score_gemma":0.00239379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005525506,"about_ca_topic_score_gemma":0.003067353,"domain_scores_codex":[0.9978431,0.000594063,0.0001026912,0.0002151498,0.001013466,0.0002315167],"domain_scores_gemma":[0.9952586,0.002888133,0.0002961352,0.0004348682,0.0009203991,0.0002017773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001102614,0.0002147377,0.00128746,0.0001283797,0.0001137122,0.0001253565,0.0001695747,0.4006356,0.006241431,0.5618795,0.001024873,0.02806918],"study_design_scores_gemma":[0.000008105652,0.00002616187,0.0000919971,0.000007094745,0.00001579143,0.00001583877,0.00001259854,0.9531364,0.0005376391,0.04570495,0.0004335899,0.000009802548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008420683,0.0001421521,0.9891512,0.0001275257,0.00006910723,0.00003267942,0.00002537541,0.00008520349,0.001946034],"genre_scores_gemma":[0.5858843,0.0006300137,0.403936,0.0002965448,0.000248116,0.0002875339,0.0001273062,0.000109486,0.008480657],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005525506,"threshold_uncertainty_score":0.01646721,"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","authors":[{"name":"Suparerk Manitpornsut","is_ca":false},{"name":"Björn Landfeldt","is_ca":false},{"name":"Azzedine Boukerche","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001323873,0.00066371,0.0006292085,0.000402099,0.0003988141,0.0007028731,0.000612714,0.000426819,0.0008112689],"category_scores_gemma":[0.004004028,0.0001586633,0.0001519054,0.0005054224,0.0005948188,0.001284482,0.00095997,0.0003844388,0.0001214977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006197374,"about_ca_system_score_gemma":0.0004373378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001258799,"about_ca_topic_score_gemma":0.001992416,"domain_scores_codex":[0.9989912,0.0004166523,0.00003361598,0.00008061471,0.000260091,0.0002178664],"domain_scores_gemma":[0.9964302,0.002231345,0.0003042621,0.0003956434,0.0004648722,0.0001737492],"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.001138993,0.0003782712,0.004132237,0.00009339326,0.00007105961,0.0001566061,0.00009057305,0.8951564,0.03913463,0.001609147,0.00039163,0.057647],"study_design_scores_gemma":[0.00002022561,0.0005564843,0.00136124,0.000003378566,0.00003916641,0.0000733482,0.00005226101,0.9816096,0.01553599,0.0006349528,0.0001037767,0.000009445506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8549368,0.0004058483,0.1417349,0.00009611247,0.0000453824,0.00004099262,0.00003749631,0.0004676875,0.002234966],"genre_scores_gemma":[0.9945807,0.00005305653,0.005111354,0.000008712263,0.00000870401,0.000005148223,0.00001149513,0.000009321552,0.0002115474],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001323873,"threshold_uncertainty_score":0.0070014,"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","authors":[{"name":"Azzedine Boukerche","is_ca":true},{"name":"Trivikram Dash","is_ca":false},{"name":"Cristina M. Pinotti","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002327059,0.0007174117,0.0008511714,0.000575718,0.0006466142,0.00102618,0.001333493,0.0009288454,0.001430682],"category_scores_gemma":[0.004613816,0.000243755,0.0002360384,0.0005958235,0.0004819708,0.001056149,0.0006868996,0.0005073756,0.0002261925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007141907,"about_ca_system_score_gemma":0.0008709415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001545048,"about_ca_topic_score_gemma":0.0012381,"domain_scores_codex":[0.9989163,0.0003639971,0.00005413483,0.0001226176,0.0003922905,0.0001507411],"domain_scores_gemma":[0.996075,0.002479633,0.0002312584,0.0002952792,0.0007555101,0.0001631796],"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.002275162,0.0004592778,0.003368869,0.0001716647,0.0001581214,0.0001356737,0.0001030302,0.8148168,0.04326377,0.007519017,0.00124482,0.1264837],"study_design_scores_gemma":[0.00001840676,0.0001182328,0.0001812527,0.000001220307,0.00001234384,0.0000310359,0.000007874894,0.9970617,0.002186467,0.0003018285,0.00007584593,0.000003932049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5426242,0.0007438479,0.4504651,0.0003397388,0.0001506765,0.0001530067,0.00006138068,0.0008610972,0.004600911],"genre_scores_gemma":[0.9539833,0.00009207216,0.04464446,0.00003467443,0.0000421665,0.00004366853,0.00003188332,0.00003443814,0.001093392],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002327059,"threshold_uncertainty_score":0.01230681,"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","authors":[{"name":"Qi‐Ming He","is_ca":true},{"name":"Hanqin Zhang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002680184,0.0006931825,0.0009031782,0.0009098146,0.001049192,0.00136361,0.0008970855,0.0008771101,0.002355975],"category_scores_gemma":[0.003828375,0.0002839518,0.0006390918,0.001114997,0.0008277324,0.0009949853,0.0006611257,0.0006549325,0.0001810747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002488745,"about_ca_system_score_gemma":0.00182368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01648569,"about_ca_topic_score_gemma":0.004299839,"domain_scores_codex":[0.998509,0.0006043961,0.00006710501,0.0001665824,0.0002469575,0.0004059347],"domain_scores_gemma":[0.9959824,0.002164877,0.0003271875,0.0001800495,0.0009881904,0.0003572526],"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.001037475,0.0002878817,0.004271818,0.00006914572,0.00006289543,0.0001791693,0.00006056041,0.9764066,0.005012403,0.002595976,0.0003919596,0.009624149],"study_design_scores_gemma":[0.00001222198,0.0002170443,0.001257145,0.000001427931,0.00002361864,0.00001525773,0.0000270811,0.9970514,0.001172516,0.0001832169,0.00003225263,0.000006918854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9573392,0.0001834836,0.03916357,0.0001916602,0.00003315746,0.00006725598,0.00007532449,0.0002345951,0.002711721],"genre_scores_gemma":[0.9982373,0.00002358567,0.001341167,0.000005214738,0.000005741823,0.000006974652,0.00002699002,0.00000463145,0.0003484417],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01648569,"threshold_uncertainty_score":0.03277946,"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","authors":[{"name":"Nima Akbarzadeh","is_ca":true},{"name":"Aditya Mahajan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006765437,0.001661879,0.00271952,0.001800702,0.001266839,0.004151039,0.003380506,0.002664347,0.004554349],"category_scores_gemma":[0.03004796,0.0007101924,0.001350407,0.002596386,0.003693799,0.005554593,0.003532439,0.002938948,0.0006839944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002558303,"about_ca_system_score_gemma":0.002823763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001969795,"about_ca_topic_score_gemma":0.001533668,"domain_scores_codex":[0.9950923,0.002223494,0.0002105965,0.0005958914,0.001172045,0.0007057797],"domain_scores_gemma":[0.9839833,0.009797498,0.00119473,0.003030417,0.001188214,0.0008058222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009664993,0.0001936462,0.001098475,0.0001820939,0.0001043428,0.0001295549,0.0002134765,0.2743984,0.001867523,0.6729046,0.003515904,0.04442539],"study_design_scores_gemma":[0.000073396,0.0001188568,0.0001916643,0.00003576981,0.00002972012,0.00004571268,0.0000315135,0.804405,0.001034687,0.1930083,0.001003621,0.00002179565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09859396,0.001329509,0.886431,0.0009719532,0.0001579194,0.0001764291,0.0003131801,0.0007633066,0.01126262],"genre_scores_gemma":[0.8349743,0.0008789554,0.1546882,0.0002880267,0.0002181662,0.000314697,0.0004064702,0.0002121239,0.008018937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006765437,"threshold_uncertainty_score":0.03577948,"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","authors":[{"name":"B.R. Pekilis","is_ca":true},{"name":"R.E. Seviora","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002929171,0.001043717,0.0008186657,0.001501237,0.0005839604,0.001031863,0.00156795,0.000734252,0.001146718],"category_scores_gemma":[0.01501534,0.0004093487,0.000236155,0.0004975693,0.000881146,0.001346137,0.0007829372,0.001269777,0.0003797066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007984434,"about_ca_system_score_gemma":0.0009756064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001081846,"about_ca_topic_score_gemma":0.001253643,"domain_scores_codex":[0.9953817,0.001671082,0.0002400404,0.0008174291,0.001554177,0.0003356095],"domain_scores_gemma":[0.9786345,0.01205274,0.003116071,0.003589243,0.002106061,0.0005013707],"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.005585768,0.000962547,0.03214224,0.0004664741,0.0002068526,0.0005554811,0.001327254,0.1061908,0.2728207,0.01494813,0.004656631,0.5601372],"study_design_scores_gemma":[0.00009202358,0.0004868699,0.004904067,0.00002763676,0.00006245444,0.0003176605,0.0000543943,0.8976012,0.08808992,0.007274768,0.001017849,0.00007098856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4399413,0.000419623,0.5448269,0.0002026295,0.00009720158,0.0001419018,0.0001320201,0.01215865,0.002079807],"genre_scores_gemma":[0.9646005,0.00003493044,0.03457556,0.00003297706,0.00002139868,0.00005964095,0.00005052156,0.0001332585,0.0004912092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002929171,"threshold_uncertainty_score":0.01549107,"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","authors":[{"name":"Daniel C. Lee","is_ca":true},{"name":"S.L. Spitler","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009357954,0.000726795,0.001039476,0.002374364,0.0008378381,0.003223052,0.00178712,0.001097318,0.004907284],"category_scores_gemma":[0.03780461,0.0004856071,0.0004995541,0.001825016,0.003693106,0.006727025,0.001818003,0.001892221,0.0006227045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002943641,"about_ca_system_score_gemma":0.001741265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003084141,"about_ca_topic_score_gemma":0.001269602,"domain_scores_codex":[0.9968063,0.001609183,0.00007261296,0.0003620374,0.0007840495,0.0003659497],"domain_scores_gemma":[0.9765327,0.01817115,0.0006074173,0.001111366,0.003195417,0.0003820214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009310959,0.00003809461,0.001018713,0.00004005331,0.00002186588,0.00003414665,0.0001565553,0.09646624,0.0005185189,0.8811347,0.002032546,0.0184454],"study_design_scores_gemma":[0.000008199651,0.00002770845,0.0006090193,0.00003566423,0.00001413477,0.00003320593,0.00006230513,0.6484125,0.0003955065,0.3494761,0.00090959,0.00001608647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07333816,0.001087798,0.8960557,0.001483911,0.0001387244,0.0000524348,0.0001066931,0.0002244633,0.02751213],"genre_scores_gemma":[0.9563716,0.001130845,0.03336472,0.0002852062,0.0003619656,0.00009408872,0.0001709222,0.0001377034,0.008082809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009357954,"threshold_uncertainty_score":0.04949021,"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","authors":[{"name":"Bader Al-Manthari","is_ca":false},{"name":"Najah Abu Ali","is_ca":false},{"name":"Nidal Nasser","is_ca":true},{"name":"Hossam S. Hassanein","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006340997,0.001219532,0.001385325,0.0007669145,0.0008087766,0.002130897,0.001709821,0.0009473179,0.002611272],"category_scores_gemma":[0.01324474,0.0003989569,0.0004293005,0.001107175,0.0009159716,0.002518471,0.0009782773,0.001123729,0.0001872148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002743911,"about_ca_system_score_gemma":0.002187779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003936119,"about_ca_topic_score_gemma":0.003714182,"domain_scores_codex":[0.9960871,0.002078124,0.00006702799,0.0002244517,0.0009545218,0.0005888349],"domain_scores_gemma":[0.9951714,0.003422688,0.0002911517,0.0002706815,0.0006852348,0.0001589257],"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.000499177,0.0001784163,0.0008027537,0.0000685202,0.00004281257,0.0001136678,0.00003580523,0.9325318,0.002845704,0.03204507,0.001052522,0.02978375],"study_design_scores_gemma":[0.00001673611,0.0001028742,0.00023739,0.000004816208,0.00001875399,0.00004157582,0.00001831935,0.9943938,0.000688885,0.004196109,0.0002727981,0.000007839792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3325069,0.003040356,0.6409037,0.001438799,0.0002578539,0.0002052834,0.0001361054,0.0002688126,0.02124226],"genre_scores_gemma":[0.9814448,0.0002986264,0.01664684,0.00005752375,0.0001146944,0.00002555499,0.00002177404,0.00003118936,0.001359039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006340997,"threshold_uncertainty_score":0.03353477,"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","authors":[{"name":"Mehdi Karamollahi","is_ca":true},{"name":"Carey Williamson","is_ca":true},{"name":"Martin Arlitt","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007261214,0.0008008838,0.0007310911,0.0008973911,0.0009106208,0.000986176,0.00133421,0.001586245,0.002228725],"category_scores_gemma":[0.002023271,0.0002698653,0.0005787555,0.0009643873,0.0007176573,0.0008900529,0.0006385652,0.0008585582,0.000191571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002046012,"about_ca_system_score_gemma":0.0009201111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.04577054,"about_ca_topic_score_gemma":0.02317841,"domain_scores_codex":[0.9995955,0.0001507861,0.00001131258,0.00005274112,0.00007653645,0.0001131717],"domain_scores_gemma":[0.9982415,0.00110457,0.00010041,0.00008142267,0.0002838647,0.0001881899],"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.00008613429,0.0001485695,0.002740424,0.00002474581,0.00001557044,0.0002241871,0.00008556005,0.9915757,0.0009375361,0.001466106,0.0005360472,0.002159468],"study_design_scores_gemma":[0.000007935348,0.00003948114,0.0004472249,0.00000232703,0.000004846226,0.00001789471,0.00006103842,0.9988555,0.0002731136,0.0001679598,0.0001190715,0.000003651146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9759563,0.000154318,0.01601806,0.0003689655,0.00003790891,0.0000841675,0.0002825634,0.0002165305,0.006881213],"genre_scores_gemma":[0.9958338,0.00008129803,0.002634471,0.00002156957,0.000006940502,0.00001974258,0.0001249467,0.00001527813,0.00126192],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04577054,"threshold_uncertainty_score":0.09100831,"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","authors":[{"name":"Elaine J. Weyuker","is_ca":false},{"name":"Murray Woodside","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00631636,0.0016799,0.001363255,0.003665251,0.001637534,0.004784842,0.003063881,0.006030583,0.1532869],"category_scores_gemma":[0.03090169,0.0005197763,0.001462184,0.001614544,0.001181288,0.002509282,0.002030882,0.005647248,0.07067675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00185054,"about_ca_system_score_gemma":0.002450341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00111875,"about_ca_topic_score_gemma":0.002343865,"domain_scores_codex":[0.9959903,0.0007194111,0.0003868731,0.0005807357,0.001966278,0.0003564163],"domain_scores_gemma":[0.9740054,0.006537207,0.001969395,0.001492222,0.01242841,0.003567426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000207883,0.000007923451,0.00002398007,0.0001748931,0.000004219409,0.00001777421,0.000006746868,0.00001685742,0.00003597336,0.000333433,0.9861362,0.01322123],"study_design_scores_gemma":[0.00001943069,0.00001531883,0.0002566871,0.0002054925,0.00000977097,0.00003838474,0.00001400228,0.00003141062,0.00006796014,0.0005050682,0.9988295,0.000006805096],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0001205899,0.006593486,0.0004284507,0.0569941,0.9155259,0.00008546017,0.0004712381,0.0001491281,0.0196318],"genre_scores_gemma":[0.0022808,0.006256549,0.0007487061,0.06734427,0.728538,0.0002154305,0.0005219235,0.0001906821,0.1939037],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.1532869,"threshold_uncertainty_score":0.5127957,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}