{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011571205,0.00026135542,0.9752142,0.0007357708,0.00007546794,0.00007070024,0.00016345223,0.00020107384,0.011706782],"genre_scores_gemma":[0.8019718,0.0010830077,0.17844068,0.0002292387,0.00021739434,0.0005520337,0.00028113488,0.0001207903,0.017103981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995814,0.00017346916,0.000021438718,0.000058320293,0.000114766925,0.0000506114],"domain_scores_gemma":[0.99944323,0.00027297743,0.000101120095,0.000060630326,0.00007812674,0.000043834407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010153122,0.00091692543,0.00075087015,0.0006874088,0.00080239016,0.0013681855,0.0017356633,0.0018390679,0.0041745654],"category_scores_gemma":[0.0018115349,0.00043149473,0.0010571555,0.0007231354,0.0015655786,0.0024425082,0.0013070855,0.0020848925,0.0005035237],"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.000011897801,0.000023701465,0.00022795076,0.000017567854,0.000013241715,0.00007142277,0.00007061397,0.7423792,0.00045827654,0.2536914,0.00057871785,0.0024560958],"study_design_scores_gemma":[0.0000073375245,0.000017754483,0.000050558523,0.0000054965894,0.0000040782843,0.000012786806,0.000017671171,0.938975,0.00005685055,0.059328433,0.0015184181,0.0000056167296],"about_ca_topic_score_codex":0.008320644,"about_ca_topic_score_gemma":0.0071272706,"teacher_disagreement_score":0.008320644,"about_ca_system_score_codex":0.0010619092,"about_ca_system_score_gemma":0.0014190787,"threshold_uncertainty_score":0.016544402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011031946,0.0002731446,0.9855223,0.00015953335,0.000121500336,0.00010187879,0.000028036475,0.00082923344,0.0019324699],"genre_scores_gemma":[0.6743685,0.0006950764,0.31577688,0.00026562746,0.00018234219,0.00028379014,0.00028304185,0.0001991076,0.007945702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858737,0.00044192627,0.00009497449,0.00022233467,0.000529141,0.00012429681],"domain_scores_gemma":[0.9985115,0.0005235796,0.00023237546,0.00017337507,0.00046684386,0.00009237785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021952405,0.000898666,0.001305294,0.0013613532,0.0009669085,0.00087748707,0.0024581756,0.0012974135,0.001505788],"category_scores_gemma":[0.0046202415,0.00036902248,0.00055885536,0.0009274473,0.0006556276,0.0017760085,0.0019326204,0.0010495661,0.00060876366],"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.00069115695,0.000231275,0.0015824542,0.00045957367,0.00016308682,0.00070985535,0.00087346183,0.5274114,0.03346323,0.050235983,0.008911715,0.3752668],"study_design_scores_gemma":[0.000086003536,0.00049439946,0.00021985515,0.000022660028,0.00004986987,0.0002288514,0.00010338797,0.97268075,0.008520334,0.012774676,0.0047691837,0.000050001352],"about_ca_topic_score_codex":0.0016463044,"about_ca_topic_score_gemma":0.0014258933,"teacher_disagreement_score":0.0024581756,"about_ca_system_score_codex":0.0006267572,"about_ca_system_score_gemma":0.0010978172,"threshold_uncertainty_score":0.0116096735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24102981,0.0014193592,0.7435529,0.00041635157,0.00014438621,0.00039841043,0.00061570713,0.004015193,0.008407939],"genre_scores_gemma":[0.8613412,0.00041668717,0.13203429,0.000110387315,0.000036482117,0.00006893042,0.00055762124,0.000075146985,0.0053592576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953246,0.000066488275,0.000041977764,0.00004517179,0.00020902927,0.00010490543],"domain_scores_gemma":[0.9995091,0.00009803758,0.000067373425,0.00015580255,0.00011921169,0.00005049599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029727575,0.0003086304,0.0005223926,0.0005812761,0.0004432871,0.0007681421,0.00094151916,0.00040361754,0.0020971089],"category_scores_gemma":[0.0008881984,0.00010841656,0.00034520467,0.00082651706,0.00030502217,0.0019588275,0.0009946228,0.0004089183,0.00063016353],"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.0047398964,0.000878744,0.00683383,0.00049246365,0.00020002638,0.0017198081,0.00034635965,0.07068864,0.20134315,0.06590671,0.019519359,0.627331],"study_design_scores_gemma":[0.00029220124,0.00055180164,0.0018383987,0.000028308488,0.0000728844,0.0017697185,0.00017788516,0.81924903,0.14151333,0.010579578,0.02385954,0.0000672609],"about_ca_topic_score_codex":0.0012963519,"about_ca_topic_score_gemma":0.0015107113,"teacher_disagreement_score":0.0020971089,"about_ca_system_score_codex":0.0004834307,"about_ca_system_score_gemma":0.00079914404,"threshold_uncertainty_score":0.0070155263},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051821705,0.0006901391,0.94437826,0.0002235491,0.000067865105,0.000051389226,0.000018965391,0.00032203045,0.0024261768],"genre_scores_gemma":[0.97915787,0.0002434971,0.01934283,0.000029087072,0.00002957281,0.000038200702,0.000017081804,0.000011129088,0.0011306794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976284,0.0010047314,0.0001087811,0.00030325897,0.00070129585,0.00025356727],"domain_scores_gemma":[0.9960692,0.0022226067,0.00050889386,0.000478047,0.00063463766,0.000086497064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001721564,0.00048399158,0.00066107843,0.0009973058,0.00078977,0.0012752485,0.0009581179,0.0010923112,0.0008518777],"category_scores_gemma":[0.005755584,0.00036057457,0.00047211038,0.00092056795,0.0011163338,0.0022388338,0.0015840583,0.0006782209,0.0002316513],"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.00020116959,0.000054026972,0.001766241,0.00014946717,0.00005287872,0.0005156521,0.0005009848,0.84194297,0.010765337,0.094694525,0.0009079144,0.048448753],"study_design_scores_gemma":[0.000009648218,0.000054536322,0.00014687251,0.0000056224335,0.0000093130675,0.000065586544,0.000032755783,0.98871094,0.0012917854,0.008853436,0.00080895395,0.000010689884],"about_ca_topic_score_codex":0.0025519438,"about_ca_topic_score_gemma":0.00164023,"teacher_disagreement_score":0.0025519438,"about_ca_system_score_codex":0.000939528,"about_ca_system_score_gemma":0.001099915,"threshold_uncertainty_score":0.0091046095},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5717593,0.002026493,0.3848749,0.002619666,0.00014546954,0.0003494529,0.0022304226,0.0007709604,0.03522335],"genre_scores_gemma":[0.98404616,0.00055999757,0.008501975,0.00007792555,0.000017084896,0.00015727077,0.00039048723,0.000049969283,0.006198989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976164,0.000055962388,0.000017499993,0.000039956773,0.000063247244,0.00006165787],"domain_scores_gemma":[0.9993395,0.00035729384,0.00006708357,0.000046473993,0.00015982347,0.00002972461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004284387,0.0009036853,0.0005217862,0.00046995273,0.00034480946,0.0007602362,0.00090715074,0.0006853313,0.0036597],"category_scores_gemma":[0.002028917,0.00029958462,0.00075101247,0.0004724528,0.00027844266,0.0010127067,0.00043694646,0.00056614296,0.0006252692],"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.000082194216,0.000029929379,0.0017985401,0.000047106543,0.000009147439,0.000092938964,0.000050625345,0.9816032,0.0014915371,0.0053917523,0.001239546,0.008163476],"study_design_scores_gemma":[0.0000039819665,0.000015517688,0.0005398685,0.0000046027294,0.0000060074894,0.000016014656,0.00001787002,0.99801767,0.00022070052,0.00086611,0.00028739078,0.0000042240968],"about_ca_topic_score_codex":0.022014378,"about_ca_topic_score_gemma":0.016057992,"teacher_disagreement_score":0.022014378,"about_ca_system_score_codex":0.001165284,"about_ca_system_score_gemma":0.00066224474,"threshold_uncertainty_score":0.04377246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054549,0.0011190565,0.93866867,0.00034554678,0.00017631584,0.00025851704,0.000056489203,0.00060790486,0.004218449],"genre_scores_gemma":[0.7747852,0.0007223695,0.21847734,0.00019977789,0.000086176144,0.00038728188,0.0001807621,0.00002433658,0.005136659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897444,0.000232646,0.0000838611,0.00016524801,0.00044579236,0.00009804992],"domain_scores_gemma":[0.99922645,0.00015404329,0.00016226685,0.00022203397,0.00017923521,0.000055902463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093383325,0.00039807017,0.00063388224,0.0007396431,0.00078267284,0.00057212845,0.0012919367,0.00059734785,0.00079609663],"category_scores_gemma":[0.0015802708,0.00021625932,0.00040776975,0.0005620294,0.0005243032,0.0015675334,0.0010941859,0.0006212471,0.0002470373],"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.001168387,0.0003310357,0.0029310146,0.00068860257,0.00024093538,0.0008545453,0.0012195063,0.09076139,0.22589411,0.1909847,0.0050205234,0.47990522],"study_design_scores_gemma":[0.00046211082,0.0017206899,0.0014771704,0.00007290759,0.00030790942,0.002486475,0.00032619465,0.83218807,0.066538975,0.026798587,0.067349866,0.00027102383],"about_ca_topic_score_codex":0.0010043819,"about_ca_topic_score_gemma":0.0009405275,"teacher_disagreement_score":0.0012919367,"about_ca_system_score_codex":0.0005687632,"about_ca_system_score_gemma":0.0007412579,"threshold_uncertainty_score":0.0049386024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12233554,0.0006875256,0.8686375,0.0002957503,0.00007831485,0.00009293221,0.0000658245,0.00115557,0.006650991],"genre_scores_gemma":[0.7399202,0.00023063227,0.2548471,0.00020427315,0.000029656543,0.00027676692,0.00013262816,0.000062704996,0.0042960523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981076,0.000041425326,0.00001040229,0.00005037701,0.000046026536,0.000041087314],"domain_scores_gemma":[0.9997484,0.00012424756,0.000024134866,0.000021093165,0.000068353525,0.000013696191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003329361,0.00052561966,0.00062122464,0.000689373,0.00041382646,0.00076259545,0.0012637555,0.00087802485,0.0018056536],"category_scores_gemma":[0.0009127567,0.00022665014,0.00044251746,0.00074710825,0.00037908956,0.0006414014,0.0006021983,0.00036643827,0.0002219099],"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.0001161319,0.00008963765,0.0009786279,0.000053326174,0.00005482503,0.000080905214,0.000060616763,0.88511777,0.0042428006,0.005938515,0.0011948211,0.10207206],"study_design_scores_gemma":[0.000014718193,0.00001838918,0.00005622047,0.0000020416217,0.0000068073987,0.000012019652,0.000006642505,0.9981883,0.0005179371,0.00092111796,0.00025316095,0.0000026968742],"about_ca_topic_score_codex":0.006915258,"about_ca_topic_score_gemma":0.00505366,"teacher_disagreement_score":0.006915258,"about_ca_system_score_codex":0.0006439632,"about_ca_system_score_gemma":0.0008769117,"threshold_uncertainty_score":0.013750017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011820554,0.0006839316,0.9766361,0.0003672559,0.00015390568,0.00027135815,0.00016317233,0.004966549,0.004937121],"genre_scores_gemma":[0.33430728,0.0011657795,0.65650165,0.00029655237,0.000091658585,0.00050919567,0.00084242184,0.00037282196,0.0059126373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993118,0.0001811557,0.000075480646,0.00010521388,0.0002056127,0.000120677905],"domain_scores_gemma":[0.99966824,0.000065675595,0.0000363769,0.000060941453,0.00007379607,0.00009504139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013174635,0.00072262116,0.0007537266,0.0009318206,0.0009789099,0.0017309923,0.0020696584,0.0010634257,0.0013746278],"category_scores_gemma":[0.0015277918,0.00039196908,0.001343305,0.00047792308,0.0007623971,0.0024664034,0.0030288717,0.0012361788,0.0005878314],"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.00050867454,0.0003754696,0.0050771683,0.00096535624,0.00040527308,0.0013239869,0.0018927238,0.2366695,0.027221816,0.38230687,0.022314971,0.32093823],"study_design_scores_gemma":[0.00007045981,0.00018185719,0.0007026471,0.00010925285,0.00013960093,0.000382921,0.00029697083,0.81610906,0.0055847405,0.052102093,0.12419015,0.00013022394],"about_ca_topic_score_codex":0.014057943,"about_ca_topic_score_gemma":0.017666958,"teacher_disagreement_score":0.014057943,"about_ca_system_score_codex":0.001020881,"about_ca_system_score_gemma":0.0023729245,"threshold_uncertainty_score":0.027952194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05582529,0.0005994464,0.9135649,0.00079433975,0.00033462988,0.00015191652,0.000067913286,0.0022457773,0.026415734],"genre_scores_gemma":[0.7443159,0.0004983862,0.2449676,0.00029293975,0.0001433277,0.00016227626,0.00019940248,0.00016439547,0.009255826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915874,0.00024265652,0.000049651073,0.00017969131,0.00025904193,0.00011020426],"domain_scores_gemma":[0.99891675,0.00029974914,0.00010194581,0.00034372506,0.00017022587,0.00016758403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087978016,0.00045025485,0.00042618552,0.00058857654,0.0013410443,0.0020525116,0.001710383,0.0009886078,0.0029547992],"category_scores_gemma":[0.0020800726,0.0003011433,0.0003310191,0.00047316978,0.0010700786,0.0026669102,0.0032814716,0.0010238474,0.000693388],"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.0005077231,0.00026881602,0.004387242,0.00028965104,0.00007716153,0.0010675318,0.0008871897,0.20516291,0.0471941,0.54346603,0.00944336,0.18724827],"study_design_scores_gemma":[0.00006653086,0.00039302785,0.0013105354,0.000074058626,0.00004492521,0.00089646026,0.00049072265,0.7639516,0.014858641,0.109924935,0.10791889,0.000069655485],"about_ca_topic_score_codex":0.0008535095,"about_ca_topic_score_gemma":0.0012785261,"teacher_disagreement_score":0.0029547992,"about_ca_system_score_codex":0.0009339805,"about_ca_system_score_gemma":0.00072332355,"threshold_uncertainty_score":0.009884834},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027501864,0.00017974911,0.9484453,0.0017501232,0.00010332297,0.00031699796,0.00008559022,0.00012368217,0.021493314],"genre_scores_gemma":[0.828696,0.00036251012,0.16183262,0.00039602604,0.00007223383,0.00046002254,0.00005618231,0.000029035798,0.008095451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774206,0.0013388449,0.0000637541,0.00027220187,0.00040335895,0.00017980245],"domain_scores_gemma":[0.9988085,0.00062922697,0.00013463205,0.000110107445,0.0001559656,0.00016156539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021508038,0.0009353488,0.00085070025,0.00039857122,0.001124691,0.0023373722,0.0021533638,0.0022807915,0.003794481],"category_scores_gemma":[0.003335634,0.00042101988,0.0009990865,0.0005916472,0.0030157722,0.0032278618,0.0018381815,0.0018508381,0.00047163854],"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.00011491391,0.00010642282,0.00025501306,0.00007564104,0.000036495665,0.000246301,0.000348947,0.29458922,0.0025482674,0.6908932,0.0016285945,0.009156937],"study_design_scores_gemma":[0.00007221054,0.00009407043,0.00006305479,0.00001494022,0.000014801832,0.00006909223,0.000059286256,0.83587915,0.00046779535,0.16035262,0.0028864515,0.000026641852],"about_ca_topic_score_codex":0.004463048,"about_ca_topic_score_gemma":0.0038837257,"teacher_disagreement_score":0.004463048,"about_ca_system_score_codex":0.0023293267,"about_ca_system_score_gemma":0.0025539657,"threshold_uncertainty_score":0.01690048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3299303,0.0013804125,0.64879835,0.0016679465,0.00014783621,0.0001925959,0.00023821165,0.00041518488,0.017229235],"genre_scores_gemma":[0.98518986,0.0005479039,0.0104313865,0.00010819314,0.000037512524,0.00009532299,0.00005104618,0.000014444777,0.0035244024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925524,0.0003018056,0.000035316276,0.00009830596,0.00020046555,0.00010885069],"domain_scores_gemma":[0.99822134,0.0011320193,0.00029258823,0.00008203785,0.00020725482,0.000064726446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087366154,0.00042806787,0.0005473342,0.0011646908,0.00076395884,0.00094138185,0.0007791756,0.001241714,0.0007423763],"category_scores_gemma":[0.0044562235,0.0003251747,0.00068319985,0.000723926,0.0008753613,0.0016019188,0.00095495954,0.0005821502,0.00012213615],"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.00006795765,0.00006522354,0.0035933226,0.00012582866,0.000072506096,0.00084984826,0.000581757,0.81016266,0.00466776,0.16391897,0.0014363637,0.014457764],"study_design_scores_gemma":[0.00001526633,0.000020815241,0.00030124068,0.000007936074,0.000015234739,0.00008054222,0.000050389197,0.9823527,0.00024028569,0.015916806,0.0009852858,0.0000135300825],"about_ca_topic_score_codex":0.0071477215,"about_ca_topic_score_gemma":0.003414638,"teacher_disagreement_score":0.0071477215,"about_ca_system_score_codex":0.0011418463,"about_ca_system_score_gemma":0.00077199837,"threshold_uncertainty_score":0.014212251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018172093,0.00023816056,0.97368956,0.0006041663,0.00017205144,0.00029520007,0.000048891492,0.0010536857,0.005726285],"genre_scores_gemma":[0.79692364,0.00057106954,0.19016887,0.00055331644,0.00020737834,0.0005146962,0.00013790446,0.00006575388,0.010857256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764496,0.00081405323,0.00017428245,0.0004322369,0.00064632524,0.00028808348],"domain_scores_gemma":[0.9981559,0.00026066188,0.00025096146,0.00069898576,0.00041190282,0.00022157768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016002686,0.0007950523,0.0006276503,0.00081893883,0.0011497632,0.0015053306,0.0017718603,0.001823066,0.00282729],"category_scores_gemma":[0.0028828897,0.00028520913,0.0010000065,0.00073881214,0.0019440036,0.0048922277,0.0028237686,0.0017584739,0.0020261556],"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.0008376896,0.00045681768,0.003326062,0.0005786469,0.00016446704,0.0014820066,0.0026063537,0.026481321,0.10646751,0.6358999,0.009552917,0.21214634],"study_design_scores_gemma":[0.00026235278,0.0018749607,0.0026011798,0.00022177138,0.00023317701,0.003983015,0.0006444207,0.6694787,0.047324542,0.21517462,0.057830926,0.00037024677],"about_ca_topic_score_codex":0.0011496553,"about_ca_topic_score_gemma":0.00068189955,"teacher_disagreement_score":0.00282729,"about_ca_system_score_codex":0.00074702996,"about_ca_system_score_gemma":0.0011281429,"threshold_uncertainty_score":0.009458244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025706142,0.0009070796,0.9704039,0.00012999066,0.0001340628,0.000074048505,0.00004664719,0.0004851047,0.0021131465],"genre_scores_gemma":[0.8150297,0.00079517846,0.18083856,0.00019377423,0.00012573923,0.00016732204,0.00008202688,0.000029777517,0.0027380574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996941,0.0000959008,0.000016072581,0.000053959793,0.00009715792,0.000042884298],"domain_scores_gemma":[0.99943596,0.00024178586,0.000076118384,0.00007116767,0.0001463933,0.000028477833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005702953,0.0005044679,0.00031396048,0.00054008956,0.0006052906,0.0006571856,0.001200508,0.0004496194,0.0009710083],"category_scores_gemma":[0.0011771988,0.00012396219,0.00026785338,0.00041646315,0.00046918262,0.0008545886,0.0006333303,0.00055065885,0.00027988042],"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.00060017727,0.00015000896,0.0019325998,0.0004829166,0.00010899561,0.00072757015,0.00032690592,0.3547076,0.11327866,0.06304212,0.0042687855,0.46037364],"study_design_scores_gemma":[0.00007058778,0.000452805,0.00032659795,0.000030026227,0.000037453014,0.000487539,0.00006955323,0.95627415,0.015590754,0.017132783,0.009486725,0.00004099948],"about_ca_topic_score_codex":0.00079983927,"about_ca_topic_score_gemma":0.0011038692,"teacher_disagreement_score":0.001200508,"about_ca_system_score_codex":0.00044976393,"about_ca_system_score_gemma":0.0005164637,"threshold_uncertainty_score":0.0032632947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060856476,0.00060288183,0.9174097,0.0014469014,0.0001943429,0.00014436182,0.0005243431,0.00053098705,0.01829007],"genre_scores_gemma":[0.9221947,0.00095483643,0.06116485,0.00025148853,0.00012349132,0.00040227553,0.0003790001,0.00010593703,0.014423369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991302,0.00031257985,0.000041454176,0.00014824797,0.00024182648,0.00012571027],"domain_scores_gemma":[0.99874735,0.0005163087,0.00020642759,0.00014206895,0.00033797915,0.00004981642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013385504,0.00086562254,0.0006639327,0.00078267505,0.0006679778,0.0014024944,0.0023775648,0.0014951947,0.0037731365],"category_scores_gemma":[0.0033783652,0.00051875843,0.0007493822,0.00084797124,0.0010238616,0.002552063,0.000909646,0.0015326769,0.0007908119],"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.00005808466,0.0000318065,0.0004030589,0.00002996679,0.000012642416,0.000082473816,0.00006728314,0.9585343,0.00097578863,0.035215948,0.0009903067,0.0035984544],"study_design_scores_gemma":[0.000010036674,0.000023806853,0.00008258869,0.0000044076396,0.00000720305,0.000016662789,0.0000102049235,0.99333644,0.00015203517,0.0057096006,0.000639878,0.0000070226765],"about_ca_topic_score_codex":0.009114253,"about_ca_topic_score_gemma":0.0051980233,"teacher_disagreement_score":0.009114253,"about_ca_system_score_codex":0.0014535506,"about_ca_system_score_gemma":0.0012053599,"threshold_uncertainty_score":0.018122435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39826748,0.0033136446,0.57764494,0.000591736,0.00023080906,0.00013298793,0.00011620073,0.001601019,0.018101262],"genre_scores_gemma":[0.9628366,0.00042618235,0.03512153,0.00008271058,0.000021329326,0.000018010081,0.00003400196,0.000023001834,0.00143653],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998165,0.00003078014,0.0000074330333,0.000029696595,0.00008579705,0.000029852286],"domain_scores_gemma":[0.9997483,0.000068886664,0.000056671706,0.00006896719,0.000047048943,0.0000100102025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016110478,0.00033812653,0.0001681864,0.00025295562,0.00025638993,0.00044341775,0.0005529523,0.00032730555,0.0018059158],"category_scores_gemma":[0.00043146222,0.00010437455,0.00019276896,0.00023995235,0.00026317633,0.00087311055,0.00027082622,0.00037280415,0.0002639435],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00035529732,0.00013194491,0.0021400042,0.00050078303,0.00013575937,0.00026350768,0.000087788874,0.07197084,0.7035674,0.048852853,0.0021825281,0.16981128],"study_design_scores_gemma":[0.000048364083,0.0013714453,0.00338889,0.00006040744,0.00017927945,0.0009104926,0.00008330981,0.40314305,0.5496758,0.0117976125,0.029296692,0.000044628778],"about_ca_topic_score_codex":0.00026850178,"about_ca_topic_score_gemma":0.00064855,"teacher_disagreement_score":0.0018059158,"about_ca_system_score_codex":0.0004534441,"about_ca_system_score_gemma":0.00037952838,"threshold_uncertainty_score":0.006041348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97542655,0.00039203733,0.020441944,0.00041021538,0.000081029495,0.000047661775,0.00006642587,0.0005654546,0.0025685832],"genre_scores_gemma":[0.99851793,0.000052237494,0.0010888453,0.000042046042,0.000012565127,0.000016755923,0.00003067079,0.00003759505,0.00020133021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977659,0.00049602735,0.00014836226,0.0002843338,0.0008347938,0.00047069284],"domain_scores_gemma":[0.976595,0.017024655,0.0016799421,0.0016790709,0.0023642252,0.0006571775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034568645,0.000750092,0.0007900015,0.00090304186,0.0009408936,0.00106293,0.0010584278,0.0010096601,0.0008550643],"category_scores_gemma":[0.026537577,0.00033408936,0.0002545148,0.0006364754,0.0009898961,0.0016664697,0.00069676567,0.0008038392,0.00028835755],"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.0053858575,0.0012710624,0.024898456,0.00028266083,0.00021415291,0.0008431642,0.00059623795,0.7944301,0.10197196,0.0029991881,0.0014013137,0.065705866],"study_design_scores_gemma":[0.000071509,0.0010309182,0.007813438,0.000018143855,0.000069665024,0.00026596602,0.00014678306,0.9617645,0.02727661,0.0011546528,0.00034757817,0.000040163173],"about_ca_topic_score_codex":0.002860261,"about_ca_topic_score_gemma":0.0015685166,"teacher_disagreement_score":0.0034568645,"about_ca_system_score_codex":0.0011693877,"about_ca_system_score_gemma":0.0010231024,"threshold_uncertainty_score":0.018281817},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026753275,0.027530402,0.011016677,0.019454217,0.8500601,0.00064711936,0.0010118524,0.0006845827,0.08691963],"genre_scores_gemma":[0.016585363,0.04286117,0.0072039105,0.009866643,0.49776864,0.0005969962,0.004598982,0.0011571021,0.41936117],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99705017,0.00040212472,0.0003256139,0.0003794736,0.0014779445,0.00036455167],"domain_scores_gemma":[0.9866338,0.0020589319,0.0006260808,0.0006929336,0.0077014696,0.0022868544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029837338,0.0019163012,0.002836932,0.002887797,0.0014375903,0.006530863,0.0016829153,0.002519318,0.09683406],"category_scores_gemma":[0.00733056,0.00057843566,0.0013931493,0.0021977131,0.0008583051,0.0037410513,0.0014070228,0.0040098247,0.057926543],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009223456,0.00010159559,0.00042742785,0.0003971454,0.000044794735,0.00015917701,0.000031085507,0.0001769201,0.0010431574,0.0016341476,0.92814654,0.067745775],"study_design_scores_gemma":[0.000025249252,0.00011082126,0.0015488364,0.00022863712,0.000042139734,0.00047477608,0.00006697762,0.0012834611,0.0005167689,0.0017971665,0.9938817,0.000023511133],"about_ca_topic_score_codex":0.00086911605,"about_ca_topic_score_gemma":0.0012964741,"teacher_disagreement_score":0.09683406,"about_ca_system_score_codex":0.0013136895,"about_ca_system_score_gemma":0.0022202292,"threshold_uncertainty_score":0.32394218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018175624,0.00021991487,0.9748843,0.0003048287,0.00007104124,0.00004543024,0.000047315265,0.000120745106,0.006130834],"genre_scores_gemma":[0.88574487,0.0007113409,0.102981836,0.00024893545,0.00009683268,0.00018614538,0.00009128856,0.000040304203,0.009898433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990025,0.00025185,0.000050663293,0.00022517137,0.0003379591,0.00013188567],"domain_scores_gemma":[0.9993612,0.00019826165,0.000119982345,0.00014522836,0.0001425183,0.000032835465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081229117,0.00069621735,0.0005060536,0.00057023903,0.00071474287,0.0012647966,0.0010524301,0.0013283956,0.0021859028],"category_scores_gemma":[0.0014679659,0.00026269327,0.0006850401,0.00052653055,0.0015088337,0.0027770689,0.0014922069,0.0016087168,0.0006716144],"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.00019360168,0.000059983246,0.00062229246,0.00012758613,0.000045382778,0.0007300622,0.0003423616,0.18649577,0.024115294,0.7575092,0.002054869,0.027703548],"study_design_scores_gemma":[0.000023239832,0.00016821429,0.00014400308,0.000023769016,0.000025629943,0.00038837435,0.0000430499,0.91402483,0.005545056,0.075023234,0.0045542754,0.000036332705],"about_ca_topic_score_codex":0.0010672397,"about_ca_topic_score_gemma":0.0005460024,"teacher_disagreement_score":0.0021859028,"about_ca_system_score_codex":0.00089727266,"about_ca_system_score_gemma":0.0006093372,"threshold_uncertainty_score":0.007312596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01784292,0.0006751096,0.97841716,0.000237522,0.00009167426,0.00009863203,0.000012791124,0.00029225933,0.0023318909],"genre_scores_gemma":[0.5384644,0.0008130099,0.45464587,0.00021058018,0.0001508344,0.00051658595,0.00007949567,0.00024255367,0.004876578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760866,0.0009740831,0.00012738658,0.00039447754,0.00068591017,0.00020941833],"domain_scores_gemma":[0.99593276,0.0023073822,0.00053743983,0.00055834925,0.00048444947,0.00017966407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002921085,0.0012670845,0.0012056401,0.0008679,0.00090587063,0.0015680732,0.0012320487,0.0010391987,0.0035436044],"category_scores_gemma":[0.0055855876,0.000776317,0.0011795346,0.0011365467,0.0010309936,0.0017043808,0.0020238457,0.001923941,0.0005028129],"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.00026941547,0.00025721267,0.0010527843,0.00031287185,0.000101997255,0.00014061466,0.00019503637,0.79814106,0.014352576,0.0478712,0.0015105043,0.13579477],"study_design_scores_gemma":[0.000030392885,0.00013137862,0.00016880162,0.000016261747,0.000033767727,0.000068037596,0.000023261244,0.9804734,0.0044342712,0.011638718,0.0029692757,0.000012534398],"about_ca_topic_score_codex":0.0008625536,"about_ca_topic_score_gemma":0.001759054,"teacher_disagreement_score":0.0035436044,"about_ca_system_score_codex":0.001189561,"about_ca_system_score_gemma":0.002553905,"threshold_uncertainty_score":0.015448391},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16037758,0.0022848384,0.8287363,0.0004648755,0.00012345117,0.0002612233,0.00039582024,0.0016811142,0.0056747887],"genre_scores_gemma":[0.8878965,0.0006602185,0.10797879,0.000109116074,0.00004271059,0.00007495884,0.00017945612,0.00004896756,0.003009248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986003,0.00026104815,0.00014600079,0.00012276703,0.0006000561,0.00026986768],"domain_scores_gemma":[0.99776316,0.0006350801,0.0002543434,0.00080475817,0.0004418709,0.000100794656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088382576,0.0003569366,0.0010596492,0.00081846764,0.0008616754,0.0016192603,0.001271843,0.00076139474,0.0020104388],"category_scores_gemma":[0.0036111872,0.00024236867,0.00057010184,0.0018097959,0.00075362826,0.004648341,0.0021810906,0.00062179717,0.001013518],"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.003131528,0.00064721104,0.0045862244,0.0010884773,0.00019873101,0.001656797,0.0011630567,0.14378978,0.22390135,0.13844776,0.0115035,0.46988565],"study_design_scores_gemma":[0.00016197286,0.00047891395,0.00079676125,0.000056603276,0.00008396,0.0017185915,0.0003943929,0.8365327,0.110232145,0.0395624,0.009845433,0.00013616466],"about_ca_topic_score_codex":0.0019296473,"about_ca_topic_score_gemma":0.0018851623,"teacher_disagreement_score":0.0020104388,"about_ca_system_score_codex":0.0007317907,"about_ca_system_score_gemma":0.0017041415,"threshold_uncertainty_score":0.0067255497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41191262,0.00031538145,0.5768102,0.0009087768,0.000037731425,0.00006679096,0.000120507255,0.00024658686,0.009581334],"genre_scores_gemma":[0.99335515,0.00012618239,0.0053700493,0.00002425471,0.00001170826,0.000037704296,0.000017048646,0.000020739013,0.0010370727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997062,0.000117814714,0.0000099001,0.00004895671,0.00005636786,0.000060681337],"domain_scores_gemma":[0.9988555,0.00067521667,0.00024100149,0.0000778898,0.00008559507,0.0000648327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005948855,0.00075414,0.0004395688,0.0007229156,0.0003710266,0.00086983305,0.00086375355,0.00076473603,0.0015018885],"category_scores_gemma":[0.0031370255,0.00028690248,0.00060023053,0.00048084027,0.001036103,0.001639432,0.0008100796,0.00068295444,0.00011474348],"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.000021855783,0.000010024206,0.00061816804,0.000011169008,0.000009570949,0.00004560226,0.000026656371,0.9832418,0.0005871282,0.013623737,0.00011278932,0.0016914211],"study_design_scores_gemma":[0.0000019913912,0.0000065295894,0.00012961606,0.0000012360373,0.0000038160124,0.0000071862614,0.0000074690247,0.9941896,0.00006729242,0.0055258404,0.000057208294,0.0000021450542],"about_ca_topic_score_codex":0.0051379,"about_ca_topic_score_gemma":0.0030236105,"teacher_disagreement_score":0.0051379,"about_ca_system_score_codex":0.0012516725,"about_ca_system_score_gemma":0.00047271064,"threshold_uncertainty_score":0.010215998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9589582,0.0014430229,0.028822202,0.00025072607,0.00012427592,0.00017258676,0.00019164689,0.0009198642,0.009117475],"genre_scores_gemma":[0.9956624,0.00017180858,0.0035428258,0.00002461848,0.000010011499,0.000025329564,0.000119685654,0.000012846771,0.00043055185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863213,0.0003667966,0.00011138813,0.00010685888,0.0005516587,0.0002310394],"domain_scores_gemma":[0.99424416,0.0025934773,0.0003992564,0.00036409785,0.002170137,0.00022880819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002360778,0.0008037454,0.0005868202,0.0010959369,0.00057268847,0.0008349642,0.0009283928,0.00048900873,0.0009711666],"category_scores_gemma":[0.008067141,0.00014028414,0.00015934343,0.0008200169,0.0004302065,0.00081820996,0.00064853765,0.00040081772,0.00017471335],"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.0019687219,0.00058948493,0.009954282,0.00047815873,0.00012658793,0.00044157583,0.00023642297,0.839299,0.043840345,0.0043427814,0.0027809246,0.09594183],"study_design_scores_gemma":[0.00004268633,0.0013457097,0.0020551456,0.00001829207,0.00004190352,0.00014564674,0.0001438987,0.9799313,0.014477079,0.0004324964,0.0013366041,0.000029254905],"about_ca_topic_score_codex":0.0047038,"about_ca_topic_score_gemma":0.0030311835,"teacher_disagreement_score":0.0047038,"about_ca_system_score_codex":0.001114941,"about_ca_system_score_gemma":0.0010394838,"threshold_uncertainty_score":0.0124851465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0448577,0.00082634727,0.8873199,0.0014571589,0.00075630983,0.0013142287,0.00062536454,0.027271178,0.035571754],"genre_scores_gemma":[0.74260247,0.0006979128,0.23148143,0.00097266206,0.0002511669,0.00095147913,0.000890278,0.00051177246,0.021640955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995634,0.000100291465,0.000028317363,0.00010989136,0.0001412591,0.000056818306],"domain_scores_gemma":[0.9994748,0.0001239869,0.000052277082,0.00013157407,0.00009175788,0.00012555065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043439525,0.0006613299,0.0006732123,0.00051311945,0.00089751295,0.0016551324,0.001820969,0.0011655837,0.0054370263],"category_scores_gemma":[0.0016207179,0.00043927666,0.0005208026,0.00036936457,0.00096548814,0.0015957261,0.0038532089,0.0011317699,0.0018137549],"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.0017128314,0.00067419896,0.0078424895,0.0016581679,0.00040496807,0.0029083022,0.0022182318,0.20940061,0.1883187,0.14642271,0.072475344,0.36596346],"study_design_scores_gemma":[0.0003018251,0.00060959527,0.0020311552,0.00009568861,0.00012265738,0.0009058367,0.00022468722,0.761102,0.022698466,0.03491626,0.176848,0.00014371151],"about_ca_topic_score_codex":0.0021679818,"about_ca_topic_score_gemma":0.0014137507,"teacher_disagreement_score":0.0054370263,"about_ca_system_score_codex":0.0005320391,"about_ca_system_score_gemma":0.00095876213,"threshold_uncertainty_score":0.018188655},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020135231,0.00012142686,0.99678826,0.000070813345,0.00002169416,0.00003864703,0.000030665382,0.0006286697,0.00028633192],"genre_scores_gemma":[0.21862659,0.00053120195,0.7770246,0.000325756,0.00014533129,0.0003487452,0.0003238306,0.0003136328,0.0023603404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785393,0.000425194,0.00014302567,0.0004406875,0.0009618195,0.00017537079],"domain_scores_gemma":[0.99702305,0.001415006,0.00029360384,0.0006340102,0.0004907205,0.000143654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003464021,0.0010082748,0.0014625053,0.0013199294,0.001113708,0.0013788169,0.0036992691,0.0012085065,0.001219407],"category_scores_gemma":[0.0058784485,0.0006330705,0.0010258582,0.0011822867,0.0013400498,0.0033576728,0.0024995832,0.0019065449,0.00036362247],"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.00060662115,0.00038541816,0.0024105746,0.00046829513,0.00021100036,0.00035340886,0.0008138937,0.48031944,0.05353864,0.08071293,0.008612806,0.37156698],"study_design_scores_gemma":[0.000042883392,0.00014358871,0.00022673937,0.000024346433,0.000027852697,0.00011464421,0.00005296786,0.96873426,0.011464562,0.011687192,0.0074389908,0.000041961168],"about_ca_topic_score_codex":0.003772837,"about_ca_topic_score_gemma":0.0039039874,"teacher_disagreement_score":0.003772837,"about_ca_system_score_codex":0.0009786764,"about_ca_system_score_gemma":0.0020516387,"threshold_uncertainty_score":0.018319726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009894675,0.00020849128,0.9871622,0.000200347,0.000023582243,0.00007258247,0.000023092796,0.00033565343,0.0020794682],"genre_scores_gemma":[0.42685404,0.00046491262,0.5690309,0.00016614639,0.00013877629,0.00037986378,0.0001803509,0.00016868043,0.0026163375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978301,0.000710039,0.00008809337,0.00045552096,0.00072168146,0.00019449057],"domain_scores_gemma":[0.99428517,0.0033521391,0.0007463043,0.000879519,0.0005733519,0.00016355197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018425294,0.00087152387,0.0011324837,0.0008484328,0.0010037629,0.0011830842,0.0021854588,0.0013693509,0.0020280743],"category_scores_gemma":[0.008753991,0.00057351193,0.0008115492,0.001509803,0.0011472196,0.0019735037,0.0025743577,0.0017983288,0.00043873052],"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.0002059448,0.00017715615,0.0011662884,0.00018206796,0.000045635043,0.00010324807,0.00023695445,0.7642054,0.007448587,0.098667935,0.0029846162,0.12457619],"study_design_scores_gemma":[0.00005877204,0.00007847425,0.00020190456,0.00001129547,0.000014477704,0.0000989397,0.00002837943,0.96651477,0.0023481972,0.027811721,0.002818174,0.0000148299],"about_ca_topic_score_codex":0.0014790003,"about_ca_topic_score_gemma":0.0013555062,"teacher_disagreement_score":0.0021854588,"about_ca_system_score_codex":0.0013121214,"about_ca_system_score_gemma":0.001624793,"threshold_uncertainty_score":0.009744346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019115478,0.0004739667,0.97904325,0.0001217015,0.00003082882,0.00003156156,0.000021051557,0.00008152081,0.0010806847],"genre_scores_gemma":[0.9307321,0.0005338674,0.067231745,0.00008599452,0.000066003995,0.00010341657,0.00003886393,0.00004104262,0.0011670353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983942,0.0006426361,0.000069508096,0.000274967,0.00034075894,0.00027794304],"domain_scores_gemma":[0.9975932,0.0016398616,0.00026693716,0.00014949703,0.00025301508,0.000097293676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026013895,0.001086547,0.0010933856,0.00049849454,0.00046006462,0.0012870597,0.0012828716,0.0006711892,0.0006954508],"category_scores_gemma":[0.0050260504,0.00048435156,0.0005126401,0.00091465155,0.0013364969,0.0016408664,0.0012339725,0.0011495118,0.00011703959],"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.00013438566,0.00008748604,0.00041887304,0.000091090886,0.000042923653,0.00007331081,0.00008764554,0.94105315,0.004096597,0.02299138,0.00047743687,0.030445678],"study_design_scores_gemma":[0.000006906763,0.00002160323,0.00005218351,0.0000027494596,0.0000067594938,0.000010910254,0.000008270595,0.9949797,0.000565063,0.0042304615,0.00011041772,0.0000049509763],"about_ca_topic_score_codex":0.0029711032,"about_ca_topic_score_gemma":0.0025860341,"teacher_disagreement_score":0.0029711032,"about_ca_system_score_codex":0.0010172549,"about_ca_system_score_gemma":0.0013494965,"threshold_uncertainty_score":0.0137575865},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89956206,0.0005026424,0.08805763,0.00024384022,0.00003110167,0.00007663647,0.0004415334,0.001889031,0.009195472],"genre_scores_gemma":[0.98382056,0.000075076234,0.014977696,0.000024059871,0.000009074738,0.000034085468,0.00023765047,0.00007728467,0.0007445033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931943,0.00017502508,0.000029933239,0.00008634822,0.00029429718,0.0000950356],"domain_scores_gemma":[0.998295,0.0008702015,0.00019091796,0.00022797713,0.00036878043,0.00004713089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010272523,0.00073142006,0.0004162226,0.0007221582,0.00027089828,0.0004489361,0.00071483856,0.00036198273,0.002229675],"category_scores_gemma":[0.0029344857,0.000253251,0.00035715036,0.00080663717,0.00043095887,0.0007277022,0.00041504094,0.0003728285,0.00036416177],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087173417,0.00012358738,0.006081134,0.00021446109,0.00006546035,0.00021727922,0.000098542696,0.91245914,0.030546544,0.003081106,0.0013991344,0.0448419],"study_design_scores_gemma":[0.000015664355,0.00023553775,0.0011860892,0.0000045604525,0.000008633437,0.00003260363,0.000019648702,0.9795725,0.018085577,0.0005194787,0.0003142569,0.0000055217274],"about_ca_topic_score_codex":0.0010630955,"about_ca_topic_score_gemma":0.0012460479,"teacher_disagreement_score":0.002229675,"about_ca_system_score_codex":0.0006981565,"about_ca_system_score_gemma":0.00057088706,"threshold_uncertainty_score":0.007458985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123507544,0.0023198659,0.86088467,0.0009951363,0.00017505458,0.00015882637,0.00035339897,0.0011162097,0.010489296],"genre_scores_gemma":[0.8946082,0.001361012,0.09961619,0.00033642075,0.00019968,0.00006828078,0.0003076641,0.00007309367,0.0034294827],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999198,0.00015342623,0.000039281025,0.00012387658,0.0003778457,0.0001075011],"domain_scores_gemma":[0.99857223,0.00044277846,0.00022884524,0.00044081698,0.00027422118,0.000041079373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007191361,0.0004903348,0.00037490693,0.000594453,0.00042979437,0.00063946535,0.0006028075,0.0007652149,0.00096214376],"category_scores_gemma":[0.0030876407,0.0001384047,0.00032429176,0.0004454515,0.00069855753,0.0014220529,0.00074185466,0.0007110599,0.00028423162],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0009482193,0.00014385462,0.0021589885,0.00051755225,0.000107690554,0.0022396755,0.00068257994,0.0426343,0.51349825,0.058659,0.0062879575,0.372122],"study_design_scores_gemma":[0.00007657379,0.0006615572,0.0038415275,0.00015548136,0.000118358344,0.0033068615,0.00026960068,0.45798635,0.48223388,0.027744843,0.023517422,0.0000875489],"about_ca_topic_score_codex":0.0008882865,"about_ca_topic_score_gemma":0.0006338366,"teacher_disagreement_score":0.00096214376,"about_ca_system_score_codex":0.0004582775,"about_ca_system_score_gemma":0.0005134563,"threshold_uncertainty_score":0.0038031936},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76767814,0.0031024658,0.19982518,0.001044045,0.000406498,0.0007449092,0.0013019764,0.018877517,0.007019237],"genre_scores_gemma":[0.9341327,0.00032288744,0.06265946,0.0001263845,0.000039756782,0.00007821287,0.0012486153,0.00014003305,0.0012519371],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98883307,0.0031989077,0.0007214396,0.0018305427,0.004648142,0.00076789275],"domain_scores_gemma":[0.96953034,0.015566026,0.0019049753,0.00579634,0.006436979,0.000765442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007958068,0.0011762388,0.0014305245,0.0011377058,0.00075176684,0.0019021354,0.004381361,0.0018348248,0.0017579157],"category_scores_gemma":[0.044238824,0.00049345917,0.00051924225,0.0012025302,0.00080764707,0.0029090259,0.0026135424,0.0015407475,0.00080002565],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004572385,0.0018378458,0.0482758,0.0009275102,0.00038437542,0.0005024161,0.0003911727,0.3687933,0.030738188,0.0043234196,0.009489637,0.529764],"study_design_scores_gemma":[0.00012226046,0.00057668675,0.0037099149,0.000026288963,0.000051567295,0.00022238662,0.00010991773,0.97796726,0.015218544,0.0007585673,0.0012061871,0.000030399327],"about_ca_topic_score_codex":0.013658133,"about_ca_topic_score_gemma":0.0070029767,"teacher_disagreement_score":0.013658133,"about_ca_system_score_codex":0.0025575492,"about_ca_system_score_gemma":0.0024266543,"threshold_uncertainty_score":0.04208678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96027994,0.00019608508,0.031990312,0.00038037362,0.000017514765,0.0000879419,0.005239321,0.00077506056,0.0010333052],"genre_scores_gemma":[0.96955085,0.000116269985,0.02339908,0.000030082692,0.000008363594,0.000055298886,0.0062337248,0.000018437137,0.0005879007],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997043,0.00005492003,0.000041596122,0.00010543312,0.000054562268,0.00003913434],"domain_scores_gemma":[0.9995421,0.00015776645,0.00009777424,0.00008846199,0.00008291221,0.00003091438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030419277,0.00033906978,0.00039324537,0.0016370519,0.00023104735,0.00038627858,0.00041994784,0.00038998772,0.0006525239],"category_scores_gemma":[0.0014585194,0.00015935847,0.00041369454,0.0019556426,0.00010877942,0.0006530673,0.0003154628,0.00027656078,0.00034123566],"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.00053127494,0.0007569476,0.6122247,0.00030069068,0.00032286425,0.0009292058,0.0005875515,0.05897289,0.011532801,0.0016533762,0.007720645,0.304467],"study_design_scores_gemma":[0.00003225626,0.00013541206,0.22412635,0.00003885145,0.00008652515,0.00059490436,0.0013676578,0.75565094,0.008217207,0.0044385977,0.0052861455,0.000025137568],"about_ca_topic_score_codex":0.00669177,"about_ca_topic_score_gemma":0.015618374,"teacher_disagreement_score":0.00669177,"about_ca_system_score_codex":0.0003480306,"about_ca_system_score_gemma":0.00038666412,"threshold_uncertainty_score":0.013305664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10586237,0.0019287015,0.888672,0.00026286195,0.00010259382,0.00007570178,0.00006754904,0.00096832414,0.002059872],"genre_scores_gemma":[0.8391451,0.0023249076,0.1570646,0.00008129953,0.000050956744,0.00006873937,0.000111454305,0.00003046776,0.0011225076],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994561,0.00013125203,0.000032965912,0.000096459626,0.00025015188,0.00003302891],"domain_scores_gemma":[0.9992787,0.00024997586,0.00021179132,0.00007889745,0.00016024214,0.000020363623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004258765,0.00075643894,0.00042904852,0.0010724441,0.00029368288,0.0005207716,0.0005607522,0.00062361173,0.0003517458],"category_scores_gemma":[0.0020599647,0.00025408663,0.0003087711,0.0010067333,0.00042596884,0.0016066786,0.00093853223,0.0003147295,0.0001519239],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005041263,0.00009914792,0.0131573,0.0005446693,0.0001561109,0.0006071357,0.0002675677,0.37397757,0.15714462,0.0064340318,0.0016570805,0.4454506],"study_design_scores_gemma":[0.000011568787,0.0002620943,0.0038480556,0.000029305498,0.000057487418,0.0005412495,0.00018609196,0.9342973,0.05229852,0.004905733,0.0035284024,0.00003421611],"about_ca_topic_score_codex":0.000769708,"about_ca_topic_score_gemma":0.00072082534,"teacher_disagreement_score":0.0010724441,"about_ca_system_score_codex":0.00028693752,"about_ca_system_score_gemma":0.00026105437,"threshold_uncertainty_score":0.0022522807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032660253,0.0042036776,0.97169805,0.00052163686,0.00016525495,0.000062595405,0.000069806585,0.00025740988,0.019755531],"genre_scores_gemma":[0.293197,0.019607153,0.6670444,0.0012185395,0.00080347754,0.0005632826,0.00038761745,0.00021592293,0.016962506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988279,0.00027031175,0.00008160485,0.00016576005,0.00052035373,0.0001341672],"domain_scores_gemma":[0.9987955,0.0007166036,0.0000910929,0.0001791839,0.00018754597,0.000030082827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000966594,0.0010550095,0.0006762152,0.0012930188,0.0008247851,0.0017245987,0.0012681658,0.0010555997,0.0047577005],"category_scores_gemma":[0.0031096158,0.0006192679,0.00083496334,0.0018701011,0.002339981,0.0024518417,0.0011726643,0.0026166977,0.0018712779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000052170773,0.000042185242,0.00017539793,0.00041242957,0.000023927241,0.00012163546,0.00018006736,0.04442825,0.007197246,0.8481247,0.0034266023,0.09581539],"study_design_scores_gemma":[0.00005687135,0.00018811332,0.00017641671,0.0002604016,0.000035665053,0.0005395639,0.00005126289,0.14037181,0.01039025,0.7634683,0.08440658,0.000054790213],"about_ca_topic_score_codex":0.0007922016,"about_ca_topic_score_gemma":0.0007388657,"teacher_disagreement_score":0.0047577005,"about_ca_system_score_codex":0.0015029015,"about_ca_system_score_gemma":0.0010103518,"threshold_uncertainty_score":0.01591611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20455438,0.0018027155,0.7447065,0.0016437002,0.0007381022,0.0004259075,0.0009941916,0.035466384,0.009668083],"genre_scores_gemma":[0.8417028,0.0005196845,0.15164894,0.00041027943,0.00013189513,0.00013887604,0.0008360545,0.000560295,0.004051327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991284,0.000205704,0.00008011479,0.00011116548,0.00030845098,0.00016609764],"domain_scores_gemma":[0.9967528,0.00077940023,0.00035691302,0.0011342922,0.00074828276,0.00022816678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001330097,0.000505432,0.0004628281,0.00076841924,0.000846552,0.0011450835,0.001739847,0.00075341424,0.001803205],"category_scores_gemma":[0.0062231263,0.00032793332,0.0003219619,0.0009445808,0.00084112294,0.0027635626,0.0016950575,0.0008274032,0.00048523722],"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.0034601507,0.00041645791,0.009500145,0.00081546704,0.00025741453,0.0009732597,0.0011443123,0.20107664,0.1908053,0.04404414,0.110081404,0.43742535],"study_design_scores_gemma":[0.00023601757,0.0005017616,0.002482431,0.000046201687,0.00006817359,0.00042754016,0.00014356546,0.79219544,0.16681239,0.007883422,0.02907844,0.0001245451],"about_ca_topic_score_codex":0.0037890882,"about_ca_topic_score_gemma":0.0037873301,"teacher_disagreement_score":0.0037890882,"about_ca_system_score_codex":0.0010901962,"about_ca_system_score_gemma":0.0013533058,"threshold_uncertainty_score":0.007909954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042242412,0.00075813907,0.9932755,0.00023949775,0.00005524204,0.00004189983,0.000088366905,0.00041764427,0.00089957943],"genre_scores_gemma":[0.19023822,0.0016858439,0.804198,0.00014915323,0.00013321136,0.00013845754,0.0006261621,0.00018723999,0.0026436555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840087,0.0005938223,0.00011216973,0.00033363185,0.00044872257,0.00011080975],"domain_scores_gemma":[0.9978752,0.0005296006,0.00028239234,0.00040181624,0.0007974349,0.00011351077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018547846,0.0015290689,0.0011082027,0.0028344765,0.0013801109,0.0017485531,0.0016873146,0.0008770232,0.0018480064],"category_scores_gemma":[0.0039156973,0.00047357546,0.0015604277,0.004298206,0.00096810044,0.002567757,0.0016571073,0.0014000696,0.0009309229],"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.00019763397,0.00015412857,0.0024702798,0.0005120704,0.0003335662,0.00025658726,0.0006700847,0.41139272,0.011242775,0.08961341,0.010606323,0.47255036],"study_design_scores_gemma":[0.0000062911854,0.000035702382,0.0005136049,0.00001874447,0.00002960709,0.00006835576,0.00014909923,0.9620001,0.0019786933,0.030538192,0.0046296837,0.000031988304],"about_ca_topic_score_codex":0.010984384,"about_ca_topic_score_gemma":0.012802789,"teacher_disagreement_score":0.010984384,"about_ca_system_score_codex":0.0016030617,"about_ca_system_score_gemma":0.0016628917,"threshold_uncertainty_score":0.02184093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06418912,0.0008645196,0.92999077,0.0006000541,0.00008554036,0.00005040028,0.0000429664,0.00044107783,0.0037354443],"genre_scores_gemma":[0.95521367,0.00020944719,0.042388994,0.0002263006,0.00003928665,0.00004792326,0.00003955319,0.000025004549,0.00180988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997311,0.00006912318,0.00001281733,0.000062571766,0.00004521387,0.000079100304],"domain_scores_gemma":[0.9994487,0.00028201911,0.00007142321,0.000030926618,0.000110483896,0.000056539273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006507228,0.000653363,0.00080353516,0.00030593725,0.00030394347,0.00059058715,0.0011317832,0.00077362894,0.0011299008],"category_scores_gemma":[0.0013614077,0.00026096008,0.00028954347,0.00027815398,0.0006167658,0.0007882152,0.0006761376,0.001033084,0.00015552122],"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.00008221298,0.00009315675,0.0009383404,0.000039737064,0.000033661072,0.000068566565,0.000036032805,0.94563156,0.0022551687,0.003936118,0.0011127819,0.045772657],"study_design_scores_gemma":[0.000002792961,0.000009759731,0.0000326774,0.000001318461,0.0000021438118,0.000003642006,0.0000021041058,0.999146,0.00011381357,0.0006165761,0.000067822504,0.0000014172704],"about_ca_topic_score_codex":0.007119002,"about_ca_topic_score_gemma":0.006459351,"teacher_disagreement_score":0.007119002,"about_ca_system_score_codex":0.0008118845,"about_ca_system_score_gemma":0.0010235884,"threshold_uncertainty_score":0.014155149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14555281,0.0011972253,0.8305187,0.00043812464,0.000059704424,0.0001232948,0.00013875328,0.00089035893,0.021081042],"genre_scores_gemma":[0.73072803,0.00052240776,0.26584688,0.000098202356,0.000018883104,0.00017951395,0.0001288784,0.00012964987,0.0023475091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963975,0.000102428356,0.00001215398,0.000036835758,0.00015185053,0.000056952635],"domain_scores_gemma":[0.99965954,0.00015951888,0.000045863206,0.000042038188,0.0000785054,0.000014531169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057358,0.00065186655,0.00035163888,0.00044074366,0.00022142631,0.00080498867,0.0005969077,0.00042033955,0.0020340716],"category_scores_gemma":[0.0011007908,0.00022007778,0.00054963503,0.00028552747,0.0003370889,0.0004307131,0.00037987292,0.00051928754,0.00031319607],"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.00009737254,0.0000609658,0.0011171608,0.00020820307,0.00005675905,0.00012579294,0.00007712225,0.8703832,0.03016519,0.034505304,0.0012221846,0.06198074],"study_design_scores_gemma":[0.000010883233,0.00010272606,0.0001824427,0.00001339041,0.000016015434,0.00004003246,0.000013478401,0.9858779,0.006044545,0.005274699,0.0024161977,0.000007812345],"about_ca_topic_score_codex":0.001299956,"about_ca_topic_score_gemma":0.001857538,"teacher_disagreement_score":0.0020340716,"about_ca_system_score_codex":0.0007279679,"about_ca_system_score_gemma":0.0009744541,"threshold_uncertainty_score":0.006804645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3272225,0.00061750825,0.647774,0.0012944054,0.00018487073,0.00034489454,0.00026165327,0.0009382295,0.021361958],"genre_scores_gemma":[0.9885999,0.000078798876,0.008950965,0.00004685803,0.000009133862,0.00004407718,0.00004930021,0.0000108398945,0.00221018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989298,0.00032007994,0.000053762345,0.00018708293,0.00024368564,0.00026569515],"domain_scores_gemma":[0.9986142,0.00055689825,0.00014027678,0.00022794197,0.00023903244,0.0002216642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010466005,0.00043299186,0.0010184529,0.00040642062,0.0013275981,0.0012723354,0.0013972071,0.001137651,0.0046518655],"category_scores_gemma":[0.0020085091,0.00029041877,0.00034229393,0.00072248274,0.0010665511,0.0021527952,0.0023724276,0.0008014666,0.00057501195],"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.0007446735,0.00030821207,0.0033073802,0.00015447344,0.000062645835,0.0011373225,0.00045154762,0.8444968,0.011908443,0.06920614,0.0033238833,0.064898476],"study_design_scores_gemma":[0.000039369785,0.0000496957,0.00012205622,0.000005780224,0.000006609501,0.000058044112,0.000045828652,0.9842876,0.0011655792,0.013188618,0.0010202995,0.0000105286235],"about_ca_topic_score_codex":0.006711199,"about_ca_topic_score_gemma":0.007837525,"teacher_disagreement_score":0.006711199,"about_ca_system_score_codex":0.0010357877,"about_ca_system_score_gemma":0.0020684926,"threshold_uncertainty_score":0.0155620575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09033255,0.0018868812,0.78826565,0.00048343375,0.00019890947,0.0005601152,0.015936824,0.100999355,0.0013362451],"genre_scores_gemma":[0.5039198,0.00051457266,0.45990852,0.00027786804,0.00014816251,0.0006717692,0.031146688,0.0014293023,0.0019834437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792707,0.00027848518,0.0002133567,0.00072552724,0.0007027057,0.00015294811],"domain_scores_gemma":[0.9965527,0.0014622937,0.00062596146,0.0005549758,0.00063848344,0.000165521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021037783,0.0019455798,0.0013686352,0.0046860953,0.00059086725,0.0015705819,0.0024399932,0.0011095527,0.001112645],"category_scores_gemma":[0.009846099,0.0005454947,0.0012830903,0.0024608688,0.0004421253,0.002124385,0.001770925,0.0019195342,0.0010118295],"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.0014060992,0.0013834458,0.13051805,0.0014412391,0.0013422422,0.0008850317,0.0006897161,0.18174005,0.038988005,0.009375841,0.056168202,0.57606214],"study_design_scores_gemma":[0.00006657047,0.00025361445,0.019810311,0.000048236067,0.00008758847,0.00041559557,0.00011755111,0.9439844,0.011224233,0.013044972,0.0108679645,0.000078950805],"about_ca_topic_score_codex":0.0044704806,"about_ca_topic_score_gemma":0.00799202,"teacher_disagreement_score":0.0046860953,"about_ca_system_score_codex":0.0007420834,"about_ca_system_score_gemma":0.0011775902,"threshold_uncertainty_score":0.011125982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05551878,0.00028592086,0.9400021,0.00029286824,0.00007861188,0.00007151976,0.00004431147,0.000886943,0.0028190257],"genre_scores_gemma":[0.85802054,0.00016805135,0.1398841,0.00013309953,0.00003613887,0.00008200572,0.00010601202,0.000029150995,0.0015409109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996754,0.00008604074,0.000013017169,0.000078052384,0.000082795166,0.000064655265],"domain_scores_gemma":[0.9996537,0.000097288714,0.000035527104,0.00009609514,0.00006979664,0.00004753331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006627628,0.00046638484,0.00052295456,0.00022084922,0.00053537934,0.0008068148,0.0012812171,0.00070312864,0.0010067319],"category_scores_gemma":[0.0010728186,0.00015982306,0.00040891813,0.00032102282,0.0005202831,0.0010485082,0.0013730205,0.00086239004,0.0002228781],"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.00019946902,0.00012371925,0.0016415801,0.00004955696,0.000052074563,0.0002682826,0.000070175105,0.88527787,0.009153497,0.024220815,0.0028262732,0.076116666],"study_design_scores_gemma":[0.000005374311,0.000021435748,0.0000773882,0.0000015388733,0.0000033944168,0.000015820115,0.000006257433,0.9961494,0.0009034836,0.002387657,0.00042574288,0.0000024612757],"about_ca_topic_score_codex":0.0031295337,"about_ca_topic_score_gemma":0.0026438662,"teacher_disagreement_score":0.0031295337,"about_ca_system_score_codex":0.0006190257,"about_ca_system_score_gemma":0.0008321714,"threshold_uncertainty_score":0.0062226653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042395268,0.0022652543,0.9316472,0.00041275757,0.00019307544,0.00014600155,0.0001977808,0.0034025055,0.019340191],"genre_scores_gemma":[0.64048856,0.0012261514,0.3404308,0.00059054466,0.00013219049,0.00014141748,0.0005130369,0.0002710728,0.016206251],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979883,0.00002443937,0.000013659978,0.000033054737,0.00010180294,0.000028181204],"domain_scores_gemma":[0.999795,0.000044821732,0.00003060424,0.000027604838,0.000092459915,0.000009408128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021174338,0.00056903565,0.00027260336,0.00039864666,0.00028625876,0.0006613236,0.00093849865,0.0004461225,0.008271911],"category_scores_gemma":[0.0007957015,0.00015227663,0.00028408968,0.00043202445,0.00020630736,0.00090890954,0.0002575311,0.00047395186,0.002385788],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048718223,0.00013953971,0.0016948571,0.0008143569,0.00009739966,0.00054238865,0.00018805166,0.072389364,0.252449,0.040377244,0.017038664,0.613782],"study_design_scores_gemma":[0.00008558873,0.0010420439,0.0012033712,0.00014398023,0.00011682571,0.0019383124,0.00009057834,0.62061477,0.2601688,0.012498138,0.10202648,0.00007112627],"about_ca_topic_score_codex":0.00095695426,"about_ca_topic_score_gemma":0.0019310842,"teacher_disagreement_score":0.008271911,"about_ca_system_score_codex":0.00052480766,"about_ca_system_score_gemma":0.00056277344,"threshold_uncertainty_score":0.02767229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9426606,0.0010636126,0.04616412,0.00072427565,0.00005887575,0.00021300022,0.00012956304,0.00008819386,0.008897744],"genre_scores_gemma":[0.99299216,0.00024347463,0.006399757,0.000025441508,0.0000133580315,0.00002245488,0.000026802614,0.000008458111,0.0002681408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973901,0.0012923602,0.00007588842,0.00016304015,0.00058164063,0.00049707154],"domain_scores_gemma":[0.98229367,0.013608511,0.0015907314,0.00097013067,0.0010100375,0.0005267803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047845654,0.0012728883,0.00075050956,0.0013997969,0.0006229574,0.0013128758,0.00091956725,0.0009481735,0.0011965887],"category_scores_gemma":[0.0130656315,0.00029126008,0.0005842925,0.0013693417,0.0013646407,0.0026968343,0.0013803317,0.0011577201,0.00009049881],"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.00036766118,0.00024384007,0.0038735594,0.00007757705,0.00007745692,0.000069384216,0.000015438776,0.9699715,0.003087676,0.005198301,0.00027460422,0.016743034],"study_design_scores_gemma":[0.00003607442,0.0011011382,0.0025453628,0.000014691549,0.000061102626,0.000037493293,0.00007164348,0.9899983,0.0032627857,0.002614975,0.00024153748,0.000014800663],"about_ca_topic_score_codex":0.0053115273,"about_ca_topic_score_gemma":0.0048448485,"teacher_disagreement_score":0.0053115273,"about_ca_system_score_codex":0.0027060374,"about_ca_system_score_gemma":0.0018185101,"threshold_uncertainty_score":0.025303543},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006386259,0.004122556,0.00025698857,0.02863891,0.96508694,0.000013995344,0.000044257424,0.000044469816,0.0017281185],"genre_scores_gemma":[0.0005871568,0.0063426215,0.00019533669,0.022982273,0.9618043,0.000017741535,0.000040234416,0.00005272931,0.007977576],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976094,0.00028925034,0.00034388495,0.0004738494,0.0010432857,0.00024025064],"domain_scores_gemma":[0.9861834,0.0031833672,0.0008749803,0.00032236925,0.007027319,0.0024086146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00311869,0.0025047066,0.001958297,0.0027206165,0.002276452,0.0072925803,0.002486246,0.0093540745,0.019959347],"category_scores_gemma":[0.011275256,0.00073369,0.0021159984,0.0016310154,0.0013980523,0.0046754805,0.0016476081,0.011902498,0.01418193],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021579088,0.00001655762,0.000072221876,0.00018017842,0.000008182379,0.00011977772,0.000012319949,0.00005122827,0.000108345834,0.0004195355,0.9896136,0.009376516],"study_design_scores_gemma":[0.000017305365,0.000048502956,0.00038410802,0.0003746504,0.000024033312,0.0005506624,0.000049058686,0.00024959218,0.00017636933,0.0010253397,0.9970753,0.000024900814],"about_ca_topic_score_codex":0.0010953638,"about_ca_topic_score_gemma":0.002667713,"teacher_disagreement_score":0.019959347,"about_ca_system_score_codex":0.0019345834,"about_ca_system_score_gemma":0.002459014,"threshold_uncertainty_score":0.06677073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36357036,0.0016125473,0.60559505,0.0011423861,0.00036592368,0.00056460605,0.00019965364,0.0033228248,0.023626644],"genre_scores_gemma":[0.72263056,0.0005040549,0.26433176,0.00036009712,0.0000815971,0.00009686782,0.00011574271,0.00007874261,0.0118005965],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997845,0.000034151104,0.000014064711,0.000037188725,0.00010693192,0.000023126067],"domain_scores_gemma":[0.9997904,0.0000344248,0.000037285965,0.000038584105,0.000080041966,0.000019250547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022436479,0.0002596232,0.00020926404,0.00035180597,0.00022159336,0.00047301673,0.0010054288,0.0005578636,0.0018693747],"category_scores_gemma":[0.00046759273,0.00016059451,0.00017513832,0.00021249797,0.0002541942,0.00051814195,0.00032591337,0.00041641967,0.0009888037],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00047531922,0.00017239401,0.0015450199,0.0003434707,0.00004534747,0.0008812342,0.00025835168,0.012094633,0.8247957,0.02280447,0.0033787182,0.13320532],"study_design_scores_gemma":[0.00014909855,0.00262684,0.0020020828,0.00007615986,0.00008578814,0.0028499044,0.00007219691,0.21929549,0.7133975,0.0025448967,0.056844003,0.000056030083],"about_ca_topic_score_codex":0.000283325,"about_ca_topic_score_gemma":0.00022815377,"teacher_disagreement_score":0.0018693747,"about_ca_system_score_codex":0.0002612578,"about_ca_system_score_gemma":0.0003767117,"threshold_uncertainty_score":0.0062537193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15549466,0.0007706661,0.83629185,0.000631264,0.00014436146,0.00023511218,0.00014366268,0.00063262053,0.0056557707],"genre_scores_gemma":[0.9786375,0.00012642087,0.02010702,0.00006965987,0.000034542132,0.000038268914,0.000046316163,0.0000128242755,0.00092731725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687815,0.00071535044,0.0002867223,0.0005021917,0.00095559104,0.0006620126],"domain_scores_gemma":[0.9973018,0.00048162034,0.00039634827,0.0012333642,0.00036329307,0.00022352677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013030668,0.00034867457,0.0010113573,0.00047862768,0.0013240409,0.0014283009,0.0011712065,0.00088472734,0.0009804056],"category_scores_gemma":[0.0030978068,0.0002118692,0.00064682035,0.0011152682,0.001301333,0.0040627224,0.004125796,0.0009917137,0.00032292624],"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.003029289,0.00056284724,0.007686969,0.00047343457,0.00024056385,0.0053311144,0.0026167643,0.22186288,0.13878079,0.38395175,0.007796423,0.22766726],"study_design_scores_gemma":[0.0001317954,0.0004053292,0.0016605371,0.000052263596,0.000091699236,0.003327432,0.0004886693,0.86525345,0.038909823,0.076130785,0.013395057,0.00015305354],"about_ca_topic_score_codex":0.0012258213,"about_ca_topic_score_gemma":0.00079323765,"teacher_disagreement_score":0.0014283009,"about_ca_system_score_codex":0.0008899863,"about_ca_system_score_gemma":0.0012102044,"threshold_uncertainty_score":0.00689131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45671657,0.002888095,0.49829602,0.0008550384,0.00025840593,0.00026321542,0.000327917,0.03261613,0.0077786422],"genre_scores_gemma":[0.86680305,0.00029133027,0.12881625,0.0003797459,0.00008160436,0.000161937,0.000340133,0.000744912,0.0023809716],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871945,0.00038111603,0.00008379005,0.00016158659,0.00041151405,0.00024260281],"domain_scores_gemma":[0.99716574,0.00092747976,0.0003822056,0.00093035394,0.0003837833,0.00021038324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014801563,0.0011168108,0.000634302,0.00072796363,0.0007300485,0.001087258,0.003023619,0.00061335583,0.00197241],"category_scores_gemma":[0.0045410693,0.00046169254,0.00035742405,0.0010644976,0.0009316417,0.003195252,0.0027211122,0.0013845171,0.0006819899],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029357318,0.0010365898,0.012406806,0.0012245411,0.000175495,0.0009117791,0.0013641105,0.35045615,0.17398492,0.014683045,0.027542915,0.41327798],"study_design_scores_gemma":[0.00032558697,0.0012590053,0.0023922133,0.000045660396,0.00010755197,0.00031954577,0.00026067684,0.90956414,0.06690528,0.006317567,0.012452937,0.000049872226],"about_ca_topic_score_codex":0.0018161348,"about_ca_topic_score_gemma":0.0030025754,"teacher_disagreement_score":0.003023619,"about_ca_system_score_codex":0.00080116506,"about_ca_system_score_gemma":0.0017529433,"threshold_uncertainty_score":0.007827938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17568763,0.0012450475,0.7955022,0.00035479455,0.0003067956,0.0002992209,0.00034749217,0.0067363596,0.019520473],"genre_scores_gemma":[0.6938407,0.00022982001,0.29841343,0.0001372051,0.00006418831,0.00012537974,0.0003724528,0.00011248265,0.0067044413],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996964,0.000041888223,0.000029198383,0.000055975073,0.00011549738,0.00006107495],"domain_scores_gemma":[0.9997588,0.000043845444,0.000042096843,0.00006462157,0.00007343333,0.000017232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021759981,0.0004288725,0.0003574002,0.00050182006,0.00029589757,0.0005439879,0.0008061485,0.00025921979,0.0065157884],"category_scores_gemma":[0.0005765395,0.00020335385,0.00026621655,0.0004408056,0.00021353136,0.00077883375,0.00038142843,0.00037212332,0.0017611226],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012305082,0.00029470495,0.0025893792,0.0006234253,0.000118645476,0.0007031514,0.0001945228,0.02990535,0.37662208,0.038496718,0.011922088,0.53729945],"study_design_scores_gemma":[0.00043563894,0.0030462847,0.003361543,0.00012152076,0.00014089275,0.0026769345,0.000109625624,0.4180545,0.4933253,0.010753666,0.067818865,0.0001552076],"about_ca_topic_score_codex":0.0005027391,"about_ca_topic_score_gemma":0.0010638316,"teacher_disagreement_score":0.0065157884,"about_ca_system_score_codex":0.0003448887,"about_ca_system_score_gemma":0.0007041439,"threshold_uncertainty_score":0.021797538},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024501136,0.00031902615,0.9664773,0.00034216326,0.000102218466,0.00024511816,0.00007519512,0.001383197,0.006554671],"genre_scores_gemma":[0.8003902,0.0004885629,0.19049579,0.0002633926,0.00008523521,0.0005046269,0.0001362208,0.00008719511,0.0075487965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983553,0.00033705286,0.00015338836,0.00020070492,0.0007327383,0.00022073394],"domain_scores_gemma":[0.99800545,0.000527897,0.00025922377,0.0008904876,0.00026493185,0.00005198214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015266677,0.0004864432,0.00069087156,0.0006505232,0.0012537647,0.0012391512,0.0009817124,0.0012081048,0.0023801904],"category_scores_gemma":[0.003232357,0.00030968027,0.00079083,0.00055523484,0.0017033046,0.0029055702,0.0020146652,0.0015620088,0.0008057468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00063683774,0.00013910976,0.0012197185,0.00032125862,0.00009643169,0.00076016865,0.00061518984,0.06559793,0.11875322,0.6947306,0.0038543078,0.113275215],"study_design_scores_gemma":[0.0001543534,0.00066514994,0.00066681183,0.00013726592,0.00012392712,0.0017210402,0.00016449305,0.63931215,0.16154443,0.13749403,0.057879638,0.00013668343],"about_ca_topic_score_codex":0.00038325487,"about_ca_topic_score_gemma":0.00045084304,"teacher_disagreement_score":0.0023801904,"about_ca_system_score_codex":0.00086660834,"about_ca_system_score_gemma":0.0010435788,"threshold_uncertainty_score":0.008073866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018423544,0.00027752237,0.9937005,0.00007828946,0.00003407506,0.00005887294,0.000026632097,0.0004798235,0.0035018788],"genre_scores_gemma":[0.20446886,0.0007435392,0.78682774,0.00022169852,0.00009843857,0.0003832368,0.00013389226,0.0001864204,0.0069361874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995216,0.000077585035,0.000038597063,0.00007297356,0.00024372633,0.00004540591],"domain_scores_gemma":[0.99965465,0.000082563056,0.000047133857,0.000057863945,0.00014330441,0.000014313742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058112905,0.00080560026,0.00034263023,0.000685444,0.00040353945,0.0012028997,0.0016849234,0.0005885914,0.004476516],"category_scores_gemma":[0.001477734,0.00034525368,0.0004212216,0.0004807083,0.00042007177,0.0010455815,0.0005666602,0.0009509814,0.0017712624],"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.00026801537,0.00009464722,0.00056726363,0.0006648004,0.00006429039,0.00046675047,0.00029564273,0.2030774,0.11061709,0.24760522,0.007972873,0.428306],"study_design_scores_gemma":[0.00008917673,0.0005388585,0.0002699157,0.00017936266,0.00005605906,0.0008928817,0.00006449061,0.7759671,0.0647535,0.048178773,0.10895724,0.000052662315],"about_ca_topic_score_codex":0.0006614544,"about_ca_topic_score_gemma":0.0008527873,"teacher_disagreement_score":0.004476516,"about_ca_system_score_codex":0.00070493517,"about_ca_system_score_gemma":0.0006974114,"threshold_uncertainty_score":0.014975429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010599255,0.1595109,0.48501647,0.05169878,0.21508461,0.00035905506,0.001650167,0.00087843795,0.07520236],"genre_scores_gemma":[0.13317095,0.16582614,0.09485044,0.016783604,0.4172829,0.0009038124,0.0028940018,0.0009408068,0.16734734],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884784,0.00029721108,0.00006393319,0.00047482536,0.00021862367,0.00009749578],"domain_scores_gemma":[0.9948325,0.0032950605,0.00027611208,0.00034527658,0.0008760091,0.00037496115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019421227,0.0014012795,0.0020144668,0.0016238481,0.0010344672,0.002433663,0.0014116901,0.0026446295,0.014240734],"category_scores_gemma":[0.005613741,0.0004922788,0.001630357,0.0028053056,0.0012135018,0.002409988,0.0013300229,0.003386748,0.0041956883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014836492,0.00024022527,0.0024084682,0.0012354063,0.00033663635,0.00081983476,0.00015385798,0.024522351,0.0025712545,0.19013114,0.6122069,0.16522555],"study_design_scores_gemma":[0.000048515518,0.00034665878,0.0030303684,0.00054532173,0.0002346781,0.0017541965,0.000115225055,0.15175854,0.0012568418,0.25726184,0.583517,0.00013084682],"about_ca_topic_score_codex":0.00164443,"about_ca_topic_score_gemma":0.0021762943,"teacher_disagreement_score":0.014240734,"about_ca_system_score_codex":0.0014898862,"about_ca_system_score_gemma":0.00078366353,"threshold_uncertainty_score":0.047640026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018792236,0.0003676671,0.9744505,0.00079471286,0.000053920492,0.00012453798,0.00007647848,0.0008197865,0.004520199],"genre_scores_gemma":[0.7252466,0.00039542076,0.26598328,0.00038743234,0.00007166426,0.00020728004,0.0002948286,0.00007132403,0.0073420987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981824,0.000563534,0.00013773142,0.00041388618,0.00038166926,0.00032079415],"domain_scores_gemma":[0.99862874,0.0004802905,0.000103326274,0.00034314045,0.00030089298,0.00014358078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031831297,0.00044629793,0.000917078,0.0008628881,0.000981185,0.0020426298,0.0022777412,0.0017659519,0.003982919],"category_scores_gemma":[0.0034558875,0.00026541777,0.0008990428,0.0010383881,0.0008818813,0.0033614857,0.003227443,0.0014359212,0.00095446577],"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.0005426911,0.00067186885,0.0038185727,0.0001902807,0.0001681217,0.0005327208,0.0004995379,0.53680384,0.0041441773,0.10544963,0.007537459,0.33964118],"study_design_scores_gemma":[0.000015927124,0.000048613987,0.00019927324,0.000012999527,0.0000148277295,0.00007882534,0.000075566524,0.95716465,0.0010247348,0.037692122,0.003664317,0.000008202194],"about_ca_topic_score_codex":0.0033371353,"about_ca_topic_score_gemma":0.003428993,"teacher_disagreement_score":0.003982919,"about_ca_system_score_codex":0.0013043352,"about_ca_system_score_gemma":0.002189318,"threshold_uncertainty_score":0.0168342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10812715,0.0009940296,0.8856032,0.0011980991,0.00006324763,0.00011354473,0.0004574049,0.001425741,0.0020174482],"genre_scores_gemma":[0.8449152,0.0006055792,0.15085316,0.00029032837,0.00008267471,0.00013212177,0.0006563787,0.00007007919,0.0023944236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995413,0.00008425846,0.000036716887,0.00011356244,0.00013192144,0.00009233045],"domain_scores_gemma":[0.9996037,0.00011372582,0.00007832835,0.000030318137,0.00013248115,0.000041474374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088260847,0.0006855871,0.0005725097,0.0013078843,0.00031923677,0.0009821296,0.0011557605,0.00094679283,0.0008410147],"category_scores_gemma":[0.001557559,0.0002676392,0.0006732775,0.0006450277,0.00044648984,0.00056440325,0.000942479,0.0008181444,0.0002710851],"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.0004013775,0.00036041925,0.029773522,0.00025185995,0.00017988998,0.0019717605,0.00034460422,0.4180326,0.025220502,0.008833987,0.009949729,0.5046798],"study_design_scores_gemma":[0.000004583402,0.000025874584,0.0010722458,0.00000909509,0.000017226363,0.00012834265,0.000025771498,0.99303293,0.002781893,0.0023063582,0.00058805424,0.0000076043066],"about_ca_topic_score_codex":0.0091351755,"about_ca_topic_score_gemma":0.011598576,"teacher_disagreement_score":0.0091351755,"about_ca_system_score_codex":0.00096179824,"about_ca_system_score_gemma":0.0010781711,"threshold_uncertainty_score":0.018164039},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052511506,0.00014542055,0.9892952,0.000089612535,0.00010089138,0.0000493491,0.00011662771,0.0019027824,0.0030489524],"genre_scores_gemma":[0.21689242,0.0004365719,0.7767978,0.00019111451,0.00011886073,0.00035871568,0.0007372943,0.00047980432,0.0039874236],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909616,0.00019106499,0.00011961901,0.00008696636,0.0004410495,0.00006519085],"domain_scores_gemma":[0.99790907,0.0007469524,0.00021670772,0.0003745702,0.00069943536,0.000053205615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011257398,0.00064454536,0.00035455663,0.0011069645,0.00037791664,0.00138146,0.0013280172,0.0004923468,0.0053398306],"category_scores_gemma":[0.0057997243,0.0002651183,0.00033033564,0.0010370663,0.00054878125,0.0016314308,0.0006240068,0.0010004062,0.0018973923],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005618848,0.00012897998,0.0014585876,0.000500042,0.00005018069,0.00034381807,0.00044399936,0.10981844,0.04197992,0.28736144,0.015140408,0.54221237],"study_design_scores_gemma":[0.00014214702,0.0003136413,0.00030003604,0.00016075464,0.00004211663,0.00037435396,0.00008747499,0.7330632,0.11104581,0.076545835,0.077841304,0.000083332896],"about_ca_topic_score_codex":0.000982488,"about_ca_topic_score_gemma":0.0010454939,"teacher_disagreement_score":0.0053398306,"about_ca_system_score_codex":0.00064670603,"about_ca_system_score_gemma":0.0009458754,"threshold_uncertainty_score":0.017863512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8101464,0.0015700205,0.16488752,0.00065781025,0.00018595063,0.00010046132,0.0002600208,0.0037295758,0.018462315],"genre_scores_gemma":[0.96088195,0.0002749951,0.03141796,0.000091215974,0.000020650768,0.000037594305,0.00009362449,0.00010478988,0.0070772544],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999534,0.0000062634244,0.000003256877,0.000009390918,0.000018053384,0.000009787404],"domain_scores_gemma":[0.99987996,0.000019093706,0.000037457394,0.000031596748,0.000020694006,0.000011173527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008757604,0.00020995396,0.00015165166,0.00016794025,0.00019715683,0.00045463632,0.0008461282,0.00026740073,0.0033642503],"category_scores_gemma":[0.00017864378,0.00009422924,0.000108396416,0.00014700262,0.00018756013,0.000827583,0.00037193144,0.0002997875,0.0008673093],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00032778687,0.00010031976,0.00073100056,0.00021212714,0.000024480909,0.00030591933,0.00012540867,0.0047035343,0.92442006,0.010730834,0.0029603702,0.05535832],"study_design_scores_gemma":[0.000035778874,0.00051806297,0.0010375858,0.000025842002,0.00001749473,0.00041316857,0.00004201261,0.08282668,0.9014132,0.0017302452,0.011917755,0.00002220616],"about_ca_topic_score_codex":0.0001659628,"about_ca_topic_score_gemma":0.00035376727,"teacher_disagreement_score":0.0033642503,"about_ca_system_score_codex":0.0002429642,"about_ca_system_score_gemma":0.00014233871,"threshold_uncertainty_score":0.011254609},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1928174,0.0016639179,0.7964023,0.00067698635,0.00036238265,0.00019335572,0.0001628133,0.0019540587,0.0057667475],"genre_scores_gemma":[0.98541194,0.000118098615,0.013576738,0.00007262077,0.00003991098,0.000020444011,0.000037039525,0.00003479747,0.00068839197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984799,0.00036406095,0.00009889781,0.00033772207,0.00036871823,0.00035060884],"domain_scores_gemma":[0.99637896,0.001386253,0.000610397,0.000610161,0.0005069109,0.00050727214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021041606,0.00089419127,0.0010727093,0.00052709924,0.0008183319,0.0016961537,0.002131578,0.0009189528,0.0011119572],"category_scores_gemma":[0.008614681,0.00031488226,0.00038921405,0.00055697287,0.00078975386,0.003264402,0.002161103,0.0010656619,0.00019442251],"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.0010407205,0.00039993878,0.007945381,0.00023291676,0.00016653861,0.00065736735,0.00039703495,0.7649173,0.019280331,0.027554872,0.006394046,0.17101358],"study_design_scores_gemma":[0.000018084884,0.00010684925,0.00036584178,0.0000060218395,0.000019185645,0.00009779329,0.000035484612,0.99305385,0.0012658271,0.004197147,0.0008134982,0.000020365502],"about_ca_topic_score_codex":0.004524081,"about_ca_topic_score_gemma":0.004589176,"teacher_disagreement_score":0.004524081,"about_ca_system_score_codex":0.00093477557,"about_ca_system_score_gemma":0.0015316526,"threshold_uncertainty_score":0.011128008},"labels":[],"label_agreement":null}]}