{"meta":{"query_hash":"2c83569bfc72","filters":{"venue":"IEICE Transactions on Information and Systems"},"cohort_total":27,"direct_labels_cover":0,"predictions_cover":27,"exported":27,"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/2c83569bfc72","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEICE+Transactions+on+Information+and+Systems"},"results":[{"id":"W108479605","doi":"","title":"A New Similarity Measure to Understand Visitor Behavior in a Web Site","year":2004,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hatch (Canada)","funders":"","keywords":"Visitor pattern; Computer science; World Wide Web; Cluster analysis; Similarity (geometry); Web page; Similarity measure; The Internet; Web site; Information retrieval; Measure (data warehouse); Web analytics; Site map; Order (exchange); Web mining; Web navigation; Web modeling; Static web page; Data mining; Web intelligence; Artificial intelligence","score_opus":0.020539530157939336,"score_gpt":0.24516196564746087,"score_spread":0.22462243548952154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108479605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03177799,0.000021834834,0.96635896,0.00084436405,0.00021564458,0.00020423043,0.00003436959,0.00008982998,0.0004527602],"genre_scores_gemma":[0.9965994,0.000009332167,0.0030235786,0.00023914763,0.000018234885,0.00001767771,0.0000058168052,0.000002741406,0.00008409814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990989,0.000030654955,0.00031275154,0.00013917888,0.00027347764,0.00014501718],"domain_scores_gemma":[0.9994446,0.000023048178,0.000057961945,0.00026504736,0.000052647923,0.00015669754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025226263,0.000102587524,0.00014135955,0.00039796074,0.00013876853,0.0004339127,0.0001815661,0.000065418346,0.0000058361643],"category_scores_gemma":[0.000007263403,0.00009618542,0.00004083737,0.00061316637,0.000007762989,0.0015713763,0.000004706844,0.00012651061,0.000089890986],"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.0002834273,0.0008549458,0.0021739986,0.0004941026,0.00026511587,0.00005301798,0.15477689,0.41787162,0.0023465483,0.034547485,0.004101695,0.38223115],"study_design_scores_gemma":[0.024597803,0.0028008902,0.026730556,0.002631598,0.00050051324,0.00059187104,0.060269877,0.7730143,0.0023976183,0.0005347901,0.10125822,0.004671986],"about_ca_topic_score_codex":0.0008332104,"about_ca_topic_score_gemma":0.000681976,"teacher_disagreement_score":0.9648214,"about_ca_system_score_codex":0.00010979186,"about_ca_system_score_gemma":0.00012752536,"threshold_uncertainty_score":0.418423},"labels":[],"label_agreement":null},{"id":"W1516893568","doi":"","title":"Transparent Gaze Communications for Multiparty Videoconference System","year":2004,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hatch (Canada)","funders":"","keywords":"Computer science; Gaze; Videoconferencing; Multimedia; Artificial intelligence","score_opus":0.03158853536043122,"score_gpt":0.24240719814915737,"score_spread":0.21081866278872616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516893568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003473869,0.0002021508,0.99096906,0.00011174247,0.00061479805,0.00085446046,0.0001700746,0.0005780922,0.0030257723],"genre_scores_gemma":[0.9980417,0.00017748748,0.0009881966,0.00002666208,0.000025906133,0.0006519435,0.000055009128,0.000015021061,0.00001807123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910533,0.00002125336,0.00047924108,0.00007929747,0.0001310007,0.00018384562],"domain_scores_gemma":[0.99928975,0.00009386795,0.00005754311,0.00037139625,0.00009156573,0.00009586033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016308419,0.00015194518,0.00018515537,0.00013431768,0.00026549704,0.00013408973,0.00016769384,0.0001076753,0.0000031812347],"category_scores_gemma":[0.000002670897,0.000150667,0.000057319256,0.00013280816,0.000039159455,0.0006866201,0.0000013185175,0.00015688363,0.000040955547],"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.000016122201,0.000022021619,0.0000051422694,0.00065282744,0.000048620026,1.3945144e-7,0.0021131209,0.975897,0.00005879815,0.010920911,0.00006784012,0.010197451],"study_design_scores_gemma":[0.0014262605,0.000054154552,0.000121284174,0.00047863834,0.000040246305,0.00002592629,0.0034283944,0.97656614,0.00038688022,0.00001915849,0.017187927,0.0002649833],"about_ca_topic_score_codex":0.00007942469,"about_ca_topic_score_gemma":0.00007714201,"teacher_disagreement_score":0.9945678,"about_ca_system_score_codex":0.00015442255,"about_ca_system_score_gemma":0.000025273697,"threshold_uncertainty_score":0.6144022},"labels":[],"label_agreement":null},{"id":"W1715415823","doi":"10.1587/transinf.2014edp7379","title":"Utilization-Aware Hybrid Beacon Scheduling in Cluster-Tree ZigBee Networks","year":2015,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Wireless Networks and Protocols","field":"Computer Science","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Beacon; Scheduling (production processes); Real-time computing; Network packet; Computer network; Cluster (spacecraft); Distributed computing; Mathematical optimization","score_opus":0.04000964883593383,"score_gpt":0.2691125033333831,"score_spread":0.22910285449744927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1715415823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024260597,0.000094708965,0.99325174,0.00024739723,0.0006850101,0.0017090484,0.0000049279574,0.00014313254,0.001437986],"genre_scores_gemma":[0.9979311,0.000034694236,0.0008899662,0.00031470065,0.0000582519,0.0006800017,0.0000141405835,0.0000063102366,0.00007082081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987156,0.00010235603,0.00053599227,0.00015669054,0.00026585456,0.00022353734],"domain_scores_gemma":[0.9991945,0.000081996506,0.00015036856,0.0002745004,0.00014540507,0.00015321153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057933165,0.00014580482,0.00018341259,0.00023990081,0.00015177092,0.00049747893,0.00024229602,0.00009552794,0.0000037462316],"category_scores_gemma":[0.0000078409075,0.00013726216,0.000035479567,0.000412075,0.000020362866,0.002280452,0.000008470488,0.0002172842,0.00003336995],"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.000023119192,0.000025099063,0.00010144531,0.000049748905,0.0000075224316,0.0000011902798,0.0012553746,0.8983044,2.9357113e-7,0.002097372,0.000269747,0.09786469],"study_design_scores_gemma":[0.0008827605,0.000071454466,0.00012563162,0.00014717689,0.000002914479,0.000028503173,0.000560899,0.9888245,0.000019094625,0.00005305461,0.009127219,0.00015678031],"about_ca_topic_score_codex":0.00015131757,"about_ca_topic_score_gemma":0.00006672729,"teacher_disagreement_score":0.99550503,"about_ca_system_score_codex":0.00006977442,"about_ca_system_score_gemma":0.00007247883,"threshold_uncertainty_score":0.5597388},"labels":[],"label_agreement":null},{"id":"W1988210464","doi":"10.1587/transinf.e93.d.1644","title":"A Buffer Management Issue in Designing SSDs for LFSs","year":2010,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Korea Evaluation Institute of Industrial Technology","keywords":"Computer science; Write buffer; Buffer (optical fiber); Key (lock); TRACE (psycholinguistics); Cache; SystemC; Bandwidth (computing); Embedded system; Operating system; Computer network; CPU cache; Cache algorithms; Telecommunications","score_opus":0.013631603583770911,"score_gpt":0.2517852567567775,"score_spread":0.23815365317300657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988210464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013709705,0.000013408778,0.9957118,0.00029069599,0.00060853275,0.000533128,0.000012726578,0.0002597507,0.0011989732],"genre_scores_gemma":[0.8990697,0.000027891381,0.10011013,0.00015757869,0.0000129843875,0.0004020121,0.0000059535173,0.0000045435813,0.00020919416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932617,0.000011526238,0.0002715385,0.00011854201,0.00012351826,0.00014872002],"domain_scores_gemma":[0.99947286,0.000066949746,0.00007173682,0.00031554594,0.000041514213,0.000031419804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026170115,0.000089941575,0.000099841636,0.0003262465,0.00012944496,0.0001889231,0.0002703352,0.00007287046,0.0000035769326],"category_scores_gemma":[0.00001009743,0.000083596984,0.000019421228,0.00024878795,0.000023506944,0.0020373194,0.0000075524295,0.00015448626,0.00003507096],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003902159,0.00008066731,0.000030806936,0.0004886111,0.000035353867,0.0000039467855,0.0038457543,0.015164974,0.00069686054,0.23016235,0.0008142364,0.7486374],"study_design_scores_gemma":[0.002670297,0.00025842138,0.0004484836,0.00018705236,0.000017907178,0.00007790206,0.0068386607,0.63117033,0.004264043,0.0022520318,0.3511426,0.000672255],"about_ca_topic_score_codex":0.000026567059,"about_ca_topic_score_gemma":0.000022783152,"teacher_disagreement_score":0.89769876,"about_ca_system_score_codex":0.00002877728,"about_ca_system_score_gemma":0.000009607144,"threshold_uncertainty_score":0.3408986},"labels":[],"label_agreement":null},{"id":"W2009767331","doi":"10.1587/transinf.e93.d.1447","title":"Energy-Efficient Distributed Spatial Joint Processing in Wireless Sensor Networks","year":2010,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Ministry of Land, Transport and Maritime Affairs","keywords":"Wireless sensor network; Computer science; Key distribution in wireless sensor networks; Visual sensor network; Rectangle; Grid; Mobile wireless sensor network; Wireless network; Distributed computing; Computer network; Wireless; Telecommunications","score_opus":0.008253659198873615,"score_gpt":0.20139898837797615,"score_spread":0.19314532917910254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009767331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050059266,0.000024600462,0.94736814,0.00019128704,0.0014040489,0.00019164212,0.0000107039195,0.0002228655,0.0005274175],"genre_scores_gemma":[0.9988597,0.000018802979,0.0008003824,0.00013337485,0.00006453324,0.00005739429,0.00002306165,0.000009008438,0.000033718934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982981,0.000081782,0.0006619246,0.00024220669,0.00036346642,0.0003525247],"domain_scores_gemma":[0.9990629,0.000060901013,0.00022648164,0.00035290743,0.00015091387,0.00014587228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003764354,0.00020891578,0.00023494988,0.0003346388,0.00029633465,0.00053185,0.00025271843,0.00019974603,0.000005256249],"category_scores_gemma":[0.0000059059134,0.00019363247,0.000052949155,0.0006338147,0.000056838016,0.00073385396,0.000010129755,0.00045276587,0.0000099952495],"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.0000112280795,0.000066007306,0.000020559397,0.000028184213,0.0000040212235,0.0000023681,0.00044484073,0.9292455,0.00012299769,0.004440884,0.000016591883,0.06559682],"study_design_scores_gemma":[0.00049513247,0.000032093863,0.00043640472,0.00008830644,0.000004218822,0.000047684665,0.0002188195,0.99664366,0.00024393822,0.000002716013,0.0015651626,0.00022184468],"about_ca_topic_score_codex":0.00049787323,"about_ca_topic_score_gemma":0.00024246094,"teacher_disagreement_score":0.94880044,"about_ca_system_score_codex":0.0000637021,"about_ca_system_score_gemma":0.00005453351,"threshold_uncertainty_score":0.78961027},"labels":[],"label_agreement":null},{"id":"W2020249752","doi":"10.1093/ietisy/e91-d.2.231","title":"Survey Propagation as \"Probabilistic Token Passing\"","year":2008,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Constraint Satisfaction and Optimization","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":"University of Ottawa","funders":"","keywords":"Computer science; Security token; Probabilistic logic; Constraint (computer-aided design); Simple (philosophy); Token passing; Variable (mathematics); Power (physics); Local consistency; Constraint satisfaction problem; Theoretical computer science; Computer network; Artificial intelligence; Mathematics","score_opus":0.023230105775647148,"score_gpt":0.22870106977660773,"score_spread":0.20547096400096057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020249752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010756372,0.00001615588,0.98350936,0.0002800862,0.000646865,0.0003670589,0.000014638537,0.00023528992,0.0041741678],"genre_scores_gemma":[0.9984513,0.000059540016,0.0008273716,0.00023108872,0.000013575417,0.00004653857,0.000024709785,0.0000040756977,0.00034178403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887246,0.00012493483,0.000420896,0.00014614774,0.0002962051,0.00013938392],"domain_scores_gemma":[0.9991818,0.00010873586,0.00014897379,0.00023311019,0.00022545147,0.00010192093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034786478,0.00012262614,0.0001271935,0.00023426578,0.00046914734,0.00028114294,0.00012652691,0.000078140685,0.000036104273],"category_scores_gemma":[0.00004243081,0.00011463136,0.000033104057,0.00038320813,0.000054238757,0.0021816585,0.0000033179579,0.00012329509,0.00020059255],"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.0001590721,0.0003244945,0.0038879858,0.00040609777,0.00014028272,0.000011779135,0.019095918,0.34342507,0.000108339256,0.071248285,0.002378879,0.5588138],"study_design_scores_gemma":[0.0008630596,0.00016027641,0.034247793,0.000051932304,0.000008922192,0.00034663398,0.0003407777,0.95594084,0.00011145673,0.000060714665,0.0075204372,0.0003471321],"about_ca_topic_score_codex":0.0003055529,"about_ca_topic_score_gemma":0.00004116437,"teacher_disagreement_score":0.9876949,"about_ca_system_score_codex":0.000068225745,"about_ca_system_score_gemma":0.000119860175,"threshold_uncertainty_score":0.46745312},"labels":[],"label_agreement":null},{"id":"W2027136297","doi":"10.1587/transinf.2013lop0010","title":"Asynchronous Stochastic Decoding of LDPC Codes: Algorithm and Simulation Model","year":2014,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"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; McGill University","funders":"Core Research for Evolutional Science and Technology; University of Tokyo; Japan Society for the Promotion of Science; Synopsys","keywords":"Computer science; Decoding methods; Asynchronous communication; Parallel computing; Scheduling (production processes); Algorithm; Low-density parity-check code; Computation; Mathematics; Computer network; Mathematical optimization","score_opus":0.015569112253343466,"score_gpt":0.2580003604589923,"score_spread":0.24243124820564882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027136297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050091106,0.000018322096,0.9938244,0.000029762617,0.00018589469,0.00022331341,0.0000064683213,0.00022697283,0.0004757158],"genre_scores_gemma":[0.9537503,0.000007795396,0.046148308,0.000046057685,0.000008254791,0.000021215934,0.0000016627539,0.0000039884612,0.000012422034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991808,0.000045017765,0.00036927857,0.00011130095,0.0001867791,0.00010684716],"domain_scores_gemma":[0.9992324,0.00020755986,0.00017542977,0.00020262232,0.0001264988,0.000055455963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041372058,0.00010064266,0.0001520028,0.00023743382,0.00015673932,0.00013638962,0.00011953247,0.00006799077,8.407616e-7],"category_scores_gemma":[0.000023060238,0.0000981449,0.000024175728,0.00015247034,0.00002644978,0.0012150324,0.0000053402946,0.00009831479,0.000003983699],"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.0000031003424,0.000009782648,0.0000029523285,0.00005690368,0.0000058449305,2.6616645e-8,0.0018581891,0.8087276,0.000023787334,0.002548417,0.0000036176368,0.18675973],"study_design_scores_gemma":[0.00019846158,0.00008803468,0.000020981275,0.00008038302,0.000007444183,0.000012526568,0.00021372279,0.99888897,0.00014375127,0.0001992175,0.00004690111,0.00009959896],"about_ca_topic_score_codex":0.000074177726,"about_ca_topic_score_gemma":0.00000586619,"teacher_disagreement_score":0.9487412,"about_ca_system_score_codex":0.000034593733,"about_ca_system_score_gemma":0.000023843306,"threshold_uncertainty_score":0.40022326},"labels":[],"label_agreement":null},{"id":"W2036113022","doi":"10.1587/transinf.e93.d.3414","title":"Improved Demons Technique with Orthogonal Gradient Information for Medical Image Registration","year":2010,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":6,"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":"","keywords":"Computer science; Image registration; Artificial intelligence; Computer vision; Image (mathematics); Medical imaging","score_opus":0.006876777216274747,"score_gpt":0.2489098323704226,"score_spread":0.24203305515414786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036113022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006025742,0.000002581758,0.995259,0.0008894907,0.00037678002,0.0014084454,0.00003358944,0.00039782058,0.0010297182],"genre_scores_gemma":[0.6421823,0.00003972981,0.35302705,0.0015093083,0.0000724316,0.0028669054,0.00016383256,0.000013935607,0.00012453516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842054,0.000040726718,0.00065907463,0.00013660738,0.0005506145,0.0001924147],"domain_scores_gemma":[0.9987021,0.00012579875,0.00028716918,0.00030826402,0.0003553544,0.00022131656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091960176,0.00015499302,0.00014967426,0.0002979319,0.00028567523,0.0005154507,0.00028095153,0.00017812294,0.000030926854],"category_scores_gemma":[0.00008714698,0.0001244678,0.000045271452,0.0002646022,0.00009881666,0.0053490736,0.000005386181,0.00033857374,0.000017311924],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002656196,0.0002874879,0.00003034371,0.0011240887,0.00011079689,0.0000034528327,0.005191207,0.00018681092,0.012309912,0.08418027,0.0040900977,0.8922199],"study_design_scores_gemma":[0.004134942,0.0015405274,0.00038910456,0.00034946823,0.000053778807,0.00087554863,0.0015668068,0.8904696,0.05950003,0.0005061963,0.039612897,0.0010010863],"about_ca_topic_score_codex":0.000074583535,"about_ca_topic_score_gemma":0.000067913854,"teacher_disagreement_score":0.89121884,"about_ca_system_score_codex":0.000037322487,"about_ca_system_score_gemma":0.00018708326,"threshold_uncertainty_score":0.50756496},"labels":[],"label_agreement":null},{"id":"W2037438209","doi":"10.1587/transinf.2014edp7178","title":"A Method of Power Aware Large Data Download on Smartphone","year":2015,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Green IT and Sustainability","field":"Engineering","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":"Science North","funders":"Key Science and Technology Program of Shaanxi Province","keywords":"Download; Computer science; Android (operating system); Overhead (engineering); Queue; Smartphone app; Smartphone application; Computer network; Operating system; Multimedia; Internet privacy","score_opus":0.027279967412303138,"score_gpt":0.26972214044113507,"score_spread":0.24244217302883192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037438209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017622976,0.00007433196,0.9728346,0.000075751384,0.0005842882,0.00035970443,0.0009887979,0.00018223478,0.0072773024],"genre_scores_gemma":[0.99954283,0.000010551671,0.00022172103,0.00003296472,0.000008901102,0.000018849612,0.0000996235,0.0000046829678,0.000059872254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919087,0.000045104036,0.00035124892,0.0000769139,0.00020447338,0.0001313689],"domain_scores_gemma":[0.99928176,0.000053676355,0.00004609497,0.00039862085,0.00012453932,0.00009531165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060941547,0.00010275817,0.0001654849,0.0001473233,0.00005435514,0.000045123776,0.00011600998,0.00007881153,0.00002494319],"category_scores_gemma":[0.000013733206,0.000090630376,0.000026186872,0.0001351719,0.000012930888,0.0007228163,0.000003183005,0.00012794232,0.00005086762],"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.0008268247,0.0007380564,0.0011774995,0.005297247,0.0007134823,0.000007660712,0.06559232,0.662553,0.00016403939,0.0046736724,0.06604856,0.19220763],"study_design_scores_gemma":[0.0029500131,0.0003307495,0.0012167924,0.00013036134,0.00005481835,0.000038900034,0.03174887,0.6613294,0.00046950916,0.000042638123,0.30122638,0.00046158244],"about_ca_topic_score_codex":0.00015369996,"about_ca_topic_score_gemma":0.00003757453,"teacher_disagreement_score":0.9819199,"about_ca_system_score_codex":0.000053746382,"about_ca_system_score_gemma":0.00003067594,"threshold_uncertainty_score":0.36957994},"labels":[],"label_agreement":null},{"id":"W2038343048","doi":"10.1587/transinf.e93.d.2306","title":"Hybrid Spatial Query Processing between a Server and a Wireless Sensor Network","year":2010,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","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":"Kootenay Association for Science & Technology","funders":"Ministry of Land, Transport and Maritime Affairs","keywords":"Computer science; Wireless sensor network; Wireless network; Computer network; Key distribution in wireless sensor networks; Wireless WAN; Spatial query; Wireless; Transmission (telecommunications); Real-time computing; Web search query; Sargable; Search engine; Telecommunications; Information retrieval","score_opus":0.00879889530598193,"score_gpt":0.21017499599897724,"score_spread":0.2013761006929953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038343048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30179322,0.000024152243,0.69656986,0.00019136106,0.00065968576,0.00018579737,0.000006498983,0.00018402503,0.00038544385],"genre_scores_gemma":[0.9976347,0.00002127113,0.0018920841,0.00014887986,0.00018008062,0.00002890793,0.000007811706,0.000009004633,0.00007723434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869543,0.000065712804,0.00044876258,0.00020714087,0.00030107168,0.00028185305],"domain_scores_gemma":[0.9991235,0.000117384596,0.00018905303,0.0002894033,0.00012465412,0.0001560073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037304597,0.00017999146,0.00021634198,0.00015396062,0.00045068917,0.00067713216,0.00019514059,0.0001209282,0.0000036392214],"category_scores_gemma":[0.0000045978622,0.00016582702,0.00003731949,0.00023811279,0.00006110367,0.0015400309,0.000010140508,0.00037458315,0.000016948732],"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.00004961073,0.000082617466,0.0014787558,0.00050513836,0.00008469536,0.000008396929,0.0040158355,0.33029068,0.00025522144,0.011199569,0.00023544344,0.651794],"study_design_scores_gemma":[0.0004878849,0.000055015847,0.00222131,0.00012733409,0.000016036493,0.000111727015,0.00015256045,0.9903996,0.00019277599,0.000019722613,0.0059369206,0.00027909433],"about_ca_topic_score_codex":0.00023090745,"about_ca_topic_score_gemma":0.00006529417,"teacher_disagreement_score":0.69584155,"about_ca_system_score_codex":0.00001947207,"about_ca_system_score_gemma":0.000044296783,"threshold_uncertainty_score":0.676223},"labels":[],"label_agreement":null},{"id":"W2043647819","doi":"10.1587/transinf.e96.d.1457","title":"Revisiting Shared Cache Contention Problems: A Practical Hardware-Software Cooperative Approach","year":2013,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Parallel Computing and Optimization Techniques","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":"Kootenay Association for Science & Technology","funders":"Korea Evaluation Institute of Industrial Technology; Ministry of Knowledge Economy","keywords":"Computer science; Cache; Cache invalidation; Cache algorithms; Parallel computing; Smart Cache; Scheduling (production processes); Cache coloring; Cache pollution; Bus sniffing; Distributed computing; Embedded system; CPU cache","score_opus":0.03322111574118972,"score_gpt":0.26129554759572055,"score_spread":0.22807443185453083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043647819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002724655,0.000052261254,0.99420434,0.0005436363,0.00015098402,0.00083574373,0.000009031495,0.00065377395,0.0032777444],"genre_scores_gemma":[0.81968194,0.00006978095,0.17834827,0.00056734896,0.000043832923,0.0005939783,0.00005443077,0.000011364721,0.00062906486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998656,0.00015745034,0.00052673067,0.00020006734,0.0002700962,0.0001896671],"domain_scores_gemma":[0.9988152,0.00011507496,0.00022614568,0.00025613132,0.0004805355,0.00010693539],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004142887,0.00015756756,0.0001914914,0.00019923228,0.00039719936,0.0011745017,0.0001801351,0.00010437451,0.000018028028],"category_scores_gemma":[0.00006449853,0.00013657918,0.0000492624,0.00032863006,0.000029301022,0.004025374,0.000009532012,0.00022579366,0.00010159567],"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.000059595317,0.0005299099,0.00021092303,0.0019385547,0.00033201688,0.0000048497254,0.028591027,0.650571,0.0001816441,0.063623525,0.013108949,0.24084803],"study_design_scores_gemma":[0.00037881575,0.000076083605,0.00011714026,0.00014833131,0.0000080685595,0.000090376125,0.00082326453,0.9939505,0.00005494325,0.00003180311,0.004119141,0.00020154624],"about_ca_topic_score_codex":0.00014526943,"about_ca_topic_score_gemma":6.922853e-7,"teacher_disagreement_score":0.81940943,"about_ca_system_score_codex":0.000057424888,"about_ca_system_score_gemma":0.00005469883,"threshold_uncertainty_score":0.9998624},"labels":[],"label_agreement":null},{"id":"W2059174320","doi":"10.1587/transinf.e93.d.491","title":"Consistency Checking of Safety and Availability in Access Control","year":2010,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Access Control and Trust","field":"Social Sciences","cited_by":7,"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":"Concordia University; National Natural Science Foundation of China","keywords":"Computer science; Consistency (knowledge bases); Separation of duties; Polynomial hierarchy; Access control; Hierarchy; Security policy; Task (project management); Control (management); State (computer science); Role-based access control; Computer security; Time complexity; Algorithm; Artificial intelligence","score_opus":0.016080302624352782,"score_gpt":0.2865551108094226,"score_spread":0.2704748081850698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059174320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79942083,0.0001898243,0.07008252,0.0020686288,0.0017532848,0.0018443825,0.00014853929,0.00012406346,0.12436789],"genre_scores_gemma":[0.9997338,0.00008239388,0.0000134099255,0.00007309013,0.00001773517,0.000020751473,0.0000012906545,0.0000017204463,0.000055793957],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99913377,0.00008228936,0.00042659693,0.000071193026,0.00017223661,0.0001138899],"domain_scores_gemma":[0.99939394,0.00019197691,0.00014291368,0.000091086484,0.00011424242,0.00006582819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008872484,0.00006398355,0.0001712994,0.00012617683,0.00028387888,0.00015073526,0.00008534328,0.000096988326,0.00006654686],"category_scores_gemma":[0.000067075445,0.00005724126,0.000024263434,0.00015981916,0.0001842827,0.0014206107,0.0000016186908,0.0001655361,0.0000045272623],"study_design_candidate":"observational","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.0012427809,0.0004224697,0.21858208,0.0012948291,0.00017783229,0.000002173867,0.08647977,0.003305792,0.00060873193,0.25796437,0.000056720408,0.42986244],"study_design_scores_gemma":[0.016116967,0.0002513282,0.6937675,0.00043466408,0.00017050905,0.000027066157,0.07159529,0.06600502,0.00024003813,0.0009960498,0.14922117,0.0011744015],"about_ca_topic_score_codex":0.005220365,"about_ca_topic_score_gemma":0.00459407,"teacher_disagreement_score":0.4751854,"about_ca_system_score_codex":0.000019138482,"about_ca_system_score_gemma":0.0000725745,"threshold_uncertainty_score":0.7891665},"labels":[],"label_agreement":null},{"id":"W2059906468","doi":"10.1587/transinf.e92.d.653","title":"Probabilistic Synthesis of Personal-Style Handwriting","year":2009,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Handwritten Text Recognition Techniques","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Handwriting; Computer science; Naturalness; Character (mathematics); Style (visual arts); Probabilistic logic; Natural language processing; Natural (archaeology); Speech recognition; Artificial intelligence; Mathematics; Literature; Art","score_opus":0.01316318079131615,"score_gpt":0.23206487674241927,"score_spread":0.21890169595110312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059906468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052664187,0.00003398603,0.98645777,0.00036979094,0.000094562376,0.00031337515,0.000018272814,0.00026534323,0.007180507],"genre_scores_gemma":[0.99675447,0.00003256892,0.0029403644,0.00014887562,0.00000985457,0.000057475194,0.0000016935383,0.000002301305,0.00005242683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990608,0.00005369736,0.00042435576,0.00010514831,0.00023297906,0.00012303247],"domain_scores_gemma":[0.9993116,0.000140147,0.00015515603,0.00016624699,0.00016427497,0.00006252163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003408286,0.000098780954,0.00016257865,0.0002506994,0.00014874195,0.0001878301,0.00015275403,0.00006465107,0.000012508375],"category_scores_gemma":[0.000035536974,0.00009117571,0.00005147201,0.00025087994,0.000027342323,0.0013547513,0.0000019087433,0.00009379116,0.000026751706],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018804834,0.00012163012,0.000007699899,0.00033864297,0.000024974122,9.839074e-7,0.004421439,0.00030828232,0.00039021095,0.017672908,0.0001814829,0.97651297],"study_design_scores_gemma":[0.0015181942,0.0011467048,0.0014624373,0.0018702856,0.00008429034,0.00038495485,0.0062087607,0.9284038,0.046366677,0.0018017724,0.009646374,0.0011057537],"about_ca_topic_score_codex":0.000030647647,"about_ca_topic_score_gemma":0.0000015925615,"teacher_disagreement_score":0.99148804,"about_ca_system_score_codex":0.000030125426,"about_ca_system_score_gemma":0.000029432445,"threshold_uncertainty_score":0.37180376},"labels":[],"label_agreement":null},{"id":"W2071044302","doi":"10.1587/transinf.e95.d.2456","title":"A Framework for Measuring and Managing Value Achievement in Business Processes","year":2012,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Hierarchy; Business value; Value (mathematics); Construct (python library); Measure (data warehouse); Business process; Process (computing); Process management; Knowledge management; Management science; Data mining; Work in process; Business; Machine learning; Marketing; Microeconomics; Programming language; Political science","score_opus":0.033616920507265856,"score_gpt":0.2434644670349946,"score_spread":0.20984754652772875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071044302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05005284,0.00045605702,0.94696903,0.0010630089,0.00033320102,0.00036912656,0.000004590536,0.00009581014,0.00065632677],"genre_scores_gemma":[0.9984477,0.00013804088,0.0005658543,0.00045420838,0.00017759149,0.00017169847,0.000011864744,0.000010856529,0.000022152122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991131,0.0000060643333,0.000364286,0.00011021697,0.00018079343,0.0002255851],"domain_scores_gemma":[0.9994259,0.000057668934,0.00016111184,0.00009158737,0.00024428792,0.000019433428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004970205,0.00014329341,0.00018309109,0.00049977424,0.00028258713,0.00045616188,0.000062480445,0.00007098973,0.0000037997943],"category_scores_gemma":[0.000055992055,0.00012894273,0.000023907267,0.00068025384,0.000018461493,0.003728555,0.000004876893,0.00009636085,0.000010999566],"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.0006146467,0.0009647532,0.024325665,0.053120255,0.00036853892,0.0000012159478,0.009712281,0.41376203,0.00006307147,0.23331608,0.00012685647,0.2636246],"study_design_scores_gemma":[0.0032170275,0.000027678794,0.014636411,0.0035580676,0.00046530337,0.00001744101,0.019862195,0.9065607,0.000065127846,0.0045825583,0.045612253,0.0013952157],"about_ca_topic_score_codex":0.00045664023,"about_ca_topic_score_gemma":0.000026106527,"teacher_disagreement_score":0.9483949,"about_ca_system_score_codex":0.000023046301,"about_ca_system_score_gemma":0.000014863085,"threshold_uncertainty_score":0.5258132},"labels":[],"label_agreement":null},{"id":"W2081772578","doi":"10.1587/transinf.2014edl8237","title":"Efficient In-Network Processing of Continuous Grouped Aggregation Queries in Sensor Networks","year":2015,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Wireless sensor network; Data aggregator; Efficient energy use; Reduction (mathematics); Distributed computing; Data mining; Computer network","score_opus":0.01265091925197559,"score_gpt":0.21725361514621494,"score_spread":0.20460269589423935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081772578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12896283,0.00026470356,0.86895496,0.00006607345,0.0005774864,0.0003070185,0.0000014043547,0.00008255369,0.00078300096],"genre_scores_gemma":[0.9974067,0.000024694531,0.0024112258,0.000052481537,0.000028444223,0.00003806674,0.00000435687,0.0000057648135,0.00002823118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983918,0.00013796675,0.00073823397,0.00015675828,0.0003180532,0.00025715123],"domain_scores_gemma":[0.9991424,0.00010238315,0.0002822518,0.0002130627,0.00017563316,0.00008426196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007434029,0.00014305684,0.0002608024,0.00033494426,0.00007995768,0.00016473317,0.0001662229,0.0001251001,6.908589e-7],"category_scores_gemma":[0.00001546734,0.00013688779,0.000029692239,0.0009302532,0.00004873495,0.00062679587,0.000006460247,0.00019376335,0.0000037924433],"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.000030891206,0.00004230854,0.00034601768,0.000045138913,0.0000033045717,0.0000013445162,0.0031659931,0.9790704,0.0000024053004,0.0017138063,0.000011677025,0.015566709],"study_design_scores_gemma":[0.0007716031,0.00006620002,0.0007512673,0.00032058448,0.0000029608918,0.00001746541,0.0016093253,0.99604696,0.000025439651,0.0000071582035,0.00024326857,0.00013775463],"about_ca_topic_score_codex":0.0002347648,"about_ca_topic_score_gemma":0.000108450295,"teacher_disagreement_score":0.8684439,"about_ca_system_score_codex":0.00009576103,"about_ca_system_score_gemma":0.00005697782,"threshold_uncertainty_score":0.55821216},"labels":[],"label_agreement":null},{"id":"W2083044521","doi":"10.1587/transinf.e94.d.363","title":"Enhanced Distal Radius Segmentation in DXA Using Modified ASM","year":2011,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Radiomics and Machine Learning in Medical Imaging","field":"Medicine","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Segmentation; Computer science; RADIUS; Artificial intelligence; Computer vision; Enhanced Data Rates for GSM Evolution; Image segmentation; Radiography; Soft tissue; Pattern recognition (psychology); Medicine; Radiology","score_opus":0.027645622637437164,"score_gpt":0.28332346727142266,"score_spread":0.2556778446339855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083044521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39038867,0.000024189472,0.60061234,0.00006579226,0.00030203647,0.0002985644,0.0000047263798,0.00004144843,0.008262227],"genre_scores_gemma":[0.9984483,0.000037570015,0.0011996605,0.000158044,0.000020572428,0.000024744379,0.000016216685,0.000006409409,0.00008849849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922377,0.000035351724,0.00036751913,0.0000813459,0.0001686066,0.00012342386],"domain_scores_gemma":[0.99966437,0.000023507495,0.000091065,0.00009202585,0.00003883649,0.0000902224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022695502,0.00008945299,0.00015448578,0.000234836,0.00009058724,0.000041840573,0.000028212438,0.000059570742,0.000042952954],"category_scores_gemma":[0.000014130193,0.000079204074,0.000032089018,0.00014553293,0.000032726915,0.00047265756,9.4722924e-7,0.00020811448,0.000013104074],"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.002838013,0.0013103103,0.003494297,0.0031189073,0.0005037885,0.000059399736,0.13637261,0.13160421,0.058867328,0.009532661,0.00026822044,0.6520302],"study_design_scores_gemma":[0.004489233,0.00022546921,0.0043043983,0.00042861103,0.000077414086,0.00019439566,0.00826477,0.9769295,0.004070526,0.00003847487,0.00072119554,0.00025602293],"about_ca_topic_score_codex":0.0006745228,"about_ca_topic_score_gemma":0.0000062141794,"teacher_disagreement_score":0.8453253,"about_ca_system_score_codex":0.00006461056,"about_ca_system_score_gemma":0.000033254673,"threshold_uncertainty_score":0.32298484},"labels":[],"label_agreement":null},{"id":"W2093426958","doi":"10.1587/transinf.e96.d.1602","title":"FPGA Design Framework Combined with Commercial VLSI CAD","year":2013,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":13,"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":"University of Tokyo; Synopsys","keywords":"Field-programmable gate array; Computer science; Routing (electronic design automation); Bitstream; Embedded system; FPGA prototype; Very-large-scale integration; Code (set theory); Computer hardware; Computer architecture; Decoding methods; Set (abstract data type); Algorithm; Programming language","score_opus":0.012897559675903817,"score_gpt":0.2032000263192102,"score_spread":0.19030246664330638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093426958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041440665,0.000037120913,0.99056935,0.00008101893,0.00024460605,0.00068958866,0.000012286532,0.00066280237,0.0035591708],"genre_scores_gemma":[0.99664825,0.000062741616,0.0027345524,0.00013314837,0.00002228751,0.0003104259,0.000007032497,0.000014509477,0.00006703968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999309,0.000032857155,0.00028842335,0.000059272534,0.00015319756,0.0001572178],"domain_scores_gemma":[0.99956506,0.00008241346,0.000040169045,0.00015459684,0.00007222253,0.000085555235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011659506,0.00014636545,0.00016020346,0.00015663452,0.00014386009,0.00020883455,0.00007268229,0.00013725038,0.00006856994],"category_scores_gemma":[0.000002762509,0.0001205211,0.000024918654,0.00016537108,0.000026361666,0.00094919436,6.821451e-7,0.00022265904,0.00017449383],"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.00036110423,0.00023686638,0.0002152695,0.0017625649,0.00056644424,0.000004989544,0.01899144,0.43583724,0.0008524797,0.010071057,0.033809725,0.49729082],"study_design_scores_gemma":[0.0033378156,0.00223789,0.003045477,0.0011090417,0.00014773833,0.00017691696,0.0062228767,0.92515,0.012181706,0.00078027847,0.043647308,0.0019629903],"about_ca_topic_score_codex":0.00010868964,"about_ca_topic_score_gemma":0.000004563633,"teacher_disagreement_score":0.9925042,"about_ca_system_score_codex":0.000038664726,"about_ca_system_score_gemma":0.000010912092,"threshold_uncertainty_score":0.49147078},"labels":[],"label_agreement":null},{"id":"W2237100638","doi":"10.1587/transinf.2015mup0008","title":"Application Authentication System with Efficiently Updatable Signature","year":2015,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Cryptography and Data Security","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":"University of Calgary","funders":"","keywords":"Computer science; Broadcasting (networking); Service provider; Authentication (law); Key (lock); Computer security; Computer network; Protocol (science); Service (business)","score_opus":0.009401317934923107,"score_gpt":0.20915703705375732,"score_spread":0.19975571911883422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237100638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014176208,0.00006737197,0.9954125,0.00014648533,0.00029635755,0.00044172956,0.00006508011,0.0002919718,0.0018608267],"genre_scores_gemma":[0.9972336,0.000005868545,0.0024661832,0.000073010895,0.00001637409,0.00010609283,0.00008150219,0.0000034222542,0.000013892321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990072,0.00004844363,0.00028410178,0.00016441812,0.00035630877,0.00013951735],"domain_scores_gemma":[0.9990206,0.000031332733,0.00014525806,0.00045141994,0.00020806534,0.00014336752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040008768,0.000115151306,0.0001145359,0.0002226413,0.00021234344,0.0004293532,0.00024411744,0.00007699657,0.0000010864959],"category_scores_gemma":[0.0000033190381,0.000092201044,0.000022888573,0.00055295316,0.000027727594,0.0024023743,0.0000048160564,0.00012762628,0.000088722525],"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.00010431861,0.00015365126,0.00006800364,0.00040732493,0.000052528947,0.0000010370296,0.0077922633,0.031590383,0.000080100326,0.9361232,0.0010114072,0.022615807],"study_design_scores_gemma":[0.0010504217,0.0001830993,0.00018978342,0.000099192854,0.000023366472,0.000097053744,0.0049725757,0.9394189,0.00016108001,0.000079898244,0.05345659,0.0002680548],"about_ca_topic_score_codex":0.00012892694,"about_ca_topic_score_gemma":0.000010613057,"teacher_disagreement_score":0.99581605,"about_ca_system_score_codex":0.00005635633,"about_ca_system_score_gemma":0.000055035605,"threshold_uncertainty_score":0.4140263},"labels":[],"label_agreement":null},{"id":"W2583299496","doi":"10.1587/transinf.2016edp7349","title":"Energy-Aware Download Method in LTE Based Smartphone","year":2017,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Green IT and Sustainability","field":"Engineering","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":"Science North","funders":"","keywords":"Computer science; Download; Upload; Markov decision process; Mobile device; Cellular network; Computer network; Energy consumption; Real-time computing; Markov process; Operating system","score_opus":0.009912045986491626,"score_gpt":0.2348197807728085,"score_spread":0.22490773478631687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583299496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014056852,0.000035854126,0.97880507,0.00013928757,0.00052080315,0.00019142126,0.000076237135,0.00014872318,0.0060257656],"genre_scores_gemma":[0.999599,0.000018365245,0.00014459724,0.00004114465,0.000011796212,0.00007451036,0.000016654618,0.000004727514,0.000089231435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992947,0.00003655698,0.00031710757,0.00007154907,0.0001279692,0.00015211437],"domain_scores_gemma":[0.99945885,0.000047299734,0.000053938184,0.00031299386,0.00005949337,0.0000674039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031040373,0.00011469546,0.00015624364,0.00018880726,0.00023252358,0.0002194921,0.00010072771,0.00009537171,0.000026799646],"category_scores_gemma":[0.0000058538435,0.00010966207,0.000040358074,0.0000618583,0.000022340671,0.00089098443,0.0000012769972,0.00012968064,0.000020854037],"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.00013742066,0.000102225815,0.0021882628,0.001777535,0.00008421099,0.0000075308953,0.004578419,0.50682676,0.00012657561,0.0008914872,0.0012498552,0.48202974],"study_design_scores_gemma":[0.0009469516,0.000029340352,0.0038747475,0.00005682172,0.000009688653,0.0000058386267,0.0012959926,0.9690725,0.0004078996,0.000025440093,0.02407499,0.00019979852],"about_ca_topic_score_codex":0.0012776129,"about_ca_topic_score_gemma":0.00045668564,"teacher_disagreement_score":0.9855421,"about_ca_system_score_codex":0.00008258135,"about_ca_system_score_gemma":0.00002233418,"threshold_uncertainty_score":0.44718894},"labels":[],"label_agreement":null},{"id":"W2918751067","doi":"10.1587/transinf.e93.d.409","title":"FOREWORD","year":2010,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Artificial intelligence","score_opus":0.01143687110926771,"score_gpt":0.23790402068326513,"score_spread":0.2264671495739974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918751067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50251424,0.000031097024,0.42105502,0.0004253365,0.0050137825,0.0013828739,0.0007823857,0.0011419358,0.06765334],"genre_scores_gemma":[0.998877,0.0000051311254,0.00016525394,0.00012982372,0.00004183691,0.000088528956,0.000018124143,0.000013718306,0.0006605824],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990822,0.000026083808,0.00038509272,0.000081617094,0.0002554979,0.00016952606],"domain_scores_gemma":[0.99935037,0.000053773165,0.00011765674,0.00023499019,0.00011855373,0.00012467105],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033504184,0.00012364167,0.00012319842,0.00029263692,0.00026251402,0.00017602861,0.0000835247,0.00011505156,0.00017951764],"category_scores_gemma":[0.000012564616,0.000110081244,0.00004413291,0.00023441965,0.00004877519,0.0016456285,8.4414717e-7,0.00031971704,0.0037690953],"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.0012546539,0.00089809066,0.0017443278,0.001807043,0.00062821084,0.0000071768195,0.041069157,0.036677577,0.029314894,0.27829504,0.033858184,0.57444566],"study_design_scores_gemma":[0.0023663435,0.00018160453,0.0033500004,0.000081811966,0.000060029157,0.00030373482,0.005592023,0.16746326,0.0016852866,0.00008585506,0.81819874,0.0006313145],"about_ca_topic_score_codex":0.00015294844,"about_ca_topic_score_gemma":0.00011527944,"teacher_disagreement_score":0.78434056,"about_ca_system_score_codex":0.000024130406,"about_ca_system_score_gemma":0.00002870241,"threshold_uncertainty_score":0.9970066},"labels":[],"label_agreement":null},{"id":"W3046443771","doi":"10.1587/transinf.2020edl8027","title":"H-TLA: Hybrid-Based and Two-Level Addressing Architecture for IoT Devices and Services","year":2020,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Architecture; Memory footprint; Hash function; Footprint; Internet of Things; Distributed computing; Embedded system; Point (geometry); Computer architecture; Computer security; Operating system","score_opus":0.04237371806617456,"score_gpt":0.2580769657033194,"score_spread":0.21570324763714482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046443771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017597139,0.0001570713,0.9792364,0.0016630102,0.0007500481,0.00034290057,0.000009148131,0.00012529356,0.00011894378],"genre_scores_gemma":[0.9788713,0.0000064194655,0.019174753,0.0017200884,0.00017831291,0.000028308274,0.0000065833156,0.000005907138,0.000008332884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921876,0.0000402754,0.00028252523,0.00016157606,0.00013975007,0.00015711025],"domain_scores_gemma":[0.9994099,0.00017120365,0.00012005604,0.000104354236,0.000071494906,0.00012300546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020888422,0.00013299797,0.00015561383,0.00011999716,0.00042027252,0.00066982186,0.00013166707,0.00004077998,4.414227e-7],"category_scores_gemma":[0.000005070327,0.00011629712,0.000026134112,0.00013991042,0.000024086934,0.0006874001,0.00000754584,0.00011140404,0.0000033032145],"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.0002046147,0.00005058374,0.0002600899,0.0061002607,0.000119163466,0.0000033396557,0.036447555,0.123534694,0.0004223966,0.001222841,0.00054283073,0.83109164],"study_design_scores_gemma":[0.0008077026,0.000096644406,0.00020118146,0.00015891751,0.000012874725,0.000028123222,0.00037259224,0.98624927,0.00037353084,0.000033466666,0.0115087135,0.0001569818],"about_ca_topic_score_codex":0.000049048147,"about_ca_topic_score_gemma":0.0000068832123,"teacher_disagreement_score":0.96127415,"about_ca_system_score_codex":0.00001020414,"about_ca_system_score_gemma":0.000038590006,"threshold_uncertainty_score":0.6459108},"labels":[],"label_agreement":null},{"id":"W4283746838","doi":"10.1587/transinf.2021edp7182","title":"A Large-Scale Bitcoin Abuse Measurement and Clustering Analysis Utilizing Public Reports","year":2022,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Cybercrime and Law Enforcement Studies","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Cryptocurrency; Cybercrime; Computer security; Computer science; Profiling (computer programming); Internet privacy; Data science; Scale (ratio); World Wide Web; The Internet; Cartography","score_opus":0.03301002557133231,"score_gpt":0.238363890228461,"score_spread":0.20535386465712868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283746838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018198226,0.0001817014,0.9773254,0.00025973836,0.00037987003,0.0002655321,0.0000106393345,0.00013209328,0.0032468245],"genre_scores_gemma":[0.99921507,0.00005991317,0.00022979554,0.00025632506,0.0000071168465,0.00013673346,0.0000058249025,0.0000028681577,0.00008637454],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855226,0.00006840205,0.0004835088,0.00016803971,0.0005392907,0.00018848023],"domain_scores_gemma":[0.9993725,0.000023363835,0.00015055586,0.0002767028,0.00009994168,0.00007698103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010514401,0.00011002171,0.00018050031,0.00044823016,0.0010367862,0.00037993275,0.000105334526,0.00002268153,0.000026977],"category_scores_gemma":[0.000004603356,0.00010567583,0.00006542531,0.00069070136,0.000014162516,0.0012805377,0.000023592229,0.000121181205,0.0000032590494],"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.00015667977,0.0010146352,0.008327221,0.0014562078,0.005511347,0.00005821122,0.4054351,0.40176544,0.0003168971,0.042002622,0.0028617193,0.13109393],"study_design_scores_gemma":[0.00070133724,0.00013110986,0.0016425354,0.000027301287,0.00016416976,0.00014653566,0.028057469,0.7976697,0.00003508236,0.000019301851,0.17107031,0.00033510613],"about_ca_topic_score_codex":0.00027293846,"about_ca_topic_score_gemma":0.0003244741,"teacher_disagreement_score":0.9810168,"about_ca_system_score_codex":0.00009928606,"about_ca_system_score_gemma":0.000025013318,"threshold_uncertainty_score":0.7974226},"labels":[],"label_agreement":null},{"id":"W4298118924","doi":"10.1587/transinf.2022edp7069","title":"Frank-Wolfe for Sign-Constrained Support Vector Machines","year":2022,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":0,"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":"Institute of Genetics; Japan Society for the Promotion of Science; Environmental Restoration and Conservation Agency","keywords":"Computer science; Sign (mathematics); Support vector machine; Generalization; Representation (politics); Domain (mathematical analysis); Function (biology); Feature (linguistics); Artificial intelligence; Sign function; Limit (mathematics); Mathematical optimization; Algorithm; Machine learning; Mathematics","score_opus":0.010742485547676844,"score_gpt":0.23602085616745605,"score_spread":0.2252783706197792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298118924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002620177,0.000024102725,0.9907496,0.0010898386,0.0011363958,0.00041205127,0.0000989705,0.00024982446,0.0036190625],"genre_scores_gemma":[0.9969412,0.000004775217,0.0011408427,0.0005270218,0.000029777591,0.00029701507,0.000030914176,0.0000055087366,0.0010229234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901557,0.00007552067,0.0003451883,0.00013283695,0.0002581041,0.00017280597],"domain_scores_gemma":[0.99941117,0.00011797924,0.00012244382,0.00021199795,0.000058360674,0.00007806794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048616726,0.00011404687,0.00014126138,0.00021119011,0.0007497036,0.00024121208,0.00023868213,0.000029656421,0.00011139331],"category_scores_gemma":[0.000010233175,0.000107609085,0.00006654909,0.00022528414,0.000017069278,0.00076833606,0.0000069008734,0.00015501621,0.000034352517],"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.00019246142,0.00026855676,0.00009704068,0.00060937164,0.00015849053,0.000004621732,0.022216192,0.19794035,0.00017596781,0.08177757,0.009407541,0.68715185],"study_design_scores_gemma":[0.0010311799,0.00042056054,0.00017668193,0.000009504109,0.0000109360435,0.00011798952,0.0009131753,0.7382646,0.000035264802,0.00004895944,0.25876063,0.00021051061],"about_ca_topic_score_codex":0.00012775652,"about_ca_topic_score_gemma":0.0000041090357,"teacher_disagreement_score":0.99432105,"about_ca_system_score_codex":0.0000358,"about_ca_system_score_gemma":0.00006176422,"threshold_uncertainty_score":0.57661897},"labels":[],"label_agreement":null},{"id":"W4400167095","doi":"10.1587/transinf.2023edp7102","title":"Conflict Management Method Based on a New Belief Divergence in Evidence Theory","year":2024,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"Science North","funders":"","keywords":"Divergence (linguistics); Credibility; Dempster–Shafer theory; Computer science; Information fusion; Artificial intelligence; Kullback–Leibler divergence; Sensor fusion; Data mining; Epistemology","score_opus":0.1708050005189233,"score_gpt":0.4327161722974736,"score_spread":0.2619111717785503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400167095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016321,0.0003037771,0.98925287,0.0005999429,0.0016494576,0.0005794363,0.00002845732,0.000107738866,0.0058462117],"genre_scores_gemma":[0.99180216,0.00012303352,0.003857448,0.0008495482,0.000033441534,0.000087536035,0.0000022604995,0.000009666592,0.0032349085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644756,0.00049095403,0.0010945182,0.00035193353,0.0014084376,0.00020660533],"domain_scores_gemma":[0.99545354,0.0036254337,0.00014461679,0.0005135801,0.00012099864,0.00014181035],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0059330785,0.00018537503,0.000252019,0.0014838154,0.00018014395,0.0013012033,0.00039672555,0.00009157765,0.0005994535],"category_scores_gemma":[0.00030558096,0.00013855594,0.00009689215,0.0012295998,0.000031319418,0.0018015632,0.000009940907,0.00023148638,0.0010770777],"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.0002871429,0.000042191245,0.00007017451,0.00017269647,0.00002625878,0.000016777372,0.004932446,0.20206578,0.000029090648,0.021447264,0.002314298,0.7685959],"study_design_scores_gemma":[0.00058247586,0.000091803566,0.0012824197,0.0011487217,0.000017553257,0.000014602428,0.0032686556,0.88617206,0.000052388546,0.0008469284,0.10631906,0.0002033209],"about_ca_topic_score_codex":0.00013474614,"about_ca_topic_score_gemma":0.000018606179,"teacher_disagreement_score":0.99017006,"about_ca_system_score_codex":0.00010058344,"about_ca_system_score_gemma":0.000074027186,"threshold_uncertainty_score":0.99973553},"labels":[],"label_agreement":null},{"id":"W4401161503","doi":"10.1587/transinf.2023lop0011","title":"Geometric Refactoring of Quantum and Reversible Circuits Using Graph Algorithms","year":2024,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","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":"University of New Brunswick","funders":"","keywords":"Computer science; Qubit; Algorithm; Quantum circuit; Quantum computer; Quantum gate; Quantum algorithm; Quantum; Graph; Theoretical computer science; Quantum error correction","score_opus":0.02258909350059323,"score_gpt":0.24814131644318682,"score_spread":0.22555222294259358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401161503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046053957,0.00072344235,0.951623,0.00006112963,0.0010840383,0.0001316395,0.000015156835,0.00014361434,0.0001640107],"genre_scores_gemma":[0.9975142,0.00012097588,0.0022823429,0.000020548987,0.000027413256,0.0000037007205,0.0000012699221,0.000004743946,0.000024800544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990772,0.000035370293,0.000348186,0.00015356476,0.00023678652,0.00014888009],"domain_scores_gemma":[0.9994841,0.00012103734,0.00008339496,0.00017040374,0.00006553096,0.00007548868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033386503,0.00011510178,0.00015625272,0.000836181,0.00020662221,0.0003631292,0.00012959643,0.00006238823,0.0000017636188],"category_scores_gemma":[0.00000642264,0.000100056954,0.000046042616,0.0010375994,0.000030645613,0.0010742287,0.000007949978,0.00017236178,0.0000043370096],"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.0000072341463,0.000052871757,0.00006416026,0.0021454936,0.000160879,0.000008974311,0.010376929,0.2059267,0.0005692617,0.022056751,0.00007431936,0.7585564],"study_design_scores_gemma":[0.00014199424,0.00007235202,0.00015414676,0.00026671862,0.000010929861,0.00011620634,0.00027449414,0.99674594,0.00022624645,0.00010998223,0.0017621077,0.00011886605],"about_ca_topic_score_codex":0.00017520347,"about_ca_topic_score_gemma":5.8394465e-7,"teacher_disagreement_score":0.95146024,"about_ca_system_score_codex":0.000026107318,"about_ca_system_score_gemma":0.000040278326,"threshold_uncertainty_score":0.4080204},"labels":[],"label_agreement":null},{"id":"W4401161820","doi":"10.1587/transinf.2023edp7238","title":"Unveiling Python Version Compatibility Challenges in Code Snippets on Stack Overflow","year":2024,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Software Engineering Research","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":"University of Victoria","funders":"","keywords":"Python (programming language); Computer science; Programming language; Source code; Compatibility (geochemistry); World Wide Web; Engineering","score_opus":0.04424765382061606,"score_gpt":0.2838154316304337,"score_spread":0.23956777780981764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401161820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11979298,0.0008720709,0.8735493,0.0008239234,0.002303656,0.00047625104,0.000040083254,0.0007166405,0.0014250858],"genre_scores_gemma":[0.9993191,0.00030507072,0.00024512925,0.00002654738,0.000020551095,0.000027407745,0.0000043365317,0.000005762545,0.00004614076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988356,0.00006945283,0.00032050628,0.00019651256,0.00039652057,0.0001813847],"domain_scores_gemma":[0.9989376,0.0005916923,0.000029322375,0.0003094881,0.000053216067,0.00007867861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007020337,0.00011584594,0.00013613183,0.00044671728,0.00009153781,0.00032161144,0.0001751957,0.000078589044,0.000009794357],"category_scores_gemma":[0.000041414973,0.00010618322,0.000034640587,0.00036622962,0.000015836515,0.0013895864,0.0000058846836,0.00029348698,0.0002363956],"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.00014060304,0.00026599085,0.00046803334,0.0037628417,0.00008367786,0.000027681961,0.02328608,0.590546,0.00011539776,0.02564132,0.000974307,0.35468805],"study_design_scores_gemma":[0.0003689655,0.000171317,0.0036789854,0.0005440814,0.0000023142968,0.00001551396,0.0006455203,0.9790812,0.00025142293,0.000025778436,0.015055208,0.00015970373],"about_ca_topic_score_codex":0.00007479295,"about_ca_topic_score_gemma":0.000024174322,"teacher_disagreement_score":0.8795261,"about_ca_system_score_codex":0.00017066183,"about_ca_system_score_gemma":0.000054600696,"threshold_uncertainty_score":0.43300262},"labels":[],"label_agreement":null},{"id":"W4407873494","doi":"10.1587/transinf.2024edl8064","title":"Product Rating Distribution Estimation Using an LDL-Based Method with Uniform Manifold Approximation and Projection","year":2025,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Manufacturing Process and Optimization","field":"Engineering","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":"Centre for International Governance Innovation","funders":"","keywords":"Computer science; Projection (relational algebra); Estimation; Distribution (mathematics); Product (mathematics); Manifold (fluid mechanics); Artificial intelligence; Mathematical optimization; Applied mathematics; Mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.011902315303700168,"score_gpt":0.24168084999646758,"score_spread":0.2297785346927674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407873494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026243785,0.000028611565,0.97215015,0.000035402307,0.00017866482,0.0006418789,0.000023973907,0.0002925479,0.00040499016],"genre_scores_gemma":[0.9807795,0.00001529334,0.018854124,0.000021793338,0.00001392258,0.00009682764,0.0001872768,0.000009807074,0.000021419404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992124,0.000038509654,0.00034534183,0.000129581,0.00015216295,0.000122042875],"domain_scores_gemma":[0.99959296,0.000027976412,0.000098927456,0.0001220981,0.0001160031,0.00004203146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031054037,0.00015569491,0.00013569064,0.00025652436,0.00032530702,0.00031033801,0.00003314404,0.00007822638,0.000002648505],"category_scores_gemma":[0.0000076771585,0.0001397015,0.000013984122,0.0003043047,0.000013762123,0.0017967005,0.000001019799,0.00012376026,9.459123e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002973639,0.000016060705,0.000016454345,0.00080956204,0.00001591614,6.040806e-8,0.00036070927,0.9595864,0.000055698438,0.00068674184,0.0000038285316,0.038418826],"study_design_scores_gemma":[0.0004702069,0.000055851386,0.00021677816,0.00019373378,0.000044536147,0.000013557037,0.00060171535,0.99403954,0.003940043,0.00001790432,0.00025575078,0.00015039633],"about_ca_topic_score_codex":0.00011181331,"about_ca_topic_score_gemma":0.000016130783,"teacher_disagreement_score":0.9545357,"about_ca_system_score_codex":0.00011552196,"about_ca_system_score_gemma":0.00003640678,"threshold_uncertainty_score":0.56968623},"labels":[],"label_agreement":null}]}