{"meta":{"query_hash":"1434636c2b13","filters":{"venue":"IEEE Transactions on Emerging Topics in Computing"},"cohort_total":54,"direct_labels_cover":0,"predictions_cover":54,"exported":54,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/1434636c2b13","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Emerging+Topics+in+Computing"},"results":[{"id":"W1770527767","doi":"10.1109/tetc.2013.2296440","title":"A Framework for Modeling Cyber-Physical Switching Attacks in Smart Grid","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":125,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Cyber-physical system; Computer science; Smart grid; Computer security; Grid; Vulnerability (computing); Distributed computing; Electric power system; Intrusion detection system; Circuit breaker; Adversary; Electricity; Critical infrastructure; Power (physics); Engineering; Electrical engineering","score_opus":0.021373316483067412,"score_gpt":0.28099547907471384,"score_spread":0.25962216259164644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1770527767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46493387,0.000022548418,0.53329825,0.00013107347,0.0012486645,0.00017325467,0.0000010311948,0.00011079194,0.00008051986],"genre_scores_gemma":[0.9821784,0.00001982518,0.017209558,0.00006229133,0.0004443736,0.00004466699,8.012906e-7,0.000032136773,0.000007963817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877214,0.00002712657,0.00034557647,0.00027194695,0.00014772423,0.00043549534],"domain_scores_gemma":[0.9993915,0.00029692173,0.000023461604,0.00020235087,0.000027213579,0.0000585683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017128288,0.00018771474,0.00023629161,0.00023190201,0.00015898915,0.000053318407,0.00019121288,0.00012678497,0.0000085330275],"category_scores_gemma":[0.00001627117,0.00020783316,0.00010281568,0.00034027232,0.000015692343,0.0001662921,0.0000030073618,0.0007913484,0.00001120687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033249714,0.000058440506,0.00014960826,0.00006268073,0.000009902683,0.0000020129069,0.002540988,0.973598,0.00021725209,0.0003439666,0.000010289995,0.023003502],"study_design_scores_gemma":[0.00024842116,0.000020345136,0.000159758,0.00031100024,0.000005318161,0.0000022514262,0.00025776104,0.9940013,0.00095199666,0.0037471214,0.0000682612,0.00022645567],"about_ca_topic_score_codex":0.00016277801,"about_ca_topic_score_gemma":0.0001317284,"teacher_disagreement_score":0.5172445,"about_ca_system_score_codex":0.000112545335,"about_ca_system_score_gemma":0.00001384697,"threshold_uncertainty_score":0.84751904},"labels":[],"label_agreement":null},{"id":"W1804038285","doi":"10.1109/tetc.2013.2273445","title":"Receiver Consensus: On-Time Warning Delivery for Vehicular Ad-Hoc Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; Government of Jiangxi Province; National Natural Science Foundation of China","keywords":"Retransmission; Computer science; Computer network; Wireless ad hoc network; Reliability (semiconductor); Broadcast radiation; Node (physics); Vehicular ad hoc network; Network packet; Exploit; Transmission (telecommunications); Dissemination; Distributed computing; Wireless; Computer security; Telecommunications","score_opus":0.010190999025532197,"score_gpt":0.21975980661082328,"score_spread":0.2095688075852911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1804038285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4226861,0.0004905139,0.5731889,0.00028621408,0.0017804538,0.0006226929,0.0000043480936,0.0005781657,0.00036260698],"genre_scores_gemma":[0.9865123,0.00017403466,0.012289865,0.00022957745,0.00035601738,0.00005923957,0.000007881559,0.00010981699,0.00026128668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980464,0.000083404695,0.0005126792,0.00041679892,0.00021536181,0.00072534283],"domain_scores_gemma":[0.9988234,0.0005320385,0.000066864624,0.00036948212,0.00008756211,0.00012064136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033190125,0.00034340716,0.00035977145,0.00024605656,0.00028592048,0.000075979515,0.00023450851,0.0002320398,0.00009236946],"category_scores_gemma":[0.0000133731255,0.00039734616,0.00019265187,0.00034684915,0.00004447223,0.00009727109,0.0000039609254,0.00083980925,0.000088682864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001165855,0.000035021883,0.000013864177,0.00003494817,0.000071715986,0.00000990282,0.00023026788,0.8819227,0.00021245138,0.000011076477,0.0010681344,0.116378255],"study_design_scores_gemma":[0.0006501499,0.00007393669,0.00009621579,0.00031407076,0.000027726175,0.000010183719,0.000057517773,0.9920631,0.00062109425,0.00007044378,0.0056143366,0.0004012323],"about_ca_topic_score_codex":0.00001520482,"about_ca_topic_score_gemma":0.000022248048,"teacher_disagreement_score":0.56382614,"about_ca_system_score_codex":0.00024717933,"about_ca_system_score_gemma":0.000020224681,"threshold_uncertainty_score":0.9998478},"labels":[],"label_agreement":null},{"id":"W1902194318","doi":"10.1109/tetc.2015.2445101","title":"EnDAS: Efficient Encrypted Data Search as a Mobile Cloud Service","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Computer network; Binary search algorithm; Search algorithm; Operating system","score_opus":0.06748292502868941,"score_gpt":0.33240495347269283,"score_spread":0.2649220284440034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902194318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1674164,0.00007777897,0.82907647,0.00059279846,0.0018312978,0.00022213257,0.000023099732,0.00024636748,0.0005136322],"genre_scores_gemma":[0.95944417,0.000015476466,0.039921105,0.00039325244,0.00018199607,0.000008288304,0.000013719476,0.000013388439,0.000008580756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764705,0.00018543011,0.00039306463,0.0007585432,0.00054299156,0.00047293553],"domain_scores_gemma":[0.99778634,0.00020265962,0.000065611115,0.0016177451,0.0001403606,0.00018727504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011417082,0.00020134321,0.00021142642,0.00034912679,0.00027285801,0.00016870345,0.0020049943,0.00009345812,0.000015725835],"category_scores_gemma":[0.000018162627,0.00021848943,0.000058770594,0.0016766243,0.000043303662,0.00032777482,0.00008994134,0.0006021628,0.00005701525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038218346,0.0008847757,0.00017372004,0.00007749955,0.00005091402,0.00006987153,0.015886735,0.8092186,0.000119484874,0.012839496,0.00038243647,0.16025823],"study_design_scores_gemma":[0.000617289,0.00009008877,0.000047133333,0.00008388238,0.000007759363,0.000023837842,0.00056705595,0.99099296,0.0011112184,0.0008183407,0.005377046,0.000263404],"about_ca_topic_score_codex":0.0008998063,"about_ca_topic_score_gemma":0.0002688424,"teacher_disagreement_score":0.7920278,"about_ca_system_score_codex":0.00009094739,"about_ca_system_score_gemma":0.00017325516,"threshold_uncertainty_score":0.890974},"labels":[],"label_agreement":null},{"id":"W1944983855","doi":"10.1109/tetc.2013.2273221","title":"Cooperative Message Authentication in Vehicular Cyber-Physical Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Cyber-physical system; Message authentication code; Probabilistic logic; Overhead (engineering); Computer network; Broadcasting (networking); Authentication (law); Vehicular ad hoc network; Domain (mathematical analysis); Protocol (science); Crash; Wireless ad hoc network; Distributed computing; Computer security; Wireless; Cryptography; Telecommunications","score_opus":0.009949775131004755,"score_gpt":0.23581630116231397,"score_spread":0.22586652603130922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944983855","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6687982,0.000089154695,0.32924557,0.00009401786,0.0007952562,0.00033853124,0.000001253436,0.00018549168,0.00045248264],"genre_scores_gemma":[0.999033,0.00001849218,0.00057899446,0.000021334637,0.00016117016,0.000057032423,0.0000029613639,0.000039003975,0.00008805202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986692,0.00010121922,0.00037222996,0.00026625622,0.00019856251,0.00039250645],"domain_scores_gemma":[0.9994789,0.00011721028,0.000033558445,0.0002634937,0.000044218814,0.00006265605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020232191,0.00020536922,0.00026294208,0.00021789371,0.00009344478,0.000075514916,0.00016405473,0.000104864,0.000019059746],"category_scores_gemma":[0.0000053735735,0.00022717354,0.000065140346,0.00047278052,0.00002834121,0.00017299264,0.0000026013518,0.0006009832,0.000057797537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011539245,0.000065666994,0.000074156545,0.000038996575,0.000023282473,0.000008775522,0.0012819713,0.9877033,0.00082745205,0.00023334257,0.000031631516,0.009710273],"study_design_scores_gemma":[0.00030703325,0.000017020164,0.000863881,0.000205174,0.000009602736,0.000004899318,0.00018909022,0.996714,0.0012335484,0.000071094175,0.00016724085,0.00021742801],"about_ca_topic_score_codex":0.00017261755,"about_ca_topic_score_gemma":0.00007914012,"teacher_disagreement_score":0.33023474,"about_ca_system_score_codex":0.00024250256,"about_ca_system_score_gemma":0.000014585928,"threshold_uncertainty_score":0.92638683},"labels":[],"label_agreement":null},{"id":"W1976905670","doi":"10.1109/tetc.2014.2387752","title":"Energy Cost Models of Smartphones for Task Offloading to the Cloud","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Green IT and Sustainability","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; King Saud University","keywords":"Computer science; Cloud computing; Task (project management); Mobile device; Process (computing); Energy consumption; Mobile cloud computing; Energy (signal processing); Embedded system; Real-time computing; Operating system","score_opus":0.03346589894819612,"score_gpt":0.26356420056851415,"score_spread":0.23009830162031802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976905670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10514858,0.000047244717,0.89220023,0.00032616284,0.0016287464,0.00020622,0.0000064270407,0.00008390624,0.0003524662],"genre_scores_gemma":[0.9968453,0.000005092515,0.002810725,0.000051667754,0.00016134306,0.000027169226,8.528567e-7,0.000020247327,0.000077592464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991325,0.00003188757,0.00029661515,0.00015265247,0.00013102409,0.0002553161],"domain_scores_gemma":[0.9994412,0.0001445035,0.000025104426,0.00023257315,0.00009334911,0.00006324135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003888492,0.000120218545,0.00017308508,0.00012911632,0.00009734214,0.000015845588,0.00018049852,0.000055048782,0.0000017622411],"category_scores_gemma":[0.000011842127,0.000111341345,0.000073842384,0.00029482617,0.00002014284,0.000060154252,0.0000028800896,0.00014820053,7.713421e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011631723,0.000021414728,0.00003822879,0.000037729136,0.000013854447,5.1936996e-7,0.0022055863,0.9292378,0.000051265353,0.00056233845,0.00018187433,0.067637764],"study_design_scores_gemma":[0.00028861803,0.000034720735,0.000021386704,0.000042841646,0.00000959118,0.0000011859319,0.0006691752,0.98847896,0.0031751278,0.0019752106,0.0051756636,0.00012754333],"about_ca_topic_score_codex":0.00019076846,"about_ca_topic_score_gemma":0.00035153513,"teacher_disagreement_score":0.89169675,"about_ca_system_score_codex":0.00014620901,"about_ca_system_score_gemma":0.00002894958,"threshold_uncertainty_score":0.45403683},"labels":[],"label_agreement":null},{"id":"W1996225565","doi":"10.1109/tetc.2013.2273220","title":"A Wormhole Attack Resistant Neighbor Discovery Scheme With RDMA Protocol for 60 GHz Directional Network","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Computer network; Neighbor Discovery Protocol; Remote direct memory access; Authentication (law); Broadcasting (networking); Message authentication code; Computer security; Internet Protocol; The Internet; Cryptography; Operating system","score_opus":0.02369885608182927,"score_gpt":0.2724109397632004,"score_spread":0.24871208368137115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996225565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009373917,0.000008806894,0.97950673,0.0001750007,0.00024522012,0.009922145,0.000004149376,0.00023518334,0.00052881776],"genre_scores_gemma":[0.91058064,0.000004113538,0.059098065,0.000116882846,0.0006432377,0.02809104,0.0000040666037,0.00008857146,0.001373417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998759,0.000026827329,0.00035627664,0.00027390392,0.00017758425,0.0004064109],"domain_scores_gemma":[0.99950284,0.00012326376,0.000052798794,0.00020375942,0.00005848113,0.00005885074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015053427,0.00021574173,0.00024099597,0.00014934511,0.00024886613,0.0001098583,0.00013326766,0.00007566847,0.000054959295],"category_scores_gemma":[0.0000037400148,0.00019641338,0.00012244377,0.00048663156,0.00003354325,0.00023747649,0.0000019023664,0.0003071272,0.000008631939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006598354,0.000080435966,0.00033011835,0.00013035041,0.00011227463,0.0000043764035,0.0001441458,0.99052954,0.0009647656,0.00008837687,0.00047056982,0.0070790583],"study_design_scores_gemma":[0.00078579714,0.00007281805,0.0005278635,0.00036198436,0.000019175233,0.0000026749624,0.00007631542,0.9948113,0.0004972529,0.000146416,0.0024071082,0.00029128912],"about_ca_topic_score_codex":0.00004750638,"about_ca_topic_score_gemma":0.00010426454,"teacher_disagreement_score":0.9204087,"about_ca_system_score_codex":0.000117075746,"about_ca_system_score_gemma":0.000025030171,"threshold_uncertainty_score":0.8009505},"labels":[],"label_agreement":null},{"id":"W2008164459","doi":"10.1109/tetc.2015.2398824","title":"Data Allocation for Hybrid Memory With Genetic Algorithm","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Big Data and Digital Economy","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Division of Computer and Network Systems; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Cache-only memory architecture; Parallel computing; Interleaved memory; Bottleneck; Uniform memory access; Flat memory model; Memory architecture; Static random-access memory; Memory management; Registered memory; Semiconductor memory; Latency (audio); Non-uniform memory access; Embedded system; Computer architecture; Computer hardware","score_opus":0.08209833086676656,"score_gpt":0.29687350426500736,"score_spread":0.21477517339824082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008164459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033701465,0.000038641083,0.9943674,0.00057892426,0.000835832,0.00020323323,0.000032318254,0.00011091555,0.0004625404],"genre_scores_gemma":[0.4579913,0.0000048130714,0.5414738,0.00024728122,0.00014234842,0.000012603349,0.000022259004,0.000012702833,0.0000929072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998891,0.00002477233,0.00024115086,0.0004615408,0.00014807786,0.00023347845],"domain_scores_gemma":[0.9988906,0.00008477831,0.00006363557,0.0008118983,0.00006588086,0.00008323475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002894479,0.00012049182,0.00012897649,0.00013324597,0.00010821317,0.00013385633,0.000867523,0.000030044432,9.813591e-7],"category_scores_gemma":[0.0000074813465,0.0001220861,0.000022625121,0.0002140113,0.00002635603,0.00060639455,0.000017126644,0.0001348049,0.0000070497567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048824954,0.00007243189,0.00001700732,0.000012297359,0.0000128287365,0.000006594238,0.00021467506,0.09413947,0.0000018950939,0.00021197076,0.00025760458,0.9050483],"study_design_scores_gemma":[0.00057787355,0.00008530843,0.000045041706,0.00004068532,0.0000062954073,0.000024724266,0.000049478702,0.9929219,0.00066512823,0.00076848513,0.004643374,0.00017171791],"about_ca_topic_score_codex":0.00005715195,"about_ca_topic_score_gemma":0.000054825396,"teacher_disagreement_score":0.90487665,"about_ca_system_score_codex":0.00006485148,"about_ca_system_score_gemma":0.00012123875,"threshold_uncertainty_score":0.49785268},"labels":[],"label_agreement":null},{"id":"W2011755788","doi":"10.1109/tetc.2015.2395959","title":"S-Aframe: Agent-Based Multilayer Framework With Context-Aware Semantic Service for Vehicular Social Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Software deployment; Service layer; Service (business); Mobile device; Context (archaeology); Computer network; Distributed computing; Layer (electronics); World Wide Web; Software engineering","score_opus":0.02715136436527244,"score_gpt":0.26480597733089667,"score_spread":0.23765461296562423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011755788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14456135,0.00011805165,0.8524712,0.0004997615,0.0013991329,0.00046244063,0.000006160611,0.0004445353,0.000037373546],"genre_scores_gemma":[0.9828598,0.0000046063337,0.015870323,0.0005466054,0.00052597956,0.00005267961,0.000009357469,0.00011215872,0.000018486102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981268,0.000076215525,0.00042190598,0.0003906317,0.00030642012,0.00067803095],"domain_scores_gemma":[0.9990505,0.00025470337,0.00007290128,0.00031545814,0.00015929293,0.00014717068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036612773,0.00035640577,0.00039165956,0.00016868897,0.00027036475,0.000076612516,0.00026523301,0.00031937216,0.0000094200595],"category_scores_gemma":[0.00000908688,0.0003860709,0.0001338065,0.00059460604,0.000038256323,0.00009690392,0.0000034955387,0.0009460063,0.0000075592634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004829724,0.000065462096,0.000099674304,0.00011268826,0.0000869502,0.000021270998,0.00091862207,0.98171145,0.0000114141585,0.00003919606,0.00014757013,0.016737388],"study_design_scores_gemma":[0.0015089116,0.00006153553,0.00008388623,0.00040348756,0.00006249096,0.00000633707,0.0003095282,0.99501,0.00039693626,0.00006980184,0.0016605878,0.00042649396],"about_ca_topic_score_codex":0.000056515437,"about_ca_topic_score_gemma":0.0004155814,"teacher_disagreement_score":0.83829844,"about_ca_system_score_codex":0.0002701998,"about_ca_system_score_gemma":0.000057663205,"threshold_uncertainty_score":0.9998591},"labels":[],"label_agreement":null},{"id":"W2016343032","doi":"10.1109/tetc.2014.2330520","title":"A Dynamic Networking Substrate for Distributed MMOGs","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Computer network; Distributed computing; Routing (electronic design automation); Overlay network; Scheme (mathematics); The Internet","score_opus":0.019073264098508822,"score_gpt":0.2762251771966136,"score_spread":0.25715191309810476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016343032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04320056,0.000023081375,0.95050055,0.0028306176,0.0022449065,0.00029276317,0.0000042355823,0.000789892,0.00011337912],"genre_scores_gemma":[0.8561715,0.0000057691823,0.14339277,0.00022587868,0.0001034532,0.00002874807,0.0000023373684,0.000017765675,0.000051794104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808675,0.0000635286,0.00041894233,0.0005798203,0.00021616099,0.0006347836],"domain_scores_gemma":[0.99874854,0.00038036637,0.00009987188,0.00062832935,0.000068470516,0.000074400836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061016483,0.00022698757,0.00026449116,0.00031282337,0.0003395552,0.00014314821,0.0010126191,0.00012413,0.0000010503726],"category_scores_gemma":[0.000025610083,0.0002563065,0.00010661166,0.0010329046,0.00003598856,0.00014801772,0.000018364466,0.00041101387,0.0000066483026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061433734,0.000047067748,0.00010258987,0.000016877422,0.0000141362025,0.0000031660204,0.0002599042,0.6062146,0.00007783308,0.0025887254,0.00009106079,0.39057788],"study_design_scores_gemma":[0.00036785167,0.00009144741,0.0004504743,0.00013080938,0.0000063688453,0.000005692608,0.000024679508,0.98911566,0.0008341268,0.0046661673,0.004023356,0.00028336438],"about_ca_topic_score_codex":0.000023552197,"about_ca_topic_score_gemma":0.00015703595,"teacher_disagreement_score":0.81297094,"about_ca_system_score_codex":0.00016294335,"about_ca_system_score_gemma":0.000028294831,"threshold_uncertainty_score":0.9999889},"labels":[],"label_agreement":null},{"id":"W2026118018","doi":"10.1109/tetc.2013.2273457","title":"A Game-Theoretical Scheme in the Smart Grid With Demand-Side Management: Towards a Smart Cyber-Physical Power Infrastructure","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":117,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Stackelberg competition; Smart grid; Electricity; Procurement; Demand response; Profit (economics); Computer science; Grid; Electricity retailing; Game theory; Electricity market; Environmental economics; Business; Microeconomics; Economics; Marketing","score_opus":0.005219531272848779,"score_gpt":0.21408164285604017,"score_spread":0.2088621115831914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026118018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6358133,0.000015351048,0.3512248,0.00059369294,0.0009122566,0.0004191248,0.0000015761976,0.00023147186,0.010788407],"genre_scores_gemma":[0.9936295,0.000017296914,0.005733227,0.00026904873,0.00016984787,0.0000860958,0.0000024861458,0.000049801998,0.00004265328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998249,0.00008950249,0.00036328912,0.00036330815,0.00038967753,0.00054524717],"domain_scores_gemma":[0.99930924,0.00010401094,0.000033622604,0.00046217212,0.000026879816,0.00006406536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002714628,0.00032071985,0.00027296605,0.0003211769,0.00010890956,0.00010114686,0.00039988602,0.000085840875,0.00007389363],"category_scores_gemma":[0.0000037820216,0.00026037125,0.00009052942,0.00069168594,0.00010677658,0.0001508048,0.000011639469,0.0007498679,0.000025581287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011776672,0.000109008775,0.00062062615,0.000086364045,0.000098632656,0.00005105301,0.0020051782,0.9708763,0.000027657656,0.0076738587,0.00019982223,0.01823974],"study_design_scores_gemma":[0.0012551411,0.00010364682,0.030528888,0.00036781305,0.000051615432,0.000027043496,0.0008852676,0.95955604,0.00056980224,0.0028014358,0.0032317752,0.0006215144],"about_ca_topic_score_codex":0.00007584338,"about_ca_topic_score_gemma":0.00006824423,"teacher_disagreement_score":0.35781625,"about_ca_system_score_codex":0.00016560631,"about_ca_system_score_gemma":0.000011641001,"threshold_uncertainty_score":0.99998486},"labels":[],"label_agreement":null},{"id":"W2026139231","doi":"10.1109/tetc.2015.2414792","title":"Epidemic Information Dissemination in Mobile Social Networks With Opportunistic Links","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Dissemination; Information Dissemination; Computer science; Internet privacy; TRACE (psycholinguistics); Mobile device; Process (computing); Social media; Mobile computing; Computer network; World Wide Web; Telecommunications","score_opus":0.029910733181410586,"score_gpt":0.29083682006378764,"score_spread":0.26092608688237706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026139231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014505035,0.000023371951,0.9826204,0.00041346296,0.00094428705,0.00022663765,0.0000017516167,0.000134046,0.001131015],"genre_scores_gemma":[0.9892307,0.000018161316,0.010263982,0.0002421812,0.00014104632,0.000021187854,0.000011137767,0.000010033604,0.00006160401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984046,0.000103415325,0.00055470265,0.00026625546,0.00030225632,0.0003687211],"domain_scores_gemma":[0.9991773,0.00020411276,0.0001695716,0.00024020612,0.00010060118,0.00010820804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079153245,0.00017905852,0.00023797725,0.00031385318,0.00017701568,0.00010651526,0.00033980326,0.0002003486,0.000003524449],"category_scores_gemma":[0.0000046220516,0.00018225421,0.00004402367,0.000709931,0.00004296331,0.00057037995,0.000008640085,0.00078480877,0.0000050493186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001592521,0.00006401235,0.00028813706,0.000012767063,0.000005822825,0.000019448868,0.0024507847,0.45112458,6.180977e-7,0.00093543384,0.00010247183,0.54498],"study_design_scores_gemma":[0.0004843755,0.00008899348,0.00019192367,0.00015728101,0.0000060903913,0.0000141422415,0.00028919365,0.99765086,0.000007440852,0.0003449764,0.00055520603,0.00020949886],"about_ca_topic_score_codex":0.000044299068,"about_ca_topic_score_gemma":0.00004947764,"teacher_disagreement_score":0.9747256,"about_ca_system_score_codex":0.00019550156,"about_ca_system_score_gemma":0.00012108293,"threshold_uncertainty_score":0.74321115},"labels":[],"label_agreement":null},{"id":"W2026268005","doi":"10.1109/tetc.2014.2379991","title":"User-Habit-Oriented Authentication Model: Toward Secure, User-Friendly Authentication for Mobile Devices","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer security; Challenge-Handshake Authentication Protocol; Mobile device; Authentication (law); Lightweight Extensible Authentication Protocol; Authentication protocol; Multi-factor authentication; Credential; Challenge–response authentication; Mobile computing; Chip Authentication Program; Computer network; World Wide Web","score_opus":0.03838463826949506,"score_gpt":0.31242309742281,"score_spread":0.27403845915331493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026268005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1107571,0.000042398344,0.88507265,0.0011790309,0.0017103079,0.00079114176,0.000008661637,0.000351796,0.000086910426],"genre_scores_gemma":[0.9484382,0.0000054515554,0.050685074,0.0001579551,0.00009974263,0.00015038524,0.0000101484275,0.000027990101,0.00042505088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975057,0.00013933875,0.0007340409,0.0006771841,0.00049339706,0.00045029703],"domain_scores_gemma":[0.9983087,0.00016229931,0.00024164405,0.00075477123,0.00035403413,0.00017851478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087367446,0.00025816998,0.0002879687,0.0004167082,0.00028280955,0.00020222711,0.0008066484,0.00014213892,0.000003826378],"category_scores_gemma":[0.0000352917,0.0002835114,0.00014277964,0.00074849674,0.00004535295,0.00055210857,0.00001594064,0.00028088377,0.000024038349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011592908,0.002562046,0.0014653597,0.000695889,0.00023375894,0.000007210603,0.33252424,0.4070443,0.0010723002,0.17181243,0.0013861677,0.08108037],"study_design_scores_gemma":[0.00076716085,0.00011122521,0.0001240897,0.00009891699,0.000024024754,0.000004557607,0.00069251127,0.9881696,0.0015275502,0.0016293688,0.006557039,0.00029396187],"about_ca_topic_score_codex":0.000053814467,"about_ca_topic_score_gemma":0.00007269159,"teacher_disagreement_score":0.8376811,"about_ca_system_score_codex":0.00025629613,"about_ca_system_score_gemma":0.00016793751,"threshold_uncertainty_score":0.99996173},"labels":[],"label_agreement":null},{"id":"W2033853401","doi":"10.1109/tetc.2014.2373052","title":"AFDA: Asynchronous Flipped Diversity ALOHA for Emerging Wireless Networks With Long and Heterogeneous Delay","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Handshaking; Computer network; Aloha; Network packet; Asynchronous communication; Throughput; Transmission (telecommunications); Propagation delay; Diversity gain; Time diversity; Fading; PHY; Transmission delay; Channel (broadcasting); Wireless; Telecommunications; Physical layer","score_opus":0.013381487375288497,"score_gpt":0.2211280455571478,"score_spread":0.2077465581818593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033853401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37844092,0.00007422326,0.62092775,0.000049226957,0.000184983,0.00013789395,0.0000011044507,0.00013800955,0.000045881774],"genre_scores_gemma":[0.99475765,0.000057446396,0.0049601765,0.0000440463,0.00011081535,0.000013504552,0.0000021414332,0.000035759134,0.000018454675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990003,0.00005542797,0.00027314262,0.0002359134,0.0001172307,0.000317977],"domain_scores_gemma":[0.9994524,0.00013500203,0.000048320446,0.0002634389,0.000037207938,0.00006364222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024034808,0.00018617435,0.000228822,0.00011882532,0.000496129,0.000054380573,0.00019885253,0.000085523585,0.000002834598],"category_scores_gemma":[5.4478323e-7,0.00019523496,0.000054857155,0.0001562633,0.00003297145,0.00007834136,0.000011613166,0.000267934,8.478516e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011569539,0.00002155196,0.0012540667,0.00006322827,0.00005013076,0.000002235228,0.0008642534,0.87650996,0.000053970547,0.0000174481,0.0000018886251,0.12114968],"study_design_scores_gemma":[0.00063012,0.000063146865,0.0003358573,0.00014608157,0.000024163863,0.0000220465,0.00010722882,0.9967693,0.0012640309,0.000028173154,0.00036500036,0.0002448169],"about_ca_topic_score_codex":0.0000915055,"about_ca_topic_score_gemma":0.00043777513,"teacher_disagreement_score":0.61631674,"about_ca_system_score_codex":0.00008775885,"about_ca_system_score_gemma":0.0000059172594,"threshold_uncertainty_score":0.796145},"labels":[],"label_agreement":null},{"id":"W2041857993","doi":"10.1109/tetc.2013.2281192","title":"A Reliable IEEE 802.15.4 Model for Cyber Physical Power Grid Monitoring Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Network topology; Quality of service; Wireless sensor network; Cyber-physical system; Computer network; Provisioning; Distributed computing; Reliability (semiconductor); Smart grid; Real-time computing; Power (physics)","score_opus":0.017435705863052153,"score_gpt":0.25410989013712026,"score_spread":0.2366741842740681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041857993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4574953,0.00005689047,0.5362694,0.000048797257,0.0053535327,0.0002841211,0.0000040576983,0.00022696295,0.00026091776],"genre_scores_gemma":[0.9956196,0.000024768262,0.003233535,0.000016398988,0.00075202185,0.00007910213,6.2830816e-7,0.0000427088,0.00023125087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871594,0.000017455059,0.00032283034,0.00028248626,0.00019978384,0.0004615242],"domain_scores_gemma":[0.99943745,0.0001349186,0.000033819822,0.00025517613,0.00006033136,0.00007827996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013631089,0.0002121442,0.0002501296,0.00015640634,0.00022611706,0.0000785987,0.0002037036,0.00011066507,0.0000049827004],"category_scores_gemma":[0.000004724182,0.00022469847,0.000114777904,0.00023728747,0.000028017366,0.00020514175,0.0000022415225,0.00045929305,0.000021639553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029763755,0.000058164936,0.000060403152,0.00009687687,0.000020283263,0.0000013287814,0.0015002732,0.9949101,0.0012266197,0.00006379302,0.0002831202,0.0017760401],"study_design_scores_gemma":[0.00027436507,0.000025149018,0.00006853752,0.00021609725,0.0000105028885,0.0000033257309,0.00019596265,0.9927116,0.0058365623,0.00012913543,0.00028133777,0.00024741187],"about_ca_topic_score_codex":0.00009151953,"about_ca_topic_score_gemma":0.000008424669,"teacher_disagreement_score":0.53812426,"about_ca_system_score_codex":0.00012908354,"about_ca_system_score_gemma":0.000017380513,"threshold_uncertainty_score":0.91629374},"labels":[],"label_agreement":null},{"id":"W2056144094","doi":"10.1109/tetc.2014.2303934","title":"On-Chip Nanoscale Capacitor Decoupling Architectures for Hardware Security","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"NMOS logic; Computer science; Decoupling capacitor; Decoupling (probability); Hardware security module; Capacitor; Embedded system; Cryptography; CMOS; Encryption; Chip; Robustness (evolution); Computer hardware; Electronic engineering; Electrical engineering; Engineering; Transistor; Computer network; Computer security; Telecommunications","score_opus":0.019682848826847423,"score_gpt":0.2913938504338667,"score_spread":0.2717110016070193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056144094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31776786,0.0000071113777,0.68006206,0.000489757,0.0012414615,0.00019768033,0.000007092061,0.00011795592,0.000109030894],"genre_scores_gemma":[0.958475,0.0000022450647,0.040911753,0.00036778057,0.00018753087,0.00002668328,0.0000016518927,0.000014393881,0.000012997986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984213,0.000079518555,0.00037290592,0.00047594839,0.00024083987,0.00040949215],"domain_scores_gemma":[0.99870753,0.00063861447,0.0000869552,0.0004297561,0.00006103336,0.0000760852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050575484,0.00019447794,0.00020654536,0.00036643547,0.00058553653,0.000113910966,0.0004706836,0.00007350705,0.000009373857],"category_scores_gemma":[0.000030074474,0.00020522629,0.00015983878,0.00042082457,0.000038573417,0.00005799073,0.000006907468,0.0003778391,0.0000025476431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043145803,0.0005365483,0.0007179581,0.0001659347,0.00006887702,0.000004791362,0.012951187,0.4345027,0.00024657726,0.08240928,0.00023023137,0.46812278],"study_design_scores_gemma":[0.00075884967,0.00017097825,0.0003310111,0.000097701944,0.00000813963,0.000004641389,0.00010281323,0.9604198,0.0037608366,0.032708336,0.0013411957,0.00029574204],"about_ca_topic_score_codex":0.000072681214,"about_ca_topic_score_gemma":0.00030447775,"teacher_disagreement_score":0.6407071,"about_ca_system_score_codex":0.00005955289,"about_ca_system_score_gemma":0.000028457045,"threshold_uncertainty_score":0.8368885},"labels":[],"label_agreement":null},{"id":"W2057109200","doi":"10.1109/tetc.2015.2398198","title":"Impact of Network Load on the Performance of a Polling MAC With Wireless Recharging of Nodes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Polling; Computer science; Computer network; Wireless; Wireless network; Telecommunications","score_opus":0.024251512031973992,"score_gpt":0.25204520494890553,"score_spread":0.22779369291693155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057109200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.808157,0.00006921404,0.19086812,0.000016553699,0.00033714017,0.000083548206,0.000002332636,0.0000665488,0.00039949385],"genre_scores_gemma":[0.9955751,0.00004878492,0.004210552,0.0000064010833,0.00010461829,0.000003995803,5.4612065e-7,0.000038237216,0.000011779133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986864,0.00006376008,0.00048148236,0.0001595415,0.000305006,0.0003038574],"domain_scores_gemma":[0.99898803,0.00036888407,0.00016507965,0.00031535345,0.00011862849,0.00004399955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005663398,0.00019297775,0.0003297641,0.00013386336,0.00007128572,0.000008721921,0.00023851277,0.0000810174,0.000004014175],"category_scores_gemma":[0.000010696775,0.00015375584,0.000088907436,0.0006376541,0.00007516507,0.000065049346,0.0000034677214,0.0004659507,3.5892253e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048733167,0.00004078665,0.0046191523,0.00009175976,0.000071129856,0.0000012071155,0.00085755356,0.9817125,0.00039371927,0.00015516282,0.000008124769,0.012000147],"study_design_scores_gemma":[0.0003664651,0.00018188835,0.0010654244,0.0017103846,0.000016850929,0.0000037445693,0.000087628,0.9796529,0.016736368,0.000021800106,0.0000051967804,0.00015139069],"about_ca_topic_score_codex":0.00018102796,"about_ca_topic_score_gemma":0.000047615573,"teacher_disagreement_score":0.18741803,"about_ca_system_score_codex":0.00017150638,"about_ca_system_score_gemma":0.00007124257,"threshold_uncertainty_score":0.6269981},"labels":[],"label_agreement":null},{"id":"W2062935769","doi":"10.1109/tetc.2015.2405811","title":"Special Issue of the IEEE Transactions on Emerging Topics in Computing on Emerging Mobile and Ubiquitous Systems Part I","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Ubiquitous computing; Mobile computing; Scalability; Cloud computing; Usability; Adaptability; Middleware (distributed applications); Mobile cloud computing; Context-aware pervasive systems; Mobile device; World Wide Web; Telecommunications; Distributed computing; Human–computer interaction; Database; Operating system","score_opus":0.03141089926302405,"score_gpt":0.2831453964957293,"score_spread":0.25173449723270525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062935769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2693629,0.000105795065,0.67833626,0.0009202892,0.048571635,0.00069205253,0.0000024890012,0.00022388436,0.0017846961],"genre_scores_gemma":[0.9887707,0.00003438601,0.0032161414,0.00025868686,0.007246025,0.0000184036,8.51851e-7,0.000054232958,0.00040052464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559146,0.00044592074,0.0012896121,0.0009532034,0.00079961226,0.0009201628],"domain_scores_gemma":[0.99789256,0.0004841688,0.0003938428,0.00086512696,0.00017803544,0.00018627208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014049521,0.00052006193,0.0006855401,0.00071561587,0.0007534092,0.00021221522,0.0010226347,0.00023607239,0.000006108482],"category_scores_gemma":[0.00003086065,0.00050968776,0.00020750475,0.0016618137,0.00012322523,0.00029823813,0.000025874568,0.0013674243,0.000010793839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024738069,0.00028423118,0.0002652905,0.00011088064,0.00003729203,0.000024179659,0.011291806,0.75570357,0.000051473897,0.00021459452,0.0005858771,0.23140606],"study_design_scores_gemma":[0.0014952145,0.00034906305,0.00028815656,0.0014451941,0.000032779328,0.000043802032,0.001411602,0.9734119,0.00437033,0.00017843446,0.016232718,0.00074076076],"about_ca_topic_score_codex":0.0003889994,"about_ca_topic_score_gemma":0.00010847788,"teacher_disagreement_score":0.71940786,"about_ca_system_score_codex":0.0004051586,"about_ca_system_score_gemma":0.00016912287,"threshold_uncertainty_score":0.9997355},"labels":[],"label_agreement":null},{"id":"W2067358804","doi":"10.1109/tetc.2014.2367415","title":"A Cross-Layer Secure Communication Model Based on Discrete Fractional Fourier Fransform (DFRFT)","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Fractional Fourier transform; Computer science; Communication source; Discrete Fourier transform (general); Generalization; SIGNAL (programming language); Fourier transform; Channel (broadcasting); Theoretical computer science; Algorithm; Computer network; Mathematics; Fourier analysis; Mathematical analysis","score_opus":0.05596229041425209,"score_gpt":0.38271870100385263,"score_spread":0.32675641058960053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067358804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03093315,0.000005717009,0.9581766,0.0011915081,0.00018287104,0.00022455149,0.00000836531,0.00012134481,0.009155884],"genre_scores_gemma":[0.7955124,0.000006402339,0.2037013,0.00029692694,0.00007145213,0.000021976533,0.000003655588,0.00003406573,0.00035184986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779004,0.00022172896,0.0007265727,0.00037614396,0.00053059246,0.00035491082],"domain_scores_gemma":[0.9975569,0.0014213409,0.00015199733,0.00067621877,0.00009940149,0.00009410151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001572274,0.00027894392,0.00041401957,0.00028104128,0.0004951479,0.00008562674,0.00028787993,0.0001791397,0.00021784916],"category_scores_gemma":[0.000090406385,0.00025242436,0.0003000126,0.00034803146,0.00007303039,0.0001422825,0.0000034633974,0.00084349466,0.000011241008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050588147,0.00046625067,0.000101798505,0.00018289642,0.000058942376,0.0000011655516,0.00091376854,0.9005848,0.00003498662,0.057702184,0.000031517302,0.039871056],"study_design_scores_gemma":[0.0006476415,0.00004594496,0.00005388695,0.00023138497,0.00005061861,0.0000014010471,0.00003301524,0.8918559,0.0009820956,0.10546444,0.0003916973,0.00024199036],"about_ca_topic_score_codex":0.000027649336,"about_ca_topic_score_gemma":0.00007374688,"teacher_disagreement_score":0.76457924,"about_ca_system_score_codex":0.00010643859,"about_ca_system_score_gemma":0.00003633866,"threshold_uncertainty_score":0.9999928},"labels":[],"label_agreement":null},{"id":"W2077288229","doi":"10.1109/tetc.2013.2274042","title":"Scheduling Co-Design for Reliability and Energy in Cyber-Physical Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Energy consumption; Scheduling (production processes); Heuristics; Cyber-physical system; Reliability (semiconductor); Reliability engineering; Dynamic voltage scaling; Energy management; Energy (signal processing); Real-time computing; Distributed computing; Mathematical optimization; Power (physics); Engineering","score_opus":0.026221074564777215,"score_gpt":0.28290320673529623,"score_spread":0.256682132170519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077288229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18983772,0.000041801206,0.8083567,0.00031899894,0.00079759146,0.00036667506,6.488042e-7,0.00012541404,0.00015441874],"genre_scores_gemma":[0.8997923,0.000006794055,0.0998353,0.00003783525,0.00015031964,0.00009536367,3.8564175e-7,0.000019189523,0.000062497114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772686,0.00027565588,0.00059861835,0.0006703714,0.00024939553,0.00047909413],"domain_scores_gemma":[0.99825734,0.0009364863,0.00012896261,0.00049008924,0.00009271524,0.00009440717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009721763,0.00022991798,0.00038370563,0.0003184516,0.00021686706,0.00026225613,0.00043244398,0.000117181684,0.0000013477146],"category_scores_gemma":[0.000034708133,0.00024256425,0.00008157304,0.00046859102,0.00004402566,0.00050391204,0.000009694285,0.00034523784,0.0000052966516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047878025,0.0001066441,0.0001640412,0.00007911777,0.00001083717,0.000003131907,0.0012126116,0.953137,0.0006071531,0.0034691307,0.000008930823,0.041196648],"study_design_scores_gemma":[0.00047344834,0.00006607334,0.00022747557,0.00022296593,0.000003709979,0.00000919342,0.0001575897,0.99539125,0.0017506421,0.0013862093,0.000072684816,0.00023876036],"about_ca_topic_score_codex":0.0011979298,"about_ca_topic_score_gemma":0.000024393132,"teacher_disagreement_score":0.7099546,"about_ca_system_score_codex":0.00018200604,"about_ca_system_score_gemma":0.00006091439,"threshold_uncertainty_score":0.98914826},"labels":[],"label_agreement":null},{"id":"W2099739670","doi":"10.1109/tetc.2014.2371239","title":"Enabling Efficient Multi-Keyword Ranked Search Over Encrypted Mobile Cloud Data Through Blind Storage","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":192,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Scalability; Server; Cloud storage; Leverage (statistics); Database; Information retrieval; Data mining; Computer security; Computer network; Artificial intelligence","score_opus":0.05866860787291012,"score_gpt":0.3325185406351731,"score_spread":0.273849932762263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099739670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18691234,0.00009046235,0.8101187,0.0001251189,0.0020676043,0.0003043353,0.000021411171,0.00024633273,0.000113719325],"genre_scores_gemma":[0.88333404,0.00003723721,0.11615197,0.00017348593,0.0002505963,0.000008858166,0.000015115284,0.00001989184,0.000008790734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968982,0.0003202756,0.00056837645,0.0010448846,0.0005341043,0.0006341816],"domain_scores_gemma":[0.9972826,0.0004895974,0.0001134568,0.0019239903,0.00008036877,0.00010996585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014485582,0.00028617363,0.00032288223,0.00038258496,0.00059941545,0.00023712625,0.0019518668,0.0001398908,0.00002797839],"category_scores_gemma":[0.000028548307,0.00030735234,0.00011960665,0.001394224,0.00009257089,0.00048877095,0.00009498094,0.00088678655,0.00001542386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045772522,0.0008695341,0.0001470727,0.000083931925,0.000064750435,0.000019610488,0.0077224597,0.8629235,0.00037407398,0.0073022945,0.00007397616,0.12037301],"study_design_scores_gemma":[0.0016312461,0.00006672802,0.00017035252,0.00011687305,0.000012583883,0.000005597202,0.00015461644,0.9919617,0.0012690722,0.00026189868,0.004005456,0.00034387247],"about_ca_topic_score_codex":0.00031953224,"about_ca_topic_score_gemma":0.00012337421,"teacher_disagreement_score":0.6964217,"about_ca_system_score_codex":0.00008300923,"about_ca_system_score_gemma":0.00006237411,"threshold_uncertainty_score":0.99993783},"labels":[],"label_agreement":null},{"id":"W2137007447","doi":"10.1109/tetc.2013.2273079","title":"Balancing System Survivability and Cost of Smart Grid Via Modeling Cascading Failures","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cascading failure; Robustness (evolution); Computer science; Smart grid; Survivability; Relay; Electric power system; Grid; Telecommunications network; Distributed computing; Interdependent networks; Reliability engineering; Power control; Complex network; Computer network; Power (physics); Engineering; Electrical engineering","score_opus":0.014457547653848806,"score_gpt":0.25940815596752576,"score_spread":0.24495060831367696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137007447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40185124,0.000011665268,0.59742594,0.000044146007,0.00016664442,0.00016570168,0.0000020863238,0.000056527588,0.00027607044],"genre_scores_gemma":[0.99427766,0.0000015880127,0.0055156415,0.0000067188,0.00015178023,0.000018286843,0.0000016898209,0.000015937152,0.000010701011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986865,0.00009934227,0.00050739234,0.00029759615,0.00014711104,0.00026205397],"domain_scores_gemma":[0.9993258,0.00016509091,0.00011524687,0.00025818803,0.00008440266,0.00005128444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039470632,0.00016622688,0.0003279485,0.00017887769,0.0001988346,0.00004262217,0.00013372969,0.000042479594,0.000034476747],"category_scores_gemma":[0.0000019963834,0.00017895995,0.00010447298,0.00028103136,0.000032715936,0.00011415203,0.000007976851,0.00029854258,0.0000015109692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062068875,0.0000997651,0.027964074,0.0001334075,0.00009630945,8.3572235e-7,0.0008566063,0.82569075,0.0007951935,0.0011762133,0.000014616545,0.14316602],"study_design_scores_gemma":[0.00015347486,0.000014655299,0.0004115391,0.00020477381,0.000022712871,0.0000011645656,0.0005134634,0.99620324,0.0017863456,0.0005146408,0.000019665928,0.00015430107],"about_ca_topic_score_codex":0.0067671277,"about_ca_topic_score_gemma":0.0002055477,"teacher_disagreement_score":0.5924264,"about_ca_system_score_codex":0.00007969001,"about_ca_system_score_gemma":0.000014562461,"threshold_uncertainty_score":0.9998469},"labels":[],"label_agreement":null},{"id":"W2140385023","doi":"10.1109/tetc.2013.2278705","title":"Performance Evaluation of VeMAC Supporting Safety Applications in Vehicular Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Waterloo","funders":"Strong","keywords":"Computer science; Computer network; Goodput; Vehicular ad hoc network; Queueing theory; Protocol (science); Overhead (engineering); Wireless ad hoc network; Wireless; Throughput; Telecommunications","score_opus":0.01313392220629179,"score_gpt":0.25586630236148095,"score_spread":0.24273238015518916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140385023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60275567,0.0000902847,0.39579788,0.00002825463,0.00028556102,0.0004753307,7.3673556e-7,0.000086107095,0.00048018468],"genre_scores_gemma":[0.99782044,0.00006482834,0.0018706061,0.000014316409,0.00009580029,0.0000844804,0.000006901339,0.00003272485,0.000009933061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982751,0.000087001674,0.0006802527,0.00023464227,0.00031945566,0.00040354166],"domain_scores_gemma":[0.999352,0.00011308928,0.0000886585,0.00029711405,0.00010021018,0.00004895349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097014813,0.00017909544,0.00024497646,0.0002527133,0.00010384478,0.000018993545,0.00017666882,0.0001221273,0.000056167082],"category_scores_gemma":[0.000007027445,0.00021029719,0.00007043267,0.00065047975,0.000027383907,0.00015583416,0.000003231959,0.0005238418,0.0000069509406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013357363,0.00003284491,0.001763484,0.000039478997,0.000014353116,4.376555e-7,0.0002499247,0.8490099,0.00009953048,0.000015623398,0.000005397326,0.14876774],"study_design_scores_gemma":[0.00038478037,0.000012717756,0.010070326,0.00017717105,0.000021147536,0.0000020602756,0.00009776721,0.98807204,0.00086639164,0.000045419834,0.00007327293,0.0001768972],"about_ca_topic_score_codex":0.00006539247,"about_ca_topic_score_gemma":0.00009919379,"teacher_disagreement_score":0.39506474,"about_ca_system_score_codex":0.00026676492,"about_ca_system_score_gemma":0.000028570343,"threshold_uncertainty_score":0.8575671},"labels":[],"label_agreement":null},{"id":"W2148087540","doi":"10.1109/tetc.2013.2273359","title":"Vita: A Crowdsensing-Oriented Mobile Cyber-Physical System","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Hong Kong Polytechnic University","keywords":"Computer science; Mobile device; Mobile computing; Mobile cloud computing; Cloud computing; Crowdsensing; Cyber-physical system; Mobile Web; Overhead (engineering); Architecture; Mobile technology; Embedded system; Distributed computing; Computer network; Computer security; World Wide Web; Operating system","score_opus":0.009895492815218484,"score_gpt":0.246192966611103,"score_spread":0.2362974737958845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148087540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3945301,0.00001512576,0.60243905,0.00017761684,0.001388296,0.0002491699,6.016084e-7,0.00044865147,0.00075141166],"genre_scores_gemma":[0.98044455,0.0000018724762,0.018929819,0.00012088814,0.00025327268,0.000030026895,5.4476226e-7,0.000029363895,0.00018965543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761826,0.00016031785,0.0004998537,0.0006990631,0.0003890448,0.00063347793],"domain_scores_gemma":[0.9985409,0.00026171101,0.00012900034,0.00078638305,0.0001410017,0.00014105145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031914856,0.00030287815,0.00036801878,0.00034402712,0.0005014397,0.00026870292,0.0004721353,0.00011181149,0.000006433977],"category_scores_gemma":[0.000010295021,0.00031662,0.00017547514,0.00088242313,0.00006551166,0.00035158897,0.0000168882,0.00061578077,0.000096425254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008076705,0.00050689024,0.00015642651,0.00015116124,0.00006575111,0.00009417497,0.008660425,0.517186,0.004501796,0.0066353045,0.00021084411,0.46182317],"study_design_scores_gemma":[0.0004209735,0.000091483016,0.00019507967,0.00033088686,0.000010495145,0.00005975556,0.0006104659,0.9880999,0.009157581,0.0001561062,0.00049571943,0.00037157687],"about_ca_topic_score_codex":0.00033874824,"about_ca_topic_score_gemma":0.000019680956,"teacher_disagreement_score":0.58591443,"about_ca_system_score_codex":0.0002503442,"about_ca_system_score_gemma":0.000051703497,"threshold_uncertainty_score":0.9999286},"labels":[],"label_agreement":null},{"id":"W2324647842","doi":"10.1109/tetc.2015.2411215","title":"Data Sweeper: A Proactive Filtering Framework for Error-Bounded Sensor Data Collection","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Data collection; Bounded function; Wireless sensor network; Real-time computing; Data mining; Computer network; Statistics","score_opus":0.15594225595569206,"score_gpt":0.3570210555197077,"score_spread":0.20107879956401564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324647842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011600771,0.000039994007,0.98226273,0.0011529381,0.0039130254,0.0004489693,0.000032928652,0.00036964088,0.00017898122],"genre_scores_gemma":[0.4273806,0.0000090343365,0.57198477,0.00012868449,0.00031130447,0.000015388794,0.000028357681,0.000030585885,0.00011131581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997141,0.0001682186,0.0005059164,0.001192287,0.00042512896,0.00056746876],"domain_scores_gemma":[0.99638027,0.00063190266,0.00017426092,0.00253858,0.00014028043,0.00013468746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010044604,0.0002725146,0.00030656604,0.00031510732,0.00045963752,0.00024196746,0.0024590262,0.00018204817,0.000002508989],"category_scores_gemma":[0.00012781771,0.00030878713,0.00005607242,0.0010299751,0.00005405273,0.0006861086,0.00011660082,0.00065402704,0.000004557469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042479347,0.00022166382,0.000035520377,0.000027071143,0.00006266952,0.00001159985,0.0016789166,0.935739,0.00004076538,0.0025986116,0.00029093437,0.05925076],"study_design_scores_gemma":[0.0005989898,0.0000860747,0.000025695683,0.00016442932,0.000018503692,0.000018980767,0.00022939073,0.9943248,0.0008393731,0.0009908591,0.0023772183,0.00032567448],"about_ca_topic_score_codex":0.00011356897,"about_ca_topic_score_gemma":0.00018682884,"teacher_disagreement_score":0.4157798,"about_ca_system_score_codex":0.00026617537,"about_ca_system_score_gemma":0.00016252587,"threshold_uncertainty_score":0.9999364},"labels":[],"label_agreement":null},{"id":"W2329173406","doi":"10.1109/tetc.2015.2389171","title":"Decentralized RFID Coverage Algorithms With Applications for the Reader Collisions Avoidance Problem","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"RFID technology advancements","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Ontario Ministry of Research, Innovation and Science","keywords":"Computer science; Correctness; Algorithm; Radio-frequency identification; Identification (biology); Iterated function; Distributed computing; Computer security","score_opus":0.023333992121753185,"score_gpt":0.27733369340284675,"score_spread":0.25399970128109356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329173406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006687354,0.00017411596,0.99044746,0.000595063,0.00045442046,0.0009805356,0.000014982091,0.00039954105,0.00024652353],"genre_scores_gemma":[0.87050384,0.000116700765,0.1285486,0.00008286959,0.00007031083,0.00048942334,0.0000037693317,0.000047218244,0.00013723604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989892,0.000018918676,0.00027314466,0.00023149955,0.00015891828,0.00032828574],"domain_scores_gemma":[0.99928457,0.00020556465,0.000045289642,0.00034134576,0.000071178736,0.00005203726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001979654,0.00016517637,0.00016039664,0.00011570149,0.00026713288,0.000027299826,0.0002552217,0.000082665116,0.0000037986986],"category_scores_gemma":[0.0000063772645,0.00014148945,0.0000396745,0.00047719557,0.00005916713,0.00009256748,0.0000025206753,0.00037119974,0.0000046893088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012105204,0.000048595066,0.00013363866,0.000023984947,0.000044759665,0.0000013060001,0.00035608775,0.9404321,0.000055056727,0.0006765,0.000080988204,0.0581349],"study_design_scores_gemma":[0.0021770392,0.00008207382,0.00013234273,0.0001399515,0.000049537048,0.000014358588,0.00038266444,0.9517829,0.005216406,0.00274367,0.03690949,0.0003696059],"about_ca_topic_score_codex":0.00001349488,"about_ca_topic_score_gemma":0.00006557812,"teacher_disagreement_score":0.8638165,"about_ca_system_score_codex":0.00017828486,"about_ca_system_score_gemma":0.00003242075,"threshold_uncertainty_score":0.57697725},"labels":[],"label_agreement":null},{"id":"W2341443271","doi":"10.1109/tetc.2016.2555806","title":"Joint Channel Access and Sampling Rate Control in Energy Harvesting Cognitive Radio Sensor Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cognitive radio; Channel (broadcasting); Energy consumption; Wireless sensor network; Computer network; Control channel; Energy harvesting; Channel allocation schemes; Energy (signal processing); Wireless; Telecommunications; Base station; Engineering","score_opus":0.028952171037841666,"score_gpt":0.2550053747235126,"score_spread":0.22605320368567092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341443271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16478862,0.0001720724,0.83313096,0.00013488253,0.0011560747,0.000116888186,0.0000042133966,0.00030383622,0.00019247885],"genre_scores_gemma":[0.9973425,0.00031270966,0.0016617917,0.00013947942,0.00037902247,0.00002617561,0.0000012564388,0.000076765515,0.000060279304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979898,0.00016605227,0.0006117352,0.000451309,0.00013580376,0.00064534193],"domain_scores_gemma":[0.998312,0.0012494309,0.000093498,0.00018889144,0.00005097078,0.00010523869],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055136153,0.00032706407,0.0004067449,0.0003863797,0.00018057319,0.00010338125,0.00017794823,0.00018267409,0.000006246267],"category_scores_gemma":[0.000051751747,0.00032225298,0.00006497707,0.0004561197,0.000074584415,0.00027747164,0.0000079961965,0.00054902094,9.111385e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013493203,0.000021414393,0.0006515865,0.000030741434,0.00003331503,0.000022642957,0.0001587225,0.8873729,0.00036524748,0.00007470668,0.0000029800583,0.11125222],"study_design_scores_gemma":[0.0014424038,0.000022787794,0.0025658766,0.0018337808,0.000016882535,0.000015609323,0.000044663768,0.99206257,0.0014114518,0.00012617235,0.000050866514,0.0004069135],"about_ca_topic_score_codex":0.00016876234,"about_ca_topic_score_gemma":0.0004280343,"teacher_disagreement_score":0.8325539,"about_ca_system_score_codex":0.0001960845,"about_ca_system_score_gemma":0.000017412265,"threshold_uncertainty_score":0.99992293},"labels":[],"label_agreement":null},{"id":"W2475475907","doi":"10.1109/tetc.2016.2594957","title":"Efficient Performance Evaluation of Multi-Core SIMT Processors with Hot Redundancy","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Redundancy (engineering); Parallel computing; Multi-core processor; Operating system","score_opus":0.05180314228324294,"score_gpt":0.30056042389013726,"score_spread":0.2487572816068943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475475907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44710252,0.000015013663,0.551826,0.00009383882,0.00065596256,0.00014215453,4.0166404e-7,0.00004488645,0.00011920695],"genre_scores_gemma":[0.9928126,0.0000050364256,0.006967411,0.000020275414,0.00006288038,0.000015693427,1.07769466e-7,0.000009848067,0.00010617623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984637,0.000091568334,0.0003926997,0.00033961475,0.00047206864,0.0002403476],"domain_scores_gemma":[0.99908847,0.00009591697,0.00016601666,0.00032933912,0.00028516425,0.00003511931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009644927,0.00013459945,0.00017214053,0.00021969716,0.00016789055,0.00002572647,0.00028105095,0.000056854853,0.000008478423],"category_scores_gemma":[0.000010928439,0.000096627096,0.00004823304,0.00050242076,0.0000384292,0.00011224951,0.0000041351486,0.00015634291,0.0000037170234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011564627,0.00009613515,0.00030651948,0.000025756062,0.000011330062,7.606619e-7,0.0012093082,0.78823483,0.00020398587,0.00022475822,0.0000026996242,0.20967238],"study_design_scores_gemma":[0.0008607483,0.00011504417,0.0010034726,0.000691356,0.000008432303,0.0000086175305,0.000062529296,0.99215466,0.0048985253,0.000022626213,0.00003438279,0.00013961035],"about_ca_topic_score_codex":0.00002280873,"about_ca_topic_score_gemma":0.000050722854,"teacher_disagreement_score":0.54571,"about_ca_system_score_codex":0.00014510758,"about_ca_system_score_gemma":0.00008148974,"threshold_uncertainty_score":0.39403388},"labels":[],"label_agreement":null},{"id":"W2514765015","doi":"10.1109/tetc.2015.2460462","title":"Lossless ROI Privacy Protection of H.264/AVC Compressed Surveillance Videos","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; Program for New Century Excellent Talents in University; National Natural Science Foundation of China","keywords":"Computer science; Privacy protection; Encryption; Computer security; Lossless compression; Authentication (law); Information privacy; Internet privacy; Computer vision; Data compression","score_opus":0.042410938795900216,"score_gpt":0.2911790352483486,"score_spread":0.24876809645244838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514765015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07009151,0.000034525965,0.92775637,0.00035010488,0.0008420074,0.00030357108,0.0000018552137,0.0003787891,0.0002412432],"genre_scores_gemma":[0.92128044,0.000010658716,0.07855985,0.000041357314,0.000055371806,0.000016575324,5.1427963e-7,0.000012627617,0.000022596723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983464,0.00016918861,0.00046858547,0.00039863147,0.00031492225,0.00030227355],"domain_scores_gemma":[0.99894065,0.00009677387,0.00018740294,0.00056249,0.00014270599,0.00007000095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055159157,0.00018591598,0.00027093655,0.00035789027,0.00015212149,0.000051060946,0.0006774857,0.00009261068,0.0000010861876],"category_scores_gemma":[0.00001630452,0.00019660142,0.00009640679,0.00079039356,0.00006165807,0.00031585968,0.000017083197,0.00039084224,0.0000013979284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010449064,0.0006445188,0.0030707086,0.0002306011,0.00006768426,0.000033004635,0.006982784,0.55732745,0.0039558527,0.0038977063,0.00007002425,0.4236152],"study_design_scores_gemma":[0.0011944906,0.0002870295,0.0013933396,0.00045064295,0.0000068097097,0.000024976036,0.00008102191,0.85715663,0.12574558,0.011406994,0.0016882337,0.0005642459],"about_ca_topic_score_codex":0.00010953782,"about_ca_topic_score_gemma":0.000023254443,"teacher_disagreement_score":0.85118896,"about_ca_system_score_codex":0.00008147973,"about_ca_system_score_gemma":0.000045357072,"threshold_uncertainty_score":0.80171734},"labels":[],"label_agreement":null},{"id":"W2518824592","doi":"10.1109/tetc.2016.2608827","title":"Location Verification of Wireless Internet Clients: Evaluation and Improvements","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; PlanetLab; Computer network; Wireless; The Internet; Wireless network; Computer security; Telecommunications; World Wide Web","score_opus":0.02921045612380668,"score_gpt":0.30836192682848973,"score_spread":0.27915147070468305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518824592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18709688,0.0000147760475,0.8114659,0.00024067433,0.00039800676,0.00069954613,4.2250772e-7,0.000031063668,0.000052725467],"genre_scores_gemma":[0.9953313,0.000014577284,0.0044256076,0.00003678382,0.00003840973,0.00010832592,3.6445687e-7,0.0000058859796,0.000038765425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989069,0.00010245558,0.00032978633,0.0002824573,0.00023427553,0.00014411652],"domain_scores_gemma":[0.99934316,0.000096480595,0.0001400489,0.00026434,0.00012816046,0.000027829305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006305345,0.000090525464,0.00011100962,0.00013970272,0.000060438626,0.0000301279,0.00022661802,0.000052129362,0.0000051619236],"category_scores_gemma":[0.000007918256,0.00007804232,0.000023541306,0.00028883756,0.000028863995,0.00023673587,0.000006301293,0.00008963256,0.0000018500334],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008702281,0.00006771123,0.0005573696,0.000032008895,0.000008417524,2.056977e-7,0.00051447714,0.0094187455,0.0012638654,0.0020614767,0.0000060682764,0.986061],"study_design_scores_gemma":[0.001088744,0.000095975054,0.0037995805,0.0005408871,0.00000643136,0.0000011562958,0.000021711605,0.968083,0.025095012,0.0010222389,0.00011223572,0.00013298984],"about_ca_topic_score_codex":0.000042055806,"about_ca_topic_score_gemma":0.000019210494,"teacher_disagreement_score":0.98592794,"about_ca_system_score_codex":0.00008756655,"about_ca_system_score_gemma":0.000032421383,"threshold_uncertainty_score":0.31824735},"labels":[],"label_agreement":null},{"id":"W2604466268","doi":"10.1109/tetc.2017.2692098","title":"Mining Energy Consumption Behavior Patterns for Households in Smart Grid","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Energy consumption; Smart grid; Context (archaeology); Consumption (sociology); Interdependence; Big data; Smart meter; Energy management; Energy (signal processing); Data mining; Engineering","score_opus":0.03922780463775764,"score_gpt":0.27797375832551197,"score_spread":0.2387459536877543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604466268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51468015,0.0000144687065,0.48132685,0.00006387237,0.0034437212,0.00011468373,0.0000060365855,0.00015004129,0.0002001745],"genre_scores_gemma":[0.9963834,0.000067907284,0.003001576,0.000041128398,0.00027548923,0.000098698765,0.0000044466274,0.000050420454,0.000076876015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988152,0.00002271742,0.00037034004,0.00028087624,0.0001369357,0.0003739712],"domain_scores_gemma":[0.99935687,0.00008280067,0.00006302306,0.00043737944,0.000016515827,0.000043434018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022580635,0.00019570786,0.00020792607,0.0002578956,0.0002703365,0.00008815904,0.0002860794,0.000096308744,0.0000149629295],"category_scores_gemma":[0.0000062103677,0.0002502492,0.00007946807,0.00007370188,0.000025490763,0.00015175092,0.00000606466,0.0002075358,0.000001893766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006321896,0.000064988104,0.02279951,0.00007468745,0.000021720833,0.000016542814,0.0002639094,0.8904788,0.00010446114,0.00010323317,0.000060738254,0.08600511],"study_design_scores_gemma":[0.0013757526,0.00004422483,0.08783542,0.0003792878,0.000038247108,0.0000048855136,0.00009494844,0.90087175,0.0059086713,0.000029378874,0.002922124,0.0004952743],"about_ca_topic_score_codex":0.00027187704,"about_ca_topic_score_gemma":0.0018380447,"teacher_disagreement_score":0.48170328,"about_ca_system_score_codex":0.0001900242,"about_ca_system_score_gemma":0.00000762581,"threshold_uncertainty_score":0.999995},"labels":[],"label_agreement":null},{"id":"W2611405666","doi":"10.1109/tetc.2017.2700358","title":"Detecting the Dangerous Area of Toxic Gases with Wireless Sensor Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Computer science; Robustness (evolution); Wireless sensor network; Toxic gas; Node (physics); Petrochemical; Gaseous diffusion; Computer network; Environmental science; Engineering; Environmental engineering","score_opus":0.02370831689270446,"score_gpt":0.2570228107251246,"score_spread":0.23331449383242014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611405666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3290956,0.000030071838,0.6692454,0.00032916985,0.00082249596,0.00010787983,4.5975418e-7,0.00009421361,0.00027467287],"genre_scores_gemma":[0.978631,0.000021934584,0.021016633,0.00007943196,0.00015018515,0.000006168357,2.0382636e-7,0.000022798858,0.000071632254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981862,0.00012839158,0.00040496062,0.00046549476,0.0003379159,0.00047707793],"domain_scores_gemma":[0.99766755,0.0005170656,0.00036363187,0.0013015952,0.00009308454,0.00005707772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046499813,0.00023342604,0.00028559126,0.00014914833,0.0011325288,0.00021363505,0.0013258086,0.0000977278,0.000002301604],"category_scores_gemma":[0.000017540578,0.00018382203,0.000095576324,0.00035948108,0.00017131714,0.00019506337,0.00002544178,0.00061704434,8.410372e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009508568,0.000057662226,0.0005132597,0.000010380376,0.000020624992,0.000021498588,0.00051438855,0.84447867,0.00009230644,0.0002611732,0.0000026771418,0.15401784],"study_design_scores_gemma":[0.0003493077,0.000078697,0.000760808,0.0003397663,0.0000122570045,0.000031811236,0.000118676384,0.99186313,0.006162045,0.00001858734,0.000046885852,0.00021802228],"about_ca_topic_score_codex":0.00018860045,"about_ca_topic_score_gemma":0.00044166425,"teacher_disagreement_score":0.6495354,"about_ca_system_score_codex":0.00006719305,"about_ca_system_score_gemma":0.000033823886,"threshold_uncertainty_score":0.87106097},"labels":[],"label_agreement":null},{"id":"W2778924762","doi":"10.1109/tetc.2017.2785126","title":"On the Theory and Design of Polynomial Division Circuits","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Aliasing; Polynomial; Cryptography; Theoretical computer science; Division (mathematics); Digital electronics; Electronic circuit; Arithmetic; Algorithm; Computer engineering; Mathematics; Telecommunications","score_opus":0.043492083536833995,"score_gpt":0.2851929737903331,"score_spread":0.2417008902534991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778924762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117595315,0.0000179453,0.8807776,0.00048527023,0.000531681,0.0000975182,5.030313e-7,0.000040910072,0.00045327994],"genre_scores_gemma":[0.9985188,0.00000700298,0.001260797,0.00012037186,0.00004844631,0.000001981282,3.8809187e-8,0.0000068503105,0.000035697172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895674,0.00018592253,0.00022339307,0.00026317203,0.00017010594,0.00020064469],"domain_scores_gemma":[0.9980623,0.0011872078,0.00014369476,0.0005471061,0.000027707869,0.000031962507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011703032,0.00011182144,0.00013804733,0.00011355156,0.00081670523,0.00013385381,0.00069416023,0.000045423963,0.0000032310536],"category_scores_gemma":[0.00011357846,0.000090598776,0.000045070068,0.00010361061,0.00008294014,0.00014723497,0.0000130488015,0.00028506122,0.0000018856126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013121889,0.00006325369,0.00034911896,0.000013314085,0.000013252379,0.000006928994,0.0017067355,0.061838433,0.00069048797,0.017477889,0.00001285244,0.9178264],"study_design_scores_gemma":[0.0006270055,0.00018872207,0.008432368,0.00058437674,0.000011883578,0.000012027891,0.00013658279,0.96250427,0.009973079,0.017184865,0.000024545034,0.0003202939],"about_ca_topic_score_codex":0.000035171768,"about_ca_topic_score_gemma":0.000004738762,"teacher_disagreement_score":0.9175061,"about_ca_system_score_codex":0.000023474011,"about_ca_system_score_gemma":0.000026867363,"threshold_uncertainty_score":0.6281519},"labels":[],"label_agreement":null},{"id":"W2783190786","doi":"10.1109/tetc.2018.2794260","title":"<i>Mist</i>: Efficient Dissemination of Erasure-Coded Data in Data Centers","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Erasure code; Erasure; Server; Replication (statistics); Dissemination; Overhead (engineering); Computer network; Distributed computing; Decoding methods; Operating system; Algorithm; Telecommunications","score_opus":0.04416996101109297,"score_gpt":0.33364871506652244,"score_spread":0.28947875405542944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783190786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042485252,0.00003615289,0.9554744,0.0005587791,0.0009617371,0.00014707388,0.000054220076,0.00018498341,0.00009740324],"genre_scores_gemma":[0.8726691,0.000015305703,0.12720616,0.00003107213,0.000036027985,0.0000016972781,0.000018959938,0.000008939778,0.0000127296735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981428,0.00006331726,0.00046835165,0.0007256952,0.0003025942,0.0002972525],"domain_scores_gemma":[0.9966974,0.0002545521,0.000147546,0.002817917,0.000055597786,0.00002694275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006967961,0.00014860045,0.00020097611,0.00038376107,0.00011447232,0.000038722395,0.0032820883,0.00007129728,0.0000034920351],"category_scores_gemma":[0.000117380194,0.000163722,0.000019313162,0.0009594355,0.00012658552,0.00047826508,0.00017185386,0.0003277961,0.000003378665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029207682,0.00070726546,0.0007539371,0.000099092285,0.000029950183,0.000032581433,0.0026351686,0.18690747,0.00356158,0.0024692644,0.0003604183,0.80241406],"study_design_scores_gemma":[0.00024268622,0.0000338661,0.00050607015,0.0002687618,0.000004102983,0.000004225134,0.00010552677,0.9889055,0.009209325,0.00019920769,0.0003570543,0.00016366265],"about_ca_topic_score_codex":0.00008973044,"about_ca_topic_score_gemma":0.00033143212,"teacher_disagreement_score":0.83018386,"about_ca_system_score_codex":0.000094680174,"about_ca_system_score_gemma":0.000036180234,"threshold_uncertainty_score":0.6676389},"labels":[],"label_agreement":null},{"id":"W2791529266","doi":"10.1109/tetc.2018.2801464","title":"Tensor-Based Multiple Clustering Approaches for Cyber-Physical-Social Applications","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Euclidean distance; Ranking (information retrieval); Similarity (geometry); Correlation clustering; Tensor (intrinsic definition); Clustering high-dimensional data; Artificial intelligence; Pattern recognition (psychology); Mathematics","score_opus":0.0998356847540566,"score_gpt":0.35029781150461065,"score_spread":0.250462126750554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791529266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06896618,0.00000183462,0.9279986,0.0012073918,0.00016916504,0.00071125984,0.00002571299,0.00024559698,0.00067424844],"genre_scores_gemma":[0.9043976,3.555034e-7,0.09444495,0.00015901426,0.00052623166,0.0003042174,0.0000056669273,0.000036360998,0.00012559004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987913,0.000043938373,0.00035373124,0.00036330614,0.000150522,0.00029723512],"domain_scores_gemma":[0.9988931,0.00055374147,0.00011574242,0.00029046062,0.00009586527,0.000051091793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001793935,0.00017830064,0.00022970472,0.00017307508,0.00073522737,0.000043466418,0.00020730933,0.00008264172,0.000011335975],"category_scores_gemma":[0.000013938058,0.00019834733,0.00015726221,0.0003590689,0.00009390829,0.00004920045,0.0000034146208,0.00023173219,0.0000130235585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023768669,0.006135156,0.00048195047,0.00077044324,0.00026519637,0.0000028845975,0.013206712,0.19582729,0.0065294486,0.110801145,0.0014076732,0.6643344],"study_design_scores_gemma":[0.0010217802,0.00006063007,0.00017441167,0.00005567492,0.000040730538,0.0000021305746,0.0002999302,0.97306037,0.007782539,0.012546339,0.004640346,0.00031512632],"about_ca_topic_score_codex":0.000011157087,"about_ca_topic_score_gemma":0.00007653984,"teacher_disagreement_score":0.8354314,"about_ca_system_score_codex":0.00009550807,"about_ca_system_score_gemma":0.000023345005,"threshold_uncertainty_score":0.80883694},"labels":[],"label_agreement":null},{"id":"W2920054549","doi":"10.1109/tetc.2019.2902661","title":"Smart Resource Allocation for Mobile Edge Computing: A Deep Reinforcement Learning Approach","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":448,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Mobile edge computing; Distributed computing; Reinforcement learning; Server; Resource allocation; Cloud computing; Edge computing; Computer network; Mobile computing; Software deployment; Mobile device; Utility computing; Artificial intelligence; Cloud computing security; Operating system","score_opus":0.020811131718768982,"score_gpt":0.26535966875571954,"score_spread":0.24454853703695056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920054549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054264225,0.00004589207,0.93631154,0.00019289201,0.005444486,0.0008244799,7.613407e-8,0.00038336727,0.0025330423],"genre_scores_gemma":[0.93503976,0.0000043211435,0.06327518,0.0002218232,0.0007135933,0.000029756216,0.000007050206,0.00003641919,0.0006720695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723107,0.0001449868,0.0007006474,0.0008100209,0.00038071617,0.0007325905],"domain_scores_gemma":[0.9985472,0.0004040798,0.00023520013,0.00059758296,0.000117745156,0.00009817093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010866094,0.000318308,0.000368122,0.0004365769,0.0006192211,0.00019878303,0.0008097961,0.00014797607,0.0000035621044],"category_scores_gemma":[0.000017777547,0.00036320766,0.00019231507,0.0007620854,0.000032547287,0.00025219694,0.00003588527,0.00070435024,0.00002549213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011909445,0.00009952811,0.00020236256,0.00009480873,0.00002281749,0.0000011884666,0.0037481226,0.8567781,0.00009821864,0.00059352705,0.00007804226,0.13827142],"study_design_scores_gemma":[0.0008508539,0.00021189787,0.00009718463,0.00014798716,0.000010045102,0.000009915397,0.00022380082,0.98550606,0.0010947536,0.00010443315,0.011353061,0.000390022],"about_ca_topic_score_codex":0.000036253954,"about_ca_topic_score_gemma":0.0000025439087,"teacher_disagreement_score":0.8807756,"about_ca_system_score_codex":0.0002478899,"about_ca_system_score_gemma":0.00006943753,"threshold_uncertainty_score":0.999882},"labels":[],"label_agreement":null},{"id":"W3004237976","doi":"10.1109/tetc.2020.2969435","title":"Design Space Exploration of Stochastic Computing Architectures Implemented Using Integrated Optics","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Neural Networks and Reservoir Computing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Stochastic computing; Computer science; Latency (audio); Efficient energy use; Design space exploration; Computation; Notation; Parallel computing; Computational science; Supercomputer; Image processing; Mathematical notation; Computer engineering; Theoretical computer science; Algorithm; Embedded system; Mathematics; Arithmetic; Image (mathematics); Artificial intelligence","score_opus":0.08453947427868037,"score_gpt":0.31112935647139534,"score_spread":0.22658988219271498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004237976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085665636,0.000032861604,0.91188127,0.0011873856,0.00069885864,0.00031813863,0.0000012563033,0.00020001296,0.000014584968],"genre_scores_gemma":[0.7588851,0.0000025226311,0.24080196,0.00014875493,0.00013827716,0.0000011487128,7.4468795e-7,0.000018900042,0.0000026109885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976223,0.00027517445,0.0007277201,0.0005344525,0.00036163544,0.00047872053],"domain_scores_gemma":[0.998725,0.00043078017,0.00028692867,0.00031685783,0.00012405094,0.00011640677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043464807,0.0002784675,0.0003723848,0.00028746252,0.00032546182,0.000104301056,0.00067076343,0.00008278389,0.000003423011],"category_scores_gemma":[0.000031163912,0.00027940734,0.000112456364,0.0013423549,0.000049086837,0.00020530024,0.000037035472,0.00064831454,0.0000012229365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018080535,0.000052546464,0.000012199246,0.000038369006,0.000025034245,0.000010889139,0.0029225918,0.9528388,0.001497209,0.00032131068,0.0000050626236,0.0422579],"study_design_scores_gemma":[0.00045789994,0.00015738909,0.000012095186,0.00027090992,0.000012030617,0.000008539897,0.00021984444,0.9903471,0.007780248,0.000477451,0.000007694787,0.00024878437],"about_ca_topic_score_codex":0.00006241802,"about_ca_topic_score_gemma":0.000009734169,"teacher_disagreement_score":0.67321944,"about_ca_system_score_codex":0.00007930619,"about_ca_system_score_gemma":0.00008874661,"threshold_uncertainty_score":0.9999658},"labels":[],"label_agreement":null},{"id":"W3004796362","doi":"10.1109/tetc.2020.2971831","title":"Blockchain-Based On-Demand Computing Resource Trading in IoV-Assisted Smart City","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":223,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"National Natural Science Foundation of China","keywords":"Computer science; Stackelberg competition; Resource (disambiguation); Edge computing; Shared resource; Dynamic pricing; Distributed computing; Resource allocation; Computer security; Mobile edge computing; Computer network; Internet of Things; Server","score_opus":0.027765775158724595,"score_gpt":0.2638362399904939,"score_spread":0.2360704648317693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004796362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29289198,0.000021170454,0.69813573,0.007644246,0.00020682807,0.00023092002,0.0000016888488,0.00040715904,0.0004602618],"genre_scores_gemma":[0.9729537,0.0000015811936,0.025152566,0.0017685244,0.00008172696,0.000011911421,8.338712e-7,0.000020002914,0.000009194822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974342,0.00019624368,0.00065691257,0.00085114426,0.0003213099,0.00054019317],"domain_scores_gemma":[0.9985567,0.0005025402,0.00015642263,0.00062056753,0.000040580988,0.00012320936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074374984,0.00028931268,0.00038231106,0.00051548163,0.00046635378,0.00007708874,0.0009579613,0.0002205956,0.000007983654],"category_scores_gemma":[0.00003313473,0.0003383644,0.0001280836,0.0018627334,0.00008455588,0.000037038466,0.000020224361,0.0012639218,0.000005347212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002556679,0.0004870551,0.0020834222,0.00006045533,0.00002107818,0.000057026937,0.0035905635,0.81580675,0.00020395822,0.004217589,0.00005842455,0.1733881],"study_design_scores_gemma":[0.00084417005,0.00009770702,0.0014758591,0.0001606535,0.0000056115473,0.0000062397235,0.000094964365,0.9937068,0.002283941,0.0005203106,0.0004924171,0.00031131148],"about_ca_topic_score_codex":0.00006946239,"about_ca_topic_score_gemma":0.00006713135,"teacher_disagreement_score":0.6800617,"about_ca_system_score_codex":0.00017132398,"about_ca_system_score_gemma":0.00006410922,"threshold_uncertainty_score":0.99990684},"labels":[],"label_agreement":null},{"id":"W3005146066","doi":"10.1109/tetc.2020.2971251","title":"PESKEA: Anomaly Detection Framework for Profiling Kernel Event Attributes in Embedded Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Petroleum Technology Development Fund","keywords":"Computer science; Anomaly detection; Profiling (computer programming); TRACE (psycholinguistics); Software; Data mining; Kernel (algebra); Exploit; Software system; Embedded system; Real-time computing; Operating system","score_opus":0.033093585495184506,"score_gpt":0.29516836549354164,"score_spread":0.26207477999835715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005146066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18519428,0.00007431977,0.8110425,0.00064666296,0.0022490013,0.0005534072,0.0000024642434,0.00022736983,0.000009976369],"genre_scores_gemma":[0.9488747,0.000008923891,0.05065449,0.000106967316,0.00026769354,0.00006338016,7.407647e-7,0.0000148714225,0.00000822233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980007,0.00013526872,0.0006507953,0.00056904973,0.00024181073,0.00040239675],"domain_scores_gemma":[0.9989066,0.00044921832,0.00014181799,0.000339415,0.00008574305,0.00007721581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078712235,0.00019703168,0.00031540118,0.0001935636,0.00023351827,0.00009862774,0.00042993578,0.00016610985,0.0000012080764],"category_scores_gemma":[0.00008180947,0.00020298464,0.00012608751,0.0008496103,0.000020110981,0.00025010758,0.000009522696,0.0005171009,0.0000056842623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031311174,0.00012619748,0.0044301813,0.0004825027,0.000022959113,0.000006630651,0.0034907032,0.926458,0.00029932367,0.0010530663,0.0000051881643,0.063593954],"study_design_scores_gemma":[0.00044269575,0.000119736855,0.00084197364,0.00032018474,0.000005650818,0.000004894759,0.00026393938,0.9897047,0.0074906717,0.00048154438,0.000098086966,0.00022592049],"about_ca_topic_score_codex":0.00007540773,"about_ca_topic_score_gemma":0.000027484633,"teacher_disagreement_score":0.7636804,"about_ca_system_score_codex":0.0002052236,"about_ca_system_score_gemma":0.00006212397,"threshold_uncertainty_score":0.82774734},"labels":[],"label_agreement":null},{"id":"W3016083407","doi":"10.1109/tetc.2020.2986238","title":"HCP: Heterogeneous Computing Platform for Federated Learning Based Collaborative Content Caching Towards 6G Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Thunder Bay Regional Research Institute","funders":"","keywords":"Computer science; Base station; Computer network; Asynchronous communication; Distributed computing; Cloud computing; User equipment; Enhanced Data Rates for GSM Evolution; Quality of experience; Wireless; Heterogeneous network; Wireless network; Quality of service; Artificial intelligence","score_opus":0.05172493754323914,"score_gpt":0.2740669852737742,"score_spread":0.22234204773053506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016083407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09651791,0.00009848834,0.8992579,0.0018326332,0.001304436,0.00041740327,0.000004291207,0.00048953755,0.00007739465],"genre_scores_gemma":[0.9856824,0.000009033226,0.012389279,0.0015731497,0.0002592295,0.000013037406,0.000006097804,0.00003488578,0.00003283791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747896,0.00018380226,0.0006533803,0.0007413947,0.00032166822,0.00062077737],"domain_scores_gemma":[0.9986599,0.00049130624,0.00022473747,0.00023723334,0.00021774299,0.00016908556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005419099,0.00034655523,0.00044341985,0.00020206401,0.0010521553,0.00038478497,0.0005374485,0.00014076864,0.000003579042],"category_scores_gemma":[0.000057287692,0.00038316817,0.0002153241,0.000765115,0.000035255067,0.00024603723,0.000020462721,0.00093723903,0.0000027714887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051522864,0.000057608548,0.00007911214,0.00003146557,0.00004460929,0.000023282288,0.0017328318,0.8881002,0.00020028798,0.000107901215,0.000014582053,0.10955659],"study_design_scores_gemma":[0.0015048885,0.00028931504,0.000038841787,0.00019003135,0.000016539727,0.000008002093,0.00033459647,0.99475646,0.0021365122,0.000018182385,0.00031341976,0.00039321074],"about_ca_topic_score_codex":0.00014828268,"about_ca_topic_score_gemma":0.00006100314,"teacher_disagreement_score":0.88916457,"about_ca_system_score_codex":0.00020375838,"about_ca_system_score_gemma":0.00013627278,"threshold_uncertainty_score":0.999862},"labels":[],"label_agreement":null},{"id":"W3020476647","doi":"10.1109/tetc.2020.2989699","title":"Low-Power Approximate Logarithmic Squaring Circuit Design for DSP Applications","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Logarithm; Digital signal processing; Polynomial; Computer science; Function (biology); Algorithm; Arithmetic; Mathematics; Discrete mathematics; Computer hardware; Telecommunications","score_opus":0.03092454285518266,"score_gpt":0.24563802911554844,"score_spread":0.2147134862603658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020476647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012272475,0.00005278164,0.98431826,0.00017670193,0.00079170713,0.0009979384,0.0000091796,0.0009073513,0.0004735793],"genre_scores_gemma":[0.96505904,0.000024041045,0.03419443,0.00016536855,0.0002253785,0.00021388555,0.0000030912472,0.00008774033,0.000027055143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983069,0.000034160326,0.0005127239,0.00042518735,0.00019589596,0.0005251751],"domain_scores_gemma":[0.99926317,0.00020223456,0.000057323574,0.0003103663,0.000049697643,0.00011721325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002791754,0.00029051365,0.00030001331,0.0002401462,0.00026784316,0.000069941365,0.00034931087,0.00013866267,0.00002489045],"category_scores_gemma":[0.000007839381,0.00035210073,0.00011787354,0.0006063497,0.000035826335,0.00018211165,0.0000037775835,0.0005243634,0.00003250555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010239309,0.000042505137,0.000018354258,0.00021657167,0.000038228693,0.0000027750348,0.0013509992,0.96226496,0.0021289557,0.0002700131,0.00008038157,0.033576045],"study_design_scores_gemma":[0.0006467103,0.0000699556,0.000027043268,0.00009985211,0.000022758046,0.0000038548533,0.000102231075,0.96836525,0.02852463,0.00026696865,0.001480985,0.0003897671],"about_ca_topic_score_codex":0.0000047358244,"about_ca_topic_score_gemma":0.0000031000986,"teacher_disagreement_score":0.95278656,"about_ca_system_score_codex":0.000234318,"about_ca_system_score_gemma":0.00004052759,"threshold_uncertainty_score":0.99989307},"labels":[],"label_agreement":null},{"id":"W3083350651","doi":"10.1109/tetc.2022.3155272","title":"Evaluating the Security and Economic Effects of Moving Target Defense Techniques on the Cloud","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Information and Cyber Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cloud computing; Computer science; Attack surface; Redundancy (engineering); Cloud computing security; Computer security; Context (archaeology); Distributed computing; Virtual machine; Reliability (semiconductor); Operating system","score_opus":0.019093294719530543,"score_gpt":0.2884894916182485,"score_spread":0.26939619689871797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083350651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6176542,0.000041636842,0.37752154,0.001843618,0.0012691562,0.0003624934,0.000002434064,0.000107157764,0.0011977187],"genre_scores_gemma":[0.99547565,0.00000768385,0.0038206996,0.0006054103,0.000048376347,0.000025553925,2.1769415e-7,0.000005507696,0.000010871518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987843,0.0003251945,0.00030049225,0.00019081235,0.00022236395,0.00017681021],"domain_scores_gemma":[0.9987484,0.0007206966,0.0001380464,0.00035222623,0.000020983307,0.000019654704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013980212,0.00010691097,0.000120687866,0.0001136341,0.0007986175,0.00005818356,0.0004869963,0.00002633969,0.000010009714],"category_scores_gemma":[0.000019116924,0.00008335967,0.000059797454,0.0002152599,0.000042103977,0.00011249916,0.000034141973,0.00052786036,0.0000015254761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003502728,0.00022404965,0.0001796636,0.00015091899,0.00006040086,0.000006917799,0.06541172,0.46454823,0.00028854524,0.17504582,0.00012544732,0.29392326],"study_design_scores_gemma":[0.00018471306,0.00016602488,0.00011027104,0.000049149497,0.000005240635,0.00000938357,0.00044832082,0.9830259,0.010079922,0.0052890275,0.0005096882,0.00012235391],"about_ca_topic_score_codex":0.00008057222,"about_ca_topic_score_gemma":0.000013984607,"teacher_disagreement_score":0.5184777,"about_ca_system_score_codex":0.00010550344,"about_ca_system_score_gemma":0.00004414868,"threshold_uncertainty_score":0.6142401},"labels":[],"label_agreement":null},{"id":"W3083352159","doi":"10.1109/tetc.2020.2999237","title":"Guest Editor's Introduction: Special Section on Green Computing in Internet of Things","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Shenzhen University; University of Science and Technology Beijing; Campus France; University of British Columbia; Fundamental Research Funds for the Central Universities; Institut National Polytechnique de Toulouse; Natural Science Foundation of Beijing Municipality; Killam Trusts; ITMO University; Centre National de la Recherche Scientifique; Royal Society; Royal Society of Canada; National Natural Science Foundation of China; Indian National Science Academy","keywords":"Green computing; Computer science; Special section; Internet of Things; Energy consumption; The Internet; Sustainability; Ubiquitous computing; Data science; Computer security; World Wide Web; Cloud computing; Human–computer interaction; Engineering","score_opus":0.01960900002931435,"score_gpt":0.2523938589140161,"score_spread":0.23278485888470177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083352159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079786904,0.000010402488,0.8122298,0.0045944583,0.10230118,0.00017380613,1.6754613e-7,0.00020026934,0.0007029869],"genre_scores_gemma":[0.84163034,0.0000043579494,0.014004965,0.0006786993,0.14359102,0.0000019194158,0.0000015978958,0.000027188908,0.00005991821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742705,0.0001686199,0.00080112036,0.0007290628,0.0004228773,0.0004512757],"domain_scores_gemma":[0.9990185,0.00022160981,0.00023734008,0.0003429961,0.00008819576,0.00009136519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059739413,0.00027443876,0.00039073842,0.00048464688,0.00017973995,0.0000916415,0.0007009653,0.00014555952,0.000007204474],"category_scores_gemma":[0.000030565945,0.00031886125,0.00012875805,0.0012598785,0.000051857405,0.00038288944,0.00003625027,0.0010711831,0.000014483187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017391681,0.00081595866,0.0022727696,0.00037600202,0.00009667575,0.00009000173,0.059342396,0.292666,0.00081717124,0.0017127263,0.023465429,0.618171],"study_design_scores_gemma":[0.00077321636,0.00029908508,0.0006886733,0.00029729318,0.0000071545114,0.000012074499,0.000096895776,0.9765967,0.0053014983,0.00015770472,0.015389234,0.00038045304],"about_ca_topic_score_codex":0.0003427062,"about_ca_topic_score_gemma":0.000019159497,"teacher_disagreement_score":0.79822487,"about_ca_system_score_codex":0.00021117786,"about_ca_system_score_gemma":0.000053891443,"threshold_uncertainty_score":0.9999263},"labels":[],"label_agreement":null},{"id":"W3114532883","doi":"10.1109/tetc.2020.3045802","title":"Chaotic Clock Driven Cryptographic Chip: Towards a DPA Resistant AES Processor","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cryptography; Computer science; Side channel attack; Power analysis; Encryption; Chaotic; Advanced Encryption Standard; Cipher; Field-programmable gate array; Embedded system; Computer security; Artificial intelligence","score_opus":0.03449170158862826,"score_gpt":0.2925539634275542,"score_spread":0.25806226183892594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114532883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15973032,0.000060056474,0.8333521,0.0055476874,0.00053404283,0.0002577667,0.0000055699693,0.00027868545,0.00023376755],"genre_scores_gemma":[0.9611299,0.000042375428,0.037932616,0.0007254797,0.00012463283,0.000018207433,0.0000017044957,0.000017222243,0.0000078457815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978609,0.0001058405,0.000547939,0.0006117644,0.00040548938,0.00046806695],"domain_scores_gemma":[0.9991715,0.00008900417,0.00012660072,0.00037812095,0.00008767319,0.0001471267],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026358332,0.00024155741,0.000273778,0.00040667175,0.00046144178,0.00017443504,0.000719673,0.0000778894,0.000027775939],"category_scores_gemma":[0.000015803633,0.00025821806,0.00016928968,0.0019374454,0.000058872676,0.0002460418,0.000017360713,0.00051329803,0.000006357856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015354273,0.0014321813,0.0028157032,0.000824938,0.00033477074,0.00019027705,0.08472534,0.20031762,0.0026034026,0.12262337,0.00036594822,0.5836129],"study_design_scores_gemma":[0.0014150972,0.00039252554,0.003497853,0.00020552991,0.000031442003,0.000011943835,0.0009204504,0.9837109,0.0019505295,0.0034404933,0.0037236565,0.00069959846],"about_ca_topic_score_codex":0.00010593004,"about_ca_topic_score_gemma":0.00020272433,"teacher_disagreement_score":0.8013996,"about_ca_system_score_codex":0.00005167791,"about_ca_system_score_gemma":0.000092348244,"threshold_uncertainty_score":0.999987},"labels":[],"label_agreement":null},{"id":"W3134041340","doi":"10.1109/tetc.2021.3052377","title":"Secure Data Sharing With Flexible User Access Privilege Update in Cloud-Assisted IoMT","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Computer network; Privilege (computing); Data sharing; Computer security; Operating system","score_opus":0.06268017862076933,"score_gpt":0.32957241774004853,"score_spread":0.2668922391192792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134041340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09999055,0.000078337005,0.89742225,0.0008252899,0.0010467811,0.00013268765,0.000024568139,0.00019412886,0.00028542292],"genre_scores_gemma":[0.9323755,0.000053084186,0.067066945,0.00032397083,0.00011250694,0.0000062318513,0.000027527745,0.000018257793,0.000015982043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975834,0.000105061226,0.0004473869,0.00106862,0.00032734044,0.00046822752],"domain_scores_gemma":[0.9977875,0.000120130724,0.00010084761,0.0018416818,0.000068044195,0.00008182386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053675775,0.00022545789,0.00026888057,0.00038133946,0.00025517284,0.00042372383,0.0023783168,0.00009786301,0.000024152192],"category_scores_gemma":[0.000010663261,0.00023852834,0.000056550267,0.0022877003,0.000040073468,0.0011870828,0.0001672401,0.0007231154,0.0000041216767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014953414,0.0030052774,0.058438264,0.00064752763,0.00031694493,0.0015660906,0.0075771012,0.4347789,0.000597184,0.10271492,0.00075197074,0.38945627],"study_design_scores_gemma":[0.0023712986,0.00006955935,0.020235326,0.0010774642,0.000035132824,0.0001199326,0.00021542654,0.9506043,0.007825732,0.0044147884,0.011964161,0.0010668588],"about_ca_topic_score_codex":0.00021164994,"about_ca_topic_score_gemma":0.002298622,"teacher_disagreement_score":0.83238494,"about_ca_system_score_codex":0.00007288071,"about_ca_system_score_gemma":0.00011668981,"threshold_uncertainty_score":0.97269034},"labels":[],"label_agreement":null},{"id":"W4312267400","doi":"10.1109/tetc.2022.3226132","title":"ALP: Alleviating CPU-Memory Data Movement Overheads in Memory-Centric Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"VMware; Google; Microsoft; Semiconductor Research Corporation","keywords":"Computer science; Overhead (engineering); Speedup; Programmer; Compiler; Parallel computing; Instruction prefetch; Data structure; Central processing unit; Key (lock); Embedded system; Computer hardware; Operating system; Cache","score_opus":0.0380611044847252,"score_gpt":0.29284663673082084,"score_spread":0.2547855322460956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312267400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016359163,0.00025835476,0.9785521,0.0006200207,0.002257747,0.00040575504,0.000008479677,0.0004897096,0.0010486454],"genre_scores_gemma":[0.9537848,0.00004279477,0.045212418,0.00049084896,0.000110393725,0.00003553293,0.0000092459495,0.000025483643,0.00028847574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670064,0.00043910867,0.00081634714,0.0008689488,0.0006195106,0.0005554351],"domain_scores_gemma":[0.99814665,0.00026574853,0.00023895512,0.0012299181,0.00004674124,0.00007195924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017325814,0.00025240798,0.00033423028,0.00073520286,0.000620345,0.00015829243,0.0019892573,0.00006636652,0.000022943694],"category_scores_gemma":[0.000022726173,0.0003107747,0.00006883485,0.0014722435,0.000022717019,0.0003248854,0.00016887278,0.00085931754,0.0000047745257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004326503,0.00020923886,0.00018979143,0.000029871728,0.000012801934,0.000029903227,0.0010775827,0.9554021,0.000019221321,0.0005594833,0.0002466453,0.04221907],"study_design_scores_gemma":[0.000588252,0.00006250042,0.00013560113,0.00010827713,0.0000045383194,0.000012732768,0.0002797164,0.9973576,0.00022536608,0.00016275342,0.0007541067,0.00030857406],"about_ca_topic_score_codex":0.00045531173,"about_ca_topic_score_gemma":0.00003539989,"teacher_disagreement_score":0.9374257,"about_ca_system_score_codex":0.00048610233,"about_ca_system_score_gemma":0.00011821182,"threshold_uncertainty_score":0.99993443},"labels":[],"label_agreement":null},{"id":"W4378976252","doi":"10.1109/tetc.2023.3280470","title":"An Optimized Hardware Implementation of Modular Multiplication of Binary Ring LWE","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cryptography; Modular arithmetic; Learning with errors; Multiplication (music); Field-programmable gate array; Parallel computing; Modular design; Side channel attack; Embedded system; Computer engineering; Computer hardware; Algorithm; Operating system; Mathematics","score_opus":0.027886741393300638,"score_gpt":0.3279709954624198,"score_spread":0.30008425406911915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378976252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40596253,0.000007115936,0.59352,0.000081276085,0.00021843519,0.0000973802,0.000011433779,0.00009217903,0.000009691885],"genre_scores_gemma":[0.91578245,0.000025504984,0.084134646,0.000012082695,0.00002114333,0.000006642378,0.000010277522,0.0000064554174,8.050393e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988352,0.00008208173,0.00041009823,0.00029067087,0.00020357044,0.00017836127],"domain_scores_gemma":[0.99919194,0.00009238272,0.00014051032,0.0004746266,0.00006657237,0.000033990647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042133502,0.00009732759,0.00016371388,0.0004842137,0.00012239169,0.000021118656,0.00040241456,0.000045211287,0.000005326823],"category_scores_gemma":[0.000003872099,0.00011421317,0.00007837858,0.0011242136,0.000025972204,0.00032708346,0.000009446813,0.00014182116,0.0000011380147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011532067,0.00016829504,0.00097311,0.000082922736,0.000022278798,0.0000028860018,0.0041331276,0.82023543,0.013390181,0.0031736023,0.0000065696127,0.15780005],"study_design_scores_gemma":[0.00057945884,0.00006816442,0.009610267,0.000064926186,0.0000065595514,8.859189e-7,0.00048611755,0.9499784,0.038481634,0.0005819921,0.00002799693,0.00011359404],"about_ca_topic_score_codex":0.00020507484,"about_ca_topic_score_gemma":0.00003686953,"teacher_disagreement_score":0.5098199,"about_ca_system_score_codex":0.000025348309,"about_ca_system_score_gemma":0.00002433125,"threshold_uncertainty_score":0.4657478},"labels":[],"label_agreement":null},{"id":"W4385062315","doi":"10.1109/tetc.2023.3296016","title":"Privacy-Preserving Authentication Protocols for IoT Devices Using the SiRF PUF","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada","funders":"","keywords":"Computer science; Physical unclonable function; Authentication (law); Authentication protocol; Cryptography; Mutual authentication; Hardware security module; Embedded system; Computer security; Data Authentication Algorithm; Field-programmable gate array; Computer network; Computer hardware","score_opus":0.0738985503461635,"score_gpt":0.3534347535845137,"score_spread":0.2795362032383502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385062315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058019165,0.000006897784,0.93572706,0.0023013372,0.0008377639,0.0026639763,0.000003842703,0.00035505122,0.00008493368],"genre_scores_gemma":[0.9673954,0.000002532068,0.031215606,0.00019537823,0.0003032757,0.00074073265,0.0000019649729,0.000021217162,0.00012388547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830943,0.000111940106,0.00037818003,0.0004598356,0.0002986616,0.00044195712],"domain_scores_gemma":[0.9985122,0.0004861228,0.00012077112,0.00071065506,0.000115983086,0.000054247903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006724715,0.00017337938,0.00018497612,0.00026184114,0.0009036836,0.00021803105,0.0010655761,0.00006827329,0.000005862974],"category_scores_gemma":[0.000049768325,0.00015326074,0.00013525071,0.0013888056,0.00003935595,0.00026969853,0.000039990344,0.0003403011,0.000010670756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029168466,0.00046706077,0.00045045427,0.00037391923,0.00009332577,0.0000072207854,0.008700801,0.77328914,0.0021494639,0.027384952,0.00036654648,0.18668796],"study_design_scores_gemma":[0.00028223277,0.000036883008,0.0007597836,0.00016896022,0.00001125933,0.0000023141347,0.00011088201,0.98313826,0.001899225,0.009020604,0.0043884926,0.00018107294],"about_ca_topic_score_codex":0.00007208309,"about_ca_topic_score_gemma":0.00005978353,"teacher_disagreement_score":0.90937626,"about_ca_system_score_codex":0.00011380007,"about_ca_system_score_gemma":0.00009731104,"threshold_uncertainty_score":0.6950495},"labels":[],"label_agreement":null},{"id":"W4391935804","doi":"10.1109/tetc.2024.3365650","title":"A Design Framework for Hardware-Efficient Logarithmic Floating-Point Multipliers","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Computer science; Logarithm; Parallel computing; Floating point; Point (geometry); Field-programmable gate array; Computer hardware; Computational science; Embedded system; Algorithm; Mathematics","score_opus":0.04551023257329208,"score_gpt":0.3369960229184239,"score_spread":0.29148579034513183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391935804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005555441,0.00010704998,0.9921524,0.001538978,0.004718989,0.00042447625,0.0000027879814,0.00045672542,0.000043033506],"genre_scores_gemma":[0.1903375,0.0000073457754,0.80920255,0.00017563101,0.00018453802,0.00002523124,2.2300213e-7,0.00002163756,0.00004532883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980792,0.00014515656,0.00041350498,0.00064721046,0.00024011095,0.0004748347],"domain_scores_gemma":[0.9978875,0.0015513785,0.00005505716,0.0003685532,0.00004935806,0.00008818131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092766166,0.00021517684,0.00024069988,0.00030730883,0.00031027835,0.00023937805,0.00049788866,0.00011078997,0.0000070680903],"category_scores_gemma":[0.00005930262,0.00021181274,0.00016292733,0.00081914244,0.000039493036,0.00011109416,0.0000105424,0.00060894975,0.000010545822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000403609,0.000064035456,0.0000011084306,0.000041376676,0.00001659401,0.000012817454,0.0012737833,0.47886539,0.00010881173,0.0077671134,0.000013051468,0.5118319],"study_design_scores_gemma":[0.00019205923,0.0000974513,0.000008477297,0.00036756243,0.000008696036,0.000007948211,0.00006052069,0.97981316,0.0036743586,0.014910405,0.00061853975,0.00024081637],"about_ca_topic_score_codex":0.000021240923,"about_ca_topic_score_gemma":0.0000010714923,"teacher_disagreement_score":0.5115911,"about_ca_system_score_codex":0.00016172067,"about_ca_system_score_gemma":0.00007011569,"threshold_uncertainty_score":0.86374736},"labels":[],"label_agreement":null},{"id":"W4399485408","doi":"10.1109/tetc.2024.3395072","title":"Special Section on Community Detection in Time-Varying Information and Computing Networks: Theory, Models, and Applications","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Special section; Section (typography); Information theory; Computer network; Theoretical computer science; Distributed computing","score_opus":0.014218988460876223,"score_gpt":0.26694012987588955,"score_spread":0.25272114141501334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399485408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11664244,0.000025375819,0.8809303,0.000035014524,0.00033914985,0.00023177697,0.0000023125308,0.0001361341,0.0016575115],"genre_scores_gemma":[0.99760836,0.000015663538,0.00087614765,0.00002993486,0.0014152465,0.000017236513,0.000008541547,0.000013442426,0.00001544896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989319,0.00019644127,0.00037107663,0.0001946199,0.00011435454,0.00019161303],"domain_scores_gemma":[0.99936396,0.0003488526,0.000067401146,0.0001634817,0.000024000174,0.000032305375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070825143,0.00015580682,0.00017166241,0.00042873088,0.00046469644,0.00017866338,0.000096488,0.00006154894,0.000011878637],"category_scores_gemma":[0.0000014757852,0.00017978526,0.00005069025,0.00054809026,0.000036549955,0.000288445,0.00001137233,0.00087548007,0.0000018288724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000872325,0.000038329854,0.00016043898,0.000017139258,0.00001685882,1.9162094e-7,0.0007696447,0.4903189,0.000009443333,0.002044082,0.000007910927,0.5066083],"study_design_scores_gemma":[0.00017483889,0.000030808053,0.0002999645,0.00021622016,0.000018997831,0.0000018733667,0.0002357927,0.9902942,0.00014981044,0.007947991,0.00047541966,0.00015408694],"about_ca_topic_score_codex":0.0003151184,"about_ca_topic_score_gemma":0.00009131737,"teacher_disagreement_score":0.8809659,"about_ca_system_score_codex":0.00010532295,"about_ca_system_score_gemma":0.000012076769,"threshold_uncertainty_score":0.73314303},"labels":[],"label_agreement":null},{"id":"W4403295572","doi":"10.1109/tetc.2024.3473911","title":"Federated Learning Approach for Collaborative and Secure Smart Healthcare Applications","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Health care; Human–computer interaction; Computer security; Multimedia","score_opus":0.03597544341226843,"score_gpt":0.31313847245919696,"score_spread":0.2771630290469285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403295572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012042333,0.0004968582,0.98366076,0.012370281,0.0004410597,0.00056918146,0.000015891781,0.0010401156,0.00020164654],"genre_scores_gemma":[0.60173696,0.000078121426,0.39785555,0.00008038275,0.000052901945,0.0001271142,0.0000076056645,0.000016551012,0.00004478316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847645,0.000087508626,0.00029257056,0.0006640959,0.00015645339,0.00032290726],"domain_scores_gemma":[0.99863917,0.00033233306,0.000052711996,0.0008366588,0.000090756635,0.000048361857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043345397,0.00017253877,0.00018252387,0.0003138597,0.00057872565,0.0003265942,0.0018756673,0.00013425286,0.0000010228237],"category_scores_gemma":[0.00016019575,0.00018736841,0.000041504372,0.0012353695,0.00005558043,0.00026838938,0.00027032552,0.0006971967,0.0000016057139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010598334,0.00012549895,0.00012802957,0.00062861445,0.00008103221,0.000009760187,0.0017842967,0.05132079,0.00015700479,0.015352143,0.0017452943,0.92865694],"study_design_scores_gemma":[0.00016627093,0.000057697496,0.000014042414,0.00011786917,0.00000585606,0.000009166424,0.000268636,0.98468155,0.00077419874,0.009201978,0.0045196675,0.00018307261],"about_ca_topic_score_codex":0.00003097765,"about_ca_topic_score_gemma":0.000029395273,"teacher_disagreement_score":0.93336076,"about_ca_system_score_codex":0.00012986342,"about_ca_system_score_gemma":0.0000967307,"threshold_uncertainty_score":0.7640662},"labels":[],"label_agreement":null},{"id":"W4404294044","doi":"10.1109/tetc.2024.3487258","title":"Deep Learning Based Intelligent Tumor Analytics Framework for Quantitative Grading and Analyzing Cancer Metastasis: Case of Lymph Node Breast Cancer","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"North China University of Technology; National Natural Science Foundation of China","keywords":"Computer science; Grading (engineering); Breast cancer; Lymph node metastasis; Deep learning; Artificial intelligence; Cancer; Cancer metastasis; Metastasis; Medicine; Internal medicine","score_opus":0.03162139103909787,"score_gpt":0.3747895964033675,"score_spread":0.3431682053642696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404294044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1762599,0.0016816887,0.8190779,0.0020615659,0.0006536076,0.00017277207,0.000014961218,0.000068961126,0.000008628347],"genre_scores_gemma":[0.9250602,0.00027161665,0.0742483,0.00018335436,0.00015236792,0.000022120243,0.000002008729,0.00004308791,0.0000169344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985241,0.000084356456,0.00049431133,0.00040228508,0.00017551838,0.00031941175],"domain_scores_gemma":[0.998706,0.00082604354,0.00011862542,0.00013567728,0.000101724116,0.0001119572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062492327,0.00020619949,0.0004297059,0.0005383887,0.00023164021,0.000055578545,0.00007040698,0.00006877534,0.00003219489],"category_scores_gemma":[0.00010504204,0.00019882205,0.00016656135,0.0006336277,0.00009265715,0.000063350235,0.000003994162,0.0008248645,3.106434e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057029072,0.000062686515,0.003916725,0.00078251236,0.0002678555,0.00024773995,0.0016765406,0.7462288,0.00015333395,0.0009033637,0.000002374142,0.24570103],"study_design_scores_gemma":[0.00043841227,0.000051899387,0.00027185233,0.003412253,0.00040801417,0.00025311025,0.0010393502,0.9929408,0.00066950056,0.00026103904,0.00007534469,0.00017843957],"about_ca_topic_score_codex":0.00069137115,"about_ca_topic_score_gemma":0.000063877895,"teacher_disagreement_score":0.7488003,"about_ca_system_score_codex":0.0002196303,"about_ca_system_score_gemma":0.00011403776,"threshold_uncertainty_score":0.8107728},"labels":[],"label_agreement":null},{"id":"W4406610261","doi":"10.1109/tetc.2025.3528972","title":"Software-Defined Number Formats for High-Speed Belief Propagation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; European Commission","keywords":"Computer science; Software; Parallel computing; Theoretical computer science; Operating system","score_opus":0.021023612039396095,"score_gpt":0.3123285599023229,"score_spread":0.2913049478629268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406610261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056261886,0.000011004433,0.9889641,0.0019608,0.00261384,0.0003210103,0.0000023524246,0.00026523072,0.00023548915],"genre_scores_gemma":[0.30156636,0.0000039336182,0.6976345,0.00039251422,0.0000753857,0.000017427848,8.6425655e-7,0.000009077151,0.0002999232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986261,0.000077141245,0.00040780668,0.00038242643,0.00017193053,0.00033459376],"domain_scores_gemma":[0.9990337,0.00042695602,0.00008508258,0.0003232023,0.00008847884,0.00004257105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044017416,0.00015980897,0.00022120065,0.00019153998,0.00033403508,0.00009839001,0.0004080244,0.00007878397,0.000005314489],"category_scores_gemma":[0.000040863368,0.00016145039,0.00009293783,0.0007462294,0.00002449694,0.00022243502,0.000009615097,0.000264773,0.000006486433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009368409,0.00013393696,0.000103434795,0.000061014074,0.000019551486,0.0000018541679,0.00028186842,0.028255729,0.00012910673,0.03193781,0.00005702037,0.9390093],"study_design_scores_gemma":[0.0010441911,0.00008657312,0.0007007271,0.00021571768,0.000014229116,0.0000038064447,0.000027395772,0.926681,0.012299172,0.057025887,0.0015890333,0.0003122591],"about_ca_topic_score_codex":0.000052642437,"about_ca_topic_score_gemma":0.000007033909,"teacher_disagreement_score":0.93869704,"about_ca_system_score_codex":0.00010155683,"about_ca_system_score_gemma":0.00005451742,"threshold_uncertainty_score":0.6583756},"labels":[],"label_agreement":null},{"id":"W4409723737","doi":"10.1109/tetc.2025.3562136","title":"HyperXArray: Low-Power and Compact Memristive Architecture for In-Memory Encryption on Edge","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Encryption; Architecture; Enhanced Data Rates for GSM Evolution; Non-volatile memory; Memristor; Computer architecture; Embedded system; Computer network; Computer hardware; Electronic engineering; Telecommunications; Engineering","score_opus":0.013067604114430512,"score_gpt":0.27202836096676614,"score_spread":0.2589607568523356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409723737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50316274,0.00005598074,0.49461824,0.00015069447,0.0009664734,0.00021081886,0.0000029152147,0.00012080898,0.0007113567],"genre_scores_gemma":[0.997698,0.000017990993,0.0019603039,0.00014951597,0.0000790881,0.00000763366,0.0000011936226,0.000021025142,0.0000652581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990141,0.00003679528,0.00029224393,0.00028475554,0.00008014829,0.0002919658],"domain_scores_gemma":[0.99932534,0.00044092303,0.000029356674,0.00014928801,0.000019031573,0.00003603943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016267864,0.00019958687,0.00023458486,0.00037553604,0.00017345628,0.00002056399,0.000095949414,0.00008595481,0.000003504371],"category_scores_gemma":[0.000016606213,0.00022042649,0.000063272004,0.00031853252,0.000031150146,0.000058648802,0.0000022204724,0.0005136488,9.0132994e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038625163,0.00003847961,0.00004319562,0.000115898016,0.0000134121265,0.000004572441,0.00073543703,0.9129157,0.003293928,0.00013589098,0.000017356726,0.08264748],"study_design_scores_gemma":[0.002902942,0.00024115716,0.0037857024,0.002320659,0.000031323616,0.000013007272,0.00069081096,0.84156704,0.14286214,0.0033865026,0.0013622602,0.00083647814],"about_ca_topic_score_codex":0.0000065713684,"about_ca_topic_score_gemma":0.00004187264,"teacher_disagreement_score":0.49453527,"about_ca_system_score_codex":0.00013145624,"about_ca_system_score_gemma":0.000012839166,"threshold_uncertainty_score":0.89887315},"labels":[],"label_agreement":null},{"id":"W4415707250","doi":"10.1109/tetc.2025.3625379","title":"Oh-Trust: Overbooking and Hybrid Trading-Empowered Resource Scheduling With Smart Reputation Update Over Dynamic Edge Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Chinese Academy of Engineering; National Natural Science Foundation of China","keywords":"Reputation; Scheduling (production processes); Edge computing; Profitability index; Resource (disambiguation); Dynamic priority scheduling; Futures contract; Overhead (engineering); Resource allocation","score_opus":0.009335662295916472,"score_gpt":0.2577023543734433,"score_spread":0.24836669207752682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415707250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28517574,0.00056431256,0.70214474,0.00078814116,0.009980062,0.00042619277,0.000001007583,0.0002563045,0.0006634904],"genre_scores_gemma":[0.97353417,0.00012078025,0.024515197,0.0006734395,0.00076685235,0.000009272667,0.0000058078404,0.000072000425,0.00030250338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944984,0.00034123636,0.0014291983,0.0018048722,0.00057547254,0.0013508615],"domain_scores_gemma":[0.9976331,0.00055695133,0.00050374545,0.0009520735,0.0001500751,0.00020406529],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015573018,0.0008072757,0.00081007066,0.001190127,0.0018385106,0.0009275269,0.0008698231,0.00030292722,0.000006863033],"category_scores_gemma":[0.000028340228,0.0009399937,0.0002236103,0.0020576678,0.00023314718,0.00066814735,0.00007123353,0.0021246276,0.0000027836163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010530876,0.0001679852,0.0018346363,0.00020908928,0.00016326745,0.000090591515,0.0023655246,0.6526183,0.000037753976,0.00036333824,0.00005386734,0.34199035],"study_design_scores_gemma":[0.0017694064,0.00015624594,0.0021979748,0.0031939878,0.00011344633,0.000066243796,0.00013849814,0.98877007,0.0005769227,0.0004998686,0.0016553737,0.00086197205],"about_ca_topic_score_codex":0.00015138157,"about_ca_topic_score_gemma":0.000056766134,"teacher_disagreement_score":0.6883584,"about_ca_system_score_codex":0.00059904566,"about_ca_system_score_gemma":0.00024620924,"threshold_uncertainty_score":0.99946094},"labels":[],"label_agreement":null}]}