{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07333816,0.0010877978,0.8960557,0.0014839111,0.00013872438,0.000052434803,0.000106693136,0.00022446329,0.027512128],"genre_scores_gemma":[0.9563716,0.0011308453,0.033364717,0.00028520625,0.00036196562,0.00009408872,0.00017092224,0.00013770344,0.008082809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680626,0.0016091831,0.00007261296,0.00036203736,0.00078404945,0.00036594967],"domain_scores_gemma":[0.9765327,0.018171152,0.0006074173,0.0011113656,0.003195417,0.00038202142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009357954,0.000726795,0.0010394765,0.002374364,0.0008378381,0.0032230525,0.0017871198,0.0010973185,0.0049072844],"category_scores_gemma":[0.037804615,0.00048560713,0.0004995541,0.0018250159,0.0036931057,0.006727025,0.0018180029,0.0018922206,0.0006227045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00009310959,0.00003809461,0.0010187129,0.00004005331,0.000021865882,0.000034146648,0.00015655534,0.09646624,0.0005185189,0.88113475,0.0020325459,0.018445402],"study_design_scores_gemma":[0.000008199651,0.000027708445,0.0006090193,0.000035664227,0.000014134771,0.000033205928,0.00006230513,0.64841247,0.00039550653,0.34947613,0.00090959005,0.000016086475],"about_ca_topic_score_codex":0.0030841406,"about_ca_topic_score_gemma":0.0012696015,"teacher_disagreement_score":0.009357954,"about_ca_system_score_codex":0.002943641,"about_ca_system_score_gemma":0.0017412647,"threshold_uncertainty_score":0.049490213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05132471,0.00052931055,0.9436104,0.0007760346,0.00013032132,0.000112555164,0.00032579617,0.0004222395,0.0027686402],"genre_scores_gemma":[0.96014583,0.0007214751,0.032103363,0.00016395394,0.0002596991,0.00026011598,0.00033629825,0.00012660441,0.005882573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963845,0.0012578727,0.00015640384,0.0005755318,0.0011050419,0.0005206202],"domain_scores_gemma":[0.99090296,0.006143608,0.00082707364,0.00048633115,0.0013270163,0.0003129831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005945842,0.0016926224,0.0017530599,0.0015663458,0.0007578474,0.0027057813,0.0034708541,0.0027290597,0.0021282518],"category_scores_gemma":[0.017765723,0.0010286841,0.0011549582,0.0014375349,0.0021982936,0.0026853087,0.0011959432,0.002567332,0.00047243744],"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.00004500142,0.000036510854,0.0003218038,0.00002719603,0.000023798157,0.000055789704,0.000034752622,0.952932,0.0010056887,0.04310005,0.00043166458,0.0019858058],"study_design_scores_gemma":[0.0000034507163,0.000005387674,0.00004620117,0.0000019754548,0.000004901165,0.000005946517,0.0000015582548,0.9970408,0.00007318154,0.0027605246,0.000051793904,0.0000041845033],"about_ca_topic_score_codex":0.015228006,"about_ca_topic_score_gemma":0.0076750247,"teacher_disagreement_score":0.015228006,"about_ca_system_score_codex":0.004622457,"about_ca_system_score_gemma":0.0023694977,"threshold_uncertainty_score":0.03353846},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02144523,0.0003698226,0.97561705,0.00012226209,0.000051247698,0.00006564245,0.000025407513,0.0012531584,0.001050351],"genre_scores_gemma":[0.42028278,0.00053525256,0.5756141,0.000063478605,0.000083364146,0.000198342,0.00015964136,0.00017110676,0.0028918486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985953,0.00045774796,0.00007502477,0.0001689014,0.00058607635,0.00011705273],"domain_scores_gemma":[0.9977882,0.0010660097,0.00026062154,0.00040041638,0.0004108585,0.00007394607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017636108,0.00087137154,0.00090897846,0.0011095828,0.00061725127,0.0010944131,0.0011899667,0.00095646933,0.0019087982],"category_scores_gemma":[0.00558425,0.0002840691,0.00039980665,0.0012103284,0.000623768,0.0022155948,0.0014541979,0.00068372843,0.0007738383],"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.0013067336,0.00025285382,0.0016615384,0.00024855795,0.0001244966,0.00008811342,0.00013188129,0.42738965,0.033920664,0.023982614,0.0038784717,0.5070145],"study_design_scores_gemma":[0.00006742249,0.00020787027,0.00029623744,0.000007092865,0.00003890699,0.00008549646,0.000026863429,0.9850819,0.009930096,0.0031009153,0.0011426696,0.00001452591],"about_ca_topic_score_codex":0.0020993263,"about_ca_topic_score_gemma":0.002307506,"teacher_disagreement_score":0.0020993263,"about_ca_system_score_codex":0.0010036482,"about_ca_system_score_gemma":0.0015134723,"threshold_uncertainty_score":0.009326994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31233066,0.0006300221,0.6769244,0.00095251284,0.00042051089,0.00059689354,0.00030700976,0.002151028,0.005686895],"genre_scores_gemma":[0.9117186,0.0001220063,0.08337844,0.00013856315,0.000102384445,0.00008018999,0.00009353788,0.000052197596,0.0043140333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768865,0.0006528444,0.00016877589,0.00032050925,0.0008001922,0.00036903372],"domain_scores_gemma":[0.9925425,0.0031325724,0.00047850623,0.0008808617,0.0019526394,0.0010129706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068506002,0.0007173277,0.0010684986,0.001203674,0.0016268983,0.0037807205,0.0028432314,0.0018038591,0.0041909595],"category_scores_gemma":[0.011341967,0.0004722873,0.00055675366,0.0011923318,0.0010748764,0.0022733372,0.0009727636,0.0013958798,0.0006949307],"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.01681996,0.003637985,0.015609289,0.00050653593,0.00021845278,0.002311441,0.000959035,0.48393804,0.08922714,0.14299265,0.008392151,0.23538727],"study_design_scores_gemma":[0.0004951967,0.0014981244,0.0009924833,0.000017012317,0.00009669205,0.0002586338,0.00006838477,0.97691536,0.011589124,0.0062266323,0.001781531,0.00006095158],"about_ca_topic_score_codex":0.0075870655,"about_ca_topic_score_gemma":0.0047154007,"teacher_disagreement_score":0.0075870655,"about_ca_system_score_codex":0.0021615906,"about_ca_system_score_gemma":0.004693986,"threshold_uncertainty_score":0.03622985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19272906,0.00081079936,0.7992122,0.0005722774,0.000113905306,0.00012351811,0.000115603754,0.00036147182,0.005961286],"genre_scores_gemma":[0.98112154,0.00027549523,0.016920915,0.00003903859,0.00006830225,0.000037099926,0.000041783678,0.000037613718,0.0014582552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992679,0.00029143662,0.000027434326,0.00010693804,0.0001806874,0.00012566897],"domain_scores_gemma":[0.9974015,0.0017315237,0.00020187913,0.00012748492,0.0003889326,0.00014867629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002582068,0.0010128123,0.0009564884,0.0007433018,0.0008020871,0.0015122491,0.0015893657,0.0011703656,0.0015499486],"category_scores_gemma":[0.006984643,0.0004522318,0.0006359884,0.0006206039,0.0010177458,0.0011163104,0.0006345711,0.0012331095,0.00018347203],"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.00006440649,0.000054644825,0.0004038274,0.000033400236,0.000017326527,0.000043338197,0.00004034117,0.9836821,0.0019734409,0.010529838,0.00020247579,0.0029548812],"study_design_scores_gemma":[0.0000014718634,0.0000067699834,0.000031011106,5.102375e-7,0.000002722771,0.000002238821,0.0000017599157,0.99951994,0.00010211599,0.00031070982,0.000019472143,0.0000012578989],"about_ca_topic_score_codex":0.01625367,"about_ca_topic_score_gemma":0.003827066,"teacher_disagreement_score":0.01625367,"about_ca_system_score_codex":0.0028083099,"about_ca_system_score_gemma":0.0017359516,"threshold_uncertainty_score":0.032318175},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3578683,0.0011550301,0.6243517,0.00046396142,0.00040883682,0.00029272062,0.0002696584,0.0044745766,0.010715223],"genre_scores_gemma":[0.9222488,0.00016908979,0.07437053,0.00011082868,0.00010572402,0.000050225728,0.00016117207,0.000067782916,0.0027158235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990964,0.00018730231,0.000049441962,0.000076701755,0.00044908357,0.0001410616],"domain_scores_gemma":[0.99853957,0.00038955171,0.00012855855,0.0003217121,0.00043209654,0.00018853287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012041723,0.00036587854,0.00062644307,0.00084095786,0.00070871884,0.0009691806,0.0014280451,0.00046623856,0.0021670547],"category_scores_gemma":[0.0015808436,0.00014686337,0.00027159628,0.0009251023,0.0006177771,0.0011859755,0.00087431225,0.00064709445,0.00033070653],"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.004408344,0.0011303826,0.0034098178,0.00040386218,0.00020717576,0.00020399415,0.0002474193,0.12706567,0.26376587,0.038069315,0.01202691,0.54906124],"study_design_scores_gemma":[0.00023164292,0.001174664,0.00152806,0.0000118229345,0.00011486891,0.0002959259,0.00006634744,0.90904427,0.077751905,0.0035113883,0.006223708,0.00004540011],"about_ca_topic_score_codex":0.0022600235,"about_ca_topic_score_gemma":0.0037375856,"teacher_disagreement_score":0.0022600235,"about_ca_system_score_codex":0.00084729685,"about_ca_system_score_gemma":0.0015169206,"threshold_uncertainty_score":0.0072494745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3919078,0.001742569,0.49545124,0.01966323,0.0007189428,0.00070902955,0.0047010863,0.0014776726,0.08362837],"genre_scores_gemma":[0.914506,0.00052283553,0.012119123,0.0005594246,0.0002682392,0.0002586235,0.0005260134,0.00021053874,0.07102915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951062,0.0017854392,0.00017896933,0.00073499145,0.0003366187,0.0018576751],"domain_scores_gemma":[0.9832329,0.0098920325,0.0013560338,0.0010307154,0.002048667,0.0024395878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074313898,0.0016540076,0.004920549,0.002042689,0.0024740573,0.00619071,0.0076355445,0.0060107564,0.039609373],"category_scores_gemma":[0.019035911,0.0014536177,0.0023768356,0.0023519078,0.004406294,0.007794448,0.003569912,0.0044311685,0.00449039],"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.0009856654,0.00041637936,0.0026086776,0.00024611325,0.00012207676,0.00047979326,0.0008750055,0.4129268,0.001206055,0.54938114,0.017748557,0.013003747],"study_design_scores_gemma":[0.00019125573,0.00015748135,0.00074335624,0.000034665558,0.000066432025,0.00010411601,0.00043969942,0.90019286,0.00020330332,0.09546597,0.0023294853,0.000071318755],"about_ca_topic_score_codex":0.03363429,"about_ca_topic_score_gemma":0.017458811,"teacher_disagreement_score":0.039609373,"about_ca_system_score_codex":0.005862225,"about_ca_system_score_gemma":0.0043529067,"threshold_uncertainty_score":0.13250655},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008420683,0.00014215209,0.98915124,0.0001275257,0.00006910723,0.00003267942,0.000025375411,0.000085203494,0.0019460337],"genre_scores_gemma":[0.58588433,0.0006300137,0.40393597,0.00029654478,0.00024811603,0.00028753388,0.00012730621,0.000109485976,0.008480657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784315,0.000594063,0.00010269124,0.00021514983,0.0010134664,0.00023151674],"domain_scores_gemma":[0.9952586,0.0028881326,0.0002961352,0.00043486815,0.0009203991,0.00020177726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031137322,0.0012235454,0.001524724,0.0022528793,0.000701149,0.003044484,0.0034537043,0.0017990061,0.0035828175],"category_scores_gemma":[0.009429098,0.000488284,0.0014472012,0.001861745,0.0016653991,0.0038671826,0.0014116485,0.0018700395,0.0004010209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00011026135,0.00021473774,0.0012874597,0.00012837969,0.00011371218,0.00012535651,0.00016957468,0.40063563,0.006241431,0.56187946,0.0010248726,0.028069176],"study_design_scores_gemma":[0.000008105652,0.000026161873,0.0000919971,0.0000070947453,0.000015791426,0.00001583877,0.000012598539,0.95313644,0.00053763913,0.04570495,0.00043358988,0.0000098025475],"about_ca_topic_score_codex":0.005525506,"about_ca_topic_score_gemma":0.0030673526,"teacher_disagreement_score":0.005525506,"about_ca_system_score_codex":0.0021523836,"about_ca_system_score_gemma":0.00239379,"threshold_uncertainty_score":0.016467214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11143289,0.0019541567,0.8783771,0.00036089585,0.000111592446,0.00010278143,0.00013008808,0.00027820625,0.0072522964],"genre_scores_gemma":[0.9517351,0.0010187889,0.042202026,0.00008121141,0.000115809715,0.00009386208,0.000087351924,0.00009785415,0.0045680813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880195,0.0003046895,0.000038051356,0.00010886878,0.00051795284,0.00022841398],"domain_scores_gemma":[0.99635434,0.002501962,0.00017733902,0.00014027095,0.00077185227,0.000054362787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002727324,0.0011633442,0.0008183191,0.0010919777,0.00052955694,0.0013321799,0.0008584792,0.00053205533,0.003263034],"category_scores_gemma":[0.006569401,0.0003491043,0.00044683088,0.001106253,0.00069645495,0.0014251039,0.00090316153,0.00077627524,0.0003465371],"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.00022312292,0.000068501824,0.0008271929,0.0001077872,0.000052827196,0.00008607801,0.000095360396,0.9407091,0.007320529,0.020637391,0.0009878568,0.02888421],"study_design_scores_gemma":[0.0000036283934,0.000036903733,0.00014046655,0.0000031151742,0.0000084391395,0.000019300958,0.000013120702,0.99774665,0.00089655136,0.0009476028,0.0001794793,0.000004559648],"about_ca_topic_score_codex":0.007512877,"about_ca_topic_score_gemma":0.005312389,"teacher_disagreement_score":0.007512877,"about_ca_system_score_codex":0.0022761489,"about_ca_system_score_gemma":0.0018554494,"threshold_uncertainty_score":0.016514719},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84572285,0.00012185667,0.1481863,0.000107719825,0.00003829406,0.000069708636,0.0000951915,0.0018579001,0.0038001018],"genre_scores_gemma":[0.99645656,0.000013703477,0.0028931948,0.000010480301,0.000008563241,0.000011751,0.000030045714,0.0000371312,0.0005385559],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99922454,0.00016071231,0.000019716334,0.0001581543,0.00034956876,0.000087225904],"domain_scores_gemma":[0.9986842,0.000535911,0.000110517256,0.00023899245,0.0003418991,0.000088509725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073870836,0.00056431285,0.00073964975,0.00065425504,0.00047266335,0.0007929757,0.001247609,0.00061253126,0.0018916532],"category_scores_gemma":[0.0016580882,0.00019530841,0.00031468898,0.00045611715,0.00049535197,0.00087015267,0.0006385588,0.0005011019,0.0004952396],"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.0035059506,0.0012293208,0.028926423,0.00023521006,0.00017548529,0.00075785816,0.00047676422,0.15990308,0.6915046,0.003254446,0.0011300403,0.10890074],"study_design_scores_gemma":[0.000113213995,0.0018028002,0.016448623,0.000008961394,0.000102081925,0.00031747928,0.000154166,0.86180127,0.11764154,0.00083804585,0.000734629,0.000037138212],"about_ca_topic_score_codex":0.0013762166,"about_ca_topic_score_gemma":0.00087390747,"teacher_disagreement_score":0.0018916532,"about_ca_system_score_codex":0.0008870964,"about_ca_system_score_gemma":0.0003597387,"threshold_uncertainty_score":0.006436348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19203062,0.0001301939,0.80505425,0.00022438301,0.00003157379,0.00004423541,0.000091299866,0.001035724,0.0013577368],"genre_scores_gemma":[0.90039736,0.000105871164,0.098003276,0.000056241905,0.00004473685,0.00006217206,0.00021794175,0.00013655587,0.00097583747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920684,0.00024537748,0.000039090482,0.00013104083,0.0002613545,0.000116355106],"domain_scores_gemma":[0.9925903,0.0051705614,0.00036531792,0.00052172656,0.0009679915,0.00038406323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004644795,0.00055490655,0.0006927087,0.001866774,0.0009361329,0.0016216116,0.0017559789,0.0006941506,0.0022055118],"category_scores_gemma":[0.023028396,0.00057847705,0.00067678356,0.0013528133,0.00089973275,0.0028881456,0.0011905171,0.0013164651,0.00034024115],"study_design_candidate":"theoretical_or_conceptual","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.0003037687,0.00015242348,0.009085471,0.000060189897,0.00004090211,0.000095692325,0.00018311903,0.8974936,0.002676648,0.05201794,0.0010619813,0.03682837],"study_design_scores_gemma":[0.0000025623917,0.000005784349,0.00018462836,9.094527e-7,0.0000013128106,0.0000037999173,0.0000067484475,0.9964135,0.00023355398,0.0031167597,0.000028387758,0.0000020412945],"about_ca_topic_score_codex":0.015779844,"about_ca_topic_score_gemma":0.010153112,"teacher_disagreement_score":0.015779844,"about_ca_system_score_codex":0.0028853554,"about_ca_system_score_gemma":0.0019130463,"threshold_uncertainty_score":0.031376004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03511548,0.00062792515,0.9566818,0.00047706388,0.00027483632,0.00021774168,0.00026362602,0.00067461206,0.0056668296],"genre_scores_gemma":[0.7240793,0.0018688572,0.24334137,0.00047903458,0.0007950752,0.0007340509,0.0008064775,0.00052969914,0.027366078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973622,0.0008182124,0.000106385625,0.00037002182,0.00101452,0.0003286604],"domain_scores_gemma":[0.99631566,0.0016261115,0.00025727888,0.00037824182,0.0012538718,0.00016884785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002487462,0.0020197376,0.0013281843,0.0016826342,0.00069830025,0.0022505105,0.003196405,0.0020583684,0.0029018826],"category_scores_gemma":[0.004833755,0.00048823672,0.0009843052,0.0014226997,0.0009685553,0.0039765984,0.0009775506,0.0019568028,0.0011650193],"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.0006894724,0.00048465494,0.0012945151,0.00021550719,0.00013773401,0.0004142956,0.00014558963,0.8598273,0.025566133,0.05783303,0.004279564,0.04911232],"study_design_scores_gemma":[0.000009253987,0.000037981055,0.0000419787,0.0000030027543,0.000019348146,0.00003852428,0.0000042707015,0.99642533,0.0009698017,0.0019177542,0.0005264078,0.000006354509],"about_ca_topic_score_codex":0.0046400684,"about_ca_topic_score_gemma":0.004425522,"teacher_disagreement_score":0.0046400684,"about_ca_system_score_codex":0.0025451146,"about_ca_system_score_gemma":0.0014508906,"threshold_uncertainty_score":0.018466234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99417007,0.00009366138,0.0046761944,0.000040125786,0.0000084028925,0.000012847448,0.00004848451,0.0000758213,0.00087437197],"genre_scores_gemma":[0.99911934,0.00003227816,0.0005195499,0.0000046036994,0.0000036279598,0.0000044960852,0.00006331605,0.000010377851,0.0002423951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984577,0.0006166495,0.000075925105,0.00011032361,0.0005437154,0.0001957601],"domain_scores_gemma":[0.99184084,0.005209403,0.0005331183,0.00033803674,0.0017850264,0.00029356033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020229772,0.00040281683,0.00035625804,0.0013157567,0.00042540723,0.0006129029,0.0004871197,0.00042232123,0.0006400489],"category_scores_gemma":[0.0104585,0.00015494795,0.00016119622,0.0009380977,0.0004874427,0.00079822436,0.00028481922,0.00036982735,0.00010900517],"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.0035628013,0.00096634,0.07803035,0.00024659862,0.00013447904,0.0006523252,0.0010961393,0.7765287,0.066731475,0.006605665,0.0016294963,0.06381563],"study_design_scores_gemma":[0.000016071985,0.00037728267,0.019109726,0.000011570233,0.000033270277,0.00015835922,0.00018336631,0.9673035,0.011666181,0.00083613634,0.00028677174,0.000017664352],"about_ca_topic_score_codex":0.006935146,"about_ca_topic_score_gemma":0.003978935,"teacher_disagreement_score":0.006935146,"about_ca_system_score_codex":0.0014764068,"about_ca_system_score_gemma":0.0003941754,"threshold_uncertainty_score":0.013789594},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012058989,0.006593486,0.00042845073,0.0569941,0.91552585,0.00008546017,0.00047123813,0.00014912807,0.019631796],"genre_scores_gemma":[0.0022808001,0.0062565487,0.0007487061,0.06734427,0.728538,0.00021543045,0.0005219235,0.00019068214,0.1939037],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99599034,0.00071941107,0.00038687314,0.00058073574,0.0019662776,0.00035641628],"domain_scores_gemma":[0.9740054,0.006537207,0.0019693947,0.0014922217,0.012428407,0.0035674262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00631636,0.0016799002,0.0013632553,0.003665251,0.0016375342,0.0047848425,0.0030638813,0.0060305833,0.15328689],"category_scores_gemma":[0.03090169,0.0005197763,0.0014621838,0.001614544,0.0011812882,0.0025092822,0.0020308816,0.0056472477,0.07067675],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000020788297,0.000007923451,0.000023980067,0.00017489308,0.000004219409,0.000017774206,0.0000067468677,0.000016857415,0.000035973364,0.00033343295,0.9861362,0.013221228],"study_design_scores_gemma":[0.000019430689,0.000015318828,0.0002566871,0.0002054925,0.00000977097,0.00003838474,0.000014002277,0.000031410622,0.00006796014,0.0005050682,0.99882954,0.0000068050963],"about_ca_topic_score_codex":0.0011187504,"about_ca_topic_score_gemma":0.0023438646,"teacher_disagreement_score":0.15328689,"about_ca_system_score_codex":0.0018505404,"about_ca_system_score_gemma":0.0024503411,"threshold_uncertainty_score":0.5127957},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27710077,0.00035903387,0.71803635,0.00021167428,0.00006847911,0.00008824192,0.000055680288,0.00017662215,0.0039032216],"genre_scores_gemma":[0.9875137,0.00013237334,0.011822964,0.00002205179,0.000014234095,0.000023442508,0.000022143271,0.0000131456545,0.00043591813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926823,0.00043675004,0.000037795133,0.00005579827,0.00014879624,0.000052715106],"domain_scores_gemma":[0.9966067,0.0024525544,0.00030066108,0.0001528495,0.00039929248,0.00008789906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026078643,0.00060160796,0.00056817714,0.0007829764,0.00044277127,0.0007743923,0.0007329492,0.0008130733,0.00042538732],"category_scores_gemma":[0.008769869,0.00032993057,0.00048793267,0.00061013683,0.0006909533,0.0008644761,0.00047257976,0.00063633034,0.000078277684],"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.000036246944,0.000043108314,0.0007819621,0.000016720018,0.000019869454,0.00004819185,0.000028465642,0.97102296,0.0016545387,0.021536963,0.00010329211,0.004707711],"study_design_scores_gemma":[0.000001335757,0.0000070620786,0.000037343827,9.1480644e-7,0.0000022389142,0.0000032552628,0.000001268894,0.9986545,0.00013426371,0.0011380614,0.00001858994,0.0000012482298],"about_ca_topic_score_codex":0.0043264544,"about_ca_topic_score_gemma":0.0022825284,"teacher_disagreement_score":0.0043264544,"about_ca_system_score_codex":0.0010367932,"about_ca_system_score_gemma":0.0005393912,"threshold_uncertainty_score":0.013791859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64216584,0.0011737887,0.347017,0.00032043253,0.000077045406,0.000045213983,0.0002771838,0.0009989523,0.007924623],"genre_scores_gemma":[0.98032254,0.00035001722,0.01678936,0.000050228846,0.000029600813,0.00001582593,0.0001615816,0.00010807205,0.0021728827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970776,0.00007180873,0.000008415968,0.000033936998,0.00013036431,0.0000476032],"domain_scores_gemma":[0.9961389,0.0028349436,0.0001701676,0.00023984983,0.000547904,0.000068203655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006248873,0.00036749602,0.00035683965,0.0005376252,0.00019902461,0.0005048631,0.00039274953,0.0004438501,0.0023903195],"category_scores_gemma":[0.0054588555,0.00013574686,0.00026354395,0.0007083447,0.00027240123,0.0006904635,0.00019935051,0.00055419037,0.00029467465],"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.0007711877,0.0002773362,0.0038036646,0.00020649775,0.00010330989,0.0002707247,0.000119840435,0.81599486,0.104505435,0.017251933,0.0018964187,0.05479881],"study_design_scores_gemma":[0.0000059849103,0.000028160403,0.0011154759,0.0000029057232,0.000012665391,0.00003938951,0.00001174244,0.98974824,0.008194485,0.00065234816,0.00018355431,0.0000050770705],"about_ca_topic_score_codex":0.0038888208,"about_ca_topic_score_gemma":0.002382348,"teacher_disagreement_score":0.0038888208,"about_ca_system_score_codex":0.0005904225,"about_ca_system_score_gemma":0.0005033725,"threshold_uncertainty_score":0.00799644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08204162,0.004863812,0.8655086,0.002341436,0.00053227495,0.00014633863,0.00014425656,0.00035357845,0.044068187],"genre_scores_gemma":[0.855189,0.005120523,0.12422938,0.0005428381,0.0009791282,0.00012932438,0.000135522,0.00029541168,0.013378794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970439,0.0014661953,0.00008941978,0.00016649763,0.0009160393,0.00031797925],"domain_scores_gemma":[0.98939145,0.0079649165,0.00041856602,0.0008288425,0.0011944396,0.00020170899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005103582,0.0014637957,0.0016706565,0.0016045643,0.0011327605,0.0021536322,0.001527648,0.0011254123,0.004717142],"category_scores_gemma":[0.01856984,0.00037149538,0.0005322618,0.004503529,0.0017939832,0.0029057483,0.00216491,0.0016591698,0.0005125214],"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.0003912773,0.00020946962,0.0014710625,0.0001363531,0.000056953184,0.00015518878,0.00014847444,0.65925753,0.0029010135,0.19556764,0.008205237,0.13149972],"study_design_scores_gemma":[0.000007974128,0.000057235764,0.0002820725,0.000016765918,0.000020957079,0.000068512505,0.000053212658,0.93705004,0.000921193,0.05913469,0.0023772148,0.0000101918495],"about_ca_topic_score_codex":0.0036310737,"about_ca_topic_score_gemma":0.0033016503,"teacher_disagreement_score":0.005103582,"about_ca_system_score_codex":0.001653743,"about_ca_system_score_gemma":0.0009886911,"threshold_uncertainty_score":0.026990652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43994132,0.000419623,0.54482687,0.00020262954,0.00009720158,0.0001419018,0.00013202014,0.01215865,0.0020798068],"genre_scores_gemma":[0.9646005,0.000034930443,0.034575555,0.00003297706,0.000021398684,0.00005964095,0.00005052156,0.0001332585,0.00049120915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538165,0.0016710815,0.00024004038,0.0008174291,0.0015541768,0.0003356095],"domain_scores_gemma":[0.9786345,0.012052737,0.003116071,0.0035892432,0.0021060607,0.0005013707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002929171,0.001043717,0.0008186657,0.0015012367,0.00058396044,0.0010318628,0.00156795,0.000734252,0.001146718],"category_scores_gemma":[0.01501534,0.0004093487,0.00023615496,0.00049756933,0.000881146,0.0013461373,0.0007829372,0.0012697768,0.0003797066],"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.005585768,0.000962547,0.032142237,0.0004664741,0.00020685256,0.00055548106,0.0013272538,0.1061908,0.27282065,0.014948127,0.0046566315,0.5601372],"study_design_scores_gemma":[0.000092023576,0.00048686995,0.0049040667,0.000027636761,0.00006245444,0.0003176605,0.000054394302,0.89760125,0.08808992,0.0072747683,0.0010178493,0.00007098856],"about_ca_topic_score_codex":0.0010818461,"about_ca_topic_score_gemma":0.0012536431,"teacher_disagreement_score":0.002929171,"about_ca_system_score_codex":0.00079844345,"about_ca_system_score_gemma":0.0009756064,"threshold_uncertainty_score":0.015491068},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048018597,0.00097044173,0.9433267,0.0018257604,0.00030460508,0.00003793542,0.000027902608,0.00016894963,0.0053191497],"genre_scores_gemma":[0.8094064,0.0012698586,0.18393585,0.00058177183,0.00055292284,0.00013872428,0.00007872321,0.00014926311,0.0038865006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982572,0.0010067761,0.00007094077,0.00011125046,0.00041682494,0.00013697254],"domain_scores_gemma":[0.98122954,0.015490762,0.00046391168,0.0010580878,0.0011412889,0.0006164165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008309372,0.0008444106,0.0010911204,0.0016616422,0.0011204653,0.0021967639,0.0027443601,0.0013034045,0.0017042008],"category_scores_gemma":[0.03531739,0.00068394287,0.0009908009,0.0014663697,0.0039488208,0.00495067,0.0025081101,0.0032541873,0.00026994228],"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.00012843285,0.00011228005,0.0012796245,0.000057789486,0.000036451474,0.000107429354,0.00013273854,0.3432485,0.0007579811,0.6315134,0.0016943074,0.020931095],"study_design_scores_gemma":[0.0000059420922,0.0000079771,0.000058292768,0.0000049642354,0.0000024460364,0.000006068554,0.000006242927,0.9323301,0.000109845976,0.06730204,0.0001605186,0.000005561207],"about_ca_topic_score_codex":0.0058546993,"about_ca_topic_score_gemma":0.0046828957,"teacher_disagreement_score":0.008309372,"about_ca_system_score_codex":0.0020455243,"about_ca_system_score_gemma":0.0019231719,"threshold_uncertainty_score":0.043944716},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004282099,0.00012743621,0.9941275,0.00007017918,0.000017178807,0.0000489627,0.000017838582,0.0002571961,0.0010515254],"genre_scores_gemma":[0.3821205,0.00045672175,0.61315006,0.00010571431,0.000105637715,0.00071668223,0.00025315784,0.00034790355,0.0027436425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940361,0.003827985,0.00020148557,0.00034767517,0.0011767,0.00041006776],"domain_scores_gemma":[0.96066856,0.032723136,0.0012061467,0.0015677464,0.0033019988,0.0005324624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012852973,0.0018506179,0.0022086126,0.0025987532,0.0012861498,0.0027091803,0.003507451,0.002731081,0.003062392],"category_scores_gemma":[0.054262828,0.0013364117,0.0013000211,0.002300744,0.0024615044,0.0036946884,0.0037188383,0.0028986684,0.0006214236],"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.00008928429,0.00006839928,0.00032876834,0.000053357777,0.00003296444,0.000022224363,0.00007871117,0.9397238,0.0003460568,0.033774927,0.00060342153,0.0248781],"study_design_scores_gemma":[0.000006318002,0.0000105192385,0.000019751846,0.000006049338,0.000004524346,0.0000033799095,0.0000041107514,0.9884255,0.00013434944,0.011286427,0.00009578611,0.0000033038125],"about_ca_topic_score_codex":0.008765041,"about_ca_topic_score_gemma":0.0048954627,"teacher_disagreement_score":0.012852973,"about_ca_system_score_codex":0.004264268,"about_ca_system_score_gemma":0.0037290973,"threshold_uncertainty_score":0.06797379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98939425,0.0009643866,0.006745994,0.00017817502,0.000026579552,0.00001903599,0.0001287528,0.00022008184,0.002322746],"genre_scores_gemma":[0.9984024,0.00011861103,0.0009356871,0.000010496501,0.000016673712,0.0000057607645,0.000050607563,0.000027799342,0.0004319521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742174,0.0009672981,0.00015844197,0.00023199417,0.0009175486,0.00030287885],"domain_scores_gemma":[0.97018695,0.02269771,0.0020465758,0.00163408,0.0027210119,0.0007137136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003372499,0.00040459775,0.00049366214,0.0009810289,0.00079430384,0.0012649226,0.00074099406,0.00077124767,0.0014628529],"category_scores_gemma":[0.022016201,0.00029898714,0.00023174586,0.0019941167,0.00084921287,0.0018850547,0.0005541986,0.00062975317,0.0002023211],"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.014618468,0.0021309094,0.18586974,0.00078365457,0.00051757006,0.0017194743,0.00090668024,0.43555415,0.2112227,0.011648023,0.0032339892,0.13179477],"study_design_scores_gemma":[0.00015855345,0.0020719382,0.039856993,0.000027479771,0.00037831324,0.0012900936,0.00041137481,0.8531421,0.09966688,0.0018491662,0.0010718482,0.000075350996],"about_ca_topic_score_codex":0.0066412794,"about_ca_topic_score_gemma":0.0052988855,"teacher_disagreement_score":0.0066412794,"about_ca_system_score_codex":0.0017002133,"about_ca_system_score_gemma":0.0012913616,"threshold_uncertainty_score":0.017835736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8270441,0.0027884599,0.1389027,0.0011626275,0.00037282272,0.0010406802,0.0011738718,0.0052591204,0.022255482],"genre_scores_gemma":[0.9604614,0.00044917085,0.03527583,0.00006706001,0.00008904765,0.0002541623,0.00054953265,0.00019383353,0.0026601253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962112,0.0010424835,0.00023337899,0.00020843705,0.0017303827,0.00057414867],"domain_scores_gemma":[0.9913085,0.0039005876,0.00049724145,0.0021719926,0.0016847927,0.00043692713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004524762,0.0010318152,0.0016437693,0.0017748128,0.0016187677,0.0013628523,0.0021681325,0.0012230893,0.0034957542],"category_scores_gemma":[0.010319452,0.0003912342,0.0003947624,0.0017736262,0.00076283456,0.0033991346,0.002186576,0.0010464246,0.00040442825],"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.010237217,0.003104544,0.006146587,0.0011191525,0.0004405322,0.0005603306,0.0007038422,0.5338843,0.084130384,0.03470942,0.019720143,0.30524352],"study_design_scores_gemma":[0.0005315574,0.0015148938,0.0016103537,0.00003352112,0.00016999044,0.00022230978,0.00022062856,0.9493536,0.03216632,0.010493979,0.003631327,0.000051607178],"about_ca_topic_score_codex":0.0033791102,"about_ca_topic_score_gemma":0.0028516203,"teacher_disagreement_score":0.004524762,"about_ca_system_score_codex":0.0022796472,"about_ca_system_score_gemma":0.0015665017,"threshold_uncertainty_score":0.023929536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3597681,0.0021180427,0.48085353,0.00044947278,0.0009522637,0.0028770524,0.003217273,0.13043724,0.019327052],"genre_scores_gemma":[0.82779354,0.00042649548,0.15678695,0.00018485218,0.00010308925,0.000594859,0.0028027522,0.0027737909,0.008533754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997038,0.00070976367,0.00017600853,0.00025820432,0.0013479433,0.0004701127],"domain_scores_gemma":[0.99599,0.0010342427,0.0003221306,0.00091782404,0.0013118779,0.00042396042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030247548,0.001547556,0.0009903093,0.002379837,0.0010092123,0.0017066215,0.0030252424,0.0008509791,0.004645361],"category_scores_gemma":[0.008086705,0.0005659369,0.0003467458,0.0014273816,0.0005998702,0.002402653,0.0010368124,0.0014097971,0.000974306],"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.009830643,0.0026375013,0.010506485,0.00086569163,0.00073211157,0.0005947667,0.00040563048,0.09684732,0.11404809,0.014336923,0.05019814,0.6989967],"study_design_scores_gemma":[0.0009101835,0.0021262222,0.006360079,0.000051952742,0.0003705894,0.0005991743,0.00008923614,0.8395915,0.12833372,0.0033101777,0.018033711,0.00022351682],"about_ca_topic_score_codex":0.0069722487,"about_ca_topic_score_gemma":0.005934517,"teacher_disagreement_score":0.0069722487,"about_ca_system_score_codex":0.0014109657,"about_ca_system_score_gemma":0.0021640656,"threshold_uncertainty_score":0.015996635},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33250687,0.0030403559,0.64090365,0.0014387986,0.0002578539,0.00020528343,0.0001361054,0.00026881258,0.021242261],"genre_scores_gemma":[0.98144484,0.00029862643,0.016646842,0.00005752375,0.00011469436,0.000025554993,0.00002177404,0.000031189364,0.0013590393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960871,0.0020781239,0.00006702799,0.00022445172,0.0009545218,0.0005888349],"domain_scores_gemma":[0.99517137,0.003422688,0.00029115172,0.00027068148,0.0006852348,0.0001589257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063409973,0.0012195325,0.001385325,0.00076691445,0.0008087766,0.0021308975,0.0017098206,0.0009473179,0.0026112723],"category_scores_gemma":[0.013244735,0.00039895688,0.0004293005,0.0011071749,0.0009159716,0.002518471,0.0009782773,0.0011237293,0.00018721477],"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.000499177,0.00017841633,0.0008027537,0.000068520196,0.000042812568,0.00011366776,0.000035805235,0.93253183,0.0028457036,0.03204507,0.001052522,0.029783752],"study_design_scores_gemma":[0.000016736107,0.00010287416,0.00023738999,0.000004816208,0.000018753992,0.00004157582,0.000018319346,0.9943938,0.000688885,0.004196109,0.0002727981,0.0000078397925],"about_ca_topic_score_codex":0.0039361194,"about_ca_topic_score_gemma":0.0037141824,"teacher_disagreement_score":0.0063409973,"about_ca_system_score_codex":0.0027439112,"about_ca_system_score_gemma":0.002187779,"threshold_uncertainty_score":0.033534765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10321031,0.0010553367,0.83279854,0.0018016224,0.00014270924,0.0003246005,0.001554012,0.0013388457,0.05777407],"genre_scores_gemma":[0.93317926,0.0009543705,0.05726593,0.00012473414,0.00011829756,0.00045771766,0.0014399744,0.00018066942,0.006279065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981773,0.0009732107,0.0000748464,0.00014704007,0.00047920222,0.00014840407],"domain_scores_gemma":[0.99257797,0.0057641417,0.00042230645,0.00041428916,0.00069336855,0.00012789879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022946552,0.0014492528,0.00062798476,0.0015575554,0.000299203,0.0014347797,0.0014319705,0.0015476752,0.0051624286],"category_scores_gemma":[0.016898507,0.0005858607,0.0009690763,0.0013278017,0.0006570804,0.0031915468,0.000905478,0.001625805,0.0015177787],"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.00004440301,0.000047324265,0.0004814418,0.00006812089,0.00002160679,0.000071116636,0.00008625539,0.90791625,0.00025243085,0.074722715,0.0017334882,0.0145547455],"study_design_scores_gemma":[0.0000074106424,0.000028185856,0.00021265626,0.000017539025,0.000009916252,0.00003175916,0.000016229238,0.94652104,0.00014147304,0.05144387,0.0015630581,0.000006782971],"about_ca_topic_score_codex":0.0023077563,"about_ca_topic_score_gemma":0.0018420332,"teacher_disagreement_score":0.0051624286,"about_ca_system_score_codex":0.0012362236,"about_ca_system_score_gemma":0.00062625564,"threshold_uncertainty_score":0.017270029},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31573787,0.0012077545,0.67201066,0.0009706589,0.00022222406,0.00010704158,0.00017357522,0.00044051083,0.009129725],"genre_scores_gemma":[0.99084306,0.00018289244,0.006825988,0.000046865516,0.000062613726,0.000018445973,0.000042378288,0.000028949464,0.0019489466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904686,0.00020663114,0.000022511298,0.00012039212,0.00036870094,0.00023486008],"domain_scores_gemma":[0.99790925,0.0010752876,0.00019932396,0.00008741793,0.0005848086,0.00014388074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017386624,0.0005635786,0.00078248524,0.0008191254,0.0005921284,0.0015922126,0.0012704954,0.00051056565,0.0019503225],"category_scores_gemma":[0.0058201696,0.00023066986,0.00044103464,0.00066780276,0.0008101437,0.001198601,0.0006073062,0.0007007218,0.000119486416],"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.00024944305,0.00009904631,0.002866637,0.00014063739,0.00005130865,0.00022899832,0.00014674802,0.88237244,0.009082593,0.089247294,0.001676372,0.013838535],"study_design_scores_gemma":[0.0000014666068,0.000006357346,0.00015456103,9.5230274e-7,0.000002939415,0.0000057747116,0.0000061978194,0.99828583,0.00016664558,0.0013300476,0.00003746246,0.0000018079805],"about_ca_topic_score_codex":0.013593866,"about_ca_topic_score_gemma":0.0041646166,"teacher_disagreement_score":0.013593866,"about_ca_system_score_codex":0.0023261616,"about_ca_system_score_gemma":0.0020006704,"threshold_uncertainty_score":0.027029455},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08098613,0.00064835156,0.8969257,0.00021714099,0.00014744147,0.0002267957,0.00039715195,0.016313236,0.004138101],"genre_scores_gemma":[0.6584794,0.00017624977,0.33814716,0.00012738285,0.00005510885,0.00012697653,0.0005523273,0.00018783283,0.0021475398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680895,0.00055134937,0.0002572048,0.0007301716,0.0014419403,0.00021032403],"domain_scores_gemma":[0.9906613,0.004782646,0.0006515868,0.0009948272,0.0027293372,0.00018037109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002562567,0.00091032754,0.0014849154,0.003014541,0.00056220114,0.0015910283,0.0019936003,0.0011409573,0.002425415],"category_scores_gemma":[0.010881825,0.00036200017,0.00073829485,0.0011204674,0.0004946084,0.0012777415,0.0005801611,0.0010658767,0.0014326273],"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.00078826695,0.0005221368,0.00839822,0.00024319485,0.000149753,0.0003452725,0.00014337062,0.07331173,0.0312282,0.002470398,0.004612143,0.87778735],"study_design_scores_gemma":[0.000053268453,0.00018109089,0.0031569698,0.00002578797,0.0001053719,0.0001885806,0.000025399255,0.9697574,0.023182409,0.0021390705,0.0011537252,0.00003102387],"about_ca_topic_score_codex":0.0058302595,"about_ca_topic_score_gemma":0.004891054,"teacher_disagreement_score":0.0058302595,"about_ca_system_score_codex":0.0007518708,"about_ca_system_score_gemma":0.0011007908,"threshold_uncertainty_score":0.013552308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95474267,0.000096080286,0.04349572,0.00006211466,0.000014293322,0.00007102477,0.000031400763,0.0003497299,0.0011369355],"genre_scores_gemma":[0.9903619,0.000022848613,0.009304759,0.000005434894,0.0000061191417,0.00002336713,0.000036674923,0.000014976144,0.00022396118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642205,0.0017221109,0.0002626905,0.00016781945,0.0011407752,0.0002844905],"domain_scores_gemma":[0.97801286,0.014437965,0.0018674227,0.0013567935,0.0033901064,0.00093487464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051486376,0.0009478412,0.000660297,0.0009830714,0.00034265226,0.0013779078,0.0010584939,0.0008698136,0.00087909977],"category_scores_gemma":[0.023230582,0.00032920888,0.0003763242,0.00057523855,0.0006569301,0.0017101966,0.0009934357,0.00062733184,0.00015576476],"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.0049902224,0.0010772597,0.035997644,0.00027553644,0.00028357052,0.0002552635,0.0002988418,0.7994556,0.046277143,0.0029514101,0.00040503824,0.10773254],"study_design_scores_gemma":[0.000087247325,0.0020597342,0.00588086,0.0000100481075,0.00011388598,0.000047721678,0.00009692996,0.9685698,0.021352151,0.0016047813,0.00015657664,0.000020214686],"about_ca_topic_score_codex":0.0021026805,"about_ca_topic_score_gemma":0.0019749864,"teacher_disagreement_score":0.0051486376,"about_ca_system_score_codex":0.0015027312,"about_ca_system_score_gemma":0.0011872725,"threshold_uncertainty_score":0.027228892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977971,0.0003846456,0.019799344,0.00026263966,0.00001541777,0.000013362145,0.00001764946,0.00017444094,0.0013614383],"genre_scores_gemma":[0.99660975,0.000043948727,0.0031815486,0.000008621001,0.0000076456545,0.0000045493393,0.000018472732,0.00000774034,0.00011768783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649125,0.002193005,0.00016058127,0.00012967599,0.00067586394,0.00034946532],"domain_scores_gemma":[0.949989,0.041827247,0.0022938245,0.0019761692,0.0033080408,0.0006056508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070743454,0.00070931175,0.00044246306,0.0014610168,0.00042436263,0.0012571178,0.00096658245,0.0011577548,0.0006802311],"category_scores_gemma":[0.04427672,0.0002661389,0.00026639734,0.0008619213,0.0010871093,0.00236411,0.0005752375,0.0007032014,0.00010775981],"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.0016337753,0.00048128646,0.03444766,0.00011964857,0.0001765233,0.000093293274,0.00023525544,0.86681455,0.008414804,0.008652027,0.00055266055,0.07837854],"study_design_scores_gemma":[0.00003393668,0.00033617392,0.0052014757,0.000008205623,0.000054849563,0.00002493579,0.000105874526,0.98558676,0.004216284,0.004304732,0.00011457148,0.0000122761385],"about_ca_topic_score_codex":0.004864185,"about_ca_topic_score_gemma":0.0031731576,"teacher_disagreement_score":0.0070743454,"about_ca_system_score_codex":0.0017659831,"about_ca_system_score_gemma":0.00086366746,"threshold_uncertainty_score":0.03741312},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24083601,0.0029071188,0.7432451,0.0013963389,0.00019735309,0.00010951741,0.00015231805,0.00049003627,0.010666118],"genre_scores_gemma":[0.9829071,0.00054299785,0.013243801,0.00007903304,0.00015307766,0.000030964187,0.00006392763,0.000047385394,0.002931797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973693,0.00090809196,0.00008534775,0.00026122437,0.00095177296,0.0004242501],"domain_scores_gemma":[0.98657644,0.010264378,0.0007184272,0.00042941116,0.0015645061,0.00044671437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006563407,0.0012529363,0.0015123088,0.0020935305,0.0008626497,0.0029469626,0.0020571356,0.001439967,0.0024459846],"category_scores_gemma":[0.01912861,0.00067055307,0.0009045428,0.0018698989,0.0018149232,0.0026075023,0.0014152756,0.0013549854,0.0002996852],"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.00027430546,0.00011692754,0.0011182152,0.000070891605,0.000069213085,0.0000979756,0.000095407995,0.88619006,0.0028541472,0.09618634,0.0009163755,0.012010165],"study_design_scores_gemma":[0.0000045820884,0.000025766076,0.00012258872,0.000003106884,0.000008934494,0.0000113555825,0.0000061415426,0.99434584,0.0002102185,0.005195686,0.00005939514,0.0000063112507],"about_ca_topic_score_codex":0.007974653,"about_ca_topic_score_gemma":0.0026386695,"teacher_disagreement_score":0.007974653,"about_ca_system_score_codex":0.004669345,"about_ca_system_score_gemma":0.0030624834,"threshold_uncertainty_score":0.034711063},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40762156,0.0004734961,0.5870395,0.00030640472,0.00010581441,0.00010957281,0.00004283043,0.00024711897,0.0040536746],"genre_scores_gemma":[0.9933468,0.000054191198,0.0060347104,0.000012570011,0.000011809401,0.000016660693,0.000010633718,0.000008692225,0.00050385966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984479,0.000559556,0.0000650275,0.00023912989,0.0003578813,0.00033052743],"domain_scores_gemma":[0.9949477,0.003453712,0.00043127555,0.00016704046,0.0007692539,0.00023105617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042569893,0.0011993805,0.0010811914,0.00063452235,0.0006078861,0.0016765264,0.000999663,0.00093643577,0.0012173135],"category_scores_gemma":[0.009366525,0.00036284697,0.00032872777,0.00049991446,0.0012815875,0.0011350206,0.0010748182,0.0010020378,0.00006644497],"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.00032509942,0.00009110819,0.0003210662,0.00003134931,0.000017223394,0.00003174106,0.000035170688,0.98603106,0.0024026725,0.003366891,0.000104834086,0.0072418004],"study_design_scores_gemma":[0.0000082230645,0.000072678304,0.00007233527,0.0000015445258,0.0000056477606,0.0000024707595,0.000005058952,0.9986534,0.0006868321,0.0004718829,0.000016965232,0.000002967027],"about_ca_topic_score_codex":0.01231486,"about_ca_topic_score_gemma":0.0056047533,"teacher_disagreement_score":0.01231486,"about_ca_system_score_codex":0.0016412367,"about_ca_system_score_gemma":0.0020578238,"threshold_uncertainty_score":0.024486363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09129493,0.0009064318,0.892319,0.0020977275,0.00013388536,0.000096147494,0.000038864146,0.00019605542,0.012917029],"genre_scores_gemma":[0.9303676,0.00025862895,0.062403433,0.0002616893,0.00025161184,0.00011198553,0.00002415585,0.00012451805,0.0061963806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934022,0.0039153397,0.00016468206,0.00038318333,0.0016078892,0.0005266284],"domain_scores_gemma":[0.9684391,0.025457565,0.0009031058,0.0024423632,0.0019369333,0.000820891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00979823,0.0005410379,0.0016628221,0.0011213532,0.0023172859,0.002858359,0.002958291,0.0013798316,0.008243688],"category_scores_gemma":[0.045248035,0.00059528253,0.0007546232,0.0015866719,0.0039726584,0.009388119,0.0030931411,0.0024229402,0.00051888655],"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.0006857684,0.00022890896,0.002164089,0.00012843002,0.00006392756,0.00021426378,0.0005346299,0.2958444,0.0034489296,0.65433025,0.0026080452,0.039748408],"study_design_scores_gemma":[0.00002866991,0.000073621115,0.00036600092,0.000017125676,0.000024365645,0.00005209443,0.0001008442,0.78150535,0.0011498929,0.21549128,0.0011687377,0.000022012988],"about_ca_topic_score_codex":0.0033060529,"about_ca_topic_score_gemma":0.0040544863,"teacher_disagreement_score":0.00979823,"about_ca_system_score_codex":0.0022037115,"about_ca_system_score_gemma":0.0018870375,"threshold_uncertainty_score":0.05181861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53082645,0.0010084407,0.44388744,0.0034189366,0.000261757,0.0005770625,0.00059497287,0.0013939718,0.018030867],"genre_scores_gemma":[0.96858203,0.000102500875,0.028996516,0.00018583128,0.000058893813,0.000068511334,0.00007542373,0.000049635342,0.0018806387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770445,0.0008476677,0.00008177508,0.00028291656,0.0002715442,0.00081161567],"domain_scores_gemma":[0.9963463,0.0018239556,0.00037195336,0.00021620188,0.00072859105,0.00051296427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027541956,0.0008237059,0.001100764,0.0012206802,0.0015166497,0.0018933899,0.0013228158,0.0017824273,0.0042790677],"category_scores_gemma":[0.0058852322,0.0003908482,0.00039689837,0.0007999113,0.001112495,0.0014751969,0.00088652474,0.00085097586,0.00035169066],"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.0015711389,0.00030323883,0.0020271812,0.00016101851,0.00005336321,0.00016716855,0.00014392425,0.9251845,0.007348366,0.03171651,0.0063083665,0.025015285],"study_design_scores_gemma":[0.000039291397,0.000087889995,0.00035954468,0.000009220333,0.000020386267,0.000022978655,0.00004202375,0.99063957,0.0012545501,0.0073063495,0.00020666338,0.00001161468],"about_ca_topic_score_codex":0.014839071,"about_ca_topic_score_gemma":0.010853434,"teacher_disagreement_score":0.014839071,"about_ca_system_score_codex":0.004167113,"about_ca_system_score_gemma":0.005065254,"threshold_uncertainty_score":0.030234635},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2676963,0.00019962789,0.71869063,0.0001525223,0.000028919878,0.00011960408,0.00025022938,0.0063317707,0.0065304013],"genre_scores_gemma":[0.9272265,0.000115281335,0.07039729,0.00001755402,0.000016498105,0.000095778334,0.00022424,0.00031062888,0.0015962706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881196,0.00041024026,0.00004102361,0.00011982107,0.0004893837,0.00012759861],"domain_scores_gemma":[0.99710315,0.0017210471,0.00029963956,0.00041569694,0.00041307785,0.000047338926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011343776,0.0010385123,0.0006142146,0.0009752422,0.00044511192,0.0013463437,0.0013336926,0.00079725205,0.0018512884],"category_scores_gemma":[0.005314312,0.0005771701,0.0007243531,0.00046068453,0.00057127455,0.0010560694,0.0004636525,0.0007638365,0.00049430394],"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.00004969393,0.000048853657,0.0006363486,0.000030090889,0.000012021184,0.000030206154,0.000049955743,0.98032,0.002965363,0.0045703985,0.00025216932,0.0110350475],"study_design_scores_gemma":[0.0000035615692,0.000011683305,0.0000919049,0.0000014260447,0.000004370031,0.0000047544936,0.0000021213768,0.9975253,0.001338245,0.0008638819,0.00015059349,0.0000021589117],"about_ca_topic_score_codex":0.0072607836,"about_ca_topic_score_gemma":0.004204028,"teacher_disagreement_score":0.0072607836,"about_ca_system_score_codex":0.0014038313,"about_ca_system_score_gemma":0.0016067673,"threshold_uncertainty_score":0.01443702},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54262424,0.00074384786,0.45046508,0.0003397388,0.00015067647,0.00015300665,0.000061380684,0.0008610972,0.004600911],"genre_scores_gemma":[0.9539833,0.000092072165,0.04464446,0.000034674435,0.0000421665,0.000043668533,0.000031883323,0.000034438144,0.0010933925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891627,0.00036399713,0.000054134827,0.00012261755,0.00039229053,0.00015074109],"domain_scores_gemma":[0.996075,0.0024796333,0.00023125841,0.00029527923,0.0007555101,0.00016317959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023270594,0.00071741175,0.0008511714,0.000575718,0.0006466142,0.0010261798,0.0013334932,0.0009288454,0.0014306825],"category_scores_gemma":[0.0046138163,0.00024375497,0.00023603835,0.00059582345,0.00048197075,0.0010561489,0.00068689964,0.0005073756,0.00022619247],"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.0022751624,0.00045927777,0.0033688692,0.00017166465,0.00015812137,0.00013567366,0.00010303018,0.81481683,0.04326377,0.007519017,0.0012448202,0.12648374],"study_design_scores_gemma":[0.00001840676,0.0001182328,0.00018125269,0.0000012203071,0.0000123438385,0.0000310359,0.000007874894,0.99706167,0.0021864667,0.00030182852,0.00007584593,0.0000039320494],"about_ca_topic_score_codex":0.0015450484,"about_ca_topic_score_gemma":0.0012381002,"teacher_disagreement_score":0.0023270594,"about_ca_system_score_codex":0.0007141907,"about_ca_system_score_gemma":0.0008709415,"threshold_uncertainty_score":0.012306809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51594555,0.0009458387,0.4773539,0.00090781983,0.0001991757,0.00013017636,0.00022195523,0.00052799535,0.0037675898],"genre_scores_gemma":[0.9916602,0.00016273484,0.0072674765,0.000026326892,0.000051208743,0.000026959697,0.000050484494,0.0000142021845,0.000740464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947187,0.0019681656,0.0002534856,0.0006180828,0.0014377671,0.0010037184],"domain_scores_gemma":[0.97449976,0.01815883,0.0020515753,0.00085943204,0.0032528997,0.0011775118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01041737,0.0010077073,0.0020922,0.0014536378,0.0011845812,0.004412375,0.0030794616,0.0014401699,0.0021058586],"category_scores_gemma":[0.024698814,0.0007200893,0.0005792522,0.0017115045,0.0022248789,0.004243787,0.0010322974,0.0011356646,0.00022148332],"study_design_candidate":"theoretical_or_conceptual","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.0015030745,0.00026107565,0.0036826716,0.00015205014,0.000092755305,0.00026619976,0.00019746907,0.87026435,0.004055992,0.10633774,0.0009420731,0.012244477],"study_design_scores_gemma":[0.000018624156,0.000036468464,0.00020363399,0.0000028359025,0.000013144546,0.000015936801,0.000013459377,0.9956866,0.00038917453,0.0035771565,0.000034557794,0.000008307058],"about_ca_topic_score_codex":0.009015123,"about_ca_topic_score_gemma":0.005085682,"teacher_disagreement_score":0.01041737,"about_ca_system_score_codex":0.005551286,"about_ca_system_score_gemma":0.0044623152,"threshold_uncertainty_score":0.05509299},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13792619,0.0009689094,0.8386034,0.0025178257,0.0001434174,0.00011131916,0.0001837914,0.00021237199,0.019332822],"genre_scores_gemma":[0.91267097,0.00053952984,0.07790696,0.00023757578,0.0002161259,0.00013090447,0.00023144818,0.00007411163,0.007992474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909675,0.00033432798,0.000025181453,0.0000897669,0.00030733456,0.00014672287],"domain_scores_gemma":[0.99662423,0.002318562,0.00027586854,0.00015296186,0.00047036237,0.00015799628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024722856,0.0005841071,0.00073260773,0.0012820874,0.0008658895,0.002060744,0.0018211397,0.0011426655,0.0031458058],"category_scores_gemma":[0.008909224,0.0004479636,0.00063812867,0.00079519703,0.0016460717,0.0018390976,0.0018268027,0.001696563,0.00024954425],"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.000052649502,0.000054641718,0.000934103,0.000058079004,0.00002077628,0.000070748334,0.00010571855,0.41537154,0.0007764969,0.57133234,0.0020754419,0.009147398],"study_design_scores_gemma":[0.0000073076,0.0000065734566,0.00018543056,0.000005571706,0.000003618252,0.00001012277,0.000012014084,0.92372906,0.00007790588,0.07569446,0.00026290378,0.0000050974613],"about_ca_topic_score_codex":0.006895585,"about_ca_topic_score_gemma":0.0047056694,"teacher_disagreement_score":0.006895585,"about_ca_system_score_codex":0.0031190221,"about_ca_system_score_gemma":0.002735736,"threshold_uncertainty_score":0.022630215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91967696,0.0012599999,0.074857175,0.00040388055,0.00006390196,0.0002143286,0.00023847367,0.0011736731,0.0021115209],"genre_scores_gemma":[0.9781617,0.00018582097,0.020765,0.00003285539,0.000032458927,0.000057871195,0.00014232205,0.00008392927,0.0005380881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99214137,0.0038083254,0.0004987096,0.0007800015,0.0015394064,0.0012321565],"domain_scores_gemma":[0.96106005,0.028511425,0.0016768465,0.004053793,0.0035301107,0.0011677913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008650792,0.0013225935,0.0022852295,0.0014110382,0.0016252857,0.002864737,0.002734257,0.0016094017,0.0011691416],"category_scores_gemma":[0.030076966,0.00088921667,0.000559069,0.0026817995,0.0022660743,0.004053352,0.0014104721,0.0010561303,0.00020206449],"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.0022341588,0.000508014,0.004853329,0.00012211547,0.00014929844,0.00013644913,0.00015398333,0.9612775,0.0048843976,0.0038774183,0.0011891259,0.020614363],"study_design_scores_gemma":[0.00011340284,0.00016963009,0.0007377723,0.0000037481138,0.000048021724,0.000043463602,0.00004294839,0.99536276,0.0022283182,0.0011386438,0.00009916172,0.000012155],"about_ca_topic_score_codex":0.020268237,"about_ca_topic_score_gemma":0.0120134335,"teacher_disagreement_score":0.020268237,"about_ca_system_score_codex":0.0059730974,"about_ca_system_score_gemma":0.00418554,"threshold_uncertainty_score":0.04575032},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8216355,0.017696224,0.10730534,0.0036195184,0.00030038942,0.00037418984,0.00066456565,0.0016416744,0.04676271],"genre_scores_gemma":[0.98774314,0.0013817286,0.009533354,0.00010611376,0.00014729584,0.000046825593,0.0003067132,0.00010762252,0.00062721176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9855172,0.005633662,0.00095363986,0.0010242778,0.0060110507,0.00086023234],"domain_scores_gemma":[0.92046183,0.06451887,0.0022390932,0.005235183,0.0062714205,0.0012736438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016806459,0.0011547194,0.0012178933,0.0027262517,0.0006292367,0.0027325517,0.0015830494,0.0020876802,0.0018445712],"category_scores_gemma":[0.06740903,0.00025977127,0.00036163884,0.002073788,0.0013571655,0.0045195906,0.0013701937,0.0011529246,0.00032514773],"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.008118346,0.0014604118,0.032080133,0.0022084247,0.0007081764,0.00056240306,0.000791953,0.26719758,0.05934375,0.04021848,0.0065235225,0.58078694],"study_design_scores_gemma":[0.00039951265,0.008269637,0.034301907,0.00060547143,0.00062163774,0.0009629866,0.0016055558,0.80304754,0.08772847,0.053080942,0.009208851,0.00016754912],"about_ca_topic_score_codex":0.0014005209,"about_ca_topic_score_gemma":0.0010347413,"teacher_disagreement_score":0.016806459,"about_ca_system_score_codex":0.0013424117,"about_ca_system_score_gemma":0.000931182,"threshold_uncertainty_score":0.08888209},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10436509,0.0007763467,0.8838473,0.00066178344,0.00011476248,0.000076856195,0.000105544634,0.00026607735,0.0097862175],"genre_scores_gemma":[0.8977806,0.0006298463,0.09351185,0.00019133442,0.00016841541,0.00014782259,0.00029826036,0.00026730125,0.0070044855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974443,0.001001785,0.000113386675,0.00023060001,0.00073876575,0.00047118324],"domain_scores_gemma":[0.9890681,0.006231614,0.0009247405,0.0008184774,0.0021264073,0.00083064893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055772085,0.0010658203,0.0011778498,0.0025188916,0.0011604511,0.0034819532,0.0012453722,0.0009937249,0.0026376948],"category_scores_gemma":[0.02430573,0.0007302757,0.0010072341,0.0015120086,0.0021426834,0.0050595496,0.0021239736,0.0019201209,0.0004100435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0002285785,0.00009812277,0.002201179,0.000086179636,0.000037693753,0.00010554117,0.00042191293,0.11740945,0.00462244,0.84921277,0.002694157,0.022881996],"study_design_scores_gemma":[0.000009369034,0.000021431295,0.00042808056,0.000019330197,0.000014111261,0.000025335265,0.000053092153,0.6973086,0.0010392918,0.30051604,0.00055136235,0.0000139256745],"about_ca_topic_score_codex":0.0046885824,"about_ca_topic_score_gemma":0.0022767824,"teacher_disagreement_score":0.0055772085,"about_ca_system_score_codex":0.002406833,"about_ca_system_score_gemma":0.0019294461,"threshold_uncertainty_score":0.029495418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88251495,0.00052196917,0.11419502,0.0002208313,0.000035056873,0.00008322066,0.0007919621,0.00057725335,0.0010597062],"genre_scores_gemma":[0.99013877,0.00013240296,0.008721408,0.000008355565,0.000023885106,0.000020479172,0.0005817137,0.000026226555,0.0003469522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983798,0.00068444666,0.0001051704,0.00030319695,0.00040232667,0.00012504608],"domain_scores_gemma":[0.97486556,0.02101348,0.001333582,0.0010628517,0.0013239222,0.0004006536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031598136,0.0007474176,0.0007587456,0.002897508,0.00039198535,0.0011002121,0.0010613904,0.0011292584,0.000747899],"category_scores_gemma":[0.023236772,0.00029250007,0.0004747961,0.002269865,0.0004075426,0.0024119983,0.000491277,0.0005846772,0.00027062828],"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.0007297666,0.00044004683,0.063916445,0.00021932181,0.00022284256,0.0001693944,0.00018706011,0.8541774,0.0077796127,0.00215174,0.0010632618,0.068943046],"study_design_scores_gemma":[0.000002287865,0.00004292581,0.0023907018,0.0000017393079,0.000008955739,0.000032481057,0.000012821949,0.99637765,0.0008300862,0.00024600467,0.000050714883,0.0000035616574],"about_ca_topic_score_codex":0.011675301,"about_ca_topic_score_gemma":0.009573685,"teacher_disagreement_score":0.011675301,"about_ca_system_score_codex":0.0010217553,"about_ca_system_score_gemma":0.00047005844,"threshold_uncertainty_score":0.023214698},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03125475,0.000072540635,0.9634889,0.00008432703,0.00003908373,0.00007842795,0.000042721782,0.002393622,0.0025456585],"genre_scores_gemma":[0.6613423,0.00006608706,0.33517608,0.000051972995,0.000023281766,0.00016553205,0.00014843023,0.0008785956,0.002147713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957812,0.0013030712,0.00018036336,0.0004480961,0.0017076763,0.00057958474],"domain_scores_gemma":[0.9917971,0.0042396486,0.00047193677,0.0021587983,0.0011188671,0.00021359327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031314162,0.0011333115,0.0012487789,0.0012187898,0.001027449,0.0015829863,0.0021083069,0.00076833984,0.006038005],"category_scores_gemma":[0.012314478,0.00061487383,0.00073338026,0.0010446382,0.0029007888,0.0028511754,0.0031771935,0.0014702842,0.0010237532],"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.0018114053,0.00030743578,0.0017091937,0.0004603928,0.00009317567,0.00021345014,0.0009165719,0.48200724,0.08460415,0.14968486,0.003277542,0.27491465],"study_design_scores_gemma":[0.00020407734,0.00016834191,0.00030577905,0.000044173816,0.00006380277,0.00005324092,0.00012871562,0.87266797,0.055281147,0.06799519,0.0030469093,0.000040667823],"about_ca_topic_score_codex":0.0047732196,"about_ca_topic_score_gemma":0.0062414035,"teacher_disagreement_score":0.006038005,"about_ca_system_score_codex":0.0015985903,"about_ca_system_score_gemma":0.0027565619,"threshold_uncertainty_score":0.02019918},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25601825,0.0054171896,0.71315545,0.0010972744,0.00022714035,0.000105749205,0.00017465101,0.0014498484,0.022354515],"genre_scores_gemma":[0.9622625,0.0011126593,0.031207718,0.0001803688,0.00016052816,0.00008168109,0.0000939553,0.00020136566,0.004699235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976931,0.0008082138,0.00006368547,0.00022562315,0.0008717956,0.00033755123],"domain_scores_gemma":[0.9776912,0.01703553,0.0010055173,0.0014799089,0.0023031023,0.0004847546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070458516,0.0010852964,0.0009947972,0.0024822517,0.00074419664,0.002292968,0.0022376508,0.0011887855,0.003879332],"category_scores_gemma":[0.05089786,0.00047597275,0.0004781181,0.0017023351,0.0020181215,0.003652381,0.0019739508,0.0018871228,0.00038400828],"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.0007742778,0.00030933032,0.0041181766,0.0003596431,0.00014677545,0.00030312754,0.0006497267,0.5564247,0.015360613,0.34970543,0.0061658057,0.06568247],"study_design_scores_gemma":[0.000011496763,0.0000332004,0.00038430913,0.000026247726,0.000029408902,0.00005769686,0.000027256016,0.9762116,0.0015647665,0.021280572,0.00035884208,0.000014473215],"about_ca_topic_score_codex":0.00428232,"about_ca_topic_score_gemma":0.0028926313,"teacher_disagreement_score":0.0070458516,"about_ca_system_score_codex":0.003848974,"about_ca_system_score_gemma":0.0019023943,"threshold_uncertainty_score":0.03726244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8549368,0.00040584826,0.14173485,0.00009611247,0.000045382396,0.000040992618,0.00003749631,0.00046768747,0.0022349656],"genre_scores_gemma":[0.9945807,0.000053056534,0.005111354,0.0000087122635,0.00000870401,0.000005148223,0.0000114951345,0.000009321552,0.00021154739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989912,0.00041665233,0.000033615983,0.000080614715,0.00026009104,0.00021786639],"domain_scores_gemma":[0.9964302,0.002231345,0.00030426212,0.00039564344,0.0004648722,0.00017374915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013238726,0.00066371,0.00062920846,0.00040209905,0.00039881413,0.0007028731,0.000612714,0.000426819,0.00081126887],"category_scores_gemma":[0.004004028,0.0001586633,0.00015190536,0.00050542236,0.00059481885,0.0012844818,0.00095997,0.0003844388,0.000121497746],"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.0011389928,0.00037827122,0.004132237,0.00009339326,0.00007105961,0.00015660608,0.00009057305,0.8951564,0.03913463,0.0016091474,0.00039163002,0.057647005],"study_design_scores_gemma":[0.000020225614,0.00055648433,0.0013612404,0.0000033785664,0.00003916641,0.0000733482,0.00005226101,0.9816096,0.015535992,0.0006349528,0.00010377674,0.000009445506],"about_ca_topic_score_codex":0.0012587989,"about_ca_topic_score_gemma":0.0019924156,"teacher_disagreement_score":0.0013238726,"about_ca_system_score_codex":0.0006197374,"about_ca_system_score_gemma":0.00043733776,"threshold_uncertainty_score":0.0070014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95733917,0.00018348357,0.03916357,0.00019166025,0.000033157463,0.00006725598,0.00007532449,0.00023459514,0.0027117208],"genre_scores_gemma":[0.99823725,0.000023585673,0.0013411673,0.0000052147384,0.000005741823,0.0000069746516,0.000026990017,0.00000463145,0.0003484417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998509,0.0006043961,0.000067105015,0.0001665824,0.00024695753,0.00040593473],"domain_scores_gemma":[0.9959824,0.0021648773,0.00032718753,0.00018004954,0.0009881904,0.00035725263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026801839,0.00069318246,0.00090317824,0.0009098146,0.0010491922,0.0013636104,0.0008970855,0.00087711005,0.0023559749],"category_scores_gemma":[0.0038283751,0.00028395184,0.0006390918,0.0011149973,0.00082773244,0.0009949853,0.0006611257,0.0006549325,0.0001810747],"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.0010374753,0.00028788173,0.0042718183,0.000069145724,0.00006289543,0.00017916934,0.000060560407,0.97640663,0.0050124032,0.0025959762,0.0003919596,0.009624149],"study_design_scores_gemma":[0.000012221981,0.00021704429,0.0012571453,0.0000014279306,0.000023618639,0.000015257733,0.0000270811,0.99705136,0.001172516,0.00018321691,0.00003225263,0.000006918854],"about_ca_topic_score_codex":0.016485693,"about_ca_topic_score_gemma":0.004299839,"teacher_disagreement_score":0.016485693,"about_ca_system_score_codex":0.0024887447,"about_ca_system_score_gemma":0.0018236802,"threshold_uncertainty_score":0.032779455},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007516861,0.00004583028,0.9896624,0.00004181348,0.000040650684,0.000045540764,0.00008699381,0.0017807729,0.000779231],"genre_scores_gemma":[0.1430857,0.00008294818,0.8522241,0.00008642093,0.000039680122,0.00019241277,0.00026146285,0.00059747364,0.003429823],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988172,0.00025404186,0.00007051119,0.00020079817,0.0005314995,0.00012602928],"domain_scores_gemma":[0.99694115,0.0011669145,0.00023909965,0.0005075923,0.0010118561,0.00013331245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016901746,0.0011527801,0.0011996946,0.0024003591,0.0010734085,0.0015918352,0.0028986216,0.0013982174,0.0061631477],"category_scores_gemma":[0.010374025,0.00069649215,0.000780825,0.0024728994,0.0007315337,0.0026740143,0.0011171327,0.002435539,0.001954155],"study_design_candidate":"theoretical_or_conceptual","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.00055588747,0.00048604165,0.0059979255,0.00037253526,0.00025714483,0.0001968725,0.0006260809,0.39613184,0.037912864,0.11867109,0.0062916283,0.43250003],"study_design_scores_gemma":[0.000033140266,0.000041531704,0.0005234868,0.000010904639,0.000016781125,0.000046355388,0.000027577675,0.98468494,0.005263821,0.007527481,0.0017895567,0.000034463217],"about_ca_topic_score_codex":0.014635303,"about_ca_topic_score_gemma":0.014110961,"teacher_disagreement_score":0.014635303,"about_ca_system_score_codex":0.002015578,"about_ca_system_score_gemma":0.0025968712,"threshold_uncertainty_score":0.02910024},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16442798,0.0049175518,0.7750664,0.008668525,0.00060421106,0.00063672726,0.00048603836,0.0005811794,0.044611365],"genre_scores_gemma":[0.9170129,0.002120473,0.074588805,0.0005680646,0.0003463317,0.00017149985,0.00023181699,0.00021627717,0.0047438527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991206,0.0052365903,0.0003136852,0.00061022723,0.0012342822,0.0013991486],"domain_scores_gemma":[0.9670706,0.028639957,0.0006918677,0.0009234039,0.0019503629,0.00072389515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0125282975,0.0025108363,0.003263662,0.002273705,0.0014110006,0.004192872,0.002399746,0.002132418,0.008263067],"category_scores_gemma":[0.048796233,0.0010410537,0.0010481342,0.0021326758,0.0032364815,0.0055344217,0.002866698,0.0029058396,0.00045148164],"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.0005850613,0.00025216507,0.0006544642,0.00018791284,0.00006423095,0.00004391154,0.00010322141,0.9019023,0.0007457601,0.06731062,0.0034532847,0.02469697],"study_design_scores_gemma":[0.0000433432,0.00006095693,0.00018163856,0.000038342165,0.000027191569,0.000015080387,0.000084864456,0.95407045,0.000421271,0.044578046,0.00046825502,0.000010673831],"about_ca_topic_score_codex":0.010855175,"about_ca_topic_score_gemma":0.0069253477,"teacher_disagreement_score":0.0125282975,"about_ca_system_score_codex":0.007309626,"about_ca_system_score_gemma":0.0066754953,"threshold_uncertainty_score":0.06625676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75596535,0.0090503255,0.13373706,0.0034118053,0.00059020374,0.0005315094,0.011670314,0.010398335,0.07464522],"genre_scores_gemma":[0.9596687,0.0006968968,0.031087,0.00023713638,0.00011113712,0.00015422916,0.0027170156,0.0008016198,0.004526319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9841652,0.0042053596,0.00081382773,0.001613391,0.004401563,0.004800616],"domain_scores_gemma":[0.9415887,0.037703916,0.0034812074,0.007899008,0.0076253833,0.0017018508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009361381,0.002106903,0.001930473,0.002924348,0.0018127201,0.005153146,0.0033280712,0.0017869344,0.010480522],"category_scores_gemma":[0.03760803,0.0008324371,0.00085726246,0.004880225,0.0018548454,0.0054892953,0.0019619705,0.0016728537,0.0016688425],"study_design_candidate":"theoretical_or_conceptual","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.0037211182,0.00043391946,0.00284395,0.00037823094,0.00015023668,0.00012571001,0.00015215845,0.9266325,0.004959615,0.01582532,0.016356485,0.028420731],"study_design_scores_gemma":[0.00012074797,0.0003084257,0.0014187015,0.000044025313,0.00008026514,0.00009046538,0.00018664394,0.9849526,0.0050960425,0.0063783573,0.001277904,0.000045818346],"about_ca_topic_score_codex":0.027601628,"about_ca_topic_score_gemma":0.038450595,"teacher_disagreement_score":0.027601628,"about_ca_system_score_codex":0.009076434,"about_ca_system_score_gemma":0.009892692,"threshold_uncertainty_score":0.06585443},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08098613,0.00064835156,0.8969257,0.00021714099,0.00014744147,0.0002267957,0.00039715195,0.016313236,0.004138101],"genre_scores_gemma":[0.6584794,0.00017624977,0.33814716,0.00012738285,0.00005510885,0.00012697653,0.0005523273,0.00018783283,0.0021475398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680895,0.00055134937,0.0002572048,0.0007301716,0.0014419403,0.00021032403],"domain_scores_gemma":[0.9906613,0.004782646,0.0006515868,0.0009948272,0.0027293372,0.00018037109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002562567,0.00091032754,0.0014849154,0.003014541,0.00056220114,0.0015910283,0.0019936003,0.0011409573,0.002425415],"category_scores_gemma":[0.010881825,0.00036200017,0.00073829485,0.0011204674,0.0004946084,0.0012777415,0.0005801611,0.0010658767,0.0014326273],"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.00078826695,0.0005221368,0.00839822,0.00024319485,0.000149753,0.0003452725,0.00014337062,0.07331173,0.0312282,0.002470398,0.004612143,0.87778735],"study_design_scores_gemma":[0.000053268453,0.00018109089,0.0031569698,0.00002578797,0.0001053719,0.0001885806,0.000025399255,0.9697574,0.023182409,0.0021390705,0.0011537252,0.00003102387],"about_ca_topic_score_codex":0.0058302595,"about_ca_topic_score_gemma":0.004891054,"teacher_disagreement_score":0.0058302595,"about_ca_system_score_codex":0.0007518708,"about_ca_system_score_gemma":0.0011007908,"threshold_uncertainty_score":0.013552308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9759563,0.00015431804,0.016018055,0.00036896553,0.000037908914,0.0000841675,0.0002825634,0.00021653049,0.0068812133],"genre_scores_gemma":[0.99583375,0.00008129803,0.0026344708,0.000021569565,0.000006940502,0.000019742578,0.00012494673,0.000015278129,0.0012619203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959546,0.00015078606,0.000011312578,0.00005274112,0.000076536446,0.0001131717],"domain_scores_gemma":[0.99824154,0.0011045695,0.00010040999,0.000081422666,0.00028386473,0.00018818994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007261214,0.0008008838,0.00073109113,0.0008973911,0.0009106208,0.000986176,0.0013342096,0.0015862454,0.0022287245],"category_scores_gemma":[0.0020232708,0.00026986533,0.0005787555,0.00096438726,0.0007176573,0.00089005294,0.00063856516,0.0008585582,0.00019157099],"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.00008613429,0.00014856947,0.0027404241,0.000024745807,0.000015570442,0.00022418713,0.00008556005,0.99157566,0.00093753607,0.0014661057,0.0005360472,0.0021594684],"study_design_scores_gemma":[0.000007935348,0.000039481143,0.00044722488,0.0000023270304,0.000004846226,0.00001789471,0.000061038416,0.9988555,0.0002731136,0.00016795984,0.00011907148,0.0000036511456],"about_ca_topic_score_codex":0.045770545,"about_ca_topic_score_gemma":0.023178414,"teacher_disagreement_score":0.045770545,"about_ca_system_score_codex":0.002046012,"about_ca_system_score_gemma":0.0009201111,"threshold_uncertainty_score":0.091008306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09859396,0.0013295094,0.88643104,0.00097195315,0.00015791944,0.0001764291,0.00031318006,0.0007633066,0.011262619],"genre_scores_gemma":[0.83497435,0.0008789554,0.15468821,0.0002880267,0.00021816621,0.000314697,0.00040647024,0.00021212394,0.008018937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950923,0.002223494,0.00021059652,0.0005958914,0.001172045,0.0007057797],"domain_scores_gemma":[0.9839833,0.009797498,0.0011947297,0.0030304175,0.0011882137,0.0008058222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006765437,0.0016618789,0.0027195197,0.0018007023,0.001266839,0.004151039,0.003380506,0.002664347,0.0045543495],"category_scores_gemma":[0.030047957,0.00071019237,0.0013504068,0.002596386,0.0036937988,0.0055545927,0.0035324388,0.0029389479,0.0006839944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0009664993,0.00019364619,0.0010984748,0.00018209392,0.00010434281,0.0001295549,0.00021347652,0.27439845,0.0018675228,0.6729046,0.003515904,0.044425394],"study_design_scores_gemma":[0.000073396,0.0001188568,0.00019166432,0.000035769808,0.000029720119,0.000045712684,0.000031513504,0.804405,0.0010346868,0.1930083,0.0010036213,0.00002179565],"about_ca_topic_score_codex":0.0019697954,"about_ca_topic_score_gemma":0.0015336681,"teacher_disagreement_score":0.006765437,"about_ca_system_score_codex":0.0025583033,"about_ca_system_score_gemma":0.0028237633,"threshold_uncertainty_score":0.035779476},"labels":[],"label_agreement":null}]}