{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":141,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":141,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"4419edba72cf","filters":{"venue":"IEEE Transactions on Parallel and Distributed Systems"}},"results":[{"id":"W2165275875","doi":"10.1109/71.980024","title":"Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":871,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada); University of Ottawa","funders":"","keywords":"Computer science; Broadcasting (networking); Computer network; Retransmission; Node (physics); Overhead (engineering); Wireless network; Transmission (telecommunications); Wireless; Algorithm; Distributed computing; Network packet; Telecommunications","authors":[{"name":"Ivan Stojmenović","is_ca":true},{"name":"M. Seddigh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01915252195389812,"gpt":0.2278275419431529,"spread":0.2086750199892548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001380992,0.0009280157,0.000934955,0.001315973,0.0008562107,0.001003345,0.001546925,0.0008904953,0.001064781],"category_scores_gemma":[0.004057874,0.000454968,0.000643188,0.001970206,0.001097076,0.001622239,0.0009758798,0.0009897032,0.000415559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001267636,"about_ca_system_score_gemma":0.0008732416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001668063,"about_ca_topic_score_gemma":0.001534631,"domain_scores_codex":[0.9985454,0.0006181319,0.00007700663,0.000202603,0.0004608164,0.0000960222],"domain_scores_gemma":[0.9984048,0.0009911354,0.0001910938,0.000132618,0.0002215431,0.00005881342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001915239,0.0001175946,0.001007767,0.0007273169,0.000204288,0.000134362,0.0006347637,0.5024277,0.006687006,0.1983455,0.00592226,0.2835999],"study_design_scores_gemma":[0.0001260573,0.0003425378,0.0006242162,0.00009583197,0.00009152482,0.0003683829,0.000192193,0.7871311,0.005629456,0.1753523,0.02998923,0.00005712367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01997414,0.004443207,0.9666889,0.0004504882,0.0002034669,0.0002559781,0.0001291491,0.0004395074,0.007415154],"genre_scores_gemma":[0.3797943,0.006517937,0.6032907,0.0005435481,0.0004064663,0.0008319906,0.0005897678,0.0001424741,0.007882712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001668063,"threshold_uncertainty_score":0.009197414,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108801243","doi":"10.1109/tpds.2008.105","title":"The Design of OpenMP Tasks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":387,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Scalability; Flexibility (engineering); Exploit; Human multitasking; Parallelism (grammar); Key (lock); Computer architecture; Set (abstract data type); Parallel computing; Distributed computing; Programming language; Operating system","authors":[{"name":"Eduard Ayguadé","is_ca":false},{"name":"Nawal Copty","is_ca":false},{"name":"A. Duran","is_ca":false},{"name":"Jay Hoeflinger","is_ca":false},{"name":"Yuan Lin","is_ca":false},{"name":"Federico Massaioli","is_ca":false},{"name":"Xavier Teruel","is_ca":false},{"name":"Priya Unnikrishnan","is_ca":true},{"name":"Guansong Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02456869289260105,"gpt":0.2536215729391721,"spread":0.2290528800465711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003073241,0.0006788196,0.0005155344,0.0004271363,0.001149044,0.002849015,0.003374688,0.001406214,0.003999928],"category_scores_gemma":[0.00713103,0.0009653709,0.0007829238,0.0004523801,0.001331188,0.002976971,0.00280366,0.002494535,0.001917148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008707594,"about_ca_system_score_gemma":0.002000798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009189161,"about_ca_topic_score_gemma":0.0009490973,"domain_scores_codex":[0.9975498,0.0005703911,0.0002837073,0.0003025511,0.001012423,0.0002809772],"domain_scores_gemma":[0.9973595,0.0006539217,0.0002068215,0.000752594,0.0008173682,0.0002097815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007087589,0.0001968276,0.00186921,0.001057531,0.0000803698,0.0004313234,0.001914075,0.1689604,0.02851745,0.6009361,0.02036029,0.1749677],"study_design_scores_gemma":[0.0002043877,0.0003291752,0.0004068011,0.0002054353,0.00006861234,0.0004027963,0.0002489556,0.5708075,0.04266867,0.159368,0.2251959,0.00009376139],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006998421,0.0001322569,0.9837778,0.0001955222,0.000105804,0.0002810779,0.00009932461,0.001643708,0.006766204],"genre_scores_gemma":[0.1663729,0.0004005813,0.8172058,0.000363599,0.00007565705,0.001733192,0.0006115946,0.001238283,0.01199838],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003999928,"threshold_uncertainty_score":0.01625305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3111419317","doi":"10.1109/tpds.2020.3044223","title":"Biscotti: A Blockchain System for Private and Secure Federated Learning","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":334,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer security; Scalability; Peering; Blockchain; XACML; Cryptography; Process (computing); Protocol (science); Trusted Computing; Single point of failure; Computer network; Access control; Database; World Wide Web; The Internet; Operating system","authors":[{"name":"Muhammad Shayan","is_ca":true},{"name":"Clement Fung","is_ca":true},{"name":"Chris J. M. Yoon","is_ca":true},{"name":"Ivan Beschastnikh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02823804456805096,"gpt":0.2428924659464507,"spread":0.2146544213783997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002674746,0.0007333768,0.0008341566,0.001134017,0.001728479,0.001984579,0.002725262,0.001675523,0.01400933],"category_scores_gemma":[0.006919912,0.0006087027,0.0004047895,0.001441682,0.001291725,0.004673481,0.004464102,0.0020678,0.003861674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001381595,"about_ca_system_score_gemma":0.004573771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006341697,"about_ca_topic_score_gemma":0.006048732,"domain_scores_codex":[0.9979868,0.0004979446,0.0001573993,0.0002579999,0.0008236908,0.0002761353],"domain_scores_gemma":[0.9958279,0.0009264442,0.0002969263,0.001748286,0.0006494882,0.0005510626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003645274,0.001217433,0.004995612,0.0008875858,0.0002229125,0.00181539,0.0008364941,0.2956034,0.03311515,0.1865689,0.06932595,0.4017659],"study_design_scores_gemma":[0.0004746259,0.0003063743,0.0005242049,0.00006718357,0.00003115014,0.0003189991,0.00006285442,0.8498311,0.01327771,0.07558531,0.05942781,0.00009267779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04268418,0.0008216268,0.8849807,0.001296452,0.0004630186,0.001506795,0.001890874,0.03978869,0.02656774],"genre_scores_gemma":[0.7446746,0.0008163765,0.2257732,0.0004250805,0.0001312355,0.001225728,0.003902766,0.001058412,0.02199256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01400933,"threshold_uncertainty_score":0.04686588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3178661111","doi":"10.1109/tpds.2021.3096076","title":"Decentralized Edge Intelligence: A Dynamic Resource Allocation Framework for Hierarchical Federated Learning","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":290,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Ministry of Education, India; National Research Foundation Singapore; National Natural Science Foundation of China; Nanyang Technological University; Singapore University of Technology and Design; Ministry of Education - Singapore; National Research Foundation","keywords":"Computer science; Server; Distributed computing; Bottleneck; Resource allocation; Incentive; Edge device; Raw data; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Computer network; Cloud computing","authors":[{"name":"Wei Yang Bryan Lim","is_ca":false},{"name":"Jer Shyuan Ng","is_ca":false},{"name":"Zehui Xiong","is_ca":false},{"name":"Jiangming Jin","is_ca":false},{"name":"Yang Zhang","is_ca":false},{"name":"Dusit Niyato","is_ca":false},{"name":"Cyril Leung","is_ca":true},{"name":"Chunyan Miao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02898207518150444,"gpt":0.2913225440989919,"spread":0.2623404689174875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002414951,0.0006347319,0.0009949764,0.0005332002,0.0007968746,0.001841215,0.002881221,0.001331402,0.003635298],"category_scores_gemma":[0.003140848,0.0003922799,0.00074236,0.0008885188,0.001319324,0.002234381,0.002410695,0.001472016,0.0004750775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001708174,"about_ca_system_score_gemma":0.002382722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005068809,"about_ca_topic_score_gemma":0.005181888,"domain_scores_codex":[0.9987265,0.0004711346,0.00005202119,0.0002513611,0.0002489057,0.0002500213],"domain_scores_gemma":[0.9990859,0.0003806406,0.00009859855,0.0001484472,0.0001556812,0.0001306756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001249311,0.00009306755,0.0003692443,0.00007320871,0.00004245611,0.0001531098,0.0001284464,0.7827828,0.00130133,0.1753848,0.003032283,0.03651441],"study_design_scores_gemma":[0.00001217773,0.00001732865,0.00003492675,0.000005445811,0.000004461219,0.0000170567,0.00001247993,0.9633199,0.000176945,0.03518689,0.001207447,0.000004980714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006329959,0.0002235347,0.9887663,0.0003082067,0.00003428058,0.00006694461,0.00006904266,0.0003581403,0.0038435],"genre_scores_gemma":[0.6733015,0.0004263583,0.3182094,0.0003143033,0.00007767187,0.0003175076,0.0002040626,0.0001136201,0.007035492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005068809,"threshold_uncertainty_score":0.01277167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134238238","doi":"10.1109/tpds.2007.1046","title":"An Energy-Efficient Data Collection Framework for Wireless Sensor Networks by Exploiting Spatiotemporal Correlation","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":283,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Victoria","funders":"Canadian Imperial Bank of Commerce","keywords":"Wireless sensor network; Computer science; Data collection; Real-time computing; Spatial correlation; Workload; Fidelity; Data mining; Partition (number theory); Scheduling (production processes); Computer network; Telecommunications","authors":[{"name":"Chong Liu","is_ca":true},{"name":"Kui Wu","is_ca":true},{"name":"Jian Pei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02562552941176855,"gpt":0.2637777242575365,"spread":0.238152194845768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002372848,0.001090977,0.001249954,0.001234002,0.00104802,0.001091567,0.002175824,0.0006412721,0.0004741091],"category_scores_gemma":[0.003917348,0.0006228687,0.001468785,0.002724172,0.0009961729,0.002305784,0.001884047,0.00126431,0.0001735069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001068388,"about_ca_system_score_gemma":0.002159106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005067265,"about_ca_topic_score_gemma":0.008053473,"domain_scores_codex":[0.9988703,0.0003017334,0.00009394252,0.0002172417,0.0004354817,0.00008132103],"domain_scores_gemma":[0.998641,0.0004599705,0.000191192,0.0003226927,0.000304968,0.00008023072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001522024,0.0002265867,0.002809205,0.0003016704,0.0002145184,0.0003742102,0.0004866917,0.6983322,0.01771653,0.07935055,0.00399078,0.1960449],"study_design_scores_gemma":[0.00001182112,0.00004893003,0.0002890126,0.000007930225,0.00002488539,0.00008830794,0.00002962635,0.9853777,0.002391061,0.009586652,0.002123543,0.00002058781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003198243,0.000148917,0.9960859,0.00007997867,0.00001449716,0.00003835494,0.00003766712,0.0002313558,0.0001650892],"genre_scores_gemma":[0.1369443,0.0005546932,0.8611194,0.00006686836,0.00007125034,0.0002841508,0.0002436551,0.0001038942,0.0006117818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005067265,"threshold_uncertainty_score":0.01254898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963209633","doi":"10.1109/tpds.2019.2900238","title":"Auction Mechanisms in Cloud/Fog Computing Resource Allocation for Public Blockchain Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":239,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Bidding; Proof-of-work system; Block (permutation group theory); Blockchain; Resource management (computing); Computational complexity theory; Resource allocation; Combinatorial auction; Heuristic","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01412280848616063,"gpt":0.2230310539587892,"spread":0.2089082454726286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002792476,0.0006808846,0.001256029,0.0007080865,0.001250828,0.002651847,0.002696918,0.001452218,0.004309044],"category_scores_gemma":[0.006037456,0.0004828787,0.0008053799,0.00132092,0.001598349,0.003712773,0.001820161,0.001248397,0.0004204008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00296162,"about_ca_system_score_gemma":0.003000531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005966078,"about_ca_topic_score_gemma":0.00463223,"domain_scores_codex":[0.9982799,0.0006006685,0.00008618455,0.0002829443,0.0003858607,0.0003645206],"domain_scores_gemma":[0.9981585,0.0009443274,0.0002289136,0.0002452985,0.0002326088,0.0001902405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001923409,0.0001318413,0.0003930454,0.0001642124,0.00004902016,0.0003076904,0.0001872862,0.6509755,0.002270058,0.3149174,0.002968106,0.02744343],"study_design_scores_gemma":[0.00003762202,0.00002062644,0.00006236086,0.00001417576,0.000008996992,0.00003905786,0.00003520138,0.9274382,0.0003591631,0.07023105,0.001742706,0.0000109278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05337751,0.0009702516,0.9306697,0.0007218375,0.0001090444,0.0003126206,0.0001606131,0.0003198223,0.01335862],"genre_scores_gemma":[0.9009635,0.0006362043,0.09251349,0.0001291225,0.000059475,0.000248524,0.00009757654,0.00006267105,0.005289393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005966078,"threshold_uncertainty_score":0.02148819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158909754","doi":"10.1109/tpds.2006.77","title":"Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":237,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Scheduling (production processes); Distributed computing; Real-time computing; Key distribution in wireless sensor networks; Computer network; Wireless network; Wireless; Telecommunications; Engineering","authors":[{"name":"Changyuan Liu","is_ca":true},{"name":"Kui Wu","is_ca":true},{"name":"Yang Xiao","is_ca":false},{"name":"Bo Sun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01225144969953179,"gpt":0.2049849922278547,"spread":0.1927335425283229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368526,0.0009187926,0.000979117,0.0007127377,0.000529399,0.0007490173,0.001458774,0.0006810711,0.0009883285],"category_scores_gemma":[0.009033199,0.0004758838,0.0005667947,0.001044537,0.00085059,0.001559341,0.001163678,0.0007031166,0.0002861761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007814625,"about_ca_system_score_gemma":0.001163085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001145776,"about_ca_topic_score_gemma":0.001265939,"domain_scores_codex":[0.9980643,0.0007881754,0.00008577559,0.0003105874,0.000613377,0.0001377695],"domain_scores_gemma":[0.9963772,0.001857405,0.0005395838,0.0006433459,0.0003810826,0.0002014792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002588995,0.0001240363,0.0008442656,0.0001491269,0.00007582737,0.0001268776,0.0001560075,0.8220238,0.009485778,0.04215588,0.001985047,0.1226145],"study_design_scores_gemma":[0.00003492647,0.0001087958,0.0001254458,0.000006167564,0.00001602488,0.00006836595,0.00001206434,0.986357,0.001381503,0.01068851,0.001190079,0.00001116984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006402413,0.000239611,0.9924043,0.00007471895,0.00003029855,0.00003557315,0.00001369701,0.0002433772,0.0005559918],"genre_scores_gemma":[0.6781112,0.0005116267,0.3189353,0.0001061995,0.0002240576,0.0002677057,0.0001152595,0.0001760343,0.001552571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002368526,"threshold_uncertainty_score":0.01252609,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153410375","doi":"10.1109/tpds.2003.1239871","title":"Localized Delaunay triangulation with application in ad hoc wireless networks","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":230,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delaunay triangulation; Computer science; Unit disk graph; Wireless ad hoc network; Spanner; Computer network; Topology (electrical circuits); Wireless network; Distributed computing; Algorithm; Mathematics; Wireless; Combinatorics; Telecommunications","authors":[{"name":"Xiangyang Li","is_ca":false},{"name":"Gruiă Cälinescu","is_ca":false},{"name":"Peng‐Jun Wan","is_ca":false},{"name":"Yu Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009531872383462547,"gpt":0.2165016350579502,"spread":0.2069697626744876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006945888,0.0008176149,0.0008469599,0.001158477,0.0008825866,0.0006692969,0.001304724,0.001250616,0.002508675],"category_scores_gemma":[0.003204321,0.0004622113,0.0006765398,0.003459803,0.0008099137,0.001201188,0.001755693,0.00114291,0.001074777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005059398,"about_ca_system_score_gemma":0.0005098121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00158843,"about_ca_topic_score_gemma":0.001248657,"domain_scores_codex":[0.9989961,0.0003346171,0.00005720874,0.0001422765,0.0004218145,0.00004809591],"domain_scores_gemma":[0.9988249,0.0005442994,0.0001374124,0.0001569489,0.0002876545,0.00004877869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001109559,0.00008328333,0.001698732,0.001146441,0.00008305799,0.0005791963,0.000543015,0.3282289,0.01667605,0.04890072,0.008849205,0.5931005],"study_design_scores_gemma":[0.00003332702,0.0001662102,0.0004720965,0.000115151,0.00004282001,0.0006342244,0.0002048826,0.8970006,0.007860844,0.04407695,0.04934466,0.00004822149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003917077,0.003010159,0.9891095,0.0001879294,0.0001501613,0.0001083945,0.00002498433,0.0006542057,0.002837591],"genre_scores_gemma":[0.1899756,0.007265182,0.7984392,0.000230792,0.0002431492,0.0004420167,0.0001600083,0.0001526484,0.003091515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002508675,"threshold_uncertainty_score":0.008392334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016888570","doi":"10.1109/tpds.2010.62","title":"hiCUDA: High-Level GPGPU Programming","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":219,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CUDA; Computer science; Porting; Compiler; General-purpose computing on graphics processing units; Parallel computing; Programmer; Graphics; Software portability; Code (set theory); Operating system; Programming language; Software","authors":[{"name":"Tianyi David Han","is_ca":true},{"name":"Tarek S. Abdelrahman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02100504174156377,"gpt":0.2438634565018963,"spread":0.2228584147603326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009055604,0.0008282721,0.0006297514,0.0006198454,0.0005712945,0.001416582,0.002764957,0.0009369865,0.006661736],"category_scores_gemma":[0.002640106,0.0006671196,0.0007310023,0.0008831368,0.000796122,0.001236858,0.00144484,0.001979092,0.00355763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004566775,"about_ca_system_score_gemma":0.001298705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002544265,"about_ca_topic_score_gemma":0.00239151,"domain_scores_codex":[0.9993837,0.0001478301,0.00005203457,0.0001094581,0.0002114043,0.00009563542],"domain_scores_gemma":[0.9990138,0.0002955976,0.00008338876,0.0002560562,0.0002753844,0.0000758167],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001043398,0.0003267907,0.004460464,0.001063499,0.0001957373,0.0008503592,0.001065605,0.1022851,0.04707252,0.08340506,0.2106248,0.5476068],"study_design_scores_gemma":[0.0003077438,0.0002533733,0.001942665,0.0001138241,0.00005710937,0.0005671963,0.00008547399,0.6834759,0.0790503,0.02939094,0.2046261,0.000129435],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.007709516,0.0002043727,0.9230155,0.0001060612,0.00007205953,0.0001405233,0.0005793137,0.06167743,0.006495206],"genre_scores_gemma":[0.09467957,0.000352485,0.8824304,0.0003539878,0.00006892813,0.0006515844,0.002749592,0.01066716,0.008046381],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.006661736,"threshold_uncertainty_score":0.02228576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4205597275","doi":"10.1109/tpds.2021.3134647","title":"AUCTION: Automated and Quality-Aware Client Selection Framework for Efficient Federated Learning","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Young Elite Scientists Sponsorship Program by Tianjin; National Key Research and Development Program of China; Higher Education Discipline Innovation Project; Natural Science Foundation of Hainan Province; National Natural Science Foundation of China","keywords":"Computer science; Quality (philosophy); Artificial intelligence; Selection (genetic algorithm); Task (project management); Information retrieval; Machine learning","authors":[{"name":"Yongheng Deng","is_ca":false},{"name":"Feng Lyu","is_ca":false},{"name":"Ju Ren","is_ca":false},{"name":"Huaqing Wu","is_ca":true},{"name":"Yuezhi Zhou","is_ca":false},{"name":"Yaoxue Zhang","is_ca":false},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04055274412034599,"gpt":0.3061016620335053,"spread":0.2655489179131593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00561981,0.0009010302,0.001607096,0.001299845,0.001198378,0.003524133,0.005197113,0.001699318,0.004316077],"category_scores_gemma":[0.007283394,0.0006187261,0.001215912,0.001316873,0.0009716164,0.004348685,0.004062774,0.001924474,0.001315203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002257361,"about_ca_system_score_gemma":0.004364808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009330257,"about_ca_topic_score_gemma":0.009020949,"domain_scores_codex":[0.9966485,0.001014324,0.0002580326,0.0005837223,0.0009282349,0.0005671838],"domain_scores_gemma":[0.9967709,0.0009132252,0.0002665996,0.0008987866,0.0006623174,0.0004881858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001713307,0.001099419,0.004053837,0.0002576596,0.0002304708,0.0004796009,0.0002738232,0.4265592,0.008262413,0.07012434,0.03152249,0.4554235],"study_design_scores_gemma":[0.00005883181,0.00003871941,0.0001636959,0.000007373861,0.00001221845,0.00004774725,0.00002274461,0.9826099,0.001449884,0.01356725,0.002002202,0.00001931954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01224756,0.0002818823,0.9721797,0.0003429498,0.00006407418,0.0002275458,0.0001751185,0.01288189,0.00159935],"genre_scores_gemma":[0.5246106,0.0002767903,0.4685027,0.0002553517,0.00008628586,0.000306023,0.0007813703,0.0005052089,0.004675613],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009330257,"threshold_uncertainty_score":0.02972072,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2339254261","doi":"10.1109/tpds.2016.2556668","title":"Workflow Scheduling in Multi-Tenant Cloud Computing Environments","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":178,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Computer science; Cloud computing; Workflow; Distributed computing; Scalability; Workflow management system; Scheduling (production processes); Workflow engine; Workflow technology; Multitenancy; Software as a service; Database; Operating system; Software","authors":[{"name":"Bhaskar Prasad Rimal","is_ca":true},{"name":"Martin Maier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02326583046353894,"gpt":0.2353666207515935,"spread":0.2121007902880545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001949266,0.0008099252,0.001073989,0.0005075093,0.001478091,0.001460841,0.001359783,0.0007346789,0.0007035694],"category_scores_gemma":[0.002305659,0.0004535749,0.0007481559,0.001176844,0.0005900872,0.001273175,0.0009571521,0.0009019735,0.0001747826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001269767,"about_ca_system_score_gemma":0.002410227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009375183,"about_ca_topic_score_gemma":0.006773764,"domain_scores_codex":[0.9985971,0.000457024,0.0001088174,0.0002973264,0.0002640393,0.0002757709],"domain_scores_gemma":[0.9987094,0.000482616,0.0002156105,0.0001305542,0.0001880483,0.0002737295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003460236,0.0001243887,0.001144186,0.0001184881,0.00005769536,0.0004999821,0.0001350229,0.9508784,0.008324652,0.008976287,0.001204405,0.02819034],"study_design_scores_gemma":[0.0000139993,0.00003126338,0.0001869477,0.000003304731,0.000006558761,0.00004029021,0.00002863381,0.9952942,0.001004599,0.002786227,0.0005980064,0.000006073996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1704304,0.001071368,0.8234496,0.000516688,0.0002532176,0.0002165688,0.0001479833,0.0008193717,0.003094725],"genre_scores_gemma":[0.8427521,0.0006009138,0.1550079,0.00009667618,0.0000667183,0.00009370757,0.0001450436,0.00008137147,0.001155564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009375183,"threshold_uncertainty_score":0.01864123,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158923830","doi":"10.1109/tpds.2006.54","title":"Performance of a beacon enabled IEEE 802.15.4 cluster with downlink and uplink traffic","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Telecommunications link; Computer network; Computer science; Network packet; Queue; Beacon; Real-time computing","authors":[{"name":"S. Shafi","is_ca":true},{"name":"Vojislav B. Mišić","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009043354440059527,"gpt":0.2059237537876299,"spread":0.1968803993475704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00190403,0.0007086861,0.0007942792,0.0007545588,0.0008865188,0.0008332601,0.001153607,0.0008895997,0.0008216113],"category_scores_gemma":[0.00494715,0.0003310081,0.000318687,0.0008655302,0.00129693,0.0008473158,0.0009389498,0.0006877194,0.000131588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002081723,"about_ca_system_score_gemma":0.001475411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01734161,"about_ca_topic_score_gemma":0.005936152,"domain_scores_codex":[0.9989737,0.0002160886,0.00005507898,0.0001639192,0.0002391703,0.0003520772],"domain_scores_gemma":[0.9959645,0.001978193,0.0003674426,0.000266861,0.001016307,0.0004065819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002197093,0.0002677903,0.009368889,0.00007235813,0.00006355981,0.0001832892,0.0001977087,0.9553716,0.019655,0.002400014,0.000707274,0.00951537],"study_design_scores_gemma":[0.0000479255,0.0004611672,0.002659519,0.000005792378,0.00002767443,0.00004226967,0.00006808126,0.9896665,0.006480117,0.0004256353,0.00009400349,0.00002137138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9927201,0.00008787256,0.005523762,0.0001044312,0.00002080564,0.0000183865,0.00005390843,0.0002403568,0.001230395],"genre_scores_gemma":[0.9988998,0.00003179412,0.000684163,0.00001747481,0.000003470357,0.00000683502,0.00004474749,0.000009515596,0.00030218],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01734161,"threshold_uncertainty_score":0.03448135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987354455","doi":"10.1109/tpds.2014.2362139","title":"Multi-Resource Fair Allocation in Heterogeneous Cloud Computing Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Cloud computing; Distributed computing; Resource allocation; Resource management (computing); Resource (disambiguation); Heuristic; Computer network; Operating system","authors":[{"name":"Ben Liang","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01730674927728486,"gpt":0.2306612655797047,"spread":0.2133545163024198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003445676,0.0006320637,0.0009948385,0.0006102892,0.001300574,0.001713527,0.00159167,0.0006773362,0.0009758143],"category_scores_gemma":[0.005320965,0.000390513,0.000465548,0.0008772116,0.00133059,0.002008314,0.001291891,0.000707247,0.0001454272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001953332,"about_ca_system_score_gemma":0.001529021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006717397,"about_ca_topic_score_gemma":0.004226834,"domain_scores_codex":[0.9980447,0.0007789561,0.00007471201,0.0002751821,0.0003919733,0.0004343684],"domain_scores_gemma":[0.9975836,0.001393771,0.0002764263,0.0002523074,0.0002328656,0.0002611016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001169075,0.00005832049,0.0007158512,0.00003609169,0.00003422412,0.0001576683,0.00005803631,0.9667524,0.002016782,0.02153082,0.0003820971,0.008140873],"study_design_scores_gemma":[0.00001201993,0.00001596821,0.000122885,0.000001775581,0.000006176941,0.00001298063,0.00001790699,0.9927042,0.0004365798,0.006396812,0.0002684202,0.00000437189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1967872,0.0007600688,0.7968125,0.0004234469,0.0001092599,0.0001268043,0.00005540363,0.0002030647,0.004722236],"genre_scores_gemma":[0.9637607,0.0001458202,0.0350246,0.00005844711,0.00003592217,0.00004387107,0.00002162335,0.00002909807,0.0008798091],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006717397,"threshold_uncertainty_score":0.01822269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979014233","doi":"10.1109/tpds.2013.40","title":"Time Synchronization Based on Slow-Flooding in Wireless Sensor Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Fondation Pour La Conservation Du Saumon Atlantique","keywords":"Flooding (psychology); Computer science; Wireless sensor network; Scalability; Testbed; Real-time computing; Synchronization (alternating current); Clock synchronization; Computer network; Node (physics); Context (archaeology); Clock drift; Propagation delay; Distributed computing; Channel (broadcasting); Engineering","authors":[{"name":"Kasım Sinan Yıldırım","is_ca":false},{"name":"Aylin Kantarcı","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007816026875732922,"gpt":0.196552661262533,"spread":0.1887366343868001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410239,0.000558654,0.0005927664,0.0008827876,0.0006856089,0.0005539683,0.0008548631,0.0005576379,0.000462827],"category_scores_gemma":[0.005571465,0.0003130644,0.0003611582,0.00100343,0.0008395251,0.001782848,0.001387706,0.0005921983,0.0001179005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006417561,"about_ca_system_score_gemma":0.000786704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002027278,"about_ca_topic_score_gemma":0.001023689,"domain_scores_codex":[0.9989591,0.0003443193,0.00008368971,0.0001584893,0.0003819866,0.00007239157],"domain_scores_gemma":[0.9980258,0.0009381271,0.0003900466,0.0002494704,0.0003380224,0.00005867381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005171989,0.00008735334,0.003906579,0.0008895251,0.0001267256,0.0005747676,0.0009624996,0.6507499,0.1112051,0.06658989,0.002464871,0.1619257],"study_design_scores_gemma":[0.00005047366,0.0002832265,0.001141765,0.00003656001,0.00005416608,0.000286028,0.0001124309,0.9509709,0.02132018,0.02022108,0.005473978,0.00004911586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0818218,0.002198913,0.9119343,0.0003231031,0.0001303856,0.0001773164,0.00007403317,0.000927353,0.002412805],"genre_scores_gemma":[0.8994358,0.001456862,0.09763026,0.00008415544,0.00008398578,0.0002095523,0.0001213167,0.00007151408,0.0009065112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002027278,"threshold_uncertainty_score":0.00745821,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996124278","doi":"10.1109/tpds.2011.302","title":"A Cloud-Based Scheme for Protecting Source-Location Privacy against Hotspot-Locating Attack in Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hotspot (geology); Computer network; Network packet; Cloud computing; Adversary; Wireless sensor network; Adversary model; Computer security","authors":[{"name":"Mohamed Mahmoud","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04459131439947693,"gpt":0.2509897226617607,"spread":0.2063984082622837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001556344,0.0007034329,0.001254352,0.0009622263,0.001973061,0.001160959,0.002353963,0.001252044,0.0008089076],"category_scores_gemma":[0.003229848,0.0002726138,0.0007886273,0.001614682,0.001019922,0.003459864,0.0032636,0.001054481,0.0002800753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001334376,"about_ca_system_score_gemma":0.001447248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001563483,"about_ca_topic_score_gemma":0.001268943,"domain_scores_codex":[0.9984686,0.000392739,0.0001057731,0.000261502,0.0004715336,0.0002997307],"domain_scores_gemma":[0.9967299,0.000701614,0.0005691896,0.001296992,0.0004681312,0.0002343062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00219563,0.0004398511,0.00500815,0.0005153039,0.0004151395,0.001179685,0.0009995317,0.4127831,0.1093456,0.1666945,0.008557856,0.2918655],"study_design_scores_gemma":[0.00007632184,0.00023427,0.0006811892,0.00002719235,0.00009337861,0.0006854132,0.0001051096,0.9495502,0.02494244,0.01785238,0.005692043,0.00006012187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05507568,0.0008998745,0.9408188,0.0004134379,0.0001620464,0.0001701469,0.0001080844,0.0005091361,0.001842711],"genre_scores_gemma":[0.9194709,0.0004252591,0.0786879,0.000145736,0.00007404434,0.00009300537,0.00008958982,0.00002653414,0.0009869181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002353963,"threshold_uncertainty_score":0.009681582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010302109","doi":"10.1109/tpds.2014.2380373","title":"Secure and Verifiable Policy Update Outsourcing for Big Data Access Control in the Cloud","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Research Grants Council, University Grants Committee; National Science Foundation","keywords":"Computer science; Cloud computing; Access control; Encryption; Outsourcing; Overhead (engineering); Big data; Computer security; Data access; Construct (python library); Volume (thermodynamics); Database; Computer network; Distributed computing; Data mining; Operating system","authors":[{"name":"Kan Yang","is_ca":true},{"name":"Xiaohua Jia","is_ca":false},{"name":"Kui Ren","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04324047064942231,"gpt":0.2792164425248126,"spread":0.2359759718753903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002722373,0.0004140453,0.001047587,0.0005381831,0.001418399,0.002338648,0.001355299,0.0008207049,0.001242291],"category_scores_gemma":[0.006435687,0.0003581923,0.0007039855,0.0009389544,0.001783174,0.004459925,0.002619354,0.001893847,0.0003764254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001934461,"about_ca_system_score_gemma":0.003599707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002631814,"about_ca_topic_score_gemma":0.001628689,"domain_scores_codex":[0.9945887,0.001150403,0.0003981121,0.0006560711,0.002401747,0.0008049567],"domain_scores_gemma":[0.993658,0.001363903,0.0008068972,0.002965941,0.0008337563,0.0003714506],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002081938,0.0007058939,0.005307444,0.0003495566,0.0001794415,0.001461927,0.001372657,0.1682672,0.06474643,0.4630879,0.008919095,0.2835206],"study_design_scores_gemma":[0.0001088454,0.0001250904,0.0008084301,0.00003056761,0.00004748875,0.0004501583,0.0001580987,0.8885769,0.03136373,0.0719734,0.006296277,0.0000609638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07404338,0.000654584,0.9182714,0.0008329296,0.0001717708,0.0002959332,0.0001226633,0.001116112,0.004491193],"genre_scores_gemma":[0.940041,0.0002733913,0.05742071,0.0001360792,0.0000831883,0.00009013374,0.00008190913,0.00004708825,0.001826657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002722373,"threshold_uncertainty_score":0.01439744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035694933","doi":"10.1109/tpds.2013.69","title":"Temporal Load Balancing with Service Delay Guarantees for Data Center Energy Cost Optimization","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Workload; Data center; Cloud computing; Server; Schedule; Exploit; Queue; Operations research; Computer network; Computer security; Operating system; Engineering","authors":[{"name":"Jianying Luo","is_ca":false},{"name":"Lei Rao","is_ca":false},{"name":"Xue Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0206778136108569,"gpt":0.2250437962477674,"spread":0.2043659826369105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001434226,0.00104046,0.0008689256,0.00062429,0.0005600349,0.001081982,0.001323902,0.0005338798,0.00224953],"category_scores_gemma":[0.003442672,0.0003341403,0.0003104151,0.001010616,0.0003936955,0.001000849,0.0006754086,0.0008159346,0.0002590535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001798027,"about_ca_system_score_gemma":0.00224028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003949655,"about_ca_topic_score_gemma":0.004608251,"domain_scores_codex":[0.9992371,0.0001799908,0.00003563786,0.0001203527,0.0002749869,0.0001519497],"domain_scores_gemma":[0.9989242,0.0005782663,0.0001614441,0.00006013408,0.0002024057,0.00007351155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001858406,0.0000980929,0.0004041332,0.00006916951,0.0000235129,0.00002661778,0.00003172576,0.9477147,0.004255862,0.009131948,0.001260759,0.03679761],"study_design_scores_gemma":[0.000006962997,0.00001814105,0.00004730148,0.000001368157,0.00000288997,0.000004816719,0.000003467355,0.9979673,0.000371641,0.001385713,0.0001885129,0.000001844379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03022281,0.0004453803,0.9649523,0.0002972817,0.00006988067,0.0001014358,0.00008854965,0.0004078388,0.003414558],"genre_scores_gemma":[0.9057671,0.0002536734,0.09172057,0.0001153752,0.00009134526,0.0001226499,0.00009978184,0.0001023039,0.001727179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003949655,"threshold_uncertainty_score":0.01304573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077573477","doi":"10.1109/tpds.2012.337","title":"Enabling Dynamic Data and Indirect Mutual Trust for Cloud Computing Storage Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cloud computing; Outsourcing; Server; Cloud storage; Block (permutation group theory); File server; Service provider; Scheme (mathematics); Computer network; Computer security; Database; Distributed computing; Service (business); Operating system","authors":[{"name":"Ayad Barsoum","is_ca":true},{"name":"Anwar Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04211926559478843,"gpt":0.2794365580260815,"spread":0.2373172924312931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003509764,0.0004913679,0.000926113,0.0006410889,0.002585124,0.003577091,0.002142821,0.001353008,0.002301492],"category_scores_gemma":[0.01099918,0.0005755543,0.0006528694,0.001250177,0.002594966,0.009234997,0.008309092,0.002075173,0.000629966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002734426,"about_ca_system_score_gemma":0.003398543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002680652,"about_ca_topic_score_gemma":0.002709817,"domain_scores_codex":[0.9940894,0.001638288,0.0005232702,0.0004902698,0.002314969,0.00094379],"domain_scores_gemma":[0.989628,0.002914299,0.001121445,0.004237242,0.001502411,0.0005966583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001375898,0.000288057,0.003942502,0.0005256023,0.0001488203,0.001151577,0.002223295,0.1524881,0.04269554,0.6422364,0.009037121,0.1438873],"study_design_scores_gemma":[0.0001522327,0.0002063784,0.0007309073,0.00005802664,0.00007175536,0.0006837448,0.0003994906,0.7967336,0.02414552,0.1564564,0.02024334,0.0001185998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09446979,0.001057122,0.8898261,0.002040873,0.0001541666,0.0003337528,0.0001362018,0.0009001467,0.01108179],"genre_scores_gemma":[0.9369997,0.0003048848,0.06017424,0.0001001172,0.00007890793,0.0001146565,0.0000628965,0.00005224208,0.002112389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003577091,"threshold_uncertainty_score":0.0198397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116199450","doi":"10.1109/tpds.2012.308","title":"Anchor: A Versatile and Efficient Framework for Resource Management in the Cloud","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Distributed computing; Cloud computing; Resource management (computing); Matching (statistics); Workload; Virtualization; Resource (disambiguation); Virtual machine; Architecture; Node (physics); Resource allocation; Set (abstract data type); Convergence (economics); Computer network; Operating system","authors":[{"name":"Hong Xu","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02000915578914977,"gpt":0.2494322021557667,"spread":0.2294230463666169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024315,0.00078832,0.0009846461,0.001040095,0.001072292,0.002889435,0.003549369,0.0009426663,0.004291479],"category_scores_gemma":[0.003614761,0.0007473518,0.000874659,0.001437624,0.001293443,0.004360264,0.003585804,0.002341544,0.001544389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001299617,"about_ca_system_score_gemma":0.002482441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004521498,"about_ca_topic_score_gemma":0.005086211,"domain_scores_codex":[0.998548,0.0003724021,0.0001191686,0.0002117986,0.0005406784,0.0002079976],"domain_scores_gemma":[0.9990498,0.0001946548,0.00009416797,0.0003778444,0.0001304364,0.0001530323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004310879,0.000253147,0.001761383,0.0002860617,0.0001443625,0.0003256672,0.000383286,0.3203253,0.01247976,0.4183857,0.02721728,0.218007],"study_design_scores_gemma":[0.00005186432,0.00006337911,0.0001630937,0.00002411248,0.00002382488,0.00007996718,0.00003725465,0.8881834,0.003375355,0.08169769,0.02625924,0.00004092543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002950743,0.0001218734,0.9893078,0.0001851008,0.00004653279,0.0001149471,0.0000839436,0.005185327,0.002003724],"genre_scores_gemma":[0.2096386,0.0005054803,0.7833645,0.0002795822,0.0001231559,0.0004723927,0.0005125244,0.001033952,0.004069849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004521498,"threshold_uncertainty_score":0.01435643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2923126305","doi":"10.1109/tpds.2019.2907537","title":"CASpMV: A Customized and Accelerative SpMV Framework for the Sunway TaihuLight","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Hunan Provincial Innovation Foundation for Postgraduate; China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Parallel computing; Supercomputer; Scalability; Memory hierarchy; Overhead (engineering); Computer architecture; Operating system; Cache","authors":[{"name":"Guoqing Xiao","is_ca":true},{"name":"Kenli Li","is_ca":false},{"name":"Yuedan Chen","is_ca":true},{"name":"Wangquan He","is_ca":false},{"name":"Albert Y. Zomaya","is_ca":false},{"name":"Tao Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0177715680750364,"gpt":0.2503210929208687,"spread":0.2325495248458323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005717152,0.001133923,0.0006463828,0.000550333,0.0005883629,0.0008633474,0.003760823,0.0008720697,0.008382784],"category_scores_gemma":[0.001458018,0.0005545563,0.001009442,0.0006387852,0.0006577169,0.001712691,0.001821966,0.001283001,0.001860986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007792034,"about_ca_system_score_gemma":0.001782872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006983374,"about_ca_topic_score_gemma":0.008847447,"domain_scores_codex":[0.9995528,0.00006226057,0.00002592586,0.00007642916,0.0001992771,0.00008334532],"domain_scores_gemma":[0.9996377,0.00008238963,0.00002670683,0.0001049503,0.0001026756,0.00004545829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001546448,0.0003858547,0.006898553,0.0009974921,0.0005077002,0.0007141703,0.0008900908,0.2251349,0.07574811,0.04287004,0.1603813,0.4839253],"study_design_scores_gemma":[0.0002759748,0.0002032746,0.001257559,0.00004341952,0.00004377906,0.0001754012,0.00008988142,0.9026352,0.02447686,0.01152193,0.05918784,0.00008895465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03700991,0.0007201742,0.8275124,0.0002938692,0.0002066869,0.0002951322,0.001390272,0.122654,0.009917499],"genre_scores_gemma":[0.389308,0.0005793647,0.5783833,0.0004310458,0.0001053017,0.0009464488,0.007286786,0.01325479,0.009704972],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008382784,"threshold_uncertainty_score":0.02804327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031708312","doi":"10.1109/tpds.2014.2308218","title":"Shared Authority Based Privacy-Preserving Authentication Protocol in Cloud Computing","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Cloud computing; Computer security; Access control; Authentication (law); Anonymity; Encryption; Data sharing; Information privacy; Cloud computing security; Internet privacy","authors":[{"name":"Hong Liu","is_ca":false},{"name":"Huansheng Ning","is_ca":false},{"name":"Qingxu Xiong","is_ca":false},{"name":"Laurence T. Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0284463017390534,"gpt":0.2812047719963714,"spread":0.252758470257318,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002805476,0.000666018,0.0009757752,0.001010027,0.002569584,0.002605141,0.002044722,0.001781227,0.001940034],"category_scores_gemma":[0.005501525,0.0004550857,0.001206463,0.00194395,0.003187525,0.006544527,0.004482191,0.002854358,0.0007122068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001594072,"about_ca_system_score_gemma":0.003697015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001832906,"about_ca_topic_score_gemma":0.0008062291,"domain_scores_codex":[0.9937049,0.001806899,0.0006358457,0.001159166,0.00195567,0.0007375588],"domain_scores_gemma":[0.9962925,0.001082486,0.0004573169,0.001149506,0.0007831866,0.0002349269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004616457,0.0001303006,0.000912717,0.0003394603,0.00008800888,0.001291196,0.001293298,0.05006361,0.02245692,0.8676467,0.004445211,0.05087095],"study_design_scores_gemma":[0.0001811688,0.0002833329,0.0003510616,0.0001084455,0.0001374191,0.001411887,0.0003303845,0.6145788,0.03036523,0.3166751,0.03539588,0.0001813299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01313931,0.0005075558,0.9781396,0.0006572829,0.0002089057,0.0002797451,0.00006424235,0.0005745118,0.006428847],"genre_scores_gemma":[0.8564193,0.000971269,0.1337479,0.0003086873,0.0002206253,0.0006325522,0.0001705774,0.00008076247,0.007448326],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002805476,"threshold_uncertainty_score":0.01483691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081531839","doi":"10.1109/tpds.2011.179","title":"DCS: Distributed Asynchronous Clock Synchronization in Delay Tolerant Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Clock synchronization; Asynchronous communication; Computer science; Synchronization (alternating current); Clock drift; Convergence (economics); Self-clocking signal; Master clock; Protocol (science); Clock network; Network Time Protocol; Computer network; Distributed computing; Real-time computing; Clock skew; Clock signal; Time synchronization; Jitter","authors":[{"name":"Bong Jun Choi","is_ca":true},{"name":"Hao Liang","is_ca":true},{"name":"Xuemin Shen","is_ca":true},{"name":"Weihua Zhuang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02328643411635698,"gpt":0.2166241658301244,"spread":0.1933377317137674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006070458,0.0004297598,0.0004834849,0.0005792232,0.0006062675,0.0008779311,0.001236449,0.0004614598,0.001735187],"category_scores_gemma":[0.001470872,0.0001323903,0.0002155249,0.0009620145,0.0006948615,0.001108087,0.0009040461,0.0006622564,0.0004209099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006934801,"about_ca_system_score_gemma":0.001025185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001235576,"about_ca_topic_score_gemma":0.001197448,"domain_scores_codex":[0.9994355,0.0001491519,0.00004856646,0.0001053255,0.0002131391,0.00004820635],"domain_scores_gemma":[0.9992611,0.0002574056,0.00009950652,0.0001084402,0.000211329,0.00006222216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007454926,0.0001183716,0.001174033,0.0008127247,0.00008649631,0.0004077717,0.0003438078,0.2816371,0.04548696,0.2910828,0.01262178,0.3654826],"study_design_scores_gemma":[0.0002301689,0.0003728607,0.0002724818,0.00006733055,0.00009094806,0.0003937198,0.0001466659,0.8191164,0.03271965,0.04958317,0.09693911,0.00006752352],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01010841,0.0008823724,0.9833346,0.0002824266,0.000422302,0.0001275,0.00008436161,0.0006175134,0.004140468],"genre_scores_gemma":[0.7156549,0.00216461,0.2723634,0.0003994677,0.0004640197,0.0004520593,0.0003933959,0.0001094146,0.007998788],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001735187,"threshold_uncertainty_score":0.005804777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028689663","doi":"10.1109/tpds.2013.208","title":"On Arbitrating the Power-Performance Tradeoff in SaaS Clouds","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cloud computing; Distributed computing; Benchmark (surveying); Scheduling (production processes); Robustness (evolution); Software as a service; Admission control; Revenue; Profit maximization; Profit (economics); Mathematical optimization; Software; Computer network; Quality of service; Operating system; Software development","authors":[{"name":"Fangming Liu","is_ca":false},{"name":"Zhi Zhou","is_ca":false},{"name":"Hai Jin","is_ca":false},{"name":"Bo Li","is_ca":true},{"name":"Baochun Li","is_ca":true},{"name":"Hongbo Jiang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01213218492907189,"gpt":0.2087361065763197,"spread":0.1966039216472478,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001662768,0.001170366,0.0007498225,0.0005056296,0.0007529556,0.002148012,0.001140593,0.0008729863,0.001652051],"category_scores_gemma":[0.004122104,0.0004203978,0.0003931947,0.0007681784,0.001387987,0.002110785,0.0008608042,0.001189952,0.0002016946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001829543,"about_ca_system_score_gemma":0.001883875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003835202,"about_ca_topic_score_gemma":0.003074282,"domain_scores_codex":[0.999011,0.0003145835,0.00003015148,0.0001301448,0.0003179331,0.0001961582],"domain_scores_gemma":[0.9988187,0.0007481033,0.0001475798,0.00006866527,0.0001670595,0.00004987317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003683735,0.00003823201,0.000223409,0.00005560253,0.00001428141,0.00006079183,0.00005734686,0.9083208,0.003925815,0.07464334,0.0004587246,0.01216477],"study_design_scores_gemma":[0.000002910621,0.00002374956,0.00006506377,0.000008131897,0.000004367036,0.00001210812,0.00002217516,0.985212,0.0005698777,0.01355058,0.0005233443,0.000005704587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0364398,0.001183199,0.9476053,0.0009593866,0.00008050891,0.0000627254,0.00003254973,0.0001608405,0.01347575],"genre_scores_gemma":[0.968422,0.000880897,0.02863889,0.0001029052,0.000062568,0.00004663479,0.00001168164,0.00004526918,0.001789187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003835202,"threshold_uncertainty_score":0.01327437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150914379","doi":"10.1109/tpds.2012.182","title":"Analysis of a Pool Management Scheme for Cloud Computing Centers","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Cloud computing; Computer science; Virtualization; Resource management (computing); Distributed computing; Task (project management); Capacity planning; Scheme (mathematics); Set (abstract data type); Resource allocation; Data center; Resource (disambiguation); Computer network; Operating system","authors":[{"name":"Hamzeh Khazaei","is_ca":true},{"name":"Jelena Mišić","is_ca":true},{"name":"Vojislav B. Mišić","is_ca":true},{"name":"Saeed Rashwand","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01943755485763359,"gpt":0.2486237670388675,"spread":0.2291862121812339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002492876,0.0005947156,0.0009389159,0.0004760351,0.00103715,0.001865621,0.001547682,0.00102353,0.004078905],"category_scores_gemma":[0.004566458,0.0005226055,0.0006694615,0.0006072651,0.0009701845,0.002604767,0.001357277,0.0008829003,0.0003328698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003492537,"about_ca_system_score_gemma":0.003065356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00564494,"about_ca_topic_score_gemma":0.002251708,"domain_scores_codex":[0.9991294,0.0002809443,0.00002422019,0.0001100475,0.000216944,0.0002385685],"domain_scores_gemma":[0.9989216,0.0005383817,0.0001498448,0.0001078803,0.0001752156,0.0001071332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004740111,0.00002314177,0.000285789,0.00003340627,0.00001502401,0.00004322973,0.00004411583,0.9300536,0.001654704,0.06322524,0.0006988618,0.00387545],"study_design_scores_gemma":[0.000004415438,0.00001511798,0.00006737951,0.000002804087,0.000004035136,0.000006568613,0.00001051555,0.9951071,0.0002007225,0.004339062,0.0002389511,0.000003475825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1092084,0.000361394,0.880157,0.0008422863,0.0000427769,0.0002310862,0.0001610519,0.0002470347,0.008749055],"genre_scores_gemma":[0.9542834,0.0002874272,0.04155438,0.00007761567,0.00003011722,0.0001998236,0.00006845903,0.00006999618,0.003428754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00564494,"threshold_uncertainty_score":0.0253402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112716715","doi":"10.1109/tpds.2007.1119","title":"rStream: Resilient and Optimal Peer-to-Peer Streaming with Rateless Codes","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Peer-to-peer; Computer network; Latency (audio); Network topology; Coding (social sciences); Multimedia; Distributed computing; Telecommunications; Network packet","authors":[{"name":"Chuan Wu","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01497195978238038,"gpt":0.2375853154592307,"spread":0.2226133556768503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001411273,0.0004856257,0.0006082469,0.0006085649,0.0005654842,0.0007923227,0.001841299,0.001065977,0.001256814],"category_scores_gemma":[0.005548065,0.00026869,0.0003153849,0.0005299682,0.001146183,0.0016773,0.001684077,0.001223594,0.0004754007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008812438,"about_ca_system_score_gemma":0.001628083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004760646,"about_ca_topic_score_gemma":0.003486745,"domain_scores_codex":[0.9989926,0.0002599857,0.0000613455,0.0001004622,0.0004854914,0.0001000906],"domain_scores_gemma":[0.9978068,0.0009960558,0.0001690359,0.0004406915,0.0004556007,0.0001318613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007815141,0.0002393547,0.001126231,0.0001917932,0.00007802997,0.0004272934,0.0003980665,0.6831179,0.05817527,0.04762333,0.006086769,0.2017544],"study_design_scores_gemma":[0.00004718791,0.00006429544,0.00005797336,0.000008490361,0.000005015776,0.00006603053,0.00001443481,0.9813699,0.01279708,0.003924889,0.001625054,0.00001980421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0440386,0.0004210027,0.9455518,0.0002006639,0.00008812467,0.0001649686,0.00007578963,0.007063298,0.002395842],"genre_scores_gemma":[0.5441757,0.0003145369,0.4517815,0.0001447,0.00005136618,0.000222015,0.0001925912,0.0003549423,0.00276266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004760646,"threshold_uncertainty_score":0.009465873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2895829868","doi":"10.1109/tpds.2018.2874659","title":"HSDC: A Highly Scalable Data Center Network Architecture for Greater Incremental Scalability","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"Institute of Computing Technology, Chinese Academy of Sciences; Key Laboratory of Computer System and Architecture; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Server; Data center; Distributed computing; Computer network; Network architecture; Throughput; Database; Operating system","authors":[{"name":"Zhen Zhang","is_ca":false},{"name":"Yuhui Deng","is_ca":false},{"name":"Geyong Min","is_ca":false},{"name":"Junjie Xie","is_ca":false},{"name":"Laurence T. Yang","is_ca":true},{"name":"Yongtao Zhou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03422902820518883,"gpt":0.2578291159504301,"spread":0.2236000877452413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002537547,0.0002423858,0.0002120147,0.0005114984,0.0004456456,0.0005574251,0.0008124138,0.0002388253,0.001380161],"category_scores_gemma":[0.0004841067,0.0001123466,0.0002222343,0.0006730856,0.0003058955,0.0009083119,0.0006387709,0.0003599087,0.0002517356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000884785,"about_ca_system_score_gemma":0.001108656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004357176,"about_ca_topic_score_gemma":0.005427811,"domain_scores_codex":[0.9998379,0.00002470918,0.00001123183,0.00002368742,0.00006708138,0.00003541375],"domain_scores_gemma":[0.9995914,0.00004963535,0.00003051699,0.00007934536,0.0001928378,0.00005637321],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006708204,0.0002877605,0.007021521,0.0004702287,0.0001239122,0.0004944035,0.0002904758,0.3423543,0.1356728,0.05960489,0.04305007,0.4099588],"study_design_scores_gemma":[0.00008650804,0.000445678,0.002299025,0.00002004604,0.00005719605,0.0003452246,0.0001191889,0.9054605,0.04194041,0.01175866,0.03740252,0.00006502632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2375877,0.001170917,0.7348899,0.0008270121,0.0003735907,0.0003782508,0.0006992944,0.008857749,0.01521561],"genre_scores_gemma":[0.8245895,0.0004165167,0.1702231,0.0001549605,0.00007852844,0.000148483,0.000973494,0.00008390986,0.003331569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004357176,"threshold_uncertainty_score":0.008663654,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2769557912","doi":"10.1109/tpds.2017.2773504","title":"Time- and Cost- Efficient Task Scheduling across Geo-Distributed Data Centers","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Big data; Data center; Integer programming; Unimodular matrix; Linear programming; Solver; Scheduling (production processes); SPARK (programming language); Distributed computing; Mathematical optimization; Algorithm; Data mining","authors":[{"name":"Zhiming Hu","is_ca":true},{"name":"Baochun Li","is_ca":true},{"name":"Jun Luo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03223886428070263,"gpt":0.2769292531709145,"spread":0.2446903888902119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002113248,0.001241955,0.001134814,0.0006536625,0.00160203,0.001267286,0.002486027,0.0007807848,0.001893076],"category_scores_gemma":[0.003854911,0.0004905873,0.0007457017,0.001229166,0.0009101263,0.001584343,0.001333249,0.001191018,0.0006052084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001503382,"about_ca_system_score_gemma":0.004037111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01043609,"about_ca_topic_score_gemma":0.01048338,"domain_scores_codex":[0.9983316,0.0003419193,0.000086656,0.0004825928,0.0003589572,0.0003983466],"domain_scores_gemma":[0.997663,0.0006791862,0.0002681515,0.000454985,0.0005399021,0.0003946541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008393127,0.0003955235,0.001860148,0.0001654155,0.00006578107,0.0001798897,0.0002570825,0.8930789,0.01362819,0.005907173,0.007969879,0.07565275],"study_design_scores_gemma":[0.00007407927,0.0001165822,0.0005140582,0.000004383608,0.00001334809,0.00003110731,0.0001181354,0.9885828,0.004035906,0.00473772,0.001759073,0.0000127453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2711756,0.0007040284,0.7115306,0.0009410021,0.0002460338,0.00037707,0.0004801168,0.006356125,0.008189532],"genre_scores_gemma":[0.7823207,0.0002020611,0.2143722,0.0001254682,0.00006404502,0.0002145638,0.0005624165,0.0003841679,0.001754345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01043609,"threshold_uncertainty_score":0.0207507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984473368","doi":"10.1109/tpds.2003.1247668","title":"Refactoring middleware with aspects","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Middleware (distributed applications); Common Object Request Broker Architecture; Aspect-oriented programming; Code refactoring; Modularity (biology); Message oriented middleware; Distributed computing; Software engineering; Architecture; Abstraction; Separation of concerns; Adaptability; Process (computing); Programming paradigm; AspectJ; Software architecture; Programming language; Software","authors":[{"name":"C. Zhang","is_ca":true},{"name":"Hans‐Arno Jacobsen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03433122624316953,"gpt":0.2457590627562118,"spread":0.2114278365130423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003589386,0.0009783496,0.0004691171,0.001520865,0.0004412193,0.001712758,0.00155719,0.0007473874,0.0005145869],"category_scores_gemma":[0.01229128,0.000725509,0.001104214,0.001079726,0.001049467,0.002348194,0.002309759,0.001696519,0.0002909451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006263049,"about_ca_system_score_gemma":0.001214429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001750937,"about_ca_topic_score_gemma":0.001743134,"domain_scores_codex":[0.9963477,0.0008572371,0.0003788699,0.0004641374,0.001700946,0.0002510545],"domain_scores_gemma":[0.989407,0.002871443,0.001269145,0.004511064,0.001762594,0.0001788581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002302506,0.0003681956,0.03369667,0.0008071886,0.0002781434,0.001625598,0.004496882,0.1382573,0.1518091,0.0832885,0.003934642,0.5812075],"study_design_scores_gemma":[0.00006798091,0.0005393822,0.01055984,0.0003927702,0.0004668659,0.001868052,0.001151771,0.6033981,0.1928252,0.08425765,0.10429,0.0001824196],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1368548,0.000440666,0.8532301,0.0002648087,0.00007406277,0.0002098534,0.00009190507,0.004767782,0.004065871],"genre_scores_gemma":[0.3020363,0.0004020587,0.6938173,0.0001342858,0.00003043893,0.0001387486,0.0004559438,0.001282475,0.001702492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003589386,"threshold_uncertainty_score":0.01898277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135105254","doi":"10.1109/tpds.2007.70726","title":"Overlay Networks with Linear Capacity Constraints","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Ontario Tech University","funders":"","keywords":"Overlay network; Computer science; Overlay; Linear programming; Network topology; Distributed computing; Node (physics); Computer network; Virtual network; Path (computing); Maximum flow problem; Context (archaeology); The Internet; Mathematical optimization; Algorithm; Mathematics","authors":[{"name":"Ying Zhu","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02599053438057765,"gpt":0.2167706465590052,"spread":0.1907801121784276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001374713,0.000908949,0.0009211681,0.0006037419,0.0008548195,0.001889207,0.002037904,0.001242825,0.00298967],"category_scores_gemma":[0.008562014,0.0007519574,0.0005274405,0.001923899,0.001111432,0.003970921,0.001683084,0.001466362,0.0004822338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001946069,"about_ca_system_score_gemma":0.001682658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007514329,"about_ca_topic_score_gemma":0.006865443,"domain_scores_codex":[0.9981147,0.0006053157,0.00008325605,0.0003687951,0.0005236877,0.000304315],"domain_scores_gemma":[0.9940525,0.003863018,0.0005961368,0.0006496535,0.0006335551,0.0002052246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000026158,0.00002336988,0.0003070432,0.00006392448,0.000016112,0.0001024896,0.00004370818,0.9433939,0.001253945,0.0424404,0.001216591,0.0111123],"study_design_scores_gemma":[0.000006468955,0.00001406676,0.00008462771,0.00000552575,0.000005994983,0.00003605249,0.00001585985,0.9744884,0.0006842713,0.02317446,0.001476312,0.000007965205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03976899,0.0003906368,0.9510499,0.000395345,0.00003393129,0.00008749439,0.0004584689,0.000466378,0.007348869],"genre_scores_gemma":[0.7818521,0.0008084601,0.210355,0.0001350726,0.00007944703,0.0002305245,0.0004865619,0.0001191116,0.005933713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007514329,"threshold_uncertainty_score":0.01494116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092992358","doi":"10.1109/tpds.2011.192","title":"Distributed Throughput Optimization for ZigBee Cluster-Tree Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Council; Intel Corporation","keywords":"Computer science; Computer network; NeuRFon; Network topology; Wireless sensor network; Throughput; Wireless; Wireless network; Bandwidth (computing); Tree (set theory); Distributed computing; Key distribution in wireless sensor networks","authors":[{"name":"Yu–Kai Huang","is_ca":false},{"name":"Ai‐Chun Pang","is_ca":false},{"name":"Pi-Cheng Hsiu","is_ca":false},{"name":"Weihua Zhuang","is_ca":true},{"name":"Pangfeng Liu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02592299096344838,"gpt":0.2233344299203935,"spread":0.1974114389569451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001653882,0.0009467455,0.0008495876,0.0007093107,0.0007063231,0.001015468,0.001546303,0.0007583231,0.001727801],"category_scores_gemma":[0.002830327,0.0004224199,0.0004732199,0.001327357,0.0008288366,0.001223246,0.0008640811,0.0008470111,0.0002584875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002908412,"about_ca_system_score_gemma":0.001708371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004109822,"about_ca_topic_score_gemma":0.004284352,"domain_scores_codex":[0.9993267,0.0002307569,0.00001790518,0.0001264251,0.0002009109,0.0000974054],"domain_scores_gemma":[0.9991253,0.0005570531,0.00009257172,0.00003615721,0.0001472059,0.00004169166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002794945,0.00002055223,0.0001175956,0.00003244262,0.00001158947,0.00001873148,0.00002260094,0.9767534,0.0006465398,0.01207265,0.0006186696,0.009657342],"study_design_scores_gemma":[0.000005859882,0.000008132601,0.00002585642,0.000001748481,0.000002468379,0.000004630935,0.000004004413,0.9956839,0.0001553477,0.003861699,0.0002446962,0.000001667188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009936571,0.000279087,0.987205,0.0001260534,0.0000231224,0.00005288341,0.00004069844,0.0001441464,0.002192347],"genre_scores_gemma":[0.7204778,0.0008550872,0.2722294,0.00008195347,0.00006346634,0.0004277163,0.0001942253,0.0001452684,0.005525111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004109822,"threshold_uncertainty_score":0.02110207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2331386032","doi":"10.1109/tpds.2015.2447528","title":"Analysis of CSMA/CA Mechanism of IEEE 802.15.6 under Non-Saturation Regime","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Body area network; Wireless; Bandwidth (computing); IEEE 802.11e-2005; Software deployment; IEEE 802.15; Channel (broadcasting); Wireless network; Wireless lan; Wireless sensor network; Telecommunications; Wi-Fi array","authors":[{"name":"Saeed Rashwand","is_ca":true},{"name":"Jelena Mišić","is_ca":true},{"name":"Vojislav B. Mišić","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01921438123364785,"gpt":0.2224616062775446,"spread":0.2032472250438968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009362252,0.0005287366,0.0006041609,0.0009070833,0.0006480152,0.0008308356,0.001408677,0.0007523209,0.002447039],"category_scores_gemma":[0.002862097,0.0003271308,0.0005111276,0.0004738477,0.0008556026,0.001095548,0.000366523,0.00078103,0.0003874881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001370093,"about_ca_system_score_gemma":0.001660721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007571743,"about_ca_topic_score_gemma":0.003641273,"domain_scores_codex":[0.9992009,0.0001352155,0.00002644418,0.000106279,0.0003344601,0.0001967737],"domain_scores_gemma":[0.9985458,0.0006264109,0.0002168154,0.0001280881,0.0004321878,0.00005079966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001807786,0.0001007746,0.002545216,0.000188912,0.00007059841,0.0005342744,0.0003239852,0.8234246,0.03330186,0.1237299,0.001358428,0.01424069],"study_design_scores_gemma":[0.000004944792,0.00002076684,0.0002543573,0.000005875313,0.000006821829,0.00004904223,0.00001128854,0.995356,0.0009635651,0.003065435,0.0002560742,0.000005888248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2985794,0.002541809,0.6647489,0.000985286,0.0001907554,0.0002323866,0.0002501633,0.0007487901,0.03172258],"genre_scores_gemma":[0.9888452,0.0004859125,0.007559558,0.00005947025,0.00003135749,0.00005313084,0.00003020691,0.00003188226,0.002903255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007571743,"threshold_uncertainty_score":0.01505536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3151453676","doi":"10.1109/tpds.2007.253279","title":"LRED: A Robust and Responsive AQM Algorithm Using Packet Loss Ratio Measurement","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Microsoft Research Asia","keywords":"Active queue management; Goodput; Computer science; Random early detection; Network congestion; Robustness (evolution); Queue; Packet loss; Network packet; Computer network; Algorithm; Queueing theory; Flow control (data); Real-time computing; Throughput; Telecommunications","authors":[{"name":"Chonggang Wang","is_ca":false},{"name":"Jiangchuan Liu","is_ca":true},{"name":"Bo Li","is_ca":false},{"name":"K. Sohraby","is_ca":false},{"name":"Y. Thomas Hou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02608444353472715,"gpt":0.2182216668738476,"spread":0.1921372233391204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002002818,0.0009451633,0.001070894,0.001304929,0.000457539,0.0008933742,0.003386854,0.001158132,0.000712808],"category_scores_gemma":[0.004696239,0.0003426933,0.0005312726,0.0006349682,0.0007117321,0.001346316,0.001325726,0.001612774,0.0003293941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009039462,"about_ca_system_score_gemma":0.001054764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002014279,"about_ca_topic_score_gemma":0.001107439,"domain_scores_codex":[0.9989272,0.000249754,0.00008729314,0.0002693892,0.0003894584,0.00007686009],"domain_scores_gemma":[0.9986235,0.0005206479,0.0003115466,0.0001503433,0.00033126,0.0000627366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005259605,0.0003116379,0.003046923,0.0002861405,0.0002049151,0.0001818945,0.0002019622,0.4272003,0.03728135,0.01640081,0.005030842,0.5093272],"study_design_scores_gemma":[0.00005184454,0.00008924635,0.0002306938,0.000007146476,0.00001651551,0.00005336599,0.000008877865,0.9915748,0.004597478,0.001826673,0.001517645,0.00002574907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01049144,0.0004862814,0.9853683,0.0001845815,0.000126163,0.00009311688,0.00004028645,0.002417771,0.0007920261],"genre_scores_gemma":[0.5154095,0.0003832268,0.4809515,0.0004211207,0.0001538093,0.0002430851,0.0002048741,0.000142128,0.002090754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003386854,"threshold_uncertainty_score":0.01059204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105705286","doi":"10.1109/tpds.2003.1195413","title":"Dynamic querying of streaming data with the dQUOB system","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Arkansas High Performance Computing Center, University of Arkansas; Canada Excellence Research Chairs, Government of Canada","keywords":"Computer science; Data stream mining; Query language; Visualization; Data visualization; Relational database; Abstraction; Data modeling; Database; Data mining; Distributed computing","authors":[{"name":"Beth Plale","is_ca":false},{"name":"Karsten Schwan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02001847012196932,"gpt":0.2358886930548259,"spread":0.2158702229328566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005670473,0.0008664271,0.001805154,0.001811775,0.001377663,0.005095763,0.003786112,0.001579589,0.005291732],"category_scores_gemma":[0.01275354,0.0009705376,0.0007282193,0.002366749,0.001773202,0.005272909,0.007245025,0.001903464,0.002744521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001320625,"about_ca_system_score_gemma":0.001859876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01092341,"about_ca_topic_score_gemma":0.00405668,"domain_scores_codex":[0.9955446,0.001027376,0.0005037589,0.0009071536,0.001706419,0.0003106678],"domain_scores_gemma":[0.9930328,0.002233287,0.0002767454,0.00283306,0.001061564,0.0005624159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.006684732,0.000876673,0.01823291,0.001460113,0.0003464838,0.001814743,0.004684906,0.03550484,0.1268277,0.09821566,0.1276248,0.5777265],"study_design_scores_gemma":[0.001172294,0.0003599038,0.002732222,0.000152132,0.0001132846,0.001061872,0.0006193637,0.7205967,0.05420043,0.0457191,0.1730291,0.0002434956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05656681,0.0009857714,0.763868,0.0013023,0.0002378836,0.0005145883,0.002766074,0.1602809,0.01347775],"genre_scores_gemma":[0.4539359,0.0008860003,0.5166298,0.001422445,0.0001815875,0.0007579385,0.008927126,0.00807934,0.009179882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01092341,"threshold_uncertainty_score":0.02998871,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054092574","doi":"10.1109/tpds.2007.1016","title":"Design of Adaptive PI Rate Controller for Best-Effort Traffic in the Internet Based on Phase Margin","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Active queue management; Computer science; Router; Phase margin; Robustness (evolution); Controller (irrigation); Network congestion; Control theory (sociology); PID controller; Adaptive control; Queue; Real-time computing; Packet loss; Network packet; Computer network; Bandwidth (computing); Control engineering; Amplifier; Engineering; Control (management)","authors":[{"name":"Yang Hong","is_ca":true},{"name":"Oliver Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03307635050854029,"gpt":0.2640754187643328,"spread":0.2309990682557925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006012657,0.0005410716,0.0004689215,0.0004449163,0.0004225711,0.0007181677,0.001483391,0.0006602221,0.001261606],"category_scores_gemma":[0.00123329,0.0002500179,0.0003166871,0.0002395765,0.0003509055,0.000628385,0.0003399176,0.0007557145,0.0003854508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003637392,"about_ca_system_score_gemma":0.0005367164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001071003,"about_ca_topic_score_gemma":0.0007415215,"domain_scores_codex":[0.9995841,0.00005936747,0.00002762034,0.0001085539,0.000179892,0.00004040291],"domain_scores_gemma":[0.9995071,0.000119866,0.00007013415,0.00003443566,0.0002454683,0.00002295063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005312025,0.0003925853,0.002301788,0.0005305646,0.0001583229,0.0005832399,0.0004564874,0.3105229,0.1928617,0.04162958,0.004843354,0.4451883],"study_design_scores_gemma":[0.0001015764,0.0002019818,0.000309585,0.00001167099,0.00003693677,0.0001366409,0.00001248637,0.9776084,0.01620269,0.002255486,0.003100633,0.00002196733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009147059,0.0002118013,0.9876654,0.0001008122,0.00009361876,0.00007993187,0.000009725379,0.0007939591,0.001897687],"genre_scores_gemma":[0.7953507,0.0004026643,0.2011967,0.0002089921,0.0001873016,0.0002889193,0.00005173431,0.00005855746,0.002254454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001483391,"threshold_uncertainty_score":0.004220426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019462775","doi":"10.1109/tpds.2014.7","title":"VMThunder: Fast Provisioning of Large-Scale Virtual Machine Clusters","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cloud computing; Scalability; Provisioning; Virtual machine; Cache; Operating system; Distributed computing; Server; Computer network","authors":[{"name":"Zhaoning Zhang","is_ca":false},{"name":"Ziyang Li","is_ca":false},{"name":"Kui Wu","is_ca":true},{"name":"Dongsheng Li","is_ca":false},{"name":"Huiba Li","is_ca":false},{"name":"Yuxing Peng","is_ca":false},{"name":"Xicheng Lu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008212394550054729,"gpt":0.2180497207293416,"spread":0.2098373261792869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158633,0.0007588888,0.0004780726,0.0006291191,0.0007211727,0.001016959,0.002786923,0.0005145955,0.001731128],"category_scores_gemma":[0.003939874,0.000522428,0.0002887281,0.0006125178,0.0005983536,0.001883552,0.002246696,0.0009304331,0.0004008275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007680883,"about_ca_system_score_gemma":0.001234484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00307898,"about_ca_topic_score_gemma":0.002826192,"domain_scores_codex":[0.9991193,0.0001953289,0.00004387959,0.0001474061,0.0002770407,0.000216997],"domain_scores_gemma":[0.9981494,0.0003876295,0.000203267,0.0006444668,0.0002412792,0.0003739971],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004137752,0.0008052185,0.01521808,0.0006082405,0.0003501169,0.0008417848,0.000693662,0.2641631,0.1109526,0.0163987,0.1079081,0.4779226],"study_design_scores_gemma":[0.0003069197,0.0004919582,0.003813352,0.0000237893,0.00003414596,0.000223083,0.0001410551,0.9288815,0.04104558,0.004579441,0.02036769,0.00009150674],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4962843,0.001909542,0.365664,0.0009618528,0.0007300905,0.0006840284,0.001052547,0.1219533,0.01076041],"genre_scores_gemma":[0.8846305,0.0002370358,0.1110576,0.0001737313,0.00006087895,0.0001203365,0.001118352,0.001111717,0.001489886],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00307898,"threshold_uncertainty_score":0.006127536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160280191","doi":"10.1109/tpds.2014.2342740","title":"Small Cluster in Cyber Physical Systems: Network Topology, Interdependence and Cascading Failures","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Interdependent networks; Cascading failure; Computer science; Giant component; Network topology; Small-world network; Component (thermodynamics); Generality; Cluster (spacecraft); Distributed computing; Topology (electrical circuits); Metric (unit); Fraction (chemistry); Complex network; Upper and lower bounds; Connected component; Percolation (cognitive psychology); Computer network; Random graph; Theoretical computer science; Mathematics; Physics; Graph; Electric power system; Artificial intelligence","authors":[{"name":"Zhen Huang","is_ca":true},{"name":"Cheng Wang","is_ca":true},{"name":"Amiya Nayak","is_ca":true},{"name":"Ivan Stojmenović","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01464613176780329,"gpt":0.2459738236110716,"spread":0.2313276918432683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964445,0.0005489878,0.0004469563,0.001352951,0.0007107946,0.001139145,0.0007914071,0.0007142369,0.001180694],"category_scores_gemma":[0.003947665,0.0002744026,0.0004188494,0.001386,0.001453951,0.002521604,0.001010234,0.0007459636,0.0001285772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001010983,"about_ca_system_score_gemma":0.000446219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003579627,"about_ca_topic_score_gemma":0.002739166,"domain_scores_codex":[0.9995385,0.0001716915,0.00001752422,0.0001124338,0.000106372,0.00005345482],"domain_scores_gemma":[0.9977205,0.0012078,0.0004737341,0.0002245006,0.0002159003,0.0001575916],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001355476,0.00007600645,0.01814542,0.0003293588,0.0001360649,0.0008781217,0.0006818306,0.8350671,0.007267711,0.108134,0.002387657,0.02676106],"study_design_scores_gemma":[0.00001239574,0.0001091025,0.01029319,0.00004808025,0.00007608993,0.0005973332,0.000453622,0.8788648,0.001852607,0.1042108,0.003432034,0.00004996542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5732549,0.006104274,0.4067164,0.001368846,0.0001031089,0.0001166383,0.0002661061,0.0003798007,0.01169],"genre_scores_gemma":[0.9909915,0.001222368,0.006695651,0.00004471551,0.00003711591,0.000039183,0.00006565637,0.00002339557,0.0008804852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003579627,"threshold_uncertainty_score":0.007335246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978252943","doi":"10.1109/tpds.2015.2425403","title":"Burstiness-Aware Resource Reservation for Server Consolidation in Computing Clouds","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"State Key Laboratory of Novel Software Technology; Nanjing University; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Burstiness; Computer science; Reservation; Distributed computing; Queue; Cloud computing; Virtualization; Virtual machine; Server; Energy consumption; Computer network; Real-time computing; Operating system","authors":[{"name":"Sheng Zhang","is_ca":false},{"name":"Zhuzhong Qian","is_ca":false},{"name":"Zhaoyi Luo","is_ca":true},{"name":"Jie Wu","is_ca":false},{"name":"Sanglu Lu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04798110418448325,"gpt":0.2702338779129049,"spread":0.2222527737284216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008693322,0.0004099962,0.0005948552,0.0003475134,0.000505228,0.0008647129,0.001211065,0.0003916076,0.0005779124],"category_scores_gemma":[0.002145263,0.0002569623,0.0003384391,0.0004998987,0.0004141818,0.001190976,0.0005483305,0.0007107729,0.0001366136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009405754,"about_ca_system_score_gemma":0.001393624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004319023,"about_ca_topic_score_gemma":0.003382333,"domain_scores_codex":[0.9994358,0.0001437179,0.00004677859,0.0001143612,0.0001341657,0.0001250603],"domain_scores_gemma":[0.9989793,0.00044393,0.0001365296,0.0001058511,0.0002105282,0.0001238809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003592692,0.0002357995,0.004787899,0.0001511992,0.00008125242,0.0001699088,0.0002427663,0.7986636,0.03549839,0.01908988,0.002355423,0.1383646],"study_design_scores_gemma":[0.000006892444,0.00002732665,0.0001730177,0.000002872795,0.000005951418,0.0000202718,0.00001159278,0.9963564,0.001415076,0.001721931,0.0002539846,0.000004751523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08481672,0.00120344,0.9118922,0.0002542104,0.0001055051,0.00006532032,0.00003373277,0.0006161723,0.001012713],"genre_scores_gemma":[0.9566714,0.0003223194,0.04227582,0.00008685423,0.00003866252,0.00002623797,0.00004190754,0.00004185638,0.0004948107],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004319023,"threshold_uncertainty_score":0.008587718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977930421","doi":"10.1109/tpds.2013.37","title":"Enabling Trustworthy Service Evaluation in Service-Oriented Mobile Social Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Computer science; Service provider; Computer security; Service (business); Sybil attack; Trusted Computing; Computer network; Internet privacy; World Wide Web; Wireless sensor network; Business","authors":[{"name":"Xiaohui Liang","is_ca":true},{"name":"Xiaodong Lin","is_ca":true},{"name":"Xuemin Shen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01973167359923044,"gpt":0.2461207312639108,"spread":0.2263890576646804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004449659,0.0009483272,0.001294985,0.001268764,0.001231863,0.002192919,0.001499154,0.001393622,0.0008593877],"category_scores_gemma":[0.01214538,0.0004365541,0.0006101171,0.00100275,0.001172164,0.004393578,0.003062513,0.001058923,0.0006220375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001256414,"about_ca_system_score_gemma":0.001327298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003044205,"about_ca_topic_score_gemma":0.00193869,"domain_scores_codex":[0.993737,0.002539379,0.0003614334,0.0007662583,0.002200559,0.0003954039],"domain_scores_gemma":[0.9918057,0.00277469,0.001313906,0.001402717,0.002111803,0.0005912682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002236834,0.000663696,0.02433201,0.0008813709,0.0004821967,0.00315234,0.002323428,0.2034691,0.06546304,0.09053419,0.01131357,0.5951482],"study_design_scores_gemma":[0.00005102016,0.0002541203,0.001335501,0.00002938104,0.00005931115,0.0004135475,0.0002315891,0.9652194,0.008737228,0.01443878,0.009166089,0.00006410631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1054389,0.00175351,0.8829212,0.0009516869,0.0002047008,0.0005326787,0.00006666672,0.003069343,0.005061317],"genre_scores_gemma":[0.93369,0.0003072305,0.06422549,0.0001577626,0.0001027682,0.00009481582,0.0000716667,0.00004642607,0.001303782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004449659,"threshold_uncertainty_score":0.02353239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134502143","doi":"10.1109/tpds.2007.70748","title":"A Dynamic Skip List-Based Overlay for On-Demand Media Streaming with VCR Interactions","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Overlay; Computer network; Video on demand; On demand; Video streaming; Real Time Streaming Protocol; Live streaming; Multimedia; Operating system; The Internet","authors":[{"name":"Dan Wang","is_ca":true},{"name":"Jiangchuan Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01998950644966733,"gpt":0.2426642571538296,"spread":0.2226747507041623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000803531,0.0003305061,0.0005663557,0.000572867,0.0009611057,0.0009267441,0.001584866,0.0006648026,0.001445067],"category_scores_gemma":[0.003277615,0.0002371873,0.0003152761,0.0007267701,0.0008278665,0.00174485,0.001253056,0.0006503115,0.0003173012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001442409,"about_ca_system_score_gemma":0.001654916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005856786,"about_ca_topic_score_gemma":0.006057981,"domain_scores_codex":[0.9993706,0.0001933224,0.00003203219,0.0001028766,0.0002291114,0.00007208596],"domain_scores_gemma":[0.9988514,0.0004395495,0.0001184081,0.0002321597,0.0002513678,0.0001071578],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002648368,0.000167101,0.001157881,0.000158201,0.00003311626,0.0004496445,0.0002518669,0.7975121,0.02656966,0.09742791,0.003962969,0.07204478],"study_design_scores_gemma":[0.00001532513,0.00005084073,0.00007601437,0.000003000139,0.000006988724,0.00005490094,0.00001380467,0.9920377,0.001475936,0.004842162,0.001412282,0.00001112677],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06369731,0.0002734227,0.9289913,0.0004402306,0.0000610344,0.0001272944,0.0001611458,0.001258596,0.004989749],"genre_scores_gemma":[0.8372515,0.0002380428,0.1593282,0.00008069172,0.00004046514,0.0001246715,0.0001555629,0.00007646385,0.002704368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005856786,"threshold_uncertainty_score":0.01164538,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139389207","doi":"10.1109/tpds.2011.20","title":"Traffic-Aware Relay Node Deployment: Maximizing Lifetime for Data Collection Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Hong Kong Polytechnic University","keywords":"Computer science; Computer network; Relay; Wireless sensor network; Software deployment; Base station; Wireless; Key distribution in wireless sensor networks; Distributed computing; Wireless network; Telecommunications","authors":[{"name":"Feng Wang","is_ca":true},{"name":"Dan Wang","is_ca":false},{"name":"Jiangchuan Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04648938453610427,"gpt":0.2401616709959154,"spread":0.1936722864598111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001436985,0.001501819,0.0009895896,0.0006973257,0.0004717154,0.0008242315,0.001877644,0.001501119,0.001085309],"category_scores_gemma":[0.005980551,0.0004992157,0.0007477608,0.001220988,0.0007443647,0.002496931,0.001434612,0.0008626826,0.0003841679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000918358,"about_ca_system_score_gemma":0.0005793911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000652601,"about_ca_topic_score_gemma":0.0006423444,"domain_scores_codex":[0.9992311,0.0003436898,0.00004226352,0.0001850819,0.0001196966,0.00007816574],"domain_scores_gemma":[0.9985759,0.0008750858,0.0001754672,0.00009900869,0.0001884793,0.00008609845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000107395,0.00008226995,0.0006353754,0.000572976,0.00005298659,0.0003312777,0.0002230055,0.8819666,0.01207407,0.03830551,0.004214307,0.06143416],"study_design_scores_gemma":[0.00001053413,0.0001168286,0.0001879265,0.000032923,0.00002527647,0.0002231421,0.00007525204,0.976926,0.002337696,0.01763653,0.002411128,0.00001685566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01807686,0.001244267,0.9776446,0.0004245426,0.00006828638,0.0000825962,0.0001001798,0.0001866257,0.002171974],"genre_scores_gemma":[0.7238093,0.005092478,0.2665152,0.0002018841,0.0003444286,0.0003668268,0.0003327649,0.0002465911,0.003090453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001877644,"threshold_uncertainty_score":0.007599533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140556288","doi":"10.1109/tpds.2011.180","title":"Leveraging Prediction to Improve the Coverage of Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless sensor network; Submodular set function; Leverage (statistics); Greedy algorithm; Node (physics); Entropy (arrow of time); Aggregate (composite); Distributed computing; Data mining; Mathematical optimization; Algorithm; Computer network; Machine learning","authors":[{"name":"Shibo He","is_ca":true},{"name":"Jiming Chen","is_ca":false},{"name":"Xu Li","is_ca":false},{"name":"Xuemin Shen","is_ca":true},{"name":"Youxian Sun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01921452962852331,"gpt":0.2047706582568655,"spread":0.1855561286283421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001448613,0.0009578664,0.001296557,0.0005196342,0.0004867166,0.000580853,0.001522925,0.0009060333,0.0005295158],"category_scores_gemma":[0.007150104,0.0003627668,0.0004483575,0.001051952,0.0009118441,0.002170691,0.001832238,0.001058652,0.0001587125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005682354,"about_ca_system_score_gemma":0.0007403443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001659446,"about_ca_topic_score_gemma":0.002003837,"domain_scores_codex":[0.9989349,0.0003430397,0.00004555504,0.0002147719,0.0003416413,0.0001200586],"domain_scores_gemma":[0.9960275,0.002576206,0.0004775558,0.0005284559,0.0002933003,0.0000970516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001236258,0.00005333651,0.0008454464,0.00007124231,0.00003216571,0.00005963957,0.00005689995,0.9304708,0.006515958,0.003958315,0.0007587275,0.05705393],"study_design_scores_gemma":[0.000008842311,0.00004208762,0.0001331432,0.000002955046,0.000007726845,0.00002254299,0.000005911223,0.9946844,0.001434784,0.0035116,0.0001424452,0.000003508264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03440462,0.0004341782,0.9637291,0.0002446155,0.00003053326,0.000026212,0.00003178489,0.0003861462,0.000712725],"genre_scores_gemma":[0.8917787,0.0005140575,0.1066696,0.0001295339,0.00009750478,0.00007972032,0.00009833393,0.0000668602,0.0005657353],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001659446,"threshold_uncertainty_score":0.007661104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170560434","doi":"10.1109/tpds.2013.227","title":"Optimal Load Balancing and Energy Cost Management for Internet Data Centers in Deregulated Electricity Markets","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Zhejiang University","keywords":"Computer science; Queueing theory; Electricity; Heuristic; Service-level agreement; Service provider; Energy consumption; Quality of service; Load balancing (electrical power); Service (business); The Internet; Computer network; Constraint (computer-aided design); Load management; Transmission (telecommunications); Telecommunications; Business; Engineering","authors":[{"name":"Huajie Shao","is_ca":false},{"name":"Lei Rao","is_ca":true},{"name":"Zhi Wang","is_ca":false},{"name":"Xue Liu","is_ca":true},{"name":"Zhibo Wang","is_ca":false},{"name":"Kui Ren","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01545229402561011,"gpt":0.2215913520750589,"spread":0.2061390580494488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001431419,0.001010582,0.001240211,0.000771108,0.0008112005,0.002165563,0.001352104,0.001375574,0.002456831],"category_scores_gemma":[0.00287602,0.0008517048,0.0003847822,0.001027397,0.0007884687,0.001923942,0.000942123,0.001095226,0.0002216946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002694339,"about_ca_system_score_gemma":0.002083448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01136977,"about_ca_topic_score_gemma":0.0128493,"domain_scores_codex":[0.9993669,0.0002634372,0.00001655015,0.0001054425,0.00009991695,0.0001476953],"domain_scores_gemma":[0.9990813,0.000618476,0.0001182796,0.0000200964,0.00009856255,0.00006333248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005676075,0.00003962625,0.0001857485,0.0000295156,0.00001020504,0.00002735123,0.00001700852,0.9873936,0.0003760456,0.004515692,0.0004714716,0.006876866],"study_design_scores_gemma":[0.000007878308,0.000008737449,0.00004310262,0.000001473548,0.000002082781,0.000002171126,0.00001029849,0.9981476,0.00009209766,0.001588657,0.00009392255,0.000001930453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1975894,0.001076795,0.7860906,0.001288102,0.00008827781,0.0002834467,0.0002405684,0.0003053118,0.01303763],"genre_scores_gemma":[0.9546052,0.0003188991,0.04275329,0.00007805977,0.00002895167,0.0001269228,0.00008334109,0.00005386204,0.001951523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01136977,"threshold_uncertainty_score":0.02260715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2904207032","doi":"10.1109/tpds.2018.2885519","title":"Enabling Encrypted Rich Queries in Distributed Key-Value Stores","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Scalability; Key (lock); Cryptography; Distributed computing; Information privacy; Database; Computer network; Computer security; Operating system","authors":[{"name":"Yu Guo","is_ca":false},{"name":"Xingliang Yuan","is_ca":false},{"name":"Cong Wang","is_ca":false},{"name":"Baochun Li","is_ca":true},{"name":"Xiaohua Jia","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01639953854860776,"gpt":0.2439805317976641,"spread":0.2275809932490563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001891728,0.0004003792,0.0008601111,0.0007238159,0.0008098061,0.002358642,0.002321472,0.0007516354,0.002004748],"category_scores_gemma":[0.005642521,0.0004986435,0.0004386862,0.001330405,0.001232942,0.007664431,0.00443934,0.00123949,0.0009642642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008897416,"about_ca_system_score_gemma":0.001155689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00103231,"about_ca_topic_score_gemma":0.001129447,"domain_scores_codex":[0.9970693,0.0004198726,0.0003819192,0.0003744565,0.001380252,0.0003743214],"domain_scores_gemma":[0.9943892,0.001277539,0.0004096392,0.003025883,0.00072138,0.0001762421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004861336,0.001315058,0.01221364,0.0007250484,0.0002984572,0.002298381,0.002414519,0.1378449,0.1718874,0.2393595,0.01945334,0.4073285],"study_design_scores_gemma":[0.000414781,0.0005713335,0.00114639,0.00007137648,0.0001229629,0.001255821,0.0005369183,0.6767161,0.2042428,0.08712638,0.02766449,0.0001305629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1621974,0.0007849368,0.8244057,0.0004884979,0.0001096931,0.0003757729,0.0005059576,0.006267788,0.004864341],"genre_scores_gemma":[0.8668681,0.0003066898,0.1283342,0.000157811,0.00006331312,0.0001405164,0.0005642725,0.0002127207,0.003352285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002358642,"threshold_uncertainty_score":0.01000458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139541175","doi":"10.1109/71.932715","title":"Efficient local search far DAG scheduling","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Fair-share scheduling; Two-level scheduling; Dynamic priority scheduling; Rate-monotonic scheduling; Directed acyclic graph; Scheduling (production processes); Distributed computing; Incremental heuristic search; Algorithm; Schedule; Beam search; Search algorithm; Parallel computing; Mathematical optimization; Mathematics","authors":[{"name":"Min‐You Wu","is_ca":false},{"name":"Wei Shu","is_ca":false},{"name":"Jun Gu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02467852927785577,"gpt":0.2528306202013057,"spread":0.2281520909234499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001093373,0.0005382515,0.001089887,0.0008544315,0.0008869408,0.0009693552,0.001229061,0.0007070696,0.004539149],"category_scores_gemma":[0.003479912,0.0003849342,0.0005002999,0.001533216,0.0005881714,0.001595264,0.001734627,0.0008316162,0.00146452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001012883,"about_ca_system_score_gemma":0.001511595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002528622,"about_ca_topic_score_gemma":0.004636335,"domain_scores_codex":[0.9990816,0.0003786903,0.00003349109,0.00009324228,0.0002461119,0.0001669617],"domain_scores_gemma":[0.9985713,0.0006461839,0.0001051756,0.00037379,0.0001917775,0.0001117482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006193505,0.0001778505,0.000651469,0.0002367689,0.00006266599,0.0001474577,0.0001807275,0.6978694,0.01233607,0.04624511,0.01605602,0.2254171],"study_design_scores_gemma":[0.00008236702,0.0001057194,0.0001769636,0.000008415502,0.00001551236,0.00004023773,0.00004488197,0.9673441,0.003336597,0.02467092,0.004159344,0.00001483835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03950306,0.0009536896,0.9490381,0.0003196854,0.0001011763,0.0001026008,0.0001802057,0.002778908,0.007022534],"genre_scores_gemma":[0.6616815,0.0005691359,0.3272036,0.0002117653,0.00008026144,0.0002968415,0.0007794018,0.0004040939,0.008773386],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004539149,"threshold_uncertainty_score":0.015185,"prediction_status":"machine_predicted_unvalidated"},"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":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W2051996845","doi":"10.1109/tpds.2014.2385697","title":"Optimal Online Multi-Instance Acquisition in IaaS Clouds","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Competitive analysis; Online algorithm; Purchasing; Randomized algorithm; Reservation; A priori and a posteriori; Term (time); Cloud computing; Service (business); Distributed computing; Mathematical optimization; Algorithm; Computer network; Upper and lower bounds","authors":[{"name":"Wei Wang","is_ca":true},{"name":"Ben Liang","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05817468595249795,"gpt":0.3356706275550473,"spread":0.2774959416025493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003060488,0.001381974,0.002852229,0.0006453414,0.001040191,0.002345755,0.003529481,0.001671868,0.003784328],"category_scores_gemma":[0.008208502,0.001120694,0.0009971956,0.001540951,0.0013616,0.004294275,0.002802857,0.002114011,0.0007413522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002142258,"about_ca_system_score_gemma":0.00359919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006324539,"about_ca_topic_score_gemma":0.005905026,"domain_scores_codex":[0.9968342,0.0009633699,0.0001255662,0.0007028491,0.0004634597,0.0009105811],"domain_scores_gemma":[0.995093,0.00268065,0.0005331133,0.000798641,0.00028509,0.0006095374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009463964,0.0006297746,0.002613084,0.0001139575,0.00008846704,0.0001396975,0.0001113788,0.8613009,0.002636333,0.01576345,0.00365236,0.1120042],"study_design_scores_gemma":[0.00004771782,0.00004835633,0.0002034245,0.000004074845,0.00001066561,0.00003366579,0.00002672712,0.9929526,0.0005400914,0.005839822,0.000284533,0.000008234232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2568018,0.001278148,0.7231922,0.001372475,0.000135101,0.0005260759,0.0002690368,0.00339467,0.01303052],"genre_scores_gemma":[0.8469381,0.0001250716,0.1506511,0.0002093778,0.00004486884,0.0001303515,0.0001609626,0.0001399409,0.001600287],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006324539,"threshold_uncertainty_score":0.01618558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2473099193","doi":"10.1109/tpds.2016.2586059","title":"Durable Address Translation in PCM-based Flash Storage Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Phase-change memory; Dram; Embedded system; Flash memory; Universal memory; Dynamic random-access memory; Overhead (engineering); Flash file system; Reliability (semiconductor); Non-volatile random-access memory; Computer hardware; Memory management; Semiconductor memory; Power (physics); Interleaved memory; Operating system; Computer memory; Memory refresh; Layer (electronics)","authors":[{"name":"Duo Liu","is_ca":false},{"name":"Kan Zhong","is_ca":false},{"name":"Tianzheng Wang","is_ca":true},{"name":"Yi Wang","is_ca":false},{"name":"Zili Shao","is_ca":false},{"name":"Edwin H.‐M. Sha","is_ca":false},{"name":"Jingling Xue","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0283094782003634,"gpt":0.2456543544431696,"spread":0.2173448762428062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002644216,0.0003431689,0.0002905096,0.0004332663,0.0005421728,0.000681997,0.0009954462,0.0003793665,0.001636914],"category_scores_gemma":[0.001239154,0.0001729847,0.0001288041,0.0006272831,0.0003490334,0.001190184,0.0007900071,0.0003348872,0.0004057784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003491734,"about_ca_system_score_gemma":0.0003493667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005421377,"about_ca_topic_score_gemma":0.000728938,"domain_scores_codex":[0.9996315,0.00005882058,0.00003685077,0.00005560354,0.0001645768,0.0000526103],"domain_scores_gemma":[0.9993667,0.0001325008,0.00008866926,0.0002603819,0.0001196928,0.0000320459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001041705,0.0003939872,0.005850297,0.0005849914,0.00006073647,0.00182759,0.0006765942,0.1152612,0.3998664,0.01702785,0.009055219,0.4483535],"study_design_scores_gemma":[0.0001195599,0.001017335,0.00315082,0.00004763443,0.00006533135,0.001352743,0.0002998816,0.6596443,0.301413,0.0121555,0.02068188,0.00005201739],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6695063,0.003984569,0.306304,0.0004644717,0.0002739466,0.000268435,0.0003845431,0.007671934,0.01114194],"genre_scores_gemma":[0.9774988,0.000312224,0.01991376,0.0001017211,0.00004082818,0.00005407968,0.0001311663,0.0000531622,0.00189421],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001636914,"threshold_uncertainty_score":0.005476058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103621877","doi":"10.1109/tpds.2010.95","title":"LBMP: A Logarithm-Barrier-Based Multipath Protocol for Internet Traffic Management","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Multipath propagation; Mathematical optimization; Logarithm; Multipath routing; Network packet; Convergence (economics); Routing protocol; Computer network; Distributed computing; Network congestion; Network topology; Link-state routing protocol; Mathematics","authors":[{"name":"Ke Xu","is_ca":false},{"name":"Hongying Liu","is_ca":false},{"name":"Jiangchuan Liu","is_ca":true},{"name":"Jixiu Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01770175664185266,"gpt":0.2582322459100113,"spread":0.2405304892681586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001339688,0.0007059836,0.0005849723,0.0009307039,0.0006913468,0.001079875,0.001855647,0.0008656911,0.001537835],"category_scores_gemma":[0.00362101,0.0002408426,0.000418236,0.000985065,0.0008861008,0.001642036,0.002286803,0.001929588,0.0005130094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001042257,"about_ca_system_score_gemma":0.001374242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001473954,"about_ca_topic_score_gemma":0.00146737,"domain_scores_codex":[0.9993153,0.0002045813,0.00003878091,0.00006859793,0.0002825853,0.00009013829],"domain_scores_gemma":[0.9991432,0.0003097577,0.0001244437,0.0001512776,0.0001982067,0.00007300355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005023807,0.0002551093,0.001287456,0.0002956683,0.0001006893,0.000499538,0.0003046572,0.4891411,0.04683727,0.1661783,0.01670809,0.2778898],"study_design_scores_gemma":[0.00004219123,0.00014077,0.0001737815,0.0000170338,0.00001966096,0.0001652927,0.0000303932,0.9580778,0.008412238,0.02232868,0.01054735,0.00004486883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01330389,0.0004741046,0.9798615,0.0004074191,0.000085658,0.0001412236,0.0001192955,0.002498986,0.00310792],"genre_scores_gemma":[0.678422,0.0008030061,0.3148666,0.0003276992,0.0001069234,0.0006849132,0.0004057602,0.0003028186,0.004080253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001855647,"threshold_uncertainty_score":0.00756216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978518631","doi":"10.1109/tpds.2012.327","title":"Routing Metrics for Minimizing End-to-End Delay in Multiradio Multichannel Wireless Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Computer science; Computer network; End-to-end principle; Routing (electronic design automation); Wireless; Distributed computing; Telecommunications","authors":[{"name":"Hongkun Li","is_ca":false},{"name":"Yu Cheng","is_ca":false},{"name":"Chi Zhou","is_ca":false},{"name":"Weihua Zhuang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02095546951703943,"gpt":0.2407348080849515,"spread":0.219779338567912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001838923,0.001424742,0.000800278,0.001301021,0.0004027455,0.0009131308,0.0009357839,0.0006186718,0.0005501125],"category_scores_gemma":[0.006376679,0.0002294997,0.0002730497,0.0009114923,0.0005535131,0.001745353,0.0008439348,0.0005510997,0.0001101154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001224502,"about_ca_system_score_gemma":0.0007574307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008145494,"about_ca_topic_score_gemma":0.001146466,"domain_scores_codex":[0.998997,0.000418807,0.00007993979,0.000122668,0.0003274632,0.00005410106],"domain_scores_gemma":[0.9978045,0.001194522,0.0005082022,0.000114881,0.0003127151,0.00006524754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004548598,0.00003965887,0.001045474,0.0002081233,0.00005055567,0.00002612915,0.00007115514,0.9147514,0.008361599,0.01963468,0.0005937931,0.05517187],"study_design_scores_gemma":[0.000005695185,0.0001388536,0.000393808,0.00002121581,0.00001874827,0.0000422192,0.00003221399,0.98825,0.003302787,0.006535728,0.001239125,0.00001949453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03415,0.002869714,0.96109,0.0001743,0.00006788164,0.00007982294,0.00007139012,0.0001397563,0.001357171],"genre_scores_gemma":[0.654422,0.00186653,0.3421349,0.00006779124,0.00008678705,0.0002126264,0.0001551094,0.00009523125,0.0009590689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001838923,"threshold_uncertainty_score":0.009725273,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136795155","doi":"10.1109/tpds.2009.130","title":"On the Benefits of Cooperative Proxy Caching for Peer-to-Peer Traffic","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nokia (Canada); Simon Fraser University","funders":"","keywords":"Computer science; Computer network; Byte; Cache; False sharing; The Internet; Distributed computing; Peer-to-peer; Proxy (statistics); Internet traffic; Overhead (engineering); CPU cache; Cache algorithms; World Wide Web","authors":[{"name":"Mohamed Hefeeda","is_ca":true},{"name":"Behrooz Noorizadeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02616521068331229,"gpt":0.2469366942682497,"spread":0.2207714835849374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001861242,0.0007354369,0.0007671897,0.0007264207,0.0008345457,0.001307562,0.001223639,0.001404553,0.001158623],"category_scores_gemma":[0.01530096,0.0003150321,0.0004060175,0.001106049,0.0009754698,0.003768617,0.0008739617,0.0008047137,0.0002034343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001755316,"about_ca_system_score_gemma":0.0009704382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005222696,"about_ca_topic_score_gemma":0.004401028,"domain_scores_codex":[0.9984615,0.0007027857,0.00003000865,0.0001405277,0.0004183419,0.0002468839],"domain_scores_gemma":[0.9876301,0.009282541,0.0004856685,0.001030947,0.00132723,0.0002435523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004454105,0.0002851377,0.007113711,0.0001363884,0.00009003053,0.0003517757,0.0002904337,0.883844,0.009037541,0.05279805,0.001617859,0.04398958],"study_design_scores_gemma":[0.00002116869,0.0001815789,0.001594293,0.00001632257,0.00006457562,0.0001841926,0.0001623083,0.9829289,0.002045742,0.01194389,0.0008337303,0.00002345086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8268764,0.003410372,0.1480876,0.001442045,0.00007056007,0.00007956975,0.0001065096,0.0003393158,0.01958758],"genre_scores_gemma":[0.9961585,0.0003218246,0.003110789,0.00003395278,0.00002648958,0.000009120307,0.00001415542,0.00001274309,0.0003124426],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005222696,"threshold_uncertainty_score":0.01273572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085957933","doi":"10.1109/71.983940","title":"Performance of CORBA-based client-server architectures","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"University of Saskatchewan","keywords":"Common Object Request Broker Architecture; Computer science; Orb (optics); Object request broker; Server; Middleware (distributed applications); Operating system; Client–server model; Distributed computing; Workstation; Client; Distributed object","authors":[{"name":"Istabrak Abdul-Fatah","is_ca":false},{"name":"Shikharesh Majumdar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01960215703365277,"gpt":0.2162026422452103,"spread":0.1966004852115575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003997676,0.001305385,0.0009100756,0.001450564,0.001321055,0.002876699,0.002636451,0.001255952,0.003940978],"category_scores_gemma":[0.01049187,0.0005662348,0.0004296066,0.0021874,0.0006452141,0.002012263,0.001152917,0.001090264,0.002362622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002556199,"about_ca_system_score_gemma":0.00220947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01148995,"about_ca_topic_score_gemma":0.003482344,"domain_scores_codex":[0.9907323,0.002080194,0.0004694565,0.0006129693,0.005084026,0.001021151],"domain_scores_gemma":[0.9931391,0.001916873,0.0003163741,0.001062728,0.003206083,0.0003589093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005794745,0.002109303,0.01895858,0.001020826,0.0004740353,0.0006540564,0.001550357,0.5522063,0.1582635,0.01999076,0.01596422,0.2230133],"study_design_scores_gemma":[0.0001634363,0.0007796896,0.01200725,0.00004200768,0.00009333598,0.000187199,0.0003205762,0.9033305,0.07058363,0.003491561,0.008885965,0.0001147504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.854955,0.001765349,0.08100373,0.0007461402,0.0002779999,0.000355827,0.0007963383,0.0212492,0.03885044],"genre_scores_gemma":[0.9818643,0.0003281159,0.01253259,0.00005616132,0.00002007944,0.0001195221,0.0009869026,0.000426707,0.003665606],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01148995,"threshold_uncertainty_score":0.02284616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}