{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003343614,0.0002600464,0.0003290389,0.0001499606,0.0003147599,0.0003020531,0.0002492249,0.0001752508,0.000008215272],"category_scores_gemma":[0.000007193562,0.0002576953,0.00005211012,0.000594082,0.00006640093,0.0003470347,0.000005168527,0.0003440848,0.000005115657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008291468,"about_ca_system_score_gemma":0.00001742383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001487421,"about_ca_topic_score_gemma":0.00004342808,"domain_scores_codex":[0.9980897,0.0001774871,0.0004842543,0.0005544281,0.0002575899,0.0004365287],"domain_scores_gemma":[0.9987889,0.0004808458,0.0001511948,0.0003267504,0.00007543519,0.000176863],"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.00001152495,0.0001286558,0.0001686121,0.00004421061,0.00001570338,0.00003383116,0.0001963766,0.9136798,0.00002347142,0.0004293396,0.00009500881,0.08517347],"study_design_scores_gemma":[0.001242332,0.00008985666,0.0006738628,0.0002150372,0.00001162633,0.00004644865,0.0001001767,0.9972638,0.00001725699,0.00001835851,0.00004823395,0.0002729712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01180821,0.0006611022,0.9860955,0.0002316802,0.0004937478,0.0004276209,0.00004174413,0.0001458155,0.00009452336],"genre_scores_gemma":[0.9974515,0.0001172945,0.002072372,0.00005870672,0.0000489543,0.0001735459,0.00001264441,0.00001580457,0.00004922258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9856433,"threshold_uncertainty_score":0.9999875,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000385074,0.0001368315,0.0001898651,0.00005946228,0.0003955044,0.0001842952,0.0004727885,0.0000727998,8.298766e-7],"category_scores_gemma":[0.000006531815,0.00009562152,0.00005497071,0.0002948896,0.00005367794,0.0001511948,0.000002257048,0.0001226262,0.000005068492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002038716,"about_ca_system_score_gemma":0.00003951365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002130059,"about_ca_topic_score_gemma":8.530575e-7,"domain_scores_codex":[0.998863,0.0001727699,0.0003299743,0.0002346722,0.0001968096,0.0002027304],"domain_scores_gemma":[0.9990807,0.0002052088,0.0001230011,0.0004131838,0.00009862542,0.00007934017],"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.00002841993,0.00007420064,0.000002350063,0.000005643486,0.00001836387,0.00000206904,0.00007139816,0.9853373,0.0001259945,0.005499585,0.001678329,0.007156303],"study_design_scores_gemma":[0.0004249692,0.0003570194,0.0001077611,0.00004867154,0.00001095235,0.00003232759,0.00004100341,0.9955909,0.000701873,0.001044476,0.001454945,0.0001851296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001032552,0.000382062,0.9980537,0.0004570878,0.0002295598,0.0003089228,0.00001781829,0.0002191823,0.0002283619],"genre_scores_gemma":[0.9861876,0.000234297,0.01327275,0.00005383329,0.00001208587,0.00002632135,0.000002641878,0.000003899868,0.0002065788],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9860843,"threshold_uncertainty_score":0.3899332,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002407044,0.000257937,0.0003608862,0.0000850302,0.0005557929,0.0004399566,0.002098129,0.00019836,8.89657e-7],"category_scores_gemma":[0.0002979732,0.0002349207,0.00005879832,0.0004409988,0.00006941047,0.0002025821,0.0002361335,0.0003428897,0.000007413641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005672304,"about_ca_system_score_gemma":0.00003328322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004333506,"about_ca_topic_score_gemma":0.000004519058,"domain_scores_codex":[0.9982671,0.0001268687,0.0003669918,0.0006697708,0.0002059655,0.0003633662],"domain_scores_gemma":[0.9984241,0.0001925362,0.000137841,0.0009710531,0.00007615831,0.0001983836],"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.001342103,0.0006835982,0.0008890326,0.008264794,0.001735731,0.0003378617,0.002385649,0.8336174,0.02004264,0.02106767,0.07979628,0.0298372],"study_design_scores_gemma":[0.001034852,0.0002799093,0.00001494362,0.0001410162,0.00002538262,0.00006686941,0.0004240518,0.9946303,0.0007721533,0.000263402,0.002062049,0.0002850875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01460432,0.0003737917,0.9759378,0.006322091,0.0003120261,0.0006701893,0.0004640864,0.001294854,0.00002077213],"genre_scores_gemma":[0.9904319,0.00004377667,0.009174752,0.00005455819,0.00003167316,0.0001896962,0.00003309077,0.00001754892,0.0000230185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9758276,"threshold_uncertainty_score":0.957979,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003203808,0.0002311391,0.0003100065,0.000105998,0.0006008047,0.0005059283,0.002412037,0.0003132423,0.000007294144],"category_scores_gemma":[0.001455392,0.0002290226,0.00009571117,0.0006977987,0.00009615199,0.000256471,0.0001577027,0.0005978411,0.00001253027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001281323,"about_ca_system_score_gemma":0.0001118514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002210705,"about_ca_topic_score_gemma":0.00001330298,"domain_scores_codex":[0.9979104,0.0002470346,0.000437928,0.0006977309,0.0002665661,0.0004403251],"domain_scores_gemma":[0.9971867,0.0006768875,0.0001212062,0.001706753,0.0001652575,0.0001432563],"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.0007599877,0.001527263,0.0001315359,0.0008220763,0.0008108913,0.0001656529,0.0009586571,0.7294403,0.003946935,0.06121911,0.02093074,0.1792869],"study_design_scores_gemma":[0.0004373831,0.0001148228,0.00003237351,0.0001789024,0.00002340805,0.00007462986,0.000410007,0.9695936,0.001073901,0.02295326,0.004817561,0.0002901223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001629249,0.0006071421,0.9890108,0.006862088,0.0005194611,0.0004265751,0.0001938409,0.0007248973,0.0000260203],"genre_scores_gemma":[0.9089831,0.0002529983,0.09015556,0.00006216303,0.00001588492,0.0002088417,0.0002086978,0.00001644693,0.00009627635],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9073539,"threshold_uncertainty_score":0.9339269,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000826564,0.0003469684,0.0003663815,0.0001702093,0.0008773587,0.0003761902,0.0006294881,0.0004023354,0.000001916286],"category_scores_gemma":[0.00001212478,0.000353744,0.00007913106,0.0007860041,0.00007494491,0.0004418943,0.000009147331,0.0003348187,0.00000198567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001486963,"about_ca_system_score_gemma":0.00004449166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002805115,"about_ca_topic_score_gemma":0.00006569471,"domain_scores_codex":[0.9970744,0.0001920971,0.0006938458,0.0009800048,0.0004251009,0.0006345667],"domain_scores_gemma":[0.9974049,0.0007070134,0.000328895,0.001063358,0.0001894376,0.0003063513],"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.0001268504,0.000307241,0.00004074506,0.00001776563,0.00004008723,0.000004945924,0.00009187754,0.9878917,0.0001257622,0.005443118,0.0007059532,0.005204008],"study_design_scores_gemma":[0.0007047,0.0002081304,0.0000452565,0.0001038536,0.00003117,0.00002912991,0.0002732291,0.9973369,0.0001852701,0.0000428823,0.0006392598,0.0004001742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008119274,0.0003137596,0.9879124,0.0001016836,0.002317669,0.0004989318,0.0002884166,0.0004273875,0.0000204691],"genre_scores_gemma":[0.9760659,0.00007261566,0.02263235,0.0000702057,0.0001979589,0.00008473796,0.0007551871,0.00003641647,0.00008461239],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9679466,"threshold_uncertainty_score":0.9998915,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006130421,0.0001987522,0.0002810905,0.0002185574,0.0003141998,0.0001414865,0.0003916061,0.0003012497,0.000002230515],"category_scores_gemma":[0.00000517867,0.0002021461,0.00007266379,0.0006488761,0.00004264217,0.000109711,0.000007172875,0.0003023534,0.000009747061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009939872,"about_ca_system_score_gemma":0.00003352288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007608691,"about_ca_topic_score_gemma":0.00004085155,"domain_scores_codex":[0.9983489,0.0001095013,0.0004308055,0.0005681253,0.0001610012,0.0003816771],"domain_scores_gemma":[0.9989516,0.0001734096,0.0001520522,0.0005355041,0.00009172971,0.00009576387],"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.0000254986,0.0001849513,0.00003908501,0.00004113269,0.00002877568,9.038415e-7,0.0001213094,0.8884976,0.0001499712,0.1053669,0.0001810477,0.005362859],"study_design_scores_gemma":[0.0009046576,0.000127008,0.00008351963,0.00004002258,0.000008345667,0.00002759,0.0002584832,0.9941735,0.00008282853,0.002186512,0.001888135,0.0002193944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01639781,0.0001472699,0.9800664,0.001280415,0.0006181389,0.001092671,0.00004094229,0.0003214334,0.00003492993],"genre_scores_gemma":[0.9968865,0.00001535974,0.002567031,0.00007362819,0.00004166435,0.0002810969,0.0000396125,0.00001255479,0.00008258771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9804887,"threshold_uncertainty_score":0.824328,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003488657,0.0003926924,0.0006111812,0.0001316263,0.000591915,0.0004017132,0.0002612607,0.0002132153,0.0000020745],"category_scores_gemma":[0.000003794675,0.0003272252,0.0001624548,0.000464317,0.0001037992,0.0002363438,0.000003731559,0.0002906038,0.000003447315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008451776,"about_ca_system_score_gemma":0.00004744307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003106313,"about_ca_topic_score_gemma":0.00007695592,"domain_scores_codex":[0.997632,0.0001773614,0.0005204904,0.0007281419,0.0003309584,0.0006110629],"domain_scores_gemma":[0.998422,0.0005195992,0.0002226462,0.0005128917,0.0001721722,0.0001507074],"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.0003931427,0.0002140769,0.00004918636,0.00004994134,0.00008429838,0.00002479716,0.00003318903,0.9944379,0.0002934809,0.00376123,0.00009483998,0.00056397],"study_design_scores_gemma":[0.00528872,0.0002283317,0.00008401631,0.0001755901,0.00005086816,0.0001103669,0.00006595892,0.9929349,0.0003090701,0.00004524464,0.0002596076,0.0004473701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07051774,0.0002427071,0.9268437,0.0001406707,0.0007929521,0.0008549151,0.0001478372,0.0003685364,0.00009093581],"genre_scores_gemma":[0.9949627,0.00003780682,0.004318919,0.00006142766,0.000148475,0.0002550219,0.00004779915,0.00003434907,0.0001335185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.924445,"threshold_uncertainty_score":0.999918,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003065642,0.0002289436,0.0003148599,0.0001065111,0.0001739529,0.000150663,0.0002206095,0.0001809467,0.00000332119],"category_scores_gemma":[0.000001953939,0.0001984569,0.00004964845,0.0008142683,0.00005050958,0.0002959407,0.000001460867,0.0002466441,0.000009242242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001074128,"about_ca_system_score_gemma":0.00004180329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008007592,"about_ca_topic_score_gemma":0.000218624,"domain_scores_codex":[0.9982272,0.0002488996,0.0004190647,0.0005165992,0.0002455743,0.0003426866],"domain_scores_gemma":[0.9990047,0.0001318023,0.0001411142,0.0005029268,0.00007135195,0.0001481554],"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.0001076714,0.0001273225,0.0001262975,0.00001688527,0.00002402025,0.000008100506,0.00006913332,0.9840161,0.00002724941,0.004174352,0.00006624516,0.01123661],"study_design_scores_gemma":[0.002202557,0.0001379081,0.0002515968,0.00006935585,0.00001703853,0.00004575688,0.00006952726,0.994966,0.00003533443,0.000124241,0.001813733,0.0002669952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007368637,0.0006895435,0.9904761,0.00005759039,0.0002940121,0.0008534584,0.00001747466,0.0001522019,0.00009100809],"genre_scores_gemma":[0.9977242,0.000148261,0.001436099,0.00003354828,0.00002122418,0.0005193072,0.00002891034,0.00001517556,0.00007326371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9903556,"threshold_uncertainty_score":0.8092836,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002919649,0.0002429544,0.0002718051,0.0001451332,0.0004422016,0.000386311,0.0004753168,0.0001939277,0.000008199556],"category_scores_gemma":[0.000008440235,0.0002180775,0.00008137873,0.0004129717,0.00007661355,0.0002991785,0.000006386447,0.0004316157,0.00002872489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000271828,"about_ca_system_score_gemma":0.00005452854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000219509,"about_ca_topic_score_gemma":0.00003247657,"domain_scores_codex":[0.9984145,0.00008221654,0.0003716912,0.0004938041,0.0002750698,0.0003627279],"domain_scores_gemma":[0.9988843,0.0001028806,0.0001230413,0.0005453537,0.0001378525,0.0002065978],"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.00007463966,0.0009395067,0.0001908843,0.0001535266,0.0001860714,0.00005596783,0.0005672851,0.8595603,0.0021741,0.05074704,0.005705204,0.07964548],"study_design_scores_gemma":[0.001658722,0.0003642961,0.0008098809,0.0001116015,0.00004140697,0.0002768488,0.00010175,0.9764302,0.001463918,0.0009131967,0.01681666,0.001011482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004282939,0.00005913933,0.992535,0.0003007568,0.001272574,0.0003511659,0.00008538886,0.0009502841,0.0001627863],"genre_scores_gemma":[0.928921,0.00002369261,0.07043195,0.00005258453,0.00005940712,0.0001149923,0.00002010681,0.00001321019,0.0003630877],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.924638,"threshold_uncertainty_score":0.8892943,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003840081,0.000224274,0.0003125342,0.0001071883,0.000908904,0.0005366436,0.0009098058,0.00028182,0.000004072562],"category_scores_gemma":[0.0006338709,0.000222494,0.00006576835,0.0007140898,0.00006813408,0.0002048324,0.0001532303,0.0004121869,0.000005953846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001212222,"about_ca_system_score_gemma":0.00007559515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006989338,"about_ca_topic_score_gemma":0.00001625729,"domain_scores_codex":[0.9980124,0.0002423929,0.0004296271,0.0007047747,0.0002580991,0.0003527293],"domain_scores_gemma":[0.9982231,0.0003931026,0.000153625,0.0008675962,0.0002441344,0.0001184114],"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.0001377229,0.0004846656,0.0002252957,0.0004362663,0.0002603063,0.00001935539,0.0001816215,0.9777045,0.001525105,0.005770941,0.006556297,0.006697896],"study_design_scores_gemma":[0.0006355604,0.0001385209,0.0003144461,0.0001318249,0.0000222081,0.0001003929,0.0003700732,0.9946945,0.001054854,0.001257411,0.001010409,0.0002698173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01507784,0.0003038696,0.9789199,0.002177995,0.0007715684,0.0003849852,0.0002161649,0.002137168,0.00001048004],"genre_scores_gemma":[0.9733777,0.0000979177,0.02612963,0.00003207052,0.00002863602,0.0001771336,0.00007721342,0.00001376292,0.00006595745],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9582998,"threshold_uncertainty_score":0.9073042,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003590032,0.0002210768,0.0002644226,0.0001356886,0.0002503987,0.0001205389,0.0003670797,0.00009358118,0.00000198425],"category_scores_gemma":[0.000004680118,0.0001363328,0.00007693079,0.0002732125,0.00005425838,0.00003473768,0.00001451024,0.0001611941,0.000047625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001154691,"about_ca_system_score_gemma":0.00001411609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007318956,"about_ca_topic_score_gemma":0.00001095772,"domain_scores_codex":[0.9982157,0.0001424257,0.000417513,0.0005352528,0.0002562295,0.0004328689],"domain_scores_gemma":[0.9991765,0.0001508157,0.0001062185,0.0004069092,0.00001337137,0.0001462077],"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.00001834301,0.0002184998,0.0003927955,0.00002141232,0.00003462611,0.00002925131,0.0001687078,0.9680699,0.000215018,0.0002182163,0.00002534785,0.03058791],"study_design_scores_gemma":[0.001908701,0.00008660023,0.00169642,0.0004092524,0.000009997627,0.00002463699,0.0001240241,0.9941105,0.00006606077,0.00003951579,0.00122161,0.0003026351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1116723,0.000141574,0.8865586,0.0004247392,0.0007929098,0.0002451701,0.0000162937,0.0001258479,0.00002255863],"genre_scores_gemma":[0.9955019,0.00002610934,0.003891116,0.0000397423,0.00004696402,0.00002161494,0.000001289077,0.00001109278,0.000460174],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8838295,"threshold_uncertainty_score":0.5559489,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002125439,0.0002456671,0.0003813484,0.00009217799,0.000243222,0.0001536538,0.000217535,0.0001457402,0.000003298206],"category_scores_gemma":[4.469891e-7,0.000186369,0.00005591281,0.0003225054,0.0001005776,0.0003140326,0.000002722822,0.0002020868,0.000004241147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002540222,"about_ca_system_score_gemma":0.00004824136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000120955,"about_ca_topic_score_gemma":0.00003939958,"domain_scores_codex":[0.9985349,0.00007680274,0.0004233981,0.0004136465,0.0002277695,0.0003235536],"domain_scores_gemma":[0.9991827,0.00009914998,0.0001580762,0.0003512102,0.00009149756,0.000117378],"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.0002379189,0.0001676645,0.0001963241,0.0002383216,0.00004493013,0.000006434887,0.00008955802,0.993919,0.000170696,0.0001872555,0.0004248553,0.004317059],"study_design_scores_gemma":[0.002320505,0.000679861,0.000908709,0.0002848094,0.00003577404,0.0001019454,0.000031599,0.9940714,0.0003136388,0.00001822213,0.0009024141,0.0003311709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2283562,0.0001481208,0.7693823,0.0001034943,0.0001613521,0.001618704,0.00005932041,0.00008603689,0.0000844977],"genre_scores_gemma":[0.9978474,0.0000511297,0.0009350792,0.00002394514,0.00006018849,0.0008369511,0.0000146511,0.00001205685,0.0002185548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7694913,"threshold_uncertainty_score":0.7599909,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006419184,0.0002813448,0.0003726832,0.000198009,0.0003490262,0.0003406892,0.0004876783,0.0001338,6.008557e-7],"category_scores_gemma":[0.000007189778,0.0002596675,0.00009026362,0.000424809,0.00004777245,0.00002932805,0.00001422065,0.0002498247,0.0000283124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000121768,"about_ca_system_score_gemma":0.00001679328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000520553,"about_ca_topic_score_gemma":0.00003107181,"domain_scores_codex":[0.9976293,0.0003865823,0.0005719607,0.000642329,0.0003269593,0.0004428706],"domain_scores_gemma":[0.9988353,0.0001934963,0.0001697653,0.0005753578,0.00005598606,0.000170101],"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.00001137754,0.0001683532,0.00005923219,0.00008811896,0.00003266528,0.00001003055,0.0003228915,0.9949119,0.00004455577,0.0005757639,0.0001272715,0.003647851],"study_design_scores_gemma":[0.001031213,0.0001098311,0.0002720317,0.0001790571,0.00001247594,0.00006558929,0.0002296542,0.9944481,0.00001731677,0.000009533937,0.003333303,0.0002919211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08473062,0.0002710048,0.9128532,0.0002054175,0.001062972,0.0004352932,0.00001465536,0.0003222209,0.000104589],"genre_scores_gemma":[0.9986785,0.000005252667,0.0008409156,0.00007617345,0.0001102541,0.00004224693,0.000009085506,0.00001644073,0.0002211482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9139479,"threshold_uncertainty_score":0.9999856,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001830538,0.0002682887,0.0003107783,0.0002677901,0.0002404725,0.0003012844,0.0003718378,0.0002393432,0.00003552892],"category_scores_gemma":[0.000007902582,0.0002519916,0.0000553908,0.0009869315,0.00008405984,0.0004050606,0.000004994561,0.0002846229,0.0001806368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001792813,"about_ca_system_score_gemma":0.00004582739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008700208,"about_ca_topic_score_gemma":0.000006226146,"domain_scores_codex":[0.9982052,0.0001596782,0.0004277629,0.0005227669,0.0002695954,0.0004149359],"domain_scores_gemma":[0.9989218,0.0002029215,0.0001295523,0.0005306482,0.0001062068,0.0001089099],"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.000009432153,0.0001106753,0.00008440883,0.00002226025,0.00001328588,0.000006710789,0.00002195816,0.9930785,0.00005838019,0.0003175873,0.0006821048,0.005594654],"study_design_scores_gemma":[0.0007329861,0.00011726,0.0002004382,0.0001518601,0.000006952814,0.00000980324,0.00004564328,0.9982745,0.00008366789,0.00003953918,0.00006588523,0.0002714564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007663874,0.000075899,0.9899673,0.0004465011,0.0003945881,0.0006627434,0.00002743851,0.000615133,0.0001465572],"genre_scores_gemma":[0.9980176,0.00003647371,0.001338546,0.00007316173,0.00003587341,0.0002107237,0.00003745024,0.00001951712,0.0002306283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9903538,"threshold_uncertainty_score":0.9999932,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006636114,0.0003755819,0.0004594075,0.0002013531,0.0005436764,0.0002223023,0.0005105509,0.0003153415,0.000001603508],"category_scores_gemma":[0.0000306117,0.0003866953,0.0001232952,0.000883182,0.00008386909,0.0003070637,0.000007064863,0.0005781316,0.000006314252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001621043,"about_ca_system_score_gemma":0.0000843891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002373478,"about_ca_topic_score_gemma":0.0000554331,"domain_scores_codex":[0.9972726,0.0002932927,0.0007358454,0.0007528357,0.0002791571,0.0006663029],"domain_scores_gemma":[0.9981573,0.000445275,0.0003127285,0.000657045,0.0002336497,0.000193962],"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.000167687,0.0002597099,0.0002242953,0.0001882686,0.00004105563,0.000007918758,0.001172764,0.9927942,0.0001871382,0.0001694233,0.00004843704,0.004739105],"study_design_scores_gemma":[0.001558312,0.0001706135,0.0001631687,0.0004270781,0.00001551368,0.00001925551,0.0005360118,0.9961328,0.0004262867,0.00001799371,0.00009836206,0.0004346323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1571927,0.0001170121,0.8400173,0.0000886336,0.0007278024,0.001480597,0.00003032879,0.0003211662,0.00002441021],"genre_scores_gemma":[0.9898087,0.00001888901,0.009143539,0.00007962764,0.0001392857,0.0007159564,0.0000270915,0.00003782859,0.00002908139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.832616,"threshold_uncertainty_score":0.9998585,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007316149,0.000166171,0.0002432777,0.0001242732,0.0003503543,0.0006369625,0.000993354,0.00008846918,5.341403e-7],"category_scores_gemma":[0.00001563682,0.0001218528,0.00004216855,0.0004331083,0.00006209921,0.0005552353,0.00001311536,0.0001746232,0.000001665972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001302452,"about_ca_system_score_gemma":0.00003739392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000803212,"about_ca_topic_score_gemma":0.0002362879,"domain_scores_codex":[0.9986245,0.0001865228,0.0002686192,0.0004615791,0.0001645046,0.0002942643],"domain_scores_gemma":[0.9986003,0.0003091414,0.00007998729,0.0008771214,0.00003587438,0.00009756406],"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.001536668,0.002182542,0.002898353,0.001896633,0.0007123296,0.00003938325,0.006266911,0.4512305,0.0004511498,0.4181868,0.03812195,0.07647675],"study_design_scores_gemma":[0.003788078,0.0001681292,0.0007869602,0.00008520192,0.0000541833,0.00005835095,0.0003672522,0.8984629,0.00001443255,0.003995669,0.09182581,0.0003930355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002341144,0.0002500442,0.9918596,0.001441,0.0006279355,0.0005134771,0.002875485,0.00005656226,0.00003481972],"genre_scores_gemma":[0.9987816,0.00009257195,0.0002978544,0.0003664558,0.0002038468,0.00009869332,0.0001502682,0.000005950543,0.000002714893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9964405,"threshold_uncertainty_score":0.6142244,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001704058,0.0002005358,0.0002163472,0.00006252914,0.0003309851,0.000367871,0.0005647538,0.0000671462,0.000004817197],"category_scores_gemma":[0.000001463315,0.0001528383,0.00003478966,0.0002834552,0.00002389947,0.0001121822,0.0000147467,0.00008222171,0.000007761269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006161063,"about_ca_system_score_gemma":0.00004360829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001805023,"about_ca_topic_score_gemma":0.0001614631,"domain_scores_codex":[0.9985784,0.00006182227,0.000285865,0.0005188677,0.0002573161,0.0002977687],"domain_scores_gemma":[0.9988211,0.0000785385,0.0001121846,0.0006850224,0.0001900702,0.0001130302],"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.00002970232,0.0001100137,0.00004560452,0.00006137072,0.0000681713,0.000003144709,0.0000830668,0.9948797,0.000005933688,0.0001723887,0.001586464,0.002954503],"study_design_scores_gemma":[0.001142393,0.00009838341,0.00002840893,0.0001086682,0.00002256458,0.00004267557,0.000137264,0.9921038,0.000008330378,0.000008586323,0.006089556,0.0002093755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002716987,0.00009801149,0.9950065,0.0007845696,0.0003542512,0.000557308,0.0001998645,0.0001843311,0.00009818494],"genre_scores_gemma":[0.9915612,0.000009377864,0.007505542,0.0002129023,0.00004836429,0.0002537874,0.0001387443,0.00001355287,0.0002564763],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9888443,"threshold_uncertainty_score":0.6232566,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009166266,0.0002918079,0.0004317125,0.0001589489,0.0008110162,0.0005106522,0.0007135068,0.0001707507,0.000001228743],"category_scores_gemma":[0.00002785456,0.0002861063,0.00005896103,0.0003802158,0.00009160873,0.0009079625,0.00003631328,0.0002676484,0.00001206926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000118038,"about_ca_system_score_gemma":0.00005794061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002179757,"about_ca_topic_score_gemma":0.0000381701,"domain_scores_codex":[0.9977068,0.0001882545,0.0005156301,0.0006755187,0.0002834514,0.0006303156],"domain_scores_gemma":[0.9978691,0.0004739435,0.0001822702,0.001063365,0.00007927757,0.0003320136],"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.0004182376,0.002963761,0.00185949,0.00332476,0.001703502,0.0000545986,0.01203358,0.9043247,0.001542908,0.03271599,0.02022355,0.0188349],"study_design_scores_gemma":[0.0008865682,0.00007864396,0.0002453121,0.0001112103,0.00006847487,0.0001953956,0.0008392606,0.9870224,0.000006490952,0.00001582074,0.01017811,0.0003523244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02737684,0.002780401,0.9591677,0.0001113501,0.003020518,0.0008287768,0.006423461,0.0002733064,0.00001765559],"genre_scores_gemma":[0.9970924,0.00009016928,0.001888547,0.00002150121,0.0002025109,0.00007128419,0.0005443295,0.00002048995,0.00006881647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9697155,"threshold_uncertainty_score":0.9999591,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006313408,0.000155893,0.0001637192,0.00008953656,0.0003210914,0.0001653825,0.0002989137,0.0000679828,7.299748e-7],"category_scores_gemma":[0.000003354409,0.0001117837,0.0000555632,0.000298181,0.00004176871,0.00001594467,0.000009499893,0.0001582214,0.000004709203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003972067,"about_ca_system_score_gemma":0.000004163629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002945159,"about_ca_topic_score_gemma":0.000001765731,"domain_scores_codex":[0.9987512,0.0001292633,0.0002326636,0.0002944251,0.0002237501,0.000368739],"domain_scores_gemma":[0.9991464,0.0002971241,0.00006143351,0.0003863593,0.00001384987,0.00009484275],"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.00006347877,0.0004551233,0.00007663395,0.0001709151,0.00009002695,0.000007274897,0.003787255,0.9195382,0.000002152523,0.06023443,0.001458144,0.01411634],"study_design_scores_gemma":[0.001734198,0.0002102961,0.001840804,0.0002272121,0.00007675449,0.00004699866,0.005877548,0.9352841,0.00000727421,0.00070802,0.05355681,0.0004299255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04694853,0.000599403,0.9501823,0.0006228585,0.0005181369,0.0007038989,0.00002620004,0.00007198246,0.0003266599],"genre_scores_gemma":[0.9971138,0.00001250794,0.002354772,0.0001423678,0.0000873617,0.0001890362,0.000002669326,0.000006696288,0.00009081863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9501653,"threshold_uncertainty_score":0.4558407,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000239625,0.0001831461,0.0002518602,0.00004982072,0.0005127797,0.0004697662,0.0002251635,0.0001319173,0.000005754503],"category_scores_gemma":[0.000006769651,0.0001228862,0.00006088077,0.0002869201,0.00005461529,0.000282492,0.000003417719,0.0001863153,0.00001173018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002757644,"about_ca_system_score_gemma":0.00004298639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003423568,"about_ca_topic_score_gemma":0.000007988298,"domain_scores_codex":[0.9988973,0.00008088593,0.0002397794,0.0003794655,0.0001569131,0.0002456507],"domain_scores_gemma":[0.9987666,0.0006054364,0.0001095858,0.0003182372,0.0001065521,0.00009358508],"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.0002984038,0.0001272664,0.0001004773,0.0001470742,0.0001744592,0.000002878066,0.00145654,0.9643937,0.00006198652,0.02251557,0.001099184,0.009622464],"study_design_scores_gemma":[0.001515792,0.0001417567,0.00008149511,0.0001098284,0.00004294265,0.00002462551,0.0003522582,0.9936381,0.00007834192,0.001102687,0.002672317,0.0002398671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002877724,0.0007705959,0.9937147,0.0006683874,0.0008796789,0.0008298762,0.00007707865,0.0001124348,0.00006951953],"genre_scores_gemma":[0.9917579,0.0001759427,0.007098081,0.00009871229,0.0000596769,0.0002308465,0.00001084424,0.00001074786,0.0005572694],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9888802,"threshold_uncertainty_score":0.5011153,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007408895,0.0002245178,0.0002905648,0.0001812262,0.000408966,0.0003793188,0.0007736948,0.0001451555,0.000008207298],"category_scores_gemma":[0.00005769769,0.0002283579,0.00007416134,0.0006452912,0.00005422597,0.0004123322,0.00002017215,0.0003191111,0.00002779999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001276218,"about_ca_system_score_gemma":0.00007090899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004156249,"about_ca_topic_score_gemma":0.00008797499,"domain_scores_codex":[0.9977365,0.0003920919,0.0005555031,0.0005993873,0.0003362631,0.0003802668],"domain_scores_gemma":[0.9983298,0.0002840282,0.0001611533,0.000942142,0.00009939192,0.0001834387],"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.0001534883,0.001735056,0.001311963,0.0008347763,0.00006793292,0.00001499151,0.001737893,0.9573677,0.0009507585,0.02885343,0.003040084,0.003931921],"study_design_scores_gemma":[0.001331743,0.00007846337,0.00285643,0.0001726707,0.0000090114,0.000010051,0.000046795,0.9920808,0.00004674811,0.0004589153,0.002659549,0.0002488333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002785542,0.000007963069,0.9847468,0.0006439849,0.0004396125,0.0107879,0.0002257252,0.000285617,0.00007688798],"genre_scores_gemma":[0.9883429,4.897347e-7,0.00474207,0.00003952856,0.00005426591,0.006726832,0.00006329754,0.00001096197,0.00001967966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9855573,"threshold_uncertainty_score":0.9312165,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003411917,0.0004051107,0.0005263621,0.0001708955,0.0003345016,0.000212633,0.0004806946,0.0003327406,0.00003137401],"category_scores_gemma":[0.000002045693,0.0003774464,0.0001144888,0.000761147,0.0001057128,0.0004508133,0.000009434296,0.000433705,0.00003103835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001658203,"about_ca_system_score_gemma":0.0001156828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004645068,"about_ca_topic_score_gemma":0.00008975255,"domain_scores_codex":[0.997277,0.0002099002,0.0007998291,0.000718982,0.0003220592,0.0006722885],"domain_scores_gemma":[0.9985594,0.0001302023,0.0002033008,0.000635645,0.0001301213,0.0003412893],"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.0001704304,0.0006159179,0.0006288636,0.00005920197,0.0001006836,0.0002860218,0.0004819018,0.9726516,0.000005123971,0.003128105,0.0007474124,0.02112474],"study_design_scores_gemma":[0.001209997,0.0002239509,0.0005832191,0.0001367459,0.00003529335,0.0001868207,0.0001338753,0.9964556,0.000006076231,0.000168505,0.0004112105,0.000448698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002766318,0.0007798224,0.9935358,0.00005657656,0.001342618,0.0005638195,0.000250565,0.0002873258,0.0004171901],"genre_scores_gemma":[0.9980337,0.000252023,0.001168355,0.00007647061,0.00007752333,0.0001404394,0.0001627087,0.0000234302,0.00006534212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9952674,"threshold_uncertainty_score":0.9998677,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002889442,0.0001946062,0.0001957783,0.00008700699,0.0003714641,0.0002802245,0.0004361719,0.00007248699,0.000006531808],"category_scores_gemma":[0.000003289137,0.0001302329,0.00006408737,0.0003998665,0.00004977254,0.00004192377,0.000005344234,0.0003257518,0.00007097206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000530028,"about_ca_system_score_gemma":0.00001738937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002663624,"about_ca_topic_score_gemma":0.00001002179,"domain_scores_codex":[0.9985553,0.0001270575,0.0003433028,0.0003605365,0.0002737428,0.000340069],"domain_scores_gemma":[0.9991531,0.0001906482,0.00008168694,0.0004569971,0.00002786161,0.00008970128],"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.0000112856,0.0001366749,0.00005946567,0.00002883014,0.00002413164,0.000005230757,0.0004663684,0.9907966,0.00003535754,0.002438062,0.0006297099,0.005368274],"study_design_scores_gemma":[0.0006224945,0.0002425441,0.003184281,0.0001367889,0.00000622109,0.00002625266,0.0003631559,0.9943612,0.00004046342,0.0001737243,0.0006192861,0.0002236475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4618315,0.00006529164,0.5354454,0.0008732365,0.00041982,0.0003434054,0.000005958427,0.0001022756,0.0009130987],"genre_scores_gemma":[0.9992209,0.000007828627,0.0001204065,0.0002299621,0.0000274897,0.0001147568,0.000001274117,0.000007830726,0.0002695214],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5373895,"threshold_uncertainty_score":0.5310743,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004117306,0.0001773893,0.0003584589,0.0003011402,0.0002366098,0.00007790329,0.0003129345,0.00005613153,0.00000165168],"category_scores_gemma":[0.000001640774,0.0001583753,0.0002354601,0.0008034335,0.00003453995,0.00002766299,0.00001137814,0.00008022734,0.000003367312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004995502,"about_ca_system_score_gemma":0.000005637957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005935012,"about_ca_topic_score_gemma":0.000002000678,"domain_scores_codex":[0.9985694,0.00007164498,0.0004088552,0.0003175793,0.0002454782,0.0003870636],"domain_scores_gemma":[0.9991175,0.0001176098,0.0001634938,0.0004016822,0.00005407658,0.0001456671],"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.00003008477,0.0003144341,0.0005193981,0.0001721832,0.001595064,0.00000152584,0.0003673266,0.9879719,0.00002443404,0.004116844,0.000302582,0.004584229],"study_design_scores_gemma":[0.0007001379,0.00006725201,0.001630161,0.00006119982,0.0004301422,0.000003950702,0.000424818,0.9949746,0.00002693696,0.00000914526,0.001480052,0.0001915922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08116612,0.00018141,0.9170682,0.00009316912,0.0007500434,0.0004070577,0.0000817285,0.0001111045,0.0001411241],"genre_scores_gemma":[0.9960541,0.000007200832,0.003620437,0.00003998988,0.00004965532,0.00003656877,0.0000138193,0.000007517896,0.0001707515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.914888,"threshold_uncertainty_score":0.6458358,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004506559,0.0002243013,0.0002634433,0.0001410355,0.000354704,0.000331203,0.0002036214,0.00008511853,0.000001404948],"category_scores_gemma":[0.000005356412,0.0001803169,0.00004363871,0.000287207,0.00005915427,0.0002233464,0.000004998288,0.0001930838,0.000008634497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005381343,"about_ca_system_score_gemma":0.00003450691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005858848,"about_ca_topic_score_gemma":0.0001635909,"domain_scores_codex":[0.9983519,0.00005711654,0.0002787393,0.0004793185,0.0004683401,0.0003646316],"domain_scores_gemma":[0.9989669,0.000135158,0.00006436385,0.0003261129,0.0002144686,0.0002929821],"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.0009411815,0.0005490333,0.001244303,0.0001355573,0.0002825133,0.0003344025,0.001896789,0.9623902,0.002963939,0.002359124,0.00188391,0.02501909],"study_design_scores_gemma":[0.01015488,0.003965411,0.0150869,0.001281454,0.0003322741,0.002219633,0.01397209,0.9319828,0.0048077,0.00007443557,0.01276843,0.00335396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2984371,0.0001058587,0.7003697,0.0003492296,0.0002173188,0.0001911386,0.0001190681,0.0001109867,0.00009961236],"genre_scores_gemma":[0.9975426,0.00001717931,0.001138138,0.00004790571,0.00003130906,0.00002791333,0.00001701622,0.00001036518,0.001167577],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6992316,"threshold_uncertainty_score":0.735311,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006632945,0.0002936726,0.0003884473,0.00007620599,0.0006808884,0.0004241073,0.0007732687,0.0001727209,0.00001788887],"category_scores_gemma":[0.000005815027,0.0002353093,0.0001110679,0.0003266764,0.0001134642,0.000417516,0.00002229108,0.0001988056,0.00003845758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007955854,"about_ca_system_score_gemma":0.00003954311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002438479,"about_ca_topic_score_gemma":0.0002385251,"domain_scores_codex":[0.9975383,0.0002119205,0.0005459397,0.0008761119,0.0002653242,0.0005624355],"domain_scores_gemma":[0.9981547,0.000131597,0.0001324389,0.001198752,0.0001753656,0.0002071371],"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.002392449,0.001830929,0.004133564,0.0009133784,0.0014732,0.00003487524,0.001640542,0.7110221,0.0006585967,0.008447141,0.2446009,0.0228523],"study_design_scores_gemma":[0.002232895,0.0006756337,0.0003195624,0.0002125895,0.00004644698,0.000186369,0.00009275429,0.9344083,0.0001144483,0.0003608562,0.06081812,0.0005319894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007088941,0.00008661857,0.9864299,0.00044344,0.003403849,0.0009171622,0.001209554,0.0002057931,0.0002147634],"genre_scores_gemma":[0.9960146,0.000007832035,0.002516274,0.0001599865,0.0006439175,0.0001884447,0.000151896,0.00001758336,0.0002994518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9889257,"threshold_uncertainty_score":0.9595636,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00057089,0.0002867378,0.000342978,0.00005834023,0.001941713,0.001247606,0.001393027,0.0001153362,0.000002039043],"category_scores_gemma":[0.00001804005,0.0002534022,0.00006424461,0.0001353167,0.0002184675,0.00007944544,0.0001146968,0.0002556854,0.00003692596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005877457,"about_ca_system_score_gemma":0.00002645811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003706696,"about_ca_topic_score_gemma":0.0000173902,"domain_scores_codex":[0.9977799,0.00009898418,0.0003821196,0.0008613084,0.000341626,0.0005360582],"domain_scores_gemma":[0.9974172,0.0001028232,0.0002340382,0.001903401,0.00007173832,0.0002708606],"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.00003367268,0.0001668644,0.0000631219,0.00005566567,0.0001037284,0.0000305694,0.0002006753,0.9926747,0.0000745667,0.00008830259,0.0005092249,0.005998906],"study_design_scores_gemma":[0.001220947,0.00006024729,0.0009497413,0.0001384485,0.00003298199,0.0000544194,0.0002122163,0.9935448,0.00001497203,0.000006997999,0.003466197,0.0002980092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1745189,0.0002243767,0.8217179,0.0006421542,0.0006881838,0.0004209415,0.001537479,0.0001941427,0.0000558925],"genre_scores_gemma":[0.9989731,0.00002342692,0.0005231674,0.0000409954,0.0000587392,0.00002723769,0.0001076168,0.00001278185,0.0002329176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8244542,"threshold_uncertainty_score":0.9999918,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001808647,0.0002009742,0.000232605,0.00007963185,0.0001901418,0.0001109306,0.0002012626,0.00007950878,0.000002005248],"category_scores_gemma":[0.00002497474,0.000161095,0.00003810897,0.000326864,0.0000380202,0.0002930542,0.000001416562,0.0001971236,0.000008640006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006468682,"about_ca_system_score_gemma":0.00003695227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001752462,"about_ca_topic_score_gemma":0.000004456487,"domain_scores_codex":[0.9988315,0.0001249215,0.0001856077,0.00037125,0.0001973202,0.0002894446],"domain_scores_gemma":[0.9990506,0.0002916109,0.0000565013,0.0004153689,0.00005746188,0.0001284757],"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.00001204933,0.00003480985,0.00002699809,0.00003745141,0.00003352754,0.00002619815,0.0001010528,0.9930049,0.0001421465,0.005569668,0.00001572786,0.0009955009],"study_design_scores_gemma":[0.04359996,0.01389318,0.01123629,0.0075557,0.000979677,0.01308551,0.01258911,0.5902227,0.09737313,0.08178142,0.1029113,0.02477212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002353396,0.0003594056,0.9956524,0.00003007556,0.0006701449,0.0001792472,0.00003057704,0.0005415303,0.0001831833],"genre_scores_gemma":[0.9314157,0.00003553709,0.06832662,0.000009892118,0.00001186036,0.00005845921,0.000002131715,0.00001234401,0.0001274625],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9290623,"threshold_uncertainty_score":0.6569265,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001493388,0.0002766702,0.0003461639,0.0001241008,0.0004358327,0.00009825497,0.0004895922,0.0001873892,0.000004324487],"category_scores_gemma":[0.000005575986,0.0002258942,0.00006238769,0.0006663792,0.0003108301,0.0002473537,0.000006323697,0.0003567984,0.00003244076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006957607,"about_ca_system_score_gemma":0.00005694107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000124104,"about_ca_topic_score_gemma":0.00003523408,"domain_scores_codex":[0.9982921,0.00007186047,0.000303266,0.0005335048,0.0003296361,0.0004695768],"domain_scores_gemma":[0.9988239,0.0001159842,0.00008704152,0.0006210973,0.0001143897,0.0002376281],"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.00004222968,0.0001086764,0.0001989513,0.00001269961,0.0000703007,0.00008293218,0.0001248381,0.9938374,0.00003003002,0.001535261,0.002211917,0.001744825],"study_design_scores_gemma":[0.002072572,0.0008692103,0.002466492,0.0002060216,0.00004276777,0.001957337,0.0001959111,0.9841942,0.0003383594,0.0001022915,0.006501206,0.001053593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02205295,0.0001202538,0.9754322,0.0004190187,0.0004916812,0.0003909829,0.0001423423,0.0007460265,0.000204568],"genre_scores_gemma":[0.9902071,0.00005022749,0.009309652,0.00009989101,0.00004219657,0.000102398,0.000008749363,0.00001254973,0.0001671986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9681542,"threshold_uncertainty_score":0.9211697,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000265203,0.0003787736,0.0004268411,0.0001171219,0.0005226704,0.0002408057,0.0005556388,0.0003005413,0.000009017843],"category_scores_gemma":[0.000007683288,0.0003527258,0.0001703091,0.000577145,0.0001008235,0.000430139,0.000008673549,0.0002456279,0.000007549129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009238851,"about_ca_system_score_gemma":0.0000369203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001213973,"about_ca_topic_score_gemma":0.00004139143,"domain_scores_codex":[0.9976233,0.0001579351,0.0005894045,0.0007357075,0.0002785776,0.0006150718],"domain_scores_gemma":[0.9983848,0.0002432391,0.0002237434,0.0006884349,0.0002097979,0.0002500407],"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.0001105744,0.000233543,0.00001807758,0.00003210035,0.00007505463,0.00000591247,0.0001286791,0.9944586,0.000005633523,0.002587243,0.000925136,0.001419439],"study_design_scores_gemma":[0.001359393,0.0002313924,0.0000683602,0.00007344709,0.00004888449,0.00004021953,0.00007940501,0.9969231,0.00005231755,0.00005854572,0.0006612121,0.0004037485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006133603,0.0002731955,0.9954066,0.0001271332,0.001780098,0.0007821617,0.0003223205,0.0004753915,0.0002197253],"genre_scores_gemma":[0.9742767,0.0001202626,0.02474037,0.00008095393,0.00009762682,0.0002970402,0.0002246811,0.0000318914,0.0001304995],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9736633,"threshold_uncertainty_score":0.9998925,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001976412,0.0002139255,0.0005512896,0.0002838846,0.00005562758,0.00002789867,0.0001141814,0.0002146553,0.00001065457],"category_scores_gemma":[0.000002143556,0.0002063575,0.0001562041,0.0008152138,0.00004963773,0.0001429574,8.887151e-7,0.0001686399,0.0000071835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008476274,"about_ca_system_score_gemma":0.00003536748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002802921,"about_ca_topic_score_gemma":0.0001257838,"domain_scores_codex":[0.9986925,0.00005945206,0.0005268169,0.0002179805,0.0002883139,0.0002149318],"domain_scores_gemma":[0.9991488,0.00007432894,0.000127066,0.0003412957,0.0001559597,0.0001525058],"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.00005247972,0.00006025816,0.00002555244,0.00007639184,0.0008531961,0.000002136755,0.0001646139,0.9959828,0.001796486,0.0003550483,0.0004891203,0.0001419337],"study_design_scores_gemma":[0.0007033143,0.00008923628,0.0002406351,0.00007609076,0.0005791245,0.000006806314,0.0005719012,0.995226,0.002121623,0.00007615278,0.00007974365,0.0002294048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07027896,0.0002439633,0.9274547,0.00001836955,0.0006961855,0.0002352895,0.0005741547,0.0001002193,0.0003982073],"genre_scores_gemma":[0.9994489,0.00009169226,0.0001097161,0.000004053361,0.00003687114,0.00004678202,0.0001590773,0.0000223772,0.00008053752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.92917,"threshold_uncertainty_score":0.8415015,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000357236,0.0002375006,0.0002911931,0.0001010991,0.0004331574,0.000312784,0.0001627466,0.0001169921,0.000004334487],"category_scores_gemma":[0.000003494246,0.0002167872,0.0000664008,0.0002895565,0.00008247036,0.0003240367,0.000003109905,0.0001691708,0.000007036303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009918943,"about_ca_system_score_gemma":0.00009412121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000230181,"about_ca_topic_score_gemma":0.00004656429,"domain_scores_codex":[0.9982247,0.0002043602,0.0003742393,0.0004650694,0.0004108106,0.0003207621],"domain_scores_gemma":[0.9991242,0.00009616056,0.0001133,0.0003003481,0.0002117786,0.000154171],"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.00008852169,0.0001632254,0.00002176706,0.00002763891,0.00008932776,0.00005961238,0.00007477529,0.9707419,0.0002292765,0.001705334,0.001576858,0.02522179],"study_design_scores_gemma":[0.001396165,0.0001031535,0.0001542185,0.00007868052,0.00005004082,0.0001655752,0.00009334048,0.9957545,0.00005147058,0.00009052853,0.001779991,0.0002822676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002832136,0.002054464,0.9932988,0.0004779858,0.0005874378,0.0004043063,0.0001457209,0.0001630999,0.0000360737],"genre_scores_gemma":[0.9963325,0.0000802369,0.003125447,0.0000761319,0.0001044091,0.00007153331,0.00001040639,0.00001054675,0.0001887604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9935004,"threshold_uncertainty_score":0.8840327,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007403462,0.0003181533,0.0004619658,0.0001010802,0.0005492215,0.0002898855,0.001154197,0.000114976,0.000001448861],"category_scores_gemma":[0.000007902046,0.0002087693,0.00007170457,0.0006355217,0.0001124874,0.0003535369,0.00001204642,0.0002602183,0.00001044764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007453354,"about_ca_system_score_gemma":0.0001252777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00024015,"about_ca_topic_score_gemma":0.00003693147,"domain_scores_codex":[0.997568,0.0003928721,0.0004888038,0.0006675564,0.0004652574,0.0004175876],"domain_scores_gemma":[0.9974414,0.0003396178,0.0003147885,0.001619949,0.0001382664,0.0001460096],"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.00004843009,0.0002166043,0.0001057937,0.0004561235,0.0002798604,0.00003479023,0.000401158,0.9812349,0.0001183117,0.01455756,0.0005650817,0.00198135],"study_design_scores_gemma":[0.001238044,0.0002080889,0.0002317,0.0005602472,0.00009103796,0.0005393577,0.002572791,0.9901235,0.00003817473,0.00001738146,0.003921105,0.0004586374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01090757,0.0005357959,0.9859736,0.0001166935,0.000639093,0.000485898,0.0006022399,0.0002296194,0.0005094876],"genre_scores_gemma":[0.9982698,0.00001843434,0.001418013,0.00001129921,0.00001450516,0.0000459194,0.00006109458,0.00001709329,0.0001438328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9873623,"threshold_uncertainty_score":0.8513364,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013149,0.0002131839,0.0003486981,0.0001462901,0.0001116084,0.00007828846,0.0003457368,0.0001078814,0.000002959658],"category_scores_gemma":[0.000005966309,0.0001529451,0.0001103307,0.0003182746,0.00006369889,0.0001095028,8.592537e-7,0.0001835928,0.000005083159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004524883,"about_ca_system_score_gemma":0.00005676712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002984024,"about_ca_topic_score_gemma":0.00002800354,"domain_scores_codex":[0.9984181,0.0002340721,0.0004844636,0.0003443188,0.0001970467,0.0003219827],"domain_scores_gemma":[0.9982232,0.001185297,0.0001434824,0.0002638963,0.00009397366,0.00009010797],"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.002003224,0.000664625,0.000002253641,0.00001762287,0.00004479887,0.0000114403,0.0001814315,0.9652084,0.00003755493,0.001720998,0.0003355876,0.02977214],"study_design_scores_gemma":[0.007364235,0.001371392,0.00002641641,0.00009185566,0.00003628329,0.000008260243,0.0002176634,0.9902614,0.00004486259,0.00003265577,0.0003842351,0.0001607821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004196475,0.0001354198,0.9932819,0.0002571398,0.0003537354,0.001567492,0.0001128001,0.00005400349,0.00004104502],"genre_scores_gemma":[0.9984276,0.00001078555,0.0008703311,0.0001648908,0.00003372877,0.0003725429,0.00001109268,0.000008760265,0.0001003035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9942311,"threshold_uncertainty_score":0.6236919,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000398223,0.0001831494,0.0002861554,0.0001165701,0.0003161819,0.0001137338,0.0003535479,0.00007642081,0.000002643943],"category_scores_gemma":[0.00000363571,0.0001525683,0.00009770998,0.0002724165,0.00004937485,0.00002931769,0.00001382631,0.0001654111,0.000011369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002989105,"about_ca_system_score_gemma":0.00001483763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001087713,"about_ca_topic_score_gemma":0.00002062486,"domain_scores_codex":[0.9984878,0.0001512469,0.0003739844,0.0003911506,0.0003045608,0.0002912764],"domain_scores_gemma":[0.9991262,0.0001182018,0.0001351274,0.0004380102,0.00005164067,0.000130799],"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.00002282255,0.0001896064,0.00004403313,0.00006530657,0.00004384131,0.000002017013,0.0005020091,0.9852442,0.0000673969,0.001542773,0.0001841057,0.01209192],"study_design_scores_gemma":[0.0009138044,0.00026579,0.0001836963,0.00009564152,0.00001826895,0.00001602278,0.0004305136,0.99598,0.0000484805,0.00003432314,0.001836285,0.0001772095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04064708,0.00007033385,0.9576199,0.0002669632,0.0004923494,0.0002212462,0.00005445016,0.0001604222,0.0004672334],"genre_scores_gemma":[0.998364,0.000004583324,0.0009325622,0.00005919683,0.00003401144,0.00001891493,0.000006990831,0.000009340706,0.0005703392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.957717,"threshold_uncertainty_score":0.6221557,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002847541,0.0002539939,0.0004940624,0.00009236614,0.000197781,0.0001517015,0.0001286455,0.00008828279,0.00001114239],"category_scores_gemma":[0.000001819563,0.0002257651,0.0000949092,0.0002087282,0.00009919409,0.000101594,0.000007125568,0.0003047822,0.000007035263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004160761,"about_ca_system_score_gemma":0.00001233508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002915626,"about_ca_topic_score_gemma":0.0003677482,"domain_scores_codex":[0.998463,0.0002706914,0.0003756714,0.0004102138,0.0001163681,0.0003640945],"domain_scores_gemma":[0.9991962,0.0002649213,0.0001128966,0.0002571853,0.00004681319,0.0001219882],"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.0001135445,0.0002762947,0.009438787,0.0001009069,0.0002889801,0.000005304138,0.0004341393,0.9617825,0.0001075518,0.02165192,0.001523414,0.004276662],"study_design_scores_gemma":[0.001362083,0.0001920633,0.001260236,0.0004031587,0.0001683567,0.00003169892,0.001149345,0.9879077,0.00003924174,0.002309453,0.004539282,0.0006374008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1236027,0.0001505693,0.8750187,0.0001063309,0.0002119834,0.0003214522,0.00006541025,0.00006972087,0.0004531443],"genre_scores_gemma":[0.9991466,0.00001024115,0.0001424003,0.0000183044,0.0002946077,0.0001740608,0.0000290954,0.00001664837,0.0001680674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8755438,"threshold_uncertainty_score":0.9206433,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007658022,0.0001796993,0.0002451192,0.0001490581,0.0002321031,0.000209375,0.0003054515,0.0001029677,4.752831e-7],"category_scores_gemma":[0.00001749499,0.0001691548,0.00005695481,0.000497375,0.00003286645,0.0000504594,0.00001005827,0.0001498956,0.000006150989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001146168,"about_ca_system_score_gemma":0.0000431247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002458084,"about_ca_topic_score_gemma":0.0000296499,"domain_scores_codex":[0.9983992,0.0001584181,0.0004266107,0.0004323613,0.0002822799,0.0003011525],"domain_scores_gemma":[0.9990153,0.0001952583,0.0001383071,0.0003605602,0.0001517298,0.0001387987],"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.00005545615,0.00009591535,0.000187601,0.00007194063,0.00001851781,0.000004661009,0.0004213922,0.994045,0.000007236933,0.001370688,0.001133889,0.002587764],"study_design_scores_gemma":[0.001678751,0.0001325676,0.0006091727,0.0001400832,0.00001165275,0.00001503449,0.0006887966,0.9919761,0.00001978642,0.0001962673,0.004320208,0.0002115458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1381142,0.00007809561,0.8597599,0.0007753086,0.0004709158,0.0004912393,0.0000319085,0.0001738208,0.0001045388],"genre_scores_gemma":[0.9986044,0.000001576158,0.0008606617,0.0000766317,0.00007640746,0.00005712259,0.00003511884,0.00001084728,0.0002772668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8604901,"threshold_uncertainty_score":0.6897931,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008629972,0.0001988653,0.0002553489,0.0001533431,0.0003991038,0.0002171395,0.0002380575,0.0001958713,0.000007778539],"category_scores_gemma":[0.000005489497,0.0001984048,0.00005601451,0.001180901,0.00001519617,0.0004116779,0.000003886819,0.0002797259,0.0000175961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001161094,"about_ca_system_score_gemma":0.00004226933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000848829,"about_ca_topic_score_gemma":0.000641085,"domain_scores_codex":[0.9981151,0.0003607436,0.000377283,0.0004546274,0.0003770017,0.0003152485],"domain_scores_gemma":[0.9991218,0.0001176812,0.0001227514,0.0002943422,0.0002390693,0.0001043794],"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.00004403279,0.0000903693,0.00005583654,0.000038841,0.00001908807,0.000001009179,0.0005981071,0.987882,0.00008078744,0.0003246633,0.00006409636,0.01080122],"study_design_scores_gemma":[0.001226951,0.00008854554,0.0007628643,0.00005201847,0.00002618857,0.0000129961,0.0002363178,0.9954187,0.00003176284,0.00009483409,0.001831357,0.0002174252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06861323,0.0001309624,0.9288645,0.0002912598,0.0013205,0.000485791,0.00002355245,0.0001767813,0.0000934463],"genre_scores_gemma":[0.9990857,0.00001872196,0.000150613,0.0001918182,0.0001524782,0.0003251245,0.00004448059,0.00001146313,0.00001961123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9304724,"threshold_uncertainty_score":0.8090712,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001326861,0.0003118483,0.0003628638,0.0002822898,0.0005538687,0.0001532868,0.0004549652,0.0001284228,0.000002860116],"category_scores_gemma":[0.00001817607,0.0002580351,0.0001010767,0.0005980248,0.0001088939,0.0002637856,0.000004533445,0.000271413,0.00001605858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001689326,"about_ca_system_score_gemma":0.00009708415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000104656,"about_ca_topic_score_gemma":0.0002972606,"domain_scores_codex":[0.9982308,0.00005682315,0.0003424324,0.0006044452,0.0003303535,0.0004351425],"domain_scores_gemma":[0.9983584,0.0005603806,0.0001190583,0.0006340191,0.0001321898,0.0001959907],"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.0002631673,0.0003786249,0.00007430782,0.00005535585,0.0001186027,0.00005504681,0.0003334998,0.9908988,0.0001994478,0.0009177595,0.003727197,0.00297818],"study_design_scores_gemma":[0.002385313,0.001019898,0.0009903874,0.0003527867,0.00005613892,0.0002401349,0.00031248,0.9874817,0.0003623054,0.0001514972,0.005976665,0.0006707635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02697531,0.00007546845,0.9692167,0.001027975,0.0008288162,0.0006724998,0.0005064865,0.0006228061,0.00007394757],"genre_scores_gemma":[0.9890959,0.00001860978,0.009885879,0.00009803964,0.00002818038,0.0005280426,0.00005078909,0.0000206943,0.0002738299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9621206,"threshold_uncertainty_score":0.9999872,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004108748,0.0004003125,0.0004704602,0.0001692085,0.000758466,0.0002578492,0.0009130092,0.0003144169,0.000005628984],"category_scores_gemma":[0.000005684922,0.0003866015,0.0001267577,0.000651898,0.00008566712,0.0004644563,0.0000168166,0.0003348672,0.00001052454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001070386,"about_ca_system_score_gemma":0.00005951764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002140964,"about_ca_topic_score_gemma":0.00006897984,"domain_scores_codex":[0.9971161,0.0002052394,0.0006310249,0.001056819,0.0003298063,0.0006610504],"domain_scores_gemma":[0.9977579,0.0002816279,0.0002373558,0.001282007,0.0001566751,0.0002844637],"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.0001688271,0.0002795974,0.00002255158,0.00004673189,0.0001175605,0.00001513472,0.000202,0.994947,0.00002828405,0.0002255005,0.001386814,0.002560025],"study_design_scores_gemma":[0.001288688,0.0001761889,0.00004405265,0.0001304966,0.00007470707,0.00009094451,0.0001458723,0.996626,0.00008131804,0.000003326291,0.0008951129,0.0004432573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006232378,0.0002818863,0.9896596,0.0001199812,0.001964529,0.0007920875,0.0002761126,0.0006075119,0.0000659311],"genre_scores_gemma":[0.9850482,0.000200556,0.01380048,0.00006376354,0.000108617,0.0002208747,0.0001971376,0.00004918124,0.0003111355],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9788159,"threshold_uncertainty_score":0.9998586,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002727675,0.0002219111,0.0002787771,0.00009184912,0.0003034752,0.00009695812,0.0004214923,0.0001302214,0.000003716583],"category_scores_gemma":[0.000002786867,0.0001678141,0.00009436573,0.000486675,0.00007013619,0.0001722704,0.000007821506,0.0002503297,0.000006134405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000492574,"about_ca_system_score_gemma":0.00002443522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002811498,"about_ca_topic_score_gemma":0.00001213435,"domain_scores_codex":[0.9983109,0.0001626697,0.0004421675,0.0004432825,0.0002867401,0.0003542035],"domain_scores_gemma":[0.9987984,0.000149852,0.0001525179,0.0006192313,0.0001188554,0.0001611647],"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.00005458231,0.0001114029,0.00007833353,0.00001820403,0.00005355321,0.000006026121,0.0005597289,0.994549,0.0003043671,0.0008077857,0.0001195346,0.003337512],"study_design_scores_gemma":[0.0004873869,0.0001943102,0.0007652202,0.00008159058,0.00002737851,0.00003393137,0.0002089405,0.9971227,0.000629232,0.00001582126,0.0002343486,0.000199137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04719725,0.00009036119,0.9501118,0.00007572724,0.001606773,0.0004120639,0.00009405887,0.0001579248,0.0002540433],"genre_scores_gemma":[0.9988099,0.00007323077,0.000742896,0.00006559546,0.0000614068,0.0000827637,0.000007435903,0.00001472163,0.0001420027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9516127,"threshold_uncertainty_score":0.6843261,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028906,0.0001913231,0.0002268011,0.0001285657,0.0001334469,0.000282157,0.0004799436,0.00006522053,0.000002439582],"category_scores_gemma":[0.00000257414,0.0001720928,0.00003454689,0.0002588689,0.00003037497,0.0000664261,0.00003360253,0.00009860059,0.000003012639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001056749,"about_ca_system_score_gemma":0.00001325062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001028544,"about_ca_topic_score_gemma":0.00005576104,"domain_scores_codex":[0.9984562,0.00008683009,0.0003240905,0.0005810655,0.0001931109,0.0003586782],"domain_scores_gemma":[0.9992032,0.00009526114,0.00007872447,0.0004601091,0.00004380526,0.0001189108],"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.0001646299,0.0004314159,0.0002196073,0.0003360918,0.0003281454,0.00003409946,0.000260758,0.8897159,0.00006322374,0.001765633,0.008005603,0.09867497],"study_design_scores_gemma":[0.001227139,0.00006380617,0.001402925,0.0001192392,0.00001931323,0.00002109279,0.0001167789,0.9935654,0.00001727554,0.0000191873,0.003232643,0.0001951578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05920961,0.0002195307,0.9392779,0.0002465349,0.0002782222,0.000490564,0.00005578353,0.00009569315,0.0001261487],"genre_scores_gemma":[0.9975247,0.00004192972,0.001494415,0.00006393167,0.00001572562,0.0001490386,0.00003094669,0.000008776962,0.0006705645],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.938315,"threshold_uncertainty_score":0.7017739,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003767256,0.0003102467,0.000387048,0.0002887228,0.0004901174,0.0003603568,0.0005203162,0.0001926609,0.00001461072],"category_scores_gemma":[0.00001855199,0.000285225,0.00009742384,0.0013165,0.0002215951,0.0007014666,0.00001061122,0.0003139934,0.0000307079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007736809,"about_ca_system_score_gemma":0.00007172973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008155627,"about_ca_topic_score_gemma":0.0004021216,"domain_scores_codex":[0.9977219,0.0002232124,0.0005249727,0.0006625889,0.0003513386,0.000516019],"domain_scores_gemma":[0.9986728,0.0001772336,0.0001255823,0.0006610767,0.0001441786,0.0002191602],"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.002433723,0.006227809,0.01192708,0.001212993,0.001202897,0.0005651814,0.02117162,0.3641956,0.007320595,0.5509059,0.0148365,0.01800007],"study_design_scores_gemma":[0.01214719,0.002777525,0.02780837,0.001206995,0.0002214026,0.0004958676,0.0072924,0.853414,0.005461415,0.01243244,0.07216166,0.004580774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06414972,0.0004357963,0.9323136,0.0001723625,0.0008821434,0.0003388622,0.001329208,0.0002755009,0.0001027783],"genre_scores_gemma":[0.9977772,0.0001321494,0.001704819,0.00004792418,0.00007995658,0.00009360885,0.0001425097,0.00001112051,0.00001069719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9336275,"threshold_uncertainty_score":0.99996,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005995788,0.0003875254,0.0004696656,0.0002046341,0.0006578812,0.0005004492,0.0007080179,0.0002122121,0.0000112681],"category_scores_gemma":[0.000005445429,0.0003512555,0.0001662545,0.0008814215,0.0001291657,0.0001524048,0.00001257288,0.0004308931,0.0001998583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000133018,"about_ca_system_score_gemma":0.0001059408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003501562,"about_ca_topic_score_gemma":0.00001048669,"domain_scores_codex":[0.9969215,0.0002756758,0.000622135,0.0008067953,0.000626872,0.0007469928],"domain_scores_gemma":[0.9983481,0.0001927866,0.000122287,0.0007428001,0.000180687,0.0004133874],"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.0000432969,0.0002253922,0.00006782845,0.00005182404,0.00006455224,0.00006864964,0.0002107433,0.9932756,0.00007379738,0.00199176,0.0001649262,0.003761603],"study_design_scores_gemma":[0.0009562667,0.0001595699,0.0001845328,0.0001227848,0.00001842675,0.000380029,0.0003611468,0.9927821,0.000009759519,0.00003476435,0.004580972,0.0004096329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02442358,0.0006260343,0.9716615,0.0002859877,0.001378586,0.000440723,0.0001567128,0.0005148768,0.0005119875],"genre_scores_gemma":[0.9981877,0.00005959961,0.001125536,0.00006729,0.00009476578,0.00005943097,0.00003477348,0.00002052646,0.0003503964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9737641,"threshold_uncertainty_score":0.999894,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036238,0.0001897534,0.0003285987,0.0001875681,0.0003388995,0.0001598834,0.0002725645,0.0001442869,0.00008388341],"category_scores_gemma":[0.00004368363,0.0001564231,0.00009503436,0.0007103167,0.0001306237,0.000249069,0.000002355402,0.0002307137,0.0001861645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005434623,"about_ca_system_score_gemma":0.00002423418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005706896,"about_ca_topic_score_gemma":0.00008875961,"domain_scores_codex":[0.9977371,0.0003386958,0.0007046722,0.0005209001,0.0004440002,0.0002546222],"domain_scores_gemma":[0.9985698,0.0004766736,0.0001838212,0.0004673513,0.0001405966,0.0001617038],"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.0001497979,0.0005050036,0.0002249645,0.00000973704,0.00001478873,0.000002409873,0.0001752091,0.9891186,0.0004695487,0.004395615,0.0004540033,0.004480325],"study_design_scores_gemma":[0.003967202,0.0002809742,0.01002749,0.0001195464,0.0000410435,0.00008747017,0.00432353,0.9528807,0.0003543522,0.003663699,0.02356068,0.0006932638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1461964,0.00007447969,0.851829,0.0003538258,0.0004091306,0.0002706382,0.0006309401,0.00007501872,0.0001605709],"genre_scores_gemma":[0.9976916,0.00002962917,0.0009140582,0.00008500678,0.00006135953,0.0001133789,0.00005449355,0.00001059401,0.001039919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8514951,"threshold_uncertainty_score":0.6378749,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002772447,0.0002791331,0.0003727798,0.00029516,0.0001865043,0.0001712113,0.0005384982,0.0002144029,0.000004538197],"category_scores_gemma":[0.00001458704,0.0002097592,0.00006466981,0.0005835195,0.0001083791,0.0008846528,0.000003896522,0.0002021527,0.00005202898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001935751,"about_ca_system_score_gemma":0.00006166939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001361823,"about_ca_topic_score_gemma":0.0000623813,"domain_scores_codex":[0.9979627,0.00015633,0.0004967783,0.0006206985,0.000332337,0.0004312306],"domain_scores_gemma":[0.9985335,0.0003469173,0.0001451109,0.0007838381,0.00007126236,0.0001193551],"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.00008657463,0.0001933592,0.00007489424,0.0001273708,0.00003046425,0.00006543469,0.00008247021,0.9836034,0.003720082,0.002792169,0.0004616871,0.008762081],"study_design_scores_gemma":[0.006448933,0.00044403,0.0005415644,0.001022809,0.00003628622,0.0001066985,0.00043172,0.9761853,0.002167866,0.0005160701,0.01088376,0.001214965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004735766,0.0006191838,0.9911849,0.0004777521,0.0007981241,0.0006083307,0.0008200082,0.0006727037,0.00008318725],"genre_scores_gemma":[0.997494,0.00009552193,0.001869791,0.0000150299,0.00001722326,0.0003046406,0.00002373302,0.00001614311,0.0001638834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9927583,"threshold_uncertainty_score":0.8553731,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002645031,0.0002698232,0.000277389,0.0001187643,0.0002455924,0.0002893395,0.0004331476,0.0001561371,0.00001469114],"category_scores_gemma":[0.00000316156,0.0002332249,0.0001434712,0.0002051778,0.00007147907,0.000168278,0.000002869831,0.0002741404,0.00002057648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003255792,"about_ca_system_score_gemma":0.00005547027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001674565,"about_ca_topic_score_gemma":0.000049529,"domain_scores_codex":[0.9983677,0.00007178365,0.0003948254,0.0005533482,0.0002352605,0.000377098],"domain_scores_gemma":[0.9989603,0.0001497001,0.0001160141,0.0004392052,0.0001040962,0.0002306646],"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.0004974914,0.0007735413,0.00001357975,0.0002883098,0.0001601421,0.00002827594,0.0001203491,0.8265861,0.00009612148,0.0120766,0.003349926,0.1560095],"study_design_scores_gemma":[0.004682784,0.0002631324,0.00002678845,0.00006950925,0.00002799553,0.00001853698,0.00003668896,0.9609817,0.00004709911,0.0000360733,0.03353088,0.0002788393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004929185,0.000006556339,0.958431,0.0002577072,0.0008497618,0.03936696,0.000151204,0.0003515025,0.00009236231],"genre_scores_gemma":[0.832335,7.129645e-7,0.004814803,0.00008569147,0.00006135064,0.1621231,0.0000139884,0.00001340392,0.0005518955],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9536162,"threshold_uncertainty_score":0.9510635,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003630584,0.0003057089,0.0004330755,0.000298279,0.000176931,0.00006461107,0.0001035894,0.0002244725,0.000002538185],"category_scores_gemma":[0.00001868958,0.0003219698,0.00008221931,0.0006476023,0.00002007078,0.000321175,0.00000163988,0.0002288918,0.000006012944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000256657,"about_ca_system_score_gemma":0.000009774776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001191923,"about_ca_topic_score_gemma":0.000073905,"domain_scores_codex":[0.998258,0.00006292723,0.0006100605,0.0002788524,0.0001428085,0.0006473468],"domain_scores_gemma":[0.9990155,0.0003556266,0.00008022191,0.0002126405,0.00007046096,0.0002655852],"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.00004312335,0.0000697926,0.0001719419,0.0001234266,0.00005423009,0.000001560314,0.0005060401,0.9961557,0.0003193167,0.00006070158,0.0000514658,0.002442676],"study_design_scores_gemma":[0.000980378,0.00003848401,0.00008098884,0.0001502758,0.00004038235,0.00002147447,0.0009458278,0.9969593,0.0002081295,0.000001702693,0.0002165376,0.0003565358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01364082,0.0008923772,0.9820781,0.00001202143,0.001642725,0.001088048,0.0003640959,0.0002546672,0.00002716418],"genre_scores_gemma":[0.9937423,0.00008273364,0.005263179,0.00001096238,0.000154084,0.0005596858,0.00008606221,0.00006685876,0.00003414959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9801015,"threshold_uncertainty_score":0.9999232,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003920653,0.0001746783,0.0002410598,0.00008272676,0.000381601,0.0001605149,0.0003092608,0.0000677841,0.000001247802],"category_scores_gemma":[0.00002641912,0.0001195532,0.0001053096,0.0002441798,0.00002356764,0.0001304507,0.000001458389,0.0001688119,0.000006711484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003539646,"about_ca_system_score_gemma":0.00003518849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005389825,"about_ca_topic_score_gemma":0.00001330866,"domain_scores_codex":[0.9987193,0.00008945062,0.0002800844,0.0003228348,0.0003631273,0.0002252138],"domain_scores_gemma":[0.9989086,0.0002923832,0.00007303008,0.0003270208,0.0002975573,0.0001013996],"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.00009270425,0.0001625806,9.674555e-7,0.00001194486,0.00003533834,0.000001002506,0.0005037158,0.983958,0.0003062033,0.009536528,0.001651514,0.003739465],"study_design_scores_gemma":[0.001451037,0.001722774,0.0001506284,0.0002590658,0.00004783036,0.00003064505,0.0005111407,0.99352,0.0007154729,0.0001221994,0.001068719,0.0004004783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1244026,0.00007847355,0.8698784,0.004074029,0.0003585088,0.0006656647,0.0003914257,0.00007936428,0.0000715104],"genre_scores_gemma":[0.9988098,0.000005865277,0.0001249149,0.0002563912,0.00002836663,0.0001096728,0.00001443682,0.000006015231,0.0006445852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8744071,"threshold_uncertainty_score":0.4875239,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001731873,0.000272716,0.0004184424,0.0001301223,0.0002518179,0.0001148391,0.0004652442,0.0001312823,0.00002435105],"category_scores_gemma":[0.000003581859,0.0002255294,0.0001402238,0.0004156901,0.0001034391,0.0001695194,0.000003327104,0.0002051488,0.00003518592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000367501,"about_ca_system_score_gemma":0.00002348436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009679439,"about_ca_topic_score_gemma":0.000008465177,"domain_scores_codex":[0.9981201,0.0001078729,0.0005462862,0.0004477022,0.0004144914,0.0003635155],"domain_scores_gemma":[0.9987632,0.0001131363,0.000199043,0.0006256094,0.0001172276,0.0001817541],"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.00005756516,0.0004574333,0.001384544,0.000285263,0.0000684991,0.000009789692,0.0002294359,0.992429,0.0002433075,0.0007512438,0.00095102,0.003132938],"study_design_scores_gemma":[0.001185181,0.0003579703,0.00244692,0.0001721696,0.00002093205,0.0000310983,0.00005770379,0.9929568,0.0005263215,0.00001013678,0.001911562,0.0003232142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2361961,0.0003842255,0.7617754,0.00008420574,0.0005545875,0.000266007,0.0003626526,0.0001259768,0.0002507663],"genre_scores_gemma":[0.9992072,0.00003953243,0.0003383196,0.0000387926,0.00002324005,0.00006291271,0.0000194005,0.00001139,0.000259229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.763011,"threshold_uncertainty_score":0.9196823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}