{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41962573,0.00005558308,0.578138,0.00070602883,0.00072644756,0.0001629999,0.000010606705,0.00047922946,0.00009537244],"genre_scores_gemma":[0.94616896,0.000012416276,0.04744353,0.0061617196,0.00014302738,0.000008948981,0.000018988774,0.000035364286,0.0000070694205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740356,0.00026176716,0.0004444986,0.0008667561,0.00051563536,0.00050779525],"domain_scores_gemma":[0.9979765,0.00025128678,0.00018399287,0.0009118315,0.00027962367,0.00039677863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035229875,0.00042247676,0.00036291516,0.0003479702,0.00048458297,0.0008837797,0.00121976,0.00019504958,0.000004963569],"category_scores_gemma":[6.46216e-7,0.00039091858,0.00007794213,0.0014872126,0.000036852583,0.0018672019,0.000027550677,0.00060420885,0.00005966766],"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.00055297103,0.0024418752,0.0013454382,0.0015687443,0.00053641107,0.00014812437,0.10176112,0.6529952,0.021448426,0.00966479,0.000026255779,0.20751059],"study_design_scores_gemma":[0.00081310415,0.0003379335,0.00035231042,0.000560477,0.0000559008,0.000103533384,0.0025231699,0.9868427,0.005929331,0.0015350883,0.0003751209,0.00057135226],"about_ca_topic_score_codex":0.0009076525,"about_ca_topic_score_gemma":0.0012311684,"teacher_disagreement_score":0.5306945,"about_ca_system_score_codex":0.00006400958,"about_ca_system_score_gemma":0.00010835491,"threshold_uncertainty_score":0.99985427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050878923,0.00001454198,0.9444596,0.0032752084,0.0004762851,0.00053115917,0.00009101183,0.00019561582,0.00007761388],"genre_scores_gemma":[0.9570674,0.0000018946986,0.041684777,0.0009377326,0.00015981638,0.000035562265,0.0000915219,0.000016024524,0.0000053061044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789697,0.00021984652,0.00036696225,0.0006979213,0.0003885123,0.00042978302],"domain_scores_gemma":[0.99685353,0.0009672815,0.0001868488,0.0017833528,0.00014299057,0.00006600895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015505997,0.00018847607,0.00018098178,0.00018080686,0.0007456737,0.0005558181,0.0027062243,0.00006217499,0.0000039008887],"category_scores_gemma":[0.000019738978,0.00014918594,0.00004676078,0.0010269632,0.00003664532,0.0006348567,0.000035860332,0.00029454302,0.000019112978],"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.000121479716,0.002593545,0.0007517039,0.001019909,0.00022342117,0.000010294934,0.036803525,0.6558773,0.0006623683,0.044536162,0.0011552812,0.256245],"study_design_scores_gemma":[0.00061396614,0.00007769971,0.0007733529,0.00014772937,0.000018159019,0.000017827891,0.00040905093,0.9920893,0.00009723272,0.000106469655,0.00545371,0.00019554443],"about_ca_topic_score_codex":0.00018307162,"about_ca_topic_score_gemma":0.0020690996,"teacher_disagreement_score":0.9061884,"about_ca_system_score_codex":0.0000673047,"about_ca_system_score_gemma":0.00006527986,"threshold_uncertainty_score":0.6083626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44827905,0.000025653157,0.54638535,0.0029029232,0.0009842666,0.00054301677,0.00008947928,0.00029586858,0.00049438846],"genre_scores_gemma":[0.91959316,0.0000018750292,0.066227615,0.01357917,0.0004712839,0.00005912899,0.000022412787,0.00003619724,0.000009154182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611706,0.00027272562,0.0011127797,0.0009453242,0.0006188136,0.0009333112],"domain_scores_gemma":[0.9969185,0.0006075138,0.0007134357,0.0007964461,0.00078865665,0.0001754635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052197755,0.0005276499,0.00072322873,0.0001440722,0.0008968639,0.0004983821,0.0018963228,0.000243202,0.000027987357],"category_scores_gemma":[0.0000013363918,0.0005198753,0.00033911382,0.0022092524,0.000053910346,0.0014359556,0.000062605126,0.00039066875,0.00005236504],"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.0007181847,0.0018263743,0.011528281,0.013226483,0.0023191448,0.000011202355,0.030797927,0.2256184,0.014928904,0.035721976,0.0003667623,0.66293633],"study_design_scores_gemma":[0.0040923655,0.00027046938,0.009979119,0.0008305243,0.00019131404,0.00005221566,0.0064302534,0.9600723,0.0060684877,0.009651971,0.0006103098,0.0017506866],"about_ca_topic_score_codex":0.0046887686,"about_ca_topic_score_gemma":0.00852395,"teacher_disagreement_score":0.73445386,"about_ca_system_score_codex":0.00011132675,"about_ca_system_score_gemma":0.00014032854,"threshold_uncertainty_score":0.9997253},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025200093,0.00036824323,0.96959746,0.00035527186,0.003060905,0.0006642563,0.00005412052,0.00056267413,0.00013697868],"genre_scores_gemma":[0.9505282,0.0000162929,0.04843408,0.0003629366,0.00056505436,0.000033311724,0.000007395975,0.000034620323,0.00001808437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974761,0.00012047281,0.0005322239,0.0005556137,0.00044599056,0.0008696195],"domain_scores_gemma":[0.9971387,0.0012168206,0.00024378675,0.0011461455,0.000066983994,0.00018758836],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011055784,0.0003207976,0.00028325839,0.00011562409,0.002075332,0.00032916153,0.0015581615,0.000112123584,0.000008177547],"category_scores_gemma":[0.0000031675831,0.0002664443,0.00021958865,0.00044814014,0.000058980564,0.0005330152,0.00004402586,0.00037485987,0.00014514658],"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.000043608907,0.00075802515,0.00009234843,0.0008330969,0.00041707233,0.0000038346047,0.023874082,0.89173174,0.0026477638,0.011089418,0.00016275248,0.068346255],"study_design_scores_gemma":[0.0004779749,0.000054326523,0.000050542847,0.00020842653,0.0000714753,0.000047436093,0.001995731,0.9851487,0.003925369,0.00002872494,0.007658483,0.00033280678],"about_ca_topic_score_codex":0.00018543811,"about_ca_topic_score_gemma":0.000023901768,"teacher_disagreement_score":0.92532814,"about_ca_system_score_codex":0.00024040157,"about_ca_system_score_gemma":0.000044781387,"threshold_uncertainty_score":0.9999788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67892176,0.000010351569,0.3183204,0.00106645,0.00058208586,0.00040407284,0.000008329331,0.00041205552,0.00027447217],"genre_scores_gemma":[0.95973015,0.0000041313006,0.032038644,0.008047156,0.00008239543,0.000028127575,0.000011692843,0.00005027094,0.000007422798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960344,0.00037835096,0.0010429686,0.001015155,0.0007761441,0.0007529981],"domain_scores_gemma":[0.9966255,0.00049515546,0.00043331823,0.0018316084,0.0003004571,0.00031395775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006594192,0.0005422372,0.00066737615,0.0010470914,0.00033664564,0.0002461607,0.0032690503,0.00021380448,0.000029950897],"category_scores_gemma":[0.0000013383392,0.0005539997,0.00016837213,0.0030502754,0.0000351987,0.0010128947,0.00010308091,0.00050533673,0.0001118864],"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.00014292332,0.0011740503,0.005973057,0.0041963314,0.00022389037,0.00002466853,0.07069401,0.8189395,0.021303607,0.001107887,0.000008405135,0.076211646],"study_design_scores_gemma":[0.0013025245,0.00030129528,0.022645393,0.0019594794,0.000052174863,0.000018901514,0.0006175098,0.93684685,0.034851577,0.0003438044,0.0003300613,0.0007304451],"about_ca_topic_score_codex":0.0032344277,"about_ca_topic_score_gemma":0.009890253,"teacher_disagreement_score":0.28628176,"about_ca_system_score_codex":0.00009379875,"about_ca_system_score_gemma":0.00004880573,"threshold_uncertainty_score":0.9996911},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34312108,0.000015760672,0.65459424,0.00074001437,0.00014270842,0.0003487664,0.0000023406812,0.00042406592,0.0006110121],"genre_scores_gemma":[0.99223167,0.0000020194577,0.0058178813,0.0013126557,0.00037321664,0.000067142275,0.00002891199,0.0000766673,0.00008982798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980462,0.000010300294,0.00050581014,0.0006007369,0.00032511758,0.00051179016],"domain_scores_gemma":[0.9983205,0.00013271275,0.000367004,0.0003051208,0.00084259384,0.00003207168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023073403,0.00035960044,0.00037900722,0.00043455404,0.0012603427,0.00063630403,0.00037762857,0.00010987743,0.00005627597],"category_scores_gemma":[0.0000040403443,0.00031510484,0.00014154302,0.0012771555,0.00003873648,0.0018236883,0.000007737538,0.00028428526,0.00008123145],"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.000032100135,0.00010181675,0.00010790043,0.0006053667,0.00008293565,6.556977e-7,0.00026553887,0.97380245,0.000077781406,0.00015453261,0.00001301882,0.024755912],"study_design_scores_gemma":[0.0007632156,0.000015901234,0.00008048299,0.00045231552,0.00018514595,0.0000027883818,0.0010693762,0.9947903,0.00007198068,0.002026308,0.00012694095,0.0004152212],"about_ca_topic_score_codex":0.0018740311,"about_ca_topic_score_gemma":0.0005282792,"teacher_disagreement_score":0.6491106,"about_ca_system_score_codex":0.000042720272,"about_ca_system_score_gemma":0.00003678876,"threshold_uncertainty_score":0.9999301},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.276864,0.00016880581,0.71922666,0.00085254986,0.001168274,0.0010020349,0.000017166356,0.00059559656,0.00010491671],"genre_scores_gemma":[0.98826736,0.000014912716,0.0053782878,0.005976657,0.00019677344,0.000066038636,0.000021300784,0.000060850183,0.000017844563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954111,0.0008959739,0.0009477774,0.0011157339,0.0008126058,0.00081680826],"domain_scores_gemma":[0.99308455,0.0039270287,0.00052661437,0.001395331,0.0007868891,0.0002795884],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010124388,0.0006425441,0.00064389105,0.0003331318,0.0014886486,0.0012939321,0.0017473584,0.0002897337,0.0000287627],"category_scores_gemma":[0.0000042576203,0.00048451495,0.00016077569,0.0022451729,0.00007452056,0.0012606287,0.000084020954,0.0008522014,0.0001736826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008306666,0.000100433135,0.0008000811,0.0006786517,0.00015409195,0.000003241928,0.013733534,0.9699656,0.00003556851,0.0011209022,0.0000013019132,0.013323554],"study_design_scores_gemma":[0.0014431942,0.000070127746,0.003612472,0.00063845486,0.00004551564,0.000018304567,0.0021252583,0.9905411,0.00008098209,0.00077037804,0.00014450365,0.00050970376],"about_ca_topic_score_codex":0.0128623545,"about_ca_topic_score_gemma":0.0024296993,"teacher_disagreement_score":0.71384835,"about_ca_system_score_codex":0.00006225115,"about_ca_system_score_gemma":0.000048323822,"threshold_uncertainty_score":0.9998113},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24641536,0.000024649702,0.7463134,0.0006018509,0.005031436,0.00038904496,0.0000019966926,0.00040876528,0.0008134877],"genre_scores_gemma":[0.9765982,0.000004247791,0.020741688,0.0019899085,0.0005844062,0.000019233541,0.000004084463,0.00003588875,0.000022338498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970179,0.00035240277,0.00043682527,0.0010072482,0.00061681255,0.0005688085],"domain_scores_gemma":[0.99792236,0.0005696005,0.00024876688,0.00041863072,0.0005096792,0.00033095822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008610906,0.00045148993,0.00042695712,0.00037841336,0.0009235595,0.00053913466,0.0004569628,0.00017057719,0.0000023243779],"category_scores_gemma":[0.0000026331338,0.00045999777,0.00008037498,0.0010446837,0.000047249065,0.0005760959,0.00003478344,0.000712322,0.00001223189],"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.0005543592,0.0025892365,0.018254815,0.001181739,0.0007383139,0.00008727687,0.033339217,0.50873303,0.001094206,0.001870663,0.0006096441,0.4309475],"study_design_scores_gemma":[0.0017708401,0.0007079825,0.008137412,0.00029078603,0.00004340127,0.000040117437,0.0011481328,0.98554057,0.0013146896,0.0002945571,0.00023839521,0.00047314525],"about_ca_topic_score_codex":0.00079474394,"about_ca_topic_score_gemma":0.00024626136,"teacher_disagreement_score":0.7301828,"about_ca_system_score_codex":0.00044681158,"about_ca_system_score_gemma":0.0003557438,"threshold_uncertainty_score":0.9997852},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037792068,0.000021138323,0.9600472,0.00042880603,0.00063688814,0.00041058965,0.0000031443683,0.00024195146,0.00041821352],"genre_scores_gemma":[0.78972846,0.0000019611098,0.20937997,0.0006942021,0.00012159456,0.000036634483,0.000007008393,0.000017089087,0.000013075003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979517,0.00031604574,0.00045862558,0.0005844971,0.00029902838,0.00039014436],"domain_scores_gemma":[0.99913156,0.00006805472,0.00014631664,0.00040182355,0.000074763884,0.00017750004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078427664,0.00021356643,0.00023443358,0.00020980163,0.0004913587,0.00023781897,0.00055308745,0.00009328726,9.813323e-7],"category_scores_gemma":[8.873103e-7,0.00023108957,0.00005187277,0.0008620694,0.000013513898,0.0003120491,0.000015617505,0.00025031212,0.000024110757],"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.0000067724154,0.0003249683,0.000020027053,0.000014063586,0.0000151919085,0.0000013641211,0.011849104,0.91261077,0.00012644337,0.00032839936,0.00006768877,0.074635185],"study_design_scores_gemma":[0.0003069359,0.00010775213,0.00024045187,0.00007525604,0.0000052702694,0.000007975773,0.0013129299,0.9962399,0.0007029315,0.000054218024,0.0006879632,0.00025841114],"about_ca_topic_score_codex":0.0001441492,"about_ca_topic_score_gemma":0.00016018127,"teacher_disagreement_score":0.7519364,"about_ca_system_score_codex":0.00023198848,"about_ca_system_score_gemma":0.000045523666,"threshold_uncertainty_score":0.9423559},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1321933,0.00007948908,0.85526204,0.00026508927,0.0006591664,0.0004910055,0.000070623086,0.00050694466,0.010472327],"genre_scores_gemma":[0.95449,0.000013731584,0.042847924,0.0025172015,0.00005125603,0.0000077626255,0.000021598016,0.00003382761,0.000016718037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971527,0.000115385206,0.0006138053,0.0009103057,0.00064582465,0.0005619904],"domain_scores_gemma":[0.99661964,0.00020077066,0.00041203672,0.0022733335,0.00029731556,0.00019689403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040908335,0.00041125694,0.0004449535,0.0003086957,0.00033415324,0.00011545081,0.0036879515,0.00011392589,0.00014686401],"category_scores_gemma":[3.8746305e-7,0.00034480446,0.00007861896,0.001297829,0.000041021573,0.0010882173,0.00008197491,0.0003709505,0.00006266749],"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.0026537105,0.00929819,0.002426642,0.007562303,0.0053753685,0.00048326733,0.23635443,0.25012988,0.026722172,0.03593201,0.000101473386,0.42296058],"study_design_scores_gemma":[0.0027295235,0.0006862103,0.00090832997,0.00093999313,0.00023284582,0.00009123369,0.0019601376,0.92944616,0.05938648,0.00037128755,0.00227647,0.0009713214],"about_ca_topic_score_codex":0.0024388933,"about_ca_topic_score_gemma":0.003787973,"teacher_disagreement_score":0.8222967,"about_ca_system_score_codex":0.00002579525,"about_ca_system_score_gemma":0.00012385432,"threshold_uncertainty_score":0.9999004},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02328823,0.000021114325,0.9746827,0.0002771626,0.00048267568,0.000582073,0.00003343158,0.00026390987,0.00036874117],"genre_scores_gemma":[0.8848561,0.0000022778609,0.11426347,0.0006202844,0.000119726865,0.000041520605,0.000063376145,0.000019541461,0.00001368536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807763,0.00016249558,0.0004460702,0.00053282414,0.0003623451,0.00041865575],"domain_scores_gemma":[0.99869573,0.00026007846,0.0002373814,0.0004741468,0.00027120087,0.000061490704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046148332,0.00028656627,0.00027987605,0.0002139014,0.00057838927,0.00028656246,0.0013109552,0.00009276492,0.000012662804],"category_scores_gemma":[3.839045e-7,0.00022207544,0.00008718185,0.00109757,0.000036291498,0.0005101938,0.000010380502,0.00020808015,0.000026933725],"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.000054324228,0.00022170796,0.0000977702,0.0002718104,0.000046070843,0.000009360642,0.006767229,0.99030167,0.000022038757,0.00024119703,0.0000142004765,0.0019526224],"study_design_scores_gemma":[0.0008454756,0.00011140108,0.0016217879,0.0005186722,0.000017840473,0.00006814815,0.0005080248,0.99570304,0.000052351264,0.00010515049,0.00015436657,0.00029371137],"about_ca_topic_score_codex":0.00024551566,"about_ca_topic_score_gemma":0.000088991495,"teacher_disagreement_score":0.8615679,"about_ca_system_score_codex":0.000042547264,"about_ca_system_score_gemma":0.00005180647,"threshold_uncertainty_score":0.9055973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36225483,0.000015056518,0.6353389,0.00005057091,0.0016070015,0.00039172734,0.000010865333,0.00028395926,0.000047084523],"genre_scores_gemma":[0.97161674,0.000003440584,0.027969206,0.00014573432,0.00019766264,0.00002892925,0.000005933271,0.000021249458,0.000011075667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983748,0.00009255405,0.00040922943,0.0005824686,0.00025216074,0.00028876393],"domain_scores_gemma":[0.9987592,0.00017418523,0.00025112843,0.00047972344,0.0001860648,0.00014966857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043859315,0.00023141991,0.00022809609,0.0002052419,0.0005663069,0.00035793838,0.000535755,0.00013851482,0.0000034809023],"category_scores_gemma":[4.8700275e-7,0.00022450204,0.000081100734,0.00026718038,0.000015779102,0.0008470614,0.000006626909,0.00021918892,0.000020587155],"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.0002751486,0.0010765787,0.001286722,0.004784261,0.00039308995,0.000011107958,0.04207557,0.14506479,0.31674823,0.022786135,0.000014653756,0.46548373],"study_design_scores_gemma":[0.00042353015,0.00018727225,0.00075993774,0.00016751698,0.000023149272,0.000018225823,0.0011130802,0.98108244,0.01579351,0.000039130104,0.00016045959,0.00023172199],"about_ca_topic_score_codex":0.00032299885,"about_ca_topic_score_gemma":0.0011627042,"teacher_disagreement_score":0.83601767,"about_ca_system_score_codex":0.00004567681,"about_ca_system_score_gemma":0.000030575793,"threshold_uncertainty_score":0.9154927},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036959508,0.000055668057,0.015781326,0.0000629941,0.9736194,0.0009347221,0.00013582698,0.00027168228,0.005442439],"genre_scores_gemma":[0.051413238,0.000094712086,0.0006724635,0.00017215879,0.9466319,0.000017316572,0.00014901788,0.000082975756,0.0007662072],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98791075,0.00056365633,0.0021540532,0.0026522735,0.005539687,0.0011795886],"domain_scores_gemma":[0.9929449,0.003238022,0.0011594747,0.0018583344,0.00046328234,0.00033597916],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008000129,0.00094748713,0.0010587757,0.0022168914,0.0011721051,0.0021859931,0.0022027714,0.0007641337,0.00012132307],"category_scores_gemma":[0.00003936506,0.0008886327,0.00028674843,0.0019447095,0.000101958976,0.0006510393,0.00018521125,0.0017471663,0.0005042207],"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.00026318422,0.00060123095,0.00004614726,0.0008167438,0.00021669421,0.000027092625,0.0031855379,0.06566001,0.0000057627553,0.000074787924,0.83420885,0.09489396],"study_design_scores_gemma":[0.0014083846,0.00019695889,0.00014998108,0.0012573146,0.00013972698,0.0000025738607,0.0020639447,0.034327716,0.000033384153,0.000107455744,0.9594896,0.0008229928],"about_ca_topic_score_codex":0.0010264291,"about_ca_topic_score_gemma":0.0017714092,"teacher_disagreement_score":0.12528072,"about_ca_system_score_codex":0.0004909962,"about_ca_system_score_gemma":0.00006665014,"threshold_uncertainty_score":0.99935645},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037381012,0.000010537617,0.9601305,0.00075197476,0.0003161597,0.0004947248,0.00006320507,0.00043741125,0.00041446267],"genre_scores_gemma":[0.89004296,0.0000023228272,0.10883037,0.00053820136,0.00015493424,0.000025779631,0.00014502267,0.000050274168,0.00021013292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986089,0.00007301666,0.00030550873,0.00047442195,0.00028355952,0.00025463552],"domain_scores_gemma":[0.99846125,0.0004992023,0.00015795756,0.00051673385,0.00021728818,0.00014756524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003130082,0.00021936787,0.00023744318,0.00014838291,0.00048746532,0.00011275133,0.00042420355,0.00011864072,0.000004277739],"category_scores_gemma":[0.000007708683,0.00022184684,0.00008602383,0.00027581304,0.000019156048,0.00015053453,0.000007093954,0.00035049432,0.00004245756],"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.00007005454,0.0002818372,0.0000043425675,0.0001151279,0.000047226815,5.8969636e-7,0.0018341932,0.95321506,0.00025795915,0.00081816467,0.0003724872,0.042982973],"study_design_scores_gemma":[0.0010861357,0.000088486035,0.000007944555,0.000093928815,0.00007331492,0.000006408893,0.0007511956,0.99055576,0.00045181517,0.006222681,0.00043633053,0.00022602477],"about_ca_topic_score_codex":0.000011933322,"about_ca_topic_score_gemma":0.000089364934,"teacher_disagreement_score":0.85266197,"about_ca_system_score_codex":0.00006594015,"about_ca_system_score_gemma":0.00003990635,"threshold_uncertainty_score":0.9046652},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010513062,0.000050073184,0.98400927,0.0010707726,0.00249133,0.0006574678,0.000107616346,0.0008951955,0.0002052115],"genre_scores_gemma":[0.5152846,0.000007505219,0.47614193,0.007782318,0.00048262568,0.000060512866,0.00015128542,0.0000656308,0.000023591725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971443,0.00014552717,0.00054922845,0.000894238,0.00057549815,0.0006912387],"domain_scores_gemma":[0.99764234,0.00021143314,0.00026715948,0.00078577374,0.00074761093,0.000345666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044566477,0.00043112738,0.00038390385,0.0003402619,0.00074609066,0.00039439095,0.0013092604,0.00013834429,0.000010870182],"category_scores_gemma":[3.78464e-7,0.00044453645,0.0001776998,0.0009879622,0.000013861749,0.00095307577,0.000031322805,0.00032426158,0.00006855621],"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.000045670164,0.00039023563,0.0000068922795,0.00020334491,0.00007323996,0.000006823266,0.006650941,0.941843,0.00014587007,0.00010525561,0.000046775538,0.050481994],"study_design_scores_gemma":[0.0017369445,0.00021839827,0.000013069177,0.00017815184,0.000054298147,0.000054517346,0.0012139671,0.9871192,0.0074663,0.00021053817,0.0012600935,0.00047451272],"about_ca_topic_score_codex":0.00023065551,"about_ca_topic_score_gemma":0.0003137937,"teacher_disagreement_score":0.50786734,"about_ca_system_score_codex":0.0001101502,"about_ca_system_score_gemma":0.000095764175,"threshold_uncertainty_score":0.9998006},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013647246,0.000038108883,0.0059348224,0.00016982076,0.98710656,0.0005478125,0.0008488354,0.00035119537,0.003638106],"genre_scores_gemma":[0.0091031995,0.000027731878,0.00007674984,0.00008834172,0.9868893,0.000015473752,0.000070857495,0.00008692442,0.00364141],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9877805,0.00060313736,0.0014939441,0.0029420392,0.0063061817,0.0008742078],"domain_scores_gemma":[0.98639005,0.008776036,0.0010579018,0.0024354171,0.0009479815,0.00039258323],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0042249253,0.0008996515,0.0012681915,0.0010427221,0.0012566609,0.0036151067,0.0030217285,0.0007595563,0.000088685425],"category_scores_gemma":[0.000101687,0.0006678479,0.00034878904,0.0011064543,0.000166542,0.00057702383,0.00010510171,0.0013019617,0.0028722337],"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.000111624744,0.00022093851,0.0000022559875,0.00025753397,0.00010340765,0.000013832591,0.0009978348,0.00485143,0.000009931312,0.000017807291,0.9566842,0.036729254],"study_design_scores_gemma":[0.000771855,0.00025086,0.0000073131946,0.0012978027,0.00011342739,0.0000024683593,0.00081002415,0.017255913,0.000043313485,0.0001617997,0.97858536,0.00069988024],"about_ca_topic_score_codex":0.00066471956,"about_ca_topic_score_gemma":0.0003284346,"teacher_disagreement_score":0.036029372,"about_ca_system_score_codex":0.00019669373,"about_ca_system_score_gemma":0.00012770332,"threshold_uncertainty_score":0.9995773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43583733,0.00015097845,0.56080866,0.0003405806,0.001077442,0.00020963201,0.000008599635,0.00028054998,0.0012862348],"genre_scores_gemma":[0.9749161,0.000034560828,0.023591768,0.0012803724,0.000116428935,0.000006397289,0.000009640355,0.000023510307,0.000021227697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783635,0.00014065042,0.00055557326,0.00061766,0.0005137672,0.0003359868],"domain_scores_gemma":[0.9984117,0.00020387807,0.000372088,0.000576247,0.00030244954,0.00013364316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003281699,0.00029631544,0.0003279585,0.0002556616,0.0002922492,0.00016711281,0.00068158784,0.0001441907,0.000005531002],"category_scores_gemma":[7.8499215e-7,0.00028636682,0.00008971874,0.0009200579,0.000041656698,0.0013915378,0.000024490413,0.0002801685,0.000026970058],"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.00028344014,0.0007650126,0.0037042317,0.0021939613,0.00035261357,0.000026809284,0.15244536,0.7091639,0.006678818,0.0068859668,0.000027498469,0.11747237],"study_design_scores_gemma":[0.0012345683,0.00029523927,0.00088183803,0.00035389926,0.00006133428,0.00005126285,0.0032785893,0.9836819,0.0075346045,0.0012398787,0.0010184168,0.0003684792],"about_ca_topic_score_codex":0.00079804583,"about_ca_topic_score_gemma":0.00066821754,"teacher_disagreement_score":0.5390788,"about_ca_system_score_codex":0.000039928917,"about_ca_system_score_gemma":0.00007195296,"threshold_uncertainty_score":0.9999589},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50704575,0.000016485299,0.49253476,0.000103547056,0.000129171,0.00010435189,5.0332693e-7,0.000038524635,0.000026925241],"genre_scores_gemma":[0.9664391,0.000006651041,0.03343908,0.00007118931,0.0000135747905,0.000004022264,2.8753033e-7,0.0000062780155,0.000019782388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988605,0.00009500754,0.0002736727,0.0003085084,0.00030084612,0.00016147525],"domain_scores_gemma":[0.99936956,0.00014992351,0.0001262708,0.0002188324,0.0000996365,0.000035765457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004891474,0.00011296978,0.0001301543,0.00024287235,0.00012597252,0.000027552387,0.0002445307,0.000043773678,0.0000051460856],"category_scores_gemma":[0.0000017836751,0.000087167085,0.000030036153,0.00032556136,0.000027812273,0.000080200116,0.000014678471,0.000076305165,0.000003534446],"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.000006340108,0.00006198917,0.00051720365,0.000026447357,0.00000845812,3.9170376e-7,0.00055800064,0.77918524,0.0002441468,0.000014132336,3.228407e-7,0.21937735],"study_design_scores_gemma":[0.00088581874,0.00006285045,0.0058805994,0.00036010667,0.000008238451,0.0000033287465,0.000038711372,0.9909086,0.0017281695,0.0000128431775,0.000003507507,0.00010718595],"about_ca_topic_score_codex":0.000042197236,"about_ca_topic_score_gemma":0.000026513097,"teacher_disagreement_score":0.45939338,"about_ca_system_score_codex":0.000048898062,"about_ca_system_score_gemma":0.000020842275,"threshold_uncertainty_score":0.35545707},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19970202,0.00033429475,0.7964855,0.00022287606,0.0017278815,0.00042317837,0.0000049862274,0.0005938097,0.0005054815],"genre_scores_gemma":[0.9425094,0.00000948244,0.05634264,0.0007177195,0.00022033269,0.000020194586,0.0000033571553,0.000039584047,0.00013730561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968718,0.00013789153,0.00060790015,0.0010101167,0.00058326696,0.00078900723],"domain_scores_gemma":[0.99831295,0.0002123509,0.0002802528,0.0006946882,0.00019342708,0.00030634418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010447256,0.00041054466,0.00041612654,0.00037369833,0.00094543805,0.00069975544,0.0010491684,0.00011186318,5.5811495e-7],"category_scores_gemma":[5.57668e-7,0.00040442852,0.00014584794,0.0006525294,0.00002594225,0.000068383706,0.00010818957,0.00020737984,0.000013535899],"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.00001906417,0.00020206122,0.000026864662,0.00078876445,0.00011136322,0.000009439492,0.004013147,0.9581147,0.000015605781,0.0026123412,0.000012492255,0.034074184],"study_design_scores_gemma":[0.0014290985,0.000130826,0.000045235145,0.000659114,0.00005908185,0.000025833482,0.0038453739,0.99006575,0.00017300785,0.00007635088,0.0030586151,0.00043170506],"about_ca_topic_score_codex":0.0002114037,"about_ca_topic_score_gemma":0.000060271974,"teacher_disagreement_score":0.7428074,"about_ca_system_score_codex":0.0001282831,"about_ca_system_score_gemma":0.00002153174,"threshold_uncertainty_score":0.99984074},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.385489,0.00009736138,0.6136956,0.00007141762,0.0003196847,0.00017489615,0.000004959329,0.000098398246,0.00004864872],"genre_scores_gemma":[0.88694996,0.000010370675,0.112731345,0.00022124164,0.000059939463,0.0000075885455,0.000002872421,0.000015310288,0.0000013772337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985391,0.00004773303,0.0003907808,0.0004158645,0.00027409525,0.00033241874],"domain_scores_gemma":[0.9989261,0.00010286503,0.00017100142,0.00039464512,0.0002702946,0.00013507916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036156276,0.00020168205,0.000241201,0.0003426524,0.00032735066,0.00011500485,0.0005217859,0.0000858497,5.257623e-7],"category_scores_gemma":[7.667561e-7,0.00019505652,0.000098723205,0.0006682315,0.000029410185,0.0007105542,0.000015709822,0.00014003484,0.000001207577],"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.00007569373,0.00010536387,0.000051701907,0.00034848793,0.00006686268,7.0050635e-7,0.009469593,0.9342534,0.0034450204,0.0021362503,3.7212047e-7,0.050046556],"study_design_scores_gemma":[0.0006560802,0.00013783587,0.000028920593,0.00012747511,0.000037422447,0.000014326621,0.0010743656,0.98675036,0.010022186,0.00091668294,0.00004186189,0.00019246463],"about_ca_topic_score_codex":0.00041196888,"about_ca_topic_score_gemma":0.00018451927,"teacher_disagreement_score":0.50146097,"about_ca_system_score_codex":0.000023159337,"about_ca_system_score_gemma":0.00004369054,"threshold_uncertainty_score":0.7954174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.262092,0.000019055204,0.7362789,0.00032787982,0.00032460224,0.00034064168,0.0000013471904,0.00019811219,0.00041746438],"genre_scores_gemma":[0.9025582,0.0000047667463,0.09708002,0.00014104493,0.00007061238,0.000037206377,3.5902602e-7,0.000022313005,0.00008544245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796426,0.00008838093,0.0004242589,0.0007578425,0.00026418702,0.0005010849],"domain_scores_gemma":[0.998906,0.0002298703,0.00013026824,0.00061703695,0.0000232406,0.00009353935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047864128,0.00025605748,0.00025860366,0.00026782296,0.00019405475,0.00010784345,0.0009134427,0.000053802323,0.0000014249857],"category_scores_gemma":[0.0000010519934,0.000203414,0.00015041967,0.00018836262,0.000028419434,0.000023669425,0.00004048176,0.00017363993,0.000006203416],"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.00002040022,0.00023269198,0.000023883791,0.00009042364,0.00003730541,0.000005505155,0.0010445113,0.64465624,0.00087322656,0.00018560942,9.1231584e-7,0.35282928],"study_design_scores_gemma":[0.0009812693,0.00012977765,0.00007131274,0.00023911522,0.000011288429,0.000011761877,0.0001571016,0.9903058,0.0073985728,0.00015956271,0.00024125697,0.00029321588],"about_ca_topic_score_codex":0.00009067628,"about_ca_topic_score_gemma":0.000009285655,"teacher_disagreement_score":0.6404662,"about_ca_system_score_codex":0.0001987746,"about_ca_system_score_gemma":0.0000137549705,"threshold_uncertainty_score":0.82949823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033501744,0.00004589392,0.95666534,0.00040018093,0.0035894534,0.00043758756,0.00002379869,0.00096565916,0.0043703234],"genre_scores_gemma":[0.9973749,0.0000037400403,0.0015655584,0.00040288034,0.00019447185,0.000029055946,0.0000018367206,0.000039477065,0.00038806343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711424,0.00019866685,0.0006003083,0.00089388905,0.0005843758,0.0006085294],"domain_scores_gemma":[0.9964696,0.00035297987,0.0006488681,0.001955999,0.00034221454,0.00023034269],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00059421477,0.00039949996,0.00053738465,0.0002484291,0.0027069205,0.0015747705,0.0024304113,0.00018131199,0.000017840452],"category_scores_gemma":[0.0000038163457,0.00042284955,0.0002459419,0.00025085185,0.00006907578,0.0017726497,0.000038666836,0.0004681327,0.0003731302],"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.00008408314,0.00047559754,0.0006959577,0.0010841954,0.00045277167,0.00017678016,0.0044913986,0.014159686,0.0012304452,0.0026160788,0.00016262093,0.97437036],"study_design_scores_gemma":[0.0015387575,0.00014709454,0.0009005504,0.0015705988,0.000051047457,0.00024159328,0.0016773645,0.9786414,0.010799674,0.000048229023,0.0035784442,0.000805239],"about_ca_topic_score_codex":0.0015874729,"about_ca_topic_score_gemma":0.0012584269,"teacher_disagreement_score":0.97356516,"about_ca_system_score_codex":0.00020988173,"about_ca_system_score_gemma":0.00010020376,"threshold_uncertainty_score":0.9998223},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5098557,0.000023950359,0.48942387,0.000022422922,0.00026049183,0.00012783012,0.000053010663,0.00007897686,0.00015373153],"genre_scores_gemma":[0.9975956,0.000008965801,0.0022655404,0.000035316607,0.000025722708,0.0000029487207,0.000017810622,0.000022703562,0.000025363111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999224,0.000010498177,0.00025623158,0.0002477893,0.000081939994,0.00017950794],"domain_scores_gemma":[0.99885297,0.00013431821,0.00009835884,0.00075600273,0.0001065356,0.000051800387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022735167,0.00012545969,0.00020912668,0.000057988967,0.00037537114,0.0001045142,0.00030747498,0.00006276685,0.0000041019625],"category_scores_gemma":[0.0000048190373,0.00013994239,0.000034732555,0.000036993937,0.000047236703,0.00024822645,0.000011373778,0.00007296644,2.5257518e-7],"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.00022849039,0.00026097652,0.005784652,0.0056972294,0.00062966713,0.000029395474,0.0046783965,0.20301905,0.022781806,0.001003105,0.0001217957,0.75576544],"study_design_scores_gemma":[0.00035736497,0.00004636273,0.00077596895,0.000114974195,0.000041882715,0.000005780045,0.00061853416,0.9949541,0.002097553,0.0001929742,0.00064428407,0.0001502105],"about_ca_topic_score_codex":0.00041616338,"about_ca_topic_score_gemma":0.0004555148,"teacher_disagreement_score":0.791935,"about_ca_system_score_codex":0.000022702014,"about_ca_system_score_gemma":0.000013741261,"threshold_uncertainty_score":0.5706685},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22173654,0.000021216922,0.7766136,0.0002802827,0.00084945135,0.00012769586,0.00017744084,0.00014957001,0.000044183555],"genre_scores_gemma":[0.98738104,0.0000075335133,0.012221237,0.00028053953,0.00003964369,0.0000031112863,0.00004583355,0.000012769097,0.000008303828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982035,0.00007607814,0.00036415836,0.0006408547,0.0003937887,0.00032160035],"domain_scores_gemma":[0.9958115,0.00020664505,0.00037534657,0.003403586,0.00009318159,0.000109697874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037379988,0.00021092514,0.00025813616,0.00014743114,0.00086588267,0.0004381707,0.0039977925,0.00008840891,0.0000071684653],"category_scores_gemma":[0.0000064005985,0.00021449444,0.00011144889,0.00019275221,0.00008296443,0.00081094826,0.000072614836,0.00034319155,0.000011471716],"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.0003430444,0.002060869,0.016260536,0.00087233266,0.00087473984,0.00009531481,0.0020080472,0.8556064,0.0041431305,0.0010517264,0.00034916773,0.1163347],"study_design_scores_gemma":[0.00059660245,0.00007217789,0.0032574064,0.00055218424,0.000040984814,0.000002873105,0.00011738015,0.99337316,0.00160885,0.000040187195,0.000113438706,0.0002247576],"about_ca_topic_score_codex":0.00088948355,"about_ca_topic_score_gemma":0.0002299227,"teacher_disagreement_score":0.7656445,"about_ca_system_score_codex":0.00003215876,"about_ca_system_score_gemma":0.000046488807,"threshold_uncertainty_score":0.87468296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52765495,0.000018186756,0.47038972,0.00029476383,0.0008798235,0.00014427064,0.000013468019,0.00014176819,0.00046309025],"genre_scores_gemma":[0.96099114,0.0000054391617,0.038270365,0.00058006594,0.00010533101,0.0000032236744,0.0000029870807,0.000031392705,0.0000100776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997357,0.00015050496,0.0005963395,0.00074210763,0.00065160386,0.0005024443],"domain_scores_gemma":[0.9971102,0.00038890532,0.0005738724,0.00122631,0.00053961785,0.00016111601],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00035525498,0.0003735955,0.00043270987,0.00041350012,0.0013056973,0.0005813343,0.0028609207,0.00012413217,0.000022009817],"category_scores_gemma":[0.0000015309603,0.0003692333,0.00015283657,0.00051562215,0.00006843269,0.0014926752,0.000107996435,0.00055933726,0.00003750218],"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.000114553724,0.0003255734,0.0007122398,0.0006480081,0.00030014463,0.000016609598,0.018633192,0.914569,0.01933072,0.0005622215,0.0000010832551,0.04478662],"study_design_scores_gemma":[0.00069440785,0.00010854705,0.0015964821,0.0007149286,0.000033078286,0.000032700944,0.0011249525,0.9350397,0.059959743,0.000287257,0.000056444132,0.00035173658],"about_ca_topic_score_codex":0.002044326,"about_ca_topic_score_gemma":0.0009647205,"teacher_disagreement_score":0.4333362,"about_ca_system_score_codex":0.00008971047,"about_ca_system_score_gemma":0.00013653292,"threshold_uncertainty_score":0.99999446},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122501865,0.000020414645,0.8748715,0.0006288052,0.0005161756,0.00020966222,0.0000020789498,0.0003794894,0.0008700069],"genre_scores_gemma":[0.954632,0.000004257775,0.044311315,0.0007090567,0.00023865634,0.0000040147506,0.0000066483576,0.000021510215,0.00007253131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975952,0.00011090935,0.00041199825,0.0011297857,0.00029914427,0.00045296166],"domain_scores_gemma":[0.997059,0.00011020686,0.00018453859,0.0024765837,0.000090615475,0.0000790526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007196971,0.00021994127,0.00019682331,0.0002080624,0.00044286042,0.00023358874,0.0018090146,0.00007156567,0.000005685267],"category_scores_gemma":[0.0000016795484,0.00019536099,0.00003927613,0.0009920307,0.000042368232,0.00013840267,0.000072227,0.000325716,0.000034168213],"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.00002052735,0.0001754768,0.00075179985,0.000041458334,0.000035958506,0.000012883902,0.001477525,0.680212,0.000015643998,0.000057218604,0.000036766494,0.3171627],"study_design_scores_gemma":[0.000468298,0.0001022401,0.0011715792,0.00034719455,0.0000098970695,0.00002535137,0.00010280077,0.99657243,0.00012270303,0.000024404519,0.00082755537,0.00022554991],"about_ca_topic_score_codex":0.0001777077,"about_ca_topic_score_gemma":0.0003525726,"teacher_disagreement_score":0.83213013,"about_ca_system_score_codex":0.0000570316,"about_ca_system_score_gemma":0.000019702742,"threshold_uncertainty_score":0.796659},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2418548,0.00003207239,0.64405555,0.0028871002,0.008347364,0.002460472,0.00007631515,0.0014242461,0.0988621],"genre_scores_gemma":[0.96582794,0.0000042617066,0.0010578008,0.00702697,0.025854144,0.000029346284,0.00001961797,0.000051687985,0.00012822541],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982402,0.00003113264,0.0004396289,0.0005911018,0.00035351067,0.00034445125],"domain_scores_gemma":[0.9982547,0.00016692457,0.00031613235,0.0003498068,0.00087441405,0.000037991573],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002050194,0.00031763045,0.00026947216,0.00042315776,0.0013120993,0.0005152539,0.0002861594,0.000098540666,0.00036696414],"category_scores_gemma":[0.0000040517725,0.00033860316,0.000048977556,0.0023252682,0.00009212663,0.00060954964,0.000019689141,0.00024850204,0.0010835829],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014349229,0.0024550757,0.003981508,0.0023539406,0.00067523756,0.000025562054,0.013354276,0.14755753,0.0016734287,0.018334325,0.012501987,0.7956522],"study_design_scores_gemma":[0.0019669898,0.00014948598,0.0013770182,0.0005414739,0.00014624432,0.0000057891234,0.006029995,0.28390864,0.0015587755,0.00028414282,0.7031226,0.00090884813],"about_ca_topic_score_codex":0.00018578525,"about_ca_topic_score_gemma":0.001136088,"teacher_disagreement_score":0.79474336,"about_ca_system_score_codex":0.000063545485,"about_ca_system_score_gemma":0.000032120224,"threshold_uncertainty_score":0.9999881},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19181374,0.000020923435,0.8054559,0.00032368515,0.00059563515,0.00012587274,0.00000941852,0.0005024645,0.001152345],"genre_scores_gemma":[0.99503547,0.0000026861385,0.0006109429,0.0031655978,0.0010591913,0.000006575429,0.0000502124,0.000042130145,0.000027219648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809533,0.000008284667,0.00041315332,0.0006240103,0.00044677738,0.0004124296],"domain_scores_gemma":[0.9983518,0.00004079465,0.00031836412,0.00064291514,0.0006232661,0.000022840622],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003741484,0.000285017,0.00028247046,0.00038427458,0.0009510825,0.00054681266,0.0010014215,0.00009916401,0.00014004974],"category_scores_gemma":[0.0000034431093,0.0002712259,0.00006852382,0.0012514128,0.000072900635,0.0018481758,0.000014967849,0.00025779245,0.0003391781],"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.00020333071,0.0004785209,0.0021723218,0.0036970978,0.00023944787,0.00001472589,0.000590827,0.8179839,0.00042444497,0.000086780594,0.00008370358,0.17402488],"study_design_scores_gemma":[0.00040788125,0.000010715812,0.00008953427,0.0004170412,0.00014666708,0.0000017422184,0.00037883178,0.99639094,0.00096061843,0.00008887313,0.00077091274,0.00033621717],"about_ca_topic_score_codex":0.00056443654,"about_ca_topic_score_gemma":0.00085705274,"teacher_disagreement_score":0.804845,"about_ca_system_score_codex":0.000020709522,"about_ca_system_score_gemma":0.000054403765,"threshold_uncertainty_score":0.999974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11849957,0.000049772498,0.8795035,0.00010396136,0.0009239729,0.00012390577,0.0000014954973,0.00050657784,0.00028726208],"genre_scores_gemma":[0.9512227,0.0000039109814,0.04778173,0.0005647295,0.00018838605,0.000016728583,0.0000014806988,0.000023983632,0.00019631858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835247,0.000044024873,0.0003035329,0.0005803299,0.00026020847,0.0004594367],"domain_scores_gemma":[0.9989693,0.00014752036,0.00012451108,0.00040525428,0.00023618585,0.000117222145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032172762,0.00021772175,0.00020011768,0.00021242106,0.0011303395,0.0002947709,0.0007096471,0.000086038555,0.000003347301],"category_scores_gemma":[0.0000010839585,0.00022618058,0.00017963897,0.00039527388,0.000032085525,0.0002354257,0.000014342414,0.00024708835,0.000030559495],"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.000042371845,0.00008689813,0.0000029714686,0.000030190138,0.000028163884,9.657838e-7,0.0020558957,0.933229,0.0014242468,0.0013909858,0.0000017049575,0.061706584],"study_design_scores_gemma":[0.00078778365,0.0001241504,0.0000025310837,0.000106030086,0.00002011449,0.000008870759,0.0001689409,0.99426574,0.004009377,0.00013883445,0.00011198149,0.0002556734],"about_ca_topic_score_codex":0.00014740464,"about_ca_topic_score_gemma":0.00014232387,"teacher_disagreement_score":0.83272314,"about_ca_system_score_codex":0.000064856446,"about_ca_system_score_gemma":0.00004202278,"threshold_uncertainty_score":0.92233765},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08616557,0.000034588425,0.9092483,0.00020438577,0.0010822411,0.00039657747,0.000005217079,0.000645024,0.002218118],"genre_scores_gemma":[0.9414225,0.0000042915767,0.05328194,0.0043081334,0.0008262564,0.000030719493,0.000005183792,0.00004733123,0.000073621726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970582,0.00013612075,0.0005652915,0.000910952,0.00051813485,0.0008112603],"domain_scores_gemma":[0.9981403,0.00024783716,0.0002735822,0.0006333106,0.0004052467,0.00029975473],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00041488023,0.00046257154,0.00044179976,0.0002210332,0.0015286345,0.00060522964,0.0014032715,0.0001954702,0.00004008762],"category_scores_gemma":[1.6966457e-7,0.00040829743,0.00012455104,0.0014566301,0.000083542065,0.00059111405,0.00003354057,0.00056551973,0.00015977894],"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.00016594106,0.00034306277,0.00024053341,0.0002590798,0.00022028723,0.000055484175,0.01748281,0.18361966,0.00016256927,0.00046251048,0.00009639986,0.7968916],"study_design_scores_gemma":[0.0004472835,0.0004943074,0.00010673918,0.0004212538,0.00004568976,0.000040430066,0.001265879,0.9949527,0.00027925058,0.00003506433,0.0014020723,0.000509333],"about_ca_topic_score_codex":0.0002976335,"about_ca_topic_score_gemma":0.0011699111,"teacher_disagreement_score":0.8559663,"about_ca_system_score_codex":0.00007536757,"about_ca_system_score_gemma":0.00008285783,"threshold_uncertainty_score":0.99983686},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37643093,0.000058696573,0.62174684,0.00054266956,0.0007475802,0.00022273308,0.000026748492,0.0001853302,0.00003846196],"genre_scores_gemma":[0.9074249,0.000011109746,0.09192002,0.000381494,0.00021664643,0.0000069780763,0.000015210197,0.000019067786,0.0000045679226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975058,0.00017891312,0.00048021917,0.0010330857,0.00031739436,0.00048462715],"domain_scores_gemma":[0.9971808,0.00030907916,0.00016065726,0.0021125784,0.00009720252,0.00013967713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008484153,0.00024012577,0.00022532888,0.000341668,0.0007188132,0.0003359187,0.0026646024,0.00010095449,0.0000044311687],"category_scores_gemma":[0.000014687701,0.00026737497,0.000038331942,0.0011414782,0.00009164404,0.00053734606,0.00029589806,0.00037409246,0.000049165865],"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.00014195501,0.0044754464,0.006738057,0.0011963663,0.0002885257,0.000056014662,0.08015012,0.1283022,0.031713467,0.0046375003,0.0003269146,0.74197346],"study_design_scores_gemma":[0.00058987935,0.000046313693,0.0045384844,0.00023562186,0.000010881497,0.000024050583,0.00029291306,0.992625,0.00064340356,0.00009326095,0.0006295005,0.00027072057],"about_ca_topic_score_codex":0.0007941825,"about_ca_topic_score_gemma":0.003271109,"teacher_disagreement_score":0.8643228,"about_ca_system_score_codex":0.000098559416,"about_ca_system_score_gemma":0.00005588275,"threshold_uncertainty_score":0.9999778},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107298404,0.000031348063,0.8897324,0.00024350514,0.0012559927,0.00049029273,0.000015025156,0.00081821886,0.00011478716],"genre_scores_gemma":[0.9084168,7.095926e-7,0.089386806,0.0013280085,0.0007337601,0.00003528626,0.0000040815044,0.000043910957,0.000050642193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738437,0.00009394173,0.00050241844,0.0008429272,0.0003174136,0.0008589574],"domain_scores_gemma":[0.9975404,0.0011564317,0.00025087778,0.0006720126,0.00021442758,0.00016585915],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006427041,0.00032847686,0.00030445124,0.00012881619,0.0014886954,0.0006266343,0.000967543,0.00015217738,0.0000056659865],"category_scores_gemma":[0.000009240601,0.00033468005,0.00021500308,0.00074569363,0.000076764794,0.00040954023,0.000015470592,0.00031354025,0.000026973039],"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.00012630396,0.00016630032,0.00016104915,0.00023042354,0.00006065412,0.0000055949663,0.003944451,0.73093235,0.0003532367,0.000103116465,0.00011398483,0.2638025],"study_design_scores_gemma":[0.0012672128,0.00035241505,0.00008027227,0.00029716975,0.000016876915,0.000009033135,0.0006770117,0.9895333,0.004772995,0.0000833462,0.002539982,0.00037040046],"about_ca_topic_score_codex":0.00013855228,"about_ca_topic_score_gemma":0.00033638274,"teacher_disagreement_score":0.8011184,"about_ca_system_score_codex":0.00007893903,"about_ca_system_score_gemma":0.000078778736,"threshold_uncertainty_score":0.99991053},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6255798,0.00011696457,0.3732065,0.00006517783,0.00048537354,0.00018422712,0.000051728013,0.00008243679,0.00022780187],"genre_scores_gemma":[0.99236506,0.000041480787,0.0072692935,0.00027652102,0.000022845583,0.0000022951433,0.000011727295,0.000008353672,0.0000024330413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847305,0.00008850558,0.00023804454,0.0007115891,0.00020764906,0.00028113846],"domain_scores_gemma":[0.99870664,0.00024987996,0.00008078693,0.0008404196,0.000037089667,0.00008518857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035351247,0.00018767532,0.00022606524,0.00019246401,0.00020589127,0.00025032522,0.00062175165,0.00007623274,0.0000101749965],"category_scores_gemma":[0.0000012324269,0.00018630327,0.000026648931,0.00055974483,0.00006177076,0.00070965197,0.00006518622,0.0002838914,0.000011731217],"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.0020720325,0.0044098934,0.050912593,0.0040548216,0.00095542934,0.00015445011,0.10751264,0.269694,0.015095295,0.16794895,0.00017106444,0.37701884],"study_design_scores_gemma":[0.0012989136,0.00018020051,0.011461141,0.00020247723,0.000017042847,0.000018549872,0.00089813257,0.98330766,0.000635938,0.0010647151,0.0005391519,0.0003760759],"about_ca_topic_score_codex":0.0006900667,"about_ca_topic_score_gemma":0.00040466074,"teacher_disagreement_score":0.7136137,"about_ca_system_score_codex":0.000018255012,"about_ca_system_score_gemma":0.000027115362,"threshold_uncertainty_score":0.7597227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5043156,0.000016669726,0.49153718,0.00005268018,0.0033101058,0.00026123648,6.489995e-7,0.00023389432,0.00027195064],"genre_scores_gemma":[0.9348334,0.0000016904955,0.064487696,0.00018845963,0.0004252203,0.0000010711092,0.000001113409,0.000034488716,0.000026871247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674004,0.0002883897,0.00085058395,0.0008346459,0.0005645468,0.00072177587],"domain_scores_gemma":[0.9968989,0.000837508,0.0005719972,0.0013024396,0.000272435,0.00011673037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013736418,0.00038358968,0.00051356456,0.00023801147,0.00081461045,0.00028066183,0.001723924,0.00015126352,0.0000102426775],"category_scores_gemma":[0.000005315435,0.00032820483,0.00028398482,0.0011330543,0.00008205593,0.00053834403,0.0000803475,0.0005670909,0.00009430999],"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.0000554633,0.00044640354,0.0021425344,0.0010536528,0.00022443544,0.000009069443,0.009917632,0.5820557,0.17705242,0.00030893652,0.000015366113,0.22671838],"study_design_scores_gemma":[0.00042972039,0.000096921176,0.0007892364,0.00028338638,0.000030690473,0.000026300246,0.00018031296,0.9803031,0.017403629,0.00008812971,0.00003078385,0.0003378066],"about_ca_topic_score_codex":0.0009868963,"about_ca_topic_score_gemma":0.000008146326,"teacher_disagreement_score":0.43051776,"about_ca_system_score_codex":0.00013700794,"about_ca_system_score_gemma":0.00013848051,"threshold_uncertainty_score":0.999917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18322791,0.00005088129,0.8137423,0.0007075925,0.0012971944,0.0004613196,0.0000057483994,0.00034030032,0.0001667584],"genre_scores_gemma":[0.9463451,0.000001865324,0.050544772,0.0027208996,0.0002589465,0.000008364138,0.0000037516038,0.000034388584,0.0000819442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787575,0.00005983813,0.00037869383,0.00083618355,0.00026845903,0.0005811023],"domain_scores_gemma":[0.9984722,0.0004087835,0.0001997349,0.0007029644,0.00009148544,0.00012483164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004410266,0.00031591952,0.00030567177,0.00017151698,0.00060952443,0.00050297886,0.0009355901,0.000107548134,0.0000035903863],"category_scores_gemma":[0.0000012343733,0.0002986673,0.000117201234,0.00051550544,0.000018813373,0.00008639235,0.00006634555,0.00040113783,0.0000136215],"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.000025742036,0.00009146602,0.00005979338,0.0002688883,0.0000686715,0.0000014680382,0.0017730718,0.88868856,0.0004235531,0.00028294537,0.000010991329,0.108304836],"study_design_scores_gemma":[0.0010668272,0.00008752902,0.00019917927,0.00057069334,0.000028089516,0.000032414257,0.00025495695,0.9960026,0.0002176659,0.00004523027,0.001158909,0.0003358763],"about_ca_topic_score_codex":0.00011312006,"about_ca_topic_score_gemma":0.000085607804,"teacher_disagreement_score":0.76319754,"about_ca_system_score_codex":0.00004108486,"about_ca_system_score_gemma":0.000017513945,"threshold_uncertainty_score":0.99994653},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08460496,0.000047145786,0.90961015,0.0042197835,0.000099956516,0.00047539646,0.000014286586,0.00090874603,0.000019588626],"genre_scores_gemma":[0.94274706,6.646914e-7,0.051178742,0.005844182,0.00010473611,0.00009218694,0.0000034763427,0.000027433378,0.0000015159536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803746,0.0000923621,0.00032409182,0.0008314772,0.00024209979,0.00047252895],"domain_scores_gemma":[0.99854654,0.00026198212,0.000168776,0.00062709564,0.00016704139,0.0002285372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020611823,0.00031182592,0.00033390408,0.00014411854,0.0007116729,0.00012665549,0.0011412157,0.00020844213,0.0000040603745],"category_scores_gemma":[8.845132e-7,0.00027709646,0.00013446773,0.00083625806,0.00007646116,0.000022336244,0.0000071441727,0.00046528177,0.0000026011983],"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.00009205862,0.00027278668,0.000006301647,0.000038534687,0.00004244664,0.0000024260205,0.000948872,0.9659918,0.00017564364,0.0035480747,0.0000056645295,0.028875373],"study_design_scores_gemma":[0.0013403599,0.0004943793,0.000010248327,0.00003732077,0.000030329702,0.0000071574286,0.00009381082,0.99305147,0.0035376307,0.0005114845,0.0005693574,0.00031644813],"about_ca_topic_score_codex":0.000055295273,"about_ca_topic_score_gemma":0.00019122844,"teacher_disagreement_score":0.8584314,"about_ca_system_score_codex":0.000033105858,"about_ca_system_score_gemma":0.00006466726,"threshold_uncertainty_score":0.9999681},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009223324,0.000019833871,0.98453283,0.0020596718,0.0015745267,0.00033139446,0.000038734706,0.0014749967,0.0007446884],"genre_scores_gemma":[0.9106316,0.000008432571,0.08284255,0.0062561515,0.00018899188,0.00001610111,0.000005562154,0.00002864736,0.000021977181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742603,0.00067449256,0.00048936106,0.0007206018,0.00034772806,0.00034179658],"domain_scores_gemma":[0.9983797,0.00045914523,0.00018805085,0.0005961075,0.00016959893,0.00020736399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090114865,0.00028740754,0.00033347216,0.00017288412,0.00037389336,0.0002823414,0.0010367214,0.00013702139,0.00001365459],"category_scores_gemma":[0.0000031254165,0.00027878807,0.0001211585,0.0011947333,0.000010070522,0.00040951843,0.000016182717,0.00044581812,0.000074103],"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.00016100491,0.0010793608,0.0022606184,0.0013004016,0.0005931483,0.00003800579,0.017380163,0.16382892,0.013747812,0.0010932462,0.0029033788,0.79561394],"study_design_scores_gemma":[0.00033695062,0.0002879787,0.0023722334,0.00013632514,0.000011474855,0.0000074743875,0.000061903746,0.98529357,0.008971165,0.000026938831,0.0022337867,0.00026021322],"about_ca_topic_score_codex":0.00059643656,"about_ca_topic_score_gemma":0.00034510496,"teacher_disagreement_score":0.9016903,"about_ca_system_score_codex":0.00005832173,"about_ca_system_score_gemma":0.00005126052,"threshold_uncertainty_score":0.99996644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27020672,0.00002206924,0.7273841,0.001512591,0.00020462288,0.0002114094,0.000011414087,0.00032965417,0.000117425756],"genre_scores_gemma":[0.95556414,0.000020874839,0.042597584,0.0016045829,0.00017790904,0.00000533461,0.0000061063215,0.000022130616,0.0000013290543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973414,0.00023021035,0.0003221514,0.0007868922,0.000764076,0.0005552631],"domain_scores_gemma":[0.9984043,0.0004320147,0.00011135862,0.0005991713,0.00012501815,0.0003280863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004246954,0.00026222243,0.0002594335,0.00030240414,0.0005766058,0.0005057887,0.0008985041,0.000097148884,0.000042845917],"category_scores_gemma":[0.000004375285,0.00024109078,0.00011865003,0.0023963894,0.00004872778,0.0012548872,0.00004323718,0.00083541987,0.00009924698],"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.00078245864,0.0031022227,0.01563923,0.0030502325,0.0008510875,0.00051514053,0.056729924,0.13012928,0.007304709,0.020289509,0.00027155547,0.76133466],"study_design_scores_gemma":[0.0010149193,0.0006488778,0.004572054,0.00019053195,0.000039707695,0.000057906498,0.00044522504,0.9884185,0.0032339017,0.00009353925,0.0007887185,0.0004961277],"about_ca_topic_score_codex":0.0002500697,"about_ca_topic_score_gemma":0.000041900577,"teacher_disagreement_score":0.8582892,"about_ca_system_score_codex":0.0000479851,"about_ca_system_score_gemma":0.00008536835,"threshold_uncertainty_score":0.98313963},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43035686,0.00003743046,0.56267923,0.002842139,0.00032562783,0.00040938644,0.0000068737454,0.00032898213,0.0030134786],"genre_scores_gemma":[0.9810939,0.000010048798,0.004851329,0.013968104,0.000046660927,0.000008858193,0.0000017338276,0.000014465176,0.000004908394],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980475,0.00015292352,0.000504673,0.0005328113,0.0003939199,0.0003681921],"domain_scores_gemma":[0.99901277,0.00007838182,0.00018309316,0.00036583006,0.00012311552,0.00023680985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036808033,0.00029112768,0.00030405362,0.00017237586,0.00025979461,0.00028821215,0.0005673029,0.00009791475,0.00002875071],"category_scores_gemma":[0.0000015996361,0.00027294824,0.000053694952,0.00093580486,0.00002632471,0.0010281847,0.000040926632,0.0005970098,0.000029544983],"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.00076386536,0.0015656671,0.0034164805,0.0066839377,0.00048276962,0.00028206376,0.8248112,0.080048025,0.00058648223,0.04138933,0.00043010124,0.039540064],"study_design_scores_gemma":[0.0012674283,0.00019331042,0.0011150748,0.00033655998,0.00001577899,0.00004096907,0.0021589028,0.9903776,0.0026986198,0.0007516645,0.0006031274,0.00044098415],"about_ca_topic_score_codex":0.00039121887,"about_ca_topic_score_gemma":0.0014342405,"teacher_disagreement_score":0.9103296,"about_ca_system_score_codex":0.00007904526,"about_ca_system_score_gemma":0.000061465595,"threshold_uncertainty_score":0.9999723},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74733573,0.0001866461,0.25188273,0.000023804045,0.00019201945,0.00021403888,0.000008258979,0.00010767496,0.00004911038],"genre_scores_gemma":[0.9957478,0.00008292876,0.0039987336,0.0000760728,0.000053339292,0.000007022321,0.0000033585375,0.000030383346,3.6057853e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870807,0.00005147552,0.00044908447,0.00023401008,0.00022409816,0.0003332574],"domain_scores_gemma":[0.99947804,0.000119145574,0.00013560045,0.00014255909,0.00006121612,0.00006342223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110236826,0.0001942546,0.00028128692,0.00013011861,0.00009672404,0.000015689473,0.00018904891,0.0000716238,0.000010441657],"category_scores_gemma":[6.769977e-7,0.00021953724,0.000085605134,0.0012246718,0.000012999095,0.00010067589,0.0000032367282,0.0002933197,0.000002086544],"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.00013350442,0.000037710797,0.00010507094,0.00079982355,0.0000980027,0.000004442974,0.0012045187,0.9702537,0.009548602,0.00002780628,0.0000015180104,0.017785316],"study_design_scores_gemma":[0.0009793825,0.0001514509,0.000594479,0.0003961642,0.000038728438,7.8707626e-7,0.00025054143,0.9100503,0.08733574,0.00002267212,0.000013304566,0.00016645394],"about_ca_topic_score_codex":0.000045472225,"about_ca_topic_score_gemma":0.000023381763,"teacher_disagreement_score":0.2484121,"about_ca_system_score_codex":0.000113658636,"about_ca_system_score_gemma":0.000015523923,"threshold_uncertainty_score":0.89524686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52642554,0.00007758836,0.47220418,0.0005408262,0.00039512478,0.00005505193,0.000015132981,0.00014045826,0.000146071],"genre_scores_gemma":[0.9947566,0.00001968113,0.003728739,0.0007277661,0.0005904762,0.000005179453,0.000035594843,0.0000359938,0.00010000186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984049,0.00001809003,0.0004227183,0.00046129944,0.0003730096,0.0003199823],"domain_scores_gemma":[0.99874085,0.00009294081,0.00032610958,0.0003222961,0.0004982611,0.000019542635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000247861,0.00023663997,0.00041983413,0.00038085209,0.00038358,0.0002730824,0.00033653865,0.000102200924,0.00007606619],"category_scores_gemma":[0.0000042039624,0.00024860576,0.0001473754,0.0015793485,0.000034239125,0.0005575715,0.000015183604,0.00022713246,0.000056962963],"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.00007056529,0.00056877965,0.004766228,0.007320622,0.00087186537,0.00007283032,0.0013902285,0.37616554,0.024472406,0.0005783416,0.000029259714,0.5836933],"study_design_scores_gemma":[0.0018789163,0.000025292591,0.004146777,0.0042815083,0.0016207673,0.0000126527175,0.0036915604,0.94532835,0.032946985,0.0037382734,0.0008012921,0.0015276268],"about_ca_topic_score_codex":0.0013119661,"about_ca_topic_score_gemma":0.00089697115,"teacher_disagreement_score":0.5821657,"about_ca_system_score_codex":0.000022268163,"about_ca_system_score_gemma":0.00003088524,"threshold_uncertainty_score":0.9999966},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39740357,0.00017118968,0.6014043,0.00028739343,0.00029668765,0.00012184904,0.0000667757,0.0001538909,0.000094333096],"genre_scores_gemma":[0.9608773,0.000050972656,0.038434584,0.00052459433,0.000050677987,0.000002627307,0.00004206194,0.000014297963,0.0000028766283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737865,0.0002326883,0.00036122283,0.0010249272,0.0005322801,0.00047022698],"domain_scores_gemma":[0.9971147,0.00041028447,0.00008931968,0.002088512,0.00010810916,0.00018904799],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006532285,0.00024038443,0.00025170084,0.00017599107,0.00070288876,0.00060713635,0.0019337777,0.000083647545,0.000051053],"category_scores_gemma":[0.000005803593,0.00025198318,0.0000725443,0.0008724393,0.00004318327,0.000664896,0.00035666293,0.00044163558,0.000011808916],"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.00029632912,0.0040562693,0.009204893,0.0036398077,0.0014651547,0.0008466502,0.07342182,0.34226346,0.044844992,0.026955683,0.00043343296,0.4925715],"study_design_scores_gemma":[0.00066334696,0.000048791997,0.0034542351,0.00024141463,0.000027997923,0.000049196555,0.0007279149,0.9895982,0.003999341,0.00012809884,0.0007425863,0.00031884512],"about_ca_topic_score_codex":0.00023922433,"about_ca_topic_score_gemma":0.000170385,"teacher_disagreement_score":0.64733475,"about_ca_system_score_codex":0.000041417647,"about_ca_system_score_gemma":0.000073827345,"threshold_uncertainty_score":0.99999326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49089038,0.000029115561,0.5071686,0.00004019768,0.00028151815,0.00015364877,0.000013473526,0.00045944375,0.0009636161],"genre_scores_gemma":[0.98993015,0.0000013534965,0.009464935,0.00036443895,0.000079506106,0.00001001126,0.000085152446,0.000052219097,0.000012238378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982301,0.00009069336,0.0005608885,0.00044748603,0.0002601466,0.00041067222],"domain_scores_gemma":[0.9992096,0.00012441321,0.000055474055,0.00039848257,0.0000951289,0.00011692655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030470465,0.00026677936,0.00028616912,0.00034727564,0.0003327573,0.00010380294,0.00021966356,0.00013751011,0.000038325037],"category_scores_gemma":[0.0000010566507,0.0003170209,0.000112398,0.0013769307,0.000025395426,0.00009906681,0.0000010694764,0.00053806294,0.000007911864],"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.000013570948,0.0003769059,0.00009039376,0.00026852827,0.000029003417,0.000010889859,0.0030036904,0.98865676,0.001806334,0.00013932932,0.0000048194215,0.005599791],"study_design_scores_gemma":[0.0009147458,0.000025663372,0.0025407264,0.0001411022,0.000026695961,0.0000083511695,0.0024118435,0.9861789,0.0070505342,0.0000058713217,0.0003913129,0.00030425456],"about_ca_topic_score_codex":0.000038709775,"about_ca_topic_score_gemma":0.0004412976,"teacher_disagreement_score":0.49903974,"about_ca_system_score_codex":0.00012153931,"about_ca_system_score_gemma":0.00005420582,"threshold_uncertainty_score":0.9999282},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43877956,0.00014672439,0.55967855,0.0005441912,0.0003267504,0.00015594532,0.0000187309,0.00020294929,0.00014658419],"genre_scores_gemma":[0.96208453,0.000014551858,0.037129454,0.0006820829,0.000050661733,0.000010631805,0.000007034141,0.00001829902,0.0000027457388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973906,0.00027619608,0.00043177666,0.0008549677,0.00049207814,0.0005543513],"domain_scores_gemma":[0.9979769,0.00033329404,0.00013137673,0.0012032749,0.00017735023,0.00017778133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004013696,0.00028361453,0.0003376928,0.00030845744,0.0004251545,0.0002670167,0.001125031,0.00012450204,0.00002414373],"category_scores_gemma":[0.0000040682758,0.00027793756,0.00013539898,0.0019389543,0.000035095425,0.00033345635,0.000044581688,0.0006212007,0.000011551987],"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.0004245633,0.0041485135,0.02426812,0.0029763859,0.0002751267,0.0010615551,0.043942623,0.7548437,0.0021206976,0.005905862,0.00004924746,0.1599836],"study_design_scores_gemma":[0.0014454111,0.00013821649,0.025249787,0.0006757336,0.000020050205,0.00006127238,0.0009864435,0.9666557,0.0036668612,0.0003514417,0.00020416162,0.00054493535],"about_ca_topic_score_codex":0.0010031973,"about_ca_topic_score_gemma":0.013251312,"teacher_disagreement_score":0.52330494,"about_ca_system_score_codex":0.000088974586,"about_ca_system_score_gemma":0.0001446289,"threshold_uncertainty_score":0.9999673},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02888227,0.00004163805,0.96573436,0.00060852565,0.003438365,0.00014068124,0.0000016787013,0.0005644134,0.0005880485],"genre_scores_gemma":[0.9103139,0.000004643076,0.08873061,0.00046690053,0.00029454276,0.0000029175899,0.000007849815,0.00003188833,0.00014672268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976836,0.00024210812,0.00034758658,0.0007616191,0.00049713877,0.0004679419],"domain_scores_gemma":[0.9985558,0.0002940304,0.00020306866,0.00066616305,0.00016170314,0.00011928313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002962181,0.00029916738,0.00029234416,0.0002127612,0.000840363,0.00033415985,0.00073097483,0.00018434519,0.00004346615],"category_scores_gemma":[0.000005568701,0.00033682046,0.00018673914,0.0009976247,0.000022199614,0.0007584744,0.000029875966,0.0007408287,0.00009791615],"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.0000152697,0.00007523019,0.00023324839,0.00010884778,0.00006796098,0.000083601524,0.0014662326,0.9464312,0.0018467876,0.0006410601,0.000010451356,0.049020093],"study_design_scores_gemma":[0.00062349084,0.000035014964,0.0007263522,0.0001834576,0.00004409866,0.00012020408,0.00018721807,0.99261135,0.004542114,0.00028354337,0.00029231893,0.00035084982],"about_ca_topic_score_codex":0.000077836194,"about_ca_topic_score_gemma":0.00012126754,"teacher_disagreement_score":0.88143164,"about_ca_system_score_codex":0.0001329265,"about_ca_system_score_gemma":0.00006620647,"threshold_uncertainty_score":0.9999084},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119181186,0.000022533359,0.8793544,0.00012165727,0.00025127802,0.00007264709,0.000006813034,0.00016281623,0.00082664995],"genre_scores_gemma":[0.9543457,0.0000059394906,0.0450023,0.0005631809,0.000033590575,0.0000025151824,0.000018348983,0.0000070437445,0.000021398948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986475,0.00008010177,0.00023666403,0.00041821736,0.00032655356,0.00029093793],"domain_scores_gemma":[0.9992261,0.00005888243,0.00010438616,0.00040092767,0.00013092216,0.0000787767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013495234,0.00015275629,0.00020333247,0.00016160631,0.00048719897,0.00031806593,0.000390107,0.000052916086,0.000045970908],"category_scores_gemma":[3.6564234e-7,0.00013682204,0.00012230431,0.0017452382,0.000023161347,0.00069069664,0.000012075612,0.0001618099,0.00001624209],"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.000027561517,0.00048127782,0.0027587633,0.000072133946,0.00095369515,0.00007333452,0.0044298773,0.8534113,0.00064271706,0.0017507196,0.000008954544,0.13538967],"study_design_scores_gemma":[0.000519913,0.00010316727,0.004402484,0.000032889606,0.00018371255,0.000019800562,0.0004184073,0.9850012,0.008904271,0.000055817665,0.0001043941,0.00025393747],"about_ca_topic_score_codex":0.00018662508,"about_ca_topic_score_gemma":0.0006680047,"teacher_disagreement_score":0.8351645,"about_ca_system_score_codex":0.000046921054,"about_ca_system_score_gemma":0.000046310546,"threshold_uncertainty_score":0.5579441},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17765321,0.00009756873,0.8204163,0.00048436775,0.00028785408,0.00018840263,0.000009321018,0.0007676748,0.00009531814],"genre_scores_gemma":[0.9461359,0.00004015187,0.05222617,0.001440982,0.00007135962,0.000008338862,0.000003065426,0.000029604262,0.000044459404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726814,0.00024915853,0.0004053675,0.00074319576,0.0008918291,0.00044230936],"domain_scores_gemma":[0.99834627,0.00026995473,0.0001752152,0.00086494326,0.0000888742,0.00025475712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075408525,0.00026096156,0.0002712122,0.00023838361,0.0011256627,0.00031680218,0.0019571288,0.000084478255,0.00013877072],"category_scores_gemma":[0.00001343115,0.00027257454,0.00008829874,0.00084628013,0.00005404652,0.0012847151,0.00015681029,0.00080289727,0.000005657971],"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.0007576953,0.0020657121,0.0015056791,0.000811746,0.0003785853,0.0006562319,0.019208949,0.05643551,0.12196103,0.0014987811,0.0003513129,0.79436874],"study_design_scores_gemma":[0.00070662814,0.00040836883,0.00065305294,0.000088646106,0.000014052733,0.00010977294,0.00035208726,0.94217634,0.052980285,0.00070201134,0.0013445981,0.00046412807],"about_ca_topic_score_codex":0.00006985859,"about_ca_topic_score_gemma":0.000006879473,"teacher_disagreement_score":0.8857409,"about_ca_system_score_codex":0.00007752541,"about_ca_system_score_gemma":0.000067478526,"threshold_uncertainty_score":0.99997264},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124702044,0.00009882723,0.8713171,0.0011597734,0.0013780396,0.0004109985,0.000015736565,0.00050898147,0.0004085286],"genre_scores_gemma":[0.9759728,0.0000034631144,0.010071834,0.013715472,0.00009756886,0.00007047717,0.000023821318,0.000037729318,0.0000068695467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967655,0.00046417647,0.00055675406,0.00090071576,0.00063684676,0.0006759884],"domain_scores_gemma":[0.99828094,0.00038775048,0.00024394416,0.0007949573,0.00013473028,0.00015766469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045804927,0.00039499838,0.0003636973,0.0006191974,0.0011348154,0.00018088034,0.0018343418,0.00009790163,0.000054743778],"category_scores_gemma":[1.3804318e-7,0.00044492193,0.00015473731,0.0030593502,0.000020039433,0.00044090077,0.000057767644,0.0010131473,0.000035481356],"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.00010621153,0.00039759616,0.00009638213,0.00007185174,0.000030801046,0.00003194131,0.0033282733,0.9751455,0.00027684958,0.00041258615,0.0000041927647,0.020097796],"study_design_scores_gemma":[0.0011470146,0.00025853916,0.00071882026,0.0001327248,0.00002002492,0.000030726267,0.0008115673,0.99423695,0.001529855,0.0001600573,0.0005036738,0.00045005055],"about_ca_topic_score_codex":0.0011294914,"about_ca_topic_score_gemma":0.0018515693,"teacher_disagreement_score":0.8612452,"about_ca_system_score_codex":0.00021589831,"about_ca_system_score_gemma":0.0000951413,"threshold_uncertainty_score":0.99980026},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044819858,0.000041569558,0.95176786,0.0013889326,0.0010862675,0.00026716563,0.000021433276,0.0003549157,0.0002519869],"genre_scores_gemma":[0.9618156,0.0000029925375,0.036395848,0.0015505549,0.000054202377,0.000017952847,0.000008775456,0.00001840409,0.00013565947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998128,0.00015823498,0.00023475398,0.0006258383,0.0004961167,0.00035703793],"domain_scores_gemma":[0.99876124,0.00015914916,0.00013302907,0.00080769334,0.00004033529,0.000098529876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047486436,0.00020997938,0.00018566064,0.00028720056,0.0010933286,0.00031492364,0.0013991724,0.00003382393,0.000045565266],"category_scores_gemma":[0.0000015945383,0.00022734016,0.0000821453,0.0006848853,0.000022946348,0.00023462383,0.00013950182,0.00039030032,0.00001594822],"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.0000267195,0.0003128013,0.000078021156,0.00019579616,0.00005289784,0.000047475078,0.0013931711,0.8679671,0.0003241219,0.0003209676,0.0002798054,0.12900111],"study_design_scores_gemma":[0.00053217093,0.00008907727,0.00027747222,0.000056401856,0.00001957726,0.000008202627,0.00018353948,0.9944251,0.0005293609,0.000056605455,0.003572482,0.00024998662],"about_ca_topic_score_codex":0.00039986073,"about_ca_topic_score_gemma":0.000052555748,"teacher_disagreement_score":0.91699576,"about_ca_system_score_codex":0.00007357017,"about_ca_system_score_gemma":0.00003418566,"threshold_uncertainty_score":0.92706627},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34567368,0.000029698947,0.6517971,0.0010413467,0.00070676114,0.00011731186,0.000013102457,0.00045010707,0.00017087492],"genre_scores_gemma":[0.98663276,0.00006390813,0.012725566,0.00048305714,0.00006655662,0.000006664664,0.000004791787,0.000011313403,0.0000053717727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984816,0.000119474025,0.0002736422,0.0005029243,0.0002516896,0.0003707245],"domain_scores_gemma":[0.9989413,0.00042809907,0.00007030504,0.0004102176,0.000039843897,0.00011021006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040433844,0.00018136868,0.00019082938,0.00033871282,0.0003096292,0.00024348394,0.00031020178,0.000103406506,0.000009032834],"category_scores_gemma":[0.0000028188058,0.0001873521,0.000063832296,0.0016058726,0.000047928297,0.00076181843,0.000021996111,0.00041369637,0.000050941675],"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.0005783753,0.0029749891,0.009462337,0.0031407312,0.0006097019,0.0019356105,0.15458131,0.12631273,0.0038911414,0.34113666,0.001881004,0.3534954],"study_design_scores_gemma":[0.0011664137,0.00019866491,0.007299071,0.00029308477,0.000025252904,0.00016743789,0.0024186329,0.9724875,0.002150147,0.0076764,0.0054059476,0.00071143964],"about_ca_topic_score_codex":0.00023232154,"about_ca_topic_score_gemma":0.0012368498,"teacher_disagreement_score":0.8461748,"about_ca_system_score_codex":0.000018891913,"about_ca_system_score_gemma":0.000034143122,"threshold_uncertainty_score":0.76399964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32677546,0.000041239065,0.67099035,0.00005957336,0.00053798617,0.0002221193,0.000012724722,0.0012875538,0.0000729965],"genre_scores_gemma":[0.99475473,0.00006750772,0.004534876,0.00025844792,0.00009232157,0.000028806886,0.00016521686,0.000074764765,0.000023304818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985981,0.000043354215,0.00040590702,0.00036296307,0.00021612222,0.00037355666],"domain_scores_gemma":[0.9990767,0.00017484532,0.000075520125,0.00027573566,0.00029812197,0.000099025434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013952289,0.00027015968,0.00023993633,0.00037687487,0.0004026164,0.000113155176,0.00019651996,0.00015139894,0.000020516783],"category_scores_gemma":[0.0000016931673,0.00029444628,0.00012821752,0.0020212033,0.000031705702,0.00020963688,0.0000042089964,0.00040761151,0.000102290796],"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.000008870794,0.00002508415,0.000051556002,0.000055039178,0.00011879184,0.000004513861,0.00042078903,0.99266183,0.00068429107,0.000020801084,0.0000711981,0.0058772536],"study_design_scores_gemma":[0.0004050299,0.000018952644,0.0010070964,0.00014217515,0.000048549922,0.0000058334986,0.00083066884,0.99654096,0.00053808524,0.000058082154,0.00012837206,0.00027621942],"about_ca_topic_score_codex":0.00020328687,"about_ca_topic_score_gemma":0.000096016236,"teacher_disagreement_score":0.6679793,"about_ca_system_score_codex":0.000077394194,"about_ca_system_score_gemma":0.000012810566,"threshold_uncertainty_score":0.99995077},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41929176,0.000006427726,0.57996327,0.00014722279,0.0001515828,0.0001680857,0.000011191657,0.00023425433,0.000026211164],"genre_scores_gemma":[0.9811512,0.000009641751,0.018442893,0.00026514404,0.000036723926,0.00002342502,0.000043079595,0.000019283,0.000008614132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981509,0.000116105795,0.00033286557,0.00060591137,0.00037303023,0.00042121127],"domain_scores_gemma":[0.998771,0.0002492873,0.00012759316,0.0007284417,0.000029003055,0.00009466545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000291788,0.00022709873,0.00018723204,0.0004954856,0.0003320975,0.0001901681,0.00088567944,0.000092599534,0.0000148434465],"category_scores_gemma":[0.0000026381515,0.00022836427,0.00006791206,0.0014915698,0.000035181387,0.0010263287,0.000035410943,0.00032012616,0.00009896095],"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.0000766543,0.00031613212,0.003854869,0.00018383186,0.00005643946,0.00003358625,0.009345093,0.9677573,0.0025124196,0.00015121067,0.000028713468,0.015683787],"study_design_scores_gemma":[0.0009166772,0.00009160877,0.028210163,0.0002524648,0.000010788215,0.0000093370345,0.0005214118,0.96475995,0.0046172957,0.000115997835,0.00019507403,0.00029921305],"about_ca_topic_score_codex":0.0002838092,"about_ca_topic_score_gemma":0.0003857369,"teacher_disagreement_score":0.5618594,"about_ca_system_score_codex":0.000059934206,"about_ca_system_score_gemma":0.0000220826,"threshold_uncertainty_score":0.93124247},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2598078,0.0000020703785,0.7391077,0.0001055382,0.00009056234,0.0003373195,0.00009005879,0.00037532707,0.00008361783],"genre_scores_gemma":[0.8260637,0.0000031747643,0.17326695,0.0002977186,0.00005576256,0.00013580995,0.00014709719,0.00002012524,0.000009651046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846405,0.00003757255,0.0003703293,0.000581378,0.0002523068,0.00029438492],"domain_scores_gemma":[0.9986901,0.00015295608,0.00019064557,0.0007338427,0.00013288709,0.00009952821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003463855,0.00017497827,0.00019362553,0.00021792362,0.0003709821,0.00012426828,0.0010569462,0.000071370865,0.0000022853894],"category_scores_gemma":[6.8009217e-7,0.00018952503,0.00007487035,0.0011253245,0.000014647823,0.00042979984,0.000014546696,0.00010609128,0.000025752304],"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.000028364102,0.0009539523,0.00043746686,0.0006761718,0.000111830865,0.0000011117377,0.009699719,0.16920564,0.015578507,0.0013670482,0.000026782354,0.8019134],"study_design_scores_gemma":[0.00035359143,0.00011723641,0.0006081796,0.000050948016,0.00001923368,0.000006323805,0.0018125703,0.9868091,0.009894651,0.00006557547,0.0000818892,0.00018073262],"about_ca_topic_score_codex":0.0005552289,"about_ca_topic_score_gemma":0.00007062969,"teacher_disagreement_score":0.8176034,"about_ca_system_score_codex":0.000028090819,"about_ca_system_score_gemma":0.00003396682,"threshold_uncertainty_score":0.77286065},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28846073,0.000011614107,0.7098488,0.00009221054,0.0006149191,0.00029356705,0.000021957963,0.0005166444,0.00013956314],"genre_scores_gemma":[0.9571228,0.000029164263,0.04248247,0.00022827847,0.00004953849,0.000024494102,0.000017532317,0.000023098486,0.000022604696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976447,0.000108787324,0.0003354107,0.00081008766,0.0004922222,0.0006087901],"domain_scores_gemma":[0.99843204,0.0003028189,0.00016318343,0.00072566397,0.00017494132,0.00020135113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049860246,0.0002897527,0.00025827813,0.0010003701,0.00067413127,0.00033024742,0.00090166053,0.00008985557,0.000012583311],"category_scores_gemma":[0.000001559521,0.0002667402,0.00014938261,0.003897617,0.00004445327,0.00070235267,0.00003281732,0.00051746255,0.00027645615],"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.00034438018,0.002845365,0.0010067761,0.0007969605,0.0004945983,0.00026059605,0.030216824,0.7314288,0.0030821513,0.004690113,0.00009054845,0.22474286],"study_design_scores_gemma":[0.00094071653,0.00033738872,0.004263789,0.00021667263,0.00002240898,0.000019276902,0.0009203509,0.9886958,0.0037747175,0.0000980844,0.00035735758,0.0003534538],"about_ca_topic_score_codex":0.00047905598,"about_ca_topic_score_gemma":0.00042394517,"teacher_disagreement_score":0.6686621,"about_ca_system_score_codex":0.000098629775,"about_ca_system_score_gemma":0.000051728315,"threshold_uncertainty_score":0.9999785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31131828,0.000010497387,0.68645716,0.00010279393,0.0006678229,0.0003738105,0.000015023867,0.00039482614,0.0006597693],"genre_scores_gemma":[0.9967448,0.00000432452,0.0029019369,0.00010315128,0.000092200375,0.000012776132,0.00000934493,0.00002843755,0.00010302966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950759,0.00029143266,0.0011437031,0.00060755236,0.0021092137,0.0007722368],"domain_scores_gemma":[0.9965525,0.0018503391,0.00037480405,0.0006049734,0.00044107236,0.00017628439],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00295028,0.00028580942,0.00044941012,0.0018422778,0.00074365793,0.000606995,0.00094565214,0.00012712022,0.00001968242],"category_scores_gemma":[0.000034366487,0.0002434459,0.000100864774,0.004497803,0.000061081315,0.0014397788,0.000027580938,0.00066332216,0.0011570347],"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.000049627997,0.000030135358,0.00027297245,0.000101500525,0.000019189494,0.00003384308,0.0023640043,0.8339481,0.00009148943,0.000028384291,0.000008162059,0.16305262],"study_design_scores_gemma":[0.00096820336,0.00009567379,0.00303521,0.0005016696,0.000009295578,0.00004832287,0.009673544,0.9829802,0.0019824458,0.00008376901,0.00033021267,0.00029146788],"about_ca_topic_score_codex":0.00031666437,"about_ca_topic_score_gemma":0.0008577079,"teacher_disagreement_score":0.68542653,"about_ca_system_score_codex":0.00033431232,"about_ca_system_score_gemma":0.00010542093,"threshold_uncertainty_score":0.9996207},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103200465,0.000090024616,0.8927507,0.00050016795,0.0019792232,0.00062100164,0.0001587965,0.0006629144,0.000036740665],"genre_scores_gemma":[0.9280196,0.000058263835,0.07123524,0.0003703469,0.00017916538,0.000029163533,0.000078504294,0.00002508616,0.0000046350824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974688,0.00015946243,0.0006630204,0.00082784647,0.0003309208,0.0005499041],"domain_scores_gemma":[0.9976723,0.0010453328,0.00026113752,0.0006824712,0.00022215351,0.00011657788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009134315,0.0002909904,0.00033407452,0.00063904794,0.00061475503,0.0004453531,0.00094063464,0.00019223412,0.000003907343],"category_scores_gemma":[0.000010818708,0.00032154899,0.00016228305,0.0043219756,0.000042563963,0.0006220347,0.00002380839,0.0004936787,0.00006784567],"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.0003075537,0.0015480953,0.0019338557,0.0020580506,0.00033482333,0.00007875232,0.102774635,0.3799394,0.0029820844,0.1061517,0.00019215347,0.4016989],"study_design_scores_gemma":[0.0007233278,0.00013208858,0.0034144511,0.0004299639,0.000021298281,0.0000049564746,0.0020106798,0.97804004,0.004010971,0.009478052,0.0012745474,0.0004596242],"about_ca_topic_score_codex":0.00006382644,"about_ca_topic_score_gemma":0.00046167994,"teacher_disagreement_score":0.82481915,"about_ca_system_score_codex":0.000060028306,"about_ca_system_score_gemma":0.000058078138,"threshold_uncertainty_score":0.99992365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12875551,0.000026121905,0.8647876,0.0032979401,0.00034559643,0.00054432085,0.000017348011,0.0021416554,0.00008392332],"genre_scores_gemma":[0.9337462,0.0000033559727,0.06488968,0.0009100961,0.000052189953,0.00023413361,0.0000074486975,0.000025794785,0.00013109055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980977,0.000045843328,0.00039206445,0.00070215936,0.00022426924,0.0005379293],"domain_scores_gemma":[0.9982476,0.0004232286,0.00013775028,0.0009129587,0.00017997644,0.000098472454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004405892,0.00023176512,0.00024279357,0.00042332956,0.0012289346,0.00021786011,0.00092890987,0.00019063869,0.000008541261],"category_scores_gemma":[0.000003686273,0.00025419745,0.00017380701,0.0017565304,0.000047593236,0.00008013804,0.00001301554,0.0003174646,0.00010677214],"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.000029912317,0.00066546805,0.000053554253,0.00032767202,0.00014878661,0.0000100541,0.0019724218,0.8703202,0.0047092573,0.03133549,0.0002951023,0.0901321],"study_design_scores_gemma":[0.0005688949,0.00009464979,0.00004492892,0.00005347688,0.0000131377965,0.000007276298,0.00010241699,0.98312813,0.010779483,0.0029448,0.0020112982,0.00025152016],"about_ca_topic_score_codex":0.000053154145,"about_ca_topic_score_gemma":0.00015121303,"teacher_disagreement_score":0.8049907,"about_ca_system_score_codex":0.00006476733,"about_ca_system_score_gemma":0.00010325599,"threshold_uncertainty_score":0.999991},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28841525,0.000031681473,0.7080193,0.0002229966,0.0015096824,0.00050528435,0.00001574525,0.0012451137,0.00003489976],"genre_scores_gemma":[0.9856131,0.0000047622243,0.012284368,0.0017364736,0.00013216773,0.000053410287,0.000025942065,0.0000893454,0.000060418733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667686,0.00014668623,0.0006289466,0.0010583024,0.0004951192,0.000994108],"domain_scores_gemma":[0.99755967,0.00090461306,0.00026853348,0.00089716236,0.00015414805,0.00021586994],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008314097,0.0004776799,0.0004467872,0.00043487127,0.0013909104,0.0007060817,0.00077858695,0.00014158056,0.000010117032],"category_scores_gemma":[0.0000014610682,0.00052312977,0.00029916497,0.0014253462,0.00003438051,0.0004140042,0.000019000909,0.00047298844,0.00004965707],"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.000021851753,0.00007949549,0.0000046803707,0.00020559426,0.000051691615,0.000021080863,0.0011026599,0.93279743,0.0047949194,0.000019277746,0.000039610037,0.060861725],"study_design_scores_gemma":[0.0008579194,0.00012127597,0.000044837867,0.00051273836,0.000046278354,0.000028971963,0.0003865415,0.9904499,0.006515576,0.0002121967,0.00028425208,0.000539513],"about_ca_topic_score_codex":0.0001860098,"about_ca_topic_score_gemma":0.00021121789,"teacher_disagreement_score":0.69719785,"about_ca_system_score_codex":0.00022016947,"about_ca_system_score_gemma":0.000084211686,"threshold_uncertainty_score":0.99990916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17160343,0.000059797825,0.8242723,0.000688571,0.0006078983,0.00023483699,0.0000048199217,0.0023480635,0.00018032147],"genre_scores_gemma":[0.992977,0.000014963796,0.0066645537,0.00018403209,0.00004738219,0.000037685862,0.0000030899744,0.000018857116,0.000052408326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982003,0.00009236377,0.00034633756,0.00061827665,0.00021748814,0.00052523095],"domain_scores_gemma":[0.9986747,0.00017398703,0.000109976056,0.000805879,0.000118259384,0.00011721376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003896282,0.00022852537,0.00020780684,0.00059737853,0.0007916037,0.00008630888,0.001122765,0.00019828428,0.0000089050845],"category_scores_gemma":[0.0000010496568,0.0002454714,0.00013858885,0.003145495,0.00006188046,0.00012290724,0.000019116216,0.0003850261,0.0004238784],"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.000036653877,0.0016498489,0.00047987705,0.00040288467,0.00031130566,0.000040309813,0.010703351,0.25195307,0.010738868,0.08086487,0.00046607998,0.6423529],"study_design_scores_gemma":[0.00037282877,0.000050251478,0.00078707526,0.00004920691,0.000014184567,0.00001774708,0.00014267552,0.98278147,0.0063449573,0.008769056,0.0003980904,0.00027248284],"about_ca_topic_score_codex":0.00010371898,"about_ca_topic_score_gemma":0.00022259743,"teacher_disagreement_score":0.8213736,"about_ca_system_score_codex":0.00008380042,"about_ca_system_score_gemma":0.00003894876,"threshold_uncertainty_score":0.99999976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092287794,0.00023177733,0.9045174,0.0005861968,0.0010453666,0.00020092163,0.000019841786,0.0008794758,0.00023123762],"genre_scores_gemma":[0.910868,0.000011278935,0.08857216,0.00028502767,0.0002065786,0.000013287444,0.000018242688,0.000018934174,0.0000065020035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980346,0.000096912234,0.00031582065,0.0007064687,0.0004073719,0.00043883914],"domain_scores_gemma":[0.99855644,0.0004054461,0.00008302229,0.00072592264,0.000102578924,0.00012659356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002875966,0.00024301864,0.00017660017,0.00019597763,0.0006282809,0.00061396195,0.001078256,0.000090556416,0.000024277073],"category_scores_gemma":[0.0000016463837,0.0002225285,0.00012271894,0.001334165,0.00005392365,0.0011434758,0.000027742708,0.0004762302,0.000052380532],"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.00021541418,0.00073975994,0.00677589,0.001375977,0.00060311577,0.00010565828,0.0072178287,0.7597214,0.0035127718,0.08861743,0.00089690054,0.13021785],"study_design_scores_gemma":[0.00027656398,0.00007056029,0.0034113687,0.00027541613,0.00001785156,0.000033307064,0.000086614695,0.9927977,0.0002645756,0.000839206,0.001664031,0.00026282368],"about_ca_topic_score_codex":0.00011214112,"about_ca_topic_score_gemma":0.0001959363,"teacher_disagreement_score":0.8185802,"about_ca_system_score_codex":0.000050162562,"about_ca_system_score_gemma":0.00006349674,"threshold_uncertainty_score":0.9074449},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22227488,0.00032278727,0.769862,0.0002795906,0.0058730985,0.00056465174,2.8750458e-7,0.00068157614,0.00014110222],"genre_scores_gemma":[0.96712637,0.000016494769,0.031251978,0.0005219796,0.0009706323,0.000023090337,0.0000101279475,0.00005743492,0.00002190368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653214,0.0002064221,0.0009270333,0.0010673155,0.00041630305,0.00085078104],"domain_scores_gemma":[0.99805224,0.0011330439,0.00018788199,0.00029001373,0.0001465245,0.00019029752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012584276,0.00045414674,0.00048958434,0.0007446493,0.0010904778,0.00096424867,0.000532581,0.00017087148,0.0000019140587],"category_scores_gemma":[0.0000067768187,0.0004918821,0.00017150864,0.0012892766,0.000035522484,0.0006958421,0.00006518991,0.0010532107,0.000025125104],"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.000013307537,0.00004375432,0.000039554398,0.0007460603,0.000042582804,0.000014206298,0.010807491,0.756003,0.00060041435,0.00011857674,0.000008182586,0.23156284],"study_design_scores_gemma":[0.00068128156,0.00020907226,0.00015798543,0.0013439695,0.000028075665,0.00006435727,0.00045914875,0.99469715,0.0010021401,0.00031401432,0.00054522237,0.0004975638],"about_ca_topic_score_codex":0.00023578579,"about_ca_topic_score_gemma":0.000074773794,"teacher_disagreement_score":0.74485147,"about_ca_system_score_codex":0.0002382627,"about_ca_system_score_gemma":0.00008828667,"threshold_uncertainty_score":0.9997533},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19687974,0.0006385669,0.79967284,0.00043381,0.0010490465,0.00021502453,0.00029897876,0.0006761525,0.00013585085],"genre_scores_gemma":[0.9787172,0.000068791756,0.020568473,0.0004755043,0.000099123325,0.0000042722636,0.00004271849,0.000021262193,0.00000265612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743694,0.00014953768,0.0003818149,0.001141582,0.00044488636,0.00044525316],"domain_scores_gemma":[0.99725205,0.00052100164,0.000072632385,0.0019269717,0.00005373629,0.00017359131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007299281,0.0002974938,0.00025689125,0.0003390746,0.00054320105,0.0009383724,0.0022722676,0.00012635872,0.000048098813],"category_scores_gemma":[0.00000472636,0.00029090059,0.000100147896,0.0011387275,0.00005857316,0.001151942,0.00021703822,0.0005610993,0.000026434944],"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.0003606414,0.0029699253,0.0033439174,0.011656827,0.0019916163,0.00096689374,0.08780506,0.16232942,0.006113508,0.042924363,0.0046180077,0.67491984],"study_design_scores_gemma":[0.00030126565,0.000038430702,0.001214213,0.0003585887,0.000041471416,0.0000326369,0.00012460178,0.9935854,0.00037390753,0.00080367026,0.0028018681,0.0003239615],"about_ca_topic_score_codex":0.00045811269,"about_ca_topic_score_gemma":0.00027631214,"teacher_disagreement_score":0.831256,"about_ca_system_score_codex":0.000033777444,"about_ca_system_score_gemma":0.00005403519,"threshold_uncertainty_score":0.99995434},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009376168,0.00027323025,0.9846881,0.00087908335,0.0019526979,0.0008290554,0.00004080093,0.0019212901,0.00003956233],"genre_scores_gemma":[0.8531566,0.000008224662,0.14545031,0.0008531418,0.00023857664,0.0002259727,0.000007033019,0.000036360387,0.000023770528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978397,0.000056130346,0.0004998966,0.00083922374,0.00029601032,0.0004690528],"domain_scores_gemma":[0.9978074,0.00094599975,0.00009495283,0.0008546301,0.00016404464,0.00013300795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004365816,0.0002915935,0.0002780567,0.00024132681,0.0007237281,0.00054589653,0.00096381217,0.00022242467,0.000010807758],"category_scores_gemma":[0.0000013331739,0.00027138967,0.00029742066,0.0010738904,0.000034264976,0.00039490414,0.000007219161,0.00040691352,0.00014447636],"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.000054305736,0.0006137883,0.00023941552,0.009589357,0.00025370775,0.000009673909,0.0044206134,0.4064354,0.001827772,0.006388622,0.00007340071,0.5700939],"study_design_scores_gemma":[0.00024483947,0.000092009315,0.00007361405,0.0010130957,0.000036503483,0.000010092337,0.00010017416,0.9848043,0.0068269866,0.0019258626,0.0045312042,0.00034131634],"about_ca_topic_score_codex":0.000050653107,"about_ca_topic_score_gemma":0.00003138283,"teacher_disagreement_score":0.84378046,"about_ca_system_score_codex":0.00011968821,"about_ca_system_score_gemma":0.0001462229,"threshold_uncertainty_score":0.99997383},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2386006,0.0005835667,0.7519534,0.0037710376,0.00094453857,0.00018435619,0.0000058248415,0.0036093283,0.0003473249],"genre_scores_gemma":[0.90207064,0.0000691772,0.09748262,0.00023861506,0.000048591915,0.000009223501,0.0000044009457,0.000041729345,0.000034988898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971296,0.00015856221,0.00046367658,0.0011134594,0.00046783598,0.00066685106],"domain_scores_gemma":[0.99656695,0.000731718,0.00011783594,0.0023590506,0.00009579239,0.00012863356],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006115312,0.00038882258,0.00031024768,0.0005174309,0.0012600208,0.0017851015,0.007730184,0.00018885513,0.0000101846745],"category_scores_gemma":[0.00023852197,0.00039214053,0.00010155773,0.001352021,0.00009345123,0.0006962209,0.0026234873,0.0011077578,0.00005770792],"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.00002530592,0.00013609206,0.00017665738,0.0010950963,0.0002744199,0.00018941893,0.004589612,0.4979637,0.0058962204,0.0005411959,0.0005422266,0.48857006],"study_design_scores_gemma":[0.00023065537,0.000066551,0.00009294243,0.0009891782,0.000019272338,0.000040592906,0.00049510994,0.9906424,0.0051059024,0.0010432608,0.0008777975,0.00039631422],"about_ca_topic_score_codex":0.000107638916,"about_ca_topic_score_gemma":0.000029072784,"teacher_disagreement_score":0.66347003,"about_ca_system_score_codex":0.00013904939,"about_ca_system_score_gemma":0.000072536546,"threshold_uncertainty_score":0.9998531},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14842115,0.00046554668,0.8375196,0.00071701495,0.011337472,0.00042674757,0.000005734933,0.0008511744,0.00025559092],"genre_scores_gemma":[0.85490274,0.000015280712,0.14279854,0.00044506098,0.0017579959,0.0000097707,0.0000083235445,0.0000427106,0.00001955824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721056,0.00015788873,0.00058404024,0.0010338995,0.00033846643,0.00067512435],"domain_scores_gemma":[0.997754,0.001335676,0.00012828033,0.00036499673,0.0002085387,0.00020850093],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00071818323,0.00040228196,0.00039127923,0.0004260459,0.00133902,0.0012521275,0.00060863903,0.00016976063,0.0000018403289],"category_scores_gemma":[0.00000399036,0.000415571,0.00017318978,0.0011596016,0.00008040951,0.00064565986,0.000036297813,0.00061081105,0.000029972949],"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.00010353355,0.0002750287,0.000048352984,0.001574215,0.00038002103,0.00006421641,0.02132496,0.12919489,0.0060913945,0.007940773,0.00022794126,0.8327747],"study_design_scores_gemma":[0.00052586064,0.00020804637,0.00008041119,0.00078733335,0.000045631128,0.000076353375,0.00021450911,0.9909441,0.0033827191,0.0009988846,0.0022836744,0.0004524945],"about_ca_topic_score_codex":0.000027500839,"about_ca_topic_score_gemma":0.000010354611,"teacher_disagreement_score":0.8617492,"about_ca_system_score_codex":0.00009043434,"about_ca_system_score_gemma":0.00013167263,"threshold_uncertainty_score":0.9999611},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08761427,0.00015130344,0.9078922,0.0003061203,0.002307037,0.00036143415,0.0000404711,0.0011906934,0.00013644608],"genre_scores_gemma":[0.9957065,0.0000034434765,0.0034565781,0.00023764506,0.000427694,0.000017394448,0.000041574553,0.000042451786,0.0000667423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970743,0.00012718259,0.0005320257,0.0012286908,0.00041734945,0.0006204706],"domain_scores_gemma":[0.9982439,0.00043630195,0.00011561866,0.00091844244,0.00017361942,0.00011207392],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014123021,0.000284343,0.00033536367,0.0002295135,0.0011135496,0.0012218262,0.0020789804,0.0001422985,0.0000037225595],"category_scores_gemma":[0.0000014117442,0.00029129302,0.00022976837,0.0007317995,0.000025543759,0.00085387315,0.00008702301,0.0005728383,0.000024828865],"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.00012749783,0.0002516394,0.00011111815,0.0036547366,0.0011044499,0.00022092028,0.007035216,0.54317456,0.0019371851,0.0097267,0.00017083785,0.43248516],"study_design_scores_gemma":[0.00036014448,0.000061319755,0.00007467736,0.0007142565,0.00008356913,0.000047522033,0.0011808911,0.99665195,0.0003858772,0.000020282883,0.00012038422,0.00029909905],"about_ca_topic_score_codex":0.00041550287,"about_ca_topic_score_gemma":0.00011286016,"teacher_disagreement_score":0.9080922,"about_ca_system_score_codex":0.00015425762,"about_ca_system_score_gemma":0.000088183704,"threshold_uncertainty_score":0.9999539},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3970492,0.00028564967,0.60060394,0.0008333604,0.00031103787,0.0001677656,0.00001533447,0.0005899596,0.00014374388],"genre_scores_gemma":[0.9728355,0.00003359688,0.026354866,0.0006501784,0.000022132674,0.000031355972,0.0000031066565,0.000020884047,0.00004840463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997663,0.00011251347,0.0004938918,0.0009784859,0.00029246867,0.0004596151],"domain_scores_gemma":[0.9984451,0.00050000096,0.00009745936,0.00078112405,0.00009065776,0.000085662345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051011046,0.00030131184,0.000393249,0.0014276919,0.00040663045,0.00028699636,0.0009815079,0.00020823996,0.000026513779],"category_scores_gemma":[0.0000013404903,0.00030708735,0.00026260782,0.0061028283,0.000059885915,0.00028559085,0.000023517267,0.0006068668,0.000075414995],"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.000059810347,0.0013872012,0.0038480414,0.0009065276,0.004058815,0.0003093319,0.096473284,0.4829189,0.0018807825,0.031552944,0.0001909519,0.3764134],"study_design_scores_gemma":[0.00021441621,0.000091846996,0.00073669903,0.00015076414,0.00012845529,0.000023140607,0.001095896,0.99518645,0.001156154,0.00057825743,0.00030623667,0.00033170948],"about_ca_topic_score_codex":0.0005030406,"about_ca_topic_score_gemma":0.001709762,"teacher_disagreement_score":0.5757863,"about_ca_system_score_codex":0.000106422995,"about_ca_system_score_gemma":0.00006569819,"threshold_uncertainty_score":0.99993813},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002758346,0.0019155915,0.9902585,0.00014094175,0.0017061708,0.0011400973,0.000019785539,0.0013371983,0.0007233321],"genre_scores_gemma":[0.98620343,0.00021471149,0.012465247,0.0006281988,0.00015410942,0.00016989725,0.000034779674,0.00011086623,0.000018762057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808115,0.00014980034,0.00063214137,0.0004332764,0.00023897285,0.0004646488],"domain_scores_gemma":[0.99790806,0.0012881889,0.00007356239,0.0005734373,0.00008001783,0.00007671255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058959017,0.0003413646,0.00032495303,0.00042447652,0.00021079884,0.00015618821,0.00035005674,0.00018092418,0.000009382618],"category_scores_gemma":[7.808435e-7,0.00038109545,0.00016073901,0.0014097426,0.000012766942,0.00018679691,0.0000029236905,0.00047210738,0.000056180943],"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.00010398712,0.00003688424,0.00009205551,0.0005809309,0.00013525785,0.0000041224357,0.00038608047,0.941091,0.000012327631,0.00017263865,0.000009577184,0.05737511],"study_design_scores_gemma":[0.00094711134,0.00006269887,0.0011669347,0.0017126346,0.00006979241,0.0000018854928,0.00014889332,0.99346155,0.00003783919,0.00015078452,0.0019108254,0.00032904494],"about_ca_topic_score_codex":0.00004360238,"about_ca_topic_score_gemma":0.0004288806,"teacher_disagreement_score":0.9834451,"about_ca_system_score_codex":0.00021522856,"about_ca_system_score_gemma":0.000012723615,"threshold_uncertainty_score":0.9998641},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27410978,0.00007529162,0.7205579,0.00040795177,0.0027067887,0.00036428057,0.00016018424,0.001071885,0.0005458792],"genre_scores_gemma":[0.9977159,0.0000042514857,0.00060204737,0.00048848207,0.00071827765,0.000018204948,0.00021813143,0.000073585965,0.00016112355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982984,0.000006411312,0.0004398915,0.00055207714,0.00023343696,0.0004697647],"domain_scores_gemma":[0.99932194,0.0001727186,0.00015223988,0.00019838194,0.00013270041,0.000022022776],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00020859351,0.00029492102,0.00026622985,0.0004931447,0.00045370072,0.001066297,0.00035784638,0.000111021895,0.00006742713],"category_scores_gemma":[0.0000065918957,0.00031165735,0.00022084385,0.001065447,0.00005099991,0.0012083508,0.000009924547,0.00030152022,0.00027024985],"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.0009026006,0.0022685518,0.0009724785,0.023120293,0.001954439,0.00031527286,0.0010756152,0.19969262,0.029673731,0.036346212,0.0065194145,0.69715875],"study_design_scores_gemma":[0.0006875429,0.000037960748,0.00031570817,0.0014184264,0.0002016294,0.000017528886,0.00033307562,0.9557002,0.002629083,0.0006945213,0.03737414,0.0005901461],"about_ca_topic_score_codex":0.00029468336,"about_ca_topic_score_gemma":0.00022060762,"teacher_disagreement_score":0.7560076,"about_ca_system_score_codex":0.00009312871,"about_ca_system_score_gemma":0.000025512138,"threshold_uncertainty_score":0.9999707},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3002158,0.0001458026,0.6983505,0.00007988395,0.00044309057,0.00018515081,0.000014124357,0.00055708614,0.00000854491],"genre_scores_gemma":[0.84472847,0.000013382434,0.15506403,0.00010542349,0.000047184316,0.000009333238,0.000015148317,0.000015131636,0.0000018714655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986455,0.00007641911,0.00023316515,0.00059917115,0.00017098332,0.00027479345],"domain_scores_gemma":[0.999341,0.0001727207,0.000058382,0.00024093744,0.00007809328,0.000108854285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032861414,0.00018871005,0.00014418992,0.00022541199,0.0008020957,0.00095424504,0.00030792755,0.00008971759,0.0000036586894],"category_scores_gemma":[0.0000014902844,0.00018899664,0.00008062801,0.0006261014,0.000024943927,0.00053804024,0.000007585375,0.00031854343,0.000008616632],"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.00006902452,0.00055802,0.00014734967,0.0013237739,0.00018159715,0.000020839152,0.019423261,0.51704955,0.013732051,0.021470282,0.00001010443,0.42601416],"study_design_scores_gemma":[0.00036086526,0.00012464002,0.000102925835,0.00023066366,0.000015301543,0.000012414787,0.00021154976,0.9933581,0.0046693156,0.0001948701,0.00050713617,0.0002122212],"about_ca_topic_score_codex":0.000040248837,"about_ca_topic_score_gemma":0.000068330024,"teacher_disagreement_score":0.5445127,"about_ca_system_score_codex":0.00002366991,"about_ca_system_score_gemma":0.000022977987,"threshold_uncertainty_score":0.9201807},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114206955,0.00011613986,0.8811894,0.00036507612,0.002301922,0.00032341073,0.0000027866208,0.0013921986,0.00010208178],"genre_scores_gemma":[0.99343735,0.000008270632,0.0057173013,0.0003275355,0.0003090684,0.000033367643,0.0000016582569,0.000031587995,0.0001338388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982792,0.00013189595,0.00031839835,0.0006368936,0.00024601168,0.0003875695],"domain_scores_gemma":[0.9991469,0.0003684081,0.000098848934,0.00019433587,0.00009738655,0.00009412769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036947828,0.00024284075,0.00018949466,0.0003461413,0.0011292816,0.0006843486,0.0003149829,0.00016018275,0.000013953358],"category_scores_gemma":[0.0000029059224,0.00024167146,0.00019157413,0.0009797767,0.000018896404,0.00016284132,0.0000073987153,0.00071975944,0.000050223367],"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.000027664992,0.000033170287,5.70666e-7,0.0001658262,0.000045187044,0.0000048704005,0.0012831879,0.39664626,0.0049974704,0.00007659794,0.000007672603,0.5967115],"study_design_scores_gemma":[0.00024566276,0.00029996267,0.000006054743,0.00026314703,0.000020136844,0.00006399341,0.00008580452,0.9589961,0.034554858,0.0004251517,0.0047920663,0.00024707528],"about_ca_topic_score_codex":0.00006554404,"about_ca_topic_score_gemma":0.00035903527,"teacher_disagreement_score":0.87923044,"about_ca_system_score_codex":0.00008100771,"about_ca_system_score_gemma":0.000034272165,"threshold_uncertainty_score":0.9855076},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5437464,0.00071084104,0.4300408,0.020843852,0.0011902008,0.00032403404,0.0002463422,0.0012145962,0.0016829259],"genre_scores_gemma":[0.99175835,0.00026908153,0.005762913,0.0016024418,0.00020595234,0.000027877692,0.000008907038,0.00004411053,0.00032037124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970361,0.00007422826,0.0005776981,0.0008319486,0.0011126722,0.00036737203],"domain_scores_gemma":[0.9973696,0.0012513063,0.000103302984,0.00095742574,0.00011980948,0.00019857106],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008922684,0.0002343776,0.00029109817,0.00035892223,0.0004159231,0.0006272734,0.0016863793,0.00022809848,0.0016592535],"category_scores_gemma":[0.00006548713,0.00018642671,0.00009405204,0.0019882084,0.00007270189,0.000404987,0.00011365869,0.0005240398,0.0003578537],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012384394,0.0002964605,0.00050664553,0.0002294445,0.000102916056,0.000029131732,0.00087704306,0.0028739884,0.00021368057,0.0014907337,0.0063104746,0.9870571],"study_design_scores_gemma":[0.000348211,0.000062053114,0.002647153,0.00068372936,0.000058526763,0.000046690715,0.0016737835,0.82179224,0.0012493957,0.0061353254,0.16489148,0.00041138902],"about_ca_topic_score_codex":0.0007632285,"about_ca_topic_score_gemma":0.0018192147,"teacher_disagreement_score":0.9866457,"about_ca_system_score_codex":0.000039032904,"about_ca_system_score_gemma":0.00007247888,"threshold_uncertainty_score":0.9992534},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33623376,0.00018469706,0.66065323,0.00022823783,0.0010820116,0.0002532553,0.0000044730527,0.0010938463,0.00026645916],"genre_scores_gemma":[0.9938228,0.000003905323,0.005723444,0.0001804214,0.00017766807,0.000008757151,0.000004449159,0.000046222125,0.000032330485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967577,0.00018189097,0.0006650602,0.0010388218,0.0005733535,0.0007832044],"domain_scores_gemma":[0.99857855,0.0004775866,0.00015303753,0.0005771824,0.00006832544,0.00014534278],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007278176,0.00041541873,0.00039178538,0.000578567,0.00055549265,0.0012639492,0.0009890744,0.00010127287,0.0000020658736],"category_scores_gemma":[0.0000012875959,0.0003772106,0.00013137124,0.0020166677,0.000041143416,0.00017359966,0.000035829067,0.00071393454,0.000037554524],"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.000007665044,0.00008189556,0.00006427239,0.0005354329,0.00008293165,0.0001827451,0.0034305619,0.93680114,0.000102560865,0.00068106,0.000007073711,0.058022667],"study_design_scores_gemma":[0.00041826494,0.000110350156,0.00022423097,0.003264042,0.000023605537,0.00008984934,0.0019688068,0.99296296,0.0001719839,0.000032552445,0.00028660445,0.00044677558],"about_ca_topic_score_codex":0.00047824098,"about_ca_topic_score_gemma":0.00006998112,"teacher_disagreement_score":0.657589,"about_ca_system_score_codex":0.00026909358,"about_ca_system_score_gemma":0.000051959712,"threshold_uncertainty_score":0.999868},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18017967,0.0003656396,0.8159096,0.00005439444,0.00190475,0.0009547259,0.000016747448,0.00055088295,0.0000635476],"genre_scores_gemma":[0.9630764,0.00004811113,0.03570572,0.000622625,0.00027736957,0.00011427738,0.000027411363,0.00010808662,0.000019956258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975281,0.000108076594,0.00072400965,0.0005835865,0.00024326854,0.00081299135],"domain_scores_gemma":[0.9988019,0.00032512465,0.00009844226,0.0004930319,0.00015590241,0.00012562265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003159041,0.0004902763,0.00059172115,0.0003993692,0.00033618306,0.00016497234,0.00052018673,0.0003583247,0.000011194922],"category_scores_gemma":[0.0000013343958,0.0005421409,0.00020144244,0.0013500807,0.000021667867,0.00016479354,0.000011384898,0.000810223,0.000008334614],"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.00003196813,0.000033027085,0.00003372077,0.00037773317,0.00012337907,0.000010113499,0.00029612708,0.81769305,0.00008020421,0.0000047969243,0.000029778743,0.18128613],"study_design_scores_gemma":[0.0023790349,0.000029672914,0.00042338326,0.0009293938,0.00010835534,0.00001330863,0.00035265012,0.99421114,0.00054208137,0.00008107803,0.00047975357,0.0004501523],"about_ca_topic_score_codex":0.00014437817,"about_ca_topic_score_gemma":0.00067970884,"teacher_disagreement_score":0.78289676,"about_ca_system_score_codex":0.00027010395,"about_ca_system_score_gemma":0.00006158784,"threshold_uncertainty_score":0.999703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044761417,0.0001309536,0.9866519,0.0013421826,0.0024081517,0.00095306773,0.000008331855,0.0017031846,0.0023261034],"genre_scores_gemma":[0.91404474,0.000015215127,0.08464684,0.00096067076,0.0000476227,0.000081975224,0.0000040843383,0.000028003202,0.0001708633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975045,0.00021222272,0.0007138267,0.00074753235,0.00023188027,0.0005900432],"domain_scores_gemma":[0.9980894,0.00046319538,0.00022984628,0.00085557566,0.00024347527,0.00011851574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060114975,0.0003467569,0.0004617947,0.00035303578,0.00096459757,0.00075001287,0.0015318259,0.00017954381,0.0000068185545],"category_scores_gemma":[0.000003287571,0.00034126762,0.00024379087,0.0008183662,0.000013880612,0.0004925676,0.000037941154,0.00027925512,0.000013611235],"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.0004414779,0.0017660706,0.00077379117,0.012905903,0.0024394596,0.00004810769,0.010043052,0.03432705,0.0061192615,0.057748932,0.01434538,0.8590415],"study_design_scores_gemma":[0.0012576075,0.000091560076,0.000062323794,0.0012368242,0.00004255935,0.000021106769,0.00054204394,0.96279556,0.021523584,0.00069075613,0.011306448,0.00042962123],"about_ca_topic_score_codex":0.0002679099,"about_ca_topic_score_gemma":0.000111654306,"teacher_disagreement_score":0.9284685,"about_ca_system_score_codex":0.00022983353,"about_ca_system_score_gemma":0.00008125989,"threshold_uncertainty_score":0.9999039},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07173567,0.0000124723865,0.92484325,0.0008801157,0.00062293775,0.00042070466,0.0003105679,0.0008557517,0.00031851837],"genre_scores_gemma":[0.86133295,0.0000053304684,0.13574347,0.0026235012,0.00006301905,0.00002607114,0.0001586693,0.000024550594,0.000022410806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745876,0.000105438776,0.00050371425,0.0011232675,0.00031403184,0.000494806],"domain_scores_gemma":[0.996721,0.0006820873,0.000209161,0.0021536867,0.00014349993,0.0000905361],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047826694,0.00034530755,0.00033459393,0.00046177115,0.0006264468,0.0004297741,0.0036869247,0.00011257537,0.000006636671],"category_scores_gemma":[0.0000051379857,0.0003668517,0.00009106087,0.0009922154,0.000023702838,0.0007284113,0.00012528303,0.00028960328,0.000016374986],"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.000062167856,0.00045654317,0.0005333491,0.0004897682,0.00033303883,0.00001089498,0.0016515553,0.08386287,0.0010879831,0.0003582234,0.0007423411,0.91041124],"study_design_scores_gemma":[0.00060831074,0.00016708145,0.00014809644,0.0009273637,0.00006191393,0.0000042118695,0.00039028688,0.99040437,0.0057237768,0.0000905715,0.0011414614,0.0003325871],"about_ca_topic_score_codex":0.000787434,"about_ca_topic_score_gemma":0.0014264227,"teacher_disagreement_score":0.9100787,"about_ca_system_score_codex":0.00014370462,"about_ca_system_score_gemma":0.00009064894,"threshold_uncertainty_score":0.99987835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010808008,0.00016498685,0.9867635,0.00020356027,0.0005504135,0.00039649312,0.0000020307882,0.00037351507,0.0007375321],"genre_scores_gemma":[0.76430875,0.000006528707,0.23532923,0.00020919337,0.00002739479,0.000023722087,0.000005587353,0.00001371916,0.000075885815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796575,0.00027762004,0.00052428874,0.000644419,0.00027351195,0.0003143933],"domain_scores_gemma":[0.9990112,0.00019560862,0.00016409016,0.00047342555,0.00008506261,0.00007058646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006177153,0.00023123896,0.00030169313,0.0006088862,0.00030988833,0.00028390627,0.00045416263,0.00013997659,6.1524986e-7],"category_scores_gemma":[0.0000032406433,0.0002484701,0.00005199557,0.0012274305,0.000030581556,0.0003294314,0.0000120869145,0.00032587198,0.000003338802],"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.0000066434513,0.00012846096,0.000043699263,0.00024781466,0.000027032436,0.00000437703,0.0016959561,0.9836165,0.00021533675,0.0001580674,0.000005886954,0.013850276],"study_design_scores_gemma":[0.0005786409,0.000037229205,0.0014585272,0.0005726313,0.0000190072,0.000030479265,0.00060555583,0.9961623,0.00029302383,0.000010663942,0.000027537637,0.0002043989],"about_ca_topic_score_codex":0.0002799334,"about_ca_topic_score_gemma":0.00001250912,"teacher_disagreement_score":0.75350076,"about_ca_system_score_codex":0.0001609136,"about_ca_system_score_gemma":0.00007427312,"threshold_uncertainty_score":0.9999968},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06525272,0.00007195548,0.9319233,0.0007357608,0.0007796421,0.0006817313,0.0000044594453,0.00034532385,0.00020512211],"genre_scores_gemma":[0.9610677,0.000016105803,0.036790665,0.0018535313,0.00008546763,0.000105670115,0.00001399328,0.000020268459,0.000046617904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808174,0.00010615758,0.0004763945,0.0006898699,0.00017864587,0.00046718455],"domain_scores_gemma":[0.99812907,0.00078239746,0.00014702017,0.0005920607,0.00027661494,0.00007281323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027926324,0.00026765146,0.00027311846,0.00040719108,0.00051254284,0.00021911229,0.00074096274,0.00018239977,0.0000010103543],"category_scores_gemma":[0.0000010917986,0.00029489494,0.00011623054,0.0022723048,0.000022560524,0.00023759878,0.000012923378,0.0003390099,0.000007754781],"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.000016266937,0.00015206377,0.00003773425,0.00006457489,0.000027192627,0.0000012560879,0.0006108058,0.9549036,0.00014969891,0.0022929886,0.000010698134,0.041733105],"study_design_scores_gemma":[0.0004860525,0.000031426112,0.00029779115,0.00022175172,0.000021088135,0.0000029736646,0.00031237013,0.99511015,0.002507227,0.00011377795,0.0006555381,0.00023982106],"about_ca_topic_score_codex":0.00035235292,"about_ca_topic_score_gemma":0.0053772344,"teacher_disagreement_score":0.89581496,"about_ca_system_score_codex":0.00013673898,"about_ca_system_score_gemma":0.000055409124,"threshold_uncertainty_score":0.9999503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032973748,0.00014937455,0.9942808,0.00061095756,0.00039439954,0.000569006,0.000024051868,0.00019321822,0.00048080558],"genre_scores_gemma":[0.97107506,0.000016388427,0.027991975,0.0006411863,0.000054711934,0.000034495242,0.000032786393,0.000010714121,0.00014267812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981192,0.00003480365,0.000680515,0.00071429607,0.00013947464,0.00031173436],"domain_scores_gemma":[0.9979931,0.0004989183,0.00033617512,0.0010103622,0.000089862304,0.00007155911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005552865,0.00018728734,0.00027141417,0.00018226092,0.0004714625,0.00022083709,0.0010125302,0.00012408319,0.0000021194678],"category_scores_gemma":[0.0000025240347,0.00017628605,0.000048471084,0.0006612155,0.000023337065,0.00038258816,0.000042600714,0.00032042805,0.000001275359],"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.000031854288,0.00027556202,0.00074771553,0.000757425,0.00009947645,0.000017236058,0.0014235313,0.051014964,0.0001544563,0.0029325734,0.0003253356,0.94221985],"study_design_scores_gemma":[0.0003253179,0.0000186318,0.00016405573,0.00021552492,0.000024280878,0.000008369505,0.00020589767,0.994863,0.00014759794,0.001331023,0.002531591,0.00016474053],"about_ca_topic_score_codex":0.00006219185,"about_ca_topic_score_gemma":0.00012374944,"teacher_disagreement_score":0.96777767,"about_ca_system_score_codex":0.00003218695,"about_ca_system_score_gemma":0.000096051204,"threshold_uncertainty_score":0.7188736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0705464,0.005175784,0.9169715,0.0005242262,0.001769856,0.00081225124,0.000018560164,0.0007107979,0.003470589],"genre_scores_gemma":[0.9955208,0.0002696078,0.0026806663,0.001265272,0.00009018217,0.000046019402,0.0000047227472,0.000040013747,0.00008274933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986894,0.00009790782,0.00042909468,0.00029539384,0.000100786616,0.00038740653],"domain_scores_gemma":[0.9978974,0.0013516401,0.00006386231,0.00048667492,0.00013061069,0.000069831614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036467044,0.00023966683,0.00034462215,0.00016943368,0.00042240476,0.00011597588,0.00030655798,0.00015322179,0.000013351212],"category_scores_gemma":[0.0000022222248,0.00026340058,0.00007139047,0.00047572562,0.000024304147,0.00012201522,0.000004156264,0.0002643575,0.000025417536],"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.00006207948,0.00003643167,0.00023420838,0.0009290836,0.00022842722,6.646231e-7,0.000725784,0.97010005,0.00086468604,0.00068880105,0.000057757512,0.026072053],"study_design_scores_gemma":[0.001213896,0.000047934573,0.000564993,0.0006367775,0.00006592443,0.00000579869,0.00030021736,0.9904139,0.0012819006,0.0007204633,0.0044824854,0.00026571823],"about_ca_topic_score_codex":0.000062505875,"about_ca_topic_score_gemma":0.0002597596,"teacher_disagreement_score":0.9249744,"about_ca_system_score_codex":0.000073071904,"about_ca_system_score_gemma":0.00001532934,"threshold_uncertainty_score":0.9999818},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019721327,0.000032069973,0.97565424,0.0015936847,0.00071146985,0.0009436446,0.000009537516,0.0009191936,0.00041482097],"genre_scores_gemma":[0.8680755,0.000005950918,0.13039348,0.0011424039,0.0000615437,0.00009300928,0.0000078031735,0.000016995973,0.0002033213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985379,0.000096014795,0.0002498762,0.00057736185,0.00027142477,0.00026739558],"domain_scores_gemma":[0.99863493,0.00024944366,0.0000963062,0.0005795362,0.00037397598,0.00006578457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003275931,0.00021514593,0.0001963698,0.00030126335,0.0004927216,0.0002785532,0.0005726559,0.00013157104,0.0000020508755],"category_scores_gemma":[0.0000043272016,0.0001887147,0.00009043281,0.00079205434,0.000027362626,0.00047188424,0.000008398654,0.0002798677,0.000005109792],"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.00034201037,0.000780188,0.00017575276,0.0010144347,0.00015895053,0.000004029984,0.007542824,0.82937264,0.0022953062,0.0102331955,0.00071585516,0.14736484],"study_design_scores_gemma":[0.0007046605,0.00036141794,0.0004199774,0.00040329754,0.000037576116,0.0000053512886,0.00014916663,0.9798019,0.014726449,0.00064071396,0.0025441884,0.00020532009],"about_ca_topic_score_codex":0.00002398436,"about_ca_topic_score_gemma":0.00017998595,"teacher_disagreement_score":0.84835416,"about_ca_system_score_codex":0.00009530471,"about_ca_system_score_gemma":0.00007986515,"threshold_uncertainty_score":0.76955616},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1451917,0.000042161068,0.8343422,0.00035898355,0.017525481,0.00046374404,0.0000029033667,0.00084339373,0.0012294219],"genre_scores_gemma":[0.970701,8.838501e-7,0.02678465,0.00082697504,0.001444142,0.000007521994,0.0000058843602,0.000037901376,0.00019108794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676734,0.0000834703,0.0008488771,0.000995507,0.00037001653,0.00093476207],"domain_scores_gemma":[0.9975593,0.0011023119,0.00029383096,0.00066408643,0.00022395792,0.00015647913],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00063574617,0.00046306712,0.00051746506,0.00063548906,0.0015389504,0.0012771962,0.0014912381,0.00024857462,0.0000019175543],"category_scores_gemma":[0.000015256259,0.0005106593,0.00033474044,0.0014967463,0.000046862613,0.0005892512,0.000058022593,0.00065741,0.00003080933],"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.00009837382,0.0003238558,0.00075879064,0.0003631967,0.0003212568,0.000014777646,0.0046406602,0.098707855,0.0009355464,0.00077978446,0.0008009042,0.892255],"study_design_scores_gemma":[0.0017439922,0.00013651402,0.000118940356,0.00095778005,0.00003997574,0.000015430065,0.00025244625,0.985478,0.005313572,0.00044997843,0.0049317298,0.0005616331],"about_ca_topic_score_codex":0.00004721559,"about_ca_topic_score_gemma":0.0000048610646,"teacher_disagreement_score":0.89169335,"about_ca_system_score_codex":0.00018008113,"about_ca_system_score_gemma":0.00017505902,"threshold_uncertainty_score":0.9997609},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08446588,0.00026349278,0.9028644,0.0095240045,0.00092785724,0.0005460805,0.00008009471,0.0012555458,0.00007263864],"genre_scores_gemma":[0.66307,0.0000071351487,0.3362081,0.0005892528,0.00003658245,0.00001918033,0.000022511404,0.000021521544,0.000025669637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672735,0.00009966761,0.0005909541,0.0014964388,0.000434962,0.0006506105],"domain_scores_gemma":[0.99079216,0.00081593933,0.00024028565,0.007854389,0.00019468059,0.00010256418],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008931732,0.00037799412,0.00040103536,0.00049642904,0.0010862167,0.0005819715,0.021772709,0.00020488164,0.0000048911575],"category_scores_gemma":[0.00036199557,0.00038207075,0.000071386465,0.0010420007,0.00010286178,0.00084626325,0.0075545483,0.00050052267,0.000007110632],"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.00017685525,0.0008146622,0.00022137091,0.0028316178,0.00037926316,0.00002419605,0.001226891,0.19752133,0.005128704,0.00139588,0.006102616,0.7841766],"study_design_scores_gemma":[0.00077124,0.00004804199,0.00022784682,0.0007447501,0.000045080724,0.000012438403,0.00010145684,0.9852881,0.0051164995,0.0068590734,0.0004375135,0.00034794654],"about_ca_topic_score_codex":0.00016020947,"about_ca_topic_score_gemma":0.000056731402,"teacher_disagreement_score":0.78776675,"about_ca_system_score_codex":0.000102610764,"about_ca_system_score_gemma":0.00014475407,"threshold_uncertainty_score":0.99986315},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6291295,0.00010873945,0.36832017,0.00009518709,0.0006697146,0.0004988427,0.0000029738778,0.00021613322,0.00095870974],"genre_scores_gemma":[0.99922353,0.000018050776,0.0004789831,0.0001943163,0.000014595796,0.000033267457,8.1009983e-7,0.000018284905,0.00001819076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987395,0.000072736344,0.00040523152,0.00036099856,0.00013866302,0.00028289322],"domain_scores_gemma":[0.99944556,0.00018439154,0.00003800167,0.00024218144,0.00002810724,0.000061756735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017948828,0.00022861945,0.0002855671,0.00029339205,0.0001878786,0.000102750426,0.00019020253,0.00012023601,0.000008199689],"category_scores_gemma":[0.0000019102265,0.00022143587,0.000044392556,0.0004948125,0.000029790122,0.00023081529,0.0000070284564,0.00041705457,0.000006965572],"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.00010904262,0.0004386389,0.02422769,0.0023004815,0.00034407608,0.000052417105,0.017845865,0.94352543,0.00045439115,0.0008147449,0.00011531617,0.009771881],"study_design_scores_gemma":[0.0027077876,0.00022467862,0.013453917,0.0014669631,0.00010311883,0.000030511555,0.026957626,0.9437409,0.0023220829,0.0061925696,0.001937995,0.0008618509],"about_ca_topic_score_codex":0.00012744214,"about_ca_topic_score_gemma":0.0036923862,"teacher_disagreement_score":0.37009397,"about_ca_system_score_codex":0.00026562746,"about_ca_system_score_gemma":0.000038178325,"threshold_uncertainty_score":0.90298927},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05002928,0.000013887562,0.9455984,0.0007036867,0.0024571428,0.00035247803,0.0000080064465,0.0005536787,0.00028344107],"genre_scores_gemma":[0.9799051,0.000007600269,0.019278403,0.0002503341,0.00008788165,0.000019825544,0.000016211101,0.000014664377,0.00041996987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983945,0.00017065392,0.0004058181,0.00057268346,0.00017724192,0.00027911557],"domain_scores_gemma":[0.9986834,0.0005194422,0.00017360113,0.00035996488,0.00020656062,0.000057057947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000575819,0.00019044081,0.00019118235,0.00026866246,0.00088892964,0.00035875503,0.00042285916,0.00012871821,0.000014792348],"category_scores_gemma":[0.00001173196,0.00020538524,0.0001242779,0.0008151888,0.000013687931,0.0006117794,0.000008484718,0.0003019879,0.000014550361],"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.0003585267,0.000390904,0.0012194519,0.0008615591,0.00019112839,0.0000011961334,0.0031426698,0.5765771,0.009944046,0.0021363343,0.0003213995,0.40485567],"study_design_scores_gemma":[0.00061032176,0.00017001628,0.0014506435,0.00016204617,0.000032173608,0.000001351209,0.0001566386,0.97295576,0.0125086745,0.000452797,0.011260516,0.00023905578],"about_ca_topic_score_codex":0.00014573694,"about_ca_topic_score_gemma":0.00018737899,"teacher_disagreement_score":0.92987585,"about_ca_system_score_codex":0.00016760628,"about_ca_system_score_gemma":0.000053623415,"threshold_uncertainty_score":0.8375367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34796202,0.00003027317,0.65067095,0.000012499043,0.0004632979,0.00010236979,0.0000015129799,0.00015779368,0.0005993239],"genre_scores_gemma":[0.9981935,0.00002964522,0.0016435754,0.00007970835,0.00002450949,0.0000051670986,0.0000034143839,0.000012535711,0.000007960709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993896,0.000025959784,0.00021511283,0.00015447431,0.00006863442,0.00014625161],"domain_scores_gemma":[0.9997927,0.00005015265,0.000022051649,0.00007876411,0.000031243344,0.000025066083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007292156,0.0001151226,0.00011469659,0.0002046848,0.00015187814,0.00004943073,0.000045677287,0.00008715457,0.000010908263],"category_scores_gemma":[4.7990414e-7,0.00013637505,0.000025775973,0.0003804195,0.0000256252,0.00014216678,7.41501e-7,0.00018915728,0.0000037374916],"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.00001374666,0.000013527002,0.000008609038,0.0000916563,0.000013371995,5.815516e-7,0.00033237028,0.78481567,0.02916553,0.0000024502692,2.5848178e-7,0.18554224],"study_design_scores_gemma":[0.000354199,0.000015294707,0.0003200064,0.00012900075,0.000011001196,0.000002503244,0.00009358596,0.8145528,0.18438002,0.000032695647,0.000011458894,0.000097412034],"about_ca_topic_score_codex":0.00005901305,"about_ca_topic_score_gemma":0.00029014185,"teacher_disagreement_score":0.6502315,"about_ca_system_score_codex":0.000070242204,"about_ca_system_score_gemma":0.000006855893,"threshold_uncertainty_score":0.5561213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028580472,0.00012384955,0.9643702,0.004508183,0.0005505521,0.00025945232,0.000011971517,0.0013143203,0.00028101596],"genre_scores_gemma":[0.6973662,0.000033840915,0.30215803,0.00030397344,0.000008084449,0.000024546061,0.0000046026844,0.000015643745,0.000085085616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751437,0.00017646447,0.0004578902,0.0010246863,0.00025755324,0.0005690416],"domain_scores_gemma":[0.9968676,0.0009561787,0.00016863571,0.0017500118,0.0001640943,0.0000934668],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00041886297,0.00032048943,0.00034495443,0.00045079802,0.0012832315,0.0004379032,0.005839645,0.00022940699,0.0000022125782],"category_scores_gemma":[0.00014991207,0.00033492132,0.000096830954,0.001174044,0.00013812204,0.000375963,0.0010335927,0.0006621933,0.0000029727073],"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.0002310202,0.00035889627,0.00014282725,0.000352768,0.00030009027,0.000028222212,0.00062204676,0.09973907,0.005848274,0.0026052601,0.0003985837,0.88937294],"study_design_scores_gemma":[0.0005811597,0.0001878104,0.00039069486,0.0003627159,0.00002535891,0.000017772354,0.00022269676,0.9864853,0.0040955697,0.0071241907,0.00020426701,0.00030245076],"about_ca_topic_score_codex":0.00019665902,"about_ca_topic_score_gemma":0.00027929767,"teacher_disagreement_score":0.8890705,"about_ca_system_score_codex":0.00013769949,"about_ca_system_score_gemma":0.00010821741,"threshold_uncertainty_score":0.9999103},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2302499,0.000036085377,0.76726836,0.00015302433,0.00070790265,0.00091918505,0.000014493581,0.000074945354,0.00057610194],"genre_scores_gemma":[0.9983466,0.0000021800363,0.00045917812,0.00023871867,0.000059622198,0.000085080035,0.0000034402071,0.000019395231,0.00078575074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997866,0.00019662359,0.0006688313,0.00056610606,0.00042877975,0.00027370584],"domain_scores_gemma":[0.99634427,0.0023003232,0.00043905433,0.0006793199,0.00019115386,0.000045895908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001670424,0.00021116057,0.00028910275,0.00027781932,0.0011846079,0.00019859892,0.0006079412,0.00009847573,0.000039643495],"category_scores_gemma":[0.000010604464,0.00015520136,0.00026002186,0.0011621804,0.00010721008,0.00034578016,0.000018626968,0.00032269408,0.00000918887],"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.00036393187,0.00009816513,0.000051974046,0.00004005491,0.00005881302,1.6246123e-7,0.0012108039,0.92243785,0.0019802093,0.0018379834,0.000016505068,0.071903534],"study_design_scores_gemma":[0.0012089111,0.00009072962,0.0010430905,0.00020934133,0.00006440432,0.0000027212463,0.0025508818,0.97832096,0.00972355,0.0035573735,0.003036503,0.00019152938],"about_ca_topic_score_codex":0.00009175795,"about_ca_topic_score_gemma":0.00015074608,"teacher_disagreement_score":0.76809675,"about_ca_system_score_codex":0.00010002098,"about_ca_system_score_gemma":0.000029029896,"threshold_uncertainty_score":0.91111654},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81797236,0.0009906895,0.17936663,0.00008598629,0.00068133965,0.00034362683,0.00012526536,0.00036772242,0.000066368],"genre_scores_gemma":[0.9942566,0.00013333723,0.0054294635,0.000087605746,0.000018332861,0.000009327637,0.000011566694,0.000025967493,0.000027755399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732506,0.00010639784,0.0009884777,0.00078277057,0.00031612022,0.00048117645],"domain_scores_gemma":[0.9981426,0.00055733736,0.00024832226,0.0007789954,0.00017701405,0.000095730175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035011984,0.00048570396,0.0010070478,0.001115859,0.0005771922,0.00010099381,0.00048523687,0.0003714293,0.00008731934],"category_scores_gemma":[0.0000045666584,0.0005265405,0.00040882267,0.0024571538,0.000213226,0.00014904176,0.000064709406,0.00048080954,0.000004868869],"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.00014131065,0.0006832873,0.017144077,0.0028922423,0.0050222385,0.0000042665743,0.004166817,0.9467198,0.004436321,0.000046102665,0.000007078246,0.018736405],"study_design_scores_gemma":[0.00093971967,0.0000542267,0.039638754,0.0006975504,0.0017785276,0.0000026499843,0.0015394784,0.9432659,0.011580592,0.00007585283,0.00006596651,0.00036077824],"about_ca_topic_score_codex":0.00067751703,"about_ca_topic_score_gemma":0.0019321057,"teacher_disagreement_score":0.17628427,"about_ca_system_score_codex":0.00026020352,"about_ca_system_score_gemma":0.000043650314,"threshold_uncertainty_score":0.9997186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028018927,0.00045935385,0.96393484,0.0011417354,0.0039133737,0.0017345931,0.000041027215,0.0005687285,0.0001874181],"genre_scores_gemma":[0.9542161,0.00013223736,0.044513755,0.000553591,0.0002622762,0.00008656553,0.000008697782,0.000033296044,0.00019343292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965189,0.00018931643,0.0009473696,0.0013294275,0.0003720533,0.0006429126],"domain_scores_gemma":[0.9977015,0.0004969707,0.0003939026,0.000788307,0.00045425803,0.00016505309],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008299666,0.00055723777,0.0005667185,0.00062668964,0.0016320279,0.0008073174,0.0006125731,0.0004140745,0.0000073792216],"category_scores_gemma":[0.000003221557,0.0005965135,0.00019252197,0.0012181117,0.000072924566,0.00062147185,0.00003125402,0.0006805878,0.000003485746],"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.000110508736,0.00039288524,0.0002823615,0.003035326,0.0003244626,0.0000013247586,0.0038613898,0.5621724,0.0006178118,0.001431526,0.00008078859,0.4276892],"study_design_scores_gemma":[0.0010432373,0.00026742366,0.0018447979,0.00277514,0.00016615391,0.000029587143,0.00033251746,0.98620015,0.0041998345,0.0022508907,0.0004390871,0.00045116147],"about_ca_topic_score_codex":0.0004085737,"about_ca_topic_score_gemma":0.0008291543,"teacher_disagreement_score":0.92619723,"about_ca_system_score_codex":0.00020423527,"about_ca_system_score_gemma":0.00019416654,"threshold_uncertainty_score":0.9996677},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27985984,0.0005187633,0.71387357,0.0011977623,0.0022276284,0.0016573467,0.000030153642,0.0006063602,0.000028581493],"genre_scores_gemma":[0.985816,0.0001471252,0.012681319,0.0007108429,0.00009510906,0.00040556098,0.000010446216,0.00006217846,0.0000714024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994002,0.00040728593,0.0018547901,0.002040636,0.00042124922,0.0012740432],"domain_scores_gemma":[0.9957559,0.0008983833,0.00077625015,0.0018639615,0.0005221273,0.00018334191],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016694503,0.00080466724,0.0008830496,0.0015805383,0.0019269688,0.00043315475,0.0018977531,0.0009872764,0.000010379751],"category_scores_gemma":[0.00001274047,0.0009886832,0.0003975575,0.00513966,0.00021564159,0.00022612445,0.000039497205,0.0017825647,0.00002777746],"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.00028193806,0.0013541341,0.00009144962,0.0006330583,0.00021508682,0.000004683598,0.0017671549,0.40006396,0.0030539723,0.008629801,0.000014651183,0.58389014],"study_design_scores_gemma":[0.0019410369,0.00030623123,0.0016845613,0.000749628,0.00008369607,0.0000107225,0.0005828584,0.97891873,0.00983285,0.0045022904,0.0006327646,0.0007546127],"about_ca_topic_score_codex":0.00091217656,"about_ca_topic_score_gemma":0.0029461277,"teacher_disagreement_score":0.70595616,"about_ca_system_score_codex":0.0005267265,"about_ca_system_score_gemma":0.00024558548,"threshold_uncertainty_score":0.99937236},"labels":[],"label_agreement":null}]}