{"meta":{"query_hash":"d17457c5070c","filters":{"venue":"IEEE Transactions on Sustainable Computing"},"cohort_total":18,"direct_labels_cover":0,"predictions_cover":18,"exported":18,"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/d17457c5070c","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Sustainable+Computing"},"results":[{"id":"W2792703057","doi":"10.1109/tsusc.2018.2816465","title":"A Novel Hierarchical Two-Tier Node Deployment Strategy for Sustainable Wireless Sensor Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":20,"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; Canada Research Chairs","keywords":"Wireless sensor network; Computer science; Energy harvesting; Energy consumption; Software deployment; Computer network; Node (physics); Sensor node; Key distribution in wireless sensor networks; Wireless; Energy (signal processing); Distributed computing; Wireless network; Telecommunications; Engineering; Electrical engineering","score_opus":0.01577926929922393,"score_gpt":0.2507152665344926,"score_spread":0.23493599723526867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792703057","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.026160227,0.00052961777,0.96911776,0.00020339445,0.000079351536,0.000097406366,0.00006188254,0.00049388054,0.003256405],"genre_scores_gemma":[0.8164465,0.0005666061,0.17906842,0.00016766392,0.000049964743,0.00013634983,0.00013410542,0.000052533367,0.0033779594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963224,0.000087332926,0.000021078247,0.000099704426,0.00009864061,0.000060912877],"domain_scores_gemma":[0.99961853,0.00009047333,0.00005193866,0.000077716235,0.00010743543,0.00005379469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004444579,0.00070996396,0.0005757276,0.00047219117,0.0006256754,0.00046921504,0.0013868278,0.00050948566,0.0012803961],"category_scores_gemma":[0.0008871986,0.00028442437,0.0004956628,0.0006045376,0.0003539889,0.0011711167,0.0011220729,0.00033302943,0.00044826904],"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.00023885714,0.00018401154,0.0028320956,0.00041165305,0.0001012231,0.0007355501,0.00045502832,0.5633867,0.11818052,0.041425787,0.00783017,0.26421842],"study_design_scores_gemma":[0.000012701938,0.00018870692,0.0006676891,0.0000114249815,0.000030851803,0.00029965816,0.00008197036,0.9849727,0.00521041,0.005260195,0.00323616,0.000027528231],"about_ca_topic_score_codex":0.0019043809,"about_ca_topic_score_gemma":0.0044819615,"teacher_disagreement_score":0.0019043809,"about_ca_system_score_codex":0.00052688346,"about_ca_system_score_gemma":0.00069803046,"threshold_uncertainty_score":0.0042833686},"labels":[],"label_agreement":null},{"id":"W2898324951","doi":"10.1109/tsusc.2018.2878109","title":"An Energy-Efficient Proactive Handover Scheme for Vehicular Networks Based on Passive RSU Detection","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Handover; Computer science; Overhead (engineering); Computer network; Scheme (mathematics); Real-time computing; Protocol (science); Kalman filter; Wireless; Energy (signal processing); Telecommunications","score_opus":0.005553621485389892,"score_gpt":0.2129132023648191,"score_spread":0.20735958087942918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898324951","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.10301628,0.0014033373,0.89091253,0.00017375412,0.00016757261,0.00013010517,0.000058171594,0.0009123021,0.0032258108],"genre_scores_gemma":[0.9507936,0.00033185192,0.047378052,0.00006565322,0.0000464554,0.000058129368,0.00007110161,0.0000154891,0.001239492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994837,0.00012297646,0.00004302646,0.00009687335,0.00017134921,0.00008204029],"domain_scores_gemma":[0.99954116,0.00013314058,0.00006267973,0.000094049996,0.00013281997,0.000036174675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046485357,0.0006646975,0.00054437795,0.00075341243,0.0006698658,0.0005561721,0.0012463008,0.0005334967,0.00049220864],"category_scores_gemma":[0.001284488,0.00022024193,0.00036766418,0.0003901833,0.0004302447,0.0010875309,0.0010727871,0.00044739075,0.00024153313],"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.0009897801,0.00030256624,0.0038225786,0.00036452102,0.00018767138,0.0009157549,0.0006142303,0.20113426,0.21777277,0.028184598,0.0030582186,0.5426531],"study_design_scores_gemma":[0.000065160006,0.0006203447,0.0013571606,0.000020691808,0.00009146221,0.0008150834,0.00011312357,0.9542938,0.03444252,0.003859948,0.004235351,0.00008544122],"about_ca_topic_score_codex":0.0013255759,"about_ca_topic_score_gemma":0.0016052625,"teacher_disagreement_score":0.0013255759,"about_ca_system_score_codex":0.00039935316,"about_ca_system_score_gemma":0.000462651,"threshold_uncertainty_score":0.002897501},"labels":[],"label_agreement":null},{"id":"W2901166078","doi":"10.1109/tsusc.2018.2881439","title":"Improved Multi-Order Distributed HOSVD with Its Incremental Computing for Smart City Services","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":51,"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":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Huazhong University of Science and Technology; Canada Research Chairs; Shenzhen Fundamental Research Program; Royal Society of Canada","keywords":"Big data; Computer science; Adaptability; Distributed computing; Tree (set theory); Operationalization; Data processing; Data mining; Data science; Database","score_opus":0.030183311862901647,"score_gpt":0.31109342348925734,"score_spread":0.2809101116263557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901166078","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.018815735,0.00024304191,0.97893757,0.00015262412,0.00007193163,0.00002805366,0.00003999591,0.00043268767,0.0012782571],"genre_scores_gemma":[0.42314216,0.000332105,0.57340187,0.00013198929,0.00007299924,0.00007802414,0.00025778398,0.000108356995,0.002474759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996706,0.00006631216,0.000019672103,0.000057452195,0.00013772633,0.0000481999],"domain_scores_gemma":[0.99951935,0.0001350688,0.000037663493,0.00008231517,0.00018799466,0.000037577887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237757,0.00045395555,0.00063654996,0.00058110885,0.0005595965,0.00089803006,0.0010517646,0.0004921549,0.0015911494],"category_scores_gemma":[0.001615013,0.000220936,0.00060378044,0.0010388062,0.00040771338,0.0014193065,0.0008683777,0.00075279915,0.0004065795],"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.00029937885,0.0001561672,0.002462823,0.0001375134,0.00006980947,0.00017047733,0.00024217319,0.58505774,0.014696569,0.026857281,0.006328214,0.36352196],"study_design_scores_gemma":[0.0000065534323,0.000018216795,0.00008269203,0.0000017336076,0.0000041025432,0.000017565328,0.000014749189,0.9957942,0.0010122644,0.0023692455,0.00067431433,0.000004428273],"about_ca_topic_score_codex":0.0067213913,"about_ca_topic_score_gemma":0.007164338,"teacher_disagreement_score":0.0067213913,"about_ca_system_score_codex":0.0005735264,"about_ca_system_score_gemma":0.0009867464,"threshold_uncertainty_score":0.013364494},"labels":[],"label_agreement":null},{"id":"W2941845064","doi":"10.1109/tsusc.2019.2913374","title":"Efficient Green Protocols for Sustainable Wireless Sensor Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":44,"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":"Canada Research Chairs","keywords":"Computer science; Wireless sensor network; Efficient energy use; Distributed computing; Energy consumption; Scheduling (production processes); Computer network; Software deployment; Engineering","score_opus":0.010666198851340375,"score_gpt":0.2487033808127803,"score_spread":0.23803718196143991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941845064","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.004930334,0.011126828,0.9637172,0.002899533,0.0008195877,0.00025616045,0.00011023179,0.0004211427,0.015718978],"genre_scores_gemma":[0.36962605,0.03749887,0.56254506,0.0021860395,0.0012214611,0.0017370739,0.0005591792,0.0003456802,0.024280597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991301,0.00025857688,0.000057790025,0.000096853946,0.00037919058,0.00007747658],"domain_scores_gemma":[0.99886537,0.00049501366,0.0001024198,0.00020624536,0.00028454096,0.00004639514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016435127,0.00091551297,0.0008172052,0.0010883238,0.0008593001,0.001742175,0.0016584576,0.0012340371,0.0020817204],"category_scores_gemma":[0.0029820334,0.00039073217,0.00045567888,0.001389755,0.0012709214,0.0031429539,0.0021333403,0.0018435831,0.0008810406],"study_design_candidate":"not_applicable","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.000060941715,0.00006967094,0.0002258598,0.0005987193,0.00004871665,0.00019045515,0.0002963228,0.12759168,0.009335298,0.70181507,0.013466384,0.14630084],"study_design_scores_gemma":[0.00003642909,0.000091718204,0.00015022539,0.00025001093,0.00003613608,0.00021773881,0.00019769752,0.44972822,0.0056154076,0.42623267,0.11739216,0.00005155283],"about_ca_topic_score_codex":0.0007485189,"about_ca_topic_score_gemma":0.0013487013,"teacher_disagreement_score":0.0020817204,"about_ca_system_score_codex":0.001374938,"about_ca_system_score_gemma":0.0015956295,"threshold_uncertainty_score":0.00997597},"labels":[],"label_agreement":null},{"id":"W2979385547","doi":"10.1109/tsusc.2019.2946246","title":"Comparison of Different Approaches for Solar PV and Storage Sizing","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Microgrid Control and Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sizing; Photovoltaic system; Robustness (evolution); Computer science; Mathematical optimization; Grid; Offset (computer science); Reliability engineering; Engineering; Mathematics; Electrical engineering","score_opus":0.0163656731894551,"score_gpt":0.22686437886921457,"score_spread":0.21049870567975948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979385547","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.07817467,0.0040214574,0.88383234,0.0009986046,0.00015727457,0.00027527654,0.00019735457,0.0005934934,0.031749524],"genre_scores_gemma":[0.7197885,0.002184792,0.27505752,0.00020158991,0.00008155866,0.00021489874,0.00023886576,0.0002471723,0.0019850107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971872,0.0011649033,0.0001704081,0.00026890717,0.0010222291,0.00018630935],"domain_scores_gemma":[0.99277085,0.0053976313,0.00047758632,0.0006602474,0.0005758006,0.00011800399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046516317,0.0012199979,0.0011809972,0.0020963587,0.0004872195,0.0016981047,0.0021485505,0.0013173211,0.0023787064],"category_scores_gemma":[0.012246639,0.00060897757,0.0014950999,0.0019098422,0.0009089629,0.0019302994,0.001628934,0.001446135,0.00030332833],"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.00017484197,0.000105453706,0.00058120966,0.00022935816,0.00013351005,0.000026895963,0.00007358506,0.89970225,0.0014301009,0.028178813,0.00045883466,0.068905056],"study_design_scores_gemma":[0.00005317502,0.00014292051,0.0005460015,0.00004697873,0.0000481223,0.000030271933,0.000052092888,0.9844364,0.001838229,0.011512398,0.0012723252,0.000021135027],"about_ca_topic_score_codex":0.0041678865,"about_ca_topic_score_gemma":0.0063694795,"teacher_disagreement_score":0.0046516317,"about_ca_system_score_codex":0.0019715333,"about_ca_system_score_gemma":0.0018589621,"threshold_uncertainty_score":0.024600506},"labels":[],"label_agreement":null},{"id":"W3004839142","doi":"10.1109/tsusc.2020.2971628","title":"DACON: A Novel Traffic Prediction and Data-Highway-Assisted Content Delivery Protocol for Intelligent Vehicular Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Canada Research Chairs","keywords":"Vehicular ad hoc network; Computer science; Protocol (science); Traffic flow (computer networking); Computer network; Scheme (mathematics); Intelligent transportation system; Service (business); Floating car data; Transport engineering; Wireless ad hoc network; Engineering; Traffic congestion; Telecommunications; Wireless","score_opus":0.06424917621630624,"score_gpt":0.26785634492604554,"score_spread":0.2036071687097393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004839142","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.044433784,0.0018800574,0.9403391,0.0005097539,0.0005260421,0.0006006429,0.00051216304,0.0039010476,0.00729738],"genre_scores_gemma":[0.8563766,0.0011038524,0.13330913,0.00035796003,0.0001407409,0.0005451931,0.001218726,0.00011035697,0.0068373173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999464,0.00010066093,0.000042005362,0.000094887044,0.0002054952,0.00009285328],"domain_scores_gemma":[0.99909914,0.0002725635,0.00010330004,0.000095065945,0.00037313826,0.00005681494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007779418,0.0006923553,0.0007432073,0.0012604131,0.00083296,0.00078164454,0.0017183585,0.00057850237,0.00086515624],"category_scores_gemma":[0.0020999818,0.00024170845,0.00029349732,0.0010267489,0.0004729056,0.0013335516,0.0015755249,0.0008950705,0.00029152763],"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.0009116694,0.0004289186,0.0030616533,0.00047110504,0.00015278549,0.0008769529,0.00044003795,0.29231483,0.041891135,0.046747368,0.029137997,0.5835656],"study_design_scores_gemma":[0.000045220848,0.00022098876,0.0003743822,0.000018376351,0.000037626152,0.00029547687,0.00006236366,0.97070384,0.009032921,0.0045455247,0.014616158,0.000047074605],"about_ca_topic_score_codex":0.0061577144,"about_ca_topic_score_gemma":0.0066374806,"teacher_disagreement_score":0.0061577144,"about_ca_system_score_codex":0.0011780602,"about_ca_system_score_gemma":0.0017274824,"threshold_uncertainty_score":0.012243748},"labels":[],"label_agreement":null},{"id":"W3006124697","doi":"10.1109/tsusc.2020.2973701","title":"A Novel Hybrid MAC Protocol for Sustainable Delay-Tolerant Wireless Sensor Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":17,"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; Canada Research Chairs","keywords":"Computer science; Computer network; Efficient energy use; Time division multiple access; Energy consumption; Adaptability; Wireless sensor network; Throughput; Reservation; Protocol (science); Wireless; Engineering; Telecommunications","score_opus":0.021884902268575358,"score_gpt":0.26061820171154665,"score_spread":0.23873329944297128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006124697","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.0153721245,0.0018271029,0.9773219,0.00025649392,0.00031418714,0.00013630633,0.00010023682,0.0009043607,0.0037674007],"genre_scores_gemma":[0.45356566,0.0015688323,0.5347444,0.0005947425,0.000289604,0.0007333738,0.00039719802,0.00015792839,0.007948352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932706,0.00012949355,0.000054807388,0.000099093275,0.00033566233,0.000053899872],"domain_scores_gemma":[0.9993623,0.00021077914,0.000080955666,0.00010379084,0.0002047486,0.00003733368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078564684,0.00055627467,0.0005276205,0.0007991456,0.0006279336,0.00081567647,0.0013917113,0.00059566926,0.00092749234],"category_scores_gemma":[0.0014479873,0.00023339185,0.00042339612,0.0006435209,0.00038727227,0.0015096398,0.00092454767,0.0007915278,0.0003356431],"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.00042306335,0.00020110299,0.0011566465,0.0008021459,0.00029217772,0.00071144983,0.00039364872,0.14508387,0.20776686,0.184925,0.012852269,0.44539174],"study_design_scores_gemma":[0.0000660877,0.0004868354,0.0005823368,0.000049747934,0.000114589675,0.0016117463,0.00006941451,0.9040169,0.025942577,0.025435137,0.041533068,0.00009153746],"about_ca_topic_score_codex":0.00043162965,"about_ca_topic_score_gemma":0.00080778566,"teacher_disagreement_score":0.0013917113,"about_ca_system_score_codex":0.0005451327,"about_ca_system_score_gemma":0.00080941146,"threshold_uncertainty_score":0.00415498},"labels":[],"label_agreement":null},{"id":"W3136095583","doi":"10.1109/tsusc.2021.3065310","title":"A Novel Mobility-Aware Offloading Management Scheme in Sustainable Multi-Access Edge Computing","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":37,"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":"Cloudlet; Computer science; Cloud computing; Provisioning; Computer network; Mobile cloud computing; Distributed computing; Scheduling (production processes); Mobile device; Mobile edge computing; Mobile computing; Server; Operating system; Engineering","score_opus":0.029114190726116075,"score_gpt":0.2918642892871733,"score_spread":0.2627500985610572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136095583","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.086907774,0.0008927031,0.9033765,0.00039948395,0.0002525712,0.00013008805,0.00007951288,0.0008744988,0.0070869774],"genre_scores_gemma":[0.954112,0.00030246488,0.043117438,0.000105123596,0.00005325647,0.000046526395,0.00007023944,0.00003822007,0.0021546616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970347,0.00003902161,0.000016910488,0.00006855603,0.00007677333,0.00009527134],"domain_scores_gemma":[0.99977416,0.00004011037,0.00002522334,0.0000499677,0.000057909783,0.000052627136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025904487,0.00048452686,0.00060726336,0.000405777,0.00092111586,0.00083431165,0.0012184137,0.0004680369,0.0010120017],"category_scores_gemma":[0.00057068054,0.00016614569,0.0003852542,0.00058813323,0.00038593923,0.0013957316,0.0011121082,0.0005438122,0.00021063448],"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.0006248742,0.00038787318,0.0032202157,0.00024148231,0.00010103856,0.0011668488,0.00050096144,0.43689603,0.10103197,0.09140064,0.011328939,0.35309923],"study_design_scores_gemma":[0.000010369955,0.000074355434,0.00039148232,0.0000067907304,0.000014017214,0.00014258397,0.000054841894,0.98801416,0.0031866499,0.0051029962,0.0029821543,0.000019572984],"about_ca_topic_score_codex":0.004327342,"about_ca_topic_score_gemma":0.0045201937,"teacher_disagreement_score":0.004327342,"about_ca_system_score_codex":0.00072314235,"about_ca_system_score_gemma":0.0008892743,"threshold_uncertainty_score":0.008604348},"labels":[],"label_agreement":null},{"id":"W3167859871","doi":"10.1109/tsusc.2021.3077175","title":"Editorial for the Special Issue on Sustainable Cyber Forensics and Threat Intelligence","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Digital and Cyber Forensics","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 Guelph","funders":"","keywords":"Software deployment; Computer security; Computer science; Big data; Digital forensics; Mandate; Cyber-attack; Field (mathematics); Data science","score_opus":0.011199295013790907,"score_gpt":0.24271374016637684,"score_spread":0.23151444515258593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167859871","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.000050086717,0.0018818495,0.00011616616,0.017291391,0.97914875,0.00002053041,0.000046273584,0.000050860766,0.0013941547],"genre_scores_gemma":[0.00030210477,0.0016861159,0.00007108561,0.008040201,0.9833655,0.000017997028,0.00003982783,0.00003522263,0.006441995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99608326,0.00038137494,0.00042833338,0.0007333321,0.0019523946,0.00042136348],"domain_scores_gemma":[0.9847935,0.004305843,0.0010671384,0.0004819757,0.006071755,0.003279842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004565615,0.003698568,0.0034262403,0.0030000499,0.0028586823,0.009085754,0.0035604783,0.012830638,0.03855812],"category_scores_gemma":[0.015439406,0.0012272514,0.0034965554,0.001155099,0.0020637764,0.005529684,0.0019077212,0.015552947,0.023463564],"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.00004922794,0.000027737975,0.00005125447,0.00020771069,0.000015971536,0.00010933326,0.000011896371,0.000034620232,0.00012850139,0.00029692746,0.9925039,0.0065629715],"study_design_scores_gemma":[0.00004934205,0.000056483226,0.00037737325,0.00029321128,0.00003643796,0.00027996165,0.0000430907,0.00015932275,0.00020509172,0.0010103299,0.9974692,0.000020174413],"about_ca_topic_score_codex":0.00070752366,"about_ca_topic_score_gemma":0.0015352754,"teacher_disagreement_score":0.03855812,"about_ca_system_score_codex":0.002339724,"about_ca_system_score_gemma":0.0023613642,"threshold_uncertainty_score":0.12898976},"labels":[],"label_agreement":null},{"id":"W4206744121","doi":"10.1109/tsusc.2021.3138926","title":"FECO: An Efficient Deep Reinforcement Learning-Based Fuel-Economic Traffic Signal Control Scheme","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Traffic control and management","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Ottawa","funders":"Canada Research Chairs","keywords":"Reinforcement learning; Fuel efficiency; SIGNAL (programming language); Computer science; Efficient energy use; Control (management); Economic shortage; Traffic signal; Traffic optimization; Real-time computing; Floating car data; Automotive engineering; Transport engineering; Engineering; Traffic congestion; Artificial intelligence; Electrical engineering","score_opus":0.005138195873247886,"score_gpt":0.1980370189845221,"score_spread":0.19289882311127424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206744121","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.043871105,0.00056084176,0.94414705,0.00042091156,0.0001950963,0.000114849034,0.00015685774,0.0021408745,0.008392256],"genre_scores_gemma":[0.9194076,0.0001528333,0.074258044,0.0003509811,0.000054811804,0.00013040524,0.00023356848,0.00009343154,0.0053182933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997303,0.000037648028,0.000011499017,0.00006949605,0.00007633797,0.00007466568],"domain_scores_gemma":[0.99964917,0.00011629455,0.000041683612,0.000036806257,0.00010344181,0.000052556665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059424964,0.00078695395,0.00086028734,0.00037908106,0.00032259547,0.00046776392,0.0017478724,0.0008973941,0.00208374],"category_scores_gemma":[0.0013312522,0.0002745769,0.0003618913,0.00025511635,0.00049570174,0.000738715,0.0009462869,0.0013627049,0.0003729789],"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.0001620421,0.00018195702,0.0011012286,0.00006258705,0.000044227618,0.000117101976,0.00004411708,0.84574,0.004454015,0.008131478,0.0050369524,0.13492419],"study_design_scores_gemma":[0.0000090479925,0.000020093807,0.000051911367,0.0000024138415,0.0000030316978,0.000008670116,0.0000017998019,0.99844944,0.00031982997,0.0007654296,0.00036545898,0.0000028670763],"about_ca_topic_score_codex":0.007738646,"about_ca_topic_score_gemma":0.00956335,"teacher_disagreement_score":0.007738646,"about_ca_system_score_codex":0.00078139396,"about_ca_system_score_gemma":0.0012440361,"threshold_uncertainty_score":0.015387237},"labels":[],"label_agreement":null},{"id":"W4226223886","doi":"10.1109/tsusc.2022.3165016","title":"Situation-Aware Orchestration of Resource Allocation and Task Scheduling for Collaborative Rendering in IoT Visualization","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"IoT and Edge/Fog Computing","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed computing; Scheduling (production processes); Rendering (computer graphics); Orchestration; Quality of service; Visualization; Real-time computing; Computer network; Artificial intelligence","score_opus":0.018824548941566495,"score_gpt":0.26981181396731363,"score_spread":0.25098726502574714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226223886","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.04755438,0.00014410036,0.9486517,0.00014365648,0.00004481253,0.0000671633,0.000031977088,0.000703706,0.002658484],"genre_scores_gemma":[0.8002705,0.00011603171,0.1983075,0.000053037995,0.000022889808,0.000096592725,0.000054937347,0.00007823914,0.0010002593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995415,0.00012291825,0.000029630954,0.00010827715,0.000100527905,0.00009712401],"domain_scores_gemma":[0.9995691,0.00015478348,0.000066253604,0.00007069198,0.00006814011,0.00007096541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161088,0.00054603233,0.00060424936,0.00048757446,0.00065585074,0.0010052257,0.0010627472,0.00055466784,0.0009644019],"category_scores_gemma":[0.0015162635,0.00027158487,0.00048661523,0.00050383026,0.00047425402,0.000963562,0.0010645493,0.00070162193,0.00016171503],"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.0001653603,0.00018478898,0.0016962632,0.00007842035,0.00005517093,0.00019958019,0.00035725336,0.8676032,0.034023933,0.01393414,0.0018358952,0.07986595],"study_design_scores_gemma":[0.000007615502,0.000019432237,0.00018686402,0.0000023165533,0.0000075902335,0.00002325138,0.000035338635,0.9947377,0.0018691687,0.0024765204,0.0006259525,0.0000083577725],"about_ca_topic_score_codex":0.0038683894,"about_ca_topic_score_gemma":0.004555173,"teacher_disagreement_score":0.0038683894,"about_ca_system_score_codex":0.0006637827,"about_ca_system_score_gemma":0.0014917644,"threshold_uncertainty_score":0.007691741},"labels":[],"label_agreement":null},{"id":"W4364322167","doi":"10.1109/tsusc.2023.3263172","title":"Critical Path Awareness Techniques for Large-Scale Graph Partitioning","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Graph partition; Computer science; Critical path method; Longest path problem; Graph; Partition (number theory); Theoretical computer science; Parallel computing; Algorithm; Mathematics; Shortest path problem; Combinatorics; Engineering","score_opus":0.014743603443448921,"score_gpt":0.2775236043878273,"score_spread":0.26278000094437837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364322167","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.013461496,0.0008674279,0.98133105,0.00016965014,0.00006222021,0.00011939316,0.00016225208,0.0021981208,0.0016283215],"genre_scores_gemma":[0.31328467,0.00090643635,0.6802438,0.00022870877,0.000112119524,0.0002779835,0.0013307059,0.0005836444,0.003031924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994554,0.000084553234,0.000030003535,0.00014630026,0.00021624105,0.00006743782],"domain_scores_gemma":[0.9986513,0.00046582092,0.00022863646,0.00032132494,0.00027012228,0.00006279851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005672589,0.0012346273,0.00061963167,0.0022583297,0.0008401673,0.00080313213,0.0011154297,0.00057911914,0.0022212616],"category_scores_gemma":[0.0021908404,0.00047631445,0.0010036955,0.0017736811,0.00061024877,0.0018508452,0.0011686344,0.0012522879,0.00069565495],"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.00023916141,0.00015843516,0.0019415575,0.00045179672,0.00012528808,0.00040096542,0.0005007772,0.26236132,0.05608243,0.029489588,0.016764635,0.6314841],"study_design_scores_gemma":[0.000056357556,0.0001511008,0.0014649209,0.00005985915,0.000085674386,0.00046671802,0.0003074015,0.8859427,0.031248873,0.053546637,0.026625244,0.000044480104],"about_ca_topic_score_codex":0.0033738199,"about_ca_topic_score_gemma":0.005839551,"teacher_disagreement_score":0.0033738199,"about_ca_system_score_codex":0.00079176424,"about_ca_system_score_gemma":0.0014163496,"threshold_uncertainty_score":0.0074308515},"labels":[],"label_agreement":null},{"id":"W4388430254","doi":"10.1109/tsusc.2023.3330573","title":"Parallel Trajectory Training of Recurrent Neural Network Controllers With Levenberg–Marquardt and Forward Accumulation Through Time in Closed-Loop Control Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Adaptive Dynamic Programming Control","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":"Artificial Intelligence in Medicine (Canada)","funders":"Directorate for Computer and Information Science and Engineering; National Science Foundation","keywords":"Levenberg–Marquardt algorithm; Trajectory; Control theory (sociology); Closed loop; Artificial neural network; Computer science; Loop (graph theory); Control engineering; Control (management); Artificial intelligence; Engineering; Mathematics; Physics","score_opus":0.028079199821574342,"score_gpt":0.2676599859668572,"score_spread":0.23958078614528286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388430254","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.015257939,0.0001511195,0.981874,0.00006637249,0.000038178507,0.00004124233,0.000011452865,0.0010102902,0.0015493915],"genre_scores_gemma":[0.7747533,0.00016077481,0.22156784,0.00007924,0.000034002816,0.0001810666,0.00007526529,0.00017010768,0.00297844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994443,0.00011259579,0.000046947745,0.00013810399,0.00018999245,0.00006798842],"domain_scores_gemma":[0.99924266,0.00024750858,0.000104964674,0.00010615073,0.0002693579,0.00002938779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013440677,0.00094666297,0.00091233855,0.00043135037,0.0005547498,0.00070407544,0.0011370471,0.0008001591,0.0015827578],"category_scores_gemma":[0.002330331,0.0005687233,0.00060585915,0.0004053073,0.0007203683,0.0009959779,0.00084161636,0.0011260257,0.00037747252],"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.00013052515,0.000058117104,0.00038657023,0.00007090305,0.00005002798,0.0000714503,0.00009064074,0.8939921,0.005610536,0.004361471,0.0005175613,0.09465999],"study_design_scores_gemma":[0.0000044078974,0.000025963243,0.000029408426,0.0000019139375,0.0000032105222,0.000005613092,0.0000019317633,0.99818075,0.0011328858,0.00043019143,0.00018093115,0.0000026830521],"about_ca_topic_score_codex":0.011310544,"about_ca_topic_score_gemma":0.0078082425,"teacher_disagreement_score":0.011310544,"about_ca_system_score_codex":0.00067078864,"about_ca_system_score_gemma":0.0012540402,"threshold_uncertainty_score":0.022489429},"labels":[],"label_agreement":null},{"id":"W4389515554","doi":"10.1109/tsusc.2023.3277876","title":"Non-Interactive DSSE for Medical Data Sharing With Forward and Backward Privacy","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Timestamp; Encryption; Cloud computing; Theoretical computer science; Scheme (mathematics); Data mining; Computer security; Mathematics","score_opus":0.02632683891577764,"score_gpt":0.3035771797045984,"score_spread":0.27725034078882077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389515554","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.04170239,0.00086982216,0.9504743,0.00082853733,0.00008135156,0.00028782227,0.00039959708,0.0010256852,0.0043304367],"genre_scores_gemma":[0.8520282,0.00042651605,0.14117782,0.00036869882,0.00007300059,0.00021286274,0.00045289873,0.00006005386,0.005199911],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952815,0.0011351992,0.00048119665,0.00073542667,0.0017355274,0.0006309977],"domain_scores_gemma":[0.99414176,0.0016482746,0.00047046883,0.0028237987,0.00068679755,0.00022893916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023616494,0.00049827766,0.0012733454,0.0007021165,0.0011252182,0.0016754862,0.00229976,0.0011761928,0.0036917934],"category_scores_gemma":[0.007761814,0.00035683368,0.00089782133,0.0021729327,0.0011766314,0.0069223507,0.004762108,0.0014394274,0.0010330038],"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.002650259,0.0005194159,0.0061707026,0.0006696768,0.00024635094,0.0015919314,0.0016272116,0.09782106,0.07522781,0.3493129,0.013238399,0.4509243],"study_design_scores_gemma":[0.00017620304,0.00045824007,0.0010457746,0.000044699467,0.00008022941,0.0028258895,0.00046653664,0.7725837,0.05771347,0.14302516,0.021448543,0.00013154805],"about_ca_topic_score_codex":0.0010022961,"about_ca_topic_score_gemma":0.000998059,"teacher_disagreement_score":0.0036917934,"about_ca_system_score_codex":0.0013737627,"about_ca_system_score_gemma":0.0020027908,"threshold_uncertainty_score":0.012489796},"labels":[],"label_agreement":null},{"id":"W4390604865","doi":"10.1109/tsusc.2024.3350343","title":"Oracle Based Privacy-Preserving Cross-Domain Authentication Scheme","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Public key infrastructure; Computer security; Random oracle; Authentication (law); Scalability; Domain (mathematical analysis); Mutual authentication; Public-key cryptography; Encryption; Mathematics; Database","score_opus":0.011926228611643556,"score_gpt":0.27837791399465067,"score_spread":0.2664516853830071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390604865","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.08753904,0.0015626581,0.8816278,0.0011774264,0.00024141061,0.00096151367,0.0011831464,0.004266889,0.021440113],"genre_scores_gemma":[0.92241174,0.00046653778,0.06341441,0.00024939122,0.00006310284,0.00021657963,0.0009627146,0.00004159673,0.012173883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693656,0.0006522689,0.0003032308,0.0005679351,0.00093603414,0.0006039823],"domain_scores_gemma":[0.9970003,0.00048915757,0.00042039368,0.001183658,0.00049091247,0.00041564537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001761541,0.0005682741,0.0013623844,0.00081296795,0.0014640054,0.0016612825,0.0021503177,0.0017302675,0.0069126384],"category_scores_gemma":[0.0021683264,0.0002791662,0.00063349813,0.001578256,0.0011804276,0.0039144927,0.0045485315,0.0016785709,0.0022326717],"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.0038688325,0.00074370607,0.003303975,0.0007455563,0.00017279887,0.0027485352,0.0011668492,0.06912746,0.08167013,0.54586613,0.016264655,0.27432135],"study_design_scores_gemma":[0.0009316773,0.0012766749,0.0018690258,0.00010226795,0.00018424635,0.0039546583,0.00021800835,0.7026925,0.06308456,0.14459343,0.08075591,0.00033707754],"about_ca_topic_score_codex":0.0012010764,"about_ca_topic_score_gemma":0.0009605569,"teacher_disagreement_score":0.0069126384,"about_ca_system_score_codex":0.0011714157,"about_ca_system_score_gemma":0.0018480881,"threshold_uncertainty_score":0.023125112},"labels":[],"label_agreement":null},{"id":"W4391892492","doi":"10.1109/tsusc.2024.3366502","title":"Blockchain for Energy Credits and Certificates: A Comprehensive Review","year":2024,"lang":"en","type":"review","venue":"IEEE Transactions on Sustainable Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","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":"Hydro-Québec; École de Technologie Supérieure","funders":"","keywords":"Blockchain; Computer science; Business; Computer security","score_opus":0.041223235892096435,"score_gpt":0.3181611992894778,"score_spread":0.27693796339738136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391892492","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019508952,0.9948932,0.0008049501,0.00043081478,0.00022077718,0.000025030875,0.000041869127,0.0000142213075,0.0033741528],"genre_scores_gemma":[0.002463173,0.99532074,0.0005979078,0.00019374152,0.00015557268,0.00002367918,0.00008571808,0.0000075182734,0.0011518815],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989899,0.00021797852,0.000117627606,0.00015584315,0.00043898282,0.000079622405],"domain_scores_gemma":[0.99675375,0.0020500787,0.0003295301,0.00011164962,0.00064939307,0.00010564143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021044964,0.0010198647,0.0014751506,0.0037204798,0.0006117655,0.001825817,0.001377978,0.0019028924,0.008403428],"category_scores_gemma":[0.0044658054,0.0005772925,0.0006663063,0.0067183734,0.0009117898,0.0039593806,0.001165072,0.0015692008,0.0034933847],"study_design_candidate":"not_applicable","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.000059375143,0.000070886555,0.00025118096,0.023564437,0.00006789733,0.000107197004,0.00009360917,0.0014294053,0.00054408744,0.023881087,0.02703939,0.9228914],"study_design_scores_gemma":[0.000012233634,0.000077281715,0.00031639604,0.0073396456,0.000071148694,0.00030127994,0.0000557484,0.00032870282,0.00039871444,0.0048321555,0.98624414,0.000022518529],"about_ca_topic_score_codex":0.0030587646,"about_ca_topic_score_gemma":0.0034667745,"teacher_disagreement_score":0.008403428,"about_ca_system_score_codex":0.0012714294,"about_ca_system_score_gemma":0.0040586125,"threshold_uncertainty_score":0.028112233},"labels":[],"label_agreement":null},{"id":"W4410204270","doi":"10.1109/tsusc.2025.3567856","title":"Data-driven Software-based Power Estimation for Embedded Devices","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"Embedded Systems Design Techniques","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Estimation; Software; Power (physics); Reliability engineering; Embedded system; Operating system; Engineering; Systems engineering","score_opus":0.026539074420909612,"score_gpt":0.3149986400335832,"score_spread":0.28845956561267355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410204270","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.01639334,0.0001219295,0.97860605,0.00004936471,0.000021262073,0.000041780375,0.000087443106,0.0037369595,0.00094181683],"genre_scores_gemma":[0.81663257,0.00021020623,0.1788644,0.00010539383,0.000029116036,0.00020677503,0.00048001233,0.0005644579,0.0029070687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946314,0.00008044938,0.000032008367,0.00012994593,0.00026432605,0.00003007424],"domain_scores_gemma":[0.9992236,0.00026252793,0.00010598726,0.0001759518,0.00021188083,0.000019971872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033315682,0.0010230117,0.00055017753,0.0005465054,0.00021250284,0.0006306857,0.0009751451,0.00032459243,0.0016317446],"category_scores_gemma":[0.0018418657,0.00044372954,0.00048251063,0.0004238191,0.00026526622,0.0010318068,0.00043236456,0.0008457421,0.00071914156],"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.0001350753,0.00027191365,0.005474177,0.0003418544,0.000109855246,0.00017655759,0.00016823865,0.62656116,0.06229436,0.0068134735,0.0033003879,0.29435304],"study_design_scores_gemma":[0.0000039504184,0.000027517925,0.00038060683,0.000007676658,0.0000063940315,0.00002383707,0.0000055676096,0.9882351,0.009187779,0.0011082942,0.0010071065,0.0000060779275],"about_ca_topic_score_codex":0.0021917347,"about_ca_topic_score_gemma":0.00307827,"teacher_disagreement_score":0.0021917347,"about_ca_system_score_codex":0.0005158672,"about_ca_system_score_gemma":0.0006799456,"threshold_uncertainty_score":0.0054587126},"labels":[],"label_agreement":null},{"id":"W4412802418","doi":"10.1109/tsusc.2025.3593971","title":"Energy-Efficient Computation With DVFS Using Deep Reinforcement Learning for Multi-Task Systems in Edge Computing","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Sustainable Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Computation; Task (project management); Edge computing; Enhanced Data Rates for GSM Evolution; Energy (signal processing); Artificial intelligence; Distributed computing; Algorithm; Engineering; Mathematics; Systems engineering","score_opus":0.020264287646735612,"score_gpt":0.2740254011419407,"score_spread":0.2537611134952051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412802418","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.10270891,0.0007439013,0.891906,0.00036055094,0.0000880248,0.000056817687,0.00006232269,0.001172269,0.002901175],"genre_scores_gemma":[0.94719094,0.00012610706,0.051277917,0.000120486875,0.000018956734,0.000053734493,0.000066064815,0.000052430703,0.0010933381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999777,0.00004676413,0.000012601433,0.000058518694,0.00005066642,0.000054370612],"domain_scores_gemma":[0.9995442,0.00026018388,0.00004463047,0.000041529453,0.00007235437,0.000037095208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005567993,0.0006138901,0.0006485927,0.00026866284,0.0002800526,0.00051706244,0.00085087377,0.00044970986,0.0010218706],"category_scores_gemma":[0.0016642989,0.0002730294,0.00031227744,0.00026184757,0.00039984784,0.00072026224,0.00054992037,0.00094467436,0.00012587073],"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.00008359828,0.000078993915,0.00095741247,0.00004469648,0.000024022771,0.000044361506,0.000033975994,0.94365096,0.0024377396,0.0018263428,0.0006819453,0.05013599],"study_design_scores_gemma":[0.0000026517657,0.0000072832895,0.000038196293,0.0000011834574,0.0000013737906,0.0000023039863,0.000001916889,0.99907494,0.00024179883,0.00056814053,0.00005909141,0.0000010595804],"about_ca_topic_score_codex":0.0073300083,"about_ca_topic_score_gemma":0.008511513,"teacher_disagreement_score":0.0073300083,"about_ca_system_score_codex":0.000854791,"about_ca_system_score_gemma":0.0010849222,"threshold_uncertainty_score":0.014574647},"labels":[],"label_agreement":null}]}