{"meta":{"query_hash":"7494d603d71a","filters":{"venue":"IEEE Transactions on Services Computing"},"cohort_total":91,"direct_labels_cover":1,"predictions_cover":91,"exported":91,"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/7494d603d71a","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Services+Computing"},"results":[{"id":"W1973467201","doi":"10.1109/tsc.2015.2402679","title":"An Integrated Semantic Web Service Discovery and Composition Framework","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mountain Equipment Co-operative","keywords":"Scalability; Service discovery; Web service; Semantic Web; Dependency graph; Service composition; Flexibility (engineering); Graph","score_opus":0.013589519723280855,"score_gpt":0.25266504590075495,"score_spread":0.2390755261774741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973467201","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.0014837716,0.00014444119,0.99425817,0.00026696225,0.000037728958,0.000095636,0.000043620308,0.00088463316,0.0027850263],"genre_scores_gemma":[0.06708971,0.00035889703,0.9293333,0.00017307195,0.000063083404,0.00016494383,0.0002674391,0.00014929583,0.0024002471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674904,0.0007536368,0.00018381914,0.0005251949,0.0015859784,0.000202322],"domain_scores_gemma":[0.999005,0.00026826956,0.000068204994,0.00027438215,0.00026934702,0.00011478217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032020085,0.0007505306,0.0009393624,0.00251513,0.0015223976,0.0024782103,0.0020772635,0.001517872,0.0021623045],"category_scores_gemma":[0.0026800768,0.0005572285,0.0014922702,0.002228306,0.0022370736,0.0037097686,0.0028649443,0.0019351137,0.0010872855],"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.000118633616,0.00018392918,0.0004477348,0.00022138836,0.00009771294,0.00044796846,0.0002890614,0.09799643,0.009825361,0.77994996,0.0036263133,0.106795646],"study_design_scores_gemma":[0.000045449557,0.0000662415,0.00020511025,0.000064773885,0.00007477004,0.000468581,0.00010057588,0.5430892,0.006924574,0.3865193,0.06238971,0.000051579093],"about_ca_topic_score_codex":0.005167278,"about_ca_topic_score_gemma":0.004366522,"teacher_disagreement_score":0.005167278,"about_ca_system_score_codex":0.0016681865,"about_ca_system_score_gemma":0.0041369274,"threshold_uncertainty_score":0.016934037},"labels":[],"label_agreement":null},{"id":"W1974304004","doi":"10.1109/tsc.2013.2295611","title":"Panda: Public Auditing for Shared Data with Efficient User Revocation in the Cloud","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":321,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Revocation; Cloud computing; Audit; Data integrity; Computer security; Data sharing; Database; Operating system; Overhead (engineering)","score_opus":0.04147783546398809,"score_gpt":0.27580631498820024,"score_spread":0.23432847952421215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974304004","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.12681034,0.0012842003,0.8299044,0.0014674856,0.00050466135,0.001054263,0.0004869684,0.03266724,0.0058204588],"genre_scores_gemma":[0.8898837,0.00021202333,0.105394475,0.00026342223,0.00010176299,0.0002042983,0.00037564524,0.00054739945,0.003017249],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98878187,0.0035024225,0.0010240203,0.0015985827,0.0033224118,0.0017705527],"domain_scores_gemma":[0.96654284,0.0037544342,0.0031959198,0.022480551,0.002531369,0.0014949283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069159684,0.00082277553,0.0017720686,0.0012312698,0.002547233,0.003811091,0.0042287013,0.001411383,0.0023902797],"category_scores_gemma":[0.015840268,0.00095601054,0.0010884564,0.0017831296,0.0025551345,0.009880266,0.009275175,0.0032654435,0.0009913953],"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.0075401426,0.0020815872,0.022090547,0.0009965169,0.0005663764,0.0022980985,0.0026782318,0.07829262,0.0806496,0.13014023,0.034713708,0.63795245],"study_design_scores_gemma":[0.0005220006,0.0005490999,0.0034824125,0.00012403652,0.00019846721,0.0013749646,0.00042849462,0.84526706,0.062663466,0.056173738,0.028941816,0.0002743569],"about_ca_topic_score_codex":0.0043692617,"about_ca_topic_score_gemma":0.0024263023,"teacher_disagreement_score":0.0069159684,"about_ca_system_score_codex":0.0021870066,"about_ca_system_score_gemma":0.007091857,"threshold_uncertainty_score":0.036575615},"labels":[],"label_agreement":null},{"id":"W2023794939","doi":"10.1109/tsc.2013.20","title":"Constructing a Global Social Service Network for Better Quality of Web Service Discovery","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Web service; World Wide Web; Service (business); Service design; Service discovery; Service level objective; Social network (sociolinguistics); Service delivery framework; Business; Social media; Marketing","score_opus":0.019090383315241027,"score_gpt":0.27187091329045615,"score_spread":0.2527805299752151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023794939","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.07040682,0.00023600135,0.9191574,0.000994678,0.00006344051,0.0003091957,0.000123365,0.00103397,0.007675134],"genre_scores_gemma":[0.5529894,0.0004218594,0.44293365,0.00017773439,0.0000642755,0.00033412143,0.000506651,0.0001667881,0.0024055378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820745,0.0008297624,0.00008599653,0.00026822032,0.00045616803,0.00015247168],"domain_scores_gemma":[0.997246,0.0010553964,0.00027123984,0.0006379929,0.0005514575,0.00023783262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031690612,0.000563764,0.0008488836,0.0025009399,0.001791767,0.0023034634,0.0008979209,0.0011832763,0.0019352371],"category_scores_gemma":[0.007639368,0.00035851728,0.0009558708,0.0024978383,0.0009926789,0.0052236626,0.0034254459,0.001137753,0.00063519855],"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.0004149095,0.0005644313,0.019777214,0.0004649665,0.00019538843,0.00078652677,0.002885584,0.21731465,0.03750654,0.26684707,0.008911191,0.4443316],"study_design_scores_gemma":[0.00005244515,0.00012518154,0.0027288797,0.00005031533,0.00012240188,0.00027898274,0.0011776693,0.85895264,0.009596272,0.100010015,0.026827104,0.000078045334],"about_ca_topic_score_codex":0.003989994,"about_ca_topic_score_gemma":0.0054192175,"teacher_disagreement_score":0.003989994,"about_ca_system_score_codex":0.0015300427,"about_ca_system_score_gemma":0.0027967095,"threshold_uncertainty_score":0.016759813},"labels":[],"label_agreement":null},{"id":"W2037386159","doi":"10.1109/tsc.2012.1","title":"THEMIS: A Mutually Verifiable Billing System for the Cloud Computing Environment","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"","keywords":"Cloud computing; Computer science; Public key infrastructure; Computer security; Verifiable secret sharing; Service provider; Public-key cryptography; Overhead (engineering); Service-level agreement; Computer network; Service (business); Encryption; Operating system; Business","score_opus":0.022204524394068455,"score_gpt":0.23758013135209646,"score_spread":0.21537560695802802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037386159","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.0853115,0.0011453299,0.77067345,0.0022671274,0.0009384932,0.0025833717,0.0017037527,0.092939764,0.042437203],"genre_scores_gemma":[0.7634136,0.00065325276,0.20657155,0.0006985851,0.00038723476,0.0008876657,0.0032235656,0.0022265639,0.021937978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667966,0.0006382664,0.0002475492,0.00026771097,0.0017061278,0.00046058508],"domain_scores_gemma":[0.9977806,0.00029936997,0.00042503688,0.0008323727,0.00034240432,0.0003201636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020554585,0.00076921086,0.0009276673,0.0010448423,0.0014551759,0.0028305373,0.0028179542,0.0009406175,0.006832175],"category_scores_gemma":[0.0044040103,0.0004653601,0.0006162717,0.0011155896,0.0010153822,0.0036388608,0.0037439438,0.002017003,0.0017654459],"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.0038603724,0.0009924095,0.010354093,0.0007911216,0.00030227244,0.0023144877,0.001395146,0.03472295,0.07506863,0.21362619,0.16559643,0.49097583],"study_design_scores_gemma":[0.0005850082,0.00078033423,0.0062426142,0.00013734904,0.00015756082,0.0016462414,0.00029616692,0.6145296,0.08859129,0.027687019,0.25907636,0.00027049548],"about_ca_topic_score_codex":0.0019363665,"about_ca_topic_score_gemma":0.0011919803,"teacher_disagreement_score":0.006832175,"about_ca_system_score_codex":0.0015619016,"about_ca_system_score_gemma":0.0032125087,"threshold_uncertainty_score":0.022855937},"labels":[],"label_agreement":null},{"id":"W2040237313","doi":"10.1109/tsc.2014.2378278","title":"Automatic Reuse of User Inputs to Services among End-Users in Service Composition","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Queen's University","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; International Business Machines Corporation","keywords":"Computer science; Reuse; Service composition; Service (business); Database; Web service; End user; World Wide Web","score_opus":0.005801873606714439,"score_gpt":0.22332165433924703,"score_spread":0.21751978073253259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040237313","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.19648027,0.00023940681,0.7750249,0.00022144549,0.00003096005,0.00075362046,0.000105813975,0.024320317,0.0028233454],"genre_scores_gemma":[0.6834318,0.00013381874,0.30957568,0.00014186729,0.000024120438,0.0002909809,0.00045242286,0.001426548,0.004522833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9858752,0.004751129,0.0010030657,0.0027718416,0.004733118,0.0008656489],"domain_scores_gemma":[0.97099847,0.0101604685,0.0023820086,0.010966183,0.0041683875,0.00132453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008626531,0.0023582433,0.0019362182,0.0026003243,0.0022138571,0.0027514766,0.0030313144,0.001890844,0.0014761582],"category_scores_gemma":[0.026350632,0.0016760255,0.0012881008,0.0019498485,0.001462557,0.0037137077,0.004745103,0.0019908207,0.0011647735],"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.0022620882,0.0016323368,0.060104676,0.00046172133,0.00046473878,0.0026348198,0.01096586,0.034484506,0.08917478,0.006015656,0.002593679,0.78920513],"study_design_scores_gemma":[0.0001650545,0.000694441,0.023204044,0.0002141512,0.0006210147,0.0018767888,0.0028773872,0.70814556,0.22654632,0.016529415,0.018765153,0.00036063668],"about_ca_topic_score_codex":0.011568516,"about_ca_topic_score_gemma":0.012046666,"teacher_disagreement_score":0.011568516,"about_ca_system_score_codex":0.0014571026,"about_ca_system_score_gemma":0.0038583167,"threshold_uncertainty_score":0.04562205},"labels":[],"label_agreement":null},{"id":"W2058335745","doi":"10.1109/tsc.2013.19","title":"Computing Refined Ordering Relations with Uncertainty for Acyclic Process Models","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Concurrency; Theoretical computer science; Mathematical proof; Task (project management); Process (computing); Transitive relation; Computation; Algorithm; Programming language; Mathematics","score_opus":0.018489162972700743,"score_gpt":0.23243932110424848,"score_spread":0.21395015813154772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058335745","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.018798152,0.000049340477,0.97987807,0.000058154586,0.0000068899203,0.00006505543,0.00013180015,0.0005283363,0.0004842411],"genre_scores_gemma":[0.23800144,0.00019426901,0.75933695,0.00005839269,0.000023346378,0.00012625071,0.0011341227,0.0001940444,0.00093110447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968177,0.0007350103,0.00028119975,0.0006705518,0.0011756469,0.00031982322],"domain_scores_gemma":[0.99222285,0.004962746,0.0006261389,0.0012442963,0.00079495047,0.00014896417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026530658,0.0011157135,0.0009648651,0.0024279463,0.001083453,0.0016384989,0.0013299,0.00090050034,0.0023517446],"category_scores_gemma":[0.018166654,0.0010172452,0.0025262511,0.0019161616,0.0017952952,0.0054905475,0.002719318,0.0020061915,0.00033029597],"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.00016346952,0.00008898335,0.0027219432,0.00022559805,0.00009007503,0.00033007708,0.0005862354,0.67762804,0.0078324815,0.19670933,0.0011744768,0.11244939],"study_design_scores_gemma":[0.000016215581,0.000026113943,0.00023434128,0.000017020027,0.000030241175,0.000044571017,0.00005957093,0.8375156,0.00429629,0.15653597,0.0012023284,0.000021693631],"about_ca_topic_score_codex":0.010736935,"about_ca_topic_score_gemma":0.011608802,"teacher_disagreement_score":0.010736935,"about_ca_system_score_codex":0.0018944803,"about_ca_system_score_gemma":0.0023948494,"threshold_uncertainty_score":0.021348894},"labels":[],"label_agreement":null},{"id":"W2064170343","doi":"10.1109/tsc.2012.15","title":"Simulating Service-Oriented Systems: A Survey and the Services-Aware Simulation Framework","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates - Technology Futures","keywords":"Computer science; Software deployment; Service-oriented architecture; Distributed computing; Service (business); Software engineering; Software architecture; Systems engineering; Software; Web service; Operating system; World Wide Web","score_opus":0.012622777922012107,"score_gpt":0.24854596806139195,"score_spread":0.23592319013937985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064170343","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010634146,0.13619003,0.8298576,0.0019384908,0.00030898317,0.0002180384,0.0003422909,0.0014359101,0.01907453],"genre_scores_gemma":[0.16700178,0.3928745,0.43236637,0.0006343749,0.0009089402,0.0005263943,0.0012039699,0.00050778897,0.0039758678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984434,0.00057329895,0.00015236222,0.00014636622,0.0005897513,0.00009479241],"domain_scores_gemma":[0.99735653,0.0018953864,0.00010909644,0.00018423348,0.00037158094,0.000083223276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022814057,0.0012473791,0.0017548616,0.0033070415,0.0006398156,0.0022320165,0.001955866,0.0015711803,0.0014361138],"category_scores_gemma":[0.005086698,0.0008566341,0.0014640536,0.005639868,0.0013145355,0.0033783922,0.0011181474,0.0015532795,0.0007020041],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008442026,0.00019139209,0.0054712836,0.0029540453,0.00017788034,0.00022942206,0.00056209695,0.41066247,0.0021389637,0.24375989,0.008197967,0.3255702],"study_design_scores_gemma":[0.000026683343,0.00012473576,0.0010634124,0.0011043423,0.00009004383,0.0004651512,0.00035151394,0.65571487,0.0022501345,0.13492373,0.20378423,0.00010112764],"about_ca_topic_score_codex":0.008642875,"about_ca_topic_score_gemma":0.005388609,"teacher_disagreement_score":0.008642875,"about_ca_system_score_codex":0.0018747331,"about_ca_system_score_gemma":0.0022778248,"threshold_uncertainty_score":0.017185152},"labels":[],"label_agreement":null},{"id":"W2078852715","doi":"10.1109/tsc.2015.2413111","title":"CCCloud: Context-Aware and Credible Cloud Service Selection Based on Subjective Assessment and Objective Assessment","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Wollongong; University of Victoria","keywords":"Cloud computing; Computer science; Context (archaeology); Collusion; Credibility; Cloud testing; Data mining; Selection (genetic algorithm); Benchmark (surveying); Machine learning; Cloud computing security","score_opus":0.025550157773642064,"score_gpt":0.29224835816385336,"score_spread":0.2666982003902113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078852715","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.07692055,0.0008874121,0.911971,0.00082613225,0.0001065972,0.00049404317,0.00020954883,0.0009451441,0.007639611],"genre_scores_gemma":[0.9280609,0.00021993766,0.069952644,0.00014408864,0.00006471794,0.00018559665,0.00015725088,0.000039871335,0.0011750301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944554,0.0018458151,0.00035469656,0.0009778591,0.0019969195,0.00036925878],"domain_scores_gemma":[0.99350244,0.0027839437,0.0010511959,0.0005581401,0.0015991981,0.00050497893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036621632,0.0013441355,0.0012050052,0.0020453988,0.0009957341,0.0029710312,0.002007496,0.0010849905,0.0011160583],"category_scores_gemma":[0.013021036,0.00052302587,0.0009633344,0.0014534647,0.0009889515,0.0040724194,0.0025051439,0.0016266628,0.0002600706],"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.0008741577,0.0006977992,0.037523616,0.0005671869,0.00048696817,0.001055817,0.001608049,0.5969468,0.011220977,0.048109304,0.005783864,0.29512542],"study_design_scores_gemma":[0.000020187541,0.00008983357,0.0024378335,0.000028963574,0.00006483447,0.00010665183,0.00010701189,0.986853,0.0010355231,0.0078525925,0.0013493671,0.00005422892],"about_ca_topic_score_codex":0.011687225,"about_ca_topic_score_gemma":0.010834708,"teacher_disagreement_score":0.011687225,"about_ca_system_score_codex":0.0024199306,"about_ca_system_score_gemma":0.0025651788,"threshold_uncertainty_score":0.02323836},"labels":[],"label_agreement":null},{"id":"W2082897135","doi":"10.1109/tsc.2015.2401833","title":"An Efficient Approach to Generating Location-Sensitive Recommendations in Ad-hoc Social Network Environments","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Seventh Framework Programme; National Natural Science Foundation of China","keywords":"Computer science; Recommender system; Bipartite graph; Social network (sociolinguistics); Information retrieval; Graph; Set (abstract data type); Similarity (geometry); Collaborative filtering; Data mining; World Wide Web; Artificial intelligence; Social media; Theoretical computer science","score_opus":0.03243849047183832,"score_gpt":0.2751093813230916,"score_spread":0.24267089085125326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082897135","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.01396199,0.00021053664,0.98352057,0.00011185058,0.000043474956,0.00020524536,0.0001809837,0.00083757914,0.0009277188],"genre_scores_gemma":[0.4225956,0.00038458547,0.57210714,0.00010945591,0.00010877752,0.00038296668,0.0009252812,0.00006275677,0.003323576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756134,0.00062654755,0.00016061703,0.000507374,0.000981893,0.00016220206],"domain_scores_gemma":[0.99718803,0.0011369734,0.00023735745,0.0005715988,0.0007542715,0.00011174302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013636799,0.0011270054,0.0016356036,0.0024210531,0.0014157939,0.0010411013,0.0031964108,0.0015182776,0.0012913696],"category_scores_gemma":[0.006237717,0.00081611256,0.0011398825,0.0034153634,0.0005432537,0.0022483093,0.0015991939,0.0009260755,0.0011150095],"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.00031282238,0.00035730453,0.005773475,0.00027699655,0.0002538054,0.0005466474,0.00038187698,0.5992117,0.008510144,0.01883139,0.0065150736,0.3590288],"study_design_scores_gemma":[0.000009402599,0.000043479005,0.0002804573,0.0000049091977,0.000015698335,0.00009930997,0.00003751922,0.9941346,0.0010819375,0.0034025926,0.00087940594,0.000010768944],"about_ca_topic_score_codex":0.0095234215,"about_ca_topic_score_gemma":0.015341603,"teacher_disagreement_score":0.0095234215,"about_ca_system_score_codex":0.0008699757,"about_ca_system_score_gemma":0.0011091437,"threshold_uncertainty_score":0.018935978},"labels":[],"label_agreement":null},{"id":"W2087492381","doi":"10.1109/tsc.2011.10","title":"Runtime Enforcement of Web Service Message Contracts with Data","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Stateful firewall; Web service; XML; Programming language; Overhead (engineering); Java applet; SOAP; Database transaction; Database; Algorithm; Computer network; Java; Operating system","score_opus":0.03238225192993553,"score_gpt":0.2371036943777905,"score_spread":0.20472144244785495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087492381","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.096954845,0.000112072616,0.86437505,0.00042893787,0.00008088825,0.00041504894,0.00025983766,0.03384695,0.0035263149],"genre_scores_gemma":[0.63801646,0.00008808388,0.35076377,0.00031581268,0.00006116131,0.00041775088,0.0007678696,0.0042038443,0.005365209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98533326,0.0033679754,0.0014536214,0.0018244517,0.006709466,0.0013113228],"domain_scores_gemma":[0.97337973,0.0113079,0.0023044155,0.008857205,0.0034091142,0.00074156496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011208752,0.0012167825,0.0011681875,0.0011342235,0.0014324766,0.0041292026,0.0029297445,0.0015095967,0.0022508511],"category_scores_gemma":[0.032896567,0.0013176277,0.0012274437,0.00078753644,0.002647292,0.0046491837,0.004539649,0.0032920062,0.00074406405],"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.0028047028,0.00136878,0.020072436,0.00076272705,0.00029619766,0.002008319,0.0046331473,0.17485419,0.15528262,0.23453152,0.011927366,0.39145797],"study_design_scores_gemma":[0.00013362257,0.00012709586,0.00081679696,0.000068024914,0.000052923268,0.00018070944,0.00015910972,0.8371088,0.11613187,0.034171365,0.010955661,0.00009402042],"about_ca_topic_score_codex":0.0056921835,"about_ca_topic_score_gemma":0.0038254391,"teacher_disagreement_score":0.011208752,"about_ca_system_score_codex":0.0024459022,"about_ca_system_score_gemma":0.0040314496,"threshold_uncertainty_score":0.05927831},"labels":[],"label_agreement":null},{"id":"W2096563975","doi":"10.1109/tsc.2011.27","title":"Parallel Mapping with Time Optimization for SLA-Aware Compositional Services in the Business Grid","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Workflow; Bottleneck; Grid; Distributed computing; Speedup; Grid computing; Execution time; Response time; Parallel computing; Real-time computing; Database; Operating system; Embedded system","score_opus":0.021410648064671765,"score_gpt":0.21741426691395452,"score_spread":0.19600361884928275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096563975","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.04432591,0.0002010243,0.9513448,0.00020496473,0.00005401999,0.00008562595,0.000026822136,0.001488819,0.0022680184],"genre_scores_gemma":[0.48123232,0.00015343477,0.5161127,0.00006739239,0.000033833257,0.00012818073,0.00008835976,0.0002507041,0.0019330999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913675,0.00032237393,0.00004336987,0.00011259045,0.0002650064,0.00011999888],"domain_scores_gemma":[0.9992956,0.00032320528,0.0000764536,0.00012869172,0.00011820684,0.000057864072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012977781,0.00075480656,0.00088556984,0.0006299996,0.0011579264,0.0010576285,0.0009401965,0.00064546993,0.0018844331],"category_scores_gemma":[0.0025102454,0.0003619565,0.00063620426,0.0008938828,0.00069543556,0.0011959033,0.0013066055,0.0009293792,0.00040928353],"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.00036669156,0.00018030086,0.0007377812,0.0001002763,0.00003840746,0.000104988685,0.00014657713,0.82944226,0.015555482,0.01610904,0.0016195084,0.1355987],"study_design_scores_gemma":[0.00001946071,0.000017836363,0.000073131945,0.0000017838073,0.000005861018,0.000017523851,0.000019732306,0.98999923,0.0028262571,0.0064066187,0.00060689053,0.0000057076277],"about_ca_topic_score_codex":0.0063131857,"about_ca_topic_score_gemma":0.005933406,"teacher_disagreement_score":0.0063131857,"about_ca_system_score_codex":0.0011001754,"about_ca_system_score_gemma":0.0020602362,"threshold_uncertainty_score":0.012552857},"labels":[],"label_agreement":null},{"id":"W2118448117","doi":"10.1109/tsc.2010.44","title":"An Adaptive and Intelligent SLA Negotiation System for Web Services","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Negotiation; Service-level agreement; Quality of service; Function (biology); Web service; Service level; Service (business); Service provider; Process management; World Wide Web; Computer network; Business; Marketing","score_opus":0.01553146166447645,"score_gpt":0.2549581396855782,"score_spread":0.23942667802110174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118448117","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.03491498,0.00013254122,0.95200217,0.00024839066,0.000069357506,0.00027535533,0.000046391957,0.008246119,0.004064642],"genre_scores_gemma":[0.6328375,0.00013730052,0.36182362,0.00013865704,0.000053562173,0.0002747615,0.00023122656,0.00026437582,0.004239067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994111,0.00016322972,0.00005675848,0.00010327634,0.00020704187,0.000058590464],"domain_scores_gemma":[0.9993753,0.00018206926,0.000068164205,0.00010715984,0.00016854977,0.000098776596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001345649,0.00033897217,0.00050680764,0.00044091046,0.00095783,0.001166018,0.0014000383,0.0008058712,0.0028399266],"category_scores_gemma":[0.0028970288,0.00027868355,0.0003060449,0.0003943938,0.0005583538,0.0019462206,0.0011491341,0.0009234472,0.00089880044],"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.0019711994,0.00091014476,0.002992509,0.00027112922,0.00015357083,0.001042399,0.0010679684,0.17021108,0.12799464,0.06650896,0.020014985,0.60686135],"study_design_scores_gemma":[0.00010202708,0.000112786984,0.00028907548,0.000010466769,0.000027537082,0.00014359462,0.00005768061,0.9704524,0.012604072,0.00696467,0.009201886,0.000033826836],"about_ca_topic_score_codex":0.003275832,"about_ca_topic_score_gemma":0.002150239,"teacher_disagreement_score":0.003275832,"about_ca_system_score_codex":0.0007801611,"about_ca_system_score_gemma":0.0012973006,"threshold_uncertainty_score":0.009500504},"labels":[],"label_agreement":null},{"id":"W2130540915","doi":"10.1109/tsc.2012.17","title":"Guest Editorial: Special Section on Enforcement and Management in Services Computing","year":2012,"lang":"en","type":"editorial","venue":"IEEE Transactions on Services Computing","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Massey University; Technische Universität Clausthal; National University of Singapore","keywords":"Computer science; Special section; Enforcement; Section (typography); Computer security; Operating system; Political science","score_opus":0.035666100485040174,"score_gpt":0.3379805660187294,"score_spread":0.30231446553368924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130540915","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.000057483532,0.0052322834,0.00023053927,0.025487807,0.96792656,0.00001544209,0.000027300368,0.00003238139,0.0009902461],"genre_scores_gemma":[0.00057583407,0.0052917576,0.00015653165,0.009112144,0.9789899,0.000014341901,0.000025896523,0.0000347198,0.0057989312],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944951,0.0008051235,0.0008449998,0.00069890625,0.00274175,0.000414044],"domain_scores_gemma":[0.9726962,0.008727814,0.0015658326,0.00053332624,0.012642246,0.0038344963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006173425,0.0025850406,0.002456622,0.0036820285,0.0022297068,0.0076253726,0.002449545,0.009412874,0.012270287],"category_scores_gemma":[0.019570157,0.0007253776,0.002194643,0.0015025889,0.0021403236,0.0040381234,0.0011689529,0.01207929,0.008113415],"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.000041304043,0.000020341782,0.000050568808,0.0003121323,0.00001588989,0.000184688,0.000023354109,0.00003731741,0.00011671343,0.00058267324,0.9903916,0.008223387],"study_design_scores_gemma":[0.000033975502,0.00004971868,0.00030903335,0.00043810083,0.000047280202,0.0004784291,0.000061057704,0.00023477146,0.00022965079,0.0010436128,0.9970541,0.00002016448],"about_ca_topic_score_codex":0.00084272906,"about_ca_topic_score_gemma":0.0020515528,"teacher_disagreement_score":0.012270287,"about_ca_system_score_codex":0.0026758371,"about_ca_system_score_gemma":0.0030341188,"threshold_uncertainty_score":0.04104823},"labels":[],"label_agreement":null},{"id":"W2283608423","doi":"10.1109/tsc.2015.2497705","title":"Deep Computation Model for Unsupervised Feature Learning on Big Data","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":151,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Deep learning; Artificial intelligence; Feature vector; Big data; Tensor (intrinsic definition); Data modeling; Feature (linguistics); Pattern recognition (psychology); Autoencoder; Computation; Feature learning; Machine learning; Data mining; Algorithm; Mathematics","score_opus":0.1697865211088342,"score_gpt":0.35584263707734565,"score_spread":0.18605611596851146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283608423","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.0045887153,0.00011413689,0.99422956,0.00016656815,0.000024950376,0.000017886445,0.00007603359,0.00041729596,0.00036482222],"genre_scores_gemma":[0.50363755,0.00081992534,0.48899943,0.0002958461,0.000119404234,0.00035055118,0.0010172122,0.00023236712,0.004527721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993777,0.00013285564,0.000051893025,0.00016031717,0.00020180685,0.00007534092],"domain_scores_gemma":[0.99891293,0.00041290792,0.00010541338,0.00022508527,0.00029863947,0.000044992634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107954,0.0009362003,0.000888683,0.00066381623,0.0004136683,0.0010102976,0.0017050058,0.00070779445,0.0013489332],"category_scores_gemma":[0.003373283,0.00042363975,0.0009530054,0.0012864609,0.00090425333,0.0025543314,0.0012054616,0.0023256803,0.00054387905],"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.000108951506,0.00008647004,0.0013716425,0.00009772955,0.00007766642,0.000102615326,0.0000865944,0.79892075,0.0032892835,0.051286586,0.0041202814,0.14045134],"study_design_scores_gemma":[0.0000017144257,0.000007456045,0.000052108226,0.000001632136,0.0000025250008,0.0000060990474,0.00000200679,0.9911528,0.00036789844,0.008112413,0.00029099718,0.0000023760283],"about_ca_topic_score_codex":0.008193914,"about_ca_topic_score_gemma":0.010138548,"teacher_disagreement_score":0.008193914,"about_ca_system_score_codex":0.0013252534,"about_ca_system_score_gemma":0.0016650051,"threshold_uncertainty_score":0.016292453},"labels":[],"label_agreement":null},{"id":"W2293605201","doi":"10.1109/tsc.2015.2480396","title":"Hybrid Optimization Algorithm for Large-Scale QoS-Aware Service Composition","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mountain Equipment Co-operative","keywords":"Computer science; Quality of service; Service composition; Algorithm; Scale (ratio); Distributed computing; Computer network","score_opus":0.014085813228583807,"score_gpt":0.24583590862184798,"score_spread":0.2317500953932642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293605201","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.006095835,0.00013244424,0.9918813,0.000048380778,0.000014923057,0.000040869236,0.000032326094,0.000761664,0.0009922539],"genre_scores_gemma":[0.1726669,0.0001303532,0.82449245,0.00010668471,0.000024202815,0.0002958121,0.00027794973,0.0002924479,0.0017132156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916196,0.00026225927,0.000050767296,0.00018392774,0.00025960561,0.00008146432],"domain_scores_gemma":[0.99915266,0.0005766787,0.000064059765,0.000068565314,0.00010954513,0.0000284128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014135083,0.0016772219,0.001201711,0.001499438,0.0006991856,0.0008879199,0.0011306916,0.0012434064,0.0029390473],"category_scores_gemma":[0.0018850907,0.0007150474,0.0012753627,0.0014535036,0.00071028987,0.0010609734,0.0011577951,0.0011691911,0.00075731165],"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.00011263033,0.00007846827,0.00041803572,0.000076827215,0.00008881069,0.00004126966,0.000047029513,0.90916014,0.0035021184,0.006089305,0.0010570773,0.079328395],"study_design_scores_gemma":[0.000009923263,0.000012925243,0.000033481883,0.0000024324406,0.000006178246,0.000006774717,0.0000051368706,0.9975305,0.0004156176,0.0016843932,0.00028999505,0.0000026894354],"about_ca_topic_score_codex":0.004874423,"about_ca_topic_score_gemma":0.0056832256,"teacher_disagreement_score":0.004874423,"about_ca_system_score_codex":0.0010098048,"about_ca_system_score_gemma":0.0014484457,"threshold_uncertainty_score":0.009832084},"labels":[],"label_agreement":null},{"id":"W2318815583","doi":"10.1109/tsc.2016.2547518","title":"Guest Editorial: Special Issue on Cyber-Physical Systems and Services","year":2016,"lang":"en","type":"editorial","venue":"IEEE Transactions on Services Computing","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cyber-physical system; Computer science; Variety (cybernetics); Data science; Computer security; Software; Software deployment; Analytics; Event (particle physics); Special section; Command and control; Distributed computing; Software engineering; Artificial intelligence; Telecommunications","score_opus":0.026348573606304895,"score_gpt":0.33940751318121226,"score_spread":0.3130589395749074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318815583","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.000027680098,0.004797063,0.00013745893,0.01902409,0.97407305,0.00001333076,0.000044554134,0.000041392763,0.0018415127],"genre_scores_gemma":[0.000380762,0.0050547896,0.0000894691,0.008836565,0.97713125,0.000013368955,0.000038410886,0.000036856763,0.008418438],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966216,0.00036321464,0.0003723628,0.0005143112,0.0018346685,0.000293961],"domain_scores_gemma":[0.9892936,0.0033403034,0.000739432,0.00030713633,0.004231055,0.0020885011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037460844,0.0035910695,0.0034694227,0.002683177,0.0023893951,0.008275875,0.0027290145,0.010845798,0.0245653],"category_scores_gemma":[0.01251317,0.0009265799,0.002221791,0.0013500847,0.0022010943,0.0051643196,0.0017235399,0.018241318,0.019416546],"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.000029386363,0.000012568686,0.000026334934,0.00015836729,0.000010873121,0.00010075274,0.000007558675,0.000028172006,0.000057123194,0.00041897895,0.9934902,0.0056597805],"study_design_scores_gemma":[0.00003183337,0.000025223222,0.00017715091,0.00028397917,0.000022562519,0.00025828404,0.00002410161,0.00013199144,0.000096710595,0.00096083764,0.9979748,0.000012479424],"about_ca_topic_score_codex":0.0008075059,"about_ca_topic_score_gemma":0.0023124018,"teacher_disagreement_score":0.0245653,"about_ca_system_score_codex":0.0023693251,"about_ca_system_score_gemma":0.002249317,"threshold_uncertainty_score":0.08217913},"labels":[],"label_agreement":null},{"id":"W2321314104","doi":"10.1109/tsc.2015.2426185","title":"Trust and Reputation of Web Services Through QoS Correlation Lens","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reputation; Quality of service; Web service; Service (business); Service provider; WS-Policy; Selection (genetic algorithm); Mobile QoS; World Wide Web; Data mining; Computer network; Web application security; Machine learning; Web development","score_opus":0.018353332843906413,"score_gpt":0.2458715172939186,"score_spread":0.22751818445001218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321314104","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.12722453,0.0009778375,0.8587227,0.001385273,0.00007302946,0.00007435998,0.00008692925,0.0006920693,0.010763211],"genre_scores_gemma":[0.96366066,0.00018893393,0.03455524,0.00004258287,0.000042041756,0.000021158983,0.00003317765,0.00003610265,0.0014200701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651057,0.0013955827,0.00017063582,0.00046849973,0.0011991328,0.00025562412],"domain_scores_gemma":[0.989218,0.0052966364,0.0020582583,0.0012522613,0.0017060371,0.0004688404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031136554,0.0005984514,0.000856955,0.001867087,0.0009677011,0.0034462824,0.00084294664,0.0009671513,0.0011551253],"category_scores_gemma":[0.01952219,0.00050449773,0.00065687473,0.0016684884,0.0016547132,0.0058632256,0.0016572863,0.0016725225,0.00033281647],"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.0005220943,0.00020384199,0.015996875,0.00017541117,0.00019513686,0.0006391833,0.0011304572,0.40129423,0.009002169,0.3902379,0.0036890977,0.17691363],"study_design_scores_gemma":[0.0000112467615,0.000028788936,0.001413048,0.00001256837,0.000027170523,0.00011349234,0.00007467695,0.95087224,0.0018981864,0.044234958,0.0012829956,0.000030571868],"about_ca_topic_score_codex":0.0060533835,"about_ca_topic_score_gemma":0.0042950218,"teacher_disagreement_score":0.0060533835,"about_ca_system_score_codex":0.002793796,"about_ca_system_score_gemma":0.0017498286,"threshold_uncertainty_score":0.020270467},"labels":[],"label_agreement":null},{"id":"W2484289073","doi":"10.1109/tsc.2016.2594778","title":"Performance Evaluation and Optimization of Multi-dimensional Indexes in Hive","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; Bitmap; Search engine indexing; Inverted index; Index (typography); Skew; Database; Data mining; Information retrieval; Aggregate (composite); Query optimization; Data warehouse; Computer graphics (images); World Wide Web","score_opus":0.017646425687342877,"score_gpt":0.24872102464698734,"score_spread":0.23107459895964447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484289073","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.9063575,0.005251185,0.057371747,0.000631931,0.0002773969,0.00048327463,0.002152029,0.020628765,0.006846188],"genre_scores_gemma":[0.85823995,0.0008357069,0.13499852,0.00015950088,0.000056537374,0.00018790785,0.0036858702,0.0005191799,0.0013167196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910136,0.0017250424,0.0012980492,0.0011771313,0.003556952,0.0012292819],"domain_scores_gemma":[0.9758965,0.013346327,0.0009422972,0.004662448,0.004315686,0.0008367252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007232195,0.0018003988,0.0024756158,0.00277797,0.0020139234,0.0037197056,0.0045095547,0.0016146316,0.0017071983],"category_scores_gemma":[0.026182367,0.00086819817,0.001023996,0.008124935,0.0013029887,0.0067166616,0.0024963845,0.0010705419,0.0005426738],"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.0070601907,0.003323958,0.03213278,0.0013740845,0.0008138375,0.00065984146,0.0008225435,0.5932455,0.06197165,0.0073641525,0.02000829,0.27122322],"study_design_scores_gemma":[0.000249519,0.0007112746,0.0038317186,0.000017931801,0.0000733388,0.00017322373,0.00026572385,0.95619196,0.03535171,0.0008827929,0.0021659213,0.0000849004],"about_ca_topic_score_codex":0.01261909,"about_ca_topic_score_gemma":0.008059319,"teacher_disagreement_score":0.01261909,"about_ca_system_score_codex":0.00241116,"about_ca_system_score_gemma":0.0027631025,"threshold_uncertainty_score":0.038247943},"labels":[],"label_agreement":null},{"id":"W2525723988","doi":"10.1109/tsc.2015.2444845","title":"Energy Efficient Scheduling and Management for Large-Scale Services Computing Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Energy consumption; Efficient energy use; Distributed computing; Scheduling (production processes); Quality of service; Queue; Computer network; Mathematical optimization","score_opus":0.014716591440027814,"score_gpt":0.23685432001525716,"score_spread":0.22213772857522934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525723988","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.057442326,0.00062252814,0.93827224,0.0005295598,0.00006674381,0.00011204593,0.00003482088,0.0005274608,0.0023922676],"genre_scores_gemma":[0.9346595,0.00024121266,0.063690186,0.000059674723,0.000049109745,0.00007810034,0.000039231825,0.000047189664,0.0011358614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941456,0.00015211255,0.000033182998,0.00010905072,0.00019916522,0.00009179262],"domain_scores_gemma":[0.9991622,0.00037541005,0.00015688248,0.00008160571,0.00013019903,0.00009374968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008983193,0.0006399095,0.0007455962,0.00041499737,0.0011980691,0.0011264408,0.0011422395,0.0006023808,0.00092646823],"category_scores_gemma":[0.00194706,0.00021495558,0.00030054385,0.0007511474,0.00065312895,0.0010011742,0.0010738611,0.00069404487,0.00019886035],"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.000113095906,0.00010413012,0.0005574809,0.00006864057,0.000024195988,0.000086947664,0.000089632245,0.9200178,0.009890065,0.010891622,0.0014102644,0.056746114],"study_design_scores_gemma":[0.0000046218493,0.000011405722,0.00006274069,0.0000010934554,0.0000020488783,0.0000075832695,0.000012585181,0.9970765,0.0004875981,0.0021115707,0.00021997048,0.0000022001957],"about_ca_topic_score_codex":0.0042637135,"about_ca_topic_score_gemma":0.005782124,"teacher_disagreement_score":0.0042637135,"about_ca_system_score_codex":0.0013969244,"about_ca_system_score_gemma":0.0015153324,"threshold_uncertainty_score":0.010135472},"labels":[],"label_agreement":null},{"id":"W2526915519","doi":"10.1109/tsc.2015.2449850","title":"Using π-calculus for Formal Modeling and Verification of WS-CDL Choreographies","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Health Economics","funders":"","keywords":"Correctness; Computer science; Choreography; Programming language; Workflow; Orchestration; Web service; Formal verification; Promela; Model checking; Software engineering; Formal methods; Modeling language; Process calculus; Formal specification; Database; Software","score_opus":0.048818088645917926,"score_gpt":0.28318874223366913,"score_spread":0.23437065358775122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526915519","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.003985855,0.00006687338,0.9931632,0.000098277436,0.000043891403,0.00007979429,0.000044727556,0.0007886075,0.0017287595],"genre_scores_gemma":[0.2485211,0.0005875778,0.7458641,0.00016847589,0.00006711422,0.0005842582,0.00023153664,0.00034402398,0.0036319112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634844,0.001038689,0.00035384874,0.00040535507,0.0015068331,0.0003468657],"domain_scores_gemma":[0.9962042,0.0021647546,0.00037293934,0.00066196424,0.0004890416,0.00010714089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00475049,0.0006653729,0.0006876509,0.0010908091,0.0015731555,0.0026378778,0.0017583133,0.0010255675,0.0018509993],"category_scores_gemma":[0.009176691,0.00083218375,0.0021819386,0.0008308055,0.0034224452,0.0028276101,0.0020984765,0.002256038,0.00045728846],"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.00009307859,0.00010883641,0.0014921136,0.00027939657,0.00007976847,0.00087294646,0.00083075406,0.19489452,0.01160738,0.7577326,0.0012189884,0.030789532],"study_design_scores_gemma":[0.00009497229,0.000064752196,0.0002734653,0.00013131047,0.00009721364,0.00021284117,0.00011658674,0.693845,0.023177058,0.25668678,0.025221886,0.000078211306],"about_ca_topic_score_codex":0.01129933,"about_ca_topic_score_gemma":0.007394119,"teacher_disagreement_score":0.01129933,"about_ca_system_score_codex":0.0020042707,"about_ca_system_score_gemma":0.0064389473,"threshold_uncertainty_score":0.025123298},"labels":[],"label_agreement":null},{"id":"W2564298646","doi":"10.1109/tsc.2016.2638900","title":"A Hybrid Approach for Optimizing Carbon Footprint in InterCloud Environment","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Carbon footprint; Computer science; Maximization; Workload; Mathematical optimization; Greenhouse gas; Virtual machine; Distributed computing; Data center; Real-time computing; Computer network; Mathematics","score_opus":0.014238453778661333,"score_gpt":0.2144628788867706,"score_spread":0.20022442510810926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564298646","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.022495754,0.0003423727,0.9727121,0.00012577962,0.000041367108,0.000052577412,0.00004610862,0.00023732729,0.003946577],"genre_scores_gemma":[0.5860513,0.00043196697,0.4089873,0.00012821524,0.000056568977,0.00022897527,0.00014843061,0.00013875966,0.0038284736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996476,0.00008301765,0.0000102253825,0.00006972883,0.00011675243,0.00007262671],"domain_scores_gemma":[0.9998128,0.000078243625,0.00001801731,0.000026244223,0.000045584296,0.00001924536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004921786,0.001055177,0.00095008704,0.0007692596,0.00043337155,0.0010062889,0.0014030421,0.0011377995,0.0022043902],"category_scores_gemma":[0.0006144125,0.00036823825,0.00070032786,0.001144619,0.00040883353,0.0011395105,0.00082284416,0.0006397692,0.00029801327],"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.0000374621,0.00006780005,0.00025620678,0.00007948968,0.000031742595,0.000057106874,0.000023286895,0.9416411,0.0047955723,0.008207744,0.0005933887,0.044209067],"study_design_scores_gemma":[0.000005673556,0.000028043067,0.00006065105,0.0000033777185,0.000005463678,0.000015221761,0.0000111297895,0.9964914,0.0007530322,0.0021542825,0.0004687394,0.0000030342826],"about_ca_topic_score_codex":0.002618077,"about_ca_topic_score_gemma":0.003387994,"teacher_disagreement_score":0.002618077,"about_ca_system_score_codex":0.00074180734,"about_ca_system_score_gemma":0.001163975,"threshold_uncertainty_score":0.007374406},"labels":[],"label_agreement":null},{"id":"W2587329666","doi":"10.1109/tsc.2017.2662941","title":"Adaptable Context-Aware Cooking-Safe System","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Context (archaeology); Microcontroller; Ubiquitous computing; Context awareness; Fuzzy logic; Human–computer interaction; Embedded system; Computer security; Artificial intelligence","score_opus":0.02767501729170752,"score_gpt":0.2565122919103955,"score_spread":0.22883727461868797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587329666","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.18989162,0.001879307,0.74311244,0.00044118337,0.00032466478,0.00073365046,0.00083924376,0.04919429,0.013583554],"genre_scores_gemma":[0.9067901,0.00050395116,0.084778756,0.00038777635,0.0000718685,0.00024200857,0.00064958626,0.0002505657,0.006325363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997025,0.00003388514,0.000031678122,0.000109453744,0.00008044302,0.000041963252],"domain_scores_gemma":[0.99967515,0.000059074435,0.00003323156,0.00008107265,0.0000909019,0.00006059526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002791803,0.0006598391,0.00061430474,0.00053986796,0.00044107568,0.0008444336,0.0011961722,0.00072218815,0.002973237],"category_scores_gemma":[0.00096250686,0.0002674813,0.00040420954,0.00023733095,0.0002020485,0.0010111193,0.0014499631,0.00070470944,0.0011442701],"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.002253298,0.0014145401,0.017913403,0.0010155156,0.0004074901,0.0036861952,0.00152519,0.08331039,0.25042322,0.010541445,0.022033624,0.60547566],"study_design_scores_gemma":[0.00021042486,0.0006125261,0.0117337145,0.0001088496,0.00042387572,0.0020247393,0.0003977564,0.85353893,0.077461086,0.011329935,0.041955628,0.00020259108],"about_ca_topic_score_codex":0.0022976222,"about_ca_topic_score_gemma":0.0021651646,"teacher_disagreement_score":0.002973237,"about_ca_system_score_codex":0.00022092253,"about_ca_system_score_gemma":0.00046061203,"threshold_uncertainty_score":0.0099464655},"labels":[],"label_agreement":null},{"id":"W2616077070","doi":"10.1109/tsc.2017.2705685","title":"Opportunistic Sharing of Continuous Mobile Sensing Data for Energy and Power Conservation","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Green IT and Sustainability","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"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","keywords":"Computer science; Merge (version control); Mobile device; Real-time computing; Wearable computer; Energy consumption; Embedded system; Electrical engineering","score_opus":0.02745189341410605,"score_gpt":0.26318681174153574,"score_spread":0.23573491832742968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616077070","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.5950938,0.00068535534,0.3855903,0.0007448322,0.0002465366,0.00034011068,0.00032405235,0.00455258,0.012422527],"genre_scores_gemma":[0.9737302,0.00007907314,0.024028802,0.000117300115,0.00004368829,0.000065390406,0.00014016444,0.00011827368,0.0016771354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897385,0.00018883588,0.0000574541,0.00025438674,0.00033252503,0.00019310595],"domain_scores_gemma":[0.9977381,0.0009321997,0.00015677261,0.0006864062,0.0002682855,0.00021813704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013208291,0.00072637224,0.0007682475,0.0006653836,0.0010786087,0.0015127381,0.0014497159,0.0004202582,0.001450318],"category_scores_gemma":[0.0034327933,0.0004940604,0.00037062255,0.0008701261,0.000708339,0.0017307757,0.0024025764,0.0006218893,0.00028476788],"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.004850883,0.0014853424,0.03730244,0.000361738,0.000616202,0.0017241046,0.0033985137,0.14766261,0.2812177,0.021495733,0.012305184,0.4875795],"study_design_scores_gemma":[0.00011120665,0.00039451304,0.008123966,0.000020374242,0.00012478678,0.00038123585,0.0008828869,0.9069424,0.055957112,0.013017045,0.013953641,0.00009081384],"about_ca_topic_score_codex":0.004307174,"about_ca_topic_score_gemma":0.008829072,"teacher_disagreement_score":0.004307174,"about_ca_system_score_codex":0.00069345575,"about_ca_system_score_gemma":0.0011541134,"threshold_uncertainty_score":0.008564234},"labels":[],"label_agreement":null},{"id":"W2625108112","doi":"10.1109/tsc.2017.2712773","title":"A Framework of Hypergraph-Based Data Placement Among Geo-Distributed Datacenters","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hypergraph; Distributed computing; Replica; Partition (number theory); Set (abstract data type); Distributed database; Hash function; TRACE (psycholinguistics); Data mining; Big data; Scheme (mathematics)","score_opus":0.039873908681168996,"score_gpt":0.28376516151394676,"score_spread":0.24389125283277777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625108112","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.0040124734,0.0002670217,0.99362457,0.00022645031,0.000031694482,0.00008225386,0.00008714449,0.00038426387,0.0012839922],"genre_scores_gemma":[0.24725124,0.0011389933,0.7459095,0.00016484331,0.00013528691,0.00031705154,0.0005054606,0.00022895288,0.0043486585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982589,0.00066211796,0.00006856909,0.00047370075,0.00036270174,0.00017405042],"domain_scores_gemma":[0.99870527,0.00036631868,0.0001507518,0.00028087513,0.00026791578,0.00022891042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016637151,0.001149641,0.0014202158,0.0020982507,0.0017573445,0.002821935,0.003764952,0.0015323368,0.0027083857],"category_scores_gemma":[0.002906532,0.0009154432,0.0012569022,0.00461499,0.0016958322,0.0041862256,0.003287736,0.0014198965,0.0006918441],"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.0000874906,0.00010413226,0.0008061838,0.00017697082,0.00007979363,0.00023579856,0.0003380293,0.8082791,0.0035394097,0.12547368,0.0046761823,0.05620331],"study_design_scores_gemma":[0.000020033442,0.000049429662,0.00017919326,0.000017492686,0.000025810166,0.00007734006,0.00011233623,0.95516914,0.00084349373,0.037436977,0.006043608,0.00002510802],"about_ca_topic_score_codex":0.0137729235,"about_ca_topic_score_gemma":0.0141865695,"teacher_disagreement_score":0.0137729235,"about_ca_system_score_codex":0.0030555516,"about_ca_system_score_gemma":0.0033917702,"threshold_uncertainty_score":0.027385533},"labels":[],"label_agreement":null},{"id":"W2779397283","doi":"10.1109/tsc.2017.2787152","title":"Interactive Refactoring of Web Service Interfaces Using Computational Search","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Code refactoring; Web service; User interface; Interface (matter); Web modeling; Mashup; World Wide Web; Operating system","score_opus":0.03360290255296644,"score_gpt":0.3103840879793189,"score_spread":0.27678118542635244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779397283","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.20472194,0.00036224606,0.7871312,0.0002330798,0.00003427262,0.0003238654,0.000086860564,0.0023270545,0.0047794436],"genre_scores_gemma":[0.5877153,0.00014039612,0.4098696,0.00013484071,0.000016194708,0.00034514346,0.00025128262,0.00013811512,0.0013891974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886596,0.0004583399,0.000068863694,0.00019296914,0.00028415877,0.00012979252],"domain_scores_gemma":[0.9973206,0.0018375929,0.00025210597,0.00022320592,0.00029333655,0.000073231684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020389713,0.0013124981,0.0010790902,0.0020601077,0.0005696545,0.00077205064,0.0018656151,0.0012320441,0.0022094166],"category_scores_gemma":[0.006325018,0.00055518455,0.0012350861,0.0010638721,0.00066756416,0.000801472,0.0012382322,0.000624077,0.00030089967],"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.00016540456,0.00032786088,0.0035246203,0.00017595239,0.00011897657,0.00016194474,0.00026805417,0.80743796,0.00675425,0.0041415556,0.0010828917,0.17584048],"study_design_scores_gemma":[0.000021833403,0.000053384385,0.0002254621,0.000007425664,0.000018623929,0.000019764679,0.000028152985,0.997408,0.00081358786,0.0010698959,0.00032870905,0.0000052730675],"about_ca_topic_score_codex":0.006958999,"about_ca_topic_score_gemma":0.009314038,"teacher_disagreement_score":0.006958999,"about_ca_system_score_codex":0.000925851,"about_ca_system_score_gemma":0.0013773966,"threshold_uncertainty_score":0.01383698},"labels":[],"label_agreement":null},{"id":"W2784203325","doi":"10.1109/tsc.2018.2793250","title":"RepNet: Cutting Latency with Flow Replication in Data Center Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Latency (audio); Testbed; Network packet; Handshaking; Distributed computing; Data center","score_opus":0.021085656185639852,"score_gpt":0.255016751200999,"score_spread":0.23393109501535914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784203325","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.183127,0.0015321632,0.7558767,0.00060692354,0.0005592596,0.0011152817,0.00038094682,0.048083764,0.008717894],"genre_scores_gemma":[0.75509346,0.00036509644,0.23709273,0.00037981168,0.00018978337,0.00044291056,0.00072612526,0.0013243059,0.004385827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974802,0.0006611941,0.0001820897,0.00038262524,0.0009191,0.00037488158],"domain_scores_gemma":[0.99520785,0.0012782206,0.0006057285,0.0014285176,0.0010849456,0.00039469218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035057268,0.0011441235,0.00064274983,0.0010255435,0.0010441208,0.0015783996,0.0045523695,0.0006996251,0.0023853728],"category_scores_gemma":[0.007874806,0.0006210275,0.0004915703,0.0007183908,0.00097385084,0.0036696035,0.0025243221,0.0011029153,0.0006741362],"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.003246694,0.0018303063,0.013999833,0.0008229237,0.00034284923,0.00069561286,0.0007861767,0.24873982,0.17487797,0.019257559,0.03307156,0.50232875],"study_design_scores_gemma":[0.00031642965,0.0015370599,0.002044919,0.000047839607,0.0001135421,0.00035125916,0.00015825502,0.88001937,0.09344925,0.0067483936,0.015072831,0.00014081871],"about_ca_topic_score_codex":0.0047079837,"about_ca_topic_score_gemma":0.003798999,"teacher_disagreement_score":0.0047079837,"about_ca_system_score_codex":0.0015850458,"about_ca_system_score_gemma":0.0018941612,"threshold_uncertainty_score":0.018540263},"labels":[],"label_agreement":null},{"id":"W2795404493","doi":"10.1109/tsc.2017.2764559","title":"Special Issue on Service-Oriented Collaborative Computing and Applications","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Collaboration in agile enterprises","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Special section; Computer science; Focus (optics); Service (business); Collaborative software; Data science; World Wide Web; Engineering","score_opus":0.008311927169383584,"score_gpt":0.24796103573151546,"score_spread":0.23964910856213187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795404493","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.00038514248,0.033267125,0.0020741294,0.015428182,0.8994602,0.00016241298,0.00029300878,0.0003093491,0.0486204],"genre_scores_gemma":[0.001658566,0.027859617,0.00064966636,0.0057738707,0.86366653,0.00014867289,0.0005927935,0.00035498297,0.09929531],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99564976,0.00045967428,0.00043669262,0.00065723085,0.002341663,0.00045501656],"domain_scores_gemma":[0.98746115,0.0036032794,0.00080781855,0.0010269844,0.0043776883,0.0027230566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003836855,0.0029521412,0.004509673,0.0067592263,0.0032429905,0.011569513,0.0031021968,0.0059351046,0.102314174],"category_scores_gemma":[0.008620836,0.0009918247,0.0023385966,0.005621625,0.001783905,0.007528032,0.0040930873,0.008044112,0.051272858],"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.00003279359,0.000051792988,0.00009680496,0.0003537402,0.00002260869,0.00010763387,0.000029270239,0.000092685725,0.00027712784,0.0025794464,0.96889764,0.027458569],"study_design_scores_gemma":[0.000009453692,0.000041644314,0.00026254985,0.00024796277,0.000014318127,0.00021217574,0.000025819494,0.00020238615,0.00009351135,0.0017252112,0.9971545,0.0000103998145],"about_ca_topic_score_codex":0.00097218266,"about_ca_topic_score_gemma":0.0019087037,"teacher_disagreement_score":0.102314174,"about_ca_system_score_codex":0.0025172445,"about_ca_system_score_gemma":0.0030057358,"threshold_uncertainty_score":0.34227502},"labels":[],"label_agreement":null},{"id":"W2795633027","doi":"10.1109/tsc.2018.2821685","title":"Dependence-Based Data-Aware Process Conformance Checking","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Key Research and Development Program of China; Deutsche Forschungsgemeinschaft; Alexander von Humboldt-Stiftung","keywords":"Computer science; Conformance checking; TRACE (psycholinguistics); Executable; Process (computing); Process mining; Consistency (knowledge bases); Leverage (statistics); Heuristics; Control flow; Data mining; Distributed computing; Programming language; Business process; Work in process; Business process management; Business process modeling; Operating system; Machine learning; Artificial intelligence","score_opus":0.04278380249166795,"score_gpt":0.2824952141329846,"score_spread":0.23971141164131665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795633027","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.046329867,0.00010064713,0.9457567,0.00010309691,0.000018780715,0.00022677112,0.0002320694,0.006448297,0.00078391953],"genre_scores_gemma":[0.6301158,0.00010679264,0.36690223,0.00010596915,0.000024621595,0.00032353567,0.0008753657,0.0007698851,0.0007758243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9884317,0.0027625223,0.001110899,0.0021855622,0.004722417,0.00078697875],"domain_scores_gemma":[0.96869856,0.016416065,0.0036091653,0.0064106546,0.0043943166,0.00047123997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058662947,0.0015863185,0.0016040931,0.0045317626,0.0009975819,0.0018863227,0.0028977094,0.0009867225,0.001421795],"category_scores_gemma":[0.03270691,0.0010005692,0.0022875073,0.0024755218,0.0016722543,0.0032605412,0.0028591757,0.002358563,0.00040952588],"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.0010395732,0.0008450007,0.03826662,0.0006752998,0.00045128653,0.00092592195,0.0012434755,0.51266605,0.05551597,0.030491853,0.002524888,0.355354],"study_design_scores_gemma":[0.000031561296,0.000059055546,0.0009095706,0.000027476504,0.00004721624,0.00010794585,0.000046418656,0.97053176,0.017422983,0.010071904,0.0007175594,0.00002659936],"about_ca_topic_score_codex":0.0048947544,"about_ca_topic_score_gemma":0.006194707,"teacher_disagreement_score":0.0058662947,"about_ca_system_score_codex":0.0014301008,"about_ca_system_score_gemma":0.0030417237,"threshold_uncertainty_score":0.031024277},"labels":[],"label_agreement":null},{"id":"W2888896501","doi":"10.1109/tsc.2018.2867482","title":"A Double Deep Q-Learning Model for Energy-Efficient Edge Scheduling","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Science Foundation of Sri Lanka","keywords":"Computer science; Sigmoid function; Edge device; Energy consumption; Frequency scaling; Deep learning; Efficient energy use; Scheduling (production processes); Energy (signal processing); Algorithm; Artificial intelligence; Mathematical optimization; Artificial neural network; Mathematics; Electrical engineering","score_opus":0.02310774106076888,"score_gpt":0.2503590141494647,"score_spread":0.22725127308869583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888896501","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.038718965,0.0005528194,0.954625,0.0004934733,0.00009959488,0.000054351556,0.00019248086,0.0011249961,0.0041384124],"genre_scores_gemma":[0.8896839,0.0003903918,0.10049032,0.00048684276,0.000045275745,0.00019195865,0.0004927243,0.000106093285,0.008112526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997912,0.000030264971,0.000011574877,0.000073985844,0.00004156151,0.00005138871],"domain_scores_gemma":[0.9997272,0.000089447254,0.000024537032,0.00002441244,0.000115863906,0.00001856593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004653705,0.00075474475,0.0006113362,0.00024626643,0.00028151908,0.00059913425,0.0014998992,0.00076454476,0.0031142815],"category_scores_gemma":[0.0011029153,0.00034800675,0.0004589359,0.00035936182,0.00045136787,0.0010715415,0.0006802826,0.0013496482,0.00049858884],"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.00009475432,0.00007999656,0.0010407371,0.000056566958,0.000027109923,0.000057275898,0.00004354475,0.9052005,0.0031318872,0.00495263,0.0026035493,0.08271138],"study_design_scores_gemma":[0.0000027729732,0.000011015236,0.000044464232,0.0000021534072,0.0000028777988,0.0000039845454,0.0000021025912,0.9985239,0.00035458128,0.00083194795,0.00021866617,0.0000015431418],"about_ca_topic_score_codex":0.009441471,"about_ca_topic_score_gemma":0.012234595,"teacher_disagreement_score":0.009441471,"about_ca_system_score_codex":0.0008687493,"about_ca_system_score_gemma":0.0011284057,"threshold_uncertainty_score":0.01877302},"labels":[],"label_agreement":null},{"id":"W2889144536","doi":"10.1109/tsc.2018.2867437","title":"Integrating Social Networks with Mobile Device-to-Device Services","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Cellular traffic; Bluetooth; Cellular network; Exploit; Mobile device; Mobile social network; Mobile computing; Computer security; World Wide Web; Telecommunications; Wireless","score_opus":0.015219584714113974,"score_gpt":0.25955373786770713,"score_spread":0.24433415315359316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889144536","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.34985855,0.0061191577,0.5910604,0.004223167,0.000682807,0.000654109,0.00065305695,0.0022132446,0.044535592],"genre_scores_gemma":[0.964563,0.00089160656,0.03200319,0.00015210868,0.00011331949,0.00007226336,0.0001375677,0.000035232995,0.002031582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850696,0.0007732138,0.000041310515,0.00019217064,0.00032682627,0.00015945749],"domain_scores_gemma":[0.9982686,0.0008432503,0.00015037981,0.00029187772,0.0003018298,0.0001440512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010812398,0.00096904224,0.000544241,0.0010821873,0.0009543788,0.0016754854,0.0009586781,0.0007273067,0.0014988355],"category_scores_gemma":[0.0039066616,0.00025310254,0.00049886224,0.0012563935,0.0008097652,0.0026792218,0.0026983311,0.00079776434,0.00038164938],"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.0005152054,0.00078026287,0.036652908,0.0007629979,0.00043314957,0.002096633,0.001522057,0.33454496,0.020298043,0.10943935,0.009459412,0.48349503],"study_design_scores_gemma":[0.000022002101,0.00027481536,0.0062603247,0.00006361064,0.00010306225,0.0005164936,0.00096235186,0.914261,0.003576978,0.04829078,0.025608078,0.000060497798],"about_ca_topic_score_codex":0.008371023,"about_ca_topic_score_gemma":0.00914962,"teacher_disagreement_score":0.008371023,"about_ca_system_score_codex":0.0009508527,"about_ca_system_score_gemma":0.00074899907,"threshold_uncertainty_score":0.016644597},"labels":[],"label_agreement":null},{"id":"W2900957219","doi":"10.1109/tsc.2018.2881147","title":"Achieving Efficient and Privacy-Preserving Multi-Domain Big Data Deduplication in Cloud","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Scholarship Council; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Data deduplication; Computer science; Ciphertext; Encryption; Cloud computing; Brute-force attack; Plaintext; Cloud storage; Domain (mathematical analysis); Computer security; Computer network; Mathematics","score_opus":0.05500071436828526,"score_gpt":0.2962869501954648,"score_spread":0.24128623582717953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900957219","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.13048553,0.0017212371,0.8615007,0.00060481176,0.00016584017,0.0003079031,0.00033541536,0.0009847098,0.003893869],"genre_scores_gemma":[0.89814895,0.00043951158,0.09896003,0.00018195799,0.000042342355,0.00009608329,0.00027178423,0.00002999918,0.0018293635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986908,0.0002740681,0.00012419546,0.00024800614,0.00044646385,0.00021649724],"domain_scores_gemma":[0.9977582,0.0003804995,0.0002381064,0.0010961286,0.00039457125,0.00013254298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015937216,0.0004529911,0.0007983183,0.00053423387,0.0010977765,0.0013399203,0.0014025177,0.0006921435,0.0008293746],"category_scores_gemma":[0.0023513038,0.00029094119,0.0006945139,0.0009765862,0.0006930471,0.0026733112,0.0027756526,0.0008790407,0.00037443134],"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.0019688406,0.00059164886,0.009659534,0.0013501833,0.0004139853,0.0022344168,0.00183099,0.2793253,0.20214044,0.12933044,0.017382238,0.35377204],"study_design_scores_gemma":[0.00014924836,0.0003513115,0.0015055219,0.000060035603,0.00008441722,0.0018197891,0.00039982362,0.84784985,0.10360963,0.02859897,0.015465883,0.00010555525],"about_ca_topic_score_codex":0.0007184055,"about_ca_topic_score_gemma":0.0008787932,"teacher_disagreement_score":0.0015937216,"about_ca_system_score_codex":0.00066229684,"about_ca_system_score_gemma":0.0013945538,"threshold_uncertainty_score":0.008428514},"labels":[],"label_agreement":null},{"id":"W2904061372","doi":"10.1109/tsc.2018.2885299","title":"A QoS-Based Splitting Strategy for a Resource Embedding Across Multiple Cloud Providers","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Cloud computing; Quality of service; Scalability; Embedding; Distributed computing; Virtual network; Integer programming; Resource allocation; Integer (computer science); Maximization; Computer network; Mathematical optimization; Algorithm; Artificial intelligence; Database; Mathematics","score_opus":0.02854912266862424,"score_gpt":0.3025951706975516,"score_spread":0.27404604802892735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904061372","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.036599033,0.00019565747,0.958395,0.00022671287,0.00004598762,0.00012165563,0.00002923714,0.00016986861,0.0042167665],"genre_scores_gemma":[0.8487616,0.00016284932,0.1486761,0.00011016224,0.00003233419,0.00011247716,0.000060051294,0.00004210547,0.002042371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993631,0.00016910092,0.000031213684,0.00014904188,0.00015686032,0.00013057837],"domain_scores_gemma":[0.9994611,0.00019619022,0.00008131947,0.000044794673,0.00013403172,0.00008247278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092832866,0.0010061743,0.00062865304,0.0004937673,0.00063166535,0.0008865137,0.0011993352,0.0006358739,0.0028245007],"category_scores_gemma":[0.0013717049,0.0002940488,0.00045873426,0.0004913941,0.00051465014,0.0013613462,0.0010756109,0.00079896784,0.00029888283],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002771537,0.00023084009,0.00079196796,0.00017002538,0.0000523524,0.00038136757,0.00025519938,0.77364177,0.042214915,0.04076255,0.0022860842,0.13893577],"study_design_scores_gemma":[0.00000783877,0.00007897551,0.000084927364,0.0000063703537,0.000009388914,0.000047298683,0.000036848127,0.9929092,0.002425534,0.0037674266,0.0006190009,0.0000072569824],"about_ca_topic_score_codex":0.002341009,"about_ca_topic_score_gemma":0.002027345,"teacher_disagreement_score":0.0028245007,"about_ca_system_score_codex":0.0010082993,"about_ca_system_score_gemma":0.0010372531,"threshold_uncertainty_score":0.0094489455},"labels":[],"label_agreement":null},{"id":"W2955869759","doi":"10.1109/tsc.2019.2924372","title":"Achieve Efficient and Verifiable Conjunctive and Fuzzy Queries over Encrypted Data in Cloud","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Encryption; Verifiable secret sharing; Fuzzy logic; Conjunctive query; Data mining; Computer security; Database; Information retrieval; Computer network; Artificial intelligence; Relational database; Set (abstract data type); Operating system","score_opus":0.010499051071177934,"score_gpt":0.23716911042889752,"score_spread":0.22667005935771958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955869759","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.12799057,0.0010572849,0.86343396,0.00069439586,0.000084752035,0.00036353272,0.00049741706,0.0010898724,0.0047881454],"genre_scores_gemma":[0.9109611,0.00046617474,0.08623835,0.00020418465,0.000049026145,0.00010289427,0.00025490267,0.000032690637,0.0016907479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695265,0.00042133968,0.00034259362,0.0004676878,0.0012335212,0.00058217056],"domain_scores_gemma":[0.9966613,0.0013179391,0.00043993795,0.0009333555,0.0005364463,0.00011101182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018321797,0.0005028975,0.0011748748,0.0006227517,0.0009874419,0.0019271757,0.0016915237,0.0010837333,0.0014798541],"category_scores_gemma":[0.0049748146,0.000293325,0.0008499285,0.0012435231,0.0011904683,0.004959854,0.0023928757,0.00124699,0.00042930627],"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.0036447423,0.0005645348,0.005255842,0.0009938414,0.00033344343,0.0026169554,0.0019165182,0.1546018,0.20232008,0.25785112,0.009512935,0.36038816],"study_design_scores_gemma":[0.00016885075,0.00023527065,0.00085519184,0.000045350534,0.000086404514,0.0009473761,0.00036317398,0.8549666,0.09195418,0.045912124,0.004382012,0.00008342552],"about_ca_topic_score_codex":0.0027399946,"about_ca_topic_score_gemma":0.0020610502,"teacher_disagreement_score":0.0027399946,"about_ca_system_score_codex":0.0013597116,"about_ca_system_score_gemma":0.0018688659,"threshold_uncertainty_score":0.009865463},"labels":[],"label_agreement":null},{"id":"W2976431391","doi":"10.1109/tsc.2019.2944360","title":"Improving the Schedulability of Real-Time Tasks Using Fog Computing","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Cloud computing; Scheduling (production processes); Fog computing; Response time; Execution time; Schedule; Computation; Notation; Distributed computing; Parallel computing; Embedded system; Algorithm; Operating system; Arithmetic","score_opus":0.014523521590927124,"score_gpt":0.24725700995618036,"score_spread":0.23273348836525323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976431391","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.13554259,0.0014065717,0.854695,0.00023464992,0.00021361635,0.00019798364,0.00010593481,0.0013123143,0.006291316],"genre_scores_gemma":[0.85658073,0.00043457877,0.141439,0.00008860178,0.00006745729,0.00010910809,0.00017045505,0.00010479451,0.0010053072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993506,0.000113963644,0.00004677299,0.00013019824,0.0001605489,0.00019784553],"domain_scores_gemma":[0.9991967,0.00032718928,0.000110765635,0.00012213945,0.00017470175,0.000068492394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007412498,0.0009000105,0.0006138181,0.0006246488,0.00067915255,0.0008166575,0.0009971666,0.00046402213,0.0009097739],"category_scores_gemma":[0.002282824,0.00024248518,0.0007254204,0.00046682474,0.00043736128,0.00079541793,0.0005644541,0.0005418179,0.0002583949],"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.00078271516,0.0003386323,0.004069186,0.0005455396,0.00012106009,0.00063107896,0.00038277736,0.67938626,0.0838021,0.019144546,0.0048234677,0.20597269],"study_design_scores_gemma":[0.000027529019,0.00009244872,0.0006542103,0.000018347639,0.000019135723,0.00006726608,0.000045300327,0.98105216,0.011867017,0.0043560066,0.0017860297,0.000014670245],"about_ca_topic_score_codex":0.0074747945,"about_ca_topic_score_gemma":0.006025406,"teacher_disagreement_score":0.0074747945,"about_ca_system_score_codex":0.0008725484,"about_ca_system_score_gemma":0.002443939,"threshold_uncertainty_score":0.014862537},"labels":[],"label_agreement":null},{"id":"W2980081217","doi":"10.1109/tsc.2019.2946164","title":"A Novel Addressing and Routing Architecture for Cloud-Service Datacenter Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"British Columbia Knowledge Development Fund; Ministry of Education; Natural Sciences and Engineering Research Council of Canada; Southeast University; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Distributed computing; Cloud computing; Network topology; Static routing; Routing table; Dynamic Source Routing; Policy-based routing; Routing (electronic design automation); Energy consumption; Routing domain; Routing protocol; Engineering; Operating system","score_opus":0.020467495991724476,"score_gpt":0.24696884670177868,"score_spread":0.2265013507100542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980081217","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.04262902,0.001031477,0.9437015,0.0005157068,0.00024752875,0.00019504498,0.00016530756,0.002435204,0.009079283],"genre_scores_gemma":[0.50628453,0.00094870053,0.48496437,0.0003688171,0.00018202676,0.00020664235,0.00051686534,0.000091916576,0.0064361533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997743,0.000041197127,0.000022375987,0.00004994322,0.00007677137,0.0000354341],"domain_scores_gemma":[0.9997452,0.00002666621,0.000041746058,0.00005728561,0.00010280029,0.000026312744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029870708,0.0004159894,0.0002919557,0.00048681238,0.0005955756,0.0009788913,0.00121711,0.00045278782,0.0011107038],"category_scores_gemma":[0.00041567822,0.00015635225,0.00028297867,0.0007030684,0.00023193308,0.0014185065,0.00052467315,0.0005257943,0.00035599136],"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.0003119558,0.00025239206,0.0022520542,0.0005406361,0.00009710797,0.00037884814,0.00023693811,0.17469117,0.13617113,0.15962793,0.020730658,0.5047091],"study_design_scores_gemma":[0.000036930975,0.0003152949,0.0008155245,0.000035036705,0.00009766159,0.0005568936,0.00006959579,0.8919421,0.031693894,0.022004982,0.05236292,0.00006924386],"about_ca_topic_score_codex":0.001671959,"about_ca_topic_score_gemma":0.0024928083,"teacher_disagreement_score":0.001671959,"about_ca_system_score_codex":0.00090604246,"about_ca_system_score_gemma":0.00088222465,"threshold_uncertainty_score":0.0065737963},"labels":[],"label_agreement":null},{"id":"W2999645065","doi":"10.1109/tsc.2020.2966970","title":"An Energy-Efficient SDN Controller Architecture for IoT Networks With Blockchain-Based Security","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":333,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"National Science Foundation","keywords":"Computer science; Computer network; Routing protocol; Blockchain; Energy consumption; Efficient energy use; Distributed computing; Computer security; Routing (electronic design automation)","score_opus":0.007143031788117552,"score_gpt":0.2147177771639377,"score_spread":0.20757474537582013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999645065","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.106369615,0.00047134745,0.87824106,0.00054376357,0.0001844894,0.00028467327,0.000109695444,0.001875718,0.011919696],"genre_scores_gemma":[0.9349079,0.00020563586,0.06127239,0.00008963438,0.000030339652,0.00018010476,0.00013392803,0.00002839238,0.003151675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996426,0.000053387525,0.00003350005,0.00007853792,0.0001457145,0.000046174595],"domain_scores_gemma":[0.9996773,0.000055743818,0.000038921655,0.000059069327,0.00011974339,0.00004911429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048100256,0.0003091599,0.0003732316,0.00033473462,0.0008653414,0.00079170463,0.0012462,0.0005162642,0.0019448625],"category_scores_gemma":[0.0005838002,0.00018392061,0.00028248507,0.00030559095,0.0006431904,0.0011879468,0.0010568907,0.00054021674,0.0002863838],"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.00067618716,0.00038154493,0.0034824582,0.00027601895,0.000112843205,0.0006302448,0.00050504133,0.66811,0.0798492,0.074062705,0.00507925,0.16683453],"study_design_scores_gemma":[0.0000383169,0.0001065383,0.00017674368,0.000010239988,0.000018206834,0.000051835395,0.0000244256,0.9829617,0.006686297,0.0059723514,0.0039379178,0.000015379932],"about_ca_topic_score_codex":0.003532491,"about_ca_topic_score_gemma":0.0048117614,"teacher_disagreement_score":0.003532491,"about_ca_system_score_codex":0.00085450313,"about_ca_system_score_gemma":0.0015923837,"threshold_uncertainty_score":0.007023871},"labels":[],"label_agreement":null},{"id":"W3011380968","doi":"10.1109/tsc.2020.2980793","title":"A Survey on Web Service QoS Prediction Methods","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Web service; Collaborative filtering; Quality of service; The Internet; Field (mathematics); Service (business); World Wide Web; Data mining; Recommender system; Computer network","score_opus":0.0637809884499326,"score_gpt":0.3188678052974772,"score_spread":0.25508681684754464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011380968","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02416492,0.36330009,0.5851764,0.0023527085,0.0015051895,0.00036933878,0.0017807494,0.002501223,0.01884948],"genre_scores_gemma":[0.28575116,0.39409232,0.29984027,0.0012359464,0.0033006396,0.00054437347,0.0047482024,0.00042224542,0.010064953],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969811,0.0005565753,0.00033449102,0.0006091514,0.0013827797,0.00013585888],"domain_scores_gemma":[0.9931726,0.004227083,0.00027376408,0.0005199486,0.0017084256,0.000098205375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002992745,0.0019339232,0.001936926,0.004923966,0.0006987992,0.0018702425,0.0026689896,0.00150087,0.0024380647],"category_scores_gemma":[0.010167479,0.0006968135,0.0019367621,0.008691177,0.00036324552,0.0035311684,0.00071220775,0.0014557741,0.0019413022],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015453623,0.00024599905,0.007839877,0.0024147155,0.00028072976,0.00012532904,0.00018358442,0.022564666,0.0012634484,0.009076421,0.014757487,0.94109327],"study_design_scores_gemma":[0.000069422,0.00047804663,0.01591345,0.0030225655,0.00095582614,0.0018232019,0.00071859383,0.7072808,0.008304243,0.0318913,0.2292176,0.00032485582],"about_ca_topic_score_codex":0.013126503,"about_ca_topic_score_gemma":0.0047000116,"teacher_disagreement_score":0.013126503,"about_ca_system_score_codex":0.0011022042,"about_ca_system_score_gemma":0.0013747173,"threshold_uncertainty_score":0.026100159},"labels":[],"label_agreement":null},{"id":"W3022856335","doi":"10.1109/tsc.2020.2992303","title":"Achieving Practical Symmetric Searchable Encryption With Search Pattern Privacy Over Cloud","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Pseudorandom function family; Cloud computing; Symmetric-key algorithm; Identifier; Overhead (engineering); Scheme (mathematics); Bloom filter; Theoretical computer science; Pseudorandom generator; Security analysis; Cryptography; Computer security; Computer network; Public-key cryptography; Mathematics","score_opus":0.03250516878725188,"score_gpt":0.2827424459918655,"score_spread":0.2502372772046136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022856335","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.055162106,0.0011768313,0.92995965,0.0010576518,0.00010815429,0.0003466827,0.00069084374,0.0010386555,0.0104593765],"genre_scores_gemma":[0.90571135,0.0008431902,0.0882555,0.00036092126,0.000073292045,0.00022441207,0.00045756623,0.00007109924,0.0040026708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662375,0.00059414114,0.00036259298,0.000428851,0.0011985949,0.0007920257],"domain_scores_gemma":[0.9971131,0.0007222545,0.00035966194,0.0012514944,0.0004325453,0.00012091226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015622072,0.00078057573,0.0012727439,0.0006163565,0.0011018893,0.0021713937,0.0015375225,0.001149213,0.0031485988],"category_scores_gemma":[0.004237619,0.00033830616,0.000998137,0.0018640778,0.0009515184,0.005312699,0.0033627814,0.0014499866,0.0010663931],"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.0016977576,0.0004393727,0.003730676,0.0010078604,0.00020648568,0.0017864447,0.0007570637,0.18896636,0.071621664,0.45805946,0.017876351,0.2538505],"study_design_scores_gemma":[0.0002013358,0.00020435684,0.0006245648,0.0000804009,0.0000756556,0.0016201062,0.00024943848,0.80398697,0.040286787,0.13681655,0.015767459,0.00008631888],"about_ca_topic_score_codex":0.0014354016,"about_ca_topic_score_gemma":0.0012514098,"teacher_disagreement_score":0.0031485988,"about_ca_system_score_codex":0.0013738459,"about_ca_system_score_gemma":0.0031159131,"threshold_uncertainty_score":0.010533094},"labels":[],"label_agreement":null},{"id":"W3027282887","doi":"10.1109/tsc.2020.2996382","title":"Joint Pricing and Security Investment in Cloud Security Service Market With User Interdependency","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Information and Cyber Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; York University","funders":"Nanyang Technological University; National Research Foundation","keywords":"Cloud computing security; Cloud computing; Computer security; Stackelberg competition; Computer science; Security service; Service (business); Security controls; Business; Information security; Control (management); Economics; Marketing","score_opus":0.012123469707542975,"score_gpt":0.21488624050409233,"score_spread":0.20276277079654936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027282887","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.41244876,0.0020594248,0.5239138,0.005113055,0.00024027225,0.00043588312,0.0005319911,0.0003563313,0.05490043],"genre_scores_gemma":[0.98636997,0.0004025231,0.005558878,0.00010979064,0.00006294947,0.00010116674,0.000048674763,0.000023140949,0.007322888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99581474,0.0014981666,0.00012843219,0.0007635187,0.00057789363,0.0012172331],"domain_scores_gemma":[0.9950376,0.0028151996,0.0008734865,0.00023523408,0.00046695056,0.00057146593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004260425,0.0017086432,0.0028821293,0.001144554,0.0016385075,0.0051997937,0.0030333109,0.005124424,0.010411271],"category_scores_gemma":[0.01102908,0.0016048828,0.0025155619,0.0012505458,0.0030547425,0.00754543,0.0025609478,0.004378317,0.0007454381],"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.00042168229,0.00030303342,0.0050679944,0.00022777132,0.00017870986,0.0019483614,0.00033123785,0.5292263,0.0025784813,0.44509658,0.0026230072,0.011996883],"study_design_scores_gemma":[0.000057721725,0.00013673649,0.0010697235,0.000021755808,0.000076218115,0.00020245457,0.000172261,0.9137571,0.00035117826,0.08313186,0.00095768576,0.00006534213],"about_ca_topic_score_codex":0.007784097,"about_ca_topic_score_gemma":0.0042162626,"teacher_disagreement_score":0.010411271,"about_ca_system_score_codex":0.0042077666,"about_ca_system_score_gemma":0.0032580225,"threshold_uncertainty_score":0.03482914},"labels":[],"label_agreement":null},{"id":"W3043398049","doi":"10.1109/tsc.2020.3009084","title":"Cloud-Based Charging Management of Heterogeneous Electric Vehicles in a Network of Charging Stations: Price Incentive Versus Capacity Expansion","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"National Science Foundation of Sri Lanka","keywords":"Computer science; Cloud computing; Incentive; Profit maximization; Quality of service; Queueing theory; Capacity planning; Computer network; Operations research; Distributed computing; Profit (economics); Operating system; Engineering","score_opus":0.013216632625493755,"score_gpt":0.2120465808802586,"score_spread":0.19882994825476485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043398049","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.23255874,0.00051137496,0.7557471,0.0008843101,0.00014921877,0.00015118606,0.00008009899,0.00027173373,0.009646273],"genre_scores_gemma":[0.98435175,0.000107204934,0.013953182,0.000036710935,0.00002374555,0.000021817967,0.0000147832025,0.000017444356,0.0014734769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995468,0.00011659078,0.00001513604,0.00008042329,0.00009436102,0.00014658821],"domain_scores_gemma":[0.99959165,0.00015881272,0.00006309727,0.000033835597,0.00008397038,0.00006856929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006699696,0.0003957847,0.0005543058,0.00025309555,0.0007225574,0.0010436042,0.0012132066,0.00054712116,0.0017619184],"category_scores_gemma":[0.0011952969,0.00024355194,0.00045570065,0.00045092963,0.00055858237,0.001130738,0.00081366545,0.00054533273,0.00015415701],"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.000110406865,0.00007497067,0.0010229026,0.000027597374,0.000021036041,0.00011439262,0.000038270387,0.9633645,0.0026616864,0.014087539,0.00076805626,0.017708572],"study_design_scores_gemma":[0.0000052085275,0.000013863297,0.00010251154,0.0000012073157,0.0000041448257,0.0000102629265,0.000017008264,0.99811196,0.0003832906,0.0010863843,0.0002612225,0.0000029333196],"about_ca_topic_score_codex":0.01108853,"about_ca_topic_score_gemma":0.01001635,"teacher_disagreement_score":0.01108853,"about_ca_system_score_codex":0.001852034,"about_ca_system_score_gemma":0.0015530495,"threshold_uncertainty_score":0.022047937},"labels":[],"label_agreement":null},{"id":"W3122406465","doi":"10.1109/tsc.2021.3054036","title":"Identifying a Minimum Sequence of High-Level Changes Between Workflows","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China; Deutsche Forschungsgemeinschaft","keywords":"Workflow; Computer science; Scalability; Heuristics; Pruning; Heuristic; Sequence (biology); Theoretical computer science; Algorithm; Artificial intelligence; Database","score_opus":0.07655935502924761,"score_gpt":0.27541265088310757,"score_spread":0.19885329585385997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122406465","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.12722827,0.0013094046,0.85661596,0.0011313624,0.0001480705,0.000727811,0.0018953854,0.005679017,0.005264699],"genre_scores_gemma":[0.21150659,0.00038496297,0.77999115,0.0002627531,0.00003481974,0.0003339615,0.0045932108,0.00056365656,0.0023288927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726474,0.00043179825,0.0002582751,0.001110759,0.0007087021,0.00022570486],"domain_scores_gemma":[0.99668044,0.0015230277,0.0004536041,0.00048720432,0.0005829799,0.000272612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018701073,0.001370208,0.0013574654,0.0025850984,0.0018454388,0.0021161314,0.0024236734,0.0023744612,0.0039567337],"category_scores_gemma":[0.008914417,0.0009919283,0.0022279222,0.0019326095,0.0012618972,0.0029817726,0.0016358441,0.002155093,0.0013920751],"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.00087209855,0.0010664815,0.021416103,0.0018567316,0.00036536553,0.0017185903,0.0009800738,0.32118076,0.050603434,0.028721834,0.016886037,0.55433255],"study_design_scores_gemma":[0.00017617967,0.0003299097,0.0059925197,0.00017248542,0.0002201681,0.0010163488,0.0007927813,0.87244976,0.042210236,0.056896947,0.019652503,0.000090112844],"about_ca_topic_score_codex":0.008104548,"about_ca_topic_score_gemma":0.01750663,"teacher_disagreement_score":0.008104548,"about_ca_system_score_codex":0.0015265914,"about_ca_system_score_gemma":0.006884756,"threshold_uncertainty_score":0.016114771},"labels":[],"label_agreement":null},{"id":"W3134872094","doi":"10.1109/tsc.2021.3065240","title":"Achieving Efficient and Privacy-Preserving Set Containment Search Over Encrypted Data","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Bloom filter; Set operations; Cloud computing; Containment (computer programming); Set (abstract data type); Outsourcing; Tree (set theory); Computer security; Data mining; Database; Computer network","score_opus":0.0349615736369783,"score_gpt":0.29283229670172073,"score_spread":0.25787072306474246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134872094","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.115770064,0.0013026492,0.87340593,0.0007557003,0.000072688155,0.0002579062,0.0006296199,0.0009879806,0.006817496],"genre_scores_gemma":[0.8026969,0.00090552616,0.19211191,0.00027255312,0.000073624615,0.00015661339,0.0007863702,0.00005430551,0.002942266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613416,0.00065237697,0.00041293367,0.00041914615,0.0018564737,0.00052492245],"domain_scores_gemma":[0.99438345,0.0018492511,0.0006869409,0.002185636,0.00076083594,0.0001339077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001666618,0.00044047463,0.0013373806,0.0010104106,0.0010240619,0.0016210111,0.0013543642,0.00081074337,0.0013874968],"category_scores_gemma":[0.006141267,0.00029328364,0.0007822221,0.0026180085,0.00091650366,0.0056419033,0.0029382927,0.0011580907,0.000715213],"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.0016833252,0.0007425571,0.0061960337,0.0010120323,0.00028953655,0.0013359147,0.0018134725,0.12977722,0.1287923,0.25033185,0.015127575,0.46289816],"study_design_scores_gemma":[0.00018319004,0.00061201316,0.001646904,0.000084239735,0.00013501637,0.0029716666,0.00067566475,0.7485768,0.131637,0.09650094,0.01686266,0.00011384795],"about_ca_topic_score_codex":0.0009768328,"about_ca_topic_score_gemma":0.00085846905,"teacher_disagreement_score":0.001666618,"about_ca_system_score_codex":0.000932948,"about_ca_system_score_gemma":0.0021770182,"threshold_uncertainty_score":0.008814037},"labels":[],"label_agreement":null},{"id":"W3144845068","doi":"10.1109/tsc.2021.3070746","title":"Resource Trading in Edge Computing-Enabled IoV: An Efficient Futures-Based Approach","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Futures contract; Edge computing; Resource (disambiguation); Negotiation; Low latency (capital markets); Algorithmic trading; Distributed computing; Enhanced Data Rates for GSM Evolution; Computer network; Telecommunications; Business","score_opus":0.01384344171392852,"score_gpt":0.23216014590570422,"score_spread":0.2183167041917757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144845068","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.025213854,0.0006020781,0.96847624,0.0003337989,0.000055072327,0.00006965467,0.000047505477,0.00012233533,0.005079495],"genre_scores_gemma":[0.866979,0.000371343,0.1289343,0.000107531145,0.00004681851,0.00008324211,0.00009104613,0.000055889042,0.003330801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987947,0.0003651425,0.000060693405,0.00020009189,0.00037779094,0.00020150474],"domain_scores_gemma":[0.9991491,0.00039654123,0.00009675867,0.00009254489,0.00017391647,0.000091244365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019471211,0.0006882843,0.0012936033,0.0006376216,0.0009121573,0.0018191014,0.0023483683,0.0013770472,0.0024303636],"category_scores_gemma":[0.0026929409,0.0004711171,0.0007258242,0.00093340274,0.00096111576,0.002844174,0.0021251764,0.0011089942,0.00022896926],"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.00012552421,0.000069211404,0.000842383,0.00006561721,0.000041155035,0.0001971463,0.000137128,0.88185537,0.0029863333,0.06319592,0.0010452518,0.049438946],"study_design_scores_gemma":[0.000004751031,0.000018695775,0.000047964862,0.0000036156248,0.000004990895,0.000033031636,0.00002470923,0.9861822,0.00032401973,0.012642495,0.0007071577,0.0000063269295],"about_ca_topic_score_codex":0.0046057184,"about_ca_topic_score_gemma":0.0030163557,"teacher_disagreement_score":0.0046057184,"about_ca_system_score_codex":0.001223042,"about_ca_system_score_gemma":0.0019778258,"threshold_uncertainty_score":0.010297477},"labels":[],"label_agreement":null},{"id":"W3163561067","doi":"10.1109/tsc.2021.3081350","title":"Efficient Privacy-Preserving Similarity Range Query With Quadsector Tree in eHealthcare","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Outsourcing; Range query (database); Tree (set theory); Data mining; Information privacy; Computer security; Information retrieval; Web search query; Web query classification; Search engine","score_opus":0.016543313998073343,"score_gpt":0.25330689143122664,"score_spread":0.2367635774331533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163561067","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.09625809,0.0012556929,0.8953774,0.00095836923,0.00010863821,0.00036256967,0.0004338278,0.0006813425,0.0045642164],"genre_scores_gemma":[0.9017185,0.00045906502,0.09476835,0.0002911876,0.00006235521,0.0001462404,0.00037959017,0.000027427019,0.0021472753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566984,0.001209827,0.00040762773,0.0006019162,0.0014714994,0.00063932774],"domain_scores_gemma":[0.99689984,0.00107962,0.00034364744,0.0010190238,0.00049374875,0.00016401148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021640428,0.00042638628,0.0011816983,0.0007803556,0.0011349629,0.0014401397,0.0014099637,0.001184826,0.0017761328],"category_scores_gemma":[0.0050683664,0.0002656213,0.0008447837,0.0018022474,0.0009341866,0.0055117668,0.0035122142,0.001284737,0.00050939317],"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.0030449315,0.000555125,0.0054717707,0.0007001482,0.00030950533,0.001769273,0.0023502314,0.1589851,0.10148842,0.32514948,0.0135704875,0.3866055],"study_design_scores_gemma":[0.00020417884,0.00066430157,0.0013335698,0.000054147218,0.00009770622,0.0023168612,0.00049655815,0.8315258,0.034259565,0.11829955,0.010595807,0.00015191744],"about_ca_topic_score_codex":0.0010731448,"about_ca_topic_score_gemma":0.0005516704,"teacher_disagreement_score":0.0021640428,"about_ca_system_score_codex":0.0011590293,"about_ca_system_score_gemma":0.0014418208,"threshold_uncertainty_score":0.011444628},"labels":[],"label_agreement":null},{"id":"W3173829726","doi":"10.1109/tsc.2021.3090365","title":"Defending Adversarial Attacks via Semantic Feature Manipulation","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Adversarial system; Computer science; Artificial intelligence; Autoencoder; Transferability; Pattern recognition (psychology); Machine learning; Intuition; Feature (linguistics); Deep learning","score_opus":0.013977471200933194,"score_gpt":0.26141477683655084,"score_spread":0.24743730563561764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173829726","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.067992955,0.00044405984,0.92630565,0.00049428,0.000067032684,0.00009523804,0.00009351888,0.0011320362,0.003375194],"genre_scores_gemma":[0.9072346,0.00022095902,0.09018546,0.00028582744,0.000055676886,0.00010134569,0.00015772236,0.00008451066,0.0016738785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982444,0.00058034394,0.000092710005,0.00033701494,0.0005710677,0.00017448899],"domain_scores_gemma":[0.9954289,0.002259452,0.00052413676,0.0014170817,0.00027769187,0.000092700226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016799459,0.0012282851,0.000980898,0.00059976475,0.000450932,0.0009179749,0.0011323057,0.0013108316,0.0010283098],"category_scores_gemma":[0.008141681,0.0003635225,0.00078966876,0.00035326055,0.001875283,0.0020008495,0.0028117076,0.002347305,0.00039987298],"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.00038533885,0.00019753803,0.004214474,0.00023565086,0.00020358845,0.00042319295,0.00021553713,0.6166204,0.06811118,0.08924492,0.0040173894,0.21613078],"study_design_scores_gemma":[0.000011171207,0.000115506824,0.00045789717,0.000020345025,0.000016494927,0.00025464033,0.00002218486,0.95955354,0.0156062385,0.022556428,0.0013670035,0.000018497416],"about_ca_topic_score_codex":0.000297691,"about_ca_topic_score_gemma":0.00037100204,"teacher_disagreement_score":0.0016799459,"about_ca_system_score_codex":0.0005330629,"about_ca_system_score_gemma":0.0004916633,"threshold_uncertainty_score":0.00888449},"labels":[],"label_agreement":null},{"id":"W3176140580","doi":"10.1109/tsc.2021.3090276","title":"Incremental Entity Summarization With Formal Concept Analysis","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Automatic summarization; Computer science; Notation; RDF; Linked data; Information retrieval; Semantic Web; Graph; Theoretical computer science; Mathematics","score_opus":0.00954880000134104,"score_gpt":0.22353189696546133,"score_spread":0.2139830969641203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176140580","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.006879267,0.0011515996,0.9856822,0.00025872752,0.00009669879,0.00020906805,0.0010490328,0.0035421022,0.0011312598],"genre_scores_gemma":[0.10634116,0.0010517575,0.8808098,0.00020333905,0.00017461566,0.00028479612,0.008646416,0.0003083789,0.0021798438],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813384,0.00034717924,0.00018586693,0.0005998128,0.0006225112,0.00011084003],"domain_scores_gemma":[0.9975491,0.00090579304,0.00026096092,0.00045138795,0.00076809904,0.00006467299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013886528,0.0017444554,0.0013984492,0.006781975,0.0010019438,0.0018848276,0.002501473,0.00086542504,0.00307205],"category_scores_gemma":[0.006383389,0.00045378204,0.002270824,0.0058528148,0.00067370496,0.004218283,0.002067559,0.0013864989,0.0012863151],"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.00014600922,0.00012917774,0.0016053433,0.0008207181,0.00019835391,0.00044442303,0.0005935804,0.055597857,0.012795832,0.025670446,0.017997297,0.8840011],"study_design_scores_gemma":[0.00007648674,0.00015468866,0.0013952565,0.00012046786,0.00037328867,0.0005807407,0.00058489654,0.8458855,0.028787728,0.06846888,0.053466983,0.000104995],"about_ca_topic_score_codex":0.0075966865,"about_ca_topic_score_gemma":0.007984934,"teacher_disagreement_score":0.0075966865,"about_ca_system_score_codex":0.0011105626,"about_ca_system_score_gemma":0.002104986,"threshold_uncertainty_score":0.01510489},"labels":[],"label_agreement":null},{"id":"W4210879831","doi":"10.1109/tsc.2022.3149847","title":"An Accurate and Privacy-Preserving Retrieval Scheme Over Outsourced Medical Images","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Mahalanobis distance; Image retrieval; Cloud computing; Encryption; Outsourcing; Scheme (mathematics); Information privacy; Private information retrieval; Content-based image retrieval; Image (mathematics); Information retrieval; Fuzzy logic; Security analysis; Data mining; Server; Computer security; Artificial intelligence; World Wide Web","score_opus":0.01447848395916748,"score_gpt":0.30124668003155736,"score_spread":0.2867681960723899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210879831","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.043777943,0.0013904595,0.95020044,0.0005756645,0.00012925446,0.00018547454,0.00026011796,0.00063842454,0.0028422861],"genre_scores_gemma":[0.7264874,0.0012262684,0.2657012,0.00040363672,0.00021338277,0.00017010783,0.00049174385,0.000066265995,0.005239942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970714,0.0004889905,0.00023994848,0.000531421,0.0013616745,0.0003064978],"domain_scores_gemma":[0.99783117,0.00033854324,0.00027151965,0.0010520532,0.0004174272,0.000089217945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013289839,0.00055056385,0.0012021959,0.0008481426,0.00072665996,0.0014102994,0.0015734222,0.00095840316,0.0017499302],"category_scores_gemma":[0.00464167,0.00030256063,0.0009031089,0.0019665556,0.0007940185,0.0030632056,0.0025026202,0.0010373059,0.00083344785],"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.0017023631,0.00025421573,0.002047225,0.0006819356,0.00021855449,0.0009144782,0.00077830674,0.08143257,0.14811173,0.09894141,0.010467956,0.65444916],"study_design_scores_gemma":[0.00025551117,0.0007749249,0.0017578311,0.00006277547,0.00017097178,0.0037699263,0.00036831683,0.79665023,0.13801222,0.03582878,0.022162983,0.00018552564],"about_ca_topic_score_codex":0.0014858922,"about_ca_topic_score_gemma":0.00092320173,"teacher_disagreement_score":0.0017499302,"about_ca_system_score_codex":0.0009322682,"about_ca_system_score_gemma":0.0015535236,"threshold_uncertainty_score":0.0070284605},"labels":[],"label_agreement":null},{"id":"W4285221287","doi":"10.1109/tsc.2022.3184013","title":"CTL-Based Adaptive Service Composition in Edge Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Quality of service; CTL*; Distributed computing; Edge device; Computer network; Cloud computing; Operating system","score_opus":0.010859377681679184,"score_gpt":0.22045319031117788,"score_spread":0.2095938126294987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285221287","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.027039662,0.00007340219,0.96554416,0.00021382667,0.000043043074,0.00008690049,0.000059791088,0.0010241626,0.005915111],"genre_scores_gemma":[0.6464943,0.00018473178,0.34222063,0.00035903367,0.000051356852,0.00030661066,0.00034097803,0.0002805277,0.0097617665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980286,0.00048372618,0.00016772654,0.00037631375,0.0005808629,0.00036273443],"domain_scores_gemma":[0.99781275,0.0010296338,0.00021325781,0.00035096114,0.0004099674,0.00018336767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020268576,0.0006089784,0.0005310159,0.00075921,0.0010398751,0.0020515118,0.0016170624,0.0011159404,0.0028139586],"category_scores_gemma":[0.0051507214,0.0004774345,0.001275811,0.00057967135,0.0018140742,0.0021641767,0.0029691276,0.0016969766,0.00064289506],"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.0005232869,0.0001846865,0.0017008593,0.00014182016,0.0000715528,0.001273181,0.00087674306,0.5294604,0.020893821,0.3917449,0.0019505266,0.051178206],"study_design_scores_gemma":[0.000032176275,0.000029579425,0.00008386119,0.000014714481,0.000019891897,0.00007538691,0.000058536058,0.9275828,0.004074445,0.06513039,0.0028833128,0.000014897561],"about_ca_topic_score_codex":0.008848873,"about_ca_topic_score_gemma":0.007579637,"teacher_disagreement_score":0.008848873,"about_ca_system_score_codex":0.0018560507,"about_ca_system_score_gemma":0.0021170618,"threshold_uncertainty_score":0.017594755},"labels":[],"label_agreement":null},{"id":"W4312505544","doi":"10.1109/tsc.2022.3219099","title":"Efficient and Privacy-Preserving Spatial-Feature-Based Reverse kNN Query","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Data mining; Encryption; Location-based service; Feature (linguistics); Leverage (statistics); Artificial intelligence; Computer security; Computer network","score_opus":0.01077334907041782,"score_gpt":0.22364905085688136,"score_spread":0.21287570178646353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312505544","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.048710253,0.00072573835,0.9416188,0.00065212697,0.000113429334,0.0004356297,0.0010178926,0.0013331934,0.0053929463],"genre_scores_gemma":[0.72145694,0.0005611865,0.2689863,0.0004756645,0.000101226826,0.00038691744,0.0018740116,0.00011444781,0.0060432623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99441177,0.0009703391,0.0006499429,0.0009864214,0.002292086,0.00068950444],"domain_scores_gemma":[0.994696,0.0012814148,0.00054540427,0.0023816759,0.00093688275,0.00015858159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023500244,0.0005918513,0.00180806,0.000824433,0.0017258173,0.0015981643,0.0027706902,0.0016047416,0.0021907976],"category_scores_gemma":[0.008138908,0.0003943,0.0010421214,0.002127854,0.0010965525,0.0066474546,0.005794431,0.001461693,0.0011139754],"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.002392906,0.0006221236,0.007992175,0.0009867115,0.00027584092,0.0013011878,0.002159099,0.18806194,0.06389622,0.22023933,0.026057705,0.4860147],"study_design_scores_gemma":[0.00017448525,0.00039753484,0.0011330397,0.000044493165,0.000094471536,0.0018327946,0.00082431565,0.8575678,0.03187637,0.08704909,0.018836353,0.00016926114],"about_ca_topic_score_codex":0.003081894,"about_ca_topic_score_gemma":0.0030877378,"teacher_disagreement_score":0.003081894,"about_ca_system_score_codex":0.0014665709,"about_ca_system_score_gemma":0.0025448436,"threshold_uncertainty_score":0.012428224},"labels":[],"label_agreement":null},{"id":"W4362653996","doi":"10.1109/tsc.2023.3264710","title":"SecBerg: Secure and Practical Iceberg Queries in Cloud","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Secret sharing; Encryption; Overhead (engineering); Materialized view; Database; Homomorphic encryption; Analytics; Cryptography; View; Computer security; Operating system; Database design","score_opus":0.017417511878690953,"score_gpt":0.2780257320390476,"score_spread":0.2606082201603567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362653996","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.08308983,0.00082251045,0.8982869,0.0011804722,0.00018341832,0.0007144892,0.00064427813,0.0040762736,0.011001783],"genre_scores_gemma":[0.82671756,0.0004761942,0.1661826,0.00042334892,0.00009549932,0.00028744517,0.00071794743,0.00021228609,0.0048871036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579924,0.0008324717,0.00039378757,0.00043229887,0.0018202319,0.0007219828],"domain_scores_gemma":[0.9932059,0.0016984999,0.0006415845,0.0032781216,0.0009156531,0.00026017983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004289644,0.0006658074,0.0010421651,0.0008787736,0.0015045633,0.0026074375,0.001870051,0.0011229904,0.0027313617],"category_scores_gemma":[0.006528444,0.00040420413,0.00064884085,0.0015143703,0.0024763742,0.007797399,0.004396467,0.0020225402,0.0010089052],"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.0032151248,0.0005593679,0.004200415,0.0004344305,0.00014510614,0.0007062503,0.0011750112,0.12746647,0.05472117,0.5299046,0.025860487,0.25161153],"study_design_scores_gemma":[0.0002683988,0.0006059705,0.00070192886,0.00006369774,0.000060368286,0.0007543694,0.00047941197,0.7059762,0.069656245,0.190359,0.030963661,0.000110737434],"about_ca_topic_score_codex":0.0016587307,"about_ca_topic_score_gemma":0.0011932509,"teacher_disagreement_score":0.004289644,"about_ca_system_score_codex":0.0016807312,"about_ca_system_score_gemma":0.0035346448,"threshold_uncertainty_score":0.022686064},"labels":[],"label_agreement":null},{"id":"W4367016307","doi":"10.1109/tsc.2023.3270169","title":"Graph-Represented Computation-Intensive Task Scheduling Over Air-Ground Integrated Vehicular Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Natural Science Foundation of Xiamen City","keywords":"Computer science; Scheduling (production processes); Subgraph isomorphism problem; Distributed computing; Integer programming; Computation; Graph; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.00886397119217571,"score_gpt":0.2293588994665663,"score_spread":0.22049492827439057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367016307","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.11160549,0.000831832,0.87885255,0.00035416064,0.00013240859,0.0001238779,0.0003358925,0.00060247333,0.0071613854],"genre_scores_gemma":[0.91145295,0.00037770273,0.08551733,0.00008344075,0.000037639402,0.00006982088,0.00034876086,0.00010144976,0.002011089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994636,0.00013419757,0.000018050807,0.000120471064,0.000095467374,0.00016823223],"domain_scores_gemma":[0.9993013,0.00036651106,0.00008118002,0.00007793632,0.000092263486,0.000080778365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005367847,0.0010782563,0.0009094852,0.0003996289,0.000563623,0.0010610583,0.0013814291,0.0006008888,0.001714538],"category_scores_gemma":[0.0017579852,0.00030032647,0.00046615483,0.001160365,0.0005136541,0.0010941739,0.0008204272,0.0006284527,0.0002311412],"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.000046860332,0.000016454918,0.0002236123,0.000035121946,0.000011066502,0.000038564238,0.0000188612,0.9831182,0.0008217957,0.0041833622,0.00058858393,0.0108975675],"study_design_scores_gemma":[0.000003817382,0.000009705893,0.00006082026,0.00000184467,0.000003368969,0.000008007266,0.000012526194,0.9962484,0.00026624472,0.003039803,0.00034382349,0.0000015788851],"about_ca_topic_score_codex":0.017896507,"about_ca_topic_score_gemma":0.018957252,"teacher_disagreement_score":0.017896507,"about_ca_system_score_codex":0.001537254,"about_ca_system_score_gemma":0.0020542666,"threshold_uncertainty_score":0.03558469},"labels":[],"label_agreement":null},{"id":"W4375802464","doi":"10.1109/tsc.2023.3273208","title":"PPOLQ: Privacy-Preserving Optimal Location Query With Multiple-Condition Filter in Outsourced Environments","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Homomorphic encryption; Paillier cryptosystem; Outsourcing; Cloud computing; Encryption; Location-based service; Information privacy; Scheme (mathematics); Masking (illustration); Protocol (science); Data mining; Computer network; Computer security; Public-key cryptography","score_opus":0.013283387205266402,"score_gpt":0.23680976822990105,"score_spread":0.22352638102463465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375802464","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.024073923,0.00033817813,0.97164494,0.0003880259,0.000056830544,0.00021679548,0.0002800284,0.001481563,0.0015197254],"genre_scores_gemma":[0.7919086,0.0004145056,0.20185398,0.00045787322,0.00012879368,0.00032765896,0.00071668345,0.00015704375,0.0040348447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945058,0.0009914313,0.0003601586,0.0009773328,0.0023731568,0.0007921601],"domain_scores_gemma":[0.9952872,0.0014906435,0.0006117344,0.0018941424,0.0005011053,0.00021525218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00376694,0.0007764991,0.0020613433,0.0007904582,0.0013107904,0.0019482559,0.0026944934,0.001755606,0.002535092],"category_scores_gemma":[0.006865946,0.00046390956,0.0011425894,0.0017983255,0.0018011858,0.006351741,0.005260161,0.0016093748,0.000741837],"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.003507987,0.00055829575,0.004889624,0.000760924,0.00032691404,0.0016397318,0.0016958793,0.2977977,0.05684032,0.24164678,0.02121195,0.36912382],"study_design_scores_gemma":[0.000328428,0.00036020172,0.0008203964,0.000028611828,0.00006612454,0.0007846219,0.00027314344,0.9027905,0.020970074,0.064530686,0.008942224,0.00010502156],"about_ca_topic_score_codex":0.0039011494,"about_ca_topic_score_gemma":0.0018447373,"teacher_disagreement_score":0.0039011494,"about_ca_system_score_codex":0.0016947606,"about_ca_system_score_gemma":0.003243522,"threshold_uncertainty_score":0.01992172},"labels":[],"label_agreement":null},{"id":"W4384519228","doi":"10.1109/tsc.2023.3294945","title":"An Approach for Incremental Mining of Clickstream Patterns as a Service Application","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Clickstream; Computer science; Data mining; Service (business); Table (database); Machine learning; Data science; World Wide Web; Web service","score_opus":0.023143972159703322,"score_gpt":0.2930586040618406,"score_spread":0.26991463190213727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384519228","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.052351862,0.00062619575,0.93286496,0.0004840463,0.00013169285,0.00044351746,0.0010921011,0.010526334,0.001479242],"genre_scores_gemma":[0.38287413,0.0004137329,0.6102323,0.00028883733,0.000147895,0.0003608594,0.00330709,0.00025408767,0.002121192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981427,0.00019890569,0.0002336799,0.00036789506,0.00087997573,0.00017677226],"domain_scores_gemma":[0.99659914,0.00090773305,0.00020714804,0.0006647134,0.0013661501,0.00025511326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013545164,0.0009890947,0.0011289218,0.0041253786,0.00084312545,0.0016831373,0.0023343673,0.00093569997,0.0009918866],"category_scores_gemma":[0.006754641,0.00050571153,0.0011739463,0.004853648,0.0004970263,0.003125294,0.0017736566,0.0010890296,0.0008942866],"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.0007747022,0.000481415,0.026036365,0.0003319431,0.00016100121,0.0011042707,0.0004871683,0.026899962,0.022385743,0.009589314,0.011698932,0.9000492],"study_design_scores_gemma":[0.00006128398,0.00024401657,0.003810093,0.00002148201,0.00008950454,0.0013572803,0.0002019807,0.9541732,0.017029209,0.013410665,0.009541635,0.000059654845],"about_ca_topic_score_codex":0.005825577,"about_ca_topic_score_gemma":0.0064434703,"teacher_disagreement_score":0.005825577,"about_ca_system_score_codex":0.0005954667,"about_ca_system_score_gemma":0.0017829456,"threshold_uncertainty_score":0.011583328},"labels":[],"label_agreement":null},{"id":"W4385516966","doi":"10.1109/tsc.2023.3301712","title":"Non-Interactive Multi-Client Searchable Symmetric Encryption With Small Client Storage","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Timestamp; Client-side; Cryptography; Scheme (mathematics); Symmetric-key algorithm; Server-side; Database; Computer security; Computer network; Public-key cryptography","score_opus":0.02565265784873051,"score_gpt":0.2608581540584238,"score_spread":0.23520549620969328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385516966","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.057781544,0.0011856756,0.9279787,0.0007070273,0.000101631784,0.0006748555,0.0005292227,0.0034197501,0.007621647],"genre_scores_gemma":[0.84950554,0.00049640104,0.13868023,0.00022826751,0.000076364435,0.00045586348,0.0005360367,0.00012986237,0.009891495],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9953767,0.00074556685,0.0005918068,0.0005770087,0.0019789839,0.0007299577],"domain_scores_gemma":[0.99188095,0.0012616111,0.00077541696,0.004700077,0.0010910507,0.0002909145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017580714,0.0007595862,0.0016601234,0.00088364095,0.0013252054,0.0018761264,0.0036381485,0.0012162392,0.0059693106],"category_scores_gemma":[0.004788125,0.0005586828,0.0010626145,0.0022545306,0.0013186566,0.007857934,0.0051905597,0.0017953961,0.002180577],"study_design_candidate":"bench_or_experimental","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.0045962525,0.0009642344,0.0042031286,0.0013744907,0.00037379723,0.0024035492,0.0011863968,0.11111803,0.191665,0.31371146,0.020552622,0.347851],"study_design_scores_gemma":[0.0004884619,0.0006667841,0.001030176,0.000081259604,0.00015158724,0.0036651888,0.00037796865,0.7866494,0.117437735,0.06654654,0.022667808,0.00023721585],"about_ca_topic_score_codex":0.0015051392,"about_ca_topic_score_gemma":0.0014163704,"teacher_disagreement_score":0.0059693106,"about_ca_system_score_codex":0.0022425053,"about_ca_system_score_gemma":0.003437037,"threshold_uncertainty_score":0.019969344},"labels":[],"label_agreement":null},{"id":"W4387164682","doi":"10.1109/tsc.2023.3320674","title":"Offloading Dependent Tasks in Edge Computing With Unknown System-Side Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; Leverage (statistics); Dependency (UML); Task (project management); Artificial intelligence; Theoretical computer science; Machine learning; Algorithm","score_opus":0.04869230615834702,"score_gpt":0.3553354334982302,"score_spread":0.3066431273398832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387164682","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.13156022,0.0004940108,0.8603375,0.0008395613,0.0001007769,0.00013236847,0.00014719121,0.0002721267,0.0061161984],"genre_scores_gemma":[0.93718314,0.00025033668,0.05655172,0.0001726392,0.00008255654,0.000121445526,0.0001166423,0.00008815403,0.005433445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888223,0.00029834194,0.000051651736,0.00029716434,0.00017811311,0.0002924398],"domain_scores_gemma":[0.99683493,0.0020101916,0.00033823328,0.00028029562,0.00028963116,0.00024678605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015629817,0.0014855433,0.0016951254,0.0005113961,0.0009853683,0.0012796323,0.0018683306,0.0019415941,0.0034940785],"category_scores_gemma":[0.005757107,0.0007005275,0.0006191611,0.0008768644,0.0011841728,0.00235313,0.0017651477,0.001683078,0.00046616237],"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.00033688755,0.00012582674,0.0007724902,0.000097246855,0.00003305296,0.00030940346,0.00010249935,0.96186817,0.003194441,0.008296115,0.0010319519,0.023832023],"study_design_scores_gemma":[0.000011470782,0.000039364633,0.00024370565,0.0000047751937,0.000008905435,0.00002869423,0.000027256996,0.9927255,0.0007730239,0.00588264,0.00024742592,0.0000071632417],"about_ca_topic_score_codex":0.004502847,"about_ca_topic_score_gemma":0.004305833,"teacher_disagreement_score":0.004502847,"about_ca_system_score_codex":0.0009896891,"about_ca_system_score_gemma":0.00118318,"threshold_uncertainty_score":0.011688888},"labels":[],"label_agreement":null},{"id":"W4387415142","doi":"10.1109/tsc.2023.3322432","title":"A Secure Satellite-Edge Computing Framework for Collaborative Line Outage Identification in Smart Grid","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China; Natural Science Foundation of Shenzhen City; Chinese University of Hong Kong, Shenzhen","keywords":"Computer science; Homomorphic encryption; Theoretical computer science; Encryption; Computer security","score_opus":0.025535924770675334,"score_gpt":0.296692298927999,"score_spread":0.27115637415732363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387415142","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.020053849,0.00024358455,0.97075224,0.00038938326,0.00005470864,0.00024493726,0.000103458886,0.002799963,0.005357823],"genre_scores_gemma":[0.6317156,0.00036801965,0.36120912,0.00020536991,0.00006359795,0.0003545173,0.0004180949,0.00016079564,0.005504773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992518,0.00017548335,0.000066781,0.00012195773,0.00026378292,0.00012022622],"domain_scores_gemma":[0.9995486,0.00008969024,0.00004293039,0.00017063906,0.00007409618,0.00007396874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011342976,0.00041133372,0.00050937664,0.0004257009,0.0009687412,0.0017353154,0.00160299,0.0008077249,0.0025545547],"category_scores_gemma":[0.0012359598,0.000248519,0.0006258463,0.00046718665,0.0008350294,0.002297433,0.0021947601,0.0010838205,0.00075817166],"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.0005947455,0.00029618165,0.0020304953,0.00024009848,0.00008640635,0.0011538914,0.0010245965,0.22335206,0.024173053,0.60964125,0.01740603,0.12000126],"study_design_scores_gemma":[0.00006189709,0.000070846494,0.00019818047,0.000022436292,0.000025963336,0.00016918182,0.00010172786,0.93315154,0.007249614,0.03540075,0.023518708,0.000029226378],"about_ca_topic_score_codex":0.004481708,"about_ca_topic_score_gemma":0.0053505925,"teacher_disagreement_score":0.004481708,"about_ca_system_score_codex":0.0009750206,"about_ca_system_score_gemma":0.0016623068,"threshold_uncertainty_score":0.008911252},"labels":[],"label_agreement":null},{"id":"W4387682044","doi":"10.1109/tsc.2023.3324734","title":"A Blockchain-Based Hedonic Game Scheme for Reputable Fog Federations","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Blockchain; Scheme (mathematics); Computer security; Game theory; Computer network; Distributed computing; Microeconomics; Economics","score_opus":0.017679681089879645,"score_gpt":0.26347713962836583,"score_spread":0.2457974585384862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387682044","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.080551006,0.0003493341,0.8978624,0.0008764374,0.00018322746,0.0007660814,0.0006640228,0.00087380264,0.01787373],"genre_scores_gemma":[0.89678514,0.00023236554,0.09487624,0.00015745912,0.000034225934,0.0003485375,0.000468544,0.000053390784,0.0070440895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981871,0.0005832546,0.000139956,0.00033185058,0.00044321085,0.00031454084],"domain_scores_gemma":[0.9970956,0.0011234866,0.00026627324,0.00064911414,0.00044691275,0.00041860028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021122794,0.0006641067,0.0011668185,0.00059372146,0.0016752493,0.0020753518,0.0028124526,0.0016966397,0.008356766],"category_scores_gemma":[0.005874109,0.000351452,0.0006748912,0.00094829773,0.001399857,0.003614816,0.00367405,0.0014995978,0.0009771116],"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.0011419229,0.00046129056,0.0028720067,0.00029534224,0.00013523159,0.0012408218,0.0009176728,0.533406,0.011201306,0.3211059,0.010130641,0.11709189],"study_design_scores_gemma":[0.00009605405,0.00008034982,0.00017646753,0.000022508922,0.000016222499,0.00012161549,0.00007311401,0.9242585,0.0013005653,0.06827085,0.005553671,0.000029994686],"about_ca_topic_score_codex":0.006833476,"about_ca_topic_score_gemma":0.008152064,"teacher_disagreement_score":0.008356766,"about_ca_system_score_codex":0.0018911851,"about_ca_system_score_gemma":0.0033997872,"threshold_uncertainty_score":0.027956188},"labels":[],"label_agreement":null},{"id":"W4388757023","doi":"10.1109/tsc.2023.3333832","title":"Matching-Based Hybrid Service Trading for Task Assignment Over Dynamic Mobile Crowdsensing Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; Natural Science Foundation of Xiamen City","keywords":"Computer science; Crowdsensing; Task (project management); Matching (statistics); Computer network; Service (business); Distributed computing; Mobile computing; Computer security","score_opus":0.011063317375239723,"score_gpt":0.25185533165920365,"score_spread":0.24079201428396393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388757023","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.06510508,0.00016851786,0.9301172,0.0002871045,0.00007150086,0.00015222607,0.00009603452,0.0008579871,0.0031444004],"genre_scores_gemma":[0.9154022,0.0000667888,0.08137766,0.000114519455,0.00004144773,0.00011090402,0.000091797214,0.0000631615,0.0027315188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979285,0.00047792416,0.00012404457,0.0005334045,0.00053688866,0.0003991915],"domain_scores_gemma":[0.99765503,0.0010733025,0.0002466475,0.00040536092,0.0003274705,0.0002921794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022029413,0.0007008233,0.0012420688,0.0007547958,0.0014679849,0.001839757,0.0030443307,0.0012934585,0.0025968417],"category_scores_gemma":[0.0057037137,0.00041154688,0.00061074394,0.0011962053,0.001003675,0.0021426333,0.002986764,0.0008801663,0.00053834106],"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.0013972623,0.00047708798,0.0026815746,0.00013806051,0.0000984161,0.0004644179,0.00056732405,0.69656825,0.029979514,0.06801389,0.0039318847,0.19568227],"study_design_scores_gemma":[0.000017678838,0.000038512593,0.00012206103,0.0000024279873,0.0000060387115,0.000031985142,0.000032474494,0.98631847,0.0014605428,0.011245916,0.00071321864,0.000010651323],"about_ca_topic_score_codex":0.0065010507,"about_ca_topic_score_gemma":0.0051334924,"teacher_disagreement_score":0.0065010507,"about_ca_system_score_codex":0.0016281139,"about_ca_system_score_gemma":0.0019303095,"threshold_uncertainty_score":0.0129264},"labels":[],"label_agreement":null},{"id":"W4389161177","doi":"10.1109/tsc.2023.3337873","title":"Decentralised Knowledge Graph Evolution via Blockchain","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Anhui Provincial Key Research and Development Plan; National Natural Science Foundation of China","keywords":"Computer science; Blockchain; Credibility; Context (archaeology); Computer security; Quality (philosophy); Smart contract; Process (computing); Publication; Database","score_opus":0.011481852271613902,"score_gpt":0.24648070542165648,"score_spread":0.23499885315004257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389161177","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.07008029,0.00028127426,0.92081416,0.0004289047,0.000051359537,0.0002261415,0.0002378994,0.0016685423,0.0062114415],"genre_scores_gemma":[0.862384,0.00023941792,0.13135007,0.00006656605,0.000020235546,0.000175133,0.0004365875,0.00008640236,0.0052415435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985234,0.00038134187,0.00007664819,0.0003401611,0.0005238813,0.00015459089],"domain_scores_gemma":[0.9977004,0.00073220243,0.00022525091,0.00075412524,0.00038123765,0.00020679888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014379224,0.0003514455,0.0006440719,0.0007883711,0.0009595325,0.0011785378,0.0014160096,0.00069482374,0.0032769223],"category_scores_gemma":[0.003854847,0.0003088771,0.00042284656,0.001267711,0.0010309569,0.0022851948,0.0026989165,0.000716244,0.00054147537],"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.00029253023,0.00013301084,0.002538818,0.00014945799,0.00006966813,0.00053451525,0.00046772754,0.75000066,0.011378143,0.07751507,0.0027200782,0.15420029],"study_design_scores_gemma":[0.000031042415,0.000042424366,0.00025519618,0.00000906089,0.000012356466,0.00007591099,0.0000469453,0.9623572,0.00275777,0.03022614,0.0041737375,0.000012112329],"about_ca_topic_score_codex":0.008560831,"about_ca_topic_score_gemma":0.0077750864,"teacher_disagreement_score":0.008560831,"about_ca_system_score_codex":0.0011608,"about_ca_system_score_gemma":0.002069669,"threshold_uncertainty_score":0.017022014},"labels":[],"label_agreement":null},{"id":"W4390533396","doi":"10.1109/tsc.2023.3349298","title":"Privacy-Preserving Convolutional Neural Network Classification Scheme With Multiple Keys","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Key Research and Development Projects of Shaanxi Province; National College Students Innovation and Entrepreneurship Training Program; Innovation Scientists and Technicians Troop Construction Projects of Henan Province; Natural Science Foundation of Henan Province; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Convolutional neural network; Activation function; Cryptosystem; Information privacy; Encryption; Functional encryption; Public-key cryptography; Theoretical computer science; Ciphertext; Artificial intelligence; Data mining; Computer security; Artificial neural network","score_opus":0.02040361260747392,"score_gpt":0.2485578780755709,"score_spread":0.22815426546809697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390533396","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.065442085,0.0005123355,0.9140571,0.0019308685,0.00027506947,0.00052801357,0.00066038815,0.0028569757,0.013737193],"genre_scores_gemma":[0.9208416,0.00030948126,0.0695076,0.00038527139,0.00008349964,0.00047026688,0.00041985215,0.00008432719,0.007898143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578273,0.00079970533,0.00039117763,0.00085869705,0.0013143459,0.000853406],"domain_scores_gemma":[0.996271,0.0007934552,0.00045935618,0.0019489469,0.00037090053,0.00015631356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002186861,0.0007515047,0.0010389225,0.0007480636,0.0015001519,0.0026234677,0.002115317,0.0016763256,0.003848981],"category_scores_gemma":[0.0053643924,0.00045816766,0.001205755,0.0013194984,0.0018212274,0.005562669,0.0050351555,0.0031146856,0.0012513966],"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.0017282938,0.000371852,0.0023717468,0.00039351036,0.00018550428,0.0011210858,0.00078927784,0.091778055,0.04901347,0.6594533,0.013392482,0.17940153],"study_design_scores_gemma":[0.0003309907,0.00029598284,0.00081293157,0.000091067945,0.00012943636,0.0010194099,0.00013146416,0.6881976,0.07114777,0.21701618,0.020688232,0.00013888745],"about_ca_topic_score_codex":0.0012806668,"about_ca_topic_score_gemma":0.0010120445,"teacher_disagreement_score":0.003848981,"about_ca_system_score_codex":0.0027224116,"about_ca_system_score_gemma":0.003093632,"threshold_uncertainty_score":0.019752562},"labels":[],"label_agreement":null},{"id":"W4391020236","doi":"10.1109/tsc.2024.3355937","title":"Hierarchical Deep Reinforcement Learning for Joint Service Caching and Computation Offloading in Mobile Edge-Cloud Computing","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Chongqing Research Program of Basic Research and Frontier Technology; Chongqing University of Posts and Telecommunications","keywords":"Computer science; Computation offloading; Cloud computing; Reinforcement learning; Distributed computing; Edge computing; Latency (audio); Mobile edge computing; Mobile cloud computing; Enhanced Data Rates for GSM Evolution; Server; Edge device; Computer network; Artificial intelligence","score_opus":0.019954411153909345,"score_gpt":0.2733401587742251,"score_spread":0.25338574762031574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391020236","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.07004827,0.00055357214,0.92477775,0.00055454014,0.000072209914,0.00006525812,0.00004945061,0.0006747141,0.0032042088],"genre_scores_gemma":[0.96883744,0.000105518906,0.029388279,0.00017483698,0.000024019198,0.000056389996,0.00004920844,0.000033994987,0.0013303936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994974,0.00013111695,0.00002025036,0.000107684384,0.00008477721,0.00015869964],"domain_scores_gemma":[0.9989976,0.000583795,0.000104810504,0.00005304219,0.0001673641,0.00009340015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066161,0.00081776525,0.0012097671,0.00028559825,0.0004135711,0.0006960774,0.0013217466,0.00095674087,0.0014187401],"category_scores_gemma":[0.0027694097,0.00038633088,0.00036237325,0.00032891365,0.00088734704,0.00092197466,0.0009916325,0.0015236753,0.00019249199],"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.00007220081,0.00006919442,0.0007408566,0.000032086587,0.000021649834,0.000043388398,0.000032563916,0.97313267,0.0007254664,0.0034726,0.0007420566,0.020915339],"study_design_scores_gemma":[0.0000032965115,0.0000062763916,0.000025199526,0.0000010779532,0.0000014920155,0.0000018451835,0.0000021166918,0.99917704,0.00006746805,0.0006785476,0.000034608864,9.328596e-7],"about_ca_topic_score_codex":0.0153803965,"about_ca_topic_score_gemma":0.01435763,"teacher_disagreement_score":0.0153803965,"about_ca_system_score_codex":0.0013828725,"about_ca_system_score_gemma":0.002193043,"threshold_uncertainty_score":0.030581713},"labels":[],"label_agreement":null},{"id":"W4392902703","doi":"10.1109/tsc.2024.3376203","title":"EPSet: Efficient and Privacy-Preserving Set Similarity Range Query Over Encrypted Data","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Range query (database); Encryption; Set (abstract data type); Similarity (geometry); Range (aeronautics); Information privacy; Query optimization; Data mining; Theoretical computer science; Information retrieval; Web search query; Sargable; Computer security; Search engine; Artificial intelligence","score_opus":0.032285111092386944,"score_gpt":0.2907963364408818,"score_spread":0.25851122534849486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392902703","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.053478304,0.0009939387,0.9380049,0.0006314458,0.00014393311,0.0005400542,0.0009656312,0.0012319771,0.0040097865],"genre_scores_gemma":[0.8516996,0.00079162384,0.14094378,0.00040816164,0.00014958813,0.00036200142,0.0013325578,0.00006660501,0.0042462074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944535,0.0010241675,0.0006536663,0.000654593,0.0026489699,0.0005650979],"domain_scores_gemma":[0.9948949,0.00132264,0.0005854407,0.002206518,0.0007970122,0.00019353033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023549495,0.00052780204,0.001510054,0.0012488288,0.0010811697,0.001615166,0.0018921565,0.0011981598,0.0019753547],"category_scores_gemma":[0.0073136166,0.00028186472,0.00091689796,0.002619847,0.00094273454,0.006222513,0.004663914,0.0013490039,0.000786828],"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.0030945772,0.0007211474,0.006326977,0.0010336277,0.00041956664,0.002005368,0.0018662625,0.12958871,0.09698231,0.19683474,0.024171948,0.5369547],"study_design_scores_gemma":[0.00027423495,0.0009011596,0.002267987,0.000073211544,0.000116497176,0.003376968,0.0007364895,0.8281776,0.06214923,0.078491606,0.023246866,0.00018826297],"about_ca_topic_score_codex":0.001363178,"about_ca_topic_score_gemma":0.000794532,"teacher_disagreement_score":0.0023549495,"about_ca_system_score_codex":0.0011143964,"about_ca_system_score_gemma":0.0015589737,"threshold_uncertainty_score":0.012454331},"labels":[],"label_agreement":null},{"id":"W4392909546","doi":"10.1109/tsc.2024.3376202","title":"PBScaler: A Bottleneck-Aware Autoscaling Framework for Microservice-Based Applications","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Bottleneck; Distributed computing; Embedded system","score_opus":0.012519443571426016,"score_gpt":0.27997682920641154,"score_spread":0.2674573856349855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392909546","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.01305148,0.00051896984,0.96246654,0.000109167864,0.00006354662,0.000113057344,0.000096789154,0.021943634,0.0016367679],"genre_scores_gemma":[0.4224602,0.00067705894,0.56938374,0.00020676543,0.000083928324,0.00042047165,0.00048212902,0.0028129886,0.0034727245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996247,0.00005225417,0.00002074422,0.00008780963,0.0001604576,0.000053952605],"domain_scores_gemma":[0.99961984,0.00011695356,0.000057403213,0.00007093004,0.000079180856,0.000055669476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007482179,0.0011649217,0.0007540147,0.0006122202,0.00046860072,0.0008579023,0.0024305682,0.0007186113,0.002220464],"category_scores_gemma":[0.0013682637,0.00050945993,0.00085351523,0.00033219453,0.0006156329,0.0011662695,0.0012239639,0.0013307102,0.0006115795],"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.00020805396,0.00023686187,0.0018786242,0.0003369254,0.00012004307,0.00019510911,0.00020923588,0.71808547,0.04622751,0.02005542,0.009600864,0.2028458],"study_design_scores_gemma":[0.000016755414,0.000031815172,0.00012592942,0.0000063679763,0.000009294272,0.000023795537,0.000009672185,0.9918006,0.0031319256,0.0024364933,0.0023913735,0.000015943666],"about_ca_topic_score_codex":0.004325908,"about_ca_topic_score_gemma":0.005957558,"teacher_disagreement_score":0.004325908,"about_ca_system_score_codex":0.0007416617,"about_ca_system_score_gemma":0.0015192884,"threshold_uncertainty_score":0.008601427},"labels":[],"label_agreement":null},{"id":"W4392980148","doi":"10.1109/tsc.2024.3377931","title":"Efficient and Privacy-Preserving Federated Learning Against Poisoning Adversaries","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; Higher Education Discipline Innovation Project; Ant Group","keywords":"Computer science; Upload; Federated learning; Computer security; Overhead (engineering); Confidentiality; Scale (ratio); Artificial intelligence; Machine learning; World Wide Web","score_opus":0.014776672205271043,"score_gpt":0.254950718373431,"score_spread":0.24017404616815993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392980148","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.041536774,0.00014809119,0.9555008,0.00038723857,0.000027196465,0.00008454261,0.00009073507,0.0015459195,0.000678687],"genre_scores_gemma":[0.90024096,0.000092259186,0.09786793,0.00020978888,0.000031113566,0.00011086264,0.0002359723,0.000067770845,0.0011433681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99453485,0.0017520294,0.00037907026,0.0013785984,0.0013140333,0.00064154353],"domain_scores_gemma":[0.9903566,0.0025455665,0.0009462325,0.0047811493,0.00093545124,0.00043484583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056119226,0.0011810435,0.0020899752,0.00097213074,0.0016880744,0.0020345314,0.0031857255,0.0018922789,0.0009682383],"category_scores_gemma":[0.014337482,0.00058198377,0.0016275584,0.0012906768,0.002074619,0.0060861288,0.0068085664,0.002875358,0.0004782134],"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.0010597343,0.000459248,0.006346407,0.00016911207,0.00025319113,0.0005507668,0.0006112696,0.7307782,0.01358183,0.054567643,0.004537383,0.18708523],"study_design_scores_gemma":[0.000023883531,0.00006263101,0.00017819127,0.0000075318962,0.000017722043,0.000113888396,0.00005936399,0.9629087,0.0044534374,0.031655293,0.0005061786,0.000013258269],"about_ca_topic_score_codex":0.0011110774,"about_ca_topic_score_gemma":0.0010779656,"teacher_disagreement_score":0.0056119226,"about_ca_system_score_codex":0.0014675201,"about_ca_system_score_gemma":0.0024305254,"threshold_uncertainty_score":0.02967906},"labels":[],"label_agreement":null},{"id":"W4397026309","doi":"10.1109/tsc.2024.3402169","title":"Task Decomposition and Hierarchical Scheduling for Collaborative Cloud-Edge-End Computing","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Distributed computing; Cloud computing; Scheduling (production processes); Granularity; Edge computing; Operating system","score_opus":0.014031441460468636,"score_gpt":0.2831515233503029,"score_spread":0.2691200818898343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397026309","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.027905153,0.00031120618,0.96837896,0.0001690028,0.00006951767,0.00006467783,0.000063228385,0.00043539846,0.0026028217],"genre_scores_gemma":[0.70190763,0.00027582873,0.29503497,0.00012328979,0.00006011416,0.00012183634,0.00019765261,0.000107352666,0.0021713753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995448,0.00010036806,0.000026190864,0.0001031974,0.00011099067,0.00011448933],"domain_scores_gemma":[0.9995159,0.00013826149,0.000053077903,0.00011049985,0.00010706051,0.000075250944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059079455,0.0005705995,0.000477026,0.0003639183,0.00069113204,0.0006945891,0.0010462272,0.00037850527,0.00152062],"category_scores_gemma":[0.0013594384,0.00019928209,0.00050637714,0.00066232873,0.0003642102,0.0010520181,0.0008336775,0.0007793742,0.0003230334],"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.0002028183,0.000151764,0.0012840914,0.00013918603,0.000044598415,0.00012904695,0.00017881794,0.8359111,0.013373867,0.024648618,0.006081393,0.1178547],"study_design_scores_gemma":[0.000006450035,0.000023561948,0.00015129292,0.0000027809836,0.00000498201,0.000019508278,0.000020102963,0.9921296,0.0008430028,0.0057583437,0.0010355134,0.000004789631],"about_ca_topic_score_codex":0.008342616,"about_ca_topic_score_gemma":0.013466115,"teacher_disagreement_score":0.008342616,"about_ca_system_score_codex":0.0010397279,"about_ca_system_score_gemma":0.001764899,"threshold_uncertainty_score":0.016588151},"labels":[],"label_agreement":null},{"id":"W4399169020","doi":"10.1109/tsc.2024.3407485","title":"Server-Assisted Data Sharing System Supporting Conjunctive Keyword Search for Vehicular Social Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Key Research and Development Projects of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Keyword search; Computer network; File server; Information retrieval","score_opus":0.06109360921267264,"score_gpt":0.3071085501188956,"score_spread":0.24601494090622295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399169020","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.29144445,0.00058509386,0.69723344,0.00034507207,0.00013126658,0.00035425284,0.00024542937,0.005961339,0.003699655],"genre_scores_gemma":[0.96690214,0.0000758645,0.03083021,0.00006252303,0.000035155925,0.000089332,0.00020086174,0.000025261805,0.0017785856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855965,0.00033090636,0.00018483185,0.0003608789,0.0003496651,0.00021410118],"domain_scores_gemma":[0.9972767,0.00052195374,0.00023835288,0.0010118344,0.000644278,0.0003069222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001058632,0.0004955447,0.0012375189,0.00065247103,0.0016219252,0.001263253,0.002299944,0.0009418493,0.0018636573],"category_scores_gemma":[0.0022483927,0.00032441266,0.00053563016,0.0009100652,0.0006452494,0.0028260264,0.003047851,0.0005941981,0.0009609886],"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.0061317664,0.0014862193,0.018441265,0.0009311284,0.0007429885,0.004429402,0.0034034941,0.14442353,0.25471747,0.08662718,0.019943617,0.458722],"study_design_scores_gemma":[0.00015309207,0.000504938,0.0009805763,0.000015907803,0.00012757455,0.0010602083,0.0003315697,0.9264869,0.050395817,0.011691651,0.008148567,0.00010312588],"about_ca_topic_score_codex":0.0016382976,"about_ca_topic_score_gemma":0.0010967968,"teacher_disagreement_score":0.002299944,"about_ca_system_score_codex":0.00081137946,"about_ca_system_score_gemma":0.00158746,"threshold_uncertainty_score":0.0062345862},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W4400646958","doi":"10.1109/tsc.2024.3428329","title":"Is Stubborn Mining Severe in Imperfect GHOST Bitcoin-Like Blockchains? Quantitative Analysis","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Imperfect; Computer security; Data mining","score_opus":0.015344543175510789,"score_gpt":0.279495054435589,"score_spread":0.26415051126007816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400646958","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.7631697,0.00040642094,0.22790769,0.00093798124,0.00003402147,0.00010336542,0.00018089279,0.00023365438,0.0070262575],"genre_scores_gemma":[0.9978963,0.00006132255,0.0017640794,0.000014162169,0.000003700512,0.000008401249,0.000018813069,0.0000054800757,0.00022764021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981402,0.00063877576,0.0000767234,0.00022658221,0.0005867816,0.00033092572],"domain_scores_gemma":[0.98272806,0.010198644,0.00315893,0.0021570094,0.00113911,0.0006182193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003650894,0.0003036472,0.0005801578,0.00084311375,0.00072298385,0.0016872148,0.00087439356,0.00072673406,0.0017722085],"category_scores_gemma":[0.019515501,0.00023692966,0.0003308765,0.0006034462,0.002786788,0.0054690256,0.001168622,0.00106629,0.00010144209],"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.00043446032,0.00013363324,0.02122688,0.00021855746,0.00010148235,0.0007998847,0.0005678294,0.6348412,0.016471494,0.30562544,0.0012213745,0.018357757],"study_design_scores_gemma":[0.000011705632,0.000080788814,0.0024326527,0.000018870169,0.000015384707,0.00015454994,0.00020414236,0.9175813,0.0036711018,0.07532289,0.000485524,0.000021078196],"about_ca_topic_score_codex":0.0019716094,"about_ca_topic_score_gemma":0.0014996814,"teacher_disagreement_score":0.003650894,"about_ca_system_score_codex":0.0020487206,"about_ca_system_score_gemma":0.001152347,"threshold_uncertainty_score":0.019307971},"labels":[],"label_agreement":null},{"id":"W4401387233","doi":"10.1109/tsc.2024.3440028","title":"Adaptive Network Management Service Based on Control Relation Graph for Software-Defined LEO Satellite Networks in 6G","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Satellite Communication Systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Relation (database); Computer network; Graph; Software; Software-defined networking; Distributed computing; Theoretical computer science; Data mining; Programming language","score_opus":0.015220420725023819,"score_gpt":0.22712224295127986,"score_spread":0.21190182222625603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401387233","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.04117637,0.0003708336,0.9435264,0.0012661654,0.00013562386,0.00029088603,0.00022610242,0.0029347118,0.010072979],"genre_scores_gemma":[0.8505098,0.00037436202,0.14173713,0.00033886704,0.000090024,0.00019845637,0.0006128723,0.00008470282,0.006053796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993061,0.00018450366,0.00003890349,0.00015354907,0.00019969075,0.000117268944],"domain_scores_gemma":[0.9995654,0.00016725731,0.00005348328,0.00006957059,0.0000950521,0.000049166618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071817625,0.0004500171,0.00045574055,0.0006078282,0.00070549705,0.0012534292,0.0010502302,0.0006968171,0.0030050187],"category_scores_gemma":[0.0015442359,0.00017140328,0.00053418346,0.0006812032,0.0005384609,0.0014084982,0.0009173755,0.0007244708,0.00033852618],"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.00046838948,0.00029317246,0.0024081315,0.00023027493,0.00006535818,0.0011417014,0.0005055643,0.42982808,0.019121274,0.32624498,0.024676353,0.19501673],"study_design_scores_gemma":[0.000015152629,0.000022623002,0.00016446135,0.0000055917467,0.000011251128,0.000044936154,0.000035686313,0.98224235,0.0010588915,0.013217967,0.0031722332,0.0000088552915],"about_ca_topic_score_codex":0.015926976,"about_ca_topic_score_gemma":0.019194854,"teacher_disagreement_score":0.015926976,"about_ca_system_score_codex":0.0014896891,"about_ca_system_score_gemma":0.0015165487,"threshold_uncertainty_score":0.031668544},"labels":[],"label_agreement":null},{"id":"W4401387267","doi":"10.1109/tsc.2024.3440012","title":"Confidential Distributed Ledgers for Online Syndicated Lending","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"FinTech, Crowdfunding, Digital Finance","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"National Natural Science Foundation of China","keywords":"Computer science; Ledger; Confidentiality; Computer security; Business; Accounting","score_opus":0.019713696129589744,"score_gpt":0.2583913706933419,"score_spread":0.23867767456375216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401387267","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.167043,0.00059760944,0.7502933,0.0014261341,0.000343649,0.0014215471,0.00051026064,0.05452836,0.023836097],"genre_scores_gemma":[0.798392,0.00018374075,0.17442267,0.0002536568,0.00010606316,0.00055636495,0.00052023964,0.0005023192,0.025062995],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977719,0.00058378646,0.0001521751,0.0003791053,0.00081620604,0.00029682583],"domain_scores_gemma":[0.995033,0.00086934183,0.00033922723,0.00288746,0.0004416221,0.00042933307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023676069,0.0005617397,0.0008448988,0.000831251,0.0017868136,0.0021973345,0.0026487003,0.0014380319,0.014778477],"category_scores_gemma":[0.0060045714,0.00060567295,0.00042640616,0.0009475383,0.001203302,0.0049650664,0.0063166656,0.0018863111,0.003877711],"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.0033168735,0.0019504259,0.013401004,0.00045469648,0.00015006243,0.0026134641,0.0028304972,0.031690337,0.049939726,0.124081105,0.066595346,0.7029766],"study_design_scores_gemma":[0.0008104853,0.0009415522,0.003960354,0.0001591361,0.000118981305,0.0014966928,0.00070302584,0.689837,0.071086876,0.067006886,0.1635829,0.00029613444],"about_ca_topic_score_codex":0.0010329068,"about_ca_topic_score_gemma":0.0013626413,"teacher_disagreement_score":0.014778477,"about_ca_system_score_codex":0.00096336385,"about_ca_system_score_gemma":0.0016634784,"threshold_uncertainty_score":0.049438894},"labels":[],"label_agreement":null},{"id":"W4401943215","doi":"10.1109/tsc.2024.3451165","title":"An Efficient and Multi-Private Key Secure Aggregation Scheme for Federated Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Scheme (mathematics); Key (lock); Public-key cryptography; Distributed computing; Computer network; Theoretical computer science; Computer security; Encryption","score_opus":0.014416861733340301,"score_gpt":0.2711689967980994,"score_spread":0.25675213506475913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401943215","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.020131318,0.00019040599,0.97735685,0.00026651533,0.000044624,0.000097111486,0.00008280539,0.000865235,0.000964995],"genre_scores_gemma":[0.8329864,0.00017264402,0.16358678,0.00021090286,0.0000484806,0.0001823133,0.00021412602,0.000055103883,0.0025432184],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962458,0.000870101,0.00042779496,0.0007480024,0.0012687531,0.00043955704],"domain_scores_gemma":[0.99674916,0.0006160122,0.00037402636,0.001562804,0.0005208465,0.00017716653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028194268,0.00066498993,0.0015630963,0.0009229915,0.0016347776,0.0016739187,0.002436495,0.0016444206,0.0016360461],"category_scores_gemma":[0.005643626,0.00036371886,0.0011952723,0.0015861334,0.0012528754,0.0058865575,0.0051053716,0.0021572507,0.0005801559],"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.0015143842,0.00046365638,0.003048577,0.0002792138,0.00026947891,0.0007417034,0.0009697523,0.27029505,0.03141033,0.26433092,0.0092838155,0.41739312],"study_design_scores_gemma":[0.00006442685,0.00009842921,0.00028592665,0.000016461194,0.000033546006,0.00032221046,0.00005981831,0.8984591,0.012913919,0.08512452,0.0025658647,0.000055800625],"about_ca_topic_score_codex":0.0008794885,"about_ca_topic_score_gemma":0.0006880685,"teacher_disagreement_score":0.0028194268,"about_ca_system_score_codex":0.0013959402,"about_ca_system_score_gemma":0.0019434089,"threshold_uncertainty_score":0.014910758},"labels":[],"label_agreement":null},{"id":"W4402170631","doi":"10.1109/tsc.2024.3453764","title":"A Federated Learning Architecture for Blockchain DDoS Attacks Detection","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Blockchain; Computer science; Denial-of-service attack; Architecture; Computer security; Computer network; The Internet; World Wide Web","score_opus":0.01087898714409547,"score_gpt":0.2471376184563864,"score_spread":0.23625863131229094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402170631","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.14151226,0.00039608707,0.8489344,0.0004286927,0.000074937336,0.00015625551,0.00014769699,0.005710754,0.0026388962],"genre_scores_gemma":[0.93212485,0.000092198934,0.065618426,0.00011355044,0.000019999923,0.00008003212,0.00020465667,0.00002315931,0.0017232012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937433,0.00013034769,0.000047188274,0.00018619769,0.00016948643,0.00009241677],"domain_scores_gemma":[0.9990877,0.00020302349,0.00009896236,0.00022853664,0.00029527774,0.000086553904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012383908,0.0004891313,0.0008545951,0.0008187153,0.00083551765,0.0007522624,0.0015894497,0.0009860791,0.0014452359],"category_scores_gemma":[0.002010261,0.00023793434,0.00038427208,0.0006045371,0.0005686485,0.0016527632,0.0013633156,0.00082575076,0.00040380243],"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.0007128223,0.00065551663,0.0070932554,0.00006681861,0.000115256174,0.00020037882,0.00015932694,0.5727282,0.011437588,0.0046226825,0.0025627583,0.39964542],"study_design_scores_gemma":[0.000009251647,0.000041660038,0.00022887885,0.0000022361887,0.0000057281595,0.000020278903,0.0000073698475,0.99632543,0.0016959462,0.0014247664,0.00023333565,0.0000050790995],"about_ca_topic_score_codex":0.0066456315,"about_ca_topic_score_gemma":0.005836252,"teacher_disagreement_score":0.0066456315,"about_ca_system_score_codex":0.00094105146,"about_ca_system_score_gemma":0.0014426777,"threshold_uncertainty_score":0.013213873},"labels":[],"label_agreement":null},{"id":"W4402592572","doi":"10.1109/tsc.2024.3463431","title":"Towards Auditable and Privacy-Preserving Online Medical Diagnosis Service Over Cloud","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Big Data Technologies and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Computer security; Internet privacy; Information privacy","score_opus":0.10680652969072472,"score_gpt":0.3745486295845845,"score_spread":0.2677420998938598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402592572","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.06028184,0.00088091835,0.9283919,0.002247289,0.00018067729,0.0005810683,0.0002609429,0.0018279157,0.005347513],"genre_scores_gemma":[0.8922915,0.00043316666,0.10390351,0.00042833615,0.00011695361,0.00016797801,0.00021334014,0.000039820654,0.0024053366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952042,0.0015121568,0.0003596239,0.0006687435,0.0016168822,0.000638436],"domain_scores_gemma":[0.99317026,0.0017037397,0.0010384503,0.0023726043,0.0011211772,0.0005937504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034621186,0.0004922366,0.0010116107,0.0009674403,0.0018186105,0.0029078382,0.0023884191,0.0018177062,0.002463232],"category_scores_gemma":[0.007516515,0.00034741402,0.0007699651,0.0017174123,0.0012215083,0.004725585,0.00614718,0.0023051624,0.00075469795],"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.0042111063,0.0012308153,0.012589559,0.00081572443,0.00025423677,0.0033574286,0.0019483208,0.10605877,0.06748639,0.33295015,0.017993186,0.45110434],"study_design_scores_gemma":[0.00021610921,0.0002529145,0.001202583,0.00007614808,0.00009747682,0.0016345506,0.00033686607,0.8680575,0.025161132,0.089922905,0.0129456725,0.00009610058],"about_ca_topic_score_codex":0.001692815,"about_ca_topic_score_gemma":0.0011453955,"teacher_disagreement_score":0.0034621186,"about_ca_system_score_codex":0.0012199123,"about_ca_system_score_gemma":0.0046282876,"threshold_uncertainty_score":0.018309653},"labels":[],"label_agreement":null},{"id":"W4404179505","doi":"10.1109/tsc.2024.3495513","title":"Exploiting Stragglers in Distributed Computing Systems With Task Grouping","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Toronto","funders":"","keywords":"Computer science; Task (project management); Distributed database; Distributed computing; Theoretical computer science","score_opus":0.012161153168769272,"score_gpt":0.2258254160158117,"score_spread":0.2136642628470424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404179505","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.30012465,0.00241031,0.6912801,0.00063544465,0.00021979163,0.0003671012,0.00008763049,0.0025635557,0.0023114935],"genre_scores_gemma":[0.87111765,0.00048967026,0.12607045,0.00014828895,0.000115661685,0.00020084361,0.00011674507,0.00019951149,0.001541046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967096,0.0010389596,0.00026180677,0.00065856514,0.0008318805,0.00049927377],"domain_scores_gemma":[0.99116653,0.0032543181,0.001405419,0.0027328876,0.0007809879,0.0006597584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032751735,0.001276454,0.0017534823,0.0016127771,0.0025555342,0.0018093506,0.0028569184,0.0012973493,0.0010541942],"category_scores_gemma":[0.0104786735,0.0009300635,0.00082723174,0.002257247,0.0018466638,0.0038256338,0.0033076701,0.0013871632,0.00050782],"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.0013784502,0.00067355396,0.010778097,0.00078518316,0.00032231936,0.0014753852,0.003048152,0.72536296,0.04996255,0.017551614,0.0032853223,0.18537638],"study_design_scores_gemma":[0.00010940085,0.0008898837,0.0019590263,0.000052307307,0.00013268167,0.00046697215,0.0006052617,0.933664,0.015909232,0.0374816,0.008646433,0.00008322865],"about_ca_topic_score_codex":0.0038546203,"about_ca_topic_score_gemma":0.0032982908,"teacher_disagreement_score":0.0038546203,"about_ca_system_score_codex":0.0010053623,"about_ca_system_score_gemma":0.0018791114,"threshold_uncertainty_score":0.01732099},"labels":[],"label_agreement":null},{"id":"W4406259673","doi":"10.1109/tsc.2025.3528317","title":"A Customized Genetic Algorithm for SLA-Aware Service Provisioning in Infrastructure-Less Vehicular Cloud Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"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; Cloud computing; Provisioning; Distributed computing; Computer network; Intelligent transportation system; Cluster analysis; Vehicular ad hoc network; Wireless ad hoc network; Resource management (computing); Wireless; Telecommunications","score_opus":0.004774386599387035,"score_gpt":0.21566380274198035,"score_spread":0.21088941614259332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406259673","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.029186236,0.00019810599,0.9655138,0.00023832059,0.000073051,0.00011389493,0.000053655967,0.00046191696,0.004160995],"genre_scores_gemma":[0.5584141,0.0002438352,0.43759182,0.0002154676,0.0000475303,0.00030230702,0.00019188975,0.00011315958,0.0028798745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967015,0.00010010093,0.000012457661,0.000055738266,0.00008223179,0.00007922541],"domain_scores_gemma":[0.9995022,0.00027397834,0.000058535086,0.0000265565,0.00010083831,0.000037976744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007505564,0.00084042037,0.0008213119,0.000650495,0.00056555565,0.0008279265,0.0012684762,0.001136792,0.0016793966],"category_scores_gemma":[0.001807869,0.00039018577,0.00062453456,0.0008659311,0.0005265112,0.00056037575,0.0008089777,0.0007572745,0.00025425406],"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.000019116931,0.000023693408,0.00019006923,0.0000133560825,0.000011037021,0.000028171686,0.000016853153,0.97933185,0.00052730157,0.0025216104,0.0004918191,0.01682514],"study_design_scores_gemma":[0.000006907582,0.000009357641,0.000026628573,0.0000018936956,0.000002277718,0.000005193888,0.000005075807,0.9991381,0.000089254245,0.0005596124,0.00015404772,0.0000016060632],"about_ca_topic_score_codex":0.0134884,"about_ca_topic_score_gemma":0.010828367,"teacher_disagreement_score":0.0134884,"about_ca_system_score_codex":0.0012126883,"about_ca_system_score_gemma":0.0023277914,"threshold_uncertainty_score":0.026819825},"labels":[],"label_agreement":null},{"id":"W4406983186","doi":"10.1109/tsc.2025.3536320","title":"DeFedGCN: Privacy-Preserving Decentralized Federated GCN for Recommender System","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Recommender system; Information privacy; Computer security; Internet privacy; World Wide Web","score_opus":0.01909109743749904,"score_gpt":0.2816092261796781,"score_spread":0.26251812874217906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406983186","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.050173316,0.00038229386,0.94505256,0.0003368043,0.00007335193,0.00010498675,0.00022610129,0.0017644011,0.0018862305],"genre_scores_gemma":[0.8175919,0.00020771942,0.1770037,0.00032916223,0.000041536397,0.00011488819,0.00057231245,0.000065362,0.0040734624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989784,0.00023238925,0.00004275754,0.00031915575,0.00029220898,0.00013513918],"domain_scores_gemma":[0.9979195,0.0006423152,0.00019631251,0.00071042706,0.00042253008,0.00010892145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015155337,0.00062007265,0.00092539017,0.00059537496,0.00096661015,0.0007739238,0.002608889,0.0013659813,0.0010068226],"category_scores_gemma":[0.004384393,0.00038461864,0.0005396205,0.00079029356,0.00088021957,0.0016437083,0.0015898197,0.0011701281,0.00028906466],"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.00042306117,0.00016219285,0.003007831,0.00013736683,0.0001143349,0.00025061122,0.00019356834,0.7518919,0.009568462,0.019880237,0.006813235,0.20755711],"study_design_scores_gemma":[0.000015429789,0.000033851735,0.00017369328,0.0000037378925,0.000009363783,0.000043833646,0.000014166329,0.993083,0.001231311,0.004552396,0.0008310105,0.000008236396],"about_ca_topic_score_codex":0.019339113,"about_ca_topic_score_gemma":0.030322365,"teacher_disagreement_score":0.019339113,"about_ca_system_score_codex":0.0016421301,"about_ca_system_score_gemma":0.0023367305,"threshold_uncertainty_score":0.038453102},"labels":[],"label_agreement":null},{"id":"W4407098027","doi":"10.1109/tsc.2025.3536359","title":"Uncertainty-Driven Pattern Mining on Incremental Data for Stream Analyzing Service","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Data mining; Data stream mining; Data stream; Telecommunications","score_opus":0.03736657885631272,"score_gpt":0.31358590360074545,"score_spread":0.2762193247444327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407098027","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.03945493,0.00037756108,0.9564448,0.00030158687,0.000038056565,0.0001693124,0.00080356427,0.0018646742,0.0005454677],"genre_scores_gemma":[0.45536977,0.00049631315,0.5396086,0.00017217317,0.0000883074,0.00036866916,0.003020358,0.00012633465,0.00074945163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983558,0.00024279194,0.00020914052,0.00029957166,0.0007631657,0.00012959207],"domain_scores_gemma":[0.9959468,0.0018819117,0.00042799665,0.0004842291,0.001125803,0.00013327468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014626198,0.0008232822,0.0012927928,0.0032586993,0.000763368,0.0013343933,0.0015900461,0.00055314833,0.00070577476],"category_scores_gemma":[0.008095733,0.00039450833,0.0012010954,0.004531569,0.00041756948,0.0021816303,0.0013440645,0.0011342937,0.00036638672],"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.00060647924,0.00024943787,0.026395032,0.00042507602,0.00025021745,0.0010473621,0.000645854,0.32171568,0.010905628,0.017532244,0.0070888107,0.61313814],"study_design_scores_gemma":[0.000010840945,0.000035881334,0.00073103147,0.000008753013,0.000020625383,0.00011620353,0.0000658421,0.9866019,0.0024575845,0.0087736705,0.0011668004,0.000011015248],"about_ca_topic_score_codex":0.005156714,"about_ca_topic_score_gemma":0.00459227,"teacher_disagreement_score":0.005156714,"about_ca_system_score_codex":0.00072500197,"about_ca_system_score_gemma":0.0015693413,"threshold_uncertainty_score":0.010253429},"labels":[],"label_agreement":null},{"id":"W4407782981","doi":"10.1109/tsc.2025.3544124","title":"Joint Trajectory Optimization and Resource Allocation in UAV-MEC Systems: A Lyapunov-Assisted DRL Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Computer science; Trajectory; Joint (building); Resource allocation; Trajectory optimization; Lyapunov optimization; Resource management (computing); Lyapunov function; Mathematical optimization; Distributed computing; Lyapunov equation; Lyapunov exponent; Computer network; Optimal control; Artificial intelligence; Engineering; Nonlinear system; Mathematics","score_opus":0.018640206498967433,"score_gpt":0.23726839522926302,"score_spread":0.21862818873029558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407782981","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.021557584,0.00028850217,0.97333163,0.0003825012,0.00003393483,0.00004350866,0.00003798814,0.00025364207,0.004070811],"genre_scores_gemma":[0.9256289,0.00018457317,0.069900066,0.00017298874,0.000030356145,0.00014123537,0.000086318985,0.00007881493,0.0037766856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997391,0.00007906489,0.00001108441,0.000052767515,0.00005518314,0.00006283089],"domain_scores_gemma":[0.9991848,0.00047015407,0.00011284204,0.000038959508,0.00014203011,0.000051351275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072407705,0.0009110985,0.00084906723,0.0003145339,0.00034971538,0.0007555068,0.0007866784,0.000810285,0.0019564768],"category_scores_gemma":[0.0018760497,0.00044074302,0.00038973312,0.0003076888,0.0006383981,0.0006546414,0.001023215,0.00097272417,0.00028327532],"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.000018607912,0.000015907539,0.0002300791,0.000023691455,0.000009158502,0.000038099915,0.000020843132,0.9888553,0.0006001214,0.0025122277,0.00032846077,0.0073474892],"study_design_scores_gemma":[0.0000021045403,0.0000084703615,0.000018127252,0.0000014171725,0.0000010556982,0.000002807083,0.0000035677015,0.99939334,0.0000720478,0.00042309123,0.00007300213,9.3399456e-7],"about_ca_topic_score_codex":0.0071423426,"about_ca_topic_score_gemma":0.00561398,"teacher_disagreement_score":0.0071423426,"about_ca_system_score_codex":0.00082740164,"about_ca_system_score_gemma":0.0013182377,"threshold_uncertainty_score":0.014201522},"labels":[],"label_agreement":null},{"id":"W4408100372","doi":"10.1109/tsc.2025.3547221","title":"Service Migration for Delay-Sensitive IoT Applications in Edge Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Fundamental Research Funds for the Central Universities; China Geological Survey; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Enhanced Data Rates for GSM Evolution; Internet of Things; Service (business); Edge computing; Distributed computing; Telecommunications; Computer security","score_opus":0.00916410333811889,"score_gpt":0.24576174896789585,"score_spread":0.23659764562977695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408100372","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.36878973,0.0036510143,0.5908674,0.0024595405,0.0016105314,0.0005743192,0.0006526818,0.004092557,0.027302284],"genre_scores_gemma":[0.9415794,0.00083873875,0.050534505,0.0005329767,0.0001313583,0.00013540598,0.00054669584,0.00020418626,0.0054967864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991098,0.00013511637,0.00008195987,0.00019213122,0.0001948552,0.00028609074],"domain_scores_gemma":[0.99857926,0.0003081971,0.0001153396,0.00032002106,0.00043647867,0.0002406175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011175713,0.0007911285,0.000614135,0.00055149297,0.0014516914,0.0020519139,0.0016710724,0.0009478638,0.0027430125],"category_scores_gemma":[0.0033946082,0.00029069386,0.0005842544,0.0006426411,0.00051853893,0.002097516,0.002245893,0.0013027249,0.0009522766],"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.0027417724,0.0008474702,0.02401217,0.0009605455,0.00021961809,0.0041884063,0.0026463072,0.28897834,0.1194259,0.11661081,0.040052183,0.39931652],"study_design_scores_gemma":[0.000044706012,0.00018035022,0.002017151,0.00006820898,0.00005766687,0.00063936046,0.0009024781,0.9349027,0.011432294,0.025323324,0.024382759,0.000048901955],"about_ca_topic_score_codex":0.005209279,"about_ca_topic_score_gemma":0.004886725,"teacher_disagreement_score":0.005209279,"about_ca_system_score_codex":0.001082505,"about_ca_system_score_gemma":0.0014427705,"threshold_uncertainty_score":0.010357916},"labels":[],"label_agreement":null},{"id":"W4409581005","doi":"10.1109/tsc.2025.3562318","title":"Puncturable Signature and Applications in Privacy-Aware Data Reporting for VDTNs","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Information privacy; Computer security; Signature (topology); Internet privacy","score_opus":0.03553210325108668,"score_gpt":0.3032572500796363,"score_spread":0.2677251468285496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409581005","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.016476493,0.0011813646,0.97687143,0.00048984046,0.00019021216,0.00017032746,0.000089437795,0.0008193373,0.0037116485],"genre_scores_gemma":[0.6853698,0.0020868294,0.30561706,0.00051109167,0.0002046977,0.00030745796,0.0002920789,0.000092220136,0.0055188634],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99625826,0.0010082381,0.0005494755,0.0006135775,0.0012870947,0.00028342748],"domain_scores_gemma":[0.99493057,0.0013920099,0.00074294285,0.0018375408,0.00093375705,0.00016311341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021479311,0.00070456945,0.0006481162,0.0010388279,0.000918625,0.0015181423,0.0015331812,0.0014568772,0.0017944213],"category_scores_gemma":[0.007245155,0.00035440188,0.0009809266,0.0021066254,0.0016092629,0.0036228315,0.002693526,0.001726611,0.00094021927],"study_design_candidate":"bench_or_experimental","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.0008753495,0.00015998594,0.0027678085,0.00091246964,0.00011477554,0.0019518067,0.001295683,0.07887744,0.10745022,0.38195744,0.0058458652,0.4177912],"study_design_scores_gemma":[0.00011933394,0.000977448,0.0009262817,0.0002131846,0.0001406029,0.004538908,0.0004101688,0.5968881,0.19523208,0.115280606,0.08502595,0.00024743457],"about_ca_topic_score_codex":0.0005011621,"about_ca_topic_score_gemma":0.00027685968,"teacher_disagreement_score":0.0021479311,"about_ca_system_score_codex":0.00089855003,"about_ca_system_score_gemma":0.0012997375,"threshold_uncertainty_score":0.011359453},"labels":[],"label_agreement":null},{"id":"W4411019785","doi":"10.1109/tsc.2025.3576690","title":"On-Demand and Scalable Topology Control Service for LEO Satellite Network Evolving","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Satellite Communication Systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Scalability; Computer network; Network topology; Distributed computing; Topology (electrical circuits); Satellite; Service (business); Topology control; Telecommunications; Database","score_opus":0.01024573930782954,"score_gpt":0.24222986446814082,"score_spread":0.23198412516031128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411019785","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.114169665,0.0007677738,0.79942334,0.0017460326,0.0004713937,0.00062345265,0.00094656635,0.038043655,0.04380808],"genre_scores_gemma":[0.83381546,0.00058521033,0.14643593,0.0004066946,0.00016297886,0.00025653502,0.0033567285,0.00065428094,0.014326173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999524,0.000071659,0.00003861918,0.000085125415,0.00017453947,0.00010600699],"domain_scores_gemma":[0.9991014,0.00008994128,0.00008602218,0.00025499953,0.00026580595,0.00020186268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008860243,0.00050150114,0.00042093178,0.00068132364,0.00067582127,0.001534267,0.0016595364,0.00051917444,0.0030721289],"category_scores_gemma":[0.0019232176,0.00020995917,0.00038006585,0.0006064013,0.00034422844,0.0016104408,0.0014696032,0.00088246545,0.0015243095],"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.0010334499,0.0006218412,0.00709467,0.000257917,0.00013059737,0.0017830887,0.0011201528,0.13937555,0.13331625,0.07839587,0.11334214,0.5235285],"study_design_scores_gemma":[0.000047724858,0.00013742027,0.0009850234,0.000014953455,0.000022457687,0.00022091923,0.00019681541,0.9496484,0.010008775,0.005180813,0.033496935,0.000039893603],"about_ca_topic_score_codex":0.007850918,"about_ca_topic_score_gemma":0.010862319,"teacher_disagreement_score":0.007850918,"about_ca_system_score_codex":0.00096501,"about_ca_system_score_gemma":0.0014775061,"threshold_uncertainty_score":0.0156104565},"labels":[],"label_agreement":null},{"id":"W4411172187","doi":"10.1109/tsc.2025.3577425","title":"Feature Noise Resilient for QoS Prediction With Probabilistic Deep Supervision","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Probabilistic logic; Noise (video); Feature (linguistics); Quality of service; Artificial intelligence; Data mining; Pattern recognition (psychology); Computer network","score_opus":0.008363526595493595,"score_gpt":0.25110738948284145,"score_spread":0.24274386288734784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411172187","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.053950086,0.0006377203,0.9400592,0.00046052568,0.00006338521,0.000037478647,0.00028293076,0.0029678447,0.0015408044],"genre_scores_gemma":[0.90701413,0.0003051955,0.088617,0.00034628957,0.00008114084,0.00007259434,0.0009140995,0.00012872029,0.002520882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955934,0.000089463116,0.000020544418,0.00013763101,0.00013131165,0.00006179826],"domain_scores_gemma":[0.9988707,0.000548386,0.00011550757,0.00015156869,0.000252152,0.000061657636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094435946,0.0012177321,0.0007790375,0.00049140863,0.00035830546,0.0005863003,0.001638431,0.00089368067,0.0011539694],"category_scores_gemma":[0.0042668926,0.0004822118,0.0005721306,0.000522669,0.0007159031,0.0016399558,0.0012275869,0.0022092126,0.00044133284],"study_design_candidate":"bench_or_experimental","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.0003550961,0.0001789224,0.00540216,0.00009185242,0.00008159736,0.00011869811,0.000102585625,0.73660165,0.006859121,0.0043613655,0.004780608,0.24106632],"study_design_scores_gemma":[0.0000028937366,0.000011323075,0.00014549111,0.0000026807597,0.000003901617,0.000008172243,0.0000028328834,0.9973431,0.00076899206,0.0015864464,0.00012169901,0.0000024531976],"about_ca_topic_score_codex":0.013466476,"about_ca_topic_score_gemma":0.014282216,"teacher_disagreement_score":0.013466476,"about_ca_system_score_codex":0.0010300359,"about_ca_system_score_gemma":0.0012525897,"threshold_uncertainty_score":0.026776195},"labels":[],"label_agreement":null},{"id":"W4413125789","doi":"10.1109/tsc.2025.3596626","title":"Computing Offloading for Digital Twinning Empowered Industrial IoT","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Internet of Things; Crystal twinning; Distributed computing; Computer network; Computer security","score_opus":0.024529102157552732,"score_gpt":0.2737835652834966,"score_spread":0.2492544631259439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413125789","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.17222966,0.0013203165,0.76899964,0.0005856299,0.00045990164,0.00015936866,0.00012808733,0.0020179478,0.05409952],"genre_scores_gemma":[0.97183245,0.00020995521,0.024243824,0.000118211254,0.000037863963,0.000041028332,0.00007688016,0.000053253385,0.003386538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997093,0.000036688965,0.00001526381,0.000057135258,0.000079127254,0.00010247916],"domain_scores_gemma":[0.9997346,0.000067862515,0.00002145759,0.000071474504,0.000054149623,0.000050558654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002564305,0.00046539976,0.00058985665,0.00035171813,0.00064776425,0.0009402416,0.0009586694,0.00043231263,0.00469734],"category_scores_gemma":[0.00058908557,0.00015384819,0.00031009153,0.0006200904,0.0004490457,0.0018242213,0.001732971,0.00058617454,0.00055554084],"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.0008431906,0.00048020508,0.0037054084,0.0003344518,0.00006200862,0.0014899295,0.00034829642,0.42836195,0.05360177,0.13476917,0.017071614,0.35893202],"study_design_scores_gemma":[0.000022318363,0.00009634369,0.0004369684,0.000012176306,0.000013934174,0.00014464569,0.00006357171,0.9662684,0.0049205553,0.020303776,0.007700523,0.000016796334],"about_ca_topic_score_codex":0.0012543292,"about_ca_topic_score_gemma":0.0016365383,"teacher_disagreement_score":0.00469734,"about_ca_system_score_codex":0.0004339526,"about_ca_system_score_gemma":0.0004953449,"threshold_uncertainty_score":0.015714228},"labels":[],"label_agreement":null},{"id":"W4413318981","doi":"10.1109/tsc.2025.3600124","title":"EPPQ: Efficient and Privacy-Preserving NN Query Processing for Outsourced High-Dimensional Data","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Computer science; Query optimization; Information privacy; Data mining; Computer security","score_opus":0.028238805561426758,"score_gpt":0.2929990098502713,"score_spread":0.2647602042888445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413318981","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.0136176525,0.00094033644,0.97898644,0.0005478605,0.00012332907,0.00035800537,0.0010454373,0.001840662,0.002540156],"genre_scores_gemma":[0.37095416,0.0019849134,0.61183035,0.00092707825,0.00033321514,0.00073361816,0.004872227,0.0003238763,0.008040597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99160075,0.0015752775,0.0008781781,0.0013574276,0.0038987522,0.0006896841],"domain_scores_gemma":[0.99073267,0.0013947743,0.00049492146,0.0058032246,0.001332157,0.00024224604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047906274,0.0011835046,0.0025798033,0.0011783185,0.0014340709,0.0025957082,0.0039733737,0.0014463864,0.0038021472],"category_scores_gemma":[0.010240624,0.00061209267,0.0018579086,0.0039077625,0.001460673,0.0065086894,0.008680387,0.0025472303,0.0019968506],"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.0023697722,0.0006336471,0.006956269,0.0013157092,0.00048369268,0.0011660329,0.0013671619,0.1192399,0.038995057,0.15432392,0.053735457,0.61941344],"study_design_scores_gemma":[0.00013659234,0.0003122004,0.001718069,0.00005678257,0.000092119764,0.001436528,0.00053466466,0.8497292,0.023318697,0.10160784,0.020921182,0.00013615328],"about_ca_topic_score_codex":0.0053134975,"about_ca_topic_score_gemma":0.00434084,"teacher_disagreement_score":0.0053134975,"about_ca_system_score_codex":0.0017628714,"about_ca_system_score_gemma":0.003713078,"threshold_uncertainty_score":0.02533561},"labels":[],"label_agreement":null},{"id":"W4413349509","doi":"10.1109/tsc.2025.3601051","title":"Understanding AWS Provider Dependency Updates in Infrastructure-As-Code: Empirical Study, Taxonomy, and Insights","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Power System Reliability and Maintenance","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Taxonomy (biology); Theoretical computer science; Database; Data science","score_opus":0.029600660419781363,"score_gpt":0.2608214432214027,"score_spread":0.23122078280162134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413349509","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.986973,0.0007855993,0.0063598873,0.0010160424,0.000028579016,0.00015772773,0.0013372162,0.00025390828,0.0030881634],"genre_scores_gemma":[0.98518294,0.00071947917,0.009019279,0.0001984245,0.000034876084,0.00018443273,0.0034144602,0.00018283662,0.0010632904],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9871126,0.0026255015,0.001500991,0.0019628566,0.005875897,0.00092216616],"domain_scores_gemma":[0.74136174,0.14550886,0.06742692,0.0107355425,0.03084589,0.0041210763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012233615,0.00057070045,0.00035887206,0.009841791,0.0014329527,0.0034451135,0.0015174297,0.0011519948,0.00149531],"category_scores_gemma":[0.14144962,0.00069180055,0.00038051847,0.010826003,0.0021833365,0.008469227,0.0028198694,0.002416451,0.00056254555],"study_design_candidate":"observational","study_design_consensus":"observational","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.000060165257,0.00029069182,0.9061573,0.0005458623,0.000045885296,0.0006297981,0.030109676,0.0010341906,0.0012911569,0.002845777,0.0033345933,0.05365492],"study_design_scores_gemma":[0.00001354797,0.00017517827,0.9107236,0.0007643793,0.000055598088,0.001148621,0.046040397,0.015033109,0.0015592311,0.0031249253,0.021271398,0.000089944384],"about_ca_topic_score_codex":0.017479708,"about_ca_topic_score_gemma":0.028527688,"teacher_disagreement_score":0.017479708,"about_ca_system_score_codex":0.0029102126,"about_ca_system_score_gemma":0.0046435627,"threshold_uncertainty_score":0.06469834},"labels":[],"label_agreement":null},{"id":"W4413822491","doi":"10.1109/tsc.2025.3604375","title":"AttResRec: Learning User Credibility for Attack Resistant Matrix Factorization Recommendation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Matrix decomposition; Credibility; Recommender system; Theoretical computer science; Information retrieval","score_opus":0.02338817443838685,"score_gpt":0.30777921446928014,"score_spread":0.28439104003089327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413822491","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.025940813,0.0011411805,0.9661943,0.00034551282,0.00007767468,0.0001286765,0.00023812806,0.004495374,0.0014384749],"genre_scores_gemma":[0.6739513,0.00065552455,0.31867012,0.00051813136,0.0002962225,0.00018865285,0.0012933732,0.00030158256,0.0041250926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662197,0.001160985,0.00019163509,0.00063913455,0.0011619946,0.00022426042],"domain_scores_gemma":[0.98692864,0.006589476,0.0009848416,0.002905757,0.0021118603,0.0004794538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005283248,0.0017151419,0.0022336375,0.0014146873,0.00068046,0.0013243475,0.0024960309,0.0021828357,0.001578625],"category_scores_gemma":[0.023597185,0.00071607745,0.00093451055,0.0009866393,0.0010007065,0.0025742475,0.0020788389,0.0026286505,0.0015156788],"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.00096268556,0.000446073,0.008635884,0.00039902094,0.00045487797,0.00029800803,0.00033820345,0.45904112,0.012378056,0.010135948,0.013671542,0.49323857],"study_design_scores_gemma":[0.000022620425,0.00009834424,0.0003119793,0.00001135872,0.000017213999,0.00006728641,0.000012733786,0.99516135,0.0013105308,0.0022499536,0.0007202361,0.00001635615],"about_ca_topic_score_codex":0.0067422176,"about_ca_topic_score_gemma":0.0086440025,"teacher_disagreement_score":0.0067422176,"about_ca_system_score_codex":0.0009923243,"about_ca_system_score_gemma":0.001473548,"threshold_uncertainty_score":0.02794081},"labels":[],"label_agreement":null},{"id":"W4415048448","doi":"10.1109/tsc.2025.3620092","title":"ERAP Optimization via Enhanced Constraints and Boundary Detection in GMRA","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Inertial Sensor and Navigation","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Enhanced Data Rates for GSM Evolution; Edge computing; Server; Resource allocation; Asynchronous communication; Workload; Resource management (computing); Throughput; Acceleration","score_opus":0.0034156473298989367,"score_gpt":0.20843686090811175,"score_spread":0.20502121357821282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415048448","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.019050306,0.00022657677,0.97690475,0.00019392118,0.00004549393,0.00008023675,0.00006797698,0.00033399477,0.0030966937],"genre_scores_gemma":[0.5694851,0.00023987821,0.4250571,0.00027449126,0.00005716692,0.00035296415,0.00024434942,0.0002133577,0.0040755426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858785,0.0005145971,0.00007214939,0.00028807923,0.00030479013,0.00023259877],"domain_scores_gemma":[0.9979576,0.0012303096,0.00023305284,0.00016860885,0.00029139136,0.0001190959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016199982,0.0015320866,0.0013622254,0.0007025272,0.00051714823,0.0014241942,0.0019087082,0.0013603002,0.0039888932],"category_scores_gemma":[0.0049604867,0.00069534214,0.00094681635,0.0008056559,0.0008514614,0.0019317183,0.0018830147,0.0017863893,0.0005584323],"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.00008160487,0.0000517096,0.00033760243,0.000083136874,0.000020677242,0.00010902029,0.000048913986,0.96233404,0.0025776033,0.009535869,0.0010275776,0.023792237],"study_design_scores_gemma":[0.000007970621,0.000020862853,0.00003831641,0.000004571406,0.0000029089704,0.0000122626025,0.0000073862775,0.9977508,0.00039405542,0.0014815171,0.00027533754,0.000003965726],"about_ca_topic_score_codex":0.006100892,"about_ca_topic_score_gemma":0.0044965544,"teacher_disagreement_score":0.006100892,"about_ca_system_score_codex":0.0007693959,"about_ca_system_score_gemma":0.0018372427,"threshold_uncertainty_score":0.013344169},"labels":[],"label_agreement":null},{"id":"W4415179219","doi":"10.1109/tsc.2025.3621606","title":"Adaptive UAV-Assisted Hierarchical Federated Learning: Optimizing Energy, Latency, and Resilience for Dynamic Smart IoT","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Division of Electrical, Communications and Cyber Systems; National Natural Science Foundation of China; Chinese Academy of Engineering; National Science Foundation","keywords":"Federated learning; Resilience (materials science); Fog computing; News aggregator; Bandwidth (computing); Greedy algorithm; Drone; Data aggregator","score_opus":0.01638205558224535,"score_gpt":0.26875096529669307,"score_spread":0.2523689097144477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415179219","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.09732886,0.00033708639,0.89978874,0.00023363905,0.000046002875,0.000052169515,0.00007150408,0.0006789632,0.0014629544],"genre_scores_gemma":[0.9581012,0.00006337446,0.040845834,0.00009844765,0.000013966508,0.000049715676,0.000082338185,0.000026766345,0.0007184165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995522,0.00011402349,0.000022374516,0.000118713426,0.0000729607,0.00011968286],"domain_scores_gemma":[0.9989221,0.00056977785,0.00012103012,0.00014412666,0.0001546187,0.0000884713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012479015,0.00080902583,0.0009191219,0.0003777823,0.00042209929,0.000732234,0.0013913917,0.0009177257,0.000813021],"category_scores_gemma":[0.0029684785,0.0002587341,0.000414021,0.00047269402,0.0007348827,0.0013187564,0.001382324,0.00079698086,0.00015189174],"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.00007307642,0.00007203829,0.0008736641,0.000026999216,0.000020868669,0.000039986062,0.000030083971,0.9663354,0.0012320492,0.0015769327,0.00048108317,0.02923782],"study_design_scores_gemma":[0.0000040877576,0.000017456914,0.000065394204,0.0000015896619,0.0000021751134,0.0000051615434,0.000006562332,0.99846447,0.0002449638,0.0011353508,0.00005111459,0.0000016169267],"about_ca_topic_score_codex":0.0036799316,"about_ca_topic_score_gemma":0.0035863481,"teacher_disagreement_score":0.0036799316,"about_ca_system_score_codex":0.00081219827,"about_ca_system_score_gemma":0.0010016283,"threshold_uncertainty_score":0.0073170066},"labels":[],"label_agreement":null},{"id":"W4415222171","doi":"10.1109/tsc.2025.3621697","title":"Effective Two-Stage Double Auction for Dynamic Resource Provision Over Edge Networks via Discovering the Power of Overbooking","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Double auction; Scalability; Resource allocation; Server; Resource (disambiguation); Eauction; Enhanced Data Rates for GSM Evolution; Reverse auction; Backup","score_opus":0.015668361877207947,"score_gpt":0.34289914992404863,"score_spread":0.3272307880468407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415222171","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.045589563,0.00019923261,0.95104665,0.00012165902,0.000042426596,0.00013993417,0.000036546782,0.00017371844,0.0026503112],"genre_scores_gemma":[0.8544137,0.00015139116,0.14268686,0.000091300506,0.000031542022,0.000104902596,0.000045003562,0.00004316401,0.0024321936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979365,0.0008392202,0.000106647865,0.000375267,0.0004304887,0.00031198972],"domain_scores_gemma":[0.9970663,0.0014343703,0.00037118455,0.0005317201,0.00031773117,0.00027863798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027141387,0.00077869755,0.0010547206,0.000426139,0.000560978,0.0018983625,0.0020953135,0.0009240545,0.0020815916],"category_scores_gemma":[0.0053763893,0.00046013942,0.0007096613,0.00048468687,0.00094808143,0.002598396,0.0016896648,0.0015286636,0.00027148754],"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.0012813711,0.00047859453,0.0026751827,0.0004151546,0.00017770518,0.0010013276,0.00047116875,0.648523,0.046631902,0.15384693,0.002785758,0.1417119],"study_design_scores_gemma":[0.000046968667,0.00017781137,0.00020135721,0.000009095059,0.000020931278,0.00018665474,0.000040728864,0.97274226,0.0031818817,0.022302767,0.0010654143,0.000024103703],"about_ca_topic_score_codex":0.0008534745,"about_ca_topic_score_gemma":0.0009155361,"teacher_disagreement_score":0.0027141387,"about_ca_system_score_codex":0.00066908926,"about_ca_system_score_gemma":0.0014139701,"threshold_uncertainty_score":0.014353931},"labels":[],"label_agreement":null},{"id":"W4415594180","doi":"10.1109/tsc.2025.3625817","title":"A Multi-Dimensional Analysis of IoT Companion Apps: A Look at Privacy, Security and Accessibility","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Smart Cities and Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Internet of Things; Interface (matter); Mobile device; Sample (material); The Internet; Quality (philosophy); Uncorrelated; Exploit","score_opus":0.01382448411282971,"score_gpt":0.2598299055285982,"score_spread":0.24600542141576848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415594180","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.9853586,0.00073144626,0.0070631113,0.00057411985,0.000024877198,0.000113305076,0.0007670419,0.00011330422,0.005254185],"genre_scores_gemma":[0.994474,0.0001829009,0.004154948,0.000043201,0.000012924788,0.00004837932,0.00044082841,0.000018908791,0.00062394247],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9970343,0.0008117794,0.0003973672,0.00023315787,0.0013409533,0.00018243528],"domain_scores_gemma":[0.9827483,0.008003223,0.0029081388,0.0010535303,0.004742896,0.0005438569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023130379,0.00042881933,0.00038738266,0.004870629,0.0006565683,0.0025001017,0.00025743636,0.00038624875,0.0011466618],"category_scores_gemma":[0.014409554,0.00017003137,0.0007908499,0.003014528,0.0008212157,0.0028767062,0.0014201062,0.00081393257,0.00030698295],"study_design_candidate":"observational","study_design_consensus":"observational","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.0004412476,0.00047957737,0.7961432,0.000761559,0.00026298125,0.0008291045,0.017161768,0.0033885112,0.009240359,0.0043866257,0.0037491147,0.1631559],"study_design_scores_gemma":[0.000006964537,0.00043590358,0.94214344,0.00018578538,0.00010677796,0.0012262642,0.012842085,0.028612278,0.0038359538,0.0035137564,0.006988306,0.000102483085],"about_ca_topic_score_codex":0.0020655056,"about_ca_topic_score_gemma":0.0027702623,"teacher_disagreement_score":0.004870629,"about_ca_system_score_codex":0.00058618234,"about_ca_system_score_gemma":0.00035932736,"threshold_uncertainty_score":0.012232661},"labels":[],"label_agreement":null},{"id":"W4416960426","doi":"10.1109/tsc.2025.3639601","title":"Decoupling Location and Preference: A Dual-Branch Architecture for Robust QoS Prediction Under Extreme Sparsity","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Quality of service; Feature extraction; Feature (linguistics); Context (archaeology); Pattern recognition (psychology); Decoupling (probability); Salient; Block (permutation group theory)","score_opus":0.054826327483762684,"score_gpt":0.264185024390609,"score_spread":0.2093586969068463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416960426","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.044534355,0.00029661893,0.9494047,0.00027536193,0.000051564304,0.00006039676,0.0002913657,0.00361178,0.0014738148],"genre_scores_gemma":[0.7577598,0.00031269665,0.2359677,0.00031516643,0.00010518043,0.00015276861,0.0018460252,0.00016833885,0.0033723651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939036,0.00008407687,0.00003226297,0.00021841619,0.00018870807,0.00008618346],"domain_scores_gemma":[0.99929273,0.00017225553,0.00007359809,0.00016372329,0.0002374464,0.000060195518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077270495,0.0010904243,0.0009409263,0.00078993937,0.00042620828,0.00078998646,0.0020393857,0.00073050754,0.0014365434],"category_scores_gemma":[0.002212921,0.00044730777,0.00060461345,0.0009976379,0.00042084555,0.002349298,0.0016057632,0.0017937475,0.0010439765],"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.00060777686,0.0004072859,0.00716463,0.000086066866,0.000117370844,0.00023948561,0.00019236693,0.22010389,0.033042073,0.0045131156,0.008643632,0.7248823],"study_design_scores_gemma":[0.000009212953,0.000047521622,0.0005873588,0.0000031926133,0.000012021514,0.000032675904,0.000015962642,0.9932916,0.0027779178,0.0026498332,0.0005636055,0.000009008731],"about_ca_topic_score_codex":0.0080304565,"about_ca_topic_score_gemma":0.009674095,"teacher_disagreement_score":0.0080304565,"about_ca_system_score_codex":0.00070282543,"about_ca_system_score_gemma":0.00087445724,"threshold_uncertainty_score":0.015967429},"labels":[],"label_agreement":null},{"id":"W7106334503","doi":"10.1109/tsc.2025.3635525","title":"QuanFraud: Quantum State Verification Scheme for Fraud Detection in IoT-Assisted Quantum-Blockchain Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Verifiable secret sharing; Exploit; Protocol (science); Identifier; Scheme (mathematics); Resilience (materials science); Replay attack; Oversampling","score_opus":0.013774267417542107,"score_gpt":0.26261568344302755,"score_spread":0.24884141602548543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106334503","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.19735147,0.0009596952,0.76872885,0.0032176818,0.00047397887,0.0015951627,0.0009289505,0.0067577525,0.019986512],"genre_scores_gemma":[0.9174122,0.00019690863,0.07573972,0.00040151816,0.00004542827,0.0002345846,0.000434977,0.00007183537,0.0054628234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589133,0.0014601279,0.00017534831,0.00037524514,0.0015447533,0.00055313227],"domain_scores_gemma":[0.9944629,0.0016565293,0.000564144,0.0020142635,0.0009917554,0.00031038147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054297005,0.00058418786,0.0008593914,0.0009127651,0.0017445774,0.0019217373,0.002430128,0.0022557084,0.00499939],"category_scores_gemma":[0.012811175,0.0002718774,0.0004286861,0.0010417461,0.0017760618,0.0043564234,0.0033905809,0.0014602252,0.0009991922],"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.0028136692,0.0012054072,0.007710654,0.00061028305,0.00016605857,0.0010986562,0.00075402815,0.22052817,0.040719185,0.3638762,0.028408635,0.33210903],"study_design_scores_gemma":[0.00020973422,0.00035118547,0.0006175241,0.000051593484,0.000025801626,0.0002755485,0.000059677535,0.9011565,0.031029364,0.054409094,0.011747389,0.00006653055],"about_ca_topic_score_codex":0.003176609,"about_ca_topic_score_gemma":0.0025677998,"teacher_disagreement_score":0.0054297005,"about_ca_system_score_codex":0.0021537459,"about_ca_system_score_gemma":0.0041789804,"threshold_uncertainty_score":0.028715312},"labels":[],"label_agreement":null}]}