{"meta":{"query_hash":"7578520a9f7b","filters":{"venue":"Performance Evaluation"},"cohort_total":51,"direct_labels_cover":0,"predictions_cover":51,"exported":51,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/7578520a9f7b","api":"https://metacan.xera.ac/api/v1/cohort?venue=Performance+Evaluation"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01988584985260453,"score_gpt":0.2525275857868322,"score_spread":0.23264173593422768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512467621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98197657,0.000016343918,0.002959357,0.0008409975,0.00014553317,0.00023465454,0.0000019279214,0.00007900546,0.0137455845],"genre_scores_gemma":[0.9984593,0.0000023849766,0.000010090299,0.0004330271,0.0004638984,0.000056929195,0.00023448127,0.000009986251,0.00032990763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990573,0.000025042387,0.00017134471,0.00015455933,0.00043473727,0.00015699424],"domain_scores_gemma":[0.9993361,0.000062904684,0.00017084979,0.00022011458,0.0002074189,0.0000026154546],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015494383,0.000099096724,0.00007234037,0.00006656655,0.0003366178,0.00010663328,0.00012358777,0.000020652318,0.00038440496],"category_scores_gemma":[0.00018058006,0.000069080634,0.000041105817,0.00040767965,0.000036420384,0.0008005205,0.000028703684,0.00008540601,0.0009890873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015994634,0.00013266274,0.0074485354,0.0000481773,0.000030731022,6.717593e-7,0.000045071065,0.63102967,0.0007322362,0.26075882,0.012621323,0.08699217],"study_design_scores_gemma":[0.0002630954,0.00000823268,0.02867008,0.000026330308,0.00007665141,2.3455583e-7,0.000027629996,0.8780347,0.00048696692,0.08529074,0.006974542,0.00014081574],"about_ca_topic_score_codex":0.00004160214,"about_ca_topic_score_gemma":0.00002463469,"teacher_disagreement_score":0.24700503,"about_ca_system_score_codex":0.000085351276,"about_ca_system_score_gemma":0.00000989528,"threshold_uncertainty_score":0.99978876},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05952514272069574,"score_gpt":0.2785033849298072,"score_spread":0.21897824220911144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963795908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1729083,0.00024336595,0.8253424,0.0004939967,0.0002701622,0.000599373,0.0000010489329,0.000027390017,0.00011394286],"genre_scores_gemma":[0.99116063,0.00004429558,0.008126126,0.0001275181,0.000101080535,0.00028582715,0.000002992878,0.0000050065414,0.00014654465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989785,0.000022903005,0.0002095434,0.00018272459,0.00044451072,0.00016180793],"domain_scores_gemma":[0.9990687,0.00012851354,0.00010669834,0.00033888654,0.00033055648,0.000026650941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007325954,0.00008632604,0.00011000184,0.000035775454,0.00026358903,0.000015410591,0.00037526884,0.000031496875,0.000007870879],"category_scores_gemma":[0.000037667556,0.000061338396,0.000092989496,0.00015940446,0.000039947543,0.00030483794,0.00003457887,0.000058989506,0.000012814271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015413447,0.000017269833,0.000019043975,0.0000048087786,0.000014711019,2.3006626e-8,0.0009975174,0.7906907,0.000039146813,0.0002352219,0.00032861615,0.2076375],"study_design_scores_gemma":[0.00073263113,0.000101900674,0.0008102464,0.000015220846,0.000042702522,0.0000048529705,0.000016065096,0.9980282,0.000040184026,0.00009083572,0.000041970336,0.00007518964],"about_ca_topic_score_codex":0.0000018902277,"about_ca_topic_score_gemma":0.000003217732,"teacher_disagreement_score":0.8182523,"about_ca_system_score_codex":0.00004197988,"about_ca_system_score_gemma":0.00021163274,"threshold_uncertainty_score":0.2501307},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014519446882108124,"score_gpt":0.242674935334071,"score_spread":0.22815548845196287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968886330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42917028,0.00026113685,0.5697716,0.0001461566,0.0000647892,0.00045297577,6.3363603e-7,0.00011599758,0.000016447762],"genre_scores_gemma":[0.9429058,0.0003962969,0.05638107,0.00005262768,0.00007797472,0.00008962492,0.000031273456,0.000012817127,0.0000525212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882245,0.00006968902,0.00021112904,0.0003620189,0.00031752183,0.00021717329],"domain_scores_gemma":[0.9993636,0.00005576492,0.00010003849,0.000252872,0.00018559027,0.000042136406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081362436,0.0001244511,0.00013559661,0.00016858139,0.00023117324,0.00006979373,0.00019047904,0.00009423873,0.0000057293564],"category_scores_gemma":[0.000033630367,0.00012050369,0.000010245397,0.0004897381,0.000084843756,0.0005552672,0.00009191951,0.0000683422,0.000006365987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010731747,0.00006177168,0.006577998,0.000016618407,0.0000053327517,8.981822e-7,0.00078759907,0.53188246,0.000060054022,0.00035009958,0.00017361336,0.46007282],"study_design_scores_gemma":[0.00062331464,0.00012887908,0.0077052373,0.000029887666,0.000005988326,0.000016491735,0.000010141899,0.99003994,0.0010731197,0.00009375333,0.000120911514,0.00015233525],"about_ca_topic_score_codex":0.0000036031497,"about_ca_topic_score_gemma":0.0000028705383,"teacher_disagreement_score":0.51373553,"about_ca_system_score_codex":0.00008730499,"about_ca_system_score_gemma":0.00005188137,"threshold_uncertainty_score":0.4913998},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03054012263118326,"score_gpt":0.2756305327288212,"score_spread":0.24509041009763793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971438357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98598665,0.000022415452,0.0049620825,0.00026024532,0.00006117809,0.00082175026,0.0000015642287,0.00012667206,0.00775742],"genre_scores_gemma":[0.99511355,0.0000018035471,0.0028517675,0.00078194053,0.0003270259,0.00025626997,0.00016829517,0.00003470063,0.00046462167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987964,0.000049624534,0.00021187487,0.00032540195,0.00037860824,0.00023807192],"domain_scores_gemma":[0.99847615,0.000048632428,0.00024935888,0.00033964476,0.000873796,0.000012445479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00214023,0.0001647697,0.0001665796,0.00017445585,0.00027802316,0.00009677922,0.00014670356,0.000050675393,0.0003614953],"category_scores_gemma":[0.00030061812,0.00014234957,0.00003535615,0.0006047417,0.000026169299,0.0028221766,0.000019450299,0.000073959396,0.0002398358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009536048,0.0010754053,0.027288945,0.0017673924,0.0007834339,0.00000505215,0.0047110855,0.73079234,0.015174464,0.062392753,0.0022518428,0.14422123],"study_design_scores_gemma":[0.0013470193,0.000086992775,0.0022524337,0.000065620385,0.00031747512,0.0000012830598,0.00029615386,0.9838548,0.00086253777,0.0071339384,0.0034843357,0.00029742823],"about_ca_topic_score_codex":0.00001838087,"about_ca_topic_score_gemma":0.000078728175,"teacher_disagreement_score":0.25306243,"about_ca_system_score_codex":0.00008035107,"about_ca_system_score_gemma":0.000054433647,"threshold_uncertainty_score":0.5804847},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03147146219320217,"score_gpt":0.2537607558979556,"score_spread":0.22228929370475342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977167986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6785366,0.00013564722,0.3204204,0.0000031235572,0.000073722906,0.000511934,0.000005885028,0.00015413451,0.00015854705],"genre_scores_gemma":[0.9927648,0.00012498962,0.0064041954,0.0000030275476,0.000090225054,0.00033731162,0.0001935855,0.000056759938,0.000025106267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984902,0.000036183577,0.00047739776,0.00022996026,0.00045265903,0.00031357788],"domain_scores_gemma":[0.9991262,0.000038407623,0.00016440607,0.00027930478,0.00034194303,0.000049747316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005443005,0.00022405584,0.0003652643,0.0003345643,0.000116060415,0.000021850668,0.00011250929,0.00009021971,0.00005659685],"category_scores_gemma":[0.000010214064,0.00020942595,0.000089942565,0.0009506915,0.000021577127,0.0010443865,0.0000160388,0.00009717154,0.000012535157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057437934,0.000016659113,0.005294557,0.0003261419,0.00025845895,3.6747593e-8,0.0007932252,0.9707983,0.00076949777,0.000008757001,0.0000034066757,0.021673525],"study_design_scores_gemma":[0.00070751336,0.00006988423,0.0023749645,0.00032284536,0.0008248705,0.0000014115549,0.00009926949,0.9944559,0.00088419224,3.3853266e-7,0.0000028634192,0.00025599662],"about_ca_topic_score_codex":0.0000055618375,"about_ca_topic_score_gemma":0.000015343314,"teacher_disagreement_score":0.3142282,"about_ca_system_score_codex":0.00036419078,"about_ca_system_score_gemma":0.000009655137,"threshold_uncertainty_score":0.8540142},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.042533007766487295,"score_gpt":0.29166738718829094,"score_spread":0.24913437942180364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977697622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9026563,0.00049360935,0.09455863,0.0004865455,0.00029334708,0.000504192,4.7038577e-7,0.0006132794,0.00039362494],"genre_scores_gemma":[0.9603491,0.00016433967,0.039106466,0.000051457737,0.00017247192,0.000052332165,0.00006940251,0.000021340937,0.000013129325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985139,0.000027338985,0.00038442982,0.00025163978,0.00041212933,0.00041056567],"domain_scores_gemma":[0.9994634,0.00003582474,0.000055842895,0.00027424583,0.00010063801,0.00007004229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057508016,0.00020038632,0.00021088627,0.00020084335,0.000042839343,0.00003250025,0.00012678525,0.00020591714,0.000050877083],"category_scores_gemma":[0.0001557103,0.00020736287,0.00004800637,0.0005799769,0.00003608359,0.0005157868,0.000011965464,0.00038521434,0.00003059634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072024595,0.000034913926,0.00070854364,0.00001078315,0.000010822448,6.05638e-7,0.000028307879,0.76110464,0.007585837,0.00019569826,0.00027597178,0.22997186],"study_design_scores_gemma":[0.001094217,0.00017186976,0.026836285,0.0000696732,0.000029018476,0.0000016513515,0.000041615054,0.9647679,0.005635918,0.001027226,0.0001018256,0.00022282086],"about_ca_topic_score_codex":0.0000020818957,"about_ca_topic_score_gemma":0.000012804495,"teacher_disagreement_score":0.22974902,"about_ca_system_score_codex":0.0004666856,"about_ca_system_score_gemma":0.0000387632,"threshold_uncertainty_score":0.84560126},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science","score_opus":0.04874494363695795,"score_gpt":0.26013850152115864,"score_spread":0.2113935578842007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985799965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87965804,0.000109045446,0.11779454,0.0005729578,0.000064049906,0.0010776884,0.000014626429,0.00015242377,0.0005566086],"genre_scores_gemma":[0.99862486,0.000062013256,0.00060493156,0.000057866604,0.000041115552,0.00048965064,0.00006306798,0.000013028328,0.000043484153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994862,0.000003749961,0.00014707624,0.000091435766,0.00016519462,0.00010631253],"domain_scores_gemma":[0.99964297,0.000019670946,0.000029498278,0.00012678755,0.0001623079,0.000018757071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024617199,0.00007857578,0.00005781061,0.00008577885,0.00013281031,0.000028559713,0.000042052463,0.000035069395,0.00000525482],"category_scores_gemma":[0.000006690789,0.000057333848,0.000011925931,0.0002717338,0.00002339023,0.00024516793,0.0000012584203,0.000058489193,0.000003651987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012842548,0.00000713732,0.00052706496,0.00011774466,0.00002586097,1.5519479e-8,0.00381919,0.97576874,0.00055640517,0.00055181375,0.00026182758,0.018351361],"study_design_scores_gemma":[0.000519276,0.000021526526,0.01687535,0.000033598084,0.000045673947,0.0000016419735,0.0003782073,0.9817732,0.00021551736,0.0000075014646,0.000053757896,0.00007473034],"about_ca_topic_score_codex":0.0000070230853,"about_ca_topic_score_gemma":0.000030572628,"teacher_disagreement_score":0.11896679,"about_ca_system_score_codex":0.00008965616,"about_ca_system_score_gemma":0.000022620896,"threshold_uncertainty_score":0.23380065},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030947854036667333,"score_gpt":0.3001367638533035,"score_spread":0.2691889098166362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992579433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9181819,0.000049218612,0.07622842,0.000042478154,0.00007806236,0.0005698833,0.0000020021691,0.00005327769,0.004794733],"genre_scores_gemma":[0.99533737,0.000007772771,0.003593484,0.0001476996,0.00029924684,0.00019578307,0.00025763657,0.00002374826,0.00013728086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988336,0.000059885555,0.00026629318,0.0003175823,0.0002863362,0.00023629898],"domain_scores_gemma":[0.9992416,0.000059450573,0.00020880639,0.00023163078,0.0002493954,0.000009107497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027549453,0.00015113039,0.00018392527,0.00035121266,0.00016591234,0.000112818045,0.000152031,0.000042553533,0.00017525342],"category_scores_gemma":[0.0004633679,0.00014197346,0.00005661183,0.0005420245,0.000029477074,0.002574608,0.000018598215,0.00008711459,0.000065016284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009651914,0.000081170896,0.015547826,0.00006778198,0.000032793185,1.8874027e-7,0.00020222724,0.96497947,0.00076224847,0.0046421015,0.000027294027,0.013560393],"study_design_scores_gemma":[0.000594731,0.0000161854,0.0022132227,0.00002466004,0.00010100571,1.5323504e-7,0.00009392054,0.98867077,0.00051659805,0.0071325395,0.00043835607,0.00019786337],"about_ca_topic_score_codex":0.000026359014,"about_ca_topic_score_gemma":0.000013377499,"teacher_disagreement_score":0.077155426,"about_ca_system_score_codex":0.00009225829,"about_ca_system_score_gemma":0.000018944533,"threshold_uncertainty_score":0.57895094},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020609232487367738,"score_gpt":0.26061504888820686,"score_spread":0.24000581640083912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996776639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39085302,0.0005969161,0.60717213,0.000032890897,0.00007773399,0.0007404412,0.00000516469,0.00018886058,0.00033284342],"genre_scores_gemma":[0.98110133,0.00035793384,0.017549714,0.000016608688,0.00007327819,0.0002892601,0.0005647586,0.000022493134,0.00002463561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990555,0.000041138275,0.00025531207,0.00015230048,0.00029717392,0.00019854156],"domain_scores_gemma":[0.9991176,0.00005292418,0.00009204137,0.00035706465,0.00034278992,0.000037589718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055465446,0.00014211824,0.00018431943,0.0001879716,0.00014227741,0.000042348674,0.00011436543,0.00006631446,0.000010118184],"category_scores_gemma":[0.00002144628,0.00013351615,0.00003906772,0.00069017196,0.000014745247,0.0005023578,0.0000051021575,0.00007919031,0.000007676175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028039427,0.000012914401,0.0009924374,0.000017813427,0.00008833642,3.3022832e-8,0.00023736968,0.9777355,0.00006226715,0.00004858753,0.00007473839,0.020701963],"study_design_scores_gemma":[0.0006055515,0.000084377585,0.010816841,0.000044484474,0.0003515925,0.0000011255116,0.00005456433,0.98743176,0.0002971375,0.0000313038,0.00010480055,0.00017643323],"about_ca_topic_score_codex":0.0000023215252,"about_ca_topic_score_gemma":0.000015603006,"teacher_disagreement_score":0.5902483,"about_ca_system_score_codex":0.0001854574,"about_ca_system_score_gemma":0.000016508764,"threshold_uncertainty_score":0.5444631},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08134839881142347,"score_gpt":0.3361951785067298,"score_spread":0.25484677969530634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999118623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4196168,0.000027708837,0.57918966,0.00003417309,0.000071229195,0.00093431264,0.0000019468157,0.00002284471,0.000101317215],"genre_scores_gemma":[0.9922362,0.000008573138,0.007577084,0.000028073617,0.00006432067,0.000053917996,0.000024567831,0.000005036738,0.0000022161817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976513,0.0000981181,0.0004437662,0.0002658515,0.001273901,0.00026708198],"domain_scores_gemma":[0.9982703,0.000048074267,0.00035429993,0.00044364753,0.0008227189,0.000060966555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004108186,0.00011885696,0.0002383357,0.0002767805,0.00012786005,0.00004642274,0.00032870463,0.00006131436,0.00001770483],"category_scores_gemma":[0.000054881435,0.000108589644,0.000095723,0.0018732465,0.000026940012,0.00039068947,0.00006920332,0.00008924787,0.0000035742723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005536591,0.00006269949,0.015195109,0.000037037906,0.00036023464,0.000001458927,0.00061580417,0.1812538,0.009767312,0.00032049,0.000031270287,0.7922994],"study_design_scores_gemma":[0.00027005488,0.000048280097,0.16736868,0.00005830548,0.00019922543,8.343153e-7,0.000010574184,0.82481146,0.006992908,0.00008543358,0.00004860985,0.000105656414],"about_ca_topic_score_codex":0.0000635615,"about_ca_topic_score_gemma":0.0000845382,"teacher_disagreement_score":0.7921938,"about_ca_system_score_codex":0.00029375224,"about_ca_system_score_gemma":0.00015839565,"threshold_uncertainty_score":0.44281572},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02793574997136396,"score_gpt":0.27867954990976207,"score_spread":0.2507437999383981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006165916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89076865,0.00026306388,0.10632641,0.00009682981,0.000563415,0.000727061,0.00007508418,0.00023074319,0.0009487708],"genre_scores_gemma":[0.9955969,9.683799e-7,0.0013537115,0.00004599841,0.0018509078,0.000058004254,0.0010494362,0.000022908229,0.000021162235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998476,0.00006069775,0.0003969558,0.00025814582,0.0003939325,0.00041425528],"domain_scores_gemma":[0.9987524,0.00013923211,0.00036712314,0.00020728911,0.00050672475,0.000027243354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037515438,0.00019646854,0.00024598246,0.00011815576,0.0010357297,0.00016117658,0.00011436049,0.00007473196,0.000034052067],"category_scores_gemma":[0.00019836758,0.00019370139,0.00007881058,0.00030878623,0.000081093865,0.0021045045,0.00009741604,0.00009248976,0.0001244004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024065867,0.000185735,0.018979937,0.0031429583,0.00024919419,4.3570506e-7,0.00016625837,0.055042062,0.0034337302,0.91011953,0.00034549978,0.00809397],"study_design_scores_gemma":[0.00048540183,0.0000066695234,0.002883002,0.00026138555,0.00046187386,0.000007229791,0.00020604997,0.9929267,0.00015361058,0.00025970076,0.0021074517,0.00024089191],"about_ca_topic_score_codex":0.00006192927,"about_ca_topic_score_gemma":0.000005148571,"teacher_disagreement_score":0.9378847,"about_ca_system_score_codex":0.00050481124,"about_ca_system_score_gemma":0.000028473742,"threshold_uncertainty_score":0.79661},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07062651834011176,"score_gpt":0.3266894149817192,"score_spread":0.2560628966416075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007604684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4363521,0.00008669661,0.5623342,0.00018894514,0.00020258062,0.00032658793,0.0000018238773,0.00037463417,0.00013246812],"genre_scores_gemma":[0.7653652,0.000011936936,0.23425724,0.00006858761,0.00008224591,0.00008206173,0.000011518412,0.000008661384,0.00011257529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981212,0.00002720888,0.00037209556,0.0004939053,0.00060822687,0.0003773688],"domain_scores_gemma":[0.99856186,0.0002682449,0.00021506811,0.00056674855,0.00030662527,0.00008145758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014139058,0.00018443739,0.00017819107,0.00017916286,0.00026572088,0.00015451488,0.00083851675,0.00009945413,0.000016906333],"category_scores_gemma":[0.00034772794,0.0001679119,0.00006447116,0.00032761754,0.000023629245,0.0009200065,0.00012950067,0.0001576256,0.000025062885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002144846,0.000020484056,0.00029617967,0.000007722441,0.0000070617652,1.8907761e-7,0.0007375719,0.07959169,0.003707792,0.000878497,0.00045951264,0.91427183],"study_design_scores_gemma":[0.0009315339,0.00008116486,0.0014255507,0.000084925196,0.000014735884,0.0000010294557,0.000061557956,0.96408737,0.028618636,0.004220448,0.00025943,0.0002136247],"about_ca_topic_score_codex":0.000035619854,"about_ca_topic_score_gemma":0.00004392449,"teacher_disagreement_score":0.9140582,"about_ca_system_score_codex":0.00012781327,"about_ca_system_score_gemma":0.00030661712,"threshold_uncertainty_score":0.68472487},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto","keywords":"Computer network; Computer science; Ethernet; Carrier Ethernet","score_opus":0.02417788076314523,"score_gpt":0.25855830999617607,"score_spread":0.23438042923303085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013072857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95424944,0.00083370385,0.042323593,0.00057528255,0.0009693074,0.00054845324,2.5385347e-7,0.0001580068,0.00034194172],"genre_scores_gemma":[0.99837756,0.00003370594,0.0009136986,0.0001287497,0.00028906154,0.0001870914,0.000007489445,0.0000086869795,0.00005394483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984187,0.00008401875,0.00031700204,0.00030721835,0.0005424558,0.00033059248],"domain_scores_gemma":[0.99934137,0.00003501178,0.00011089205,0.000327739,0.00012932807,0.000055643995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001831118,0.00013203856,0.00015607692,0.00008344522,0.00009630813,0.00010761858,0.00037613724,0.00008450811,0.000012731184],"category_scores_gemma":[0.000017242397,0.00012674535,0.000030607884,0.00051653385,0.000017282622,0.0005361866,0.00003208044,0.0001707669,0.0001276297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074631807,0.00003165047,0.0022671204,0.000003911257,0.0000030362567,0.0000010772754,0.0003592632,0.82088447,0.000008559467,0.0014923938,0.000087306944,0.17485373],"study_design_scores_gemma":[0.0013822202,0.0000775497,0.038420178,0.00007557972,0.000011760312,0.000007862862,0.000023405408,0.959514,0.000013295272,0.00022192857,0.000099163444,0.00015304906],"about_ca_topic_score_codex":0.00002147887,"about_ca_topic_score_gemma":0.000056177934,"teacher_disagreement_score":0.17470068,"about_ca_system_score_codex":0.00021060862,"about_ca_system_score_gemma":0.00021972424,"threshold_uncertainty_score":0.5168525},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.039344604853692795,"score_gpt":0.3603536695395603,"score_spread":0.3210090646858675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W201333428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9441811,0.000005480328,0.000034289817,0.007197524,0.0123119475,0.00016635722,3.794223e-7,0.000050110357,0.036052853],"genre_scores_gemma":[0.9682551,0.000021685773,0.00011214362,0.000046336118,0.030999534,0.000023827384,0.000008953554,0.000004240278,0.00052819203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900854,0.0000672216,0.000080529404,0.00011526519,0.00059322437,0.00013523451],"domain_scores_gemma":[0.9995107,0.00002628492,0.000052150903,0.00011617515,0.00025835875,0.000036320893],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033613518,0.00004158129,0.00003935069,0.000042342996,0.00059443264,0.000058610854,0.00009084366,0.000078600875,0.0012463005],"category_scores_gemma":[0.00039202717,0.00004066767,0.000016230078,0.00011298116,0.00011504888,0.00046713286,0.000009128782,0.00023379337,0.00019269969],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028568467,0.00015183097,0.008558679,0.0000126833675,0.000016799999,1.8374816e-7,0.032166693,0.00013245252,0.049808975,0.08012434,0.06115774,0.76784104],"study_design_scores_gemma":[0.00018964344,0.00003198599,0.03815072,0.0000036926428,0.00001662449,5.775548e-7,0.0003593793,0.008373859,0.004027043,0.003863194,0.94485354,0.00012972523],"about_ca_topic_score_codex":0.000106516985,"about_ca_topic_score_gemma":0.00035710094,"teacher_disagreement_score":0.88369584,"about_ca_system_score_codex":0.000053652653,"about_ca_system_score_gemma":0.0001941879,"threshold_uncertainty_score":0.9996667},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04134902406865253,"score_gpt":0.2602165361400509,"score_spread":0.21886751207139837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016840637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5413751,0.00039157755,0.45747325,0.000090067486,0.00008042746,0.00050669216,8.30424e-7,0.00006048912,0.000021551732],"genre_scores_gemma":[0.9931542,0.00016269504,0.0062653925,0.000053599528,0.00008265108,0.00021541181,0.000010953637,0.000008902746,0.000046183064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988252,0.000050406314,0.00033774407,0.00027338808,0.0002504675,0.00026278404],"domain_scores_gemma":[0.9991738,0.00014807582,0.00008370965,0.00022257652,0.0003339267,0.000037898713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000844694,0.00012015929,0.00017257882,0.00009246811,0.00009556391,0.00006958151,0.00023246736,0.00006344765,0.000023202934],"category_scores_gemma":[0.000053323412,0.00011757623,0.00003148567,0.0004760153,0.000013220881,0.0010558782,0.00001248885,0.000083668536,0.0000036040844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032540353,0.000037245678,0.00006184691,0.000021905056,0.0000049151863,3.380035e-8,0.00022808733,0.6418568,0.0000016999567,0.000033770117,0.000027917758,0.35769323],"study_design_scores_gemma":[0.00085232634,0.0000933629,0.00028936838,0.00008837206,0.000026380625,0.0000014296002,0.000005429943,0.99835765,0.000009496345,0.00007406808,0.00007329938,0.00012880247],"about_ca_topic_score_codex":0.0000037789232,"about_ca_topic_score_gemma":0.00002627502,"teacher_disagreement_score":0.4517791,"about_ca_system_score_codex":0.000055966986,"about_ca_system_score_gemma":0.00022657085,"threshold_uncertainty_score":0.47946194},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cache; Computer science; Parallel computing","score_opus":0.017273337474898766,"score_gpt":0.2551807127017554,"score_spread":0.23790737522685665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026206839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661938,0.0001012775,0.032453697,0.00016516108,0.00013209782,0.00014314595,0.0000011575617,0.00004716738,0.000762478],"genre_scores_gemma":[0.99835795,0.000008928716,0.0014064338,0.00009313965,0.000027335518,0.000021054431,0.000016369453,0.0000033185358,0.00006546109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988858,0.000081634564,0.00018014405,0.0001995602,0.0005196671,0.00013317584],"domain_scores_gemma":[0.9993095,0.000047999038,0.00009862259,0.00036841442,0.00014480679,0.000030686693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010278306,0.000081538936,0.00015876384,0.00029048056,0.00006924222,0.000029705425,0.00027317475,0.000034515902,0.000032697495],"category_scores_gemma":[0.000040726285,0.000073164425,0.00010117564,0.0008456957,0.000023377745,0.00041413825,0.000053250627,0.00006350199,0.00010132909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044554923,0.00027718474,0.011144875,0.000083085804,0.00092491147,0.0000033690644,0.0045438698,0.61144286,0.17024879,0.0012908066,0.00038498157,0.19961073],"study_design_scores_gemma":[0.00055191084,0.00008343224,0.03926744,0.000026397778,0.00023263904,0.0000010627051,0.000006646438,0.951845,0.007707334,0.00016383678,0.000022281127,0.000092049864],"about_ca_topic_score_codex":0.00001959796,"about_ca_topic_score_gemma":0.0000075751577,"teacher_disagreement_score":0.34040213,"about_ca_system_score_codex":0.000097775075,"about_ca_system_score_gemma":0.00009918885,"threshold_uncertainty_score":0.29835588},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.041358707089383905,"score_gpt":0.30760071198720224,"score_spread":0.26624200489781835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028516246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48125628,0.00054856046,0.51581824,0.000023312115,0.00012235004,0.0010492508,0.0000021376718,0.00019862656,0.0009812627],"genre_scores_gemma":[0.98916495,0.00011744197,0.009885458,0.000045930345,0.00034473493,0.00017862984,0.0001986514,0.000035235345,0.000028970015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988835,0.000007334213,0.00022985986,0.000306486,0.00030849976,0.00026434913],"domain_scores_gemma":[0.9993184,0.000049404458,0.00004606209,0.00036665835,0.00014863622,0.0000707997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011469661,0.00012295089,0.00009179534,0.000087012144,0.00017951563,0.000036693164,0.00020633922,0.00005119832,0.00001708604],"category_scores_gemma":[0.000078509416,0.0001324738,0.000006250855,0.0004461387,0.0000063852417,0.0005122075,0.00008692032,0.00011551302,0.00004772568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001027055,0.0000055954,0.00042574242,0.000041155006,0.000004408358,7.7478404e-8,0.00007633048,0.8743315,0.00042185205,0.00014607239,0.00009249311,0.12444453],"study_design_scores_gemma":[0.00017301133,0.000027056029,0.0014121771,0.00009421628,0.00001634533,7.404878e-7,0.000011377887,0.9951366,0.0019611875,0.00013421148,0.0008799099,0.00015316188],"about_ca_topic_score_codex":2.4784063e-7,"about_ca_topic_score_gemma":0.000004671664,"teacher_disagreement_score":0.50790864,"about_ca_system_score_codex":0.00009334119,"about_ca_system_score_gemma":0.000015107693,"threshold_uncertainty_score":0.5402125},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02457494913926627,"score_gpt":0.2951316720886818,"score_spread":0.2705567229494155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042076922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9752825,0.000040167946,0.021751467,0.000035034536,0.00071731774,0.0015194336,0.0000030756726,0.00049453054,0.00015648943],"genre_scores_gemma":[0.93385226,0.00003221742,0.06479561,0.0000145526365,0.000082380546,0.0009620697,0.000010014499,0.000033185777,0.00021768884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968621,0.00028860715,0.00057878735,0.0006418605,0.0010393201,0.0005892909],"domain_scores_gemma":[0.99753207,0.00033408677,0.00030555687,0.0010501352,0.0006462316,0.00013190087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0047986475,0.00033399148,0.0003420276,0.0002273666,0.0006096794,0.00015943155,0.0005750611,0.00013926452,0.000052240433],"category_scores_gemma":[0.00045242108,0.00027167142,0.0000857997,0.0006035153,0.000080985665,0.001602107,0.000053639495,0.0001578016,0.00017056848],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064957945,0.00031721822,0.47658587,0.0009020224,0.000068063506,0.000004111308,0.003682568,0.009628288,0.004900648,0.000035884394,0.00015975734,0.503066],"study_design_scores_gemma":[0.0016567254,0.001346181,0.40799475,0.0003603745,0.00007582406,0.000059817325,0.000050534974,0.57003313,0.017683117,0.000035413013,0.00016567131,0.00053849205],"about_ca_topic_score_codex":0.000005232313,"about_ca_topic_score_gemma":6.240457e-7,"teacher_disagreement_score":0.56040484,"about_ca_system_score_codex":0.000404726,"about_ca_system_score_gemma":0.0006982293,"threshold_uncertainty_score":0.99997354},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.031715213183962934,"score_gpt":0.28618725485928076,"score_spread":0.25447204167531784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051948841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959292,0.00006669913,0.0026590459,0.0006796039,0.000040381416,0.00021768604,0.000010613698,0.000007563238,0.00038921493],"genre_scores_gemma":[0.9994328,0.000007851417,0.000104864324,0.00020135214,0.00007476422,0.0000108323065,0.00014022073,0.0000044698304,0.000022821734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862295,0.000082353734,0.00038407507,0.00013227682,0.0006455358,0.00013283396],"domain_scores_gemma":[0.99840945,0.0006233856,0.00038629156,0.00022890887,0.00034791027,0.0000040444143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038915486,0.000090227855,0.0001499072,0.00014519172,0.00034223282,0.00007562222,0.00021066927,0.000029043025,0.00004321996],"category_scores_gemma":[0.0003858122,0.000048422193,0.000093287344,0.0013778515,0.00028854705,0.00074250775,0.00007392802,0.000089128196,0.0000040567193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013748284,0.00006554264,0.13564509,0.000033148965,0.00026980435,1.333567e-7,0.000319974,0.7496304,0.00017325784,0.103936255,0.00009344682,0.0096954545],"study_design_scores_gemma":[0.00012432515,0.0000034911002,0.37951624,0.000015093533,0.00040353736,1.6012112e-7,0.0000811261,0.6142856,0.00003983927,0.0049031624,0.000582557,0.000044862518],"about_ca_topic_score_codex":0.0001402182,"about_ca_topic_score_gemma":0.00045830422,"teacher_disagreement_score":0.24387117,"about_ca_system_score_codex":0.00004049926,"about_ca_system_score_gemma":0.000018264394,"threshold_uncertainty_score":0.26322126},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07225961829479466,"score_gpt":0.3175862268961517,"score_spread":0.24532660860135702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052011771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9543251,0.00017197189,0.039732914,0.00014615043,0.0003774334,0.0014370728,0.000003060218,0.000071970455,0.0037343684],"genre_scores_gemma":[0.99357,0.000028053202,0.004289807,0.00019422913,0.0011380138,0.00048154595,0.00023339268,0.000031811418,0.000033112894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975687,0.00004753661,0.0005254596,0.00035855558,0.00116965,0.00033004518],"domain_scores_gemma":[0.99668956,0.000054735217,0.0005968832,0.00033035854,0.002316688,0.00001176484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006389933,0.00022063087,0.00028125293,0.00025265772,0.00035863937,0.000072187286,0.0002119733,0.00008150599,0.00012688909],"category_scores_gemma":[0.00025245885,0.00021361,0.000113142785,0.0007725895,0.000063902706,0.00355812,0.000053017695,0.00010578589,0.00005044113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114498835,0.000046431276,0.00046285498,0.0000746403,0.000042419488,2.9102065e-8,0.00018185914,0.8800267,0.00016592539,0.0042929193,0.00004163506,0.11455007],"study_design_scores_gemma":[0.0022846633,0.000049391216,0.003264955,0.00015052086,0.0005661222,3.9288287e-7,0.00007004775,0.9325348,0.0010213132,0.05964346,0.00017974977,0.00023456453],"about_ca_topic_score_codex":0.00001644213,"about_ca_topic_score_gemma":0.000016674254,"teacher_disagreement_score":0.1143155,"about_ca_system_score_codex":0.00027062325,"about_ca_system_score_gemma":0.00013769855,"threshold_uncertainty_score":0.8710763},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.033255201452761556,"score_gpt":0.30084270038322247,"score_spread":0.2675874989304609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053359564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961632,0.0002229123,0.00016314721,0.00027307012,0.00014413636,0.00035150966,0.0000025131976,0.00011701764,0.002562517],"genre_scores_gemma":[0.99902624,0.00019672004,0.00008372641,0.00017925684,0.00009460901,0.00004347368,0.000012285673,0.0000074924105,0.00035621732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984011,0.0001132936,0.00022071534,0.00036101532,0.0006362311,0.00026763705],"domain_scores_gemma":[0.99931824,0.000029177878,0.00007086087,0.0003589956,0.000137137,0.000085580024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014505609,0.00017140634,0.00014160226,0.00009012258,0.00024331972,0.00011990144,0.00028482845,0.00005954359,0.00014920087],"category_scores_gemma":[0.000021968322,0.00013501654,0.00004766893,0.00025198882,0.00002467467,0.0011285353,0.000042489144,0.00018633669,0.0002910885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014782399,0.00011733814,0.07940768,0.00004251252,0.000023596831,0.0000011999748,0.0005921871,0.022402612,0.00068856694,0.000092609196,0.00040648665,0.8960774],"study_design_scores_gemma":[0.00046795027,0.00031720696,0.16044855,0.000047692683,0.0000099796525,0.00001146097,0.0000039118395,0.83765876,0.0006722006,0.000024388832,0.00018558415,0.00015230023],"about_ca_topic_score_codex":0.000029989107,"about_ca_topic_score_gemma":0.0000029202602,"teacher_disagreement_score":0.8959251,"about_ca_system_score_codex":0.0001418569,"about_ca_system_score_gemma":0.00016641457,"threshold_uncertainty_score":0.55058146},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05015555241017577,"score_gpt":0.34233441349428506,"score_spread":0.2921788610841093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061075968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2684711,0.00013785143,0.6744888,0.003173425,0.00069202343,0.041947614,0.00006517351,0.00038575512,0.010638304],"genre_scores_gemma":[0.97160214,0.0000033083975,0.010847807,0.00020808142,0.00023804007,0.016822837,0.000029772134,0.00000557525,0.00024243243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985448,0.000044537206,0.00028411506,0.0003276707,0.00052594795,0.00027291014],"domain_scores_gemma":[0.999018,0.00004649264,0.00011707164,0.00043532645,0.0003227986,0.00006026841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014576399,0.00012410701,0.00013821939,0.00006098801,0.00020965302,0.0001536756,0.00037211258,0.000055220633,0.000034808243],"category_scores_gemma":[0.000071338385,0.00010583719,0.000046459227,0.0002037561,0.000017904955,0.00084234594,0.000032387943,0.0000703932,0.0004643414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065535256,0.00023611201,0.0008115432,0.00009088147,0.000014559133,1.7611862e-7,0.00052811805,0.042996142,0.0010769016,0.0026628587,0.013489509,0.9380277],"study_design_scores_gemma":[0.0013090188,0.00018832149,0.0037751931,0.00008439388,0.0000048481966,0.0000023780422,0.0000044872017,0.9334407,0.005482122,0.000064097585,0.05550007,0.00014435562],"about_ca_topic_score_codex":0.0000015104348,"about_ca_topic_score_gemma":0.0000022342895,"teacher_disagreement_score":0.9378833,"about_ca_system_score_codex":0.00011310863,"about_ca_system_score_gemma":0.000089598994,"threshold_uncertainty_score":0.5968324},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024510565279507998,"score_gpt":0.2702046739707384,"score_spread":0.24569410869123037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063203387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20525362,0.0006172857,0.78292316,0.0020479327,0.0011638021,0.0017872248,9.884127e-7,0.00023088812,0.0059750993],"genre_scores_gemma":[0.97097206,0.00029448135,0.026160091,0.0005103077,0.00037128766,0.0007594821,0.000016963528,0.000008808588,0.0009064953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854755,0.000042304266,0.00023571364,0.00033733554,0.0005353731,0.00030171403],"domain_scores_gemma":[0.999218,0.000039860515,0.00009453258,0.00037330584,0.00020875092,0.00006557735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010173294,0.00013296798,0.00011849786,0.00008928229,0.00017945754,0.000078476085,0.00035889857,0.000042070766,0.00009549126],"category_scores_gemma":[0.000013425943,0.00012390935,0.000056604156,0.00026830978,0.000016725831,0.0005713836,0.00004964651,0.000063755586,0.000115971336],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037245292,0.00005148569,0.00054534327,0.000013453113,0.000027491615,5.6442053e-7,0.000097500044,0.006954601,0.000034614444,0.0047969725,0.0016926196,0.9857481],"study_design_scores_gemma":[0.0018187672,0.00012959201,0.02269019,0.000031631458,0.000037572307,0.0000063353873,0.000014295095,0.9566024,0.00009062417,0.0004392228,0.017983086,0.00015630826],"about_ca_topic_score_codex":7.5557705e-7,"about_ca_topic_score_gemma":0.0000023936361,"teacher_disagreement_score":0.9855918,"about_ca_system_score_codex":0.00011524325,"about_ca_system_score_gemma":0.00005804495,"threshold_uncertainty_score":0.5052877},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016051130720777105,"score_gpt":0.26854866297528784,"score_spread":0.2524975322545107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068671295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7728805,0.00011666857,0.22514205,0.000018345701,0.00041089527,0.0012249954,0.000017032213,0.00012118927,0.000068309484],"genre_scores_gemma":[0.98885286,0.00008527727,0.010013044,0.000007393317,0.000095353724,0.0007588841,0.00010151953,0.000051108454,0.000034563865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902165,0.000025165657,0.00025044815,0.00023431117,0.0002514664,0.00021694612],"domain_scores_gemma":[0.99915016,0.0001941588,0.000098503195,0.00020762508,0.00029597673,0.000053551863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004090935,0.00017243384,0.00017462003,0.00009432387,0.00023874793,0.00017820405,0.00007688922,0.00010017791,0.0000070634624],"category_scores_gemma":[0.000111312154,0.0001608705,0.000014838752,0.00015997622,0.000053727028,0.0009568635,0.000017754579,0.00018892145,0.0000017306565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002384988,0.00000861765,0.0075356807,0.00016107982,0.000015473963,1.5183483e-7,0.00030354777,0.9702506,0.0056920163,0.000060471608,0.000044702687,0.015903814],"study_design_scores_gemma":[0.0010712737,0.00004507199,0.013602881,0.00014496289,0.00004399974,0.000017252072,0.00004414187,0.9832992,0.001344142,0.00010521115,0.000060599,0.00022129455],"about_ca_topic_score_codex":0.0000065260833,"about_ca_topic_score_gemma":0.00023363627,"teacher_disagreement_score":0.21597233,"about_ca_system_score_codex":0.000078445904,"about_ca_system_score_gemma":0.00005677097,"threshold_uncertainty_score":0.65601087},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029395488591723255,"score_gpt":0.24856567937448293,"score_spread":0.21917019078275968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070837763","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7351164,0.00028135252,0.26119673,0.00012554864,0.00126785,0.0006656253,0.0000048278894,0.000728857,0.0006127634],"genre_scores_gemma":[0.9736267,0.00009362421,0.02551826,0.000111991125,0.00028856183,0.00025946074,0.00004698363,0.000024654064,0.0000297975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963295,0.00010908682,0.0006674038,0.0008012025,0.0015346755,0.0005581293],"domain_scores_gemma":[0.9975448,0.00005023698,0.00027771175,0.0013661515,0.0006079598,0.00015314404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018599699,0.00034254589,0.0003515005,0.00019133351,0.000550716,0.00019286056,0.0008939021,0.00020044523,0.000026847305],"category_scores_gemma":[0.00006353797,0.000295855,0.000114943476,0.0006752092,0.00006777538,0.0039655864,0.00022136662,0.00028317317,0.0006231845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044597386,0.00012526277,0.023431059,0.0003207572,0.00004829917,0.0000031997774,0.0029670864,0.72373754,0.00015926022,0.0006390589,0.000096757,0.24842714],"study_design_scores_gemma":[0.0014784595,0.00015693264,0.05469577,0.0004309821,0.00002892309,0.000028963172,0.00006816445,0.93865836,0.0031894206,0.00076900056,0.00007736103,0.00041765795],"about_ca_topic_score_codex":0.00021322968,"about_ca_topic_score_gemma":0.000011243107,"teacher_disagreement_score":0.24800949,"about_ca_system_score_codex":0.0009889852,"about_ca_system_score_gemma":0.0006008635,"threshold_uncertainty_score":0.99994934},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028714622472199716,"score_gpt":0.2628722531438041,"score_spread":0.23415763067160436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071777054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97200096,0.000112216796,0.015378669,0.00012259181,0.0001259381,0.0002889644,0.0000029147047,0.00008403874,0.011883739],"genre_scores_gemma":[0.99898815,0.000007947387,0.00022963305,0.00029138656,0.00017168894,0.000040706862,0.0000718926,0.000016339507,0.00018226863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859434,0.000043043943,0.0003966899,0.0002589647,0.00049540447,0.00021152874],"domain_scores_gemma":[0.9986694,0.00004708135,0.0004603133,0.00037489986,0.0004379129,0.00001038259],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017888764,0.00015730147,0.00034462617,0.0007089578,0.00012706647,0.000035274647,0.0002152504,0.00005800192,0.0037721272],"category_scores_gemma":[0.00012139821,0.00014222406,0.00018064896,0.0016154781,0.00007261202,0.0014120898,0.000047726026,0.000082139704,0.0005058139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007845702,0.00029516878,0.24688853,0.00013968431,0.003955923,0.000001122036,0.0006087188,0.65522987,0.0026335425,0.009828167,0.00020928399,0.07942541],"study_design_scores_gemma":[0.00049616746,0.00001075917,0.10735996,0.00003695957,0.004553348,7.226701e-8,0.000084577165,0.8842512,0.00021854148,0.0027083224,0.000098880206,0.00018120585],"about_ca_topic_score_codex":0.00008542782,"about_ca_topic_score_gemma":0.00004549956,"teacher_disagreement_score":0.22902134,"about_ca_system_score_codex":0.000058158323,"about_ca_system_score_gemma":0.000020314974,"threshold_uncertainty_score":0.99713856},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020226104069938033,"score_gpt":0.27018023805017827,"score_spread":0.24995413398024025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073969215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9769358,0.0003139613,0.02004265,0.00071727304,0.00045178263,0.0009212061,0.0000014052775,0.00045141001,0.0001644827],"genre_scores_gemma":[0.983824,0.00018220235,0.014881503,0.00060546014,0.00009322318,0.0003669945,0.0000138888545,0.000010001792,0.000022683756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974338,0.00008277075,0.00050715683,0.0005526981,0.0009888214,0.00043475637],"domain_scores_gemma":[0.9984792,0.000077165554,0.00021635315,0.0007783645,0.00032573577,0.00012319695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002015966,0.00026864698,0.00026108138,0.00019416976,0.00040944532,0.00017378313,0.0004944718,0.00011205417,0.00005573979],"category_scores_gemma":[0.00013577593,0.00022611342,0.00006330796,0.0004893545,0.000055448407,0.0015993989,0.00007688384,0.00016881325,0.00010242537],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006962692,0.00008162656,0.10460465,0.00013081098,0.0000063317925,2.7710786e-7,0.00025466955,0.001706376,0.00008032635,0.000012104276,0.00010869761,0.89300716],"study_design_scores_gemma":[0.0006117537,0.0004700853,0.43982962,0.00011898908,0.000015214903,0.000003818821,0.0000056378885,0.5541899,0.0043242867,0.00012039175,0.00010702366,0.00020325152],"about_ca_topic_score_codex":0.000008679067,"about_ca_topic_score_gemma":0.0000012179677,"teacher_disagreement_score":0.8928039,"about_ca_system_score_codex":0.00023532986,"about_ca_system_score_gemma":0.00024070371,"threshold_uncertainty_score":0.92206377},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04137402653265357,"score_gpt":0.3151699585172764,"score_spread":0.2737959319846228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075246343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79450196,0.0005490729,0.2022184,0.00017976017,0.00080031,0.0010456314,0.0000063920334,0.00047027486,0.00022816959],"genre_scores_gemma":[0.9910843,0.000058662798,0.007942531,0.000060721,0.00022669618,0.00038257337,0.00009810891,0.00002041681,0.00012603261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614054,0.00028454693,0.0005374305,0.00066948374,0.0018255886,0.000542428],"domain_scores_gemma":[0.99734586,0.00011004554,0.00032331064,0.0010346306,0.0010607793,0.00012537387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031516452,0.00031195217,0.00033842959,0.00015041526,0.00054006255,0.00031501643,0.0007106636,0.0001450992,0.00003305911],"category_scores_gemma":[0.00023670978,0.00022468505,0.00006915705,0.0009706924,0.00006085864,0.0016022245,0.00011495265,0.00026084363,0.00013254571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016469494,0.00013452144,0.15098754,0.00022526544,0.000070556394,0.0000069382336,0.0013633156,0.54033303,0.00020628965,0.00006866804,0.00056054,0.30587864],"study_design_scores_gemma":[0.0011709579,0.0003626412,0.21824645,0.00022320135,0.00002829584,0.00014390858,0.00007688776,0.7787158,0.000274902,0.000034740657,0.00040274314,0.0003194937],"about_ca_topic_score_codex":0.0000976625,"about_ca_topic_score_gemma":0.000015131268,"teacher_disagreement_score":0.30555913,"about_ca_system_score_codex":0.00033351817,"about_ca_system_score_gemma":0.00036732169,"threshold_uncertainty_score":0.9162391},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016000394423849523,"score_gpt":0.27511884234419176,"score_spread":0.2591184479203422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083945769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87343943,0.00045536645,0.12407232,0.000015882277,0.00041497478,0.0009527125,0.0000014817393,0.000037697555,0.00061014364],"genre_scores_gemma":[0.999324,0.000036467587,0.00037020748,0.0000034904954,0.000014256097,0.00023542516,0.0000072887865,0.0000046124715,0.00000425521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99756587,0.0010535695,0.00037951648,0.00027293846,0.00050871464,0.00021938099],"domain_scores_gemma":[0.9988088,0.0002374736,0.0001520929,0.00059398456,0.00018363101,0.000024046505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008414771,0.00012413874,0.00019784308,0.00014626968,0.000116663745,0.000047339086,0.00042069584,0.000047953843,0.0000037080988],"category_scores_gemma":[0.00017906883,0.00008036323,0.000049141614,0.0008751206,0.000041916555,0.00022442144,0.000057738314,0.00011564212,0.000009185326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043593413,0.0000740993,0.24380292,0.0006423469,0.00003938027,5.500539e-7,0.0004793288,0.72547156,0.0002297395,0.001651796,0.000010545528,0.027554132],"study_design_scores_gemma":[0.00056804175,0.0000469646,0.5594013,0.00021589118,0.0000108039085,0.0000036708625,0.00005057676,0.43699443,0.002228816,0.0003375771,0.00004716731,0.00009478465],"about_ca_topic_score_codex":0.000039744988,"about_ca_topic_score_gemma":0.0000046327227,"teacher_disagreement_score":0.31559837,"about_ca_system_score_codex":0.00016024985,"about_ca_system_score_gemma":0.00007047677,"threshold_uncertainty_score":0.32771173},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011974679961920252,"score_gpt":0.25016855896564427,"score_spread":0.23819387900372402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086767841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899534,0.00005676236,0.00047411842,0.00019640324,0.000027458036,0.00023769923,0.0000012517452,0.00009569178,0.008957204],"genre_scores_gemma":[0.9988557,0.000023193337,0.00027912707,0.00024309309,0.00020212658,0.000021546659,0.00013414824,0.000015237485,0.00022581386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982086,0.00003140051,0.00041130823,0.00031904937,0.0007629847,0.0002667011],"domain_scores_gemma":[0.9985628,0.00003620272,0.0005541663,0.00038087586,0.00045225665,0.00001369679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015924469,0.00021418583,0.0004088861,0.0008536087,0.00023800117,0.00008427299,0.00024177686,0.000053633506,0.0006494032],"category_scores_gemma":[0.00009582912,0.0001708003,0.00012649872,0.0026188865,0.00008042558,0.0020842645,0.000034310313,0.00010057642,0.00008265253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003658897,0.00011010234,0.26846376,0.00007807837,0.00062932854,6.442418e-7,0.00029463685,0.6388977,0.0016850611,0.00042567652,0.00006694618,0.08898214],"study_design_scores_gemma":[0.00032602297,0.000056381214,0.22451675,0.000058467092,0.0023719727,3.3510213e-7,0.00006837527,0.77157605,0.00043290274,0.00020260367,0.00018777573,0.00020237891],"about_ca_topic_score_codex":0.000020669997,"about_ca_topic_score_gemma":0.000032506432,"teacher_disagreement_score":0.13267832,"about_ca_system_score_codex":0.000067308145,"about_ca_system_score_gemma":0.000029743569,"threshold_uncertainty_score":0.7110509},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02923529351829863,"score_gpt":0.25030170107122196,"score_spread":0.22106640755292334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086785629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6842934,0.000068875175,0.31301072,0.000059914575,0.00011532753,0.0004072459,0.0000015301388,0.000076055745,0.001966945],"genre_scores_gemma":[0.98665035,0.0000129461605,0.0130788665,0.000048016787,0.00005976583,0.00009037949,0.000008022569,0.000008046687,0.000043598673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857265,0.00013787515,0.00028103817,0.00027148778,0.00051876943,0.00021819159],"domain_scores_gemma":[0.99878496,0.00007236785,0.0002369176,0.00030395473,0.00054489105,0.000056918467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090906204,0.0001431709,0.0002022081,0.000102910984,0.00010345023,0.000026624586,0.0002823354,0.00005546902,0.00016449006],"category_scores_gemma":[0.000035507703,0.00011827662,0.000033483782,0.00027860462,0.000056829722,0.0008201829,0.00002803492,0.000104142644,0.00006584225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000344731,0.00015755693,0.00827161,0.000018695806,0.00009210939,0.0000016426296,0.0027461036,0.19996525,0.000736459,0.00091791165,0.000044584835,0.78670335],"study_design_scores_gemma":[0.0017807146,0.00055330404,0.024864877,0.00006796502,0.00007230819,0.0000054347884,0.000014262297,0.9704735,0.0019835248,0.000025499556,0.000014594028,0.00014401728],"about_ca_topic_score_codex":0.000008796651,"about_ca_topic_score_gemma":0.0000030865824,"teacher_disagreement_score":0.78655934,"about_ca_system_score_codex":0.000045345278,"about_ca_system_score_gemma":0.00017166676,"threshold_uncertainty_score":0.48231807},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06260934305467594,"score_gpt":0.29387319890684893,"score_spread":0.231263855852173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090470428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911348,0.000079149235,0.006108761,0.0005484979,0.00011851247,0.00038986644,0.0000012071769,0.0000848411,0.0015343247],"genre_scores_gemma":[0.99742484,0.00001952462,0.0009953416,0.0008627729,0.0004874892,0.00009370948,0.000034065182,0.000011399849,0.00007088057],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991319,0.000015545615,0.0002067925,0.00020717643,0.00028701415,0.00015157899],"domain_scores_gemma":[0.9988769,0.00019785672,0.00014967969,0.0001562284,0.0006109999,0.0000083056975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011878363,0.00010024681,0.00012485354,0.00010401225,0.0005872099,0.000059332455,0.000042976335,0.000036637604,0.00013077962],"category_scores_gemma":[0.0017511809,0.00009961672,0.00003317128,0.00022601201,0.00006063106,0.0013533686,0.000030216137,0.00005933215,0.00004418752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030190364,0.0003296272,0.5509704,0.00094115105,0.00027946246,0.0000027893357,0.0014378525,0.28504804,0.007090559,0.022135485,0.010732595,0.12073014],"study_design_scores_gemma":[0.00068791787,0.000008666838,0.06973315,0.000021793801,0.0001263066,0.0000029309238,0.000036016256,0.91964906,0.00022280846,0.006361301,0.003001673,0.00014835819],"about_ca_topic_score_codex":0.000042202882,"about_ca_topic_score_gemma":0.00007383199,"teacher_disagreement_score":0.63460106,"about_ca_system_score_codex":0.000077036944,"about_ca_system_score_gemma":0.00005045168,"threshold_uncertainty_score":0.45164028},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.020622779703999228,"score_gpt":0.2823533980073662,"score_spread":0.26173061830336697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091797596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9776363,0.000026736865,0.007845179,0.00019762591,0.00007328626,0.0008242927,0.0000027272758,0.00015954969,0.013234308],"genre_scores_gemma":[0.996348,0.00000389731,0.0013269443,0.00024652676,0.0013641777,0.00027064135,0.00010185065,0.00002501411,0.00031293073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989878,0.000012171279,0.00018924408,0.00022669096,0.00035612937,0.00022797461],"domain_scores_gemma":[0.99930596,0.00002495563,0.00014710835,0.00021988888,0.00029330477,0.000008795316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007470648,0.0001424267,0.00014736348,0.00019761363,0.00031123305,0.00012130164,0.0001416568,0.0000381173,0.0004024699],"category_scores_gemma":[0.00006131955,0.0001147742,0.000042997748,0.00046147895,0.000039211922,0.0012963894,0.000014252421,0.00005760411,0.00017978474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032842899,0.00001198278,0.00074797554,0.00015353749,0.000032037497,2.2128381e-7,0.00004477804,0.7729307,0.000039083392,0.011007616,0.00015854565,0.21454512],"study_design_scores_gemma":[0.0008758457,0.000023178334,0.003702597,0.000055557848,0.00017868544,0.0000025230463,0.00011214325,0.9847334,0.00018230728,0.00062387745,0.009318619,0.00019123543],"about_ca_topic_score_codex":0.0000380511,"about_ca_topic_score_gemma":0.000014736383,"teacher_disagreement_score":0.21435387,"about_ca_system_score_codex":0.00013157443,"about_ca_system_score_gemma":0.000044539942,"threshold_uncertainty_score":0.46803558},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04137847820431585,"score_gpt":0.26586802194856823,"score_spread":0.2244895437442524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095275942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58030516,0.0002901047,0.41827562,0.00003992477,0.00018887708,0.00046871687,0.0000014200567,0.0003659586,0.00006419473],"genre_scores_gemma":[0.9683185,0.0007140249,0.030589826,0.000045678615,0.00004904831,0.00017261277,0.000037588754,0.000017754544,0.000054919114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970821,0.00020363185,0.00068388885,0.00051176874,0.0011017356,0.00041686182],"domain_scores_gemma":[0.99846435,0.000044160282,0.00026621667,0.00078908715,0.00034641748,0.000089788424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025535626,0.00025570905,0.00029169171,0.00015856218,0.00026325727,0.000054317272,0.0006242871,0.00014211648,0.00007577896],"category_scores_gemma":[0.00006965442,0.00022436885,0.00006533124,0.0005758035,0.000054042834,0.0013996473,0.00011843688,0.00014968727,0.00014702437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039101902,0.00010575516,0.018762447,0.000069331756,0.000022395612,3.5476975e-7,0.00046534723,0.868861,0.0017565764,0.0000023966218,0.0004275591,0.10948769],"study_design_scores_gemma":[0.0007047506,0.0002472724,0.007832681,0.00007621367,0.000019970319,0.000015781385,0.000011255302,0.9814666,0.009213785,0.000022456346,0.00012411184,0.00026515822],"about_ca_topic_score_codex":0.000024053725,"about_ca_topic_score_gemma":3.9571003e-7,"teacher_disagreement_score":0.38801336,"about_ca_system_score_codex":0.00026106514,"about_ca_system_score_gemma":0.0002125911,"threshold_uncertainty_score":0.9149496},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.023694321006341296,"score_gpt":0.2644651976376429,"score_spread":0.24077087663130162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101300912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55126727,0.0000734403,0.44790122,0.00007020437,0.0000962083,0.00024779508,0.000010624497,0.00002859474,0.00030467563],"genre_scores_gemma":[0.9794292,0.000086623346,0.02003749,0.000043600212,0.00009998427,0.00014565846,0.000107826694,0.00000885778,0.000040780524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978411,0.00005945844,0.0005667151,0.0003985177,0.0008082343,0.000325967],"domain_scores_gemma":[0.9985622,0.000043757864,0.00032815052,0.00052804913,0.00047640095,0.00006141867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012844151,0.00018153392,0.00035023617,0.00044761834,0.000120349905,0.00006615192,0.00046886696,0.000054318498,0.000019572084],"category_scores_gemma":[0.000011870293,0.00016154343,0.00006905015,0.002560891,0.00004682614,0.001396901,0.00005047715,0.00015804968,0.00000886024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102446775,0.00011135317,0.010220831,0.000008983923,0.000063540305,2.6498458e-7,0.00030060223,0.629659,0.000049269893,0.00008912891,0.000023943665,0.35946283],"study_design_scores_gemma":[0.0008254567,0.00008134266,0.19588317,0.000076943914,0.000106955486,0.0000049807677,0.000022331957,0.80241066,0.0002555217,7.5064946e-7,0.00016586563,0.00016600864],"about_ca_topic_score_codex":0.00005780704,"about_ca_topic_score_gemma":0.00017243,"teacher_disagreement_score":0.42816192,"about_ca_system_score_codex":0.00017312485,"about_ca_system_score_gemma":0.00016349145,"threshold_uncertainty_score":0.658755},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01655201620770077,"score_gpt":0.2544099327511873,"score_spread":0.2378579165434865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102966671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9756998,0.0000426608,0.007859684,0.00091593526,0.000093297145,0.00048640848,0.0000033844356,0.00021544713,0.014683424],"genre_scores_gemma":[0.9964947,0.0000022618715,0.00032926307,0.00032085468,0.0008264872,0.00014063508,0.00051455793,0.00005174486,0.0013194978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803996,0.000042503754,0.00036585904,0.00042140906,0.00077971915,0.00035052866],"domain_scores_gemma":[0.998614,0.00007121467,0.0003653385,0.0003980352,0.0005358533,0.000015563552],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009011482,0.00027537355,0.00022954182,0.00029595543,0.00045137573,0.00027009659,0.0002481217,0.00007040303,0.00093202625],"category_scores_gemma":[0.00012789092,0.00022559594,0.000073369396,0.0008969203,0.0001044517,0.0033474327,0.000057875815,0.0001475059,0.00047226637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030401413,0.00018912251,0.040713992,0.0001999836,0.00009685238,0.0000012573905,0.0001248842,0.94726187,0.0011331312,0.0044187666,0.00036905523,0.005187099],"study_design_scores_gemma":[0.00096138194,0.00004260767,0.058765996,0.00016363096,0.0005631119,0.000001458576,0.000187588,0.9176589,0.00079071044,0.019338043,0.0009350174,0.00059150317],"about_ca_topic_score_codex":0.00007970042,"about_ca_topic_score_gemma":0.00018802885,"teacher_disagreement_score":0.029602889,"about_ca_system_score_codex":0.00013327386,"about_ca_system_score_gemma":0.000049471942,"threshold_uncertainty_score":0.9999813},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018371359544014195,"score_gpt":0.2451642803064485,"score_spread":0.2267929207624343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105538778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921359,0.000053609972,0.0021037038,0.00009494349,0.0001460638,0.0002677075,0.0000020075775,0.000080471815,0.005115591],"genre_scores_gemma":[0.9991066,0.000006623083,0.00013692556,0.00007679397,0.00028109868,0.00003317663,0.0000466009,0.000015306552,0.0002968921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844337,0.000055958826,0.00038398308,0.00023097385,0.0007021828,0.00018352612],"domain_scores_gemma":[0.9986151,0.000041562518,0.00051209296,0.00045425675,0.00037024435,0.0000067712294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015017418,0.00014092267,0.00028838322,0.00045683613,0.00041207555,0.000032343843,0.00028762192,0.000043656953,0.00025722486],"category_scores_gemma":[0.00014473479,0.00010392048,0.00021639568,0.0025299534,0.000084361105,0.001101488,0.00010142211,0.00009283693,0.0001836528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006808962,0.00004895114,0.09424519,0.00021239689,0.001081451,0.0000012348926,0.00043246738,0.88254756,0.0030211643,0.00226093,0.00018930092,0.015891269],"study_design_scores_gemma":[0.00018956103,0.0000033969968,0.07688162,0.00005332433,0.001975416,9.714707e-7,0.000078080346,0.9200555,0.00036294933,0.000086881344,0.00018992287,0.000122366],"about_ca_topic_score_codex":0.00008497519,"about_ca_topic_score_gemma":0.000016657152,"teacher_disagreement_score":0.037507955,"about_ca_system_score_codex":0.00012445342,"about_ca_system_score_gemma":0.000030649062,"threshold_uncertainty_score":0.4237754},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0461798311964317,"score_gpt":0.2736159252846863,"score_spread":0.2274360940882546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106086560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9766361,0.00019383561,0.021430658,0.00009302553,0.0002086125,0.00032578493,5.430088e-7,0.000077073004,0.0010343706],"genre_scores_gemma":[0.99808306,0.00003753065,0.0015522209,0.000048428574,0.000037325535,0.00008336451,0.000012145249,0.0000057979537,0.00014011365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878645,0.00011983353,0.00021948482,0.00023732241,0.00045736655,0.00017956985],"domain_scores_gemma":[0.9995155,0.000016673834,0.000056765854,0.0003030694,0.00007294194,0.000035054734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078356103,0.00009310356,0.000108730856,0.00011548269,0.00014022406,0.00012052224,0.00020928422,0.000029233355,0.000032772332],"category_scores_gemma":[0.000006777972,0.00007904742,0.000023228773,0.00024853606,0.0000096545255,0.00058900885,0.000013988719,0.00009668016,0.000057925645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021076063,0.000024641553,0.003766917,0.000004288538,0.0000033352867,0.0000013433753,0.00034423053,0.9425266,0.000024441204,0.00005919108,0.000009003826,0.053214964],"study_design_scores_gemma":[0.00072550646,0.00006988948,0.015316202,0.00006244598,0.000008511268,0.000027415314,0.0000107445985,0.9835738,0.000025954043,0.000014262979,0.00005401751,0.00011124951],"about_ca_topic_score_codex":0.0001925815,"about_ca_topic_score_gemma":0.00003331393,"teacher_disagreement_score":0.053103715,"about_ca_system_score_codex":0.00013801325,"about_ca_system_score_gemma":0.000049763632,"threshold_uncertainty_score":0.32234603},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04085063400201436,"score_gpt":0.27225049110612776,"score_spread":0.2313998571041134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112601556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97856086,0.00021434505,0.018729445,0.00020263303,0.00012076328,0.00038953294,7.189983e-7,0.00006499295,0.001716699],"genre_scores_gemma":[0.99676913,0.000038467268,0.0030681286,0.000021925473,0.000021502188,0.00005865626,8.3054044e-7,0.0000046280265,0.000016712029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987255,0.00014593189,0.00021059632,0.0001854116,0.0005652648,0.00016731759],"domain_scores_gemma":[0.99876803,0.00035834417,0.00014096609,0.00047158432,0.00024552792,0.000015538979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026280102,0.00008575686,0.00013820222,0.00011851724,0.00009944999,0.00001992306,0.00054838526,0.00004080549,0.000012909796],"category_scores_gemma":[0.00024116716,0.00006284242,0.000030193189,0.0005890454,0.000047357236,0.0002950196,0.000128844,0.00008627589,0.000020717933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020959276,0.0000681365,0.023468344,0.00012097462,0.000019841804,2.2589802e-7,0.00083531305,0.0907389,0.0041799825,0.0010108957,0.00011126788,0.87942517],"study_design_scores_gemma":[0.00029095192,0.00018409354,0.12832738,0.00023838672,0.000010788218,0.0000013159681,0.000019889134,0.8160195,0.054583892,0.00023065752,0.00002509505,0.000068094305],"about_ca_topic_score_codex":0.0000063525395,"about_ca_topic_score_gemma":0.000001670916,"teacher_disagreement_score":0.87935704,"about_ca_system_score_codex":0.000058599897,"about_ca_system_score_gemma":0.000016878304,"threshold_uncertainty_score":0.25626394},"labels":[],"label_agreement":null},{"id":"W2123356441","doi":"10.1016/j.peva.2007.03.001","title":"Decomposition properties in fluid queues","year":2007,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Queue; Decomposition; Computer science; Statistical physics; Parallel computing; Physics; Computer network; Chemistry","score_opus":0.03347330409838538,"score_gpt":0.29632482014462924,"score_spread":0.26285151604624385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123356441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914207,0.00009503929,0.0014354555,0.00013690429,0.00014489936,0.00022566124,7.186656e-8,0.000077219534,0.006464051],"genre_scores_gemma":[0.9989821,0.00000953561,0.00016421366,0.00030277803,0.00042401423,0.000028837088,0.000027950415,0.000011835443,0.000048777456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990411,0.000010104919,0.0002551696,0.00016494261,0.0003354824,0.00019322257],"domain_scores_gemma":[0.99951875,0.000016805903,0.0001180737,0.00013692994,0.00020464,0.0000047918966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027953528,0.00009574728,0.000099555116,0.00036720504,0.00013361216,0.00005939006,0.00009389613,0.00003612101,0.00015199945],"category_scores_gemma":[0.00013157955,0.00008764493,0.000028372147,0.00049277535,0.000029531839,0.0019431685,0.00003270331,0.000068079666,0.00026147993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006777031,0.00030733156,0.14873238,0.00029791417,0.00003972532,0.000004136421,0.0006808893,0.22829159,0.08555364,0.0064648,0.00019631025,0.5287536],"study_design_scores_gemma":[0.0005119665,0.000010927839,0.10356751,0.000110008354,0.000056913672,8.803275e-7,0.00018722902,0.8804619,0.010907627,0.0031592702,0.0008164948,0.00020928259],"about_ca_topic_score_codex":0.00005059098,"about_ca_topic_score_gemma":0.0001835263,"teacher_disagreement_score":0.6521703,"about_ca_system_score_codex":0.00011947586,"about_ca_system_score_gemma":0.000012348585,"threshold_uncertainty_score":0.35740563},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0854509516755767,"score_gpt":0.29144745724691096,"score_spread":0.20599650557133425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129419521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96428376,0.000025857313,0.034107503,0.0000059958393,0.000022424296,0.00014410578,0.0000018889077,0.000020004667,0.0013884427],"genre_scores_gemma":[0.9951748,0.000009637619,0.0046412414,0.0000052840523,0.00006929235,0.000026900503,0.00005143147,0.000006661466,0.000014716233],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938565,0.000040569612,0.00020139501,0.00012338764,0.0001538011,0.000095169344],"domain_scores_gemma":[0.9995582,0.0000059408753,0.00013242979,0.00013594344,0.00014656936,0.000020900447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051447126,0.00007271897,0.000120032055,0.00005793562,0.000067427674,0.000010559457,0.000055312226,0.000018247481,0.0002594566],"category_scores_gemma":[0.0000017277079,0.00007167697,0.000028396451,0.00012086376,0.00001718214,0.000232847,0.000027317548,0.000057945235,0.000002785162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004379745,0.00013116357,0.7726587,0.000030439785,0.000107871485,5.955281e-8,0.0019093249,0.0054688975,0.022583101,0.0033781421,0.00003672221,0.19365181],"study_design_scores_gemma":[0.00012503921,0.00002409381,0.07280262,0.000022952669,0.00006472901,1.1131841e-7,0.000021979651,0.88615465,0.039554838,0.0011123185,0.000036200636,0.000080465456],"about_ca_topic_score_codex":0.0001807224,"about_ca_topic_score_gemma":0.0000028743545,"teacher_disagreement_score":0.88068575,"about_ca_system_score_codex":0.000012278917,"about_ca_system_score_gemma":0.000018227413,"threshold_uncertainty_score":0.2922902},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018084209964057362,"score_gpt":0.2860252269698289,"score_spread":0.26794101700577155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139509158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9466123,0.000012993969,0.05185688,0.00014535346,0.00012628922,0.0002553069,4.0483664e-7,0.000057545258,0.00093295565],"genre_scores_gemma":[0.7679006,0.00000754467,0.23199134,0.000014394409,0.000022243854,0.000037480622,0.0000040981095,0.0000036588888,0.000018665061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902654,0.000063275314,0.00018995162,0.00016845495,0.00043474764,0.000117012794],"domain_scores_gemma":[0.9992433,0.000025336121,0.0001739335,0.0003424428,0.00018344336,0.00003153245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018502965,0.000075368174,0.00009574337,0.00008441463,0.00007639766,0.000033682863,0.000149518,0.0000348148,0.000046868005],"category_scores_gemma":[0.00009453501,0.00006272477,0.000009511238,0.00022985604,0.00004290699,0.00067946175,0.000037963968,0.00008847104,0.000027541519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002358912,0.00009900237,0.01794327,0.0001987,0.000023712582,2.349061e-7,0.0032492133,0.0031485332,0.22348224,0.013154442,0.00008427589,0.7385928],"study_design_scores_gemma":[0.00021299813,0.00011168941,0.14643155,0.000037554906,0.000012387342,0.0000072099037,0.000005494877,0.80766666,0.045273952,0.00013712668,0.000036619265,0.00006676171],"about_ca_topic_score_codex":0.000006078686,"about_ca_topic_score_gemma":0.000004803537,"teacher_disagreement_score":0.8045181,"about_ca_system_score_codex":0.000028744349,"about_ca_system_score_gemma":0.00006557164,"threshold_uncertainty_score":0.25578418},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02483083695767474,"score_gpt":0.2763144868650109,"score_spread":0.2514836499073362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147021610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61385405,0.00010878359,0.38386163,0.0003038878,0.0007441969,0.00065328553,8.405794e-7,0.0001932254,0.00028006503],"genre_scores_gemma":[0.9814643,0.000013690803,0.01767732,0.00019314053,0.0003063149,0.000069696005,0.000024469784,0.000011495514,0.00023954402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841005,0.00004338466,0.00032531918,0.00032021696,0.0005344072,0.00036662217],"domain_scores_gemma":[0.9987864,0.00019591983,0.00012251172,0.00036541128,0.00044945127,0.0000802892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025754282,0.00014234995,0.00013870912,0.00010953281,0.0002053886,0.00007781665,0.0003351424,0.00009456136,0.000025655854],"category_scores_gemma":[0.000101569014,0.00013557276,0.00006607849,0.00033192625,0.000026261372,0.00052145455,0.000027693948,0.00009277298,0.000048377686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056190474,0.00003970998,0.00032608028,0.000008323561,0.000014529005,2.1875609e-7,0.00022256532,0.09941466,0.0005470574,0.00102148,0.00055291294,0.8977963],"study_design_scores_gemma":[0.0017270113,0.00013396693,0.01894095,0.00001986311,0.000027202073,0.0000035944697,0.000009214377,0.9756124,0.0013226691,0.00008529836,0.001942338,0.00017551632],"about_ca_topic_score_codex":6.49186e-7,"about_ca_topic_score_gemma":0.000009508203,"teacher_disagreement_score":0.89762074,"about_ca_system_score_codex":0.000116319454,"about_ca_system_score_gemma":0.00011414793,"threshold_uncertainty_score":0.55284965},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05690303108756405,"score_gpt":0.2684342550725546,"score_spread":0.21153122398499052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149285947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80948347,0.0001661743,0.18216553,0.00020772824,0.00089148775,0.0052942783,0.0000011947733,0.00026992752,0.001520192],"genre_scores_gemma":[0.989536,0.00014331655,0.006472902,0.00026730963,0.00042967385,0.0030610191,0.000012758052,0.000037799397,0.000039263432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644196,0.00025296008,0.00066164095,0.0007402031,0.000964546,0.0009386807],"domain_scores_gemma":[0.9984609,0.00006188537,0.00038675236,0.00080744625,0.00017723287,0.00010577515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022724248,0.00036559283,0.00035447278,0.00013170202,0.00038254107,0.00014354335,0.0009171425,0.0001786978,0.000067640445],"category_scores_gemma":[0.000016178488,0.00034998966,0.00007535334,0.0009158028,0.000054890694,0.0020945992,0.0002604662,0.00039816456,0.00008912175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004957139,0.00052498566,0.13693656,0.0004038375,0.00008014893,0.000021542162,0.01267846,0.16844319,0.00035801865,0.0021209088,0.0011021625,0.67683446],"study_design_scores_gemma":[0.001143059,0.0002714877,0.13614886,0.0002507447,0.000015763733,0.000009656056,0.000033648037,0.85718757,0.0038135222,0.00062629866,0.00009170948,0.00040768535],"about_ca_topic_score_codex":0.00013108007,"about_ca_topic_score_gemma":0.000102789505,"teacher_disagreement_score":0.68874437,"about_ca_system_score_codex":0.00037519063,"about_ca_system_score_gemma":0.0002864247,"threshold_uncertainty_score":0.9998952},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03234956952043506,"score_gpt":0.26057992414729025,"score_spread":0.2282303546268552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155470018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99780494,0.000014700119,0.00022816705,0.0002128872,0.00015414417,0.0009555852,7.4772083e-7,0.00005497377,0.00057382946],"genre_scores_gemma":[0.9990849,0.000007829792,0.00007126057,0.00004444056,0.0001942099,0.0003459344,0.00022126528,0.0000075421485,0.00002261763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980941,0.00013094097,0.00044399002,0.00037172626,0.0007760853,0.00018317005],"domain_scores_gemma":[0.9982563,0.00001961608,0.0004991679,0.00052299496,0.00069415534,0.000007724735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004174433,0.0001550317,0.0002346946,0.0007103481,0.00021384117,0.00008373284,0.00019255499,0.00004186822,0.00010758338],"category_scores_gemma":[0.00018903421,0.00011057128,0.000048955142,0.002082693,0.00007911536,0.0040553166,0.00002257185,0.00011442224,0.000066312095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118420234,0.00014159761,0.24135166,0.00028674086,0.00014399197,1.14620626e-7,0.0008177212,0.72131413,0.0008581783,0.00018539467,0.000017773495,0.034764282],"study_design_scores_gemma":[0.00013205013,0.00002313243,0.33470896,0.000051292882,0.0006055988,6.464121e-7,0.0013727801,0.66234356,0.0006026473,0.000029190824,0.000024832392,0.00010530887],"about_ca_topic_score_codex":0.00025940407,"about_ca_topic_score_gemma":0.00035468547,"teacher_disagreement_score":0.09335731,"about_ca_system_score_codex":0.00019832415,"about_ca_system_score_gemma":0.000031742427,"threshold_uncertainty_score":0.4508966},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07553246955462467,"score_gpt":0.37438770553341244,"score_spread":0.29885523597878777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177526080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60648894,0.000050921622,0.39277056,0.000027260448,0.00013547303,0.0002996603,0.000006026303,0.00004499682,0.00017618178],"genre_scores_gemma":[0.97592354,0.0000017605117,0.023338057,0.000026211093,0.0005354484,0.000024244639,0.00012951081,0.000016663684,0.000004594181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878174,0.000082106555,0.00034561843,0.00025409728,0.00035508923,0.00018135805],"domain_scores_gemma":[0.9981327,0.00009704895,0.0004955741,0.0001984999,0.0010570119,0.000019145064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040361416,0.00013813328,0.00023800228,0.00020190125,0.00025930902,0.000082021004,0.0001297813,0.000042698015,0.0000057844727],"category_scores_gemma":[0.0004297735,0.00013278479,0.00004446316,0.00034251442,0.000045754467,0.0016434696,0.000060483853,0.0000618711,0.000004208338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026336717,0.00011078767,0.01176898,0.00065601844,0.00013846884,3.1491885e-7,0.0007297039,0.86699456,0.004741681,0.03260057,0.00003815898,0.08195738],"study_design_scores_gemma":[0.0006416341,0.000029707657,0.001335736,0.00012724218,0.00032138114,0.0000016207517,0.00093400286,0.99162245,0.001477304,0.0032252187,0.00013224506,0.00015144802],"about_ca_topic_score_codex":0.00014763484,"about_ca_topic_score_gemma":0.00002282641,"teacher_disagreement_score":0.3694346,"about_ca_system_score_codex":0.00016335025,"about_ca_system_score_gemma":0.000043351414,"threshold_uncertainty_score":0.5414806},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.043288652617440755,"score_gpt":0.28413447414785015,"score_spread":0.2408458215304094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2191399453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905103,0.000044988916,0.0068474505,0.000080844744,0.00028572572,0.00020762155,0.0000038188095,0.00011109562,0.0019081627],"genre_scores_gemma":[0.99937415,0.000005387838,0.00017546024,0.000032349486,0.00010285485,0.00013149202,0.00004325857,0.000012857749,0.00012217028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993758,0.000014488578,0.00010684003,0.000087040295,0.0002514809,0.00016431448],"domain_scores_gemma":[0.9995401,0.00002226435,0.000014934434,0.00013366377,0.00023930351,0.000049749473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005276683,0.00008222537,0.000072699535,0.000057058664,0.000048986065,0.000017386032,0.00006270616,0.000043209442,0.000021770926],"category_scores_gemma":[0.000047286176,0.00007893266,0.000028110535,0.000089028916,0.000012697267,0.00019862532,0.000007772246,0.000038813283,0.000014388962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053574855,0.000015653588,0.0021397173,0.00006363332,0.000011963555,8.823859e-8,0.0010639407,0.9338856,0.000027821454,0.00039449576,0.0061638253,0.05617969],"study_design_scores_gemma":[0.00053234503,0.00013121999,0.0043278267,0.0000077103605,0.000013117327,4.579714e-7,0.00026737107,0.9905817,0.0015417862,0.0005794817,0.0019169776,0.000100043915],"about_ca_topic_score_codex":0.000015756033,"about_ca_topic_score_gemma":0.000014460382,"teacher_disagreement_score":0.056696065,"about_ca_system_score_codex":0.00027969008,"about_ca_system_score_gemma":0.000059091853,"threshold_uncertainty_score":0.32187805},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03297753809922176,"score_gpt":0.2783680073841614,"score_spread":0.24539046928493963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947759080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876586,0.00016606686,0.009917514,0.000503321,0.00078819034,0.000116888055,0.00003158116,0.00016100593,0.00065682555],"genre_scores_gemma":[0.99693173,0.00015264642,0.0011999294,0.0007631771,0.00046572695,0.0001824342,0.00019786583,0.00003845777,0.00006803537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764323,0.00014426888,0.00045217908,0.0005311949,0.000788284,0.00044081206],"domain_scores_gemma":[0.9983836,0.00026679787,0.00033858875,0.00066133443,0.00019980708,0.00014986338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012857469,0.0002655434,0.0001660484,0.00018983158,0.0010210131,0.00047188532,0.00033567424,0.0002300966,0.0000229125],"category_scores_gemma":[0.00027786326,0.00028775315,0.00012788325,0.00032802066,0.0002592553,0.0011981406,0.0002159755,0.00033953125,0.0003744317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002374972,0.00015005383,0.000067369976,0.000073377014,0.000109453504,0.000032823347,0.0021100794,0.015969627,0.0018512652,0.97513705,0.00038412504,0.003877249],"study_design_scores_gemma":[0.0010381177,0.0006138052,0.0014853351,0.00025602142,0.00016828555,0.00037485204,0.00023924257,0.9937714,0.001237482,0.00040028553,0.00013030518,0.00028491524],"about_ca_topic_score_codex":0.0004865393,"about_ca_topic_score_gemma":0.00024576377,"teacher_disagreement_score":0.97780174,"about_ca_system_score_codex":0.00007415008,"about_ca_system_score_gemma":0.00032413675,"threshold_uncertainty_score":0.99995744},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020226104069938033,"score_gpt":0.27018023805017827,"score_spread":0.24995413398024025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248477689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9769358,0.0003139613,0.02004265,0.00071727304,0.00045178263,0.0009212061,0.0000014052775,0.00045141001,0.0001644827],"genre_scores_gemma":[0.983824,0.00018220235,0.014881503,0.00060546014,0.00009322318,0.0003669945,0.0000138888545,0.000010001792,0.000022683756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974338,0.00008277075,0.00050715683,0.0005526981,0.0009888214,0.00043475637],"domain_scores_gemma":[0.9984792,0.000077165554,0.00021635315,0.0007783645,0.00032573577,0.00012319695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002015966,0.00026864698,0.00026108138,0.00019416976,0.00040944532,0.00017378313,0.0004944718,0.00011205417,0.00005573979],"category_scores_gemma":[0.00013577593,0.00022611342,0.00006330796,0.0004893545,0.000055448407,0.0015993989,0.00007688384,0.00016881325,0.00010242537],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006962692,0.00008162656,0.10460465,0.00013081098,0.0000063317925,2.7710786e-7,0.00025466955,0.001706376,0.00008032635,0.000012104276,0.00010869761,0.89300716],"study_design_scores_gemma":[0.0006117537,0.0004700853,0.43982962,0.00011898908,0.000015214903,0.000003818821,0.0000056378885,0.5541899,0.0043242867,0.00012039175,0.00010702366,0.00020325152],"about_ca_topic_score_codex":0.000008679067,"about_ca_topic_score_gemma":0.0000012179677,"teacher_disagreement_score":0.8928039,"about_ca_system_score_codex":0.00023532986,"about_ca_system_score_gemma":0.00024070371,"threshold_uncertainty_score":0.92206377},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08781161317920601,"score_gpt":0.3391762342046643,"score_spread":0.2513646210254583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387501451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.915444,0.000043704593,0.0832052,0.00003130761,0.0004096108,0.00058495736,4.182489e-7,0.000228065,0.00005272987],"genre_scores_gemma":[0.998801,0.000010832964,0.0008804063,0.000030004849,0.0001711312,0.0000752822,0.000009092909,0.000010819566,0.000011429403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983298,0.00012549208,0.00032960644,0.0003061813,0.00065307214,0.0002558582],"domain_scores_gemma":[0.9989417,0.00024107042,0.00013028705,0.0004123537,0.00023587648,0.000038702627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021106077,0.00012022638,0.00014900249,0.0001671732,0.00021352508,0.000047418293,0.00020480072,0.000049161594,0.000008283722],"category_scores_gemma":[0.000096580356,0.00011133743,0.00004167619,0.0011415714,0.000009078567,0.00039785166,0.000069605565,0.00010523809,0.000047451784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001206653,0.0000547866,0.0019198095,0.0000062311424,0.000008816514,0.000011189418,0.0017153843,0.8421167,8.149407e-7,0.00001838017,0.000036261685,0.15409952],"study_design_scores_gemma":[0.0006342571,0.0003675116,0.0030650117,0.00003624218,0.000023321705,0.0000117913105,0.000188079,0.9954444,0.0000027010929,0.00010515867,0.000005223629,0.00011627684],"about_ca_topic_score_codex":0.00002173171,"about_ca_topic_score_gemma":0.000024982066,"teacher_disagreement_score":0.15398325,"about_ca_system_score_codex":0.000059767484,"about_ca_system_score_gemma":0.00007604737,"threshold_uncertainty_score":0.45402086},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.26607368673150594,"score_gpt":0.48535070565636956,"score_spread":0.21927701892486362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389262778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98655903,0.00010404993,0.011515549,0.00016573745,0.00027328279,0.00042762066,0.000009041623,0.000050938077,0.0008947432],"genre_scores_gemma":[0.99843943,0.00015943112,0.0006095709,0.000015204578,0.00008079878,0.00006248015,0.000041800755,0.000012342545,0.0005789297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955756,0.00024601535,0.0005757788,0.00039249734,0.0029035113,0.00030661275],"domain_scores_gemma":[0.9974915,0.0007227014,0.0002508168,0.00031306868,0.0011502405,0.00007167183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072902995,0.000118926226,0.00024055617,0.000535915,0.00023396347,0.00011734399,0.00028245954,0.00006243857,0.00015041932],"category_scores_gemma":[0.0017506108,0.00009828048,0.000031285042,0.00198002,0.00014822348,0.0010857909,0.00016258619,0.00013598488,0.00024489078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007512296,0.000024448724,0.14685334,0.000022752913,0.000009765451,7.0619717e-7,0.00079553976,0.58767986,0.000730489,0.000027184855,0.0011255706,0.26265523],"study_design_scores_gemma":[0.00061003264,0.00006399362,0.38103688,0.000019833651,0.000005332641,9.625368e-7,0.00039012678,0.61169404,0.0020003063,0.0038463448,0.00026111808,0.00007100448],"about_ca_topic_score_codex":0.000051461644,"about_ca_topic_score_gemma":0.00011441628,"teacher_disagreement_score":0.2625842,"about_ca_system_score_codex":0.00006602677,"about_ca_system_score_gemma":0.00022327279,"threshold_uncertainty_score":0.40077615},"labels":[],"label_agreement":null}]}