{"meta":{"query_hash":"c38c9694e939","filters":{"venue":"Information Sciences"},"cohort_total":231,"direct_labels_cover":0,"predictions_cover":231,"exported":231,"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/c38c9694e939","api":"https://metacan.xera.ac/api/v1/cohort?venue=Information+Sciences"},"results":[{"id":"W1843766148","doi":"10.1016/j.ins.2015.08.011","title":"Rough set models in multigranulation spaces","year":2015,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Equivalence relation; Rough set; Equivalence (formal languages); Mathematics; Intersection (aeronautics); Relation (database); Approximations of π; Set (abstract data type); Space (punctuation); Equivalence class (music); Pure mathematics; Discrete mathematics; Computer science; Applied mathematics; Data mining","score_opus":0.12609384422823136,"score_gpt":0.30657283156596277,"score_spread":0.1804789873377314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843766148","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.09596063,0.000073500276,0.7946316,0.0029227983,0.0005713566,0.00023497529,0.0000030732115,0.00017190985,0.105430156],"genre_scores_gemma":[0.9604138,0.000005334889,0.039091893,0.00045574605,0.000013470972,0.000006518811,0.0000030453864,6.0625666e-7,0.000009580201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989841,0.000029488985,0.0002435742,0.000111157,0.0004588189,0.00017287285],"domain_scores_gemma":[0.9995761,0.00003182532,0.00010103556,0.00015132409,0.00007731526,0.00006243311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009484743,0.000064908854,0.00007235945,0.00022076779,0.00009242337,0.0005482823,0.000574176,0.000033254848,0.0000020854734],"category_scores_gemma":[0.000056958663,0.00004875079,0.00001637615,0.0008545514,0.00006784725,0.010982775,0.00008947691,0.000046832938,0.00010221222],"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.0000047995813,0.000020505306,0.004118746,0.0000067341875,0.0000013794555,0.0000011380794,0.035406943,0.6547773,0.0000034710113,0.19737834,0.0023275416,0.10595311],"study_design_scores_gemma":[0.00019546712,0.000035738318,0.0022843017,0.0000053332865,2.533674e-7,0.0000026538344,0.0006104152,0.9571323,0.000017743885,0.035846267,0.00379001,0.00007951284],"about_ca_topic_score_codex":0.000307902,"about_ca_topic_score_gemma":0.000037475602,"teacher_disagreement_score":0.8644532,"about_ca_system_score_codex":0.000030519837,"about_ca_system_score_gemma":0.00010271934,"threshold_uncertainty_score":0.79622465},"labels":[],"label_agreement":null},{"id":"W1928687368","doi":"10.1016/j.ins.2015.07.043","title":"Toward a multilevel representation of protein molecules: Comparative approaches to the aggregation/folding propensity problem","year":2015,"lang":"en","type":"article","venue":"Information Sciences","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Proteome; Folding (DSP implementation); Graph; Protein folding; Representation (politics); Computational biology; Superposition principle; Soundness; Biological system; Chemistry; Theoretical computer science; Physics; Biology; Biochemistry","score_opus":0.2353637778918376,"score_gpt":0.3188195885615217,"score_spread":0.0834558106696841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1928687368","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.81828964,0.000045694913,0.17457555,0.00065653515,0.00004983816,0.0011251895,0.000013638276,0.000010484344,0.005233434],"genre_scores_gemma":[0.98045427,0.000001159955,0.019252386,0.00012874305,0.000025616426,0.00007366742,0.00003070109,0.0000014610272,0.000032001055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992179,0.000049840986,0.000231719,0.00011727499,0.00028069917,0.000102561964],"domain_scores_gemma":[0.9994302,0.0000064019714,0.00018492376,0.00014358264,0.00018862574,0.000046264995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045045448,0.000071741815,0.00008674302,0.000052147265,0.000103148355,0.000069640184,0.00024375888,0.000038970105,9.256044e-7],"category_scores_gemma":[0.00016093464,0.000045894863,0.000025745821,0.00026102393,0.00014125547,0.00006829734,0.000102839105,0.000035739322,0.000007820649],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009001179,0.00018314565,0.009773307,0.0002965481,0.0001900827,0.0000011379703,0.13443376,0.40693083,0.17612761,0.05306244,0.0053122398,0.21278878],"study_design_scores_gemma":[0.000865845,0.00066740345,0.004609714,0.000075450575,0.000014349677,0.00002192712,0.012728957,0.07387089,0.89337665,0.004060297,0.009313753,0.00039477105],"about_ca_topic_score_codex":0.00007166741,"about_ca_topic_score_gemma":0.000024885723,"teacher_disagreement_score":0.71724904,"about_ca_system_score_codex":0.000011030105,"about_ca_system_score_gemma":0.00014103959,"threshold_uncertainty_score":0.18715382},"labels":[],"label_agreement":null},{"id":"W194158148","doi":"10.1016/s0020-0255(00)00031-1","title":"Intelligent Manufacturing and Fault Diagnosis","year":2000,"lang":"en","type":"article","venue":"Information Sciences","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"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; Fault (geology); Artificial intelligence; Data mining; Geology; Seismology","score_opus":0.022549827253893966,"score_gpt":0.24324087990782475,"score_spread":0.2206910526539308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194158148","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.95795256,0.000044937442,0.001368525,0.00002898085,0.00028629196,0.00008403204,0.0000020693465,0.00012707051,0.040105563],"genre_scores_gemma":[0.9996896,0.00011268946,0.00006222941,0.000044619082,0.000036383746,0.000011735862,6.358863e-7,0.0000012645571,0.00004087452],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995699,0.00000552405,0.00016306488,0.000037743022,0.00013776819,0.0000860079],"domain_scores_gemma":[0.9998819,0.0000243069,0.000015301099,0.000039292074,0.000008795356,0.000030397463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019987984,0.00004617767,0.00004756709,0.00008754275,0.000118618154,0.00016065307,0.000047163012,0.00003321227,0.00031353184],"category_scores_gemma":[0.00000877201,0.000036604142,0.000012855677,0.00011290158,0.000028225688,0.0009613541,0.0000051574084,0.00004168126,0.00027522352],"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.0000010339573,7.46246e-7,0.00012703163,0.00000764138,0.000001674491,8.538233e-8,0.0005178715,0.019354086,0.000009379294,0.000037991118,0.0006979249,0.97924453],"study_design_scores_gemma":[0.00019955014,0.000076926255,0.003954212,0.00004897793,0.000003575938,0.000023596078,0.0010249452,0.07438095,0.070774935,0.00019432753,0.8490889,0.000229108],"about_ca_topic_score_codex":0.000045335804,"about_ca_topic_score_gemma":0.0000031042155,"teacher_disagreement_score":0.9790154,"about_ca_system_score_codex":0.000013420727,"about_ca_system_score_gemma":0.000003665809,"threshold_uncertainty_score":0.35375333},"labels":[],"label_agreement":null},{"id":"W1967451774","doi":"10.1016/j.ins.2005.12.004","title":"A motion compression/reconstruction method based on max t-norm composite fuzzy relational equations","year":2006,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Data compression ratio; Norm (philosophy); Fuzzy logic; Data compression; Computer vision; Compression (physics); Compression ratio; Computer science; Image compression; Artificial intelligence; Algorithm; Image (mathematics); Image processing","score_opus":0.029359771998687563,"score_gpt":0.3082857185496629,"score_spread":0.27892594655097536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967451774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006458997,0.000007681407,0.969481,0.0010983762,0.00034821115,0.00025502776,0.000027010423,0.0004978257,0.027638998],"genre_scores_gemma":[0.33934367,0.0000010922076,0.6599047,0.0005534667,0.000039220024,0.000041379997,0.00008295653,0.000002815333,0.00003072384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780875,0.00013567242,0.0005935592,0.00029672435,0.0009269359,0.00023833448],"domain_scores_gemma":[0.9983087,0.00048975815,0.00045646846,0.00043423357,0.00024412178,0.0000667119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088989735,0.0001627049,0.0001412161,0.0006703425,0.0008082283,0.0004329449,0.000781188,0.00008042487,0.000045186836],"category_scores_gemma":[0.00011909156,0.0001381016,0.000061047394,0.0011090941,0.00015933893,0.0079789795,0.0001476531,0.00016216766,0.00014299114],"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.000009357372,0.000058966936,0.00075708725,0.000008970716,0.0000020621817,4.3110546e-7,0.000099074394,0.3098567,0.00086032914,0.45694628,0.0018142702,0.22958645],"study_design_scores_gemma":[0.00025196758,0.000054303044,0.0056640366,0.000055072203,0.000002207749,0.000013582531,0.000021608987,0.94034487,0.0055358494,0.043623183,0.004251814,0.0001814921],"about_ca_topic_score_codex":0.00006955701,"about_ca_topic_score_gemma":0.0000042207985,"teacher_disagreement_score":0.63048816,"about_ca_system_score_codex":0.00009563896,"about_ca_system_score_gemma":0.000111643756,"threshold_uncertainty_score":0.621632},"labels":[],"label_agreement":null},{"id":"W1974043253","doi":"10.1016/s0020-0255(00)00025-6","title":"Intelligent Manufacturing and Fault Diagnosis (I). Computational intelligence for manufacturing","year":2000,"lang":"en","type":"article","venue":"Information Sciences","topic":"Manufacturing Process and Optimization","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Computer science; Fault (geology); Artificial intelligence; Computational intelligence; Machine learning; Manufacturing engineering; Engineering","score_opus":0.01930810185664467,"score_gpt":0.2504691841300835,"score_spread":0.23116108227343884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974043253","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.3810475,0.00013732794,0.6109511,0.00019555565,0.00023925466,0.0004059277,0.00002472147,0.00031355937,0.0066850274],"genre_scores_gemma":[0.98783123,0.0003859732,0.011460801,0.00014931211,0.000030494337,0.00007474285,0.000022091357,0.0000058111627,0.00003951984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991687,0.000004834085,0.00031349965,0.00011217771,0.00020529334,0.00019550203],"domain_scores_gemma":[0.9996993,0.00011234653,0.000041852574,0.000060529248,0.00002678293,0.000059203125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020667126,0.00012174002,0.00009519081,0.00014789338,0.00025601703,0.0003017245,0.00015558432,0.00004348068,0.0003328359],"category_scores_gemma":[0.000013336782,0.00010961621,0.000027395108,0.000074909476,0.000077341916,0.0014480216,0.000016240996,0.000059023496,0.000050811872],"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.0000019713502,0.0000018078844,0.000025092706,0.000050416624,0.00000301189,4.170889e-8,0.0004203478,0.6368507,1.8579843e-7,0.00012324013,0.00007573908,0.3624474],"study_design_scores_gemma":[0.00010762933,0.000039589304,0.0014910367,0.000042237476,0.0000063720795,0.000006949862,0.00028279863,0.8932009,0.060392786,0.0036445474,0.040535785,0.00024940193],"about_ca_topic_score_codex":0.000012902233,"about_ca_topic_score_gemma":0.0000033619997,"teacher_disagreement_score":0.60678375,"about_ca_system_score_codex":0.000026854414,"about_ca_system_score_gemma":0.000010555774,"threshold_uncertainty_score":0.44700193},"labels":[],"label_agreement":null},{"id":"W1977640927","doi":"10.1016/j.ins.2013.02.038","title":"Pattern Language Verification in Model Driven Design","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Software design pattern; Pattern language (formal languages); Formalism (music); Software walkthrough; Natural language processing; Programming language; Modeling language; Artificial intelligence; Software; Software development","score_opus":0.02505260938569466,"score_gpt":0.2525559950593367,"score_spread":0.22750338567364203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977640927","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.012480264,0.000005929137,0.98607576,0.00033159443,0.00005076878,0.00023042447,6.78453e-7,0.00033208117,0.0004924751],"genre_scores_gemma":[0.58286023,0.000002581043,0.41688564,0.00017925144,0.000003404547,0.000058831254,0.0000011726921,0.0000011180035,0.000007780343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991718,0.00002288173,0.00023311752,0.000119457356,0.00028691528,0.00016586365],"domain_scores_gemma":[0.9995481,0.00002820003,0.00007847094,0.00024753474,0.000060846112,0.00003688291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041293525,0.00007250452,0.00006576815,0.0002612327,0.000059320486,0.00030784353,0.0007925335,0.000037003978,0.000009668101],"category_scores_gemma":[0.000012827116,0.000063920714,0.000015419773,0.00045710383,0.000041464322,0.0056189443,0.00008519648,0.000063298,0.00018231192],"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":[2.994951e-7,0.00001100246,0.0006775374,0.000008536213,9.96713e-7,3.2329274e-7,0.008011171,0.56432575,0.0005717262,0.024362497,0.0008672525,0.40116292],"study_design_scores_gemma":[0.000047754318,0.000016373895,0.0021163933,0.000010851294,2.1492104e-7,0.0000014925686,0.000025573614,0.99514973,0.0012006577,0.0010663996,0.00027881333,0.00008576241],"about_ca_topic_score_codex":0.00012778699,"about_ca_topic_score_gemma":0.0000025141635,"teacher_disagreement_score":0.57038,"about_ca_system_score_codex":0.000041723215,"about_ca_system_score_gemma":0.000055039203,"threshold_uncertainty_score":0.4073599},"labels":[],"label_agreement":null},{"id":"W1978209500","doi":"10.1016/j.ins.2013.06.053","title":"Some new topological properties of the triangular pyramid networks","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"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":"Pyramid (geometry); Topology (electrical circuits); Computer science; Mathematics; Combinatorics; Geometry","score_opus":0.03224226172739179,"score_gpt":0.22104500384862227,"score_spread":0.1888027421212305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978209500","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.23721552,0.00066517614,0.7297556,0.014425416,0.006030075,0.0009995812,4.947618e-7,0.0002068374,0.010701333],"genre_scores_gemma":[0.9980949,0.0000067130404,0.00053482625,0.0009631582,0.00013264788,0.000010903885,9.647307e-8,6.239626e-7,0.0002561337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990565,0.00005183861,0.00034261926,0.00008174787,0.00031092748,0.00015636513],"domain_scores_gemma":[0.9994286,0.00002825676,0.00018834007,0.00021312345,0.00010181801,0.000039915205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004855772,0.000060307684,0.000092550225,0.0000573653,0.00021953549,0.00040077567,0.0009531889,0.000044988814,0.000028300234],"category_scores_gemma":[0.00006938778,0.000029361947,0.000057476776,0.00044882632,0.00019534554,0.0036878053,0.0001482796,0.000064598855,0.00006356369],"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.000004422825,0.000027374645,0.00085809926,0.000018776747,0.000013440119,1.1841479e-7,0.0053147497,0.048886407,0.00037019828,0.853166,0.021452166,0.069888264],"study_design_scores_gemma":[0.00021177092,0.000086082844,0.002349101,0.000046068053,0.0000013352795,0.000012761709,0.00061077473,0.97741294,0.0017229607,0.008508136,0.008921545,0.00011654766],"about_ca_topic_score_codex":0.0003240229,"about_ca_topic_score_gemma":0.000004722176,"teacher_disagreement_score":0.9285265,"about_ca_system_score_codex":0.000012558848,"about_ca_system_score_gemma":0.00007485771,"threshold_uncertainty_score":0.3864689},"labels":[],"label_agreement":null},{"id":"W1982654704","doi":"10.1016/j.ins.2014.07.026","title":"A general construction of binary interleaved sequences of period 4N with optimal autocorrelation","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Autocorrelation; Binary number; Autocorrelation technique; Pseudorandom binary sequence; Mathematics; Autocorrelation matrix; Complementary sequences; Period (music); Statistics; Algorithm; Physics; Arithmetic","score_opus":0.01000664072589551,"score_gpt":0.22704436950104015,"score_spread":0.21703772877514463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982654704","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.57216257,0.0000040531268,0.4255577,0.00008686238,0.00010563266,0.000055307013,8.130781e-7,0.000029826839,0.0019972322],"genre_scores_gemma":[0.8954105,0.0000010890687,0.10453981,0.000030240108,0.000008540439,0.000004777907,0.000001160938,6.066375e-7,0.0000032918913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917394,0.00005233839,0.00028558873,0.000091387075,0.0003022877,0.000094469615],"domain_scores_gemma":[0.9993264,0.000048144848,0.0003246738,0.00013975217,0.0001358137,0.000025221572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066006684,0.0000623979,0.00009801279,0.00026885193,0.00012419993,0.00008961408,0.00040940807,0.000026442756,0.000013913859],"category_scores_gemma":[0.000029762083,0.000045565066,0.000034652072,0.00068129384,0.00053036044,0.0028554779,0.00005162463,0.000040902614,0.0000045757984],"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.000041136536,0.000021880438,0.0072200145,0.000040425995,0.000009810915,1.5721872e-7,0.0092258705,0.027665898,0.0043296735,0.83940345,0.000023317023,0.11201839],"study_design_scores_gemma":[0.00046291406,0.0015670834,0.014431189,0.000111123714,0.000008548158,0.00006180882,0.0019349103,0.9524873,0.019239565,0.008645732,0.00083076337,0.0002190815],"about_ca_topic_score_codex":0.000014169184,"about_ca_topic_score_gemma":0.0000011817637,"teacher_disagreement_score":0.9248214,"about_ca_system_score_codex":0.000006624494,"about_ca_system_score_gemma":0.000074708325,"threshold_uncertainty_score":0.20701525},"labels":[],"label_agreement":null},{"id":"W1983817189","doi":"10.1016/j.ins.2012.12.017","title":"A new indirect approach to the type-2 fuzzy systems modeling and design","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Interval (graph theory); Fuzzy logic; Similarity (geometry); Computer science; Type (biology); Data mining; Cluster (spacecraft); Fuzzy set; Process (computing); Algorithm; Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.05420820848661295,"score_gpt":0.23285343206588247,"score_spread":0.1786452235792695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983817189","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.0015272426,0.00018084608,0.9339347,0.0009044415,0.00033438872,0.0005263909,1.8509378e-7,0.00007086897,0.06252094],"genre_scores_gemma":[0.9707742,0.00000451399,0.028402299,0.0005937983,0.00005250867,0.00005425443,2.4628224e-7,9.612872e-7,0.00011725459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902755,0.00006119312,0.00022811246,0.00012665275,0.00037206654,0.0001844249],"domain_scores_gemma":[0.99949056,0.000061248444,0.000074018375,0.0001895984,0.000089266585,0.000095322874],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010300961,0.00007362315,0.00009350168,0.00010740497,0.0002998564,0.0015782949,0.00078908086,0.000028777886,8.1418153e-7],"category_scores_gemma":[0.00005586623,0.000040306204,0.000013270689,0.00065870554,0.000027837164,0.0028574173,0.00010998158,0.00004521284,0.0002622921],"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.0000034003276,0.000007748548,0.00017481121,0.000020388456,0.000010982446,1.03037834e-7,0.013013809,0.63089025,0.000033462107,0.21805051,0.017603192,0.12019133],"study_design_scores_gemma":[0.000065652785,0.000044548997,0.00013002806,0.000007931885,9.587621e-7,0.000013199197,0.00093508157,0.9944029,0.0000026815458,0.0026169023,0.0017062754,0.00007384732],"about_ca_topic_score_codex":0.0007648642,"about_ca_topic_score_gemma":0.000001131334,"teacher_disagreement_score":0.9692469,"about_ca_system_score_codex":0.000013712213,"about_ca_system_score_gemma":0.00011531491,"threshold_uncertainty_score":0.99945813},"labels":[],"label_agreement":null},{"id":"W1984385850","doi":"10.1016/j.ins.2007.12.013","title":"The application of the Hilbert spectrum to the analysis of electromyographic signals","year":2008,"lang":"en","type":"article","venue":"Information Sciences","topic":"Muscle activation and electromyography studies","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Spectrogram; Visualization; Pattern recognition (psychology); Time–frequency analysis; Computer science; Motor unit; Instantaneous phase; Artificial intelligence; Hilbert transform; Speech recognition; Spurious relationship; Continuous wavelet transform; Wavelet; Feature extraction; Signal processing; Feature (linguistics); SIGNAL (programming language); Electromyography; Wavelet transform; Computer vision; Discrete wavelet transform; Digital signal processing","score_opus":0.0102711428862256,"score_gpt":0.22312401317808497,"score_spread":0.21285287029185937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984385850","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.95781773,0.00021003495,0.028822256,0.0041340706,0.00011902094,0.00042380308,0.0000072991684,0.000056332967,0.008409473],"genre_scores_gemma":[0.9996626,0.00012726878,0.000034774566,0.00012998343,0.000007887122,0.000028441056,0.0000010283526,0.0000011302078,0.0000068968616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9992081,0.000018397823,0.00027289338,0.000042911448,0.00033381203,0.00012388318],"domain_scores_gemma":[0.99947906,0.00013071504,0.00011560116,0.00019034458,0.00007045398,0.000013854635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038305117,0.00005429058,0.000090352725,0.00025324477,0.00045417572,0.000022971757,0.0003861094,0.000014196373,0.0000043584732],"category_scores_gemma":[0.00004172873,0.00002504877,0.00010193964,0.0048669777,0.00021709678,0.00025194962,0.00002008498,0.000047256435,0.0000012347144],"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.000029400228,0.000047889524,0.08755489,0.00005214248,0.0018726815,3.2664154e-8,0.02237235,0.58814424,0.015468918,0.042701576,0.01343968,0.22831619],"study_design_scores_gemma":[0.000060463164,0.000041324944,0.8937833,0.000004657516,0.000068611356,0.0000011460762,0.0006765853,0.053943902,0.018797247,0.00043340062,0.032095015,0.00009439261],"about_ca_topic_score_codex":0.00007637619,"about_ca_topic_score_gemma":0.00016263803,"teacher_disagreement_score":0.80622834,"about_ca_system_score_codex":0.000009131248,"about_ca_system_score_gemma":0.000017982122,"threshold_uncertainty_score":0.34931985},"labels":[],"label_agreement":null},{"id":"W1984430235","doi":"10.1016/j.ins.2014.03.096","title":"The effect of news and public mood on stock movements","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":257,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Stock (firearms); Mood; Business; Information sharing; Affect (linguistics); Stock market; Computer science; Psychology; World Wide Web","score_opus":0.025132334567825584,"score_gpt":0.22688058105052084,"score_spread":0.20174824648269524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984430235","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.7237298,0.000055823588,0.00030764498,0.0006129287,0.00018824868,0.00011114669,0.0000061925066,0.0000070150622,0.27498123],"genre_scores_gemma":[0.9996017,0.000050176008,0.000027516202,0.00024528435,0.0000112686785,0.000008988924,9.850407e-7,7.87395e-7,0.000053254393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995177,0.000010841612,0.00026145406,0.000059072325,0.00004800933,0.00010296273],"domain_scores_gemma":[0.9995549,0.00010667135,0.00022559437,0.00008161755,0.000011048913,0.000020175175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009158203,0.000045871515,0.000087603934,0.000089690366,0.00022440005,0.00021577891,0.00014052042,0.00001743798,0.000013691981],"category_scores_gemma":[0.00027902875,0.00002926242,0.000017785913,0.00014577284,0.0001612755,0.0009658441,0.000022531363,0.000025304103,0.000046095014],"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.000006079437,0.0000033122146,0.07696385,0.000010499095,0.0000029979187,2.8532623e-9,0.0001385051,0.000026408987,0.0000010720366,0.89022267,0.00047305645,0.032151572],"study_design_scores_gemma":[0.0010966064,0.0028254143,0.48267722,0.000025542806,0.0000018752309,5.402211e-7,0.0005200837,0.022397948,0.00040761568,0.10445835,0.3853276,0.00026119404],"about_ca_topic_score_codex":0.00009079544,"about_ca_topic_score_gemma":0.000011694769,"teacher_disagreement_score":0.7857643,"about_ca_system_score_codex":0.000007241481,"about_ca_system_score_gemma":0.0000066399575,"threshold_uncertainty_score":0.2080761},"labels":[],"label_agreement":null},{"id":"W1990092496","doi":"10.1016/j.ins.2014.03.106","title":"A new credibilistic clustering algorithm","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Fuzzy clustering; Computer science; FLAME clustering; Data mining; Correlation clustering; CURE data clustering algorithm; Measure (data warehouse); Pattern recognition (psychology); Fuzzy logic; Credibility; Artificial intelligence","score_opus":0.025568710353121037,"score_gpt":0.3085933236606262,"score_spread":0.28302461330750517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990092496","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013602209,0.000009688292,0.98544633,0.0006807981,0.00043071955,0.00009391674,8.3334265e-7,0.00022813711,0.012973548],"genre_scores_gemma":[0.043584995,0.000004104492,0.95549124,0.00049092283,0.000115244344,0.0000053898957,0.0000012745577,0.0000026642786,0.0003041844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983738,0.00003841855,0.00028480095,0.00019947559,0.00075432705,0.00034916744],"domain_scores_gemma":[0.9991028,0.00016671116,0.000103263425,0.00035379056,0.00010915049,0.00016431026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009714578,0.00009809863,0.00010028768,0.00026061118,0.00031508357,0.00078627205,0.0014114017,0.000033059885,0.000024210598],"category_scores_gemma":[0.00034501034,0.00008340888,0.000029710976,0.0008957486,0.00010462528,0.0053795343,0.000474666,0.000101635844,0.00040590676],"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":[4.951787e-7,0.0000020171835,0.000009624648,0.0000053011913,9.956951e-7,2.736418e-7,0.0006313736,0.006480427,0.000015773883,0.0052720625,0.00036169228,0.98722],"study_design_scores_gemma":[0.00016176097,0.000082964834,0.0003376203,0.000011848644,4.6909142e-7,0.000022155336,0.000071420174,0.97142553,0.0001946696,0.0052365153,0.022339424,0.00011561195],"about_ca_topic_score_codex":0.000088550434,"about_ca_topic_score_gemma":0.0000056415233,"teacher_disagreement_score":0.98710436,"about_ca_system_score_codex":0.000045793207,"about_ca_system_score_gemma":0.00015530319,"threshold_uncertainty_score":0.758204},"labels":[],"label_agreement":null},{"id":"W1990568667","doi":"10.1016/j.ins.2014.10.049","title":"Facilitating risky project negotiation: An integrated approach using fuzzy real options, multicriteria analysis, and conflict analysis","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Ministry of Environment; National Natural Science Foundation of China","keywords":"Fuzzy logic; Negotiation; Computer science; Operations research; Flexibility (engineering); Conflict analysis; Brownfield; Risk analysis (engineering); Management science; Conflict resolution; Redevelopment; Artificial intelligence; Mathematics; Business; Economics; Engineering; Civil engineering","score_opus":0.0770332381768909,"score_gpt":0.30246933398805637,"score_spread":0.22543609581116547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990568667","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.8423871,0.00040501074,0.15251513,0.000041233172,0.000059308717,0.00016047787,0.00013167365,0.000049813123,0.0042502405],"genre_scores_gemma":[0.95866007,0.0003943975,0.040390458,0.000087900975,0.000024906232,0.000011463681,0.00037616727,0.0000025552686,0.000052097625],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985853,0.000070841525,0.0007664799,0.00027962346,0.000105010025,0.00019277607],"domain_scores_gemma":[0.9990233,0.0000780539,0.0005309842,0.00019971182,0.00009646137,0.000071477814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020424924,0.00013276262,0.00039522842,0.002122682,0.0004530843,0.00071593275,0.00018419567,0.000065184664,0.000051806368],"category_scores_gemma":[0.00018455823,0.00011945192,0.00016395644,0.00429869,0.00020634294,0.002876145,0.000036003123,0.00006890024,0.000024963449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001898051,0.00012303915,0.43884772,0.000053617896,0.0021746818,1.7031765e-7,0.035039164,0.16034217,0.00006291417,0.35714215,0.00007677754,0.0061186007],"study_design_scores_gemma":[0.00013672118,0.000034559576,0.03853216,0.0000015565262,0.00029729816,5.408224e-7,0.0045137163,0.9546063,0.000007732335,0.0011698109,0.0005308578,0.0001687609],"about_ca_topic_score_codex":0.0072475034,"about_ca_topic_score_gemma":0.00022199008,"teacher_disagreement_score":0.79426414,"about_ca_system_score_codex":0.00004833215,"about_ca_system_score_gemma":0.000023769066,"threshold_uncertainty_score":0.9993633},"labels":[],"label_agreement":null},{"id":"W1991818145","doi":"10.1016/j.ins.2011.11.001","title":"A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Logarithm; Computer science; Scheduling (production processes); Learning effect; Position (finance); Single-machine scheduling; Artificial intelligence; Mathematical optimization; Mathematics; Job shop scheduling; Schedule; Operating system; Economics","score_opus":0.009746961941900655,"score_gpt":0.2204452142784615,"score_spread":0.21069825233656084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991818145","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.16317979,0.00006495351,0.830767,0.000060195664,0.0000890193,0.00014104239,0.0000035144499,0.00030587896,0.005388645],"genre_scores_gemma":[0.80084914,0.0000016188418,0.19898881,0.00012952306,0.000006969908,0.0000064583132,0.000010157637,0.000004912259,0.000002414676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931717,0.00001656654,0.00019040421,0.000083552375,0.00025745347,0.00013486613],"domain_scores_gemma":[0.9996077,0.00009894128,0.00009201721,0.000061848696,0.0000861842,0.000053330685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003126536,0.00010503451,0.00010720115,0.00027437092,0.00019215464,0.00009439173,0.00009850951,0.00004469316,0.00002025568],"category_scores_gemma":[0.00006116935,0.000082785664,0.000016562508,0.00044272258,0.0001334468,0.0006143149,0.0000061499754,0.000107485626,0.000019702302],"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.000019912224,0.0000095452015,0.0011858882,0.00008680699,0.0000030023416,4.555529e-7,0.00064827147,0.9741847,0.00008198107,0.000044878205,0.0000013318855,0.023733225],"study_design_scores_gemma":[0.00045804444,0.00020435631,0.0009827818,0.00014964679,0.000007214744,0.0000018189288,0.000057193134,0.9852801,0.012708085,0.000012031448,0.000022539807,0.000116195944],"about_ca_topic_score_codex":0.000017021046,"about_ca_topic_score_gemma":0.0000014818886,"teacher_disagreement_score":0.6376693,"about_ca_system_score_codex":0.000016099433,"about_ca_system_score_gemma":0.000063769105,"threshold_uncertainty_score":0.33759013},"labels":[],"label_agreement":null},{"id":"W1993246951","doi":"10.1016/j.ins.2003.03.015","title":"CLIP4: Hybrid inductive machine learning algorithm that generates inequality rules","year":2003,"lang":"en","type":"article","venue":"Information Sciences","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"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; Pruning; Missing data; Algorithm; Feature (linguistics); Inductive bias; Tree (set theory); Data mining; Benchmarking; Machine learning; Artificial intelligence; Mathematics; Multi-task learning","score_opus":0.0490641143084704,"score_gpt":0.28807386267861396,"score_spread":0.23900974837014355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993246951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026426317,0.00006304311,0.96496266,0.00041538995,0.0002635219,0.000116539304,0.000051064322,0.00017362482,0.0075278445],"genre_scores_gemma":[0.36504504,0.00005402299,0.6339647,0.00065609766,0.000045879202,0.000047938993,0.00008008024,0.00000362618,0.00010259554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866796,0.00009283007,0.00030356963,0.00022658193,0.000457655,0.00025140258],"domain_scores_gemma":[0.99920225,0.00009959064,0.00023029922,0.0002650615,0.00012180389,0.00008099181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386247,0.0001187113,0.00011529593,0.00016947756,0.00070818316,0.00087037386,0.00077766663,0.000028823519,0.000027847804],"category_scores_gemma":[0.00017488936,0.00009529002,0.000033494118,0.0006217095,0.0001649161,0.0056391354,0.00014530458,0.00014579787,0.00024233531],"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":[4.447427e-7,0.000032644504,0.0027391205,0.0000059328313,0.000008627049,7.010022e-7,0.0019280398,0.00045395925,0.000037730693,0.113735296,0.0008059521,0.8802515],"study_design_scores_gemma":[0.00021392525,0.00007814147,0.0022435852,0.000011074323,0.0000033847955,0.000036040376,0.0006635471,0.83310765,0.006986105,0.009786139,0.14655451,0.0003158975],"about_ca_topic_score_codex":0.00014845675,"about_ca_topic_score_gemma":0.0000030437313,"teacher_disagreement_score":0.8799357,"about_ca_system_score_codex":0.00002702898,"about_ca_system_score_gemma":0.00011920695,"threshold_uncertainty_score":0.8393035},"labels":[],"label_agreement":null},{"id":"W1994547482","doi":"10.1016/j.ins.2013.10.031","title":"Reliability analysis and fault tolerance for hypercube multi-computer networks","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Fault tolerance; Hypercube; Reliability (semiconductor); Reliability engineering; Parallel computing; Distributed computing; Engineering","score_opus":0.016345119319448754,"score_gpt":0.25063273087107957,"score_spread":0.2342876115516308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994547482","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.05156034,0.00002188098,0.9466566,0.00037859936,0.00062073994,0.00031485836,0.0000013115186,0.00007661105,0.00036909696],"genre_scores_gemma":[0.9109321,0.000006241694,0.08794358,0.00092215894,0.00007720442,0.0000690089,0.0000022735342,0.0000010411122,0.00004639414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892306,0.000037970287,0.0003964855,0.00021490589,0.00020515895,0.00022241879],"domain_scores_gemma":[0.9990832,0.00015803344,0.00015280662,0.00023059617,0.0003060329,0.00006932861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008766975,0.00009347036,0.00016285882,0.00019467331,0.0003568734,0.0010177206,0.000455681,0.00005481545,0.000012718434],"category_scores_gemma":[0.000039643022,0.00006859702,0.0000808564,0.0009658109,0.000102335645,0.0047444953,0.000084790496,0.000055082593,0.000029359371],"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.0000028802197,0.000024357805,0.0064004273,0.00002421434,0.00004273053,8.5845684e-8,0.0025847706,0.8053033,0.00001341832,0.009120902,0.0038446852,0.17263824],"study_design_scores_gemma":[0.00013018264,0.000044511737,0.022550208,0.000005679515,0.000005466222,0.0000031233099,0.00007913462,0.97348255,0.000013550905,0.00019868897,0.0033871364,0.00009977979],"about_ca_topic_score_codex":0.00025187808,"about_ca_topic_score_gemma":0.000023943645,"teacher_disagreement_score":0.8593718,"about_ca_system_score_codex":0.000017988725,"about_ca_system_score_gemma":0.000020584754,"threshold_uncertainty_score":0.9813903},"labels":[],"label_agreement":null},{"id":"W1994743372","doi":"10.1016/j.ins.2009.08.020","title":"Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model","year":2009,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":183,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Specialized Research Fund for the Doctoral Program of Higher Education of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Reduct; Rough set; Decision table; Mathematics; Property (philosophy); Set (abstract data type); Matrix (chemical analysis); Data mining; Computer science; Algorithm","score_opus":0.03591075672130698,"score_gpt":0.27148569130926253,"score_spread":0.23557493458795556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994743372","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.7552848,0.00043443672,0.18031676,0.010659637,0.0006883911,0.0006132321,0.000013945865,0.00006029431,0.051928498],"genre_scores_gemma":[0.9623355,0.000026471893,0.036951117,0.0006665708,0.0000029033022,0.0000019868091,5.2202114e-7,3.8204413e-7,0.000014542099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989768,0.000032182175,0.00035462697,0.00011878673,0.0003857441,0.00013181771],"domain_scores_gemma":[0.99940896,0.0000848316,0.00019377918,0.0002038495,0.00007844725,0.000030150837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007040603,0.00006763869,0.00010188481,0.00011710086,0.0001726088,0.00016130375,0.00049728097,0.00003487761,0.0000010540614],"category_scores_gemma":[0.00015538785,0.00003905584,0.000026122641,0.00069525046,0.00021526362,0.0029144944,0.00014178315,0.00006717333,0.0000027932015],"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.000014244578,0.00005576937,0.0029860048,0.000014215338,0.0000048391803,9.19427e-7,0.020344235,0.16034755,0.000096940996,0.5309251,0.0018209901,0.28338918],"study_design_scores_gemma":[0.0002074908,0.00007289818,0.031361356,0.000057475267,0.0000016209736,0.000011872115,0.00037697813,0.8644796,0.00016385714,0.102726884,0.00045557285,0.00008441783],"about_ca_topic_score_codex":0.000032467084,"about_ca_topic_score_gemma":0.000011482697,"teacher_disagreement_score":0.704132,"about_ca_system_score_codex":0.000022347636,"about_ca_system_score_gemma":0.00013107536,"threshold_uncertainty_score":0.2112938},"labels":[],"label_agreement":null},{"id":"W1998090465","doi":"10.1016/j.ins.2006.03.020","title":"Regranulation: A granular algorithm enabling communication between granular worlds","year":2006,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Granular computing; Granularity; Computer science; Granulation; Set (abstract data type); Algorithm; Universe; Fuzzy logic; Mathematics; Theoretical computer science; Rough set; Data mining; Artificial intelligence; Programming language; Physics","score_opus":0.02440095163976675,"score_gpt":0.26050865220547753,"score_spread":0.2361077005657108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998090465","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.0064622844,0.0002894967,0.96524537,0.0022812332,0.00019546345,0.0002334546,0.0000069705616,0.00029001568,0.02499569],"genre_scores_gemma":[0.77618116,0.000031556996,0.22310466,0.00044715256,0.00010489379,0.00001854703,0.00006933359,0.0000029549844,0.000039726838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809396,0.000084129664,0.00056959764,0.00020344985,0.0007390601,0.0003098145],"domain_scores_gemma":[0.9988094,0.00012309308,0.00029052363,0.0005445618,0.00016995468,0.000062497435],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00141847,0.00014299688,0.00016106312,0.0003729656,0.0009167848,0.0011183268,0.0014479985,0.000071031645,0.000013030693],"category_scores_gemma":[0.000030657073,0.000117512594,0.00007007614,0.0016513377,0.00022133852,0.006407034,0.00018658882,0.00012664778,0.00014237005],"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.000002328676,0.000036711685,0.012274748,0.00001843856,0.000005710035,0.0000017466152,0.0018341722,0.0045644837,0.000019830837,0.1581069,0.0026012422,0.8205337],"study_design_scores_gemma":[0.00091249,0.00016656543,0.07625585,0.00007532923,0.000016927122,0.000028298464,0.00033276205,0.5684652,0.0007276981,0.16305484,0.18919492,0.0007691766],"about_ca_topic_score_codex":0.00039439197,"about_ca_topic_score_gemma":0.000014168361,"teacher_disagreement_score":0.8197645,"about_ca_system_score_codex":0.000039813458,"about_ca_system_score_gemma":0.00007420676,"threshold_uncertainty_score":0.9999186},"labels":[],"label_agreement":null},{"id":"W1998964210","doi":"10.1016/j.ins.2011.02.002","title":"Reordering columns for smaller indexes","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université du Québec à Montréal","funders":"","keywords":"Sorting; Column (typography); Cardinality (data modeling); Bitmap; Table (database); sort; Computer science; Projection (relational algebra); Algorithm; Mathematics; Arithmetic; Database; Computer graphics (images)","score_opus":0.09889330094511244,"score_gpt":0.2681839175362711,"score_spread":0.16929061659115863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998964210","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004394346,0.0000113322885,0.97496414,0.00011365003,0.00037797992,0.00013160647,0.0000040343193,0.000094260875,0.019908646],"genre_scores_gemma":[0.49923754,0.000008712896,0.4999016,0.0006701577,0.00003737672,0.000046636615,0.000004854968,0.000001727192,0.000091392096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993373,0.0000072743296,0.00018441117,0.000102874474,0.00021149486,0.00015662416],"domain_scores_gemma":[0.99956506,0.000036511785,0.0000986681,0.00017605802,0.00008285284,0.000040830502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043668994,0.00005248494,0.000054167154,0.00010722493,0.00032202213,0.00028655276,0.0007927094,0.00002458485,0.000024416813],"category_scores_gemma":[0.000046737572,0.000040952622,0.000022068616,0.0002890949,0.000069275775,0.0057289186,0.00018691456,0.000029141915,0.0000533052],"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.000011311686,0.00004121372,0.0022067323,0.000031143292,0.000007708078,5.3723045e-7,0.014684474,0.0002910098,0.00009196767,0.31791055,0.010193366,0.65453],"study_design_scores_gemma":[0.00057103625,0.00033844038,0.017133838,0.000044374698,0.0000028307727,0.00001522605,0.00078062195,0.6744623,0.003815178,0.02825216,0.27416414,0.00041984013],"about_ca_topic_score_codex":0.000059234764,"about_ca_topic_score_gemma":0.000007233091,"teacher_disagreement_score":0.6741713,"about_ca_system_score_codex":0.000007341996,"about_ca_system_score_gemma":0.00005986308,"threshold_uncertainty_score":0.41533276},"labels":[],"label_agreement":null},{"id":"W2001021886","doi":"10.1016/j.ins.2012.05.011","title":"Multiple stages grey target decision making method with incomplete weight based on multi-granularity linguistic label","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Nanjing University of Aeronautics and Astronautics; National Science Foundation","keywords":"Granularity; Computer science; Group decision-making; Harmony (color); Artificial intelligence; Set (abstract data type); Data mining; Mathematics","score_opus":0.17949086061932573,"score_gpt":0.44996152980473914,"score_spread":0.2704706691854134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001021886","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.060148474,0.000050683535,0.9336811,0.000209912,0.0014956584,0.0005334548,0.000099417695,0.0001539353,0.0036273752],"genre_scores_gemma":[0.5509655,9.225964e-7,0.44788107,0.0010070147,0.00008805408,0.00001886293,0.0000070160127,0.000008791173,0.000022793625],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99065423,0.00061957573,0.0017505118,0.000639991,0.0054344404,0.0009012562],"domain_scores_gemma":[0.98554,0.010603969,0.0011566197,0.001045544,0.0013046984,0.00034917565],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01767635,0.0004275344,0.00057109335,0.0018158772,0.0013324559,0.0020787707,0.0020159574,0.0001600133,0.0007260233],"category_scores_gemma":[0.028633494,0.00027005805,0.00014057166,0.0029716615,0.00042460507,0.0055050165,0.0003441304,0.0003524725,0.001079775],"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.0006941567,0.0004787629,0.52218306,0.000034773835,0.00002135929,0.000011612956,0.0069411043,0.050116215,0.0002763469,0.0035805334,0.002270668,0.4133914],"study_design_scores_gemma":[0.0017225655,0.0001745734,0.09942748,0.00017173389,0.000010745391,0.000016043,0.0006367186,0.85712135,0.00043356817,0.002500873,0.03730339,0.0004809407],"about_ca_topic_score_codex":0.00006399584,"about_ca_topic_score_gemma":0.000056742392,"teacher_disagreement_score":0.80700517,"about_ca_system_score_codex":0.00012706191,"about_ca_system_score_gemma":0.00023501598,"threshold_uncertainty_score":0.99997514},"labels":[],"label_agreement":null},{"id":"W2004759662","doi":"10.1016/j.ins.2009.04.018","title":"Foundations of near sets","year":2009,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Perception; Computer science; Artificial intelligence; Set (abstract data type); Mathematics; Representation (politics); Theoretical computer science; Pattern recognition (psychology); Epistemology","score_opus":0.035315420036803075,"score_gpt":0.30340314054947864,"score_spread":0.2680877205126756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004759662","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.041963615,0.000026998852,0.6604243,0.0062963907,0.00037748975,0.00014665401,0.0000031273207,0.0001376666,0.29062378],"genre_scores_gemma":[0.90493697,0.0000038558196,0.09414779,0.000899121,0.000005049446,8.551712e-7,0.0000012997426,1.8718676e-7,0.0000048981105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936724,0.000009409647,0.00019633099,0.000057044224,0.00027111926,0.000098876284],"domain_scores_gemma":[0.99962986,0.00002557847,0.00010804577,0.0001414396,0.00006823421,0.000026844691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032679737,0.00003643242,0.000049908867,0.00008443611,0.00021175349,0.00032707563,0.00054696616,0.00001567795,0.00001331675],"category_scores_gemma":[0.000040953524,0.000026912063,0.000021430305,0.0006131134,0.000100200785,0.0036506632,0.000033281125,0.000023695102,0.00009592142],"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":[6.897475e-7,0.000017315751,0.0002837112,0.0000028665925,0.0000011913501,1.5523611e-7,0.003067129,0.0021600213,0.000019571373,0.31471905,0.0016227862,0.67810553],"study_design_scores_gemma":[0.0002480732,0.0004140141,0.06314582,0.000015017571,0.0000019836923,0.000015217448,0.0002769279,0.8003661,0.00042953616,0.08075828,0.05412338,0.00020562777],"about_ca_topic_score_codex":0.000012596722,"about_ca_topic_score_gemma":8.0503594e-7,"teacher_disagreement_score":0.86297333,"about_ca_system_score_codex":0.0000061504848,"about_ca_system_score_gemma":0.00008379392,"threshold_uncertainty_score":0.31539977},"labels":[],"label_agreement":null},{"id":"W2005272877","doi":"10.1016/j.ins.2015.02.012","title":"Forced evolution in silico by artificial transposons and their genetic operators: The ant navigation problem","year":2015,"lang":"en","type":"article","venue":"Information Sciences","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"National Institute of General Medical Sciences; National Institutes of Health; Russian Foundation for Basic Research","keywords":"In silico; Transposable element; Computer science; Artificial intelligence; ANT; Ant colony optimization algorithms; Ant colony; Genetic algorithm; Machine learning; Biology; Genome; Genetics; Gene","score_opus":0.020799154751864418,"score_gpt":0.23023062857228815,"score_spread":0.20943147382042374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005272877","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.8631942,0.0001851663,0.13533334,0.00016117269,0.00009855462,0.00019123656,0.0000069221305,0.000039647533,0.00078970566],"genre_scores_gemma":[0.9996247,0.000015721404,0.00028516687,0.000033507666,0.000013265001,0.000017303026,0.0000058052915,0.0000017422293,0.0000027472693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945986,0.0000158259,0.00021218714,0.000053831747,0.00014317362,0.00011513741],"domain_scores_gemma":[0.9998334,0.000015803214,0.000023409593,0.00005684075,0.000035544064,0.000035013265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003787596,0.000061152816,0.000050954714,0.000055537614,0.00009648671,0.00013534912,0.00011306429,0.00002880838,0.0000030965818],"category_scores_gemma":[0.000013071962,0.00003759941,0.000009127989,0.00028097018,0.0000893149,0.00088615064,0.000006936871,0.000053415166,0.000011495613],"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.0000062534227,0.000010201082,0.0015555691,0.00003402226,0.0000045705815,1.8419387e-7,0.029464055,0.84279835,0.0074561783,0.0045949374,0.00044688125,0.11362878],"study_design_scores_gemma":[0.00009659809,0.00004494706,0.0021251314,0.00002586068,0.0000014855884,0.000006934864,0.003840084,0.97838604,0.011302711,0.0021817556,0.0018709551,0.00011747581],"about_ca_topic_score_codex":0.00010394334,"about_ca_topic_score_gemma":0.000054287633,"teacher_disagreement_score":0.13643049,"about_ca_system_score_codex":0.00003346972,"about_ca_system_score_gemma":0.00003080834,"threshold_uncertainty_score":0.15332595},"labels":[],"label_agreement":null},{"id":"W2006468521","doi":"10.1016/j.ins.2010.05.017","title":"Rough implication operator based on strong topological rough algebras","year":2010,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Smithsonian Tropical Research Institute; K. C. Wong Magna Fund in Ningbo University; Universiteit Gent; National Science Foundation","keywords":"Operator (biology); Rough set; Mathematics; Topology (electrical circuits); Operator algebra; Pure mathematics; Algebra over a field; Computer science; Data mining; Combinatorics","score_opus":0.02399098500466925,"score_gpt":0.28756539400984316,"score_spread":0.2635744090051739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006468521","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.2505804,0.000010420903,0.5499851,0.014750532,0.0019375989,0.0005338114,0.000012215622,0.0005118397,0.18167806],"genre_scores_gemma":[0.95468247,0.00000156908,0.04199919,0.003211874,0.00006272373,0.000024048946,0.000005990705,0.0000013093077,0.000010803409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986449,0.00003128546,0.0003060911,0.00022507376,0.0005198159,0.00027284876],"domain_scores_gemma":[0.99916244,0.00010114543,0.00013812276,0.00040711617,0.00010062853,0.00009055128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007254017,0.000116145595,0.00009927825,0.00014029439,0.000474344,0.0008766045,0.0012158877,0.00008260772,0.00008606678],"category_scores_gemma":[0.00014362267,0.00007897684,0.00004364378,0.0006469416,0.00019476438,0.0037951376,0.00010854455,0.00017893384,0.00037101336],"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.00000473418,0.000050884082,0.0014479177,0.0000042591837,0.0000017733399,7.12701e-7,0.00062122964,0.0059623523,0.00023722829,0.8872966,0.0013439566,0.10302835],"study_design_scores_gemma":[0.00035627632,0.00039012585,0.031235253,0.0000073764045,0.0000019343734,0.000012184077,0.000114356095,0.9192817,0.001704424,0.009027448,0.037553687,0.00031521622],"about_ca_topic_score_codex":0.00003625053,"about_ca_topic_score_gemma":0.00000610254,"teacher_disagreement_score":0.91331935,"about_ca_system_score_codex":0.000019894043,"about_ca_system_score_gemma":0.0001375433,"threshold_uncertainty_score":0.84531176},"labels":[],"label_agreement":null},{"id":"W2006710186","doi":"10.1016/j.ins.2014.04.045","title":"Function-segment artificial moment method for sensor-based path planning of single robot in complex environments","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"State Key Laboratory of Robotics and System; Harbin Institute of Technology; National Natural Science Foundation of China","keywords":"Moment (physics); Motion planning; Obstacle; Robot; Controller (irrigation); Computer science; Path (computing); Position (finance); Point (geometry); Function (biology); Control theory (sociology); Zero moment point; Key (lock); Motion controller; Artificial intelligence; Motion control; Mathematics; Control (management); Physics; Geometry; Humanoid robot","score_opus":0.0826167854986922,"score_gpt":0.3142378479436513,"score_spread":0.23162106244495909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006710186","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042703054,0.000003843477,0.99431604,0.00035517107,0.00026703888,0.00024062877,0.000004020808,0.000033352084,0.0005095919],"genre_scores_gemma":[0.2989867,1.3366021e-7,0.70053613,0.0004114945,0.000019295298,0.000025782381,0.00001232309,0.0000017958757,0.000006313915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838907,0.000083286846,0.0005312755,0.00018712619,0.00055617886,0.000253072],"domain_scores_gemma":[0.999099,0.00028070254,0.00032826327,0.00020357526,0.000036394,0.00005205476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018295983,0.000105214174,0.00016358105,0.00029784426,0.00016387993,0.00013765453,0.0004440899,0.000038231923,0.000004780166],"category_scores_gemma":[0.00008956585,0.00009373145,0.000039105194,0.00040389798,0.00008294956,0.0010206896,0.000060620932,0.000047491587,0.000015871516],"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.000009695093,0.00005519504,0.0011000078,0.000016294516,0.0000033270094,1.7095368e-7,0.001185538,0.9344343,0.0050821626,0.0030972082,0.00012852141,0.05488758],"study_design_scores_gemma":[0.00031571125,0.00032449444,0.0074804993,0.000028301156,0.0000025212908,0.000001150933,0.00025774355,0.9830499,0.0046960018,0.00070160365,0.0030285313,0.00011352728],"about_ca_topic_score_codex":0.000023100998,"about_ca_topic_score_gemma":3.748577e-7,"teacher_disagreement_score":0.29471642,"about_ca_system_score_codex":0.000065001805,"about_ca_system_score_gemma":0.0000517881,"threshold_uncertainty_score":0.38222572},"labels":[],"label_agreement":null},{"id":"W2006873874","doi":"10.1016/j.ins.2014.04.022","title":"Decision-theoretic three-way approximations of fuzzy sets","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":220,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Membership function; Element (criminal law); Fuzzy set; Fuzzy number; Approximations of π; Fuzzy logic; Interpretation (philosophy); Type-2 fuzzy sets and systems; Mathematical optimization; Set (abstract data type); Defuzzification; Applied mathematics; Computer science; Artificial intelligence","score_opus":0.01938057652172864,"score_gpt":0.2603569876540496,"score_spread":0.24097641113232093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006873874","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.017089186,0.000012931456,0.8733623,0.000534052,0.00030544194,0.00010396521,0.000002302265,0.000065021726,0.10852478],"genre_scores_gemma":[0.8397684,0.000004626737,0.15987624,0.00032675342,0.000011501228,0.0000065092518,0.0000016807193,8.8542095e-7,0.000003388627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870545,0.00002905103,0.00039705346,0.00012514959,0.0005650426,0.0001782422],"domain_scores_gemma":[0.9989916,0.0002585258,0.0002222701,0.0003371792,0.00013283428,0.00005755232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012683664,0.00007911621,0.00011297716,0.00022689323,0.00026107422,0.00029658413,0.0010986374,0.000037163598,0.000021432405],"category_scores_gemma":[0.00027001952,0.000055050947,0.00004416726,0.00086001994,0.0002687407,0.0029622645,0.00015685332,0.00004904367,0.00019548366],"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":[8.3798716e-7,0.00000891211,0.00028908387,0.000007428905,0.0000011497278,3.8738005e-8,0.00078288576,0.0016044491,0.000004904202,0.6916321,0.00038502418,0.30528316],"study_design_scores_gemma":[0.00015267584,0.000105416875,0.0068683145,0.000019613359,0.0000017341952,0.000007128418,0.0000926042,0.56791335,0.0001389092,0.4202155,0.004369753,0.00011499198],"about_ca_topic_score_codex":0.000015307238,"about_ca_topic_score_gemma":0.000006322771,"teacher_disagreement_score":0.8226792,"about_ca_system_score_codex":0.000009876899,"about_ca_system_score_gemma":0.0000565959,"threshold_uncertainty_score":0.28599674},"labels":[],"label_agreement":null},{"id":"W2007076985","doi":"10.1016/j.ins.2004.12.007","title":"Temporal analysis of clusters of supermarket customers: conventional versus interval set approach","year":2005,"lang":"en","type":"article","venue":"Information Sciences","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Saint Mary's University","funders":"","keywords":"Computer science; Self-organizing map; Cluster analysis; Data mining; Abstraction; Dimension (graph theory); Interval (graph theory); Set (abstract data type); Data set; Cluster (spacecraft); Market segmentation; Temporal database; Sorting; Artificial intelligence; Mathematics; Marketing; Algorithm","score_opus":0.04789459233703726,"score_gpt":0.31517101400867553,"score_spread":0.2672764216716383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007076985","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.09851932,0.00001698491,0.88297206,0.0005343046,0.0001741418,0.00012391448,0.00014181566,0.000044331882,0.017473143],"genre_scores_gemma":[0.90137494,0.000003024596,0.09841989,0.000066132816,0.000010021036,0.000007644223,0.00010000849,6.038818e-7,0.000017717888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988796,0.000021783007,0.00042939474,0.00011524636,0.00044461494,0.00010933646],"domain_scores_gemma":[0.99926716,0.000076886055,0.00026707439,0.00022072585,0.00012878579,0.00003937624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078906567,0.000059689635,0.00014063947,0.00049945316,0.00008443646,0.00009865855,0.00081722863,0.000023561995,0.000034934834],"category_scores_gemma":[0.000033137665,0.000050578252,0.00008862687,0.0019761221,0.00024188602,0.0031344392,0.00014012464,0.000036906877,0.00001157608],"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.00010995721,0.0005497945,0.014419555,0.00014132579,0.0012328959,2.8137384e-7,0.031238794,0.1340852,0.00019327756,0.20221984,0.014431577,0.6013775],"study_design_scores_gemma":[0.0002333696,0.000039545415,0.002567315,0.0000044131193,0.000028839908,8.749511e-7,0.0009413452,0.9914207,0.00012283592,0.000017005597,0.0045621893,0.00006158678],"about_ca_topic_score_codex":0.0000765214,"about_ca_topic_score_gemma":0.0000082302795,"teacher_disagreement_score":0.8573355,"about_ca_system_score_codex":0.000017731021,"about_ca_system_score_gemma":0.00008276773,"threshold_uncertainty_score":0.22723928},"labels":[],"label_agreement":null},{"id":"W2008228566","doi":"10.1016/j.ins.2013.01.017","title":"Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Voronoi diagram; Computer science; Set (abstract data type); Mathematical optimization; Facility location problem; Function (biology); Space (punctuation); Class (philosophy); Mathematics; Artificial intelligence","score_opus":0.04730909891146549,"score_gpt":0.2722949613739627,"score_spread":0.22498586246249722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008228566","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.04976986,0.000004941997,0.9443525,0.0011932848,0.00007098211,0.0007205687,0.000008486592,0.00012333081,0.0037560288],"genre_scores_gemma":[0.7903904,0.000002333938,0.20864491,0.00065854867,0.000008759649,0.000117310396,0.000010353471,0.0000015182042,0.00016590262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846005,0.000035375124,0.00032585498,0.00021595015,0.0006447855,0.0003179673],"domain_scores_gemma":[0.99878013,0.000044187458,0.00013010035,0.00023423292,0.0006704696,0.0001408986],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061705214,0.00011663669,0.00010503119,0.00022979687,0.00042406068,0.0013879179,0.00062515185,0.000021953181,0.00006889879],"category_scores_gemma":[0.00006845156,0.00008490289,0.00002204,0.001005598,0.00020355731,0.010421106,0.00015836024,0.00006745778,0.0006618177],"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.000012157977,0.000092979055,0.0047661127,0.0001579217,0.000026645397,6.764387e-7,0.050232574,0.6153384,0.0002514287,0.043715343,0.002397673,0.2830081],"study_design_scores_gemma":[0.00023245218,0.0002249104,0.002551321,0.000037326357,0.0000016512705,0.000010523984,0.0027223756,0.9865118,0.00073055003,0.0017636091,0.004929556,0.00028389294],"about_ca_topic_score_codex":0.0006352212,"about_ca_topic_score_gemma":0.00003241491,"teacher_disagreement_score":0.7406205,"about_ca_system_score_codex":0.00006963223,"about_ca_system_score_gemma":0.00023514,"threshold_uncertainty_score":0.99964875},"labels":[],"label_agreement":null},{"id":"W2009759761","doi":"10.1016/j.ins.2012.07.022","title":"Effectiveness of template detection on noise reduction and websites summarization","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"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; Automatic summarization; Web page; Information retrieval; The Internet; Noise (video); Preprocessor; Template; Data mining; World Wide Web; Artificial intelligence","score_opus":0.016001201890909898,"score_gpt":0.2569754104418357,"score_spread":0.2409742085509258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009759761","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.6476661,0.000017154849,0.35035786,0.00004028854,0.00024100357,0.000061698476,0.0000023587102,0.00004338225,0.0015701728],"genre_scores_gemma":[0.99806935,0.000008774815,0.0018791953,0.000012328296,0.000015160724,0.000004072669,0.0000049654145,6.526386e-7,0.000005504859],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936706,0.00006616309,0.00015939443,0.000078961086,0.00022751273,0.00010091474],"domain_scores_gemma":[0.9995578,0.00009378344,0.00013901772,0.00011273374,0.00006224758,0.000034437693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012868351,0.000050027676,0.00006720147,0.00027559864,0.0001771842,0.00013491313,0.00015725456,0.000025050318,0.0000024599397],"category_scores_gemma":[0.00009539548,0.000040105904,0.000016259673,0.00069039495,0.00007579695,0.005669428,0.000044251818,0.000030402134,0.000029732239],"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.00006347502,0.00013373651,0.05118897,0.0003193785,0.00004545626,1.2824954e-7,0.0069530215,0.008566048,0.09441387,0.052797437,0.00018862306,0.7853299],"study_design_scores_gemma":[0.00043404032,0.0003892824,0.30085167,0.00016345922,0.000021611406,0.00003071096,0.0006697988,0.16689071,0.52745485,0.001170548,0.0016098081,0.00031352733],"about_ca_topic_score_codex":0.00004377975,"about_ca_topic_score_gemma":6.4902315e-7,"teacher_disagreement_score":0.7850163,"about_ca_system_score_codex":0.000013199172,"about_ca_system_score_gemma":0.000016244143,"threshold_uncertainty_score":0.41101986},"labels":[],"label_agreement":null},{"id":"W2013517059","doi":"10.1016/j.ins.2014.04.013","title":"Multi-strategy ensemble artificial bee colony algorithm","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":260,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"Humanities and Social Sciences Youth Foundation, Ministry of Education of the People's Republic of China; Education Department of Jiangxi Province; National Natural Science Foundation of China","keywords":"Benchmark (surveying); Computer science; Mathematical optimization; Artificial bee colony algorithm; Evolutionary algorithm; Set (abstract data type); Process (computing); Population; Algorithm; Local search (optimization); Search algorithm; Artificial intelligence; Mathematics","score_opus":0.06196425370856051,"score_gpt":0.3306889462073624,"score_spread":0.2687246924988019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013517059","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039186512,0.000008133038,0.9864447,0.0008573444,0.00035738005,0.00017498393,0.0000036939678,0.0001577641,0.011604126],"genre_scores_gemma":[0.08057384,0.000009584158,0.91814214,0.00082479406,0.00008031207,0.0000277403,0.0000066261987,0.0000033437934,0.00033164464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978313,0.0001277905,0.0004697834,0.00022944565,0.0009697679,0.00037193205],"domain_scores_gemma":[0.99884886,0.00019369263,0.00018514274,0.00026804782,0.0003560885,0.00014815162],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021967702,0.00011495233,0.00013580198,0.000365964,0.00049381255,0.0012648741,0.0012730282,0.000058477242,0.00008009368],"category_scores_gemma":[0.00055176835,0.00009781047,0.00003906892,0.0012842369,0.00023919786,0.003947956,0.00020290053,0.0001170295,0.0011552189],"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.000001236725,0.0000338502,0.00003106518,0.0000069644125,0.0000037391233,7.2310456e-7,0.00071625755,0.0148244845,0.0001923071,0.03945737,0.0018560031,0.942876],"study_design_scores_gemma":[0.000157664,0.00009542787,0.00036638102,0.0000037255977,0.0000010300286,0.000008590322,0.00009597931,0.982078,0.0011853473,0.0018178689,0.014060763,0.000129198],"about_ca_topic_score_codex":0.000051387644,"about_ca_topic_score_gemma":0.000007478123,"teacher_disagreement_score":0.96725357,"about_ca_system_score_codex":0.000030289988,"about_ca_system_score_gemma":0.0002330927,"threshold_uncertainty_score":0.9997719},"labels":[],"label_agreement":null},{"id":"W2013991645","doi":"10.1016/j.ins.2013.04.002","title":"Core set analysis in inconsistent decision tables","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Core (optical fiber); Computer science; Set (abstract data type); Data mining; Programming language","score_opus":0.06705704982506497,"score_gpt":0.30136300705923036,"score_spread":0.2343059572341654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013991645","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.5404325,0.00005262483,0.42789465,0.0013803014,0.0003081589,0.00026426447,0.0000046819187,0.000088966764,0.029573848],"genre_scores_gemma":[0.9555993,0.000011457538,0.043602675,0.00075406313,0.000005406768,0.000013161037,0.000004434104,4.1861512e-7,0.000009103183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889505,0.000016662247,0.00034314083,0.00012993607,0.00042822384,0.00018699135],"domain_scores_gemma":[0.9994021,0.00011268316,0.000120261815,0.00022363295,0.00008852256,0.000052783096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065420935,0.00006670131,0.00011437398,0.0006141129,0.00015752797,0.00073881896,0.0007695496,0.000031055388,0.000093510025],"category_scores_gemma":[0.000081155995,0.000045323388,0.000046045276,0.003009344,0.00008671082,0.0053045913,0.00016668612,0.000044880726,0.00037327956],"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.000002567846,0.000040087285,0.14183995,0.000009710303,0.000028023753,0.000001988566,0.006699137,0.05551009,0.000019523357,0.055930216,0.006555082,0.7333636],"study_design_scores_gemma":[0.00010977682,0.0000353841,0.18093233,0.000007201428,0.0000036973902,0.0000028498162,0.0005361666,0.80226856,0.000014810482,0.012923398,0.0030590352,0.000106800355],"about_ca_topic_score_codex":0.0006121469,"about_ca_topic_score_gemma":0.00013730752,"teacher_disagreement_score":0.74675846,"about_ca_system_score_codex":0.00002515554,"about_ca_system_score_gemma":0.000056184792,"threshold_uncertainty_score":0.71244484},"labels":[],"label_agreement":null},{"id":"W2020695879","doi":"10.1016/j.ins.2012.03.018","title":"On the accessibility/controllability of fuzzy control systems","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University; University of Guelph","funders":"","keywords":"Controllability; Fuzzy control system; Fuzzy logic; Computer science; Control (management); Control theory (sociology); Mathematics; Artificial intelligence; Applied mathematics","score_opus":0.02670537619584393,"score_gpt":0.25940938258679014,"score_spread":0.2327040063909462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020695879","genre_codex":"other","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.36522573,0.0006810027,0.24632683,0.00485828,0.003986574,0.0019395463,0.000021897302,0.00025359954,0.37670654],"genre_scores_gemma":[0.9990584,0.0000012092702,0.00010217337,0.0007120283,0.00005538422,0.000053715732,2.7354457e-7,8.320449e-7,0.000015928841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980819,0.00023892752,0.00054810196,0.00011960302,0.00071023084,0.000301202],"domain_scores_gemma":[0.9979013,0.0009562312,0.00039343347,0.00049281126,0.00018216271,0.00007401467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048458367,0.00010160505,0.00019908715,0.00009406185,0.00027775372,0.0003479407,0.001318509,0.00004491796,0.000006218416],"category_scores_gemma":[0.0005904612,0.000051842835,0.00006929315,0.00057763857,0.00023706288,0.0038685794,0.00007201619,0.000070343514,0.000121368364],"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.000009778005,0.000030028998,0.005892061,0.000016887154,0.000008092161,2.7760834e-8,0.001012882,0.0014349583,0.000060079914,0.98763233,0.00044661417,0.0034562664],"study_design_scores_gemma":[0.0054767854,0.001443825,0.24718021,0.0002041728,0.00004394446,0.00004579414,0.007065709,0.5629057,0.0010877035,0.15886043,0.014406786,0.001278911],"about_ca_topic_score_codex":0.000099327845,"about_ca_topic_score_gemma":0.0000013660349,"teacher_disagreement_score":0.8287719,"about_ca_system_score_codex":0.00003485697,"about_ca_system_score_gemma":0.00009457419,"threshold_uncertainty_score":0.33552},"labels":[],"label_agreement":null},{"id":"W2021188143","doi":"10.1016/j.ins.2014.03.015","title":"Performance analysis of statistical optimal data fusion algorithms","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Covariance intersection; Fusion; Sensor fusion; Algorithm; Robustness (evolution); Computer science; Intersection (aeronautics); Pattern recognition (psychology); Artificial intelligence; Covariance matrix; Estimation of covariance matrices","score_opus":0.02251820317720614,"score_gpt":0.3001401519316516,"score_spread":0.27762194875444546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021188143","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.062391806,0.000006207257,0.93082213,0.0000103248185,0.00006565875,0.000046750793,0.00008465741,0.00015110683,0.0064213686],"genre_scores_gemma":[0.7977741,0.000040674044,0.2020144,0.000027240749,0.000008840059,0.0000027351552,0.00012596001,0.000001775988,0.0000043053265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991922,0.000009256323,0.0002947771,0.0000743441,0.0003158031,0.0001136203],"domain_scores_gemma":[0.9995005,0.000074785494,0.00006597938,0.00026762128,0.00005945384,0.000031623436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056280725,0.00006042509,0.00012346682,0.00033735312,0.00007083542,0.000040172883,0.00042844328,0.000023628647,0.0001125905],"category_scores_gemma":[0.00012141366,0.000050252213,0.000014694999,0.00090772245,0.00013691059,0.0023390963,0.00010669434,0.000046515757,0.000022897919],"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.000002910832,0.00000675539,0.0012239581,0.000042155105,0.000029724324,6.8148054e-8,0.0003827387,0.2875883,0.00071391294,0.00079257623,0.0016009797,0.7076159],"study_design_scores_gemma":[0.000035267494,0.000030157045,0.005914444,0.0000057965676,0.000022372371,5.6054535e-7,0.00006336269,0.98562574,0.0026391554,0.000024494118,0.0055735093,0.00006512321],"about_ca_topic_score_codex":0.000008222051,"about_ca_topic_score_gemma":0.0000016338925,"teacher_disagreement_score":0.73538226,"about_ca_system_score_codex":0.000010529503,"about_ca_system_score_gemma":0.00001155747,"threshold_uncertainty_score":0.20492259},"labels":[],"label_agreement":null},{"id":"W2021189532","doi":"10.1016/j.ins.2006.06.004","title":"Zdzisław Pawlak life and work (1926–2006)","year":2006,"lang":"en","type":"article","venue":"Information Sciences","topic":"Polish Historical and Cultural Studies","field":"Social Sciences","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Work (physics); Computer science; Mathematics; Physics; Thermodynamics","score_opus":0.0292212587153243,"score_gpt":0.27718220993761294,"score_spread":0.24796095122228864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021189532","genre_codex":"other","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.17128104,0.0009353771,0.0001346145,0.008201972,0.0005295245,0.00012996,0.0000053624594,0.00013127788,0.8186509],"genre_scores_gemma":[0.9968996,0.00008482088,0.00014144814,0.0008090116,0.00019210023,0.000007023953,0.000001512648,6.4683746e-7,0.0018638164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909663,0.000025921327,0.00017849803,0.00007006908,0.00041516894,0.00021371909],"domain_scores_gemma":[0.99968344,0.000052294152,0.00008180639,0.000032819447,0.00007030321,0.0000793546],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00042590674,0.000055715842,0.000076226985,0.000046053516,0.0015011671,0.00026106703,0.00015387074,0.000036015866,0.000064241896],"category_scores_gemma":[0.00019980574,0.000039253184,0.000021503904,0.00060497754,0.00073437573,0.0017002376,0.00003270351,0.000039389182,0.00015453596],"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.000011716491,0.000036519217,0.07609612,0.000015117248,0.0000090243575,6.082723e-7,0.04383292,0.00010564221,0.000010609088,0.44504583,0.344844,0.08999187],"study_design_scores_gemma":[0.00006316911,0.000012188084,0.047783278,0.000004573971,0.0000019813435,2.3262129e-7,0.0037346268,0.000009877096,0.00000468177,0.0036311278,0.9446648,0.000089468274],"about_ca_topic_score_codex":0.0044024014,"about_ca_topic_score_gemma":0.00071899814,"teacher_disagreement_score":0.82561857,"about_ca_system_score_codex":0.000039348324,"about_ca_system_score_gemma":0.000061719635,"threshold_uncertainty_score":0.9997987},"labels":[],"label_agreement":null},{"id":"W2023261081","doi":"10.1016/j.ins.2015.02.029","title":"On personalizing Web search using social network analysis","year":2015,"lang":"en","type":"article","venue":"Information Sciences","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; World Wide Web; Search engine; Relevance (law); The Internet; Personalized search; Information retrieval; Set (abstract data type); Social network (sociolinguistics); Social web; Web search query; Publication; Rank (graph theory); Order (exchange); Web search engine; Social media; Mathematics","score_opus":0.15349486486035194,"score_gpt":0.3650827558740766,"score_spread":0.2115878910137247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023261081","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.055628408,0.000016060229,0.90615094,0.0008557602,0.00029950473,0.00009398344,0.0000013323041,0.00017363965,0.03678037],"genre_scores_gemma":[0.971514,8.775763e-7,0.027861075,0.0005343859,0.000070685885,0.0000031763052,0.0000011439254,8.697732e-7,0.000013774685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987213,0.00007108684,0.00022453879,0.00011474233,0.00065254746,0.00021578064],"domain_scores_gemma":[0.99952435,0.000044384837,0.000114454626,0.00012299392,0.0001288186,0.000064969754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020151269,0.00006571027,0.00011366841,0.0003482381,0.00043277975,0.00074534654,0.00059103715,0.000033777935,0.0000059667036],"category_scores_gemma":[0.000021935542,0.000051825016,0.000062754276,0.002256523,0.00006073172,0.0026634815,0.00011688134,0.000061590945,0.00003276962],"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.0000060250673,0.000025552554,0.011103028,0.000014384875,0.00010385398,0.0000017467124,0.026197417,0.06474494,0.000022951552,0.81772196,0.024040509,0.05601764],"study_design_scores_gemma":[0.00007391026,0.0000474769,0.00065878214,0.0000073050855,0.000006236847,0.0000034997104,0.00071891746,0.98907906,0.000043007654,0.0034395123,0.005820592,0.0001016798],"about_ca_topic_score_codex":0.00016532563,"about_ca_topic_score_gemma":0.000008906908,"teacher_disagreement_score":0.9243341,"about_ca_system_score_codex":0.00006438285,"about_ca_system_score_gemma":0.00017621768,"threshold_uncertainty_score":0.7187394},"labels":[],"label_agreement":null},{"id":"W2023533853","doi":"10.1016/j.ins.2014.06.026","title":"Pattern-based causal relationships discovery from event sequences for modeling behavioral user profile in ubiquitous environments","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Event (particle physics); Behavioral pattern; Causal model; Human–computer interaction; Data mining; Artificial intelligence; Mathematics; Statistics; Programming language","score_opus":0.06834772404072756,"score_gpt":0.3379960558153809,"score_spread":0.2696483317746533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023533853","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.656299,0.0000055421774,0.34236732,0.0005262472,0.00010249713,0.00028462295,0.00003715088,0.000020717998,0.0003569035],"genre_scores_gemma":[0.9986878,0.0000029388127,0.0006701909,0.00023062722,0.0000722593,0.0001339069,0.00013257425,0.0000024880246,0.00006720631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982391,0.00024635065,0.00046275568,0.00018887519,0.0006110746,0.0002518208],"domain_scores_gemma":[0.9992165,0.00035347906,0.00017846923,0.00013808193,0.000046458674,0.00006699315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025164653,0.000093027134,0.00012416615,0.0002032146,0.0009867541,0.00037110236,0.00031637162,0.00008272484,0.000107892454],"category_scores_gemma":[0.0003112988,0.000085244945,0.00006579314,0.0003493911,0.00031759188,0.002684151,0.000017469458,0.00010153783,0.00004998557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021172391,0.00017679285,0.20819041,0.00002217383,0.000009449348,2.0294674e-7,0.037123404,0.70694155,0.0000803181,0.004766119,0.00008382501,0.042584565],"study_design_scores_gemma":[0.00031042163,0.00006419713,0.009308308,0.000039034298,0.000018750134,3.3121943e-8,0.01691896,0.96795493,0.00016210246,0.003130864,0.0018906347,0.00020177328],"about_ca_topic_score_codex":0.02149743,"about_ca_topic_score_gemma":0.032746375,"teacher_disagreement_score":0.3423888,"about_ca_system_score_codex":0.00017011764,"about_ca_system_score_gemma":0.000307518,"threshold_uncertainty_score":0.9850185},"labels":[],"label_agreement":null},{"id":"W2023580728","doi":"10.1016/j.ins.2014.02.001","title":"A note on “Selling multiple secrets to a single buyer”","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Cryptography and Data Security","field":"Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Communication source; Computer science; Scheme (mathematics); Protocol (science); Oblivious transfer; Theoretical computer science; Quadratic equation; Transfer (computing); Computer security; Cryptography; Mathematics; Computer network; Parallel computing","score_opus":0.025283122855442187,"score_gpt":0.26269705049440606,"score_spread":0.23741392763896388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023580728","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.049492717,0.0000027135288,0.9366901,0.0008281811,0.00032531153,0.000105143474,0.0000053694403,0.00013207838,0.012418366],"genre_scores_gemma":[0.9301061,0.000001020331,0.06708758,0.0027613959,0.000031950636,0.0000062572153,0.0000033735646,8.652542e-7,0.0000014415084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891436,0.000028693308,0.00021621338,0.00016630333,0.0004573318,0.00021711185],"domain_scores_gemma":[0.9992362,0.00020471131,0.000088007684,0.00029355046,0.00006977547,0.000107709435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008278951,0.00008002443,0.0000747134,0.00029862786,0.0003278343,0.0006584007,0.0008674991,0.000029367631,0.000007861158],"category_scores_gemma":[0.00029692677,0.00006548818,0.00003555677,0.0010284779,0.00006138275,0.003345278,0.0001281185,0.000060085564,0.00042178476],"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.000016049387,0.0000780763,0.0008955363,0.000020269412,0.0000032228602,4.9342174e-7,0.01791409,0.0093464805,0.0010349192,0.5069212,0.0024183693,0.4613513],"study_design_scores_gemma":[0.0003178659,0.00052282895,0.0026794013,0.000046443816,0.0000013671064,0.0000060549446,0.00018902603,0.68762374,0.0075650765,0.012098211,0.288634,0.00031598372],"about_ca_topic_score_codex":0.000042992302,"about_ca_topic_score_gemma":0.000030024417,"teacher_disagreement_score":0.8806134,"about_ca_system_score_codex":0.000013328633,"about_ca_system_score_gemma":0.000029475972,"threshold_uncertainty_score":0.6348973},"labels":[],"label_agreement":null},{"id":"W2024209326","doi":"10.1016/j.ins.2005.12.002","title":"Identification of defect-prone classes in telecommunication software systems using design metrics","year":2005,"lang":"en","type":"article","venue":"Information Sciences","topic":"Software Engineering Research","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Negative binomial distribution; Computer science; Suite; Poisson regression; Software; Regression analysis; Data mining; Identification (biology); Poisson distribution; Statistics; Machine learning; Mathematics; Programming language; Population","score_opus":0.07743519655449478,"score_gpt":0.32720021633184165,"score_spread":0.24976501977734689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024209326","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.098573506,0.00024131006,0.9006229,0.00006945535,0.00012302311,0.00022990676,0.0000010208204,0.000093990806,0.000044870732],"genre_scores_gemma":[0.8612731,0.000022508553,0.13865907,0.000012354057,0.000009014777,0.000016691483,0.0000011826403,0.0000017393423,0.000004297826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983827,0.00009808057,0.0005658835,0.000118109834,0.0006463928,0.00018882075],"domain_scores_gemma":[0.9981752,0.0008824953,0.00026715233,0.0003836828,0.0002571325,0.000034327673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029704764,0.00006962402,0.000104783256,0.0010313302,0.000118868214,0.00036153317,0.0011560466,0.000046555226,0.0000014614019],"category_scores_gemma":[0.0021303834,0.00006579039,0.000024817797,0.003070174,0.00008332183,0.005296769,0.00013584748,0.00008994631,0.00002908762],"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.000001608632,0.000025918853,0.008591964,0.000048343652,0.0000037488546,9.784177e-8,0.0013319149,0.9370441,0.0011025714,0.0028171034,0.000054090397,0.048978534],"study_design_scores_gemma":[0.00009938719,0.000027359372,0.011282453,0.000029675697,0.000001278725,0.000005720668,0.00012358546,0.982079,0.005906098,0.00009117748,0.0002687257,0.000085519954],"about_ca_topic_score_codex":0.00008042093,"about_ca_topic_score_gemma":0.0000037409163,"teacher_disagreement_score":0.7626996,"about_ca_system_score_codex":0.00015658193,"about_ca_system_score_gemma":0.00019608584,"threshold_uncertainty_score":0.38400295},"labels":[],"label_agreement":null},{"id":"W2025542264","doi":"10.1016/j.ins.2010.12.014","title":"Type-2 fuzzy neural networks with fuzzy clustering and differential evolution optimization","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Neuro-fuzzy; Defuzzification; Fuzzy set operations; Fuzzy classification; Fuzzy logic; Fuzzy number; Fuzzy rule; Computer science; Cluster analysis; Artificial intelligence; Fuzzy associative matrix; Fuzzy clustering; Data mining; Adaptive neuro fuzzy inference system; Machine learning; Fuzzy control system; Fuzzy set","score_opus":0.020604423311648547,"score_gpt":0.20556838166785396,"score_spread":0.1849639583562054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025542264","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.01453161,0.00004439022,0.9554123,0.00008366416,0.00046274567,0.00013877735,3.528916e-7,0.000103843275,0.029222304],"genre_scores_gemma":[0.9881288,0.000005801248,0.011684812,0.000116747695,0.000039874958,0.000007836056,0.000001682671,0.000001387258,0.000013090996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915826,0.000033461358,0.00021458318,0.00013807761,0.00026536974,0.00019026794],"domain_scores_gemma":[0.9995409,0.000019381989,0.00014684229,0.00013429027,0.00010021401,0.000058321046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024537282,0.000090069465,0.000091049034,0.00011386225,0.00028296147,0.00035203953,0.00035315813,0.00004123208,0.000004169578],"category_scores_gemma":[0.000014322748,0.00006196884,0.000013952016,0.0004438938,0.00011866431,0.003693616,0.000104416125,0.00005410222,0.000007857821],"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.00006837288,0.000025111001,0.0081669055,0.000025467327,0.000015331318,0.0000017242597,0.0047015715,0.81851155,0.000016270647,0.11793186,0.000118686105,0.050417144],"study_design_scores_gemma":[0.00021835126,0.00016976356,0.009368773,0.000009812213,0.0000028194806,0.000023974912,0.00018247307,0.98926884,0.0000029891894,0.0006302753,0.000021690226,0.00010024355],"about_ca_topic_score_codex":0.000107454565,"about_ca_topic_score_gemma":0.000015582964,"teacher_disagreement_score":0.97359717,"about_ca_system_score_codex":0.000019297124,"about_ca_system_score_gemma":0.00003240275,"threshold_uncertainty_score":0.3394725},"labels":[],"label_agreement":null},{"id":"W2028452509","doi":"10.1016/j.ins.2009.01.047","title":"Special Issue on Computer-Supported Cooperative Work: Techniques and applications","year":2009,"lang":"en","type":"article","venue":"Information Sciences","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Probabilistic logic; Computer science; Theoretical computer science; Set (abstract data type); Sequence (biology); Statistical model; Artificial intelligence; Programming language","score_opus":0.01921608485473478,"score_gpt":0.2625963698447309,"score_spread":0.24338028498999612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028452509","genre_codex":"other","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.031499356,0.0000426427,0.1689598,0.015211903,0.00047415192,0.00088450115,0.000005999818,0.0008690747,0.7820526],"genre_scores_gemma":[0.9754817,0.000025228288,0.0022316491,0.009517644,0.012487985,0.00003375761,0.000046757923,0.0000033706729,0.00017192501],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935865,0.000002236395,0.00020287029,0.00011032816,0.00021376736,0.00011212266],"domain_scores_gemma":[0.9995667,0.000011308662,0.00014151786,0.0000696612,0.0002027467,0.000008100746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002452804,0.000082253464,0.00009110966,0.0003006495,0.00041046186,0.00074644614,0.00015221168,0.00002963215,0.000078850404],"category_scores_gemma":[0.000013401267,0.0000640452,0.00001790659,0.0010688908,0.00009294744,0.0029996757,0.000027497352,0.000049593655,0.00019513046],"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.0000054810994,0.000018665041,0.00026738012,0.000010504313,0.0000023023756,2.0389521e-7,0.00008546193,0.0011524882,0.0000020775071,0.01180225,0.008096703,0.97855645],"study_design_scores_gemma":[0.00014016357,0.000024331735,0.001748626,0.000040137096,0.00001392708,0.0000013769871,0.0002460354,0.042255525,0.00007562058,0.0018370473,0.95342636,0.00019086392],"about_ca_topic_score_codex":0.000023040147,"about_ca_topic_score_gemma":0.0000019330982,"teacher_disagreement_score":0.9783656,"about_ca_system_score_codex":0.000006172037,"about_ca_system_score_gemma":0.000015490232,"threshold_uncertainty_score":0.71979976},"labels":[],"label_agreement":null},{"id":"W2030206951","doi":"10.1016/j.ins.2012.09.011","title":"Computerized facial diagnosis using both color and texture features","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Traditional Chinese Medicine Studies","field":"Medicine","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Hong Kong Polytechnic University","keywords":"Artificial intelligence; Computer science; Pattern recognition (psychology); Computer vision; Face (sociological concept); Feature (linguistics); Texture (cosmology); Image (mathematics)","score_opus":0.05299098114516179,"score_gpt":0.3363821884724308,"score_spread":0.28339120732726897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030206951","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.99210984,0.00038714395,0.00064319634,0.0021210385,0.00037888225,0.0001908333,0.000014161406,0.000041421557,0.0041135056],"genre_scores_gemma":[0.99464625,0.00003230534,0.0032981464,0.0017024989,0.00028647788,0.000010305261,0.000009626957,0.0000014375313,0.000012975553],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99929243,0.000011057943,0.0001555653,0.000053685122,0.00033825025,0.00014898984],"domain_scores_gemma":[0.99966687,0.00008545135,0.00006867731,0.000041640218,0.000050703904,0.00008666479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002609097,0.000075305856,0.00013558382,0.00012897496,0.00025651202,0.000043680146,0.000044608787,0.000027605964,0.000031006824],"category_scores_gemma":[0.0001561592,0.000048037487,0.000021091255,0.00022903999,0.0002959089,0.0011315626,0.000030331414,0.00006415008,0.00001084019],"study_design_candidate":"observational","study_design_consensus":"observational","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.00011396634,0.00011060629,0.88284314,0.00022468643,0.000074892254,0.0000025209786,0.021673236,0.00010126373,0.0008366607,0.006363071,0.023419049,0.06423689],"study_design_scores_gemma":[0.0006239628,0.000112540794,0.97207874,0.00005301637,0.000025136684,0.0001286141,0.0009266022,0.0013695068,0.00012776688,0.00007665472,0.02439805,0.000079436824],"about_ca_topic_score_codex":0.00003227531,"about_ca_topic_score_gemma":0.000002506636,"teacher_disagreement_score":0.08923555,"about_ca_system_score_codex":0.00001986732,"about_ca_system_score_gemma":0.000042688258,"threshold_uncertainty_score":0.19729091},"labels":[],"label_agreement":null},{"id":"W2031979200","doi":"10.1016/j.ins.2013.06.019","title":"Weighting tags and paths in XML documents according to their topic generalization","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Data Management and Algorithms","field":"Computer Science","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":"Université de Montréal","funders":"","keywords":"Weighting; Computer science; Generalization; Information retrieval; XML; Data mining; Document Structure Description; Database; Mathematics; World Wide Web","score_opus":0.014341667468508033,"score_gpt":0.24544668063568473,"score_spread":0.2311050131671767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031979200","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.6497818,0.000014750582,0.33528534,0.0017294328,0.00035057662,0.00030728543,0.0000010238118,0.00006720013,0.0124625815],"genre_scores_gemma":[0.9781753,0.000013228883,0.02049858,0.0012046046,0.000019744137,0.0000219111,0.0000037252867,7.654081e-7,0.00006214893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993362,0.000014103349,0.00019248486,0.00011200093,0.00019636632,0.00014886084],"domain_scores_gemma":[0.99973476,0.000019171832,0.000065001295,0.00011087512,0.000033128003,0.000037058002],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040495204,0.000055003475,0.000051496605,0.00024697726,0.00014153593,0.0012812862,0.00046709183,0.000012539729,0.0000097383445],"category_scores_gemma":[0.000031860418,0.00004147372,0.0000070338497,0.00064351544,0.0000211354,0.012093745,0.00029498234,0.000023549954,0.00011050896],"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":[2.3304483e-7,0.000005543224,0.020482616,0.000010111207,0.0000015081788,2.1780563e-7,0.0033455545,0.00046412184,0.00014081456,0.032394685,0.0005999449,0.94255465],"study_design_scores_gemma":[0.00031014252,0.00006727011,0.06068147,0.00005028549,9.62394e-7,0.0000025009272,0.002620307,0.9022223,0.0009725997,0.010281371,0.022505281,0.000285564],"about_ca_topic_score_codex":0.00016991558,"about_ca_topic_score_gemma":0.000007699987,"teacher_disagreement_score":0.9422691,"about_ca_system_score_codex":0.000014277684,"about_ca_system_score_gemma":0.0000119900915,"threshold_uncertainty_score":0.9997555},"labels":[],"label_agreement":null},{"id":"W2032084149","doi":"10.1016/j.ins.2013.11.004","title":"Relative entropy fuzzy c-means clustering","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Fuzzy clustering; Pattern recognition (psychology); Artificial intelligence; Fuzzy logic; Data mining; Entropy (arrow of time); Computer science; FLAME clustering; Mathematics; Machine learning; CURE data clustering algorithm","score_opus":0.02682990070830507,"score_gpt":0.30065639858746507,"score_spread":0.27382649787916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032084149","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.00329873,0.000012271799,0.9607177,0.001863375,0.00027653298,0.0002191789,9.509018e-7,0.00018711113,0.033424195],"genre_scores_gemma":[0.5765584,0.000015668582,0.42198628,0.0007807184,0.000053618918,0.000080699705,0.0000019993731,0.000003796888,0.0005188165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984282,0.000038612867,0.00029179096,0.00017374825,0.0006980307,0.00036960642],"domain_scores_gemma":[0.99916506,0.00012501953,0.00012165505,0.0002775748,0.00020328326,0.000107379696],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004729774,0.00009658231,0.000088252906,0.0002587706,0.00039392416,0.00092788134,0.0011891528,0.000034509103,0.000057935104],"category_scores_gemma":[0.00016927287,0.00007789387,0.00003157453,0.00089095935,0.00019393914,0.017643422,0.00047389086,0.00012799403,0.0019892405],"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.000003077483,0.000024475454,0.00052277325,0.000033024317,0.000014432843,0.0000024176006,0.011845933,0.049840324,0.0007568835,0.12940079,0.001912986,0.8056429],"study_design_scores_gemma":[0.00015315622,0.000076133234,0.0020281193,0.000014509357,4.4528002e-7,0.000016064694,0.000420535,0.9758576,0.0004115299,0.014256454,0.006621932,0.00014350878],"about_ca_topic_score_codex":0.000099121,"about_ca_topic_score_gemma":0.0000033738709,"teacher_disagreement_score":0.9260173,"about_ca_system_score_codex":0.00006863215,"about_ca_system_score_gemma":0.00008250203,"threshold_uncertainty_score":0.9987878},"labels":[],"label_agreement":null},{"id":"W2032109608","doi":"10.1016/j.ins.2011.07.046","title":"A non-functional requirements tradeoff model in Trustworthy Software","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Software Engineering Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; Credibility; Fuzzy logic; Data mining; Interdependence; Hierarchy; Software; Sorting; Trustworthiness; Fuzzy set; Operations research; Artificial intelligence; Algorithm; Mathematics; Computer security; Programming language","score_opus":0.09620977499676785,"score_gpt":0.2865736167490604,"score_spread":0.19036384175229254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032109608","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.10249068,0.000007709086,0.8938436,0.00008992591,0.00025584165,0.00012535024,0.0000010941811,0.00015879054,0.0030270212],"genre_scores_gemma":[0.91615486,0.0000025326,0.08356632,0.00019383093,0.000010262857,0.00003122775,0.0000016252285,0.0000018542817,0.000037492035],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985151,0.000010041816,0.0002858751,0.00016041857,0.00073239,0.0002961344],"domain_scores_gemma":[0.9994997,0.000082766775,0.00006315935,0.00022307804,0.00005882928,0.00007246097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086742063,0.00008462196,0.00007800976,0.00048262064,0.00012558264,0.00016801814,0.0008819072,0.000039906095,0.000026442976],"category_scores_gemma":[0.00026420676,0.000074918404,0.000027940861,0.0011290842,0.00010225446,0.006043321,0.0001425998,0.000107848544,0.00015151691],"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.00004131456,0.00023622952,0.43900153,0.000093125134,0.000023617848,0.000014050908,0.048047625,0.23199454,0.00010944167,0.04254098,0.0061172144,0.23178034],"study_design_scores_gemma":[0.00024981724,0.00005183946,0.16928251,0.00001739975,4.859138e-7,0.000006577404,0.00006812683,0.8266759,0.00030429513,0.0029664668,0.00023920982,0.0001373902],"about_ca_topic_score_codex":0.00005304347,"about_ca_topic_score_gemma":0.0000057153184,"teacher_disagreement_score":0.8136642,"about_ca_system_score_codex":0.000058662874,"about_ca_system_score_gemma":0.00022537509,"threshold_uncertainty_score":0.43812618},"labels":[],"label_agreement":null},{"id":"W2033097986","doi":"10.1016/j.ins.2014.02.018","title":"Analysis and extension of multiresolution singular value decomposition","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extension (predicate logic); Singular value decomposition; Decomposition; Multiresolution analysis; Value (mathematics); Mathematics; Singular spectrum analysis; Pure mathematics; Computer science; Statistics; Algorithm; Artificial intelligence; Wavelet","score_opus":0.01782861362058961,"score_gpt":0.3102062427374182,"score_spread":0.2923776291168286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033097986","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.1315692,0.000018513112,0.8670142,0.00013418161,0.00006936737,0.00003339099,3.289204e-7,0.000027036875,0.0011337482],"genre_scores_gemma":[0.7786708,0.0000035061303,0.22113518,0.0001790868,0.000005958579,5.9273293e-7,0.0000016606396,3.813775e-7,0.0000028272584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915034,0.00010923082,0.0002385626,0.000106844825,0.00030150844,0.00009350155],"domain_scores_gemma":[0.99940836,0.0001237414,0.00015995158,0.00015196668,0.00012469043,0.000031274147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018157042,0.000048505946,0.0001046855,0.0004110634,0.0001972867,0.00018814957,0.00022329982,0.000024792862,0.0000017997164],"category_scores_gemma":[0.0001605345,0.00003936395,0.000037497302,0.0010419936,0.00011485079,0.002416925,0.00006553314,0.000026897787,0.0000054852317],"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.000009952763,0.000022566901,0.0031336707,0.000021932106,0.000026315576,2.8446655e-7,0.0027571802,0.016025338,0.018100021,0.06253254,0.00004244153,0.8973278],"study_design_scores_gemma":[0.00012735181,0.00005805119,0.047320902,0.0000090193735,0.000016136495,0.0000033476304,0.00001886618,0.93837106,0.010990135,0.0028048048,0.00022407091,0.000056224002],"about_ca_topic_score_codex":0.0000989486,"about_ca_topic_score_gemma":0.0000015358506,"teacher_disagreement_score":0.92234576,"about_ca_system_score_codex":0.000007892832,"about_ca_system_score_gemma":0.00001774197,"threshold_uncertainty_score":0.18143307},"labels":[],"label_agreement":null},{"id":"W2034720960","doi":"10.1016/j.ins.2010.07.029","title":"Secret sharing schemes from binary linear codes","year":2010,"lang":"en","type":"article","venue":"Information Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Alberta","keywords":"Secret sharing; Access structure; Computer science; Construct (python library); Theoretical computer science; Scheme (mathematics); Binary number; Code (set theory); Linear code; Homomorphic secret sharing; Set (abstract data type); Verifiable secret sharing; Mathematics; Algorithm; Block code; Cryptography; Decoding methods; Arithmetic; Computer network","score_opus":0.020688336336760427,"score_gpt":0.2764213697364868,"score_spread":0.25573303339972636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034720960","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.7272694,0.000022875096,0.26479742,0.0004974632,0.00072972075,0.00007050935,0.00003870373,0.00021292474,0.006360968],"genre_scores_gemma":[0.8857685,0.000007850748,0.11363017,0.00049884705,0.000059309787,0.0000044517083,0.000028182514,8.441471e-7,0.0000018613268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990618,0.000008725015,0.00021952191,0.00016784742,0.00036963765,0.00017246258],"domain_scores_gemma":[0.99931526,0.00007434468,0.00010616282,0.00036158122,0.0000698631,0.00007279843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005622792,0.00007612912,0.00007259646,0.00018372119,0.00036121352,0.00068649556,0.001427226,0.00004767665,0.00008350731],"category_scores_gemma":[0.00009356567,0.000061903236,0.00003628894,0.0007257088,0.00020163014,0.00853361,0.00036281688,0.00015039089,0.00017841296],"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.0000046023015,0.000032839667,0.022680368,0.000011734803,0.00000855174,0.0000014138155,0.005412986,0.00010802547,0.003695873,0.92011607,0.0016647049,0.04626284],"study_design_scores_gemma":[0.0003236251,0.0000835237,0.029139819,0.00002448428,0.0000036003637,0.000010053501,0.00059234374,0.6837985,0.010502272,0.06276425,0.21234086,0.0004166811],"about_ca_topic_score_codex":0.0001752767,"about_ca_topic_score_gemma":0.000043030785,"teacher_disagreement_score":0.8573518,"about_ca_system_score_codex":0.0000033545634,"about_ca_system_score_gemma":0.000060538176,"threshold_uncertainty_score":0.6619893},"labels":[],"label_agreement":null},{"id":"W2035165861","doi":"10.1016/j.ins.2007.03.028","title":"Rough set based 1-v-1 and 1-v-r approaches to support vector machine multi-classification","year":2007,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Saint Mary's University","funders":"","keywords":"Support vector machine; Rough set; Binary number; Computer science; Binary classification; Pattern recognition (psychology); Decision boundary; Artificial intelligence; Set (abstract data type); Boundary (topology); Data mining; Process (computing); Mathematics; Machine learning","score_opus":0.2639655230970706,"score_gpt":0.3137752546615146,"score_spread":0.049809731564444015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035165861","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.015686277,0.000013436208,0.970141,0.0029669155,0.00021057278,0.0002310894,0.000007883014,0.00011454473,0.0106282635],"genre_scores_gemma":[0.84894365,0.0000015793418,0.14943035,0.0015710072,0.000016822538,0.000008793575,0.000009966712,0.0000012879285,0.000016561875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998825,0.000020084608,0.00031250398,0.00019649281,0.0003941661,0.00025176242],"domain_scores_gemma":[0.99940294,0.00007624358,0.00012419635,0.0002207834,0.000047346668,0.00012851338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016673434,0.000098776225,0.000088876,0.00025282733,0.00028476043,0.0005164402,0.0005824196,0.000041519186,0.0000106667],"category_scores_gemma":[0.000072809504,0.000074494725,0.000021728682,0.00079088175,0.00010627107,0.0027267854,0.00010491717,0.000057741727,0.00012092734],"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.000017627399,0.00008075654,0.01157021,0.00003989096,0.000005953191,0.000002424934,0.010423781,0.002897695,0.00015125843,0.09063703,0.0016961144,0.8824773],"study_design_scores_gemma":[0.00028040446,0.00019108699,0.13308817,0.0000056893555,0.0000016402258,0.000009940961,0.00032454342,0.8468586,0.0004069016,0.00023873083,0.018407281,0.0001869894],"about_ca_topic_score_codex":0.000051667106,"about_ca_topic_score_gemma":0.000030143476,"teacher_disagreement_score":0.8822903,"about_ca_system_score_codex":0.00002652765,"about_ca_system_score_gemma":0.00007544322,"threshold_uncertainty_score":0.49800447},"labels":[],"label_agreement":null},{"id":"W2037019767","doi":"10.1016/j.ins.2004.08.012","title":"Early estimation of software size in object-oriented environments a case study in a CMM level 3 software firm","year":2005,"lang":"en","type":"article","venue":"Information Sciences","topic":"Software Engineering Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"European Commission; University of Calgary","keywords":"Computer science; Software; Software sizing; Scope (computer science); Software metric; Software measurement; Software development; Verification and validation; Software engineering; Software quality; Software construction; Statistics; Programming language; Mathematics","score_opus":0.030821818046954802,"score_gpt":0.29896613642638853,"score_spread":0.26814431837943375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037019767","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.7203782,0.000011709126,0.2790737,0.000042235955,0.000067759145,0.00034515184,0.0000041876006,0.00006248505,0.000014584576],"genre_scores_gemma":[0.91891015,0.0000013422539,0.080976516,0.000033371565,0.0000061795668,0.000053100863,0.0000012321168,0.0000028436311,0.000015253697],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978615,0.00006097162,0.0006005187,0.00022371938,0.000933721,0.00031954795],"domain_scores_gemma":[0.99858946,0.0008137259,0.0001550612,0.00032419612,0.00005021765,0.00006735411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013486581,0.0001268354,0.00016210802,0.00067656,0.000091335234,0.00015688734,0.00068675564,0.00005135232,0.000012422993],"category_scores_gemma":[0.0024274406,0.000120380784,0.000026591822,0.0018614529,0.00010280801,0.005112349,0.00023906655,0.00015820711,0.000055926997],"study_design_candidate":"observational","study_design_consensus":"observational","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.000009239305,0.00027361562,0.56543195,0.000033485438,0.0000058349397,0.00006635729,0.043224998,0.2170912,0.000017944032,0.00007516731,0.000030976054,0.17373925],"study_design_scores_gemma":[0.0009853282,0.00026113587,0.8052882,0.000051041683,0.0000013560391,0.000088370485,0.0014129903,0.19131397,0.00024988543,0.000061885745,0.0000926857,0.00019315194],"about_ca_topic_score_codex":0.0009788786,"about_ca_topic_score_gemma":0.00023069567,"teacher_disagreement_score":0.23985627,"about_ca_system_score_codex":0.00017770387,"about_ca_system_score_gemma":0.0001560226,"threshold_uncertainty_score":0.49089858},"labels":[],"label_agreement":null},{"id":"W2038636021","doi":"10.1016/j.ins.2011.03.016","title":"Enhancing particle swarm optimization using generalized opposition-based learning","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":473,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"National Natural Science Foundation of China","keywords":"Premature convergence; Initialization; Mathematical optimization; Particle swarm optimization; Local optimum; Differential evolution; Population; Benchmark (surveying); Computer science; Mathematics; Ode; Applied mathematics","score_opus":0.09140839569055396,"score_gpt":0.3139838274931784,"score_spread":0.2225754318026244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038636021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011795866,0.0000114378645,0.98496675,0.0001229782,0.0001986828,0.00016124077,8.113616e-7,0.00018066964,0.0025615839],"genre_scores_gemma":[0.31520993,0.000004360618,0.68445617,0.00027448317,0.000014655904,0.000011241717,0.000004449647,0.0000027373492,0.000021997275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818426,0.00014556327,0.0004511293,0.00019137471,0.0007186899,0.00030899205],"domain_scores_gemma":[0.9989846,0.000080817874,0.0002353957,0.00021271427,0.00036534862,0.00012117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014190401,0.000103599305,0.00010908474,0.00029852032,0.00064082805,0.0006046342,0.0006595627,0.000041628762,0.00024176546],"category_scores_gemma":[0.00033867083,0.00009428874,0.00003782104,0.0014162612,0.00012824392,0.004662014,0.00011288623,0.00009537584,0.00010107082],"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.0000026973185,0.000015219032,0.00034738274,0.00000668522,0.000002709153,6.754019e-7,0.0014069258,0.9905499,0.00025887237,0.0045681256,0.000010444914,0.0028303552],"study_design_scores_gemma":[0.00023959363,0.000054871165,0.00009953142,0.000011672792,0.0000026602659,0.0000046824225,0.00012666406,0.97181934,0.027260719,0.00012862106,0.00012797472,0.00012365203],"about_ca_topic_score_codex":0.00010720542,"about_ca_topic_score_gemma":0.000001741456,"teacher_disagreement_score":0.30341405,"about_ca_system_score_codex":0.000054765012,"about_ca_system_score_gemma":0.00029711492,"threshold_uncertainty_score":0.58305013},"labels":[],"label_agreement":null},{"id":"W2039311731","doi":"10.1016/j.ins.2011.11.027","title":"Fuzzy logic-based generalized decision theory with imperfect information","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Vagueness; Expected utility hypothesis; Computer science; Optimal decision; Decision theory; Decision field theory; Perfect information; Decision analysis; Fuzzy logic; Imperfect; Decision rule; Von Neumann–Morgenstern utility theorem; Causal decision theory; Decision model; Evidential decision theory; Evidential reasoning approach; Decision tree; Business decision mapping; Artificial intelligence; Decision support system; Mathematical economics; Machine learning; Mathematics","score_opus":0.18508030816902768,"score_gpt":0.3921880118241548,"score_spread":0.20710770365512712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039311731","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.2788825,0.00003226086,0.6209614,0.0002037636,0.0008776402,0.00055825536,0.000031318305,0.00019912675,0.09825368],"genre_scores_gemma":[0.8979863,0.000004815536,0.098741114,0.0031288378,0.00003413063,0.00003795682,0.000012467169,0.000005709952,0.00004867494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992959,0.00034970083,0.0017860956,0.00036297235,0.004036008,0.00050620903],"domain_scores_gemma":[0.99467236,0.0018782297,0.0011228091,0.0008536187,0.0012586853,0.0002142842],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication","insufficient_payload"],"category_scores_codex":[0.012995761,0.0003012694,0.00037520603,0.0018196692,0.00080606557,0.0020248506,0.0020421802,0.00014029045,0.0020445462],"category_scores_gemma":[0.0060803713,0.00017310976,0.00014561012,0.0029554977,0.00060015335,0.01620808,0.00022135649,0.00017117926,0.0035907973],"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.0010761637,0.00006281297,0.007088547,0.000010662024,0.00001434184,0.000004352527,0.009092631,0.007992897,0.00012841352,0.10240174,0.005292309,0.8668351],"study_design_scores_gemma":[0.0065625682,0.00172085,0.09137491,0.00022282475,0.000047500864,0.00014627844,0.014071837,0.15056849,0.006062174,0.60006684,0.12726593,0.0018897933],"about_ca_topic_score_codex":0.000070188915,"about_ca_topic_score_gemma":0.000021275637,"teacher_disagreement_score":0.86494535,"about_ca_system_score_codex":0.00006799963,"about_ca_system_score_gemma":0.00036703082,"threshold_uncertainty_score":0.99901116},"labels":[],"label_agreement":null},{"id":"W2041414778","doi":"10.1016/j.ins.2010.05.010","title":"Covariance intersection based image fusion technique with application to pansharpening in remote sensing","year":2010,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Panchromatic film; Covariance intersection; Image fusion; Covariance; Artificial intelligence; Computer science; Computer vision; Image resolution; Covariance matrix; Pattern recognition (psychology); Multispectral image; Image (mathematics); Mathematics; Algorithm; Estimation of covariance matrices; Statistics","score_opus":0.005212414928674454,"score_gpt":0.2487673175382839,"score_spread":0.24355490260960946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041414778","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.032958284,0.0000015571702,0.96349263,0.00007375683,0.00010412271,0.00047573217,0.0000019888457,0.00050648116,0.0023854324],"genre_scores_gemma":[0.53708506,0.0000010034692,0.46281186,0.0000683003,0.000011207615,0.000012081009,0.0000048145753,0.0000044707826,0.0000012028322],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926364,0.00000942366,0.00024852637,0.00011221735,0.0002104957,0.00015570025],"domain_scores_gemma":[0.9996054,0.00003192285,0.000067286936,0.00015967211,0.000094770185,0.000040912713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005029412,0.00009668358,0.00007965496,0.0004317614,0.00010437214,0.0001088042,0.0001533075,0.000046125235,0.000011172357],"category_scores_gemma":[0.00007280711,0.00008637903,0.000011514024,0.0009497407,0.00006678073,0.0018753432,0.000024892946,0.00021709561,0.00003228734],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105564295,0.0000019711229,0.000042780008,0.000029384699,3.5222763e-7,5.2527184e-7,0.00034012232,0.01349912,0.61983854,0.00006857694,0.00004882101,0.36611927],"study_design_scores_gemma":[0.00009340672,0.000031610638,0.0004158992,0.00010811253,7.8420675e-7,0.000014909517,0.000111802176,0.60793155,0.3869152,0.0003280374,0.0039033182,0.00014534287],"about_ca_topic_score_codex":0.000072807125,"about_ca_topic_score_gemma":0.000101558544,"teacher_disagreement_score":0.5944325,"about_ca_system_score_codex":0.000058003083,"about_ca_system_score_gemma":0.000030322983,"threshold_uncertainty_score":0.35224342},"labels":[],"label_agreement":null},{"id":"W2041621149","doi":"10.1016/j.ins.2013.04.004","title":"Generalized fuzzy linear programming for decision making under uncertainty: Feasibility of fuzzy solutions and solving approach","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Water resources management and optimization","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematical optimization; Mathematics; Fuzzy logic; Fuzzy number; Membership function; Fuzzy set operations; Robustness (evolution); Linear programming; Defuzzification; Discretization; Fuzzy classification; Interval (graph theory); Fuzzy set; Computer science; Algorithm; Artificial intelligence","score_opus":0.05117451207945224,"score_gpt":0.2797867604101935,"score_spread":0.22861224833074129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041621149","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.29227284,0.000054174794,0.7040528,0.000042213862,0.00008393135,0.0006540302,0.000002957637,0.00010011085,0.0027369696],"genre_scores_gemma":[0.8456138,0.000009762373,0.15425947,0.000027304683,0.000016846576,0.000049464717,0.0000127229405,0.0000032024275,0.0000074128016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922496,0.000009977884,0.00030414798,0.000085435335,0.00019038278,0.00018509504],"domain_scores_gemma":[0.9996485,0.0000634863,0.00008164061,0.00008536345,0.00009343503,0.000027557242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004977263,0.00007851987,0.000096149895,0.00017292004,0.00022157487,0.00022007128,0.00012375072,0.000036184978,0.0000071599516],"category_scores_gemma":[0.000067776775,0.00006421503,0.00003020976,0.000289419,0.00009327786,0.001609372,0.000049752278,0.00003230288,0.0000036347683],"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.0000034895388,0.0000057341185,0.0006006032,0.000086238084,0.0000058830265,4.2075903e-9,0.0008593901,0.9554251,0.00003474402,0.002040034,0.0001414247,0.040797386],"study_design_scores_gemma":[0.00019241031,0.00002150794,0.0013145959,0.000029882687,0.00000673041,5.005996e-7,0.0009385368,0.9944332,0.000022428796,0.0024609952,0.0004923896,0.00008681663],"about_ca_topic_score_codex":0.000030171923,"about_ca_topic_score_gemma":0.0000068230192,"teacher_disagreement_score":0.553341,"about_ca_system_score_codex":0.000027494149,"about_ca_system_score_gemma":0.00000911644,"threshold_uncertainty_score":0.2618613},"labels":[],"label_agreement":null},{"id":"W2042481350","doi":"10.1016/j.ins.2011.02.009","title":"New complexity results for the k-covers problem","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Vertex cover; Cover (algebra); Bounded function; Cardinality (data modeling); Combinatorics; Mathematics; Reduction (mathematics); Vertex (graph theory); Parameterized complexity; Time complexity; String (physics); Discrete mathematics; Set (abstract data type); Set cover problem; NP-complete; Graph; Computer science","score_opus":0.1345540655591279,"score_gpt":0.2963074091520994,"score_spread":0.1617533435929715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042481350","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077238525,0.00001313157,0.9658853,0.0010988099,0.0003294279,0.00021785726,0.00001588585,0.00006757507,0.03229476],"genre_scores_gemma":[0.07438604,0.00001084509,0.92426896,0.0010786379,0.000064112995,0.00002082503,0.000009546287,0.0000012526801,0.00015976619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991961,0.000010824312,0.00023044489,0.00011024501,0.00029647487,0.00015589068],"domain_scores_gemma":[0.99934137,0.0001182717,0.00015234818,0.00027200923,0.000066038236,0.000049945884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076258415,0.000057379337,0.000051142528,0.000056297133,0.000512692,0.00035481335,0.0012906379,0.000018856459,0.000013371065],"category_scores_gemma":[0.00005214629,0.000031876938,0.00002944701,0.00029025556,0.000115955285,0.004860484,0.00020340792,0.000037479007,0.00007779713],"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.000024537894,0.000010087955,0.00004647511,0.0000052972728,0.0000049386717,1.0377037e-7,0.0089431945,0.00037244172,0.000009164539,0.4782717,0.08994909,0.42236298],"study_design_scores_gemma":[0.00064897793,0.00016130705,0.006746191,0.000016002088,0.000003192025,0.0000073048964,0.00050614023,0.50243855,0.00078107376,0.06898092,0.41953248,0.00017785895],"about_ca_topic_score_codex":0.0004286213,"about_ca_topic_score_gemma":0.0000132697905,"teacher_disagreement_score":0.50206614,"about_ca_system_score_codex":0.000009391494,"about_ca_system_score_gemma":0.00012726652,"threshold_uncertainty_score":0.3943264},"labels":[],"label_agreement":null},{"id":"W2042822538","doi":"10.1016/s0020-0255(99)00097-3","title":"Risk management in game-tree pruning","year":2000,"lang":"en","type":"article","venue":"Information Sciences","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Computer science; Minimax; Adversary; Game tree; Tree (set theory); Machine learning; Artificial intelligence; Game theory; Theoretical computer science; Mathematical optimization; Sequential game; Mathematics; Mathematical economics; Computer security","score_opus":0.02737789844365746,"score_gpt":0.2962745157962355,"score_spread":0.268896617352578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042822538","genre_codex":"other","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.21656659,0.00004258815,0.29151025,0.00070701295,0.0003064175,0.00027069642,9.89441e-7,0.00021142958,0.49038404],"genre_scores_gemma":[0.96436876,0.00010760717,0.034771476,0.00047053877,0.0000128846605,0.000015589902,4.511344e-7,0.000001101252,0.0002515604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879795,0.000035774865,0.0003499621,0.0001437134,0.00043342492,0.00023914728],"domain_scores_gemma":[0.9995482,0.00005722203,0.00009840701,0.00022637681,0.000030385314,0.000039435206],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008687845,0.00007251385,0.00006627142,0.00028256036,0.00016056448,0.0004642567,0.0010581024,0.000023939047,0.0001384352],"category_scores_gemma":[0.000038585084,0.00006221474,0.000022814274,0.0011473121,0.00013836594,0.005225761,0.00009905657,0.000077172816,0.0013934191],"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.0000010270379,0.0000065274767,0.0016673272,0.0000018251666,0.0000011648772,0.0000010200241,0.0033895283,0.013703443,9.3429736e-7,0.027919272,0.00013472045,0.9531732],"study_design_scores_gemma":[0.00010042977,0.00006111612,0.022187851,0.000031809446,0.0000018002916,0.0000060663397,0.0015395391,0.86211616,0.0007673317,0.03420567,0.078744665,0.00023757965],"about_ca_topic_score_codex":0.00014202559,"about_ca_topic_score_gemma":0.00005186328,"teacher_disagreement_score":0.95293564,"about_ca_system_score_codex":0.000031990738,"about_ca_system_score_gemma":0.00002941457,"threshold_uncertainty_score":0.9993841},"labels":[],"label_agreement":null},{"id":"W2043039095","doi":"10.1016/j.ins.2013.05.032","title":"Fault detection and isolation of a dual spool gas turbine engine using dynamic neural networks and multiple model approach","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":156,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Jet engine; Artificial neural network; Fault detection and isolation; Computer science; Fault (geology); Noise (video); Control theory (sociology); Jet (fluid); Turbine; Isolation (microbiology); Artificial intelligence; Engineering","score_opus":0.010395807558247963,"score_gpt":0.2073026387603611,"score_spread":0.19690683120211314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043039095","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.61411524,0.00005020941,0.3854094,0.0000066699336,0.000079843856,0.00014366527,0.0000012751722,0.000049607606,0.00014404905],"genre_scores_gemma":[0.99882525,0.000010194584,0.0011186841,0.0000130557955,0.000014675212,0.000009786327,0.0000024306398,0.000003053731,0.0000028567538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994283,0.000010381078,0.00025204656,0.00006340251,0.00013422407,0.000111648034],"domain_scores_gemma":[0.9997755,0.000021832622,0.0000688033,0.000048114594,0.000048284262,0.00003744929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017051032,0.000077530014,0.00009486717,0.00015061327,0.00010004689,0.00011471231,0.000035344434,0.000050288083,0.0000018857795],"category_scores_gemma":[0.000021495769,0.0000665432,0.000014507244,0.00021603852,0.000056439887,0.0017283052,0.000011785141,0.00006137329,0.0000010845353],"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.0000026977266,0.0000013662667,0.000109362096,0.000022726525,0.0000028849302,8.883774e-9,0.00032482648,0.9681866,0.0059384867,0.000005494246,0.0000014393611,0.025404098],"study_design_scores_gemma":[0.00024841508,0.000022802853,0.00094407325,0.000006589555,0.000003714714,0.000019461808,0.0004512038,0.9980111,0.00019231974,0.000018843806,0.000007666814,0.0000738006],"about_ca_topic_score_codex":0.0001256227,"about_ca_topic_score_gemma":0.000015867809,"teacher_disagreement_score":0.38470998,"about_ca_system_score_codex":0.00001878745,"about_ca_system_score_gemma":0.000004594854,"threshold_uncertainty_score":0.2713553},"labels":[],"label_agreement":null},{"id":"W2045050140","doi":"10.1016/j.ins.2014.10.042","title":"Metaheuristics in large-scale global continues optimization: A survey","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":470,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Metaheuristic; Computer science; Parallel metaheuristic; Decomposition; Engineering optimization; Search-based software engineering; Scale (ratio); Field (mathematics); Mathematical optimization; Optimization problem; Global optimization; Management science; Industrial engineering; Artificial intelligence; Algorithm; Meta-optimization; Engineering; Mathematics; Software; Software development","score_opus":0.027505616035827466,"score_gpt":0.31277591197388566,"score_spread":0.2852702959380582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045050140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006783865,0.000017731552,0.97165173,0.00048159185,0.00034613503,0.0001684483,0.000021630482,0.00009706669,0.026537297],"genre_scores_gemma":[0.26451012,0.000031115902,0.7342972,0.0009069897,0.00003953809,0.00002425206,0.000043867,0.0000035169771,0.0001433909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744993,0.00036990258,0.000584883,0.00024280208,0.00095884956,0.0003936152],"domain_scores_gemma":[0.9985133,0.0003269617,0.00020798488,0.00035922558,0.00047171928,0.000120830184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005475319,0.00012296031,0.00019628245,0.00029864887,0.00023795737,0.00095192634,0.0013083952,0.000057697125,0.00008106792],"category_scores_gemma":[0.0023049654,0.00010777167,0.00003162055,0.0027952518,0.00016087473,0.0034025428,0.00028305192,0.00009614342,0.00017812697],"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.000008489389,0.00008995253,0.09182621,0.00002216194,0.000007751894,0.0000012514896,0.0016245018,0.80866915,4.6262483e-7,0.0630297,0.0024279323,0.03229241],"study_design_scores_gemma":[0.0003273621,0.000040111827,0.039818816,0.0000066793273,9.558958e-7,0.0000044147077,0.00006669688,0.95414716,0.000008766847,0.0006507827,0.004801141,0.0001271125],"about_ca_topic_score_codex":0.00011316205,"about_ca_topic_score_gemma":0.00012835977,"teacher_disagreement_score":0.26383173,"about_ca_system_score_codex":0.00005422459,"about_ca_system_score_gemma":0.00019383071,"threshold_uncertainty_score":0.9179448},"labels":[],"label_agreement":null},{"id":"W2048476252","doi":"10.1016/j.ins.2011.03.007","title":"Modeling term proximity for probabilistic information retrieval models","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Term (time); Divergence-from-randomness model; Computer science; Probabilistic logic; Term Discrimination; Probabilistic relevance model; Information retrieval; Data mining; Artificial intelligence; Probabilistic analysis of algorithms; Search engine; Concept search","score_opus":0.12864812228287392,"score_gpt":0.2964142241644975,"score_spread":0.16776610188162355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048476252","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.031295158,0.0000040438968,0.9540742,0.00015987946,0.00033582363,0.0009215252,0.000018819394,0.00024126864,0.012949269],"genre_scores_gemma":[0.9307245,0.000005172716,0.06855341,0.00056892564,0.000020453983,0.00007765043,0.000025886295,0.0000021655087,0.000021848355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978327,0.000026070022,0.00077534356,0.00013930911,0.00082057936,0.0004059996],"domain_scores_gemma":[0.99849206,0.000047066264,0.00024287023,0.00030178882,0.0007886574,0.00012756104],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016956996,0.0001508608,0.00014183209,0.00042597172,0.0006014589,0.0007944013,0.0011642654,0.00008551559,0.000017555467],"category_scores_gemma":[0.00027744836,0.00012002724,0.00008251475,0.00087252544,0.00013627791,0.04896191,0.00017710452,0.00011323033,0.00013919818],"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.00010848171,0.00006362472,0.0001282543,0.00018847031,0.00000982233,2.5721155e-7,0.036330666,0.042688627,0.000025116811,0.8350751,0.0002377223,0.08514386],"study_design_scores_gemma":[0.0003143122,0.00016303347,0.00020280367,0.0000141965575,0.0000036921294,0.0000074028285,0.00034647065,0.97160083,0.0004992166,0.026228722,0.00043267192,0.00018662658],"about_ca_topic_score_codex":0.000039850267,"about_ca_topic_score_gemma":0.0000019461372,"teacher_disagreement_score":0.9289122,"about_ca_system_score_codex":0.000070826274,"about_ca_system_score_gemma":0.00034089581,"threshold_uncertainty_score":0.9643398},"labels":[],"label_agreement":null},{"id":"W2050599941","doi":"10.1016/j.ins.2006.03.022","title":"A novel feature selection approach: Combining feature wrappers and filters","year":2006,"lang":"en","type":"article","venue":"Information Sciences","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Simon Fraser University","funders":"","keywords":"Feature selection; Pattern recognition (psychology); Minimum redundancy feature selection; Outlier; Computer science; Feature (linguistics); Artificial intelligence; Data mining; Filter (signal processing); Selection (genetic algorithm); k-nearest neighbors algorithm","score_opus":0.013541329696781826,"score_gpt":0.2091744393424983,"score_spread":0.19563310964571648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050599941","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.013832062,0.00020921892,0.794217,0.003990717,0.00049061456,0.00033974845,0.0000043354457,0.00030913824,0.1866072],"genre_scores_gemma":[0.9635785,0.0000026045252,0.035461914,0.00062723615,0.000050624374,0.000015979924,0.000004944915,0.0000012725027,0.00025688004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999073,0.000020922716,0.00015460838,0.0001674317,0.0003763903,0.00020761894],"domain_scores_gemma":[0.9996136,0.000036262205,0.0001386673,0.00010257767,0.00006572694,0.00004317604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047212373,0.00009948806,0.000103077255,0.0001627829,0.00041416648,0.00075657543,0.0003942558,0.00007035816,6.055977e-7],"category_scores_gemma":[0.000019834353,0.00007420593,0.000029140137,0.0007176689,0.000111186244,0.0032447525,0.00006145822,0.00010137408,0.000010084694],"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.000021055372,0.00009606024,0.008838884,0.000097092925,0.000027454482,0.000001032639,0.0078151785,0.01875028,0.004199222,0.8112729,0.0734899,0.0753909],"study_design_scores_gemma":[0.0013559593,0.00024121041,0.03374702,0.000043719992,0.000007618536,0.00030037964,0.00209905,0.9212534,0.00026400207,0.004046372,0.036113575,0.0005276847],"about_ca_topic_score_codex":0.0001442446,"about_ca_topic_score_gemma":0.000008041128,"teacher_disagreement_score":0.9497465,"about_ca_system_score_codex":0.000022401007,"about_ca_system_score_gemma":0.000054600114,"threshold_uncertainty_score":0.7295674},"labels":[],"label_agreement":null},{"id":"W2051870742","doi":"10.1016/j.ins.2003.07.013","title":"Fuzzy semantics for direction relations between composite regions","year":2003,"lang":"en","type":"article","venue":"Information Sciences","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Relation (database); Fuzzy logic; Semantics (computer science); Spatial relation; Simple (philosophy); Computer science; Cardinal direction; Metric (unit); Artificial intelligence; Theoretical computer science; Mathematics; Algebra over a field; Data mining; Pure mathematics; Programming language; Geography; Engineering; Epistemology","score_opus":0.03183254085158612,"score_gpt":0.2774897033615613,"score_spread":0.24565716250997519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051870742","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.0016202715,0.000008055173,0.9543048,0.0019928326,0.0003897026,0.00021635639,0.0000059835606,0.00016786125,0.041294105],"genre_scores_gemma":[0.8412709,0.0000071350582,0.15821603,0.0002763755,0.00002158612,0.000021743477,0.000014308129,0.0000017793818,0.00017011147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991337,0.000041715968,0.00030163658,0.00012262157,0.00024615292,0.0001541479],"domain_scores_gemma":[0.99925613,0.00018704702,0.00017624689,0.00014818984,0.00017483502,0.000057542555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058893656,0.00007319115,0.00007774358,0.00026587353,0.000736627,0.00039804805,0.00022288885,0.00004560766,0.000010658943],"category_scores_gemma":[0.00019112322,0.000068606496,0.000046242392,0.00081991183,0.00009571946,0.0037976955,0.00002057411,0.000053042295,0.00007504566],"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":[7.733659e-7,0.000008307123,0.012910575,0.0000069315865,0.0000068614227,4.4463963e-8,0.0009811552,0.009224592,0.000028686938,0.94665104,0.0018778959,0.028303126],"study_design_scores_gemma":[0.0014772955,0.00025902494,0.12823635,0.00007136019,0.000042454016,0.00006056171,0.0010833615,0.35988754,0.00245413,0.13891612,0.3665888,0.00092299154],"about_ca_topic_score_codex":0.000008113388,"about_ca_topic_score_gemma":0.000007631203,"teacher_disagreement_score":0.83965063,"about_ca_system_score_codex":0.000037047204,"about_ca_system_score_gemma":0.00011423299,"threshold_uncertainty_score":0.56656134},"labels":[],"label_agreement":null},{"id":"W2055266411","doi":"10.1016/j.ins.2012.02.065","title":"Covering based rough set approximations","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":490,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rough set; Mathematics; Approximations of π; Equivalence (formal languages); Universe; Power set; Element (criminal law); Equivalence relation; Set (abstract data type); Granular computing; Algebra over a field; Discrete mathematics; Computer science; Applied mathematics; Pure mathematics; Artificial intelligence","score_opus":0.05776100210896241,"score_gpt":0.28555324105273994,"score_spread":0.22779223894377754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055266411","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.0057040905,0.000024694127,0.90776694,0.0010756247,0.00046194813,0.00009721019,0.000003618892,0.00014577692,0.0847201],"genre_scores_gemma":[0.8966519,0.0000017923222,0.10183517,0.0014494186,0.000035015313,0.000011480769,0.0000044391986,7.603258e-7,0.000009975027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990751,0.000020190833,0.00020340242,0.00007241518,0.0003711539,0.00025773433],"domain_scores_gemma":[0.9995294,0.00005997518,0.000104533494,0.00018881541,0.00004419338,0.00007305095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074267277,0.00006494128,0.00005885098,0.00013255217,0.00034921724,0.00048636406,0.00059882767,0.000025642665,0.000026295786],"category_scores_gemma":[0.00006090176,0.00004913099,0.000027722223,0.00068966916,0.000073585725,0.009912343,0.000089412206,0.00004455006,0.0003591487],"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.0000026519874,0.000091434835,0.010485357,0.000043901488,0.0000073175206,3.75088e-7,0.015076213,0.036244746,0.00004208349,0.73683083,0.0099241715,0.19125094],"study_design_scores_gemma":[0.0001565588,0.000037994643,0.010124925,0.0000084389,0.0000015122254,0.00000834219,0.00026014433,0.8958932,0.00030815598,0.001980465,0.09103899,0.0001812502],"about_ca_topic_score_codex":0.000018381254,"about_ca_topic_score_gemma":6.614507e-7,"teacher_disagreement_score":0.8909479,"about_ca_system_score_codex":0.000020987187,"about_ca_system_score_gemma":0.00006501972,"threshold_uncertainty_score":0.7186209},"labels":[],"label_agreement":null},{"id":"W2055862451","doi":"10.1016/j.ins.2007.12.002","title":"WG: A family of stream ciphers with designed randomness properties","year":2007,"lang":"en","type":"article","venue":"Information Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Correlation attack; Keystream; Randomness; Stream cipher attack; Computer science; Ideal (ethics); Cryptography; Randomness tests; Block cipher mode of operation; Theoretical computer science; Differential cryptanalysis; Algorithm; Mathematics; Statistics; Computer security","score_opus":0.02459415622454515,"score_gpt":0.23235201959109733,"score_spread":0.2077578633665522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055862451","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.41810653,0.000023936724,0.5658869,0.000052462725,0.000072297786,0.00010122288,3.3406928e-7,0.000058996666,0.015697325],"genre_scores_gemma":[0.9879378,0.0000022774718,0.011870894,0.00016959287,0.0000059415065,0.0000046437913,2.3404128e-7,7.855745e-7,0.000007799905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990455,0.00002663886,0.00025133722,0.00008781797,0.00041793592,0.00017078682],"domain_scores_gemma":[0.99941903,0.00008756562,0.00015780573,0.00015960737,0.00013455648,0.000041422078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016686744,0.000069362184,0.00009258319,0.00024657365,0.00019003743,0.00017427777,0.0006268153,0.000020683992,0.000003901173],"category_scores_gemma":[0.000034980898,0.000043076732,0.000030862175,0.001143864,0.00033928608,0.003020319,0.000048061804,0.000033347576,0.00000828921],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006299493,0.00009857453,0.005606299,0.000095968564,0.00003914926,0.0000025510037,0.03625686,0.0034360883,0.008122935,0.4802784,0.00020344635,0.46522978],"study_design_scores_gemma":[0.017831717,0.008116483,0.11228478,0.0012745354,0.000084770174,0.0001756992,0.09315822,0.10130421,0.5909791,0.05104326,0.020334763,0.0034124544],"about_ca_topic_score_codex":0.000024981251,"about_ca_topic_score_gemma":0.000006709533,"teacher_disagreement_score":0.5828562,"about_ca_system_score_codex":0.000006934892,"about_ca_system_score_gemma":0.00009103624,"threshold_uncertainty_score":0.21896584},"labels":[],"label_agreement":null},{"id":"W2056678525","doi":"10.1016/j.ins.2006.09.016","title":"Exchange strategies for multiple Ant Colony System","year":2006,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ant colony optimization algorithms; Travelling salesman problem; Computer science; Weighting; Ant colony; Scheme (mathematics); Local search (optimization); Metaheuristic; Mathematical optimization; Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.03510963660855574,"score_gpt":0.2952731545360752,"score_spread":0.26016351792751946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056678525","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.0009846078,0.000030491772,0.9768523,0.00036835572,0.00037587935,0.0004028135,0.000015107016,0.00018573679,0.020784738],"genre_scores_gemma":[0.6845203,0.0000042723527,0.31481302,0.00014775392,0.00008863077,0.00014670701,0.000016023603,0.0000026865087,0.0002606007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985726,0.000038932692,0.00035202573,0.00015061362,0.0006143715,0.00027149628],"domain_scores_gemma":[0.9989898,0.0002458442,0.0001639905,0.00020163633,0.0003480836,0.000050626644],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012005682,0.0000812619,0.0001022515,0.00028139664,0.00042036388,0.0013486805,0.00082574144,0.00003476409,0.00001261279],"category_scores_gemma":[0.00014040877,0.00006530309,0.00003327431,0.0007919882,0.00012628282,0.0046743695,0.00010425605,0.00003799005,0.000102068174],"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.000008179451,0.00003833132,0.00035291308,0.00024621215,0.0000063877796,0.0000015261683,0.0018948024,0.06508563,0.00008398008,0.87959975,0.017808262,0.03487401],"study_design_scores_gemma":[0.0002517947,0.000058653568,0.00042403516,0.000009040162,9.093378e-7,0.000006572578,0.0007859551,0.9729049,0.00021437957,0.0010054365,0.024247125,0.000091175934],"about_ca_topic_score_codex":0.00017318006,"about_ca_topic_score_gemma":0.000019616149,"teacher_disagreement_score":0.9078193,"about_ca_system_score_codex":0.000051651463,"about_ca_system_score_gemma":0.00026524425,"threshold_uncertainty_score":0.999688},"labels":[],"label_agreement":null},{"id":"W2058700064","doi":"10.1016/j.ins.2014.03.100","title":"New stability and tracking criteria for a class of bilateral teleoperation systems","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Teleoperation and Haptic Systems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Teleoperation; Control theory (sociology); Stability (learning theory); Electrical impedance; Position (finance); Computer science; Impedance control; Reflection (computer programming); Haptic technology; Simulation; Robot; Engineering; Control (management); Artificial intelligence","score_opus":0.038464771767816736,"score_gpt":0.27200000075786607,"score_spread":0.23353522899004933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058700064","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.60191715,0.000036460508,0.3927839,0.00007382875,0.0006460719,0.00031153296,0.00000860052,0.00008732588,0.004135088],"genre_scores_gemma":[0.99827087,0.0000022990987,0.0016223986,0.000023115495,0.000054490465,0.000011789128,0.0000041014573,0.0000017499009,0.000009200125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994112,0.000015086616,0.00031841392,0.000048680977,0.00012559714,0.00008097406],"domain_scores_gemma":[0.9997271,0.00005323615,0.00004647166,0.000058962083,0.00007933292,0.000034939378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000621115,0.000051887404,0.000096248914,0.00007725819,0.000073389536,0.0002541539,0.000059700906,0.000030280235,0.000016139642],"category_scores_gemma":[0.00006746951,0.00004175541,0.000013475076,0.000101012985,0.000033154683,0.0013358337,0.000004800316,0.000017724533,0.000003965305],"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.000060439375,0.00003255762,0.021452673,0.0037696245,0.00006564267,8.25456e-8,0.07655752,0.186886,0.10587826,0.1946476,0.009295518,0.4013541],"study_design_scores_gemma":[0.00022484818,0.00005793766,0.0026889008,0.000026028363,0.0000023691384,0.0000032999635,0.00083281053,0.98070925,0.0045893267,0.00006013172,0.010729069,0.000076038574],"about_ca_topic_score_codex":0.000055041754,"about_ca_topic_score_gemma":0.000016767186,"teacher_disagreement_score":0.79382324,"about_ca_system_score_codex":0.00001168116,"about_ca_system_score_gemma":0.00002172636,"threshold_uncertainty_score":0.2450812},"labels":[],"label_agreement":null},{"id":"W2062355752","doi":"10.1016/j.ins.2012.10.012","title":"Diversity enhanced particle swarm optimization with neighborhood search","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":402,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"Nanchang Institute of Technology; Education Department of Jiangxi Province; National Natural Science Foundation of China","keywords":"Benchmark (surveying); Particle swarm optimization; Premature convergence; Convergence (economics); Mathematical optimization; Computer science; Set (abstract data type); Diversity (politics); Multi-swarm optimization; Metaheuristic; Local search (optimization); Swarm behaviour; Artificial intelligence; Mathematics; Geography","score_opus":0.040763551329150466,"score_gpt":0.2876941417484873,"score_spread":0.24693059041933682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062355752","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.01907903,0.000015511721,0.96931833,0.0005310204,0.00017305385,0.00018773797,0.0000014373076,0.000122026475,0.010571876],"genre_scores_gemma":[0.8576575,0.000011676832,0.142005,0.00023776258,0.000028489498,0.000008775567,0.0000027355038,0.0000017309615,0.00004634294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790436,0.00008618084,0.00023112059,0.00014518881,0.0011864665,0.00044666204],"domain_scores_gemma":[0.9989711,0.000103246326,0.00010415235,0.0002665711,0.00034669612,0.00020822648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013900716,0.000092951464,0.00009283449,0.00019036642,0.0012488487,0.00037947303,0.0008789388,0.000032258562,0.00012288836],"category_scores_gemma":[0.0001479817,0.0000703617,0.000020368785,0.0019005873,0.00018421482,0.010232612,0.00080902694,0.00008805527,0.00022321254],"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.00001411308,0.00010031187,0.013019224,0.000017749682,0.000014304072,5.187209e-7,0.020922089,0.88029593,0.000025914673,0.035604723,0.00017439094,0.049810752],"study_design_scores_gemma":[0.00027687845,0.000084621664,0.0028163393,0.0000051194215,0.0000018032604,0.0000057071466,0.0006138239,0.99190426,0.0039361618,0.00006907366,0.00015994372,0.00012626125],"about_ca_topic_score_codex":0.000031850963,"about_ca_topic_score_gemma":0.0000010268058,"teacher_disagreement_score":0.83857846,"about_ca_system_score_codex":0.000046298148,"about_ca_system_score_gemma":0.00015192006,"threshold_uncertainty_score":0.9605261},"labels":[],"label_agreement":null},{"id":"W2067017621","doi":"10.1016/s0020-0255(00)00033-5","title":"Fault recovery in distributed manufacturing systems by emergent holonic re-configuration: A fuzzy multi-agent modeling approach","year":2000,"lang":"en","type":"article","venue":"Information Sciences","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Universitatea Politehnica din București","keywords":"Computer science; Multi-agent system; Distributed computing; Fuzzy logic; Fault (geology); Distributed manufacturing; Artificial intelligence; Manufacturing engineering; Engineering; Geology","score_opus":0.02639395114470789,"score_gpt":0.23949717817727664,"score_spread":0.21310322703256876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067017621","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.23273942,0.00033894193,0.7589361,0.00007017736,0.00051661464,0.00030413165,0.00004857986,0.000296935,0.006749124],"genre_scores_gemma":[0.9895943,0.00021770905,0.009757618,0.000045086388,0.000028280048,0.00005064236,0.00022305513,0.0000058199716,0.00007751037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988018,0.000022323555,0.00051291444,0.00012398827,0.00030623435,0.00023270586],"domain_scores_gemma":[0.99971896,0.000014152797,0.00005456288,0.00011561724,0.00003548199,0.000061219944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041540767,0.00012444169,0.00012169372,0.00015870044,0.00015020037,0.000283855,0.00018714256,0.00007318524,0.00007797539],"category_scores_gemma":[0.000019424082,0.000115665345,0.00003058216,0.00038542764,0.00002711816,0.0015237035,0.000008899544,0.00011037577,0.000107237254],"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.0000022216927,0.000008233786,0.000014192691,0.000020970454,0.0000038955222,1.4321922e-7,0.0006359949,0.99334043,0.000007672586,0.000008613163,0.0002172156,0.00574044],"study_design_scores_gemma":[0.00024805943,0.000010254509,0.000043638767,0.00002418579,0.000002248828,0.0000031099999,0.0012432208,0.99693936,0.00029043944,0.0000060763628,0.0010373867,0.00015200788],"about_ca_topic_score_codex":0.00009398635,"about_ca_topic_score_gemma":0.0000042665806,"teacher_disagreement_score":0.75685483,"about_ca_system_score_codex":0.00009502428,"about_ca_system_score_gemma":0.000023762514,"threshold_uncertainty_score":0.47166958},"labels":[],"label_agreement":null},{"id":"W2070813883","doi":"10.1016/j.ins.2009.09.021","title":"Three-way decisions with probabilistic rough sets","year":2009,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":1555,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rough set; Dominance-based rough set approach; Decision rule; Probabilistic logic; Admissible decision rule; Set (abstract data type); Decision theory; Mathematics; Boundary (topology); Computer science; Weighted sum model; Evidential decision theory; Bayesian probability; Decision analysis; Data mining; Artificial intelligence; Evidential reasoning approach; Influence diagram; Mathematical economics; Business decision mapping; Statistics","score_opus":0.04090509544243847,"score_gpt":0.27488522136459725,"score_spread":0.23398012592215878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070813883","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.015993474,0.000027505988,0.8875294,0.0032872958,0.00025904903,0.00025637815,0.0000023749376,0.00020785494,0.0924367],"genre_scores_gemma":[0.8703549,0.0000051820753,0.12785979,0.0017434901,0.000020621606,0.0000068228073,0.0000019901252,7.6621114e-7,0.000006447626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987338,0.000011704859,0.00025089935,0.0001636658,0.0005945176,0.00024541712],"domain_scores_gemma":[0.99923813,0.00009544955,0.0001203713,0.0003027988,0.00016548017,0.00007778382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049060927,0.0000958293,0.00009223693,0.00013770202,0.00040611863,0.00075817894,0.000977814,0.000030511224,0.000011224709],"category_scores_gemma":[0.0001947463,0.000056888748,0.000024828325,0.0010542163,0.00013296078,0.004879864,0.00006547321,0.000064779124,0.00019056982],"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.0000051558222,0.000034709698,0.0003989952,0.0000025369889,0.0000022858017,0.0000021701196,0.0021155477,0.0095547,0.0000022492277,0.2590069,0.002843446,0.7260313],"study_design_scores_gemma":[0.0005227308,0.0012202768,0.087487325,0.00006492285,0.0000050868343,0.0000700695,0.00019919184,0.63563746,0.000050740204,0.24002632,0.034223244,0.0004926098],"about_ca_topic_score_codex":0.000018555887,"about_ca_topic_score_gemma":0.000020968115,"teacher_disagreement_score":0.8543614,"about_ca_system_score_codex":0.000020478428,"about_ca_system_score_gemma":0.000117834235,"threshold_uncertainty_score":0.73111373},"labels":[],"label_agreement":null},{"id":"W2074743521","doi":"10.1016/j.ins.2007.06.022","title":"Fuzzy functions with support vector machines","year":2007,"lang":"en","type":"article","venue":"Information Sciences","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Support vector machine; Fuzzy classification; Fuzzy logic; Fuzzy set operations; Data mining; Defuzzification; Neuro-fuzzy; Fuzzy rule; Artificial intelligence; Computer science; Fuzzy number; Fuzzy clustering; Fuzzy set; Mathematics; Fuzzy associative matrix; Machine learning; Pattern recognition (psychology); Fuzzy control system","score_opus":0.013231097574903178,"score_gpt":0.23637597353142925,"score_spread":0.22314487595652607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074743521","genre_codex":"other","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.009369597,0.000015250569,0.4701961,0.0009708481,0.00057813857,0.00012820974,0.0000019702698,0.00018911167,0.51855075],"genre_scores_gemma":[0.99429,7.6858976e-7,0.0045061056,0.0007874487,0.000057504338,0.00000810953,0.0000022011907,9.330909e-7,0.00034691065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887645,0.000012843989,0.00025862257,0.0001177577,0.00049397646,0.00024036667],"domain_scores_gemma":[0.9994264,0.000068057365,0.00012957139,0.00018669333,0.00011206587,0.0000771789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065524,0.00007871565,0.00008185357,0.00017753999,0.00034536252,0.00038640547,0.00057688775,0.000027497981,0.000011602257],"category_scores_gemma":[0.000030751173,0.000049144743,0.000025807109,0.0007959967,0.00011833196,0.003779419,0.00005162896,0.000051920695,0.00044762657],"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.000025045447,0.000038136408,0.015429171,0.00001991803,0.000017314993,0.000006998108,0.0040288763,0.0011529488,0.00012568341,0.70894796,0.007844442,0.26236352],"study_design_scores_gemma":[0.0035767297,0.0036412184,0.41452706,0.000089323046,0.000029091736,0.0009335846,0.0068765753,0.059509527,0.000801286,0.035965778,0.47204897,0.0020008732],"about_ca_topic_score_codex":0.00008301227,"about_ca_topic_score_gemma":0.000052451902,"teacher_disagreement_score":0.98492044,"about_ca_system_score_codex":0.00002015866,"about_ca_system_score_gemma":0.00011734003,"threshold_uncertainty_score":0.5753483},"labels":[],"label_agreement":null},{"id":"W2079360386","doi":"10.1016/j.ins.2013.08.029","title":"Distance-based consensus models for fuzzy and multiplicative preference relations","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":119,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Office for Philosophy and Social Sciences; National Natural Science Foundation of China","keywords":"Preference; Multiplicative function; Fuzzy logic; Computer science; Index (typography); Mathematics; Group decision-making; Preference relation; Mathematical optimization; Artificial intelligence; Statistics; Psychology; Social psychology","score_opus":0.33695011655872775,"score_gpt":0.4166686395739496,"score_spread":0.07971852301522186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079360386","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.1631333,0.000045577144,0.8144453,0.0030899895,0.00025346948,0.0012554976,0.00009761255,0.000080595375,0.017598623],"genre_scores_gemma":[0.9194978,0.0000017913757,0.07948554,0.0005479129,0.000015140574,0.00020696224,0.000005755023,0.0000031071131,0.00023599342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696493,0.000096238255,0.0009977095,0.00036307544,0.0012944441,0.00028357946],"domain_scores_gemma":[0.99298733,0.004601394,0.00058090204,0.00041127708,0.0012745709,0.00014452904],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026713281,0.00014822598,0.00021290442,0.00049340504,0.0007422188,0.0016068125,0.00073327427,0.00007281051,0.00018337576],"category_scores_gemma":[0.0055278493,0.00010237006,0.00006158925,0.0009767247,0.00063035893,0.0043172874,0.00010834492,0.00008061384,0.00048802307],"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.00011643169,0.000084243904,0.010965579,0.000029790976,0.000016129623,3.220589e-7,0.011682273,0.120503075,0.00085394277,0.20936847,0.04303828,0.60334146],"study_design_scores_gemma":[0.00043712504,0.00004261895,0.010254955,0.000018680721,0.000002543755,0.0000017939108,0.0018712826,0.8097752,0.00013845839,0.16863225,0.008680091,0.00014502117],"about_ca_topic_score_codex":0.000071378585,"about_ca_topic_score_gemma":0.000026108213,"teacher_disagreement_score":0.7563645,"about_ca_system_score_codex":0.000035363548,"about_ca_system_score_gemma":0.00017604443,"threshold_uncertainty_score":0.99942964},"labels":[],"label_agreement":null},{"id":"W2079438262","doi":"10.1016/j.ins.2012.04.018","title":"A general frame for intuitionistic fuzzy rough sets","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":148,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Shanghai Maritime University; National Natural Science Foundation of China","keywords":"Mathematics; Axiom; Algebra over a field; Fuzzy set operations; Frame (networking); Fuzzy logic; Discrete mathematics; Fuzzy set; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.0460859685640045,"score_gpt":0.30691576344624755,"score_spread":0.26082979488224306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079438262","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.01174694,0.00006317523,0.9303286,0.0015948896,0.0012294463,0.00025976257,0.0000123678665,0.00014675513,0.054618064],"genre_scores_gemma":[0.8069796,0.000005482693,0.19057791,0.0022338433,0.00011978295,0.000044827815,0.000009082525,0.0000012824526,0.000028196047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998944,0.000018095401,0.0002553722,0.00010086383,0.00033018948,0.00035152317],"domain_scores_gemma":[0.9994368,0.000082746745,0.00012580708,0.00017806476,0.00008409,0.0000924744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076239853,0.00008285581,0.000084292464,0.000116215764,0.00046668726,0.00064247666,0.00063410937,0.000042848274,0.0000139075355],"category_scores_gemma":[0.000106264844,0.00006227218,0.00004410358,0.0004487864,0.00010975164,0.006869032,0.00010126599,0.000047145662,0.00022996268],"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.0000022936783,0.000027036715,0.0006783271,0.000015827418,0.0000038681483,9.356768e-8,0.0034636492,0.00095677725,0.000012385204,0.8578203,0.0075736297,0.12944584],"study_design_scores_gemma":[0.00054421136,0.0003162726,0.013386678,0.000019402842,0.000007293336,0.000049380327,0.00035149456,0.5322988,0.00024618625,0.1488593,0.30340073,0.00052027055],"about_ca_topic_score_codex":0.000021774591,"about_ca_topic_score_gemma":0.0000010848835,"teacher_disagreement_score":0.79523265,"about_ca_system_score_codex":0.000026146088,"about_ca_system_score_gemma":0.000067277215,"threshold_uncertainty_score":0.61954176},"labels":[],"label_agreement":null},{"id":"W2079965034","doi":"10.1016/j.ins.2012.05.005","title":"Ranking multi-attribute alternatives on the basis of linguistic labels in group decisions","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Ciencia y Tecnología; World Anti-Doping Agency","keywords":"Ranking (information retrieval); Consistency (knowledge bases); Computer science; Group decision-making; Set (abstract data type); Context (archaeology); Point (geometry); Group (periodic table); Artificial intelligence; Basis (linear algebra); Domain (mathematical analysis); Machine learning; Natural language processing; Data mining; Mathematics","score_opus":0.4291475758097598,"score_gpt":0.4805225757641095,"score_spread":0.05137499995434969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079965034","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.91282684,0.00010463595,0.0804349,0.0007554907,0.0014895189,0.0003964195,0.000054401575,0.000030544878,0.003907221],"genre_scores_gemma":[0.9910837,0.0000152465045,0.008105233,0.0006714664,0.00006330656,0.000019275893,0.0000023293596,0.00000384522,0.0000356065],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9941823,0.00042047648,0.0016042339,0.0002471209,0.0030908764,0.00045502358],"domain_scores_gemma":[0.984925,0.013003467,0.00086317945,0.00057870167,0.00051583047,0.00011382941],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.018283004,0.00017362671,0.00031307718,0.0012794706,0.0004569145,0.0006052584,0.0019148249,0.00006500534,0.00041670774],"category_scores_gemma":[0.053489313,0.00009578636,0.0001136937,0.0028700274,0.00044815935,0.0031416472,0.00031685084,0.00018769022,0.00052161637],"study_design_candidate":"observational","study_design_consensus":"observational","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.00010551777,0.0005056362,0.42614347,0.000012205686,0.000027648262,0.0000034495195,0.0828688,0.00727003,0.0012725492,0.120254084,0.0027210293,0.35881558],"study_design_scores_gemma":[0.0019012801,0.00019308503,0.80514663,0.00047729458,0.000012811201,0.000016451282,0.017535634,0.11797751,0.005733723,0.01944302,0.030937554,0.00062502787],"about_ca_topic_score_codex":0.00009008728,"about_ca_topic_score_gemma":0.00005089889,"teacher_disagreement_score":0.37900314,"about_ca_system_score_codex":0.00005319565,"about_ca_system_score_gemma":0.00007007063,"threshold_uncertainty_score":0.95448357},"labels":[],"label_agreement":null},{"id":"W2082206279","doi":"10.1016/j.ins.2008.11.012","title":"Agent-based modeling of host–pathogen systems: The successes and challenges","year":2008,"lang":"en","type":"article","venue":"Information Sciences","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":213,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Los Alamos National Laboratory; National Center for Research Resources; National Institute of Allergy and Infectious Diseases; National Institutes of Health; U.S. Department of Energy","keywords":"Host (biology); Computer science; Management science; Data science; Computational biology; Biology; Engineering; Ecology","score_opus":0.12999718483661293,"score_gpt":0.3148846375727568,"score_spread":0.18488745273614388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082206279","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.87319964,0.0025771535,0.08219032,0.012371277,0.00012275577,0.0003313058,0.0000061487854,0.000037921815,0.02916345],"genre_scores_gemma":[0.99866325,0.00053333736,0.00029377482,0.0004767025,0.0000117427335,0.00001058428,0.0000012548819,7.4569664e-7,0.000008635239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993766,0.000045478013,0.00028156236,0.00005759432,0.00013372279,0.00010507677],"domain_scores_gemma":[0.99936223,0.00036798732,0.000079215955,0.00007867753,0.00007079583,0.0000411191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010814182,0.000048952235,0.00016015311,0.000049666734,0.00020196688,0.0000062792606,0.00007784102,0.000051241324,0.000024422141],"category_scores_gemma":[0.00046496958,0.000024253488,0.00002454908,0.00007985091,0.000737679,0.00021869519,0.000019190824,0.000052726366,0.0000131914385],"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.000050671588,0.00004863901,0.0018984054,0.0006990031,0.000018947823,0.0000017952509,0.0028341275,0.012956671,0.000041742656,0.9801977,0.000037410813,0.0012148587],"study_design_scores_gemma":[0.00018891187,0.00012622865,0.0010504544,0.000048787675,0.000014088005,0.000049610746,0.001144794,0.99273974,0.000060071674,0.0041232095,0.00041346642,0.000040625175],"about_ca_topic_score_codex":0.000019060506,"about_ca_topic_score_gemma":9.923695e-7,"teacher_disagreement_score":0.97978306,"about_ca_system_score_codex":0.0000030149179,"about_ca_system_score_gemma":0.00004887773,"threshold_uncertainty_score":0.2718009},"labels":[],"label_agreement":null},{"id":"W2082539276","doi":"10.1016/j.ins.2012.02.042","title":"Feature selection using structural similarity","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cardinality (data modeling); Feature selection; Pattern recognition (psychology); Similarity (geometry); Data mining; Cluster analysis; Partition (number theory); Curse of dimensionality; Feature (linguistics); Computer science; Mathematics; Artificial intelligence; Selection (genetic algorithm); Combinatorics","score_opus":0.057503571108182994,"score_gpt":0.37055909314857566,"score_spread":0.31305552204039266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082539276","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.088627875,0.000029554,0.90860355,0.0005776324,0.00050518353,0.000092485614,0.0000013136834,0.00013337808,0.0014290024],"genre_scores_gemma":[0.7541294,0.0000012886235,0.24556656,0.00019198046,0.00007517625,0.0000024130784,8.541691e-7,0.0000011288279,0.000031196476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884814,0.00003260602,0.000116097166,0.00009094413,0.00055560877,0.000356628],"domain_scores_gemma":[0.9995402,0.000038712817,0.000085547115,0.00012588761,0.00011847187,0.00009117988],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00060764916,0.00007074369,0.000059283175,0.00017827124,0.0005159333,0.00040698922,0.0005498003,0.000041091225,0.000009650338],"category_scores_gemma":[0.0000972518,0.000057101483,0.000020839332,0.0010084435,0.00009619806,0.013872795,0.00019458441,0.00012771101,0.000039707094],"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.000013695135,0.000034782322,0.047916476,0.00008707265,0.000022503902,9.602153e-7,0.015086889,0.12506409,0.0039683883,0.07092075,0.002113653,0.7347708],"study_design_scores_gemma":[0.00007100769,0.000022574857,0.010761264,0.0000044899175,6.6006857e-7,0.00005769878,0.00011532155,0.9808371,0.0020892965,0.0005952263,0.00534073,0.00010463232],"about_ca_topic_score_codex":0.000025190813,"about_ca_topic_score_gemma":0.0000016890464,"teacher_disagreement_score":0.85577303,"about_ca_system_score_codex":0.000084801344,"about_ca_system_score_gemma":0.00007979246,"threshold_uncertainty_score":0.99991965},"labels":[],"label_agreement":null},{"id":"W2083529680","doi":"10.1016/j.ins.2008.12.012","title":"An analysis of privacy signals on the World Wide Web: Past, present and future","year":2008,"lang":"en","type":"article","venue":"Information Sciences","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Internet privacy; Protocol (science); Computer science; Government (linguistics); Mechanism (biology); Information privacy; Intervention (counseling); Computer security; Business; World Wide Web","score_opus":0.0439202476729614,"score_gpt":0.32791380921913166,"score_spread":0.2839935615461703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083529680","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.9442761,0.000056051198,0.0006145845,0.025625953,0.0001924615,0.0003586106,0.000030698888,0.000055693912,0.02878984],"genre_scores_gemma":[0.99883664,0.00014552312,0.0001538773,0.0005529261,0.0002540455,0.00001088668,0.000007554296,8.2896145e-7,0.000037696165],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986265,0.00016498158,0.00024340846,0.0001038124,0.000707711,0.00015359216],"domain_scores_gemma":[0.9991536,0.0002400445,0.00020758082,0.00021978267,0.00011010032,0.00006885033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016226504,0.000062189116,0.00010848805,0.0004210781,0.0011838882,0.00018063874,0.0005767609,0.00003458725,0.0001597176],"category_scores_gemma":[0.00018471481,0.000039784685,0.000042204938,0.002077204,0.0007031149,0.0027167583,0.00007038173,0.00007009198,0.000011408739],"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.00014216983,0.00036674817,0.23218513,0.00004986339,0.00033220163,0.000002041888,0.39409554,0.004502113,0.0003575935,0.1732219,0.08647557,0.10826914],"study_design_scores_gemma":[0.00019300231,0.00017193289,0.21227625,0.0000136200715,0.00007090281,0.0000010062433,0.026398787,0.018719954,0.00071021495,0.0033074503,0.73791575,0.00022114844],"about_ca_topic_score_codex":0.00091542886,"about_ca_topic_score_gemma":0.00056181505,"teacher_disagreement_score":0.65144014,"about_ca_system_score_codex":0.000021256461,"about_ca_system_score_gemma":0.000119031916,"threshold_uncertainty_score":0.91056305},"labels":[],"label_agreement":null},{"id":"W2085200348","doi":"10.1016/j.ins.2008.10.036","title":"A simple graphical approach for understanding probabilistic inference in Bayesian networks","year":2008,"lang":"en","type":"article","venue":"Information Sciences","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Graphical model; Variable elimination; Inference; Bayesian network; Computer science; Theoretical computer science; Directed acyclic graph; Correctness; Simple (philosophy); Conditional probability; Bayesian inference; Approximate inference; Probabilistic logic; Notation; Algorithm; Fiducial inference; Mathematics; Frequentist inference; Artificial intelligence; Bayesian probability","score_opus":0.10863909459964376,"score_gpt":0.3023293507628118,"score_spread":0.19369025616316804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085200348","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.0027472198,0.000014389222,0.9935264,0.00019103533,0.00008858833,0.0002792843,0.000001661568,0.00010633407,0.0030450772],"genre_scores_gemma":[0.9464004,0.000010918487,0.053178918,0.00032084234,0.000017247425,0.000059882226,0.0000064364694,0.0000017829507,0.0000035673286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985852,0.00003894418,0.00041211295,0.00023829528,0.00035287454,0.00037256948],"domain_scores_gemma":[0.9991965,0.0003017465,0.00012339362,0.00020434379,0.0000844217,0.0000895391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089228014,0.000119266086,0.00014559203,0.00030097173,0.0004582431,0.00031328146,0.0008100725,0.00007762622,0.0000024481456],"category_scores_gemma":[0.00027538772,0.00010096993,0.000045061734,0.0013148908,0.00029763806,0.0028873563,0.00009356792,0.00013528016,0.0000033567937],"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.0000054763327,0.00003086375,0.003041244,0.000021767364,0.0000020578077,6.360004e-7,0.001718061,0.27449527,0.0000029472972,0.71697736,0.00014922704,0.0035551032],"study_design_scores_gemma":[0.00017205351,0.00007002439,0.0007209371,0.000011252923,8.1929863e-7,0.00000876972,0.00017468713,0.9119373,0.0000049367272,0.08671797,0.00004496376,0.00013630869],"about_ca_topic_score_codex":0.00004383837,"about_ca_topic_score_gemma":0.000014358069,"teacher_disagreement_score":0.94365317,"about_ca_system_score_codex":0.00006901243,"about_ca_system_score_gemma":0.00021750608,"threshold_uncertainty_score":0.41174343},"labels":[],"label_agreement":null},{"id":"W2086149766","doi":"10.1016/j.ins.2011.10.015","title":"A type-2 fuzzy c-regression clustering algorithm for Takagi–Sugeno system identification and its application in the steel industry","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fuzzy clustering; Cluster analysis; Algorithm; Mathematics; Fuzzy set; Fuzzy classification; Data mining; Fuzzy set operations; Fuzzy logic; Fuzzy number; Robustness (evolution); Computer science; Artificial intelligence; Statistics","score_opus":0.046458842920137106,"score_gpt":0.2697854940760742,"score_spread":0.2233266511559371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086149766","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.050657474,0.00023981543,0.9275928,0.0005380489,0.0007382693,0.0016827188,0.00000719758,0.00014578186,0.018397858],"genre_scores_gemma":[0.9954913,0.000003826009,0.0041082823,0.00014872375,0.000035396435,0.00018637384,0.0000028339905,0.0000013390332,0.000021873091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989393,0.00005869859,0.00036448042,0.00016371543,0.0003117061,0.00016213913],"domain_scores_gemma":[0.9993133,0.00006244261,0.00026206087,0.00020038731,0.00012868787,0.00003311623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016991526,0.00008238068,0.00009181752,0.00014682212,0.00029097477,0.00029927943,0.0007308261,0.000091522495,3.4986826e-7],"category_scores_gemma":[0.000037787326,0.000051504958,0.000018023853,0.0005766999,0.0000444786,0.0024137748,0.0000730403,0.000085110194,0.000027702596],"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.000013168821,0.00003630966,0.0013054236,0.00016163713,0.0000073707006,7.81959e-7,0.022238728,0.00026675427,0.0007844148,0.24282385,0.00021227784,0.7321493],"study_design_scores_gemma":[0.00038874676,0.000101567166,0.014896417,0.000071653594,0.000004434639,0.00003875964,0.006606374,0.9738888,0.00042260066,0.0023546428,0.0010631171,0.00016288279],"about_ca_topic_score_codex":0.00006256235,"about_ca_topic_score_gemma":0.000009252276,"teacher_disagreement_score":0.973622,"about_ca_system_score_codex":0.0000309946,"about_ca_system_score_gemma":0.000051968764,"threshold_uncertainty_score":0.28859583},"labels":[],"label_agreement":null},{"id":"W2086585961","doi":"10.1016/s0020-0255(01)00134-7","title":"Unifying single-agent and two-player search","year":2001,"lang":"en","type":"article","venue":"Information Sciences","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Information retrieval","score_opus":0.07313310079595914,"score_gpt":0.30194613214654864,"score_spread":0.2288130313505895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086585961","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.2827985,0.000109019355,0.671896,0.0021947185,0.0002798986,0.0000956008,0.0000010583069,0.00016765148,0.042457603],"genre_scores_gemma":[0.9782958,0.000010588545,0.020902012,0.00070115866,0.000021528884,0.0000021070748,0.0000013537848,9.108441e-7,0.0000645566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905914,0.000032833123,0.00018447723,0.000119435135,0.0003782613,0.00022584379],"domain_scores_gemma":[0.9995552,0.000112322305,0.00006519376,0.00012888391,0.000065080116,0.000073340954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010488325,0.000065605454,0.000058256388,0.00019108091,0.0004684486,0.0007672426,0.00042910015,0.000022134567,0.000015562606],"category_scores_gemma":[0.000039932063,0.000053405405,0.000013194107,0.0006896718,0.000095379604,0.003632358,0.00012180575,0.00007458753,0.00009785188],"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.000008048255,0.000027220392,0.051057868,0.000038386912,0.000008838832,0.000010813804,0.02515118,0.03600591,0.0007039979,0.05064873,0.0016744877,0.8346645],"study_design_scores_gemma":[0.00040324216,0.0001998867,0.0073830294,0.00007504808,0.0000018832359,0.00015701135,0.0014232084,0.9360197,0.0013886665,0.0019198074,0.05071014,0.0003183316],"about_ca_topic_score_codex":0.00008884664,"about_ca_topic_score_gemma":0.000004933998,"teacher_disagreement_score":0.9000138,"about_ca_system_score_codex":0.000017905766,"about_ca_system_score_gemma":0.00007499353,"threshold_uncertainty_score":0.73985386},"labels":[],"label_agreement":null},{"id":"W2091771663","doi":"10.1016/j.ins.2012.07.058","title":"Adaptive control for nonlinear MIMO time-delay systems based on fuzzy approximation","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backstepping; Control theory (sociology); Fuzzy logic; Nonlinear system; MIMO; Controller (irrigation); Fuzzy control system; Computer science; Adaptive control; State (computer science); Control (management); Mathematics; Artificial intelligence; Algorithm; Channel (broadcasting)","score_opus":0.022544014555136428,"score_gpt":0.24166064132336015,"score_spread":0.21911662676822372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091771663","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.0005107578,0.000076168646,0.9443772,0.0005820989,0.0009648807,0.00096100103,0.00003211501,0.00016972331,0.052326042],"genre_scores_gemma":[0.9845982,5.983748e-7,0.013874179,0.0010383821,0.00019836077,0.00020923946,0.000010790144,0.0000027014414,0.00006752965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827266,0.00009196811,0.00044432186,0.00015785459,0.000643739,0.00038947398],"domain_scores_gemma":[0.9986877,0.00037670572,0.00033913157,0.00025692547,0.00022373571,0.00011581446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002183977,0.00014062873,0.00019341103,0.00022014322,0.00036323807,0.0004732257,0.0006637903,0.00007312432,0.0000025702545],"category_scores_gemma":[0.00013902575,0.000101808255,0.00007513267,0.00043874368,0.00008297443,0.004536794,0.000026617172,0.000059098133,0.0004715527],"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.0001751351,0.00024663098,0.00075208565,0.00017753227,0.000045180856,4.878088e-7,0.0037629623,0.20474109,0.00016793862,0.72241235,0.008500381,0.05901823],"study_design_scores_gemma":[0.0007336413,0.0002591594,0.00013072322,0.000023705628,0.0000043447785,0.0000038643398,0.0001908228,0.9892525,0.000040173614,0.00049759494,0.008716076,0.00014739794],"about_ca_topic_score_codex":0.000024883464,"about_ca_topic_score_gemma":3.8484043e-7,"teacher_disagreement_score":0.98408747,"about_ca_system_score_codex":0.0000596438,"about_ca_system_score_gemma":0.00012016884,"threshold_uncertainty_score":0.6061013},"labels":[],"label_agreement":null},{"id":"W2094592322","doi":"10.1016/j.ins.2012.06.008","title":"Derivation of an amplitude of information in the setting of a new family of fractional entropies","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Tsallis entropy; Logarithm; Rényi entropy; Fractional calculus; Entropy (arrow of time); Inverse; Binary entropy function; Statistical physics; Principle of maximum entropy; Applied mathematics; Pure mathematics; Calculus (dental); Mathematical analysis; Tsallis statistics; Quantum mechanics; Statistics; Physics","score_opus":0.025714334433005026,"score_gpt":0.30052041240758265,"score_spread":0.2748060779745776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094592322","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.72271436,0.0000035495827,0.27569923,0.00003785027,0.0000470785,0.00006708778,0.000025896237,0.0000011581344,0.001403816],"genre_scores_gemma":[0.9948543,7.523512e-7,0.005074521,0.00002653406,0.00001683235,0.0000024578826,0.000023833152,4.1122817e-7,3.8959246e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991759,0.00001710159,0.0004234051,0.000018191737,0.00029190784,0.0000735166],"domain_scores_gemma":[0.9992936,0.00010056319,0.00044177246,0.00005369208,0.000094260955,0.000016075666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045060815,0.000034123816,0.000079589736,0.000097727294,0.000027139555,0.000014737002,0.000111410896,0.0000116310475,0.000041372285],"category_scores_gemma":[0.000053407344,0.000023844916,0.0000200209,0.000253639,0.000046940346,0.0022132294,0.000013048221,0.000027900047,0.0000016327928],"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.000012078294,0.000044604196,0.048881527,0.0000344482,0.0000059560134,1.0611838e-9,0.01249126,0.0017307044,0.00076641946,0.87208414,0.000059122623,0.06388973],"study_design_scores_gemma":[0.00056574977,0.0001854999,0.8395844,0.000059955764,0.000013237663,4.0153654e-7,0.036586616,0.077291794,0.01101228,0.033559773,0.0010372569,0.000103019505],"about_ca_topic_score_codex":0.0005746553,"about_ca_topic_score_gemma":9.583302e-7,"teacher_disagreement_score":0.8385244,"about_ca_system_score_codex":0.0000040334926,"about_ca_system_score_gemma":0.000053148095,"threshold_uncertainty_score":0.1604538},"labels":[],"label_agreement":null},{"id":"W2100199956","doi":"10.1016/j.ins.2013.09.004","title":"A bio-cryptographic system based on offline signature images","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Biometrics; Computer science; Pattern recognition (psychology); Population; Feature vector; Representation (politics); Feature extraction; Artificial intelligence; Cryptography; Fingerprint (computing); Password; Data mining; Iris recognition; Digital signature; Feature selection; Algorithm; Hash function; Computer security","score_opus":0.012041585393201076,"score_gpt":0.2319202389507387,"score_spread":0.21987865355753763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100199956","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.0072761755,0.000046776902,0.95816416,0.0055287844,0.00086039194,0.00040583877,0.000009899049,0.0004714406,0.027236557],"genre_scores_gemma":[0.98517615,0.0000021095752,0.013233791,0.0014997266,0.000017406815,0.000025786629,0.000005926368,0.00000102626,0.00003807059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986354,0.0000458041,0.00030122936,0.00016442916,0.0006674257,0.0001856728],"domain_scores_gemma":[0.99906635,0.00009143853,0.00018082152,0.00031483485,0.00026556695,0.00008099881],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007483536,0.00009048927,0.0000847033,0.0011406739,0.00032107392,0.0012417375,0.0009815219,0.000059100646,0.00005035156],"category_scores_gemma":[0.00009304957,0.00006589959,0.000050076713,0.0039157746,0.00014665081,0.0037387582,0.00005544594,0.00009008344,0.00093194266],"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.000007853218,0.00021155155,0.0025700938,0.00025635527,0.000017145372,0.0000019343238,0.0027795203,0.0023503685,0.0012387987,0.46899042,0.09256179,0.42901418],"study_design_scores_gemma":[0.00022350004,0.0000826356,0.016010517,0.000027315666,0.0000015205376,0.0000039576307,0.00038105279,0.96143377,0.001422582,0.0005265386,0.01970336,0.00018325112],"about_ca_topic_score_codex":0.00006309062,"about_ca_topic_score_gemma":7.603208e-7,"teacher_disagreement_score":0.97789997,"about_ca_system_score_codex":0.000024308918,"about_ca_system_score_gemma":0.00009289303,"threshold_uncertainty_score":0.9998459},"labels":[],"label_agreement":null},{"id":"W2104240779","doi":"10.1016/j.ins.2014.07.005","title":"Adaptive ensembles for face recognition in changing video surveillance environments","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère du Développement Économique, de l’Innovation et de l’Exportation","keywords":"Computer science; Classifier (UML); Artificial intelligence; Facial recognition system; Computer vision; Machine learning; Pattern recognition (psychology); Face detection","score_opus":0.0329683729434989,"score_gpt":0.2512069153217004,"score_spread":0.2182385423782015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104240779","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.056634482,0.00000962696,0.93871653,0.00048225932,0.00022682126,0.00023385555,0.0000073831766,0.000044992554,0.0036440403],"genre_scores_gemma":[0.97932845,0.000015150808,0.019880949,0.00063882535,0.000020928142,0.000067644854,0.000014849689,0.0000014449229,0.00003174913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990652,0.000047999623,0.00023717724,0.0001534852,0.0002637577,0.00023238942],"domain_scores_gemma":[0.99949837,0.00018491506,0.00014207688,0.00010681229,0.000032026543,0.000035777353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011522113,0.000075741555,0.000084543346,0.00040350595,0.00020852913,0.00018519672,0.00031974906,0.00003848595,0.000006604597],"category_scores_gemma":[0.00013954095,0.00006595221,0.00002605823,0.00055218925,0.000050031005,0.0037131333,0.00006592475,0.00003999991,0.00017430603],"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.000014926818,0.000022666227,0.0006209585,0.000018144518,0.000002481311,1.2386653e-7,0.0048916894,0.0033713728,0.0009384652,0.0036936936,0.00056064205,0.9858648],"study_design_scores_gemma":[0.00072947424,0.0002075525,0.003856178,0.0000990434,0.0000011049211,0.0000038850985,0.0017302316,0.94401556,0.015937006,0.011965274,0.021148143,0.00030656235],"about_ca_topic_score_codex":0.0000106839925,"about_ca_topic_score_gemma":0.00000951385,"teacher_disagreement_score":0.9855583,"about_ca_system_score_codex":0.000023902427,"about_ca_system_score_gemma":0.00001964125,"threshold_uncertainty_score":0.2691932},"labels":[],"label_agreement":null},{"id":"W2115104482","doi":"10.1016/j.ins.2007.06.030","title":"Comparison of different strategies of utilizing fuzzy clustering in structure identification","year":2007,"lang":"en","type":"article","venue":"Information Sciences","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cluster analysis; Fuzzy clustering; Computer science; Data mining; Identification (biology); Fuzzy logic; Correlation clustering; CURE data clustering algorithm; FLAME clustering; Artificial intelligence; Machine learning","score_opus":0.0387940802650008,"score_gpt":0.32500710926348875,"score_spread":0.28621302899848794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115104482","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.70045036,0.000044224875,0.2810096,0.00004415196,0.00028069946,0.00012085077,0.0000013827158,0.000020644648,0.018028049],"genre_scores_gemma":[0.9987398,0.0000014202767,0.0012363493,0.000010330111,0.0000074523277,0.0000013286987,0.0000011202881,4.993155e-7,0.0000017342359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99864507,0.000023390709,0.00071151083,0.00008319674,0.00040413727,0.0001327076],"domain_scores_gemma":[0.9992272,0.00007409471,0.0004478562,0.00014415735,0.00008593259,0.000020708021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007825532,0.000059253973,0.00015413239,0.00026411924,0.000057774978,0.00013435949,0.00054372346,0.000035333476,0.0000011927507],"category_scores_gemma":[0.000032986856,0.00004462841,0.000023203467,0.0005230067,0.00009616844,0.0023650208,0.00006695588,0.00004721021,0.0000015461356],"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.000017957636,0.00006172685,0.08739108,0.00024077,0.000008415971,3.374784e-7,0.029810637,0.026801083,0.03311119,0.6690829,0.000026507087,0.1534474],"study_design_scores_gemma":[0.0004710321,0.00016298366,0.61772424,0.000113957125,0.000002837978,0.000004205999,0.036178466,0.29042706,0.02864989,0.026026359,0.000058351427,0.00018062058],"about_ca_topic_score_codex":0.00008756825,"about_ca_topic_score_gemma":0.00018356869,"teacher_disagreement_score":0.6430565,"about_ca_system_score_codex":0.000019541018,"about_ca_system_score_gemma":0.00004390085,"threshold_uncertainty_score":0.18198937},"labels":[],"label_agreement":null},{"id":"W2139902660","doi":"10.1016/j.ins.2012.02.017","title":"A survey of techniques for incremental learning of HMM parameters","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Machine learning; Hidden Markov model; Artificial intelligence; Benchmarking; Data mining","score_opus":0.054959383096668535,"score_gpt":0.3229061009650656,"score_spread":0.2679467178683971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139902660","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.06332458,0.000011236018,0.9347175,0.00003914323,0.00003276444,0.00019349618,0.0000059766653,0.00007438086,0.0016009724],"genre_scores_gemma":[0.8682544,0.000004362784,0.13165008,0.00003821891,0.0000030922338,0.00004042087,0.0000029754776,6.892077e-7,0.0000057381408],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935204,0.000025566147,0.00028534496,0.000050260074,0.000178261,0.00010850754],"domain_scores_gemma":[0.99930924,0.000120570876,0.00029393594,0.000101875936,0.00014864832,0.000025734922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015119172,0.000040932682,0.00007531373,0.00015136821,0.00011121915,0.000035451947,0.00035214348,0.000024253439,0.000002975396],"category_scores_gemma":[0.00011486904,0.00003465636,0.000029674571,0.00053900445,0.00011355255,0.001958759,0.00006539197,0.000029018463,0.0000024444214],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013451596,0.000114584196,0.1036612,0.0000874846,0.00001629436,7.193099e-9,0.0040971003,0.00026616466,0.0072614052,0.1719878,0.001074342,0.7114202],"study_design_scores_gemma":[0.00016379278,0.00059216394,0.09433095,0.000030084415,0.0000048595434,0.0000042672054,0.00058815844,0.08698376,0.8049587,0.001286765,0.010823563,0.0002329254],"about_ca_topic_score_codex":0.0002414296,"about_ca_topic_score_gemma":0.000002596285,"teacher_disagreement_score":0.80492985,"about_ca_system_score_codex":0.000010587014,"about_ca_system_score_gemma":0.000033232307,"threshold_uncertainty_score":0.1420053},"labels":[],"label_agreement":null},{"id":"W2165290874","doi":"10.1016/j.ins.2004.04.012","title":"A solution to the GHI problem for depth-first proof-number search","year":2004,"lang":"en","type":"article","venue":"Information Sciences","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Computer science; Graph; Overhead (engineering); Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.0752782254553735,"score_gpt":0.34666800441411133,"score_spread":0.27138977895873784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165290874","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.0086197,0.0000070200044,0.95563114,0.027457526,0.00034471854,0.0008537747,0.0000021434412,0.00008916177,0.006994826],"genre_scores_gemma":[0.8973266,0.0000018893487,0.10101856,0.0013432924,0.00006661919,0.00018873482,0.0000011280976,0.000001976252,0.000051234394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850786,0.000018610586,0.00033158818,0.00017671005,0.0006071384,0.00035807455],"domain_scores_gemma":[0.9991804,0.00011134119,0.00009344448,0.00026295712,0.00027666913,0.00007524077],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015099971,0.00008758104,0.00007031689,0.0001224375,0.0009253377,0.0008242933,0.0014281613,0.000035253568,0.000008227753],"category_scores_gemma":[0.0001822446,0.000057129528,0.000043743774,0.0012085551,0.00019064614,0.0039268243,0.00020624553,0.00006784721,0.0008894949],"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.000009794565,0.0000405696,0.0008915764,0.000029077239,0.0000057700063,2.5235283e-7,0.043610558,0.1748632,0.00006188124,0.33740205,0.0040951553,0.43899012],"study_design_scores_gemma":[0.00034918604,0.0007296257,0.0029987155,0.0001536712,0.000005534229,0.00005786909,0.0053048674,0.5400139,0.0777914,0.10688616,0.26500627,0.0007028013],"about_ca_topic_score_codex":0.00023481192,"about_ca_topic_score_gemma":0.00046565273,"teacher_disagreement_score":0.88870686,"about_ca_system_score_codex":0.00008294764,"about_ca_system_score_gemma":0.00029111523,"threshold_uncertainty_score":0.9998884},"labels":[],"label_agreement":null},{"id":"W2170755382","doi":"10.1016/j.ins.2009.11.023","title":"MGRS: A multi-granulation rough set","year":2009,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":729,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Rough set; Dominance-based rough set approach; Granular computing; Reduct; Mathematics; Equivalence relation; Equivalence (formal languages); Context (archaeology); Binary relation; Measure (data warehouse); Computer science; Data mining; Discrete mathematics","score_opus":0.05952590777572516,"score_gpt":0.3098359015145148,"score_spread":0.25030999373878965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170755382","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.010628839,0.00003225105,0.9444766,0.0047535,0.00033280012,0.00015831417,0.000002517446,0.00025627538,0.039358925],"genre_scores_gemma":[0.89755285,0.000007807116,0.09930978,0.0030741566,0.000030440668,0.0000028774707,0.0000043879136,4.867606e-7,0.000017196704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989997,0.000021554788,0.0002558391,0.00012358776,0.0003934983,0.0002058043],"domain_scores_gemma":[0.9995245,0.000026645426,0.0001243725,0.00020498942,0.00006955549,0.000049966402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005672176,0.00007580258,0.00007901692,0.00015553842,0.0003015651,0.00071940635,0.00073654903,0.00003487021,0.000009752171],"category_scores_gemma":[0.000053924956,0.00005600867,0.000032225944,0.000777011,0.00005936896,0.006992947,0.00004774896,0.000050496597,0.0002525131],"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.0000032656214,0.000037658898,0.0008372179,0.000005476963,0.000002364507,0.0000012970214,0.008728351,0.009497623,0.000043368113,0.16328177,0.0042186365,0.813343],"study_design_scores_gemma":[0.00032730278,0.00015364218,0.04258809,0.000009517036,0.0000011791549,0.000014331076,0.00017074641,0.9162324,0.00011648255,0.012398843,0.02780808,0.00017937104],"about_ca_topic_score_codex":0.000021909029,"about_ca_topic_score_gemma":0.0000023077318,"teacher_disagreement_score":0.90673476,"about_ca_system_score_codex":0.000017452145,"about_ca_system_score_gemma":0.000051810497,"threshold_uncertainty_score":0.6937252},"labels":[],"label_agreement":null},{"id":"W2177504740","doi":"10.1016/j.ins.2015.11.012","title":"Length two path centered surface areas of the (n, k)-star graph","year":2015,"lang":"en","type":"article","venue":"Information Sciences","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Path (computing); Mathematics; Graph; Star (game theory); Distance; Surface (topology); Path length; Factor-critical graph; Path graph; Distance-hereditary graph; Discrete mathematics; Computer science; Graph power; Geometry; Line graph; Shortest path problem; Mathematical analysis","score_opus":0.045721880698627024,"score_gpt":0.2653010909778355,"score_spread":0.21957921027920846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177504740","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.6725385,0.00007476096,0.2771437,0.0014228617,0.004588555,0.00031811884,0.0000070167116,0.00011840917,0.043788087],"genre_scores_gemma":[0.9982863,0.0000023642208,0.0013282824,0.0002981322,0.000024256266,0.00000190089,5.448743e-7,8.0367295e-7,0.000057416193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987814,0.000078181016,0.00034229597,0.00009245677,0.00055400695,0.00015170596],"domain_scores_gemma":[0.99910045,0.000041022187,0.00026676673,0.00027472942,0.00026026278,0.00005677811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012379654,0.00006594593,0.000088597015,0.00006932859,0.0001735731,0.0002476637,0.000990121,0.000022084416,0.0000048324005],"category_scores_gemma":[0.0000656888,0.00003890051,0.00005347079,0.000773041,0.00012995828,0.002536326,0.0001420141,0.00005441976,0.000034265744],"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.000025156703,0.00009860757,0.05035235,0.000054253833,0.000040034436,0.0000010796795,0.05397922,0.14730701,0.00018576407,0.6597637,0.054482777,0.033710063],"study_design_scores_gemma":[0.00081726693,0.00025198443,0.006236985,0.00010550502,0.0000035565972,0.00004423248,0.0045522735,0.9326702,0.0017636596,0.0074664378,0.0458207,0.00026722],"about_ca_topic_score_codex":0.00020738044,"about_ca_topic_score_gemma":0.000031042295,"teacher_disagreement_score":0.7853632,"about_ca_system_score_codex":0.00002235474,"about_ca_system_score_gemma":0.00012577027,"threshold_uncertainty_score":0.23882268},"labels":[],"label_agreement":null},{"id":"W2256990898","doi":"10.1016/j.ins.2016.01.048","title":"Distributed attitude synchronization control for a group of flexible spacecraft using only attitude measurements","year":2016,"lang":"en","type":"article","venue":"Information Sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Backstepping; Control theory (sociology); Spacecraft; Attitude control; Lemma (botany); Modal; Lyapunov function; Observer (physics); Angular velocity; Nonlinear system; Synchronization (alternating current); Quaternion; Lyapunov stability; Computer science; Group (periodic table); Control (management); Mathematics; Control engineering; Engineering; Adaptive control; Physics; Topology (electrical circuits); Aerospace engineering","score_opus":0.0598322020896847,"score_gpt":0.30243197654101517,"score_spread":0.24259977445133046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256990898","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.008505271,0.000045133012,0.98903155,0.00053257897,0.0005992239,0.0007554441,0.00018614669,0.00012941234,0.00021520934],"genre_scores_gemma":[0.98893464,0.000001788559,0.010828393,0.00010842866,0.00003686215,0.000048903912,0.000019819952,0.0000035733754,0.00001758859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976736,0.00007354769,0.0007041715,0.0002499148,0.00090532616,0.0003934538],"domain_scores_gemma":[0.9980926,0.00018341362,0.00065505767,0.0003586254,0.00061022246,0.00010010491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015504832,0.00016333083,0.00025651723,0.00024420983,0.00028530016,0.000328228,0.0010194643,0.00006764553,0.000012479303],"category_scores_gemma":[0.00038249695,0.00011467923,0.00009087171,0.0007678245,0.00016999412,0.005380684,0.00008866116,0.000030243364,0.000038265214],"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.00024562294,0.0006333637,0.2553338,0.000554394,0.0006444557,0.0000025159459,0.0028197167,0.043798488,0.05080637,0.38369158,0.0030049793,0.25846472],"study_design_scores_gemma":[0.008155571,0.0005341663,0.03546715,0.00050554465,0.00006804018,0.000027289196,0.0002426821,0.94234306,0.004505075,0.0013190764,0.0060927807,0.0007395388],"about_ca_topic_score_codex":0.000068385416,"about_ca_topic_score_gemma":0.0000185552,"teacher_disagreement_score":0.98042935,"about_ca_system_score_codex":0.00020318551,"about_ca_system_score_gemma":0.000304271,"threshold_uncertainty_score":0.46764833},"labels":[],"label_agreement":null},{"id":"W2286284940","doi":"10.1016/j.ins.2016.01.004","title":"Vehicle detection from highway satellite images via transfer learning","year":2016,"lang":"en","type":"article","venue":"Information Sciences","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Transfer of learning; Detector; Artificial intelligence; Satellite; Aerial image; Computer vision; Domain (mathematical analysis); Key (lock); Coding (social sciences); Image (mathematics); Pattern recognition (psychology); Remote sensing; Real-time computing; Telecommunications","score_opus":0.015231242864811846,"score_gpt":0.23000025457700823,"score_spread":0.2147690117121964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286284940","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.07335846,0.00003374888,0.92008114,0.00094125554,0.0003140874,0.00006530282,0.0000013244,0.000280776,0.004923918],"genre_scores_gemma":[0.9925765,0.000031122385,0.0068483977,0.00036774157,0.000034106306,0.0000068737327,0.0000014037967,0.0000022088045,0.00013167181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875283,0.00008338461,0.0002918411,0.0001813191,0.000468765,0.00022186499],"domain_scores_gemma":[0.9993933,0.00020398568,0.0000880988,0.00014558848,0.00009403432,0.000075036194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006532943,0.000093690265,0.00008307024,0.00018920431,0.00053852634,0.00069584145,0.0004890332,0.00004300065,0.00008249619],"category_scores_gemma":[0.00008984915,0.000062896324,0.000042397376,0.00053373666,0.00017075289,0.007050145,0.000049122278,0.00008673358,0.0007408775],"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.0000034432715,0.000003990378,0.00058474304,0.0000017181825,0.000002890147,3.5078557e-7,0.0020658714,0.00083658024,0.029223647,0.0033798825,0.0000124342005,0.9638845],"study_design_scores_gemma":[0.0016091316,0.0003614042,0.066089466,0.00008601291,0.000008108557,0.00001649133,0.0012999407,0.384768,0.2589144,0.0074065807,0.27865756,0.00078288146],"about_ca_topic_score_codex":0.0000719492,"about_ca_topic_score_gemma":0.0000108576905,"teacher_disagreement_score":0.96310157,"about_ca_system_score_codex":0.000032553846,"about_ca_system_score_gemma":0.000049958453,"threshold_uncertainty_score":0.95227283},"labels":[],"label_agreement":null},{"id":"W2345960756","doi":"10.1016/j.ins.2016.04.030","title":"Multiobjective and multiattribute decision making in a fuzzy environment and their power engineering applications","year":2016,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Companhia Energética de Minas Gerais; Fundação de Amparo à Pesquisa do Estado de Minas Gerais","keywords":"Generalization; Mathematical optimization; Fuzzy logic; Scheme (mathematics); Computer science; Fuzzy set; Preference; Multi-objective optimization; Set (abstract data type); Stochastic game; Mathematics; Operations research; Management science; Artificial intelligence; Mathematical economics; Engineering","score_opus":0.05008706050285229,"score_gpt":0.34644579308378726,"score_spread":0.296358732580935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345960756","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.31830758,0.00010555034,0.68029726,0.00028950674,0.00010870789,0.00036666647,0.000032119104,0.00002957931,0.0004630047],"genre_scores_gemma":[0.9727582,0.000040649975,0.02698035,0.00013287539,0.000013999551,0.000059008344,4.423442e-7,0.0000037900547,0.000010704025],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99752915,0.00006131134,0.0008293501,0.0003949554,0.0009078049,0.0002774395],"domain_scores_gemma":[0.99587303,0.0033240423,0.00028568963,0.0003102426,0.00011288866,0.00009409458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035638157,0.00016642826,0.00021569325,0.0009268061,0.0002593261,0.0006059243,0.00046471047,0.00007164641,0.00008606694],"category_scores_gemma":[0.002329482,0.00009290989,0.000035827765,0.0007334336,0.0002548373,0.0034497655,0.00028109615,0.000077541044,0.00016442567],"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.000024701018,0.000014063883,0.01825408,0.000002767151,0.0000032890887,6.244489e-7,0.0035087,0.001782938,0.0033944135,0.0017467978,0.000054359847,0.9712133],"study_design_scores_gemma":[0.0025985416,0.00015545543,0.6689798,0.00039723836,0.000005228904,0.00006454234,0.00846374,0.19796431,0.0014414091,0.05432692,0.06474555,0.0008572508],"about_ca_topic_score_codex":0.0000069758876,"about_ca_topic_score_gemma":0.000007844701,"teacher_disagreement_score":0.970356,"about_ca_system_score_codex":0.00007468978,"about_ca_system_score_gemma":0.000032891166,"threshold_uncertainty_score":0.58429414},"labels":[],"label_agreement":null},{"id":"W2348670756","doi":"","title":"Comparative Research on the International Information Industry Based on WIOD Data","year":2016,"lang":"en","type":"article","venue":"Information Sciences","topic":"Regional Economic and Spatial Analysis","field":"Economics, Econometrics and Finance","cited_by":0,"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":"","keywords":"Information industry; China; German; Process (computing); Computer science; Value (mathematics); Operations research; Business; Industrial organization; Regional science; Economy; Geography; Engineering; Economics","score_opus":0.48490851850692707,"score_gpt":0.3868168930708881,"score_spread":0.09809162543603894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2348670756","genre_codex":"other","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.12032511,0.000010451735,0.01563199,0.12748611,0.0006250722,0.00031055917,0.00076978386,0.000034606877,0.7348063],"genre_scores_gemma":[0.99620795,0.000012219215,0.00008506676,0.0033573133,0.000056493478,0.000016563085,0.00005186408,0.0000010416319,0.00021149608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989774,0.00002514107,0.0004837043,0.00014207656,0.00021513694,0.00015654456],"domain_scores_gemma":[0.99872476,0.00045812535,0.000306892,0.0003648392,0.00010505299,0.00004031562],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0029289569,0.00007024831,0.000120086486,0.0005357682,0.00034636797,0.0003773144,0.0011629645,0.00006690474,0.00093446363],"category_scores_gemma":[0.00045940818,0.00004067423,0.00003350211,0.00041681252,0.00029762462,0.003998841,0.00011520419,0.00016701932,0.0059969244],"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.000036831967,0.000028436567,0.0074008,0.000002310988,0.000024992243,7.686394e-8,0.0006252994,0.0052204896,0.0000013885569,0.907278,0.071209125,0.00817226],"study_design_scores_gemma":[0.00037743198,0.00013549159,0.013244906,0.000033797816,0.0000011950353,5.4951227e-7,0.0012787296,0.34086493,0.000078705154,0.015885739,0.6279427,0.0001558343],"about_ca_topic_score_codex":0.00015854723,"about_ca_topic_score_gemma":0.000015906868,"teacher_disagreement_score":0.89139223,"about_ca_system_score_codex":0.00010373586,"about_ca_system_score_gemma":0.00008048684,"threshold_uncertainty_score":0.99997884},"labels":[],"label_agreement":null},{"id":"W2362131317","doi":"","title":"Research on Methods of Concepts Acquisition in Domain Ontology Construction","year":2009,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Computational Techniques and Applications","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":"Discovery Air (Canada)","funders":"","keywords":"Ontology; Process ontology; Computer science; Suggested Upper Merged Ontology; Domain (mathematical analysis); Upper ontology; Ontology-based data integration; Construct (python library); Adaptability; Ontology alignment; Information retrieval; Ontology Inference Layer; OWL-S; Mathematics; Semantic Web; Programming language; Epistemology","score_opus":0.0876631567724518,"score_gpt":0.5225605135456438,"score_spread":0.434897356773192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2362131317","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.01758138,0.000008628312,0.9602463,0.002517858,0.000049197937,0.00015055432,0.0000010113828,0.000048277438,0.019396788],"genre_scores_gemma":[0.5267551,0.000003985741,0.47288924,0.0003314102,0.0000056315084,0.000011108313,0.0000013372919,2.9171497e-7,0.0000018833783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892485,0.0001385731,0.0003102175,0.00012589328,0.00035484036,0.00014563327],"domain_scores_gemma":[0.99923706,0.00025739992,0.0001356794,0.00015209462,0.00019216334,0.000025616731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017141511,0.000047470967,0.00008249443,0.0004891076,0.00015029935,0.00006171954,0.00045751882,0.000039279184,0.0000057634993],"category_scores_gemma":[0.000040406885,0.000042023523,0.000018450353,0.0014937705,0.0002561166,0.0015068852,0.000038029466,0.000097625154,0.0000134597285],"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.00000216406,0.000011073364,0.000019492667,0.0000010678451,2.443855e-7,7.507674e-8,0.00034388163,0.0029250626,0.0003058902,0.81321067,0.000042246334,0.18313815],"study_design_scores_gemma":[0.00017059935,0.00033721366,0.008106921,0.000023884033,2.498871e-7,0.000012143345,0.00057841314,0.043055233,0.009727072,0.9345658,0.003343476,0.00007902327],"about_ca_topic_score_codex":0.000008671266,"about_ca_topic_score_gemma":0.0000012492396,"teacher_disagreement_score":0.5091737,"about_ca_system_score_codex":0.000046364017,"about_ca_system_score_gemma":0.00007850924,"threshold_uncertainty_score":0.17136696},"labels":[],"label_agreement":null},{"id":"W2364946275","doi":"","title":"Visually Mining the Research Fields of the American Information-related Research Institutions——Taking Engineering Technical Area as An Example","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Computational Techniques and Applications","field":"Computer Science","cited_by":0,"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":"","keywords":"Focus (optics); Institution; Quarter (Canadian coin); Computer science; Cluster (spacecraft); Field (mathematics); Data science; Knowledge management; Library science; Sociology; Social science; Geography; Mathematics","score_opus":0.20662725401690274,"score_gpt":0.45251076561385317,"score_spread":0.24588351159695043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2364946275","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.14454675,0.000003525215,0.84039503,0.0034179164,0.000076172524,0.0003312464,0.0000012134278,0.00013374841,0.011094405],"genre_scores_gemma":[0.9622644,0.0000033979327,0.037186753,0.0004385363,0.00001559911,0.00008054991,0.0000028984298,0.0000014909594,0.000006348686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782646,0.00014468194,0.0004447679,0.00013462026,0.0011755876,0.00027390206],"domain_scores_gemma":[0.99733263,0.0011247161,0.00029655886,0.0005121121,0.000680139,0.00005383547],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004432717,0.0000726634,0.000086663895,0.000392942,0.0013204857,0.00045044953,0.0020878578,0.000039720493,0.000004181381],"category_scores_gemma":[0.0011995519,0.00004544143,0.000035916535,0.0038911703,0.0008116787,0.0037462793,0.00048345228,0.00034476447,0.000023129323],"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.0000012506738,0.000010147505,0.00010450129,0.000004779825,0.0000014653563,2.9056547e-8,0.0022086285,0.045498364,0.00008356392,0.91491634,0.00020229409,0.036968667],"study_design_scores_gemma":[0.00011767096,0.00028294962,0.013982672,0.000058638234,0.0000016026535,0.000025761168,0.001563786,0.8775324,0.0011696747,0.054621704,0.050482888,0.00016020334],"about_ca_topic_score_codex":0.00038609703,"about_ca_topic_score_gemma":0.00002152718,"teacher_disagreement_score":0.8602946,"about_ca_system_score_codex":0.000051629446,"about_ca_system_score_gemma":0.00030975178,"threshold_uncertainty_score":0.9999797},"labels":[],"label_agreement":null},{"id":"W2377642427","doi":"","title":"On the Confirmation Standard of Database's Originality","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Law, AI, and Intellectual Property","field":"Computer Science","cited_by":0,"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":"","keywords":"Originality; Database; China; Intellectual property; Value (mathematics); Computer science; Information retrieval; Political science; Law","score_opus":0.04510498072127376,"score_gpt":0.2699986028233705,"score_spread":0.22489362210209676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2377642427","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.064740635,0.000010695673,0.7994099,0.006568862,0.0003757234,0.00036857955,0.000011550677,0.000072345676,0.12844168],"genre_scores_gemma":[0.9961656,0.000007223996,0.0020110786,0.0017492293,0.000009451784,0.000010928017,0.0000022099948,5.4439636e-7,0.000043764452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890816,0.00005418339,0.00027167323,0.000079828846,0.000565453,0.000120696655],"domain_scores_gemma":[0.9990523,0.00023207892,0.0001556981,0.00027554692,0.00025338057,0.00003098146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010230871,0.000056451572,0.00007126224,0.00007498533,0.00025070092,0.0004060386,0.0008499843,0.000017110016,0.00043627937],"category_scores_gemma":[0.00031753563,0.000028248913,0.000023075681,0.00045557978,0.00035371963,0.0070678517,0.00008302457,0.000052929707,0.00055846997],"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.00000423574,0.000008431967,0.00003160776,0.000010165729,0.0000026113078,2.1512408e-8,0.002482859,0.00011175858,0.00018265692,0.9391802,0.03474849,0.023236979],"study_design_scores_gemma":[0.0003836229,0.0009978056,0.0011790514,0.000082480765,0.0000036833499,0.000007980711,0.0015516516,0.6753545,0.053579893,0.092622414,0.173894,0.00034295672],"about_ca_topic_score_codex":0.00016898422,"about_ca_topic_score_gemma":0.0000029643588,"teacher_disagreement_score":0.9314249,"about_ca_system_score_codex":0.000016995164,"about_ca_system_score_gemma":0.0001060322,"threshold_uncertainty_score":0.7178188},"labels":[],"label_agreement":null},{"id":"W2391840653","doi":"","title":"Concept,Research Progress and Trend of Online Privacy","year":2010,"lang":"en","type":"article","venue":"Information Sciences","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","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":"Carleton University","funders":"","keywords":"Computer science; Trend analysis; Internet privacy; Information privacy; Data science","score_opus":0.0883656047195477,"score_gpt":0.4326262802301341,"score_spread":0.3442606755105864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2391840653","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.97991216,0.000086808206,0.00016746258,0.004491081,0.0004082662,0.0003185026,0.000049733673,0.00004898451,0.01451697],"genre_scores_gemma":[0.9981491,0.00005330374,0.001598248,0.000046326477,0.000104697574,0.0000084842395,0.000012736724,9.052126e-7,0.000026172462],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986359,0.000091457136,0.00021775997,0.00009198827,0.0007480964,0.00021480076],"domain_scores_gemma":[0.999335,0.00012527811,0.00011869144,0.00013991052,0.00019868671,0.000082454455],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026631542,0.000045107037,0.00007209184,0.00023537358,0.0008290604,0.00025540456,0.00055053807,0.000066352724,0.00009202493],"category_scores_gemma":[0.0014353979,0.000036957965,0.000014690028,0.00074489764,0.00284603,0.003127693,0.00019391137,0.00017975023,0.00001180321],"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.000018383358,0.00011714925,0.019433973,0.00004445415,0.0000061057094,3.0882134e-7,0.1369242,0.000002844745,0.00052727415,0.1760444,0.00330616,0.66357476],"study_design_scores_gemma":[0.00073821243,0.0003575817,0.0766765,0.00004731405,0.000006826347,0.0000065949434,0.056303818,0.0021939029,0.00333693,0.03916967,0.82084125,0.00032141],"about_ca_topic_score_codex":0.0013243734,"about_ca_topic_score_gemma":0.0016987367,"teacher_disagreement_score":0.8175351,"about_ca_system_score_codex":0.000011201679,"about_ca_system_score_gemma":0.00024494174,"threshold_uncertainty_score":0.9998677},"labels":[],"label_agreement":null},{"id":"W2392669639","doi":"","title":"Comparative Study on the Library Macro-management System between China and Foreign Countries","year":2010,"lang":"en","type":"article","venue":"Information Sciences","topic":"Library Science and Administration","field":"Social Sciences","cited_by":0,"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":"","keywords":"Unitary state; China; Soviet union; Political science; Macro; Public administration; Management system; International trade; Business; Law; Economics; Operations management; Computer science","score_opus":0.04209521673015513,"score_gpt":0.3205995016059906,"score_spread":0.27850428487583545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2392669639","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.6765119,0.0000019140198,0.000055334483,0.0025687614,0.00013328149,0.00046371727,0.000007794126,0.0000646336,0.3201927],"genre_scores_gemma":[0.9992009,0.000004147733,0.00013827826,0.00032322502,0.00008966633,0.000022217495,0.000003819437,9.800375e-7,0.00021676069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99872315,0.00009588562,0.00021917206,0.000115923845,0.00066621107,0.00017964184],"domain_scores_gemma":[0.99947155,0.00018368346,0.00013951719,0.000112624475,0.000022636023,0.000069964815],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013919227,0.0000760956,0.00008986989,0.00010500455,0.0020675273,0.0014631653,0.00048026576,0.000029113271,0.000083707186],"category_scores_gemma":[0.000024851004,0.000045214,0.000016132852,0.0005319661,0.0008726679,0.0074264845,0.000059974624,0.00009719912,0.00010422021],"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.0000039894185,0.000012612933,0.08463106,0.00000642992,0.000006090738,4.237014e-7,0.054110732,0.0000058626447,0.000001838753,0.85818505,0.0016046208,0.0014312676],"study_design_scores_gemma":[0.00017840533,0.00025974866,0.44084245,0.000020401789,0.0000097677,8.9660017e-7,0.45908597,0.0003737567,0.0003009374,0.0044727447,0.09428132,0.00017360995],"about_ca_topic_score_codex":0.00008629981,"about_ca_topic_score_gemma":0.000042206437,"teacher_disagreement_score":0.8537123,"about_ca_system_score_codex":0.000007820078,"about_ca_system_score_gemma":0.0001209049,"threshold_uncertainty_score":0.9995734},"labels":[],"label_agreement":null},{"id":"W2394175907","doi":"","title":"Development Strategy for Libraries——Taking York University Canada As Example","year":2010,"lang":"en","type":"article","venue":"Information Sciences","topic":"Library Science and Information Literacy","field":"Social Sciences","cited_by":0,"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":"","keywords":"Library science; Context (archaeology); Academic library; Plan (archaeology); Sociology; Management; Computer science; Engineering management; Political science; Engineering; History; Archaeology; Economics","score_opus":0.06133050441603446,"score_gpt":0.28119165223380843,"score_spread":0.21986114781777397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394175907","genre_codex":"other","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.44575137,0.0000060686248,0.002147277,0.0032828418,0.0015254597,0.0004789797,0.000022814966,0.00014192422,0.54664326],"genre_scores_gemma":[0.9847623,0.000002046037,0.010426998,0.0030779357,0.00008945252,0.0000046006703,0.000028004397,0.0000014511741,0.0016071917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868,0.00002098813,0.00026930086,0.00009945206,0.00061257096,0.00031772043],"domain_scores_gemma":[0.9992142,0.00014701049,0.0002664358,0.000091916634,0.00012558562,0.00015486972],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00095577096,0.00007303058,0.00006988194,0.00014187416,0.0024033561,0.00084738835,0.0006768708,0.00005109041,0.00077185966],"category_scores_gemma":[0.00022811921,0.00006692688,0.00002238171,0.00076531345,0.00036579528,0.031225318,0.000044157383,0.00008336333,0.00006730239],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008595224,0.0000049177984,0.001008278,0.000008385042,0.000002372081,1.939926e-7,0.033638876,0.00013592164,0.000012209578,0.90467894,0.008240216,0.05226111],"study_design_scores_gemma":[0.00009345444,0.000015780524,0.0020913659,0.0000033305582,8.1083056e-7,6.25068e-7,0.03609612,0.0005351257,0.0002461914,0.0007170962,0.96008843,0.00011169201],"about_ca_topic_score_codex":0.26421112,"about_ca_topic_score_gemma":0.18021001,"teacher_disagreement_score":0.9518482,"about_ca_system_score_codex":0.000057328645,"about_ca_system_score_gemma":0.0074423957,"threshold_uncertainty_score":0.9988954},"labels":[],"label_agreement":null},{"id":"W2528081940","doi":"10.1016/j.ins.2016.09.020","title":"Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms","year":2016,"lang":"en","type":"article","venue":"Information Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Cloud computing; Encryption; Publication; Ciphertext; Overhead (engineering); Access control; Outsourcing; Service provider; Key (lock); Service (business); Internet privacy; Business","score_opus":0.10411020251660254,"score_gpt":0.2978934404222975,"score_spread":0.19378323790569496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528081940","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.038715668,0.000019666568,0.9320621,0.02040986,0.0011983528,0.00027817092,0.00037762008,0.000405856,0.0065327217],"genre_scores_gemma":[0.94660115,0.000020698166,0.040693864,0.012226242,0.00016911392,0.000020876829,0.00025414018,0.0000051319525,0.000008754397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974975,0.000032700864,0.0004777244,0.0004266379,0.0011059835,0.00045947163],"domain_scores_gemma":[0.99658924,0.00052924216,0.0002836738,0.0021799197,0.00024784438,0.00017005733],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0022029697,0.00017254088,0.00014544665,0.00040931208,0.00055510143,0.0016896909,0.008652589,0.00007618445,0.000108648004],"category_scores_gemma":[0.0009772843,0.000104780534,0.000044635286,0.0023309179,0.00015280844,0.036424816,0.0022510735,0.00011816352,0.00040494028],"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.00006026259,0.00016935491,0.010041303,0.00010781423,0.000025930442,0.000003774877,0.0036053897,0.00038094126,0.0001615654,0.59654546,0.20301977,0.18587846],"study_design_scores_gemma":[0.0016339885,0.00026082125,0.014571584,0.00025151452,0.000007791695,0.000013245036,0.00043846254,0.2566127,0.0021290507,0.03470694,0.68855053,0.00082338706],"about_ca_topic_score_codex":0.00011030342,"about_ca_topic_score_gemma":0.00007404737,"teacher_disagreement_score":0.9078855,"about_ca_system_score_codex":0.000032796524,"about_ca_system_score_gemma":0.00025294741,"threshold_uncertainty_score":0.9993467},"labels":[],"label_agreement":null},{"id":"W2557776595","doi":"10.1016/j.ins.2016.11.024","title":"Grouping granular structures in human granulation intelligence","year":2016,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Granular computing; Granulation; Computer science; Convergence (economics); Artificial intelligence; Rough set; Engineering","score_opus":0.03444802649209121,"score_gpt":0.28805946464808596,"score_spread":0.25361143815599474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557776595","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.069232404,0.000022801507,0.91965425,0.0011324169,0.00023355069,0.00010996903,9.867654e-7,0.00008706125,0.009526534],"genre_scores_gemma":[0.9843858,0.000011715939,0.015232854,0.00033610486,0.000022322094,0.0000052158425,9.658617e-7,8.407981e-7,0.0000041709127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888736,0.000032970685,0.00034018475,0.00014697203,0.00037329888,0.00021919048],"domain_scores_gemma":[0.9995327,0.000060253016,0.00012575676,0.00019716765,0.00004647983,0.00003761858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072311977,0.00007866797,0.000085936226,0.00030776163,0.00023959977,0.00028659956,0.0007521468,0.000035583038,0.00001603094],"category_scores_gemma":[0.000066057975,0.000046495174,0.000025132242,0.0007139686,0.00014416222,0.005548421,0.00010120455,0.000042319974,0.000048977185],"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":[8.2284936e-7,0.0000039958786,0.004806636,0.0000035338132,3.9331337e-7,5.218547e-7,0.0011499808,0.00073946675,0.00021863736,0.58941597,0.00004068931,0.40361938],"study_design_scores_gemma":[0.00046361363,0.00018748833,0.23215178,0.00009907252,0.0000015943374,0.00002042084,0.00037828882,0.086768754,0.0040238355,0.6661628,0.009241922,0.00050043693],"about_ca_topic_score_codex":0.000057987854,"about_ca_topic_score_gemma":0.000016197342,"teacher_disagreement_score":0.9151534,"about_ca_system_score_codex":0.0000313639,"about_ca_system_score_gemma":0.000029713132,"threshold_uncertainty_score":0.40224713},"labels":[],"label_agreement":null},{"id":"W2605480404","doi":"10.1016/j.ins.2017.04.032","title":"Spacecraft attitude control using two control torques","year":2017,"lang":"en","type":"article","venue":"Information Sciences","topic":"Control and Dynamics of Mobile Robots","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Control theory (sociology); Underactuation; Spacecraft; Kinematics; Attitude control; Quaternion; Lyapunov function; Singularity; Bounded function; Computer science; Mathematics; Control (management); Physics; Control engineering; Engineering; Nonlinear system; Classical mechanics; Mathematical analysis; Aerospace engineering","score_opus":0.017655368453225757,"score_gpt":0.2860447949656279,"score_spread":0.26838942651240216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605480404","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.3644027,0.00026618713,0.5814222,0.00091102463,0.002004841,0.00056054705,0.000049033988,0.00047623247,0.049907207],"genre_scores_gemma":[0.99877924,0.000011343456,0.0009012539,0.00018621086,0.000091611684,0.000010570865,0.0000011430559,0.0000035271032,0.000015112354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991883,0.000009272031,0.00023520438,0.000070836904,0.0002653502,0.0002310368],"domain_scores_gemma":[0.9994594,0.00005050786,0.000117732314,0.00023085372,0.0000737161,0.00006781056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004312976,0.00010564576,0.0001477575,0.000098766795,0.0005655501,0.00076277537,0.00041784174,0.000036133497,0.000029810226],"category_scores_gemma":[0.00009797635,0.000089767025,0.00004976371,0.0000480394,0.00016554905,0.003449037,0.000024776507,0.00006679239,0.000083887855],"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.000010240449,0.0000053717486,0.016562324,0.000019614601,0.000029476518,0.0000011383214,0.00021528325,0.9561012,0.0011396296,0.003348834,0.00016700273,0.022399899],"study_design_scores_gemma":[0.0010919689,0.00001685483,0.015456627,0.000016513219,0.000009628169,0.000004425174,0.0000336073,0.9798325,0.00004638514,0.00023771399,0.0031233171,0.0001304847],"about_ca_topic_score_codex":0.00015606871,"about_ca_topic_score_gemma":0.00009221614,"teacher_disagreement_score":0.6343765,"about_ca_system_score_codex":0.00003959702,"about_ca_system_score_gemma":0.000037641923,"threshold_uncertainty_score":0.73554605},"labels":[],"label_agreement":null},{"id":"W2609326230","doi":"10.1016/j.ins.2017.04.037","title":"Choquet based TOPSIS and TODIM for dynamic and heterogeneous decision making with criteria interaction","year":2017,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":152,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"TOPSIS; Acronym; Dynamic decision-making; Computer science; Group decision-making; Choquet integral; Multiple-criteria decision analysis; Identification (biology); Set (abstract data type); Management science; Preference; Operations research; Fuzzy logic; Artificial intelligence; Mathematics; Engineering","score_opus":0.14997180895682222,"score_gpt":0.4917454530510231,"score_spread":0.34177364409420086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609326230","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.7135849,0.000025709376,0.28343645,0.0008463819,0.0006018867,0.00037592737,0.000033393637,0.000032742762,0.0010626228],"genre_scores_gemma":[0.9405987,0.0000062430986,0.058777705,0.00052825874,0.000024605431,0.000027478565,0.0000023303323,0.000005001901,0.00002962658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973241,0.000060855742,0.000731897,0.0004197506,0.0011996733,0.00026369735],"domain_scores_gemma":[0.9961616,0.0018790554,0.0007997063,0.00059100246,0.00046745606,0.000101215715],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0036147619,0.0001766022,0.0002564273,0.00059717393,0.0017401407,0.007030819,0.0008462158,0.00007191364,0.00015050014],"category_scores_gemma":[0.0051271007,0.00010547972,0.000049052906,0.00023398516,0.0004578511,0.0067386753,0.00025266435,0.00007253436,0.00002884717],"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.0002793791,0.000010984437,0.006122805,0.00001386807,0.0000048740635,0.0000018497893,0.00089174294,0.0008598053,0.0002225447,0.00017288716,0.0004691307,0.9909501],"study_design_scores_gemma":[0.0008532341,0.00023403383,0.05051173,0.00017654568,0.000008721422,0.00008095508,0.00095955713,0.92619985,0.00027684838,0.0062911003,0.014159256,0.00024818294],"about_ca_topic_score_codex":0.000024012797,"about_ca_topic_score_gemma":0.0001337288,"teacher_disagreement_score":0.990702,"about_ca_system_score_codex":0.000037014128,"about_ca_system_score_gemma":0.0000678924,"threshold_uncertainty_score":0.99955946},"labels":[],"label_agreement":null},{"id":"W2727704006","doi":"10.1016/j.ins.2017.07.006","title":"Self managed virtual machine scheduling in Cloud systems","year":2017,"lang":"en","type":"article","venue":"Information Sciences","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Virtual machine; Cloud computing; Operating system; Scheduling (production processes); Distributed computing; NoSQL; Schedule; Execution time; Big data","score_opus":0.019421121573187344,"score_gpt":0.2602009515265663,"score_spread":0.24077982995337896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727704006","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.5555964,0.00009318077,0.36615282,0.0024801341,0.0028254797,0.00033269363,0.0000010267876,0.0003742515,0.07214402],"genre_scores_gemma":[0.99344844,0.0000043162036,0.0061728912,0.0001838864,0.00006323454,0.0000058728297,3.8489372e-7,0.0000012674445,0.0001196997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873066,0.000042086434,0.00032523304,0.00016943182,0.00048733142,0.00024524407],"domain_scores_gemma":[0.99905884,0.00004931376,0.0002883835,0.0005139666,0.000039760584,0.000049757717],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018199187,0.00009109413,0.00010834399,0.0002614005,0.0009808667,0.0023756614,0.002181854,0.00003098236,0.0000015264184],"category_scores_gemma":[0.00010084963,0.00007281495,0.000029354695,0.0002876471,0.00009899643,0.00091674615,0.00066305365,0.00010291669,0.00013395645],"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.000003012948,0.000039950035,0.005861499,0.00006473401,0.000012126463,0.000008641777,0.006757824,0.58702534,0.0000044373114,0.29123157,0.0002916824,0.10869915],"study_design_scores_gemma":[0.00021113372,0.000034105196,0.004549446,0.000038169925,9.769902e-7,0.0000051227607,0.00043705656,0.98381704,0.000010686838,0.00022689273,0.010560988,0.000108362976],"about_ca_topic_score_codex":0.00026057704,"about_ca_topic_score_gemma":0.000012847894,"teacher_disagreement_score":0.43785205,"about_ca_system_score_codex":0.000038210426,"about_ca_system_score_gemma":0.00003759255,"threshold_uncertainty_score":0.99865997},"labels":[],"label_agreement":null},{"id":"W2744510879","doi":"10.1016/j.ins.2017.08.031","title":"Information sciences 1968–2016: A retrospective analysis with text mining and bibliometric","year":2017,"lang":"en","type":"article","venue":"Information Sciences","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":227,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Citation; Data science; Computer science; Construct (python library); Salient; Citation analysis; Bibliometrics; Web of science; Information retrieval; Key (lock); Library science; Political science; MEDLINE","score_opus":0.027400149331771973,"score_gpt":0.30244255983358553,"score_spread":0.27504241050181355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744510879","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.16810186,0.00003794305,0.7873097,0.0018243078,0.00013718312,0.00022302681,0.000038634516,0.00013866108,0.042188648],"genre_scores_gemma":[0.90284467,0.000039475904,0.096813075,0.00022919745,0.000016090216,0.00002403187,0.000007335458,9.543642e-7,0.000025197716],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99840397,0.000014969403,0.00033012527,0.00019793662,0.00079448574,0.00025853986],"domain_scores_gemma":[0.998437,0.00009063361,0.00062298717,0.00050359865,0.00025221444,0.00009357893],"candidate_categories":["bibliometrics","sts","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.001508145,0.000117839045,0.0001591973,0.011053523,0.0027420514,0.006917721,0.0016629054,0.00003574304,0.000010096716],"category_scores_gemma":[0.0003142521,0.00008343613,0.000032529464,0.030303897,0.00080326403,0.028129708,0.00036234336,0.000058332596,0.000049688162],"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.0000023194382,0.000016041306,0.10050035,0.000011396468,0.000053939337,3.2300838e-7,0.0049009356,0.00045503862,0.0000054801244,0.03401365,0.0011632065,0.8588773],"study_design_scores_gemma":[0.00021554928,0.00018180376,0.5771274,0.000021055057,0.000027213762,0.000013175958,0.0012932763,0.4145515,0.000068736415,0.0005370448,0.005747304,0.00021591173],"about_ca_topic_score_codex":0.00036537935,"about_ca_topic_score_gemma":0.000040421397,"teacher_disagreement_score":0.8586614,"about_ca_system_score_codex":0.000026747164,"about_ca_system_score_gemma":0.000176439,"threshold_uncertainty_score":0.99855626},"labels":[],"label_agreement":null},{"id":"W2754003965","doi":"10.1016/j.ins.2017.09.046","title":"Design of a pharmaceutical supply chain network under uncertainty considering perishability and substitutability of products","year":2017,"lang":"en","type":"article","venue":"Information Sciences","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":143,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Perishability; Supply chain; Computer science; Supply chain network; Mathematical optimization; Operations research; Network planning and design; Supply chain management; Business; Mathematics; Marketing","score_opus":0.0621638714540392,"score_gpt":0.2955446104975568,"score_spread":0.2333807390435176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754003965","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.97735566,0.000057377707,0.014084312,0.0032070908,0.00031906046,0.0009842903,0.0000023270634,0.000044403307,0.003945499],"genre_scores_gemma":[0.9979917,0.000006864557,0.0016136294,0.00028195302,0.00007902326,0.000016305019,0.000002323666,0.0000022710046,0.0000059435088],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987444,0.000024075658,0.00043016457,0.00017115028,0.0003810799,0.00024912675],"domain_scores_gemma":[0.9986218,0.00012991983,0.00053069455,0.00032277417,0.00038174327,0.00001303227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003528612,0.000106937245,0.00018797956,0.00014021114,0.00052912347,0.00043384795,0.00038621016,0.000031087275,0.00006786153],"category_scores_gemma":[0.0014040145,0.00009047393,0.000024242792,0.00031146375,0.0012756449,0.00448392,0.00035257192,0.000060560815,0.0000049758632],"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.00017893252,0.00008963849,0.44500592,0.0026010147,0.00004264511,0.0000013986898,0.0013364287,0.44112462,0.000250242,0.08443443,0.0009668018,0.02396793],"study_design_scores_gemma":[0.0011791824,0.00005200175,0.3063308,0.00013953369,0.000062122854,0.000002384868,0.008420036,0.6424236,0.00068307895,0.02934739,0.010935028,0.00042478245],"about_ca_topic_score_codex":0.00068950036,"about_ca_topic_score_gemma":0.000022208975,"teacher_disagreement_score":0.20129903,"about_ca_system_score_codex":0.00003057785,"about_ca_system_score_gemma":0.00009754857,"threshold_uncertainty_score":0.47001666},"labels":[],"label_agreement":null},{"id":"W2758653053","doi":"10.1016/j.ins.2017.09.056","title":"Functions defined on a set of Z-numbers","year":2017,"lang":"en","type":"article","venue":"Information Sciences","topic":"Fuzzy Systems and Optimization","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Fuzzy number; Basis (linear algebra); Real number; Fuzzy set; Expected value; Fuzzy logic; Extension (predicate logic); Interval (graph theory); Class (philosophy); Discrete mathematics; Constraint (computer-aided design); Set (abstract data type); Variable (mathematics); Computer science; Combinatorics; Statistics; Artificial intelligence","score_opus":0.12645422345873192,"score_gpt":0.36542556876442767,"score_spread":0.23897134530569575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758653053","genre_codex":"other","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.3788539,0.0000036842382,0.016599085,0.0012147243,0.0008184334,0.00029784514,0.00006033114,0.00006889525,0.6020831],"genre_scores_gemma":[0.9966274,0.0000014761622,0.0029605157,0.000048609018,0.00002220652,0.00000609723,0.0000038033659,0.0000012282768,0.0003286452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939305,0.000009289057,0.0002259641,0.00004292921,0.0002580855,0.000070701055],"domain_scores_gemma":[0.9992336,0.00007819708,0.00037083103,0.00020479885,0.00009187199,0.00002072589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000457148,0.000041726747,0.00007192106,0.000085860775,0.0004479168,0.00015166457,0.00019580896,0.000025992218,0.000048707872],"category_scores_gemma":[0.0006898258,0.00003093081,0.00002658132,0.00008364607,0.00012222331,0.0012790732,0.000022197959,0.000024390954,0.00006676817],"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.000044581255,0.00006380268,0.012343963,0.0002820776,0.000033805223,3.853824e-7,0.011617615,0.008934655,0.000085605156,0.86516315,0.073989384,0.027440973],"study_design_scores_gemma":[0.006471108,0.0023593996,0.10164609,0.0014575024,0.00014731666,0.000060277536,0.035962198,0.2882208,0.0077435724,0.30507925,0.2487812,0.0020713068],"about_ca_topic_score_codex":0.000098487435,"about_ca_topic_score_gemma":0.000029766166,"teacher_disagreement_score":0.61777353,"about_ca_system_score_codex":0.000010238644,"about_ca_system_score_gemma":0.00003974178,"threshold_uncertainty_score":0.34450594},"labels":[],"label_agreement":null},{"id":"W2768421170","doi":"10.1016/j.ins.2017.11.041","title":"Automatic feature engineering for regression models with machine learning: An evolutionary computation and statistics hybrid","year":2017,"lang":"en","type":"article","venue":"Information Sciences","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Universal","keywords":"Genetic programming; Computer science; Feature engineering; Symbolic regression; Interpretability; Machine learning; Artificial intelligence; Randomness; Feature (linguistics); Benchmark (surveying); Evolutionary computation; Regression; Data mining; Statistics; Mathematics; Deep learning","score_opus":0.019995423766872505,"score_gpt":0.2768263841359542,"score_spread":0.25683096036908165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768421170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008164526,0.00004330667,0.990256,0.0009204172,0.000064844426,0.0002156462,0.000034111836,0.00011684362,0.00018431494],"genre_scores_gemma":[0.38080502,0.000009115023,0.6190384,0.00003342523,0.000015372903,0.000029072113,0.000046460165,0.0000018849113,0.000021275422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992617,0.000011868541,0.00015373484,0.00015359913,0.00027770924,0.00014141819],"domain_scores_gemma":[0.99926263,0.00007774688,0.00023890445,0.00018922858,0.00016164401,0.00006983548],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00028972785,0.00009182981,0.00008161336,0.00010454355,0.001543971,0.00066976144,0.00043588856,0.000023933462,0.0000011563783],"category_scores_gemma":[0.000056254932,0.00006872068,0.0000113447195,0.000100176985,0.00012338914,0.006802212,0.00008816165,0.00007427437,0.0000026734642],"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.0000073494557,0.000039635062,0.00084198255,0.00007821299,0.000009959135,9.2517234e-7,0.0012818439,0.43419242,0.00003480272,0.32042557,0.0012561763,0.24183111],"study_design_scores_gemma":[0.00020481013,0.00013125387,0.006492174,0.000026811067,0.0000029118191,0.00003231605,0.000046057692,0.9808126,0.000018911072,0.011136012,0.0009889588,0.0001071616],"about_ca_topic_score_codex":0.000024929634,"about_ca_topic_score_gemma":0.0000024185867,"teacher_disagreement_score":0.5466202,"about_ca_system_score_codex":0.000021154812,"about_ca_system_score_gemma":0.00007771754,"threshold_uncertainty_score":0.99975586},"labels":[],"label_agreement":null},{"id":"W2770308584","doi":"10.1016/j.ins.2017.11.027","title":"JPEG based steganography methods using Cohort Intelligence with Cognitive Computing and modified Multi Random Start Local Search optimization algorithms","year":2017,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Steganography; JPEG; Computer science; Algorithm; Optimization problem; Distortion (music); Steganography tools; Artificial intelligence; Image quality; Data compression; Image (mathematics)","score_opus":0.07461330641246706,"score_gpt":0.38285273415446935,"score_spread":0.3082394277420023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770308584","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009209819,0.000024162558,0.9894837,0.000062072,0.00010294564,0.0004497895,0.000004002481,0.00017753655,0.00048597745],"genre_scores_gemma":[0.49674195,0.000008785582,0.5031521,0.00008081521,0.00000543843,0.0000057904754,0.0000025046947,0.0000020275274,6.1497985e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983153,0.00017054094,0.00037030128,0.00031433592,0.0005079424,0.0003216002],"domain_scores_gemma":[0.9985615,0.0002801695,0.0003746347,0.0003303453,0.0003544975,0.00009884691],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024605023,0.00017888405,0.0002094599,0.00046937529,0.0019181204,0.001541228,0.00088429573,0.00006463758,0.0000013888231],"category_scores_gemma":[0.00009106552,0.00013694323,0.000046178433,0.00059680775,0.0012543746,0.006328423,0.0002558996,0.00015449992,6.291554e-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.000057563528,0.00002381781,0.008660422,0.000029120789,0.000021095031,0.0000022588847,0.0019871662,0.57136995,0.000022726783,0.0012559406,9.074579e-7,0.416569],"study_design_scores_gemma":[0.00052189763,0.00011645594,0.002089512,0.00012330955,0.000009176753,0.000012396313,0.00039579062,0.9889901,0.007211251,0.00030670283,0.00001020265,0.00021317546],"about_ca_topic_score_codex":0.00012352019,"about_ca_topic_score_gemma":0.0000038052824,"teacher_disagreement_score":0.48753214,"about_ca_system_score_codex":0.000020980264,"about_ca_system_score_gemma":0.00011401232,"threshold_uncertainty_score":0.99949527},"labels":[],"label_agreement":null},{"id":"W2772233373","doi":"10.1016/j.ins.2017.11.054","title":"Fifty years of Information Sciences: A bibliometric overview","year":2017,"lang":"en","type":"article","venue":"Information Sciences","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":338,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Citation; Library science; Web of science; Bibliographic coupling; Bibliometrics; Computer science; Citation analysis; Data science; Information science; Co-citation; Diversity (politics); Visualization; Work (physics); Order (exchange); Information retrieval; World Wide Web; Political science; MEDLINE; Data mining; Business; Engineering","score_opus":0.20654035229469114,"score_gpt":0.3728195494983468,"score_spread":0.16627919720365564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772233373","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.59962004,0.0003244534,0.01802078,0.0022501915,0.0026201576,0.00061647355,0.00005375614,0.00018199407,0.37631217],"genre_scores_gemma":[0.9982435,0.00011905256,0.000459054,0.0010494532,0.000091971895,0.0000057270768,0.000016553022,0.0000012963172,0.000013403899],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984883,0.0000032407127,0.0004369579,0.00008904017,0.0007844052,0.00019804014],"domain_scores_gemma":[0.9983914,0.000039403374,0.00094613264,0.00028443776,0.0003283779,0.000010277949],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0015309993,0.000085067484,0.00012277008,0.008806841,0.0008008147,0.0029060428,0.001351454,0.000043101954,0.00027219128],"category_scores_gemma":[0.0012924711,0.00006980293,0.0000420922,0.01472535,0.0006625642,0.049432613,0.0003387975,0.000051238563,0.000978006],"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.0000075779594,0.000019476087,0.030377407,0.00031039285,0.000004792105,1.88942e-7,0.00018957254,0.0003111612,0.000015110147,0.07537114,0.0066737616,0.8867194],"study_design_scores_gemma":[0.00022264058,0.000022606273,0.43707952,0.00015139933,0.0000121705,0.00000262935,0.00048801964,0.02276612,0.00014804411,0.004251517,0.5346151,0.00024025665],"about_ca_topic_score_codex":0.0017099489,"about_ca_topic_score_gemma":0.000028841108,"teacher_disagreement_score":0.88647914,"about_ca_system_score_codex":0.000009349087,"about_ca_system_score_gemma":0.000076180506,"threshold_uncertainty_score":0.99979985},"labels":[],"label_agreement":null},{"id":"W2789477730","doi":"10.1016/j.ins.2018.02.004","title":"An HMM framework based on spherical-linear features for online cursive handwriting recognition","year":2018,"lang":"en","type":"article","venue":"Information Sciences","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Hidden Markov model; Computer science; Pattern recognition (psychology); Artificial intelligence; Speech recognition; Handwriting recognition; Word recognition; Word (group theory); Segmentation; Feature extraction; Handwriting; Mathematics","score_opus":0.0405701509676921,"score_gpt":0.34248694570304106,"score_spread":0.30191679473534894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789477730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009805114,0.0000046363125,0.9845203,0.0013883339,0.0003412787,0.00040079022,0.00005745381,0.00050125684,0.0029808045],"genre_scores_gemma":[0.29617143,0.0000033048761,0.69755256,0.0058662714,0.00026655392,0.000060849143,0.00006680044,0.0000042684555,0.000007945397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839497,0.000066515546,0.00038598213,0.00028947892,0.0005443971,0.00031863252],"domain_scores_gemma":[0.9982157,0.00038826777,0.0002700181,0.00031254775,0.0006963278,0.00011718206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009166403,0.00015277402,0.00014202172,0.00029367078,0.0006445262,0.00065233745,0.00086385134,0.00012255184,0.00006375474],"category_scores_gemma":[0.0007612127,0.00012992122,0.00006729146,0.0009306082,0.00030038692,0.004303298,0.000046878693,0.00015066721,0.00014625002],"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.00003140399,0.00011401276,0.0000808669,0.000019021049,0.0000035993721,4.3257552e-7,0.0010483155,0.00014988423,0.00021670887,0.005660589,0.0020394092,0.99063575],"study_design_scores_gemma":[0.00058806234,0.003186616,0.0014655106,0.00037165964,0.000008382113,0.0000129363925,0.00067076617,0.84934247,0.074607335,0.05765603,0.011514922,0.00057532947],"about_ca_topic_score_codex":0.00001878186,"about_ca_topic_score_gemma":0.000009891404,"teacher_disagreement_score":0.99006045,"about_ca_system_score_codex":0.00004234389,"about_ca_system_score_gemma":0.00013621323,"threshold_uncertainty_score":0.6290505},"labels":[],"label_agreement":null},{"id":"W2791239441","doi":"10.1016/j.ins.2018.03.013","title":"Modeling the speed-based vessel schedule recovery problem using evolutionary multiobjective optimization","year":2018,"lang":"en","type":"article","venue":"Information Sciences","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Larus Technologies (Canada); Wilfrid Laurier University; University of Ottawa","funders":"Ministry of Economic Affairs; Ontario Centres of Excellence","keywords":"Schedule; Computer science; Multi-objective optimization; Mathematical optimization; Scalability; Evolutionary algorithm; Pareto optimal; Pareto principle; Port (circuit theory); Benchmark (surveying); Set (abstract data type); Optimization problem; Operations research; Artificial intelligence; Mathematics; Engineering; Algorithm; Machine learning","score_opus":0.03167885742021213,"score_gpt":0.253580476244172,"score_spread":0.2219016188239599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791239441","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.0168029,0.00002611551,0.9656778,0.00006363587,0.00030694404,0.00014942844,0.000008482591,0.00011244221,0.016852282],"genre_scores_gemma":[0.91558987,0.0000057874067,0.08416669,0.00012534166,0.00008641591,0.0000039258925,0.000011788216,0.0000034282912,0.0000067480505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993339,0.000011671266,0.00022680733,0.00006121641,0.0002240115,0.00014240241],"domain_scores_gemma":[0.9996274,0.000029770545,0.000046968627,0.000084434854,0.00018745386,0.000023957382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036763833,0.000070448055,0.000053184853,0.00011248319,0.00040927742,0.0001657626,0.0001318637,0.000037350623,0.000078029916],"category_scores_gemma":[0.000066295,0.00005165797,0.000020087904,0.00034018978,0.00017303464,0.0014639909,0.000018118808,0.000059123337,0.000024947956],"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.0000019492354,0.0000026554237,0.000048225626,0.000009411642,0.0000024194353,3.6406004e-8,0.00022169584,0.99792993,0.00001473062,0.00028749538,0.00013105337,0.001350425],"study_design_scores_gemma":[0.000068957175,0.00002141819,0.00004966081,0.000018559016,0.000004312878,0.0000024063447,0.00028716706,0.9985862,0.00016271308,0.00028940922,0.00042826586,0.00008097479],"about_ca_topic_score_codex":0.00008552348,"about_ca_topic_score_gemma":0.0000047815565,"teacher_disagreement_score":0.89878696,"about_ca_system_score_codex":0.00005941671,"about_ca_system_score_gemma":0.000090901834,"threshold_uncertainty_score":0.31478724},"labels":[],"label_agreement":null},{"id":"W2794310693","doi":"10.1016/j.ins.2018.02.055","title":"BRBcast: A new approach to belief rule-based system parameter learning via extended causal strength logic","year":2018,"lang":"en","type":"article","venue":"Information Sciences","topic":"Water Systems and Optimization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Machine learning; Mathematics","score_opus":0.02331628017888007,"score_gpt":0.23268114671800008,"score_spread":0.20936486653912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794310693","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.019836772,0.000008802057,0.9344918,0.000037561276,0.00047488793,0.00022187378,0.0000024657688,0.0003653232,0.044560526],"genre_scores_gemma":[0.9744586,3.472767e-7,0.025101338,0.00008819145,0.00012202162,0.00001759742,0.000014320182,0.000005249557,0.00019237873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989738,0.000024808522,0.00032381713,0.00011314047,0.00031397247,0.00025050255],"domain_scores_gemma":[0.999598,0.000026437403,0.00007106876,0.00011750847,0.000082480954,0.00010448828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004368867,0.00011343785,0.00011791378,0.00023368055,0.00022331151,0.00032717423,0.000193737,0.000055870132,0.000023013858],"category_scores_gemma":[0.0000423133,0.00009023488,0.000025838524,0.00051888335,0.000049345428,0.0010675295,0.00002376479,0.000065487206,0.0004792829],"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.000004804431,0.000006431894,0.00017711808,0.0000809981,0.0000064324277,1.8545603e-7,0.0026886186,0.98307174,0.000042107356,0.00086949737,0.0023337582,0.010718316],"study_design_scores_gemma":[0.00016890942,0.00008142038,0.0005181311,0.000037510275,0.000003659001,0.000008013501,0.0005635474,0.9922256,0.0006950038,0.000017963754,0.005537128,0.00014312257],"about_ca_topic_score_codex":0.00010455844,"about_ca_topic_score_gemma":0.000015589398,"teacher_disagreement_score":0.9546218,"about_ca_system_score_codex":0.000058699985,"about_ca_system_score_gemma":0.000041921397,"threshold_uncertainty_score":0.6160372},"labels":[],"label_agreement":null},{"id":"W2797192234","doi":"10.1016/j.ins.2018.04.034","title":"Differential communication with distributed MPC based on occupancy grid","year":2018,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Holonomic; Scheme (mathematics); Set (abstract data type); Differential (mechanical device); Grid; Exploit; Mobile robot; Occupancy grid mapping; Frame (networking); Robot; Distributed computing; Control theory (sociology); Algorithm; Control (management); Mathematics; Artificial intelligence; Computer network","score_opus":0.007531571587302181,"score_gpt":0.22187271757206595,"score_spread":0.21434114598476375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797192234","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.017401239,0.00000845597,0.96977043,0.000102496204,0.00024885338,0.00018821718,0.000032554835,0.00028202462,0.011965745],"genre_scores_gemma":[0.9957455,0.0000033013173,0.004002295,0.00007697765,0.000047804202,0.000023066481,0.00009426073,0.0000033794965,0.0000034317484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993423,0.000016357537,0.0001987776,0.000055484692,0.0002595616,0.00012750832],"domain_scores_gemma":[0.9995474,0.000042078966,0.00007676492,0.00018930183,0.000112786096,0.000031662785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010522692,0.00008045962,0.00007344925,0.00011207084,0.00021529825,0.00012703508,0.00019903643,0.000028977323,0.0000434836],"category_scores_gemma":[0.000028640346,0.00006106531,0.000012447332,0.00037618083,0.00013622984,0.001348669,0.000009746626,0.000048697308,0.00008634201],"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.000047234495,0.000013146301,0.0013853393,0.00002507394,0.0000088133565,9.3859775e-8,0.0005349795,0.9742893,0.00011823211,0.0018093665,0.0011471079,0.020621292],"study_design_scores_gemma":[0.00034516983,0.00009211215,0.0028292618,0.000037080077,0.0000028427019,8.1580816e-7,0.00007944711,0.99206376,0.00072305504,0.00003588703,0.0036944356,0.00009614213],"about_ca_topic_score_codex":0.0000086104055,"about_ca_topic_score_gemma":0.0000131803745,"teacher_disagreement_score":0.97834426,"about_ca_system_score_codex":0.00004475022,"about_ca_system_score_gemma":0.00002085383,"threshold_uncertainty_score":0.24901709},"labels":[],"label_agreement":null},{"id":"W2809195697","doi":"10.1016/j.ins.2018.06.051","title":"Extension of neighbor-based link prediction methods for directed, weighted and temporal social networks","year":2018,"lang":"en","type":"article","venue":"Information Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Extension (predicate logic); Link (geometry); Computer science; Artificial intelligence; Social network analysis; Pattern recognition (psychology); Data mining; Mathematics; Social media; Computer network","score_opus":0.02830214709320063,"score_gpt":0.3576625848827984,"score_spread":0.3293604377895978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809195697","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.022758408,0.000013160287,0.97454953,0.00015278319,0.00008955248,0.00018158634,0.000014234565,0.00007096951,0.0021697725],"genre_scores_gemma":[0.89457375,8.2444507e-7,0.10500979,0.0000514361,0.00028732608,0.000019038205,0.00004946476,0.0000019379181,0.0000064564583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930596,0.000047504487,0.00030974206,0.00009515488,0.00012247874,0.00011914863],"domain_scores_gemma":[0.99924105,0.00011459586,0.0002642939,0.000074060124,0.0002804656,0.000025557378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081811793,0.00007043163,0.00013074915,0.00013150093,0.00034003356,0.000072436764,0.00010108239,0.000033123302,0.000047104204],"category_scores_gemma":[0.000013171443,0.000057137266,0.00005429116,0.00043030834,0.00027256945,0.00057686755,0.000028323711,0.000039687697,7.9330835e-7],"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.00003628176,0.000020013213,0.01895509,0.000009719195,0.000022700475,4.9243516e-9,0.00048063273,0.00019838936,0.00033176458,0.011809779,0.0021424685,0.96599317],"study_design_scores_gemma":[0.00019011943,0.00011376916,0.0067519452,0.000012504187,0.000018928795,8.36118e-8,0.0000977201,0.9751695,0.0022254232,0.0060670716,0.009283318,0.000069662594],"about_ca_topic_score_codex":0.0000753505,"about_ca_topic_score_gemma":0.0000028366662,"teacher_disagreement_score":0.97497106,"about_ca_system_score_codex":0.0000074718837,"about_ca_system_score_gemma":0.000041101557,"threshold_uncertainty_score":0.26152977},"labels":[],"label_agreement":null},{"id":"W2885190646","doi":"10.1016/j.ins.2018.08.029","title":"Adaptive neural networks finite-time tracking control for non-strict feedback systems via prescribed performance","year":2018,"lang":"en","type":"article","venue":"Information Sciences","topic":"Adaptive Control of Nonlinear Systems","field":"Engineering","cited_by":267,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Taishan Scholar Project of Shandong Province; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Backstepping; Settling time; Control theory (sociology); Tracking error; Computer science; Artificial neural network; Tracking (education); Nonlinear system; Controller (irrigation); Function (biology); Control (management); Adaptive control; Control engineering; Step response; Artificial intelligence; Engineering","score_opus":0.02062745231181342,"score_gpt":0.229193685971755,"score_spread":0.20856623365994156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885190646","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.032755144,0.00011825836,0.9598231,0.00003558384,0.0017257622,0.0011172794,0.00004593343,0.0002733981,0.0041055735],"genre_scores_gemma":[0.9983423,0.000003875012,0.00067276775,0.00009417941,0.0007101274,0.00010078598,0.000011901108,0.000012835728,0.000051247214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983961,0.00003658555,0.0006041847,0.00014277734,0.00036953093,0.00045084677],"domain_scores_gemma":[0.9987002,0.00041819902,0.00021419488,0.00015964604,0.0004171701,0.00009057114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096838054,0.00020616154,0.00028301644,0.00020334867,0.00034299179,0.00033857496,0.0003925014,0.00009951186,0.000012627413],"category_scores_gemma":[0.00012089616,0.00017526148,0.00007198589,0.0004380148,0.00020506108,0.0033358831,0.000021303651,0.000115777024,0.000197196],"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.00007214137,0.000004381617,0.00029505295,0.000040147468,0.000030102463,1.7300485e-7,0.00050644175,0.98185986,0.00012335906,0.000034035267,0.0009907265,0.016043598],"study_design_scores_gemma":[0.00082768727,0.0003394658,0.0019375811,0.000055040586,0.000013157504,0.000006698195,0.00021104676,0.99346864,0.00008784796,0.0000029213863,0.00283171,0.00021817966],"about_ca_topic_score_codex":0.000020187801,"about_ca_topic_score_gemma":0.0000038441453,"teacher_disagreement_score":0.96558714,"about_ca_system_score_codex":0.00007271928,"about_ca_system_score_gemma":0.000035326666,"threshold_uncertainty_score":0.7146956},"labels":[],"label_agreement":null},{"id":"W2913537485","doi":"10.1016/j.ins.2019.02.011","title":"Privacy-preserving task recommendation with win-win incentives for mobile crowdsourcing","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Higher Education Discipline Innovation Project; China Scholarship Council; Central South University; Project 211; Natural Sciences and Engineering Research Council of Canada; Hunan Provincial Science and Technology Department; National Natural Science Foundation of China","keywords":"Crowdsourcing; Computer science; Task (project management); Overhead (engineering); Encryption; Computer security; Incentive; Matching (statistics); Scheme (mathematics); Internet privacy; Cryptography; World Wide Web","score_opus":0.02129779055760724,"score_gpt":0.27955381129973694,"score_spread":0.2582560207421297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913537485","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.1533096,0.000022256743,0.8286188,0.010669617,0.000475463,0.001013849,0.000024111432,0.00063919224,0.00522709],"genre_scores_gemma":[0.6866196,0.000011005351,0.31275377,0.00040743622,0.000020174735,0.00011448298,0.000034232686,0.0000047582143,0.000034546043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982579,0.000042210802,0.0004169212,0.00037032983,0.0004950818,0.00041760367],"domain_scores_gemma":[0.99651504,0.00037173904,0.00039483423,0.0024622353,0.0002033303,0.000052852083],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014814067,0.00016179096,0.0001660118,0.00037753655,0.00042733052,0.0010185352,0.01579536,0.00007510199,0.000048797727],"category_scores_gemma":[0.0034572394,0.00012816075,0.00003942249,0.0011468395,0.00016989736,0.014755791,0.017594963,0.00013711136,0.00012784166],"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.00011379718,0.0001632265,0.050334863,0.00050604995,0.00009289788,0.0000013242958,0.011592291,0.0077886838,0.0037124695,0.019305926,0.19286501,0.71352345],"study_design_scores_gemma":[0.0007914719,0.0004629802,0.0032861624,0.00013109486,0.0000048270513,0.0000116864185,0.0017388797,0.8766998,0.0073118582,0.028392795,0.08072349,0.00044494204],"about_ca_topic_score_codex":0.000037228532,"about_ca_topic_score_gemma":0.000004978697,"teacher_disagreement_score":0.86891115,"about_ca_system_score_codex":0.00008661868,"about_ca_system_score_gemma":0.00014052876,"threshold_uncertainty_score":0.99902433},"labels":[],"label_agreement":null},{"id":"W2913797383","doi":"10.1016/j.ins.2019.02.010","title":"Let terms choose their own kernels: An intelligent approach to kernel selection for healthcare search","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"East China Normal University; National Natural Science Foundation of China; Shanghai Municipal Commission of Economy and Informatization; Natural Science Foundation of Shanghai","keywords":"Kernel (algebra); Computer science; Kernel method; Weighting; Domain (mathematical analysis); Gaussian function; Artificial intelligence; Function (biology); Machine learning; Data mining; Mathematics; Gaussian; Support vector machine; Medicine","score_opus":0.07582004723941926,"score_gpt":0.3381010568254483,"score_spread":0.262281009586029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913797383","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.29765806,0.000006415703,0.6932567,0.0013655436,0.00047368894,0.0014970937,0.000022760518,0.00019853181,0.0055212304],"genre_scores_gemma":[0.978277,0.000005782097,0.019378504,0.0019416953,0.000053470376,0.00010249822,0.000036251153,0.0000036949386,0.00020107646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786156,0.00006192506,0.0004919501,0.00026305878,0.00083728106,0.00048421117],"domain_scores_gemma":[0.9987517,0.00006441621,0.00013786535,0.00031702055,0.0004813143,0.0002476872],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020276497,0.00014915445,0.00015311975,0.00049348304,0.00048293202,0.0010923888,0.0012772122,0.000072656236,0.000019228904],"category_scores_gemma":[0.000057231926,0.00010804173,0.00006659154,0.001508758,0.00006784131,0.008305282,0.00017678119,0.0001484891,0.00045131362],"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.000046929777,0.00010730199,0.0058671283,0.00014655918,0.0000073640103,5.5036317e-8,0.041492086,0.010957357,0.00026409133,0.10069638,0.0006762508,0.8397385],"study_design_scores_gemma":[0.00034841243,0.0008605851,0.0122328745,0.00002315683,0.0000012176189,0.00001899586,0.0048992094,0.9439709,0.007269119,0.00081280223,0.029224014,0.00033867083],"about_ca_topic_score_codex":0.0001409339,"about_ca_topic_score_gemma":0.0000071042823,"teacher_disagreement_score":0.93301356,"about_ca_system_score_codex":0.00011674987,"about_ca_system_score_gemma":0.00031403766,"threshold_uncertainty_score":0.99994457},"labels":[],"label_agreement":null},{"id":"W2947081180","doi":"10.1016/j.ins.2019.05.076","title":"Min-max attribute-object bireducts: On unifying models of reducts in rough set theory","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Rough set; Decidability; Generalization; Decision table; Object (grammar); Mathematics; Set (abstract data type); Table (database); Discrete mathematics; Attribute domain; Combinatorics; Finite set; Computer science; Algorithm; Theoretical computer science; Data mining; Artificial intelligence","score_opus":0.05196371891741809,"score_gpt":0.2781637887996663,"score_spread":0.22620006988224822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947081180","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.7919329,0.00013421586,0.048059814,0.001445057,0.0011484523,0.0005179675,0.000018710405,0.000121960846,0.15662095],"genre_scores_gemma":[0.9932891,0.000017940167,0.0061800703,0.00043485189,0.00001253747,0.000004947202,0.000004050355,0.0000016038654,0.000054858043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844867,0.00007693995,0.00043982657,0.00019729434,0.00056373375,0.00027351765],"domain_scores_gemma":[0.99908704,0.00017384689,0.00024618534,0.00035370933,0.000096438074,0.000042757256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016781178,0.00011121986,0.000167858,0.00040062398,0.00010296249,0.00022301188,0.0010564085,0.000053483054,0.000015901345],"category_scores_gemma":[0.00009512461,0.00008266154,0.0000382362,0.0014921023,0.00013562839,0.005597165,0.00014697708,0.000097537544,0.00013665226],"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.000022984801,0.00006504719,0.0008796799,0.00006506682,0.000007178994,0.000001686929,0.021187572,0.21504946,0.00016185938,0.6716445,0.000661204,0.09025372],"study_design_scores_gemma":[0.0010172856,0.000775098,0.004413109,0.0002771689,0.0000038480944,0.000021105754,0.0052317013,0.8070825,0.0046724267,0.1722062,0.0036858818,0.00061372924],"about_ca_topic_score_codex":0.00008302254,"about_ca_topic_score_gemma":0.0000024621306,"teacher_disagreement_score":0.59203297,"about_ca_system_score_codex":0.000041401712,"about_ca_system_score_gemma":0.00018586032,"threshold_uncertainty_score":0.40578094},"labels":[],"label_agreement":null},{"id":"W2951945251","doi":"10.1016/j.ins.2019.06.028","title":"Functional broadcast encryption with applications to data sharing for cloud storage","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud storage; Computer network; Data sharing; Cloud computing; Computer security; Distributed computing; Operating system","score_opus":0.06645863801017185,"score_gpt":0.30029264660059096,"score_spread":0.2338340085904191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951945251","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.0077617457,0.00001352952,0.9884694,0.00047004083,0.00025774312,0.00055971014,0.00010030314,0.00009077454,0.0022767321],"genre_scores_gemma":[0.66890496,0.000006532051,0.3286644,0.0015061763,0.00017076047,0.00021905288,0.00050122716,0.0000034204434,0.000023471312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989435,0.00000648001,0.00019221143,0.00030794065,0.00038231295,0.00016757331],"domain_scores_gemma":[0.9988718,0.000065189044,0.00010315007,0.0007696207,0.00012140285,0.00006881329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008000285,0.000071312534,0.000064992215,0.00020990265,0.00031776508,0.00064422307,0.0017718569,0.000022992075,0.00003323076],"category_scores_gemma":[0.000023369023,0.00005694289,0.000017737228,0.0009837315,0.000051364907,0.007941814,0.00043038116,0.000045733406,0.00028833296],"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.000024681736,0.000033292006,0.0018038382,0.00003221184,0.0000096621525,5.560086e-8,0.001266043,0.00432833,0.0001482127,0.8855678,0.010200182,0.096585706],"study_design_scores_gemma":[0.00052664906,0.0002539689,0.010952779,0.000027807295,0.000006280606,0.000013372364,0.0005047447,0.38345936,0.00019237069,0.008495307,0.59523743,0.00032994137],"about_ca_topic_score_codex":0.000021156746,"about_ca_topic_score_gemma":0.000011459252,"teacher_disagreement_score":0.87707245,"about_ca_system_score_codex":0.000015807182,"about_ca_system_score_gemma":0.00008586588,"threshold_uncertainty_score":0.6212258},"labels":[],"label_agreement":null},{"id":"W2952461389","doi":"10.1016/j.ins.2018.01.013","title":"RECOME: A new density-based clustering algorithm using relative KNN kernel density","year":2018,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Beijing Municipal Natural Science Foundation; National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Pattern recognition (psychology); Jump; Single-linkage clustering; Merge (version control); Nearest-neighbor chain algorithm; Kernel density estimation; Algorithm; Graph; Kernel (algebra); Discontinuity (linguistics); k-nearest neighbors algorithm; Data mining; Artificial intelligence; Mathematics; Correlation clustering; CURE data clustering algorithm; Canopy clustering algorithm; Theoretical computer science; Combinatorics; Statistics; Physics","score_opus":0.06083948764184269,"score_gpt":0.3449632069298229,"score_spread":0.2841237192879802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952461389","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011351743,0.000007526458,0.98509467,0.00062020984,0.0006271563,0.00020143822,0.000002010236,0.00022503144,0.0018702216],"genre_scores_gemma":[0.12610897,0.000002182972,0.87292373,0.0006773551,0.00014702104,0.0000039864344,0.0000018234655,0.0000050234366,0.00012988805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976272,0.00008413636,0.00043199002,0.00034318527,0.000985797,0.00052771653],"domain_scores_gemma":[0.99841315,0.00017538213,0.00026212411,0.00044628032,0.0004834885,0.00021956906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012165476,0.00017499548,0.00017891299,0.0004645857,0.00094049843,0.00080196647,0.0012290444,0.00007858034,0.000020674359],"category_scores_gemma":[0.0003053697,0.0001596744,0.000057025278,0.001777117,0.00047677895,0.008486692,0.00065493636,0.00020585774,0.0003189331],"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.00001928607,0.000025858935,0.0006004699,0.00002681724,0.000018070044,0.000009958166,0.0070147533,0.016704993,0.0004829939,0.0035425194,0.00035180588,0.9712025],"study_design_scores_gemma":[0.00030442912,0.00013666242,0.00096050155,0.00004430742,0.000002156897,0.00004707626,0.00014317493,0.99054843,0.002971367,0.0033776932,0.0012510415,0.00021318316],"about_ca_topic_score_codex":0.0003748323,"about_ca_topic_score_gemma":0.00004577764,"teacher_disagreement_score":0.9738434,"about_ca_system_score_codex":0.00021769734,"about_ca_system_score_gemma":0.0006214693,"threshold_uncertainty_score":0.77333814},"labels":[],"label_agreement":null},{"id":"W2952935381","doi":"10.1016/j.ins.2019.06.003","title":"Granularity-driven sequential three-way decisions: A cost-sensitive approach to classification","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Sichuan Province Youth Science and Technology Innovation Team; Special Fund for Distinguished Experts in Guangxi of China; Department of Science and Technology of Sichuan Province; National Natural Science Foundation of China","keywords":"Granularity; Computer science; Decision engineering; Process (computing); Key (lock); Decision model; Optimal decision; Decision analysis; Decision support system; Feature (linguistics); Business decision mapping; Artificial intelligence; Machine learning; Data mining; Decision tree; Mathematics","score_opus":0.08468295428951868,"score_gpt":0.29774845596957383,"score_spread":0.21306550168005517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952935381","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.024227299,0.000004972527,0.8987722,0.0010372736,0.00045845113,0.00069200364,0.0000066904513,0.000107556945,0.0746936],"genre_scores_gemma":[0.8810198,0.0000041277717,0.117550544,0.0013351348,0.000025866024,0.00003253503,0.000012886005,0.0000016375593,0.00001748301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826956,0.00005177389,0.00035152808,0.00028439992,0.00075270206,0.00029003646],"domain_scores_gemma":[0.9990076,0.00011119148,0.00016460175,0.00039967825,0.00020236203,0.00011456703],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010260551,0.000114905175,0.00013379913,0.0003090971,0.0003409555,0.00090114214,0.0010852306,0.00006277371,0.000008937145],"category_scores_gemma":[0.00012013716,0.00008678678,0.000054311433,0.0012025675,0.000104997656,0.0043072035,0.00024133363,0.00009960118,0.0014043003],"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.000015684149,0.000075466625,0.0021069576,0.000011858501,0.000010216241,7.9952616e-7,0.00876667,0.014306084,0.00038905564,0.57996655,0.0016634729,0.3926872],"study_design_scores_gemma":[0.0002660738,0.00012206331,0.034833204,0.000017947763,0.00000250517,0.000018593479,0.00065175304,0.944926,0.00015459677,0.0056307577,0.013144553,0.00023191514],"about_ca_topic_score_codex":0.00006040663,"about_ca_topic_score_gemma":0.000011042409,"teacher_disagreement_score":0.93061996,"about_ca_system_score_codex":0.000051804258,"about_ca_system_score_gemma":0.00013796375,"threshold_uncertainty_score":0.9993732},"labels":[],"label_agreement":null},{"id":"W2954659334","doi":"10.1016/j.ins.2019.07.016","title":"A parameter-free particle swarm optimization algorithm using performance classifiers","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Multi-swarm optimization; Computer science; Term (time); Mathematical optimization; Basis (linear algebra); Set (abstract data type); Algorithm; Swarm behaviour; Metaheuristic; Mathematics; Artificial intelligence","score_opus":0.04348540951782416,"score_gpt":0.29345685362402735,"score_spread":0.2499714441062032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954659334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031368725,0.000013908593,0.9631543,0.0003576621,0.00068261614,0.000325615,0.0000040996947,0.00014465999,0.0039483807],"genre_scores_gemma":[0.11286194,0.000025930201,0.8864683,0.00041966542,0.000031823787,0.00001557349,0.000005174601,0.000004648045,0.0001669296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975599,0.000086341024,0.00049437693,0.00027156965,0.0011574142,0.00043040275],"domain_scores_gemma":[0.9984977,0.00016043369,0.00024467803,0.0006306179,0.00032656052,0.00013998058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013636522,0.00013729764,0.00015418475,0.0003222133,0.00036059803,0.0010214493,0.0016205916,0.00005987571,0.00017415559],"category_scores_gemma":[0.0003559349,0.0001191319,0.000043766817,0.0019101127,0.00017967299,0.008747533,0.0003841705,0.00012427795,0.00040748835],"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.000002553371,0.000017087217,0.0008101746,0.000015489804,0.000005527894,3.9415758e-7,0.000597382,0.92443323,0.000018823275,0.0021256725,0.00018918184,0.07178449],"study_design_scores_gemma":[0.0003749822,0.000101469814,0.00027062814,0.000013922612,0.0000022208505,0.000014412087,0.00017563022,0.9967878,0.0009980862,0.00018065849,0.0009125307,0.00016768268],"about_ca_topic_score_codex":0.000023556353,"about_ca_topic_score_gemma":3.0228264e-7,"teacher_disagreement_score":0.081493214,"about_ca_system_score_codex":0.00008031828,"about_ca_system_score_gemma":0.00029083036,"threshold_uncertainty_score":0.98498595},"labels":[],"label_agreement":null},{"id":"W2955027932","doi":"10.1016/j.ins.2019.06.066","title":"Physical unclonable functions based secret keys scheme for securing big data infrastructure communication","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","field":"Computer Science","cited_by":10,"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":"Fundamental Research Funds for the Central Universities; Central Universities in China; National Natural Science Foundation of China","keywords":"Computer science; Physical unclonable function; Key generation; Cryptography; Computer security; Computer network; Plaintext; Key (lock); Embedded system; Secure communication; Encryption","score_opus":0.04026112022259784,"score_gpt":0.276073457346076,"score_spread":0.23581233712347818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955027932","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.08628762,0.000030937597,0.8934638,0.0022161496,0.0012603645,0.0007349844,0.00020043772,0.00037122963,0.01543452],"genre_scores_gemma":[0.97339284,0.0000042335164,0.0248198,0.0010211734,0.00017185259,0.00005377991,0.00041205643,0.000005019631,0.000119255485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983149,0.000052912244,0.00032637367,0.00036083203,0.0005941633,0.00035081175],"domain_scores_gemma":[0.99760413,0.00031710742,0.0002309991,0.0014476324,0.00029661032,0.0001035416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007424473,0.00016825768,0.00018884355,0.00023651439,0.00080384064,0.0007526184,0.002523475,0.000065774446,0.000035608948],"category_scores_gemma":[0.000174721,0.00014384241,0.0000776953,0.0012693069,0.00016301064,0.008303797,0.00071287865,0.00020293462,0.00029176433],"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.00009364845,0.00048853824,0.0062482287,0.00048024784,0.000103588696,5.074658e-7,0.006179759,0.059553087,0.002368682,0.66799855,0.083866075,0.1726191],"study_design_scores_gemma":[0.0003980468,0.00010176101,0.001096094,0.000024112991,0.0000062089975,0.0000014116653,0.00029585988,0.83808684,0.00041847237,0.013107402,0.1462611,0.00020268575],"about_ca_topic_score_codex":0.00007288649,"about_ca_topic_score_gemma":0.000020347656,"teacher_disagreement_score":0.8871052,"about_ca_system_score_codex":0.000076111755,"about_ca_system_score_gemma":0.00042833207,"threshold_uncertainty_score":0.72575164},"labels":[],"label_agreement":null},{"id":"W2955720331","doi":"10.1016/j.ins.2019.07.014","title":"Facing robustness as a multi-objective problem: A bi-objective shortest path problem in smart regions","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":13,"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":"Ministerio de Economía y Competitividad; FPInnovations","keywords":"Robustness (evolution); Computer science; Shortest path problem; Mathematical optimization; Robust optimization; Optimization problem; Algorithm; Mathematics; Theoretical computer science","score_opus":0.025034858079815734,"score_gpt":0.29515520111695054,"score_spread":0.2701203430371348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955720331","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.66953343,0.0000419883,0.08054498,0.0018140358,0.0006421177,0.0028650737,0.000037538182,0.00045956185,0.24406129],"genre_scores_gemma":[0.9886994,0.000025941325,0.0103980275,0.00018210628,0.00001756845,0.00007965303,0.000033742486,0.000004316016,0.00055924605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.9981608,0.00012053348,0.00045329912,0.0002355565,0.00066117296,0.00036864652],"domain_scores_gemma":[0.99908483,0.00014998003,0.00027667778,0.000102939586,0.00029555458,0.00009003861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014919329,0.00013100228,0.00016282477,0.00047558456,0.0006819605,0.00033447798,0.0002817696,0.00011031324,0.00007826099],"category_scores_gemma":[0.00017848001,0.00011972598,0.000045290853,0.0018584463,0.00029287423,0.0044206283,0.000016400101,0.00016168892,0.00015858766],"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.0000267331,0.0000800855,0.20059763,0.00002835085,0.0000104199735,0.0000018021277,0.2414229,0.5309017,0.000024582045,0.023265611,0.00016753048,0.0034726677],"study_design_scores_gemma":[0.003320042,0.00057937694,0.28894076,0.0009914725,0.000038620925,0.000015236842,0.44285688,0.23821664,0.00023387485,0.0042846412,0.018916216,0.0016062319],"about_ca_topic_score_codex":0.0062015927,"about_ca_topic_score_gemma":0.004707542,"teacher_disagreement_score":0.31916597,"about_ca_system_score_codex":0.00013892226,"about_ca_system_score_gemma":0.00070091395,"threshold_uncertainty_score":0.93749946},"labels":[],"label_agreement":null},{"id":"W2965762698","doi":"10.1016/j.ins.2019.08.017","title":"Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; National Natural Science Foundation of China","keywords":"Variable neighborhood search; Heuristics; Mathematical optimization; Benchmark (surveying); Variable (mathematics); Replicate; Computer science; Heuristic; Local search (optimization); Profit (economics); Mathematics; Metaheuristic; Operations research; Statistics; Economics","score_opus":0.018931491975604054,"score_gpt":0.2396039903047542,"score_spread":0.22067249832915015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965762698","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.01923205,0.000013190617,0.83490247,0.00007745767,0.00008627233,0.00048152325,0.000002540517,0.00028950177,0.14491501],"genre_scores_gemma":[0.590046,0.000002512805,0.40972742,0.000094138806,0.000021517522,0.000025607544,0.000004885592,0.0000076646065,0.000070281596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987943,0.000031118707,0.00029449144,0.00011567146,0.0004822838,0.00028212287],"domain_scores_gemma":[0.9994777,0.0000954775,0.00006998032,0.00019259322,0.00012456774,0.000039671115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002192785,0.00010659842,0.00010164051,0.00010421549,0.00026833697,0.00038347967,0.0003464908,0.00004445585,0.00003118519],"category_scores_gemma":[0.00004014091,0.00006670948,0.000018380875,0.001084678,0.00007535088,0.0020071918,0.000039416525,0.00017077517,0.00004546436],"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.0000020720097,0.000004926238,0.0012280416,0.00007145344,0.000007626294,1.7651868e-8,0.003591148,0.98695654,0.00026576713,0.0053791096,0.00002784035,0.0024654425],"study_design_scores_gemma":[0.00020487186,0.000033958982,0.0004412012,0.000037472477,0.0000038003043,0.000014121202,0.0022958878,0.9957338,0.00034914628,0.000035608155,0.0007312025,0.0001189088],"about_ca_topic_score_codex":0.000017418506,"about_ca_topic_score_gemma":4.4460944e-7,"teacher_disagreement_score":0.5708139,"about_ca_system_score_codex":0.000038478436,"about_ca_system_score_gemma":0.000102896935,"threshold_uncertainty_score":0.36979032},"labels":[],"label_agreement":null},{"id":"W2966288920","doi":"10.1016/j.ins.2019.08.016","title":"Variable neighborhood algebraic Differential Evolution: An application to the Linear Ordering Problem with Cumulative Costs","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università per Stranieri di Perugia; Ryerson University","keywords":"Permutation (music); Benchmark (surveying); Differential evolution; Differential (mechanical device); Suite; Variable (mathematics); Computer science; Algebraic number; Mathematics; Algorithm; Mathematical optimization; Theoretical computer science","score_opus":0.013136658311947564,"score_gpt":0.2766363749169204,"score_spread":0.26349971660497284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966288920","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.004145653,0.0000038867242,0.98542273,0.0010489778,0.00014865804,0.0008999354,0.000003705944,0.000107611195,0.008218843],"genre_scores_gemma":[0.7491703,9.812851e-7,0.2502186,0.00033070153,0.000047769452,0.0000980556,0.000011812302,0.0000036696301,0.000118091484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998004,0.00008769482,0.00031565363,0.00027094668,0.0010339394,0.00028775085],"domain_scores_gemma":[0.99863255,0.00010573114,0.00017144189,0.0004928093,0.00047544282,0.000122001155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094296056,0.00011602042,0.00011023392,0.00023595881,0.00044581015,0.00075618946,0.0013185551,0.000034810822,0.00008861099],"category_scores_gemma":[0.00008337774,0.000071818075,0.000015411655,0.0022626035,0.0000844975,0.0046362295,0.00023909158,0.0001141218,0.00057105324],"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.000014503529,0.00004294317,0.0012306056,0.000017725753,0.000011388734,1.1852704e-7,0.003053978,0.48299778,0.0000897162,0.46671543,0.00012650208,0.045699306],"study_design_scores_gemma":[0.00021296754,0.00019983854,0.0020701347,0.0000123885275,0.0000019002877,0.0000054947327,0.0002499426,0.99336135,0.00007389277,0.0012129839,0.0024767139,0.00012237496],"about_ca_topic_score_codex":0.00012157743,"about_ca_topic_score_gemma":0.000013715709,"teacher_disagreement_score":0.7450247,"about_ca_system_score_codex":0.000088647554,"about_ca_system_score_gemma":0.00030214663,"threshold_uncertainty_score":0.73399246},"labels":[],"label_agreement":null},{"id":"W2968219101","doi":"10.1016/j.ins.2019.08.009","title":"Online collaborative filtering with local and global consistency","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada)","funders":"Medical Science and Technology Foundation of Guangdong Province; Guangdong Office of Philosophy and Social Science; Guangdong Science and Technology Department; Natural Science Foundation of Guangdong Province","keywords":"Computer science; Benchmark (surveying); Consistency (knowledge bases); Collaborative filtering; Focus (optics); Online algorithm; Machine learning; Online and offline; Recommender system; Set (abstract data type); Artificial intelligence; Algorithm; Data mining","score_opus":0.013589035334573077,"score_gpt":0.26251597785077396,"score_spread":0.2489269425162009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968219101","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.09623471,0.00004846855,0.8649933,0.0009938398,0.00017146707,0.00022349802,0.000010794266,0.0001378277,0.037186105],"genre_scores_gemma":[0.9559576,0.0000060589864,0.04361936,0.00039297584,0.0000041710837,0.0000045705565,0.0000012481248,4.7467054e-7,0.00001356418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993871,0.000016111426,0.0001622573,0.00010373579,0.00022228144,0.00010854526],"domain_scores_gemma":[0.99961704,0.000024396606,0.00010011413,0.00012143091,0.000100276724,0.00003676222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023287348,0.00006078662,0.0000821711,0.00005326704,0.000107472835,0.00037665354,0.00027827595,0.000019931746,0.00000516344],"category_scores_gemma":[0.0000064738465,0.00004034082,0.00000765102,0.000514393,0.00011889052,0.003196201,0.000097383614,0.000027998625,0.000019321898],"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.000010752736,0.000042592816,0.036226913,0.000082118524,0.000020191603,0.000002694531,0.0053966143,0.00041070723,0.000059313003,0.5429676,0.0016668536,0.41311362],"study_design_scores_gemma":[0.002490923,0.003731609,0.13369958,0.00058211974,0.000010524915,0.00072100485,0.02405708,0.6031316,0.004261579,0.01568853,0.21001786,0.0016075986],"about_ca_topic_score_codex":0.00007288316,"about_ca_topic_score_gemma":0.000033113185,"teacher_disagreement_score":0.85972285,"about_ca_system_score_codex":0.000020349999,"about_ca_system_score_gemma":0.00010568657,"threshold_uncertainty_score":0.36320788},"labels":[],"label_agreement":null},{"id":"W2979973726","doi":"10.1016/j.ins.2019.10.008","title":"Mildip: An energy efficient code offloading framework in mobile cloudlets","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":13,"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":"Science and Technology Planning Project of Guangdong Province; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Frequency scaling; Mobile device; Efficient energy use; Energy consumption; Mobile processor; Embedded system; Central processing unit; Clock rate; Operating system; Mobile technology; Chip; Telecommunications","score_opus":0.01378204697886278,"score_gpt":0.27022319898132213,"score_spread":0.25644115200245937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979973726","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.7329627,0.00005210884,0.25368208,0.00012247745,0.0052193743,0.000115767936,2.304455e-7,0.00011854246,0.007726701],"genre_scores_gemma":[0.9842104,0.0000040775362,0.014802457,0.0007820238,0.00016668337,0.000008471369,0.0000016880065,0.0000019959425,0.000022211632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985003,0.00004522604,0.00037247562,0.00022105096,0.0004993119,0.00036165686],"domain_scores_gemma":[0.9992535,0.00013933149,0.00015035942,0.00031196934,0.0000680106,0.00007684003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010417008,0.000105729414,0.00012475759,0.00035722842,0.00021547772,0.0005643651,0.001135415,0.00006555001,0.0000095116375],"category_scores_gemma":[0.00004759739,0.000091505986,0.000032437758,0.0012432268,0.00006986043,0.0027068886,0.00022701285,0.00011381768,0.00026493837],"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.000009440446,0.00012007622,0.011000334,0.000040718915,0.0000058270602,0.0000045459897,0.03723198,0.45480904,0.00035317612,0.10680633,0.0014987562,0.38811976],"study_design_scores_gemma":[0.00013128742,0.0001056473,0.0018136706,0.000054272095,4.6019633e-7,0.000008292598,0.00030750938,0.96488285,0.00089021586,0.001818087,0.029808912,0.00017881027],"about_ca_topic_score_codex":0.000068257905,"about_ca_topic_score_gemma":0.00000341714,"teacher_disagreement_score":0.5100738,"about_ca_system_score_codex":0.000051973464,"about_ca_system_score_gemma":0.0001106527,"threshold_uncertainty_score":0.5442186},"labels":[],"label_agreement":null},{"id":"W2997073788","doi":"10.1016/j.ins.2019.12.053","title":"A deep learning approach for multi-attribute data: A study of train delay prediction in railway systems","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":126,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"China Scholarship Council; Southwest Jiaotong University","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Mean squared error; Deep learning; Artificial neural network; Trajectory; Time series; Series (stratigraphy); State (computer science); Machine learning; Recurrent neural network; Pattern recognition (psychology); Data mining; Algorithm; Mathematics","score_opus":0.05523602894779469,"score_gpt":0.2810159262967556,"score_spread":0.2257798973489609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997073788","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.13221729,0.000025130708,0.86430675,0.0000027093129,0.00022854426,0.0011535063,0.000019860268,0.0006663156,0.0013798755],"genre_scores_gemma":[0.99647117,0.000008956232,0.0033002885,0.0000049964406,0.000008876067,0.00010962772,0.00007567085,0.000002857301,0.00001754998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991964,0.000021641194,0.00035598327,0.000095636104,0.00021310485,0.00011722729],"domain_scores_gemma":[0.99971193,0.00002380996,0.000076918375,0.00013585894,0.0000338266,0.00001767994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011307264,0.00006429453,0.0001097936,0.0003076828,0.00004768696,0.0000715388,0.00026720713,0.00003440097,0.0000017824241],"category_scores_gemma":[0.00003420049,0.000057482514,0.000012530916,0.00036887216,0.000021081967,0.0019387782,0.000038061098,0.0000675719,0.0000045469087],"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.0000032700052,0.000043884917,0.0061157364,0.00012627864,0.0000108088725,3.3396304e-8,0.0034203518,0.9832095,0.000024686442,0.00015212894,0.00051225064,0.006381084],"study_design_scores_gemma":[0.0006221741,0.00012813466,0.0050697983,0.000014312674,0.0000044373064,8.87358e-7,0.011382384,0.98075795,0.000009704693,4.1439526e-7,0.0019557627,0.000054062446],"about_ca_topic_score_codex":0.0000344145,"about_ca_topic_score_gemma":0.00001519794,"teacher_disagreement_score":0.8642539,"about_ca_system_score_codex":0.000026366903,"about_ca_system_score_gemma":0.000008806064,"threshold_uncertainty_score":0.23440689},"labels":[],"label_agreement":null},{"id":"W3000706679","doi":"10.1016/j.ins.2020.01.003","title":"Intuitionistic fuzzy TOPSIS method based on CVPIFRS models: An application to biomedical problems","year":2020,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"TOPSIS; Computer science; Variable (mathematics); Data mining; Range (aeronautics); Set (abstract data type); Fuzzy logic; Rough set; Artificial intelligence; Mathematical optimization; Mathematics; Operations research","score_opus":0.06224455014277375,"score_gpt":0.3114923050407443,"score_spread":0.24924775489797057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000706679","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.00029961969,0.0000024381254,0.9688471,0.014623792,0.00010225669,0.00029509497,0.000007698106,0.00018516884,0.015636852],"genre_scores_gemma":[0.66387683,0.0000013291755,0.32129604,0.014692233,0.000044099193,0.00006860934,0.00001766288,0.000001734715,0.0000014344106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837214,0.000061019175,0.000340374,0.00027923487,0.0007320576,0.00021520126],"domain_scores_gemma":[0.9991685,0.000082320454,0.00011888699,0.00026152967,0.00009752073,0.00027124071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008601585,0.000104466,0.000111274814,0.00020319372,0.00032622356,0.0006314805,0.0010478002,0.000047914084,0.000011118869],"category_scores_gemma":[0.00008620567,0.0000799458,0.00003131305,0.0015456348,0.00008563009,0.0029642682,0.00009803125,0.000077959194,0.00025291278],"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.0000064098003,0.00004453929,0.000013847242,0.000019925235,0.000001612303,3.267478e-7,0.004007964,0.38552776,0.000062922416,0.12502581,0.0008562091,0.48443267],"study_design_scores_gemma":[0.00010896993,0.000451858,0.00009605526,0.0000075095318,0.0000013748921,0.0000013314742,0.00012769914,0.9726086,0.000043132743,0.015285903,0.011148767,0.00011875032],"about_ca_topic_score_codex":0.000043724656,"about_ca_topic_score_gemma":0.0000022761951,"teacher_disagreement_score":0.66357726,"about_ca_system_score_codex":0.000032132386,"about_ca_system_score_gemma":0.00013086852,"threshold_uncertainty_score":0.6089381},"labels":[],"label_agreement":null},{"id":"W3005700414","doi":"10.1016/j.ins.2020.02.040","title":"Plausibility-promoting generative adversarial network for abstractive text summarization with multi-task constraint","year":2020,"lang":"en","type":"article","venue":"Information Sciences","topic":"Topic Modeling","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Shenzhen Institutes of Advanced Technology Innovation Program for Excellent Young Researchers; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Automatic summarization; Artificial intelligence; Discriminative model; Natural language processing; Generative grammar; Discriminator; Generative model; Classifier (UML); Inference; Adversarial system; Task (project management); Coreference; Machine learning; Resolution (logic)","score_opus":0.051649798074390754,"score_gpt":0.2774656492488205,"score_spread":0.22581585117442976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005700414","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.013107858,0.000005466334,0.98316824,0.0018738271,0.00023449017,0.000491794,0.000009973197,0.00010286454,0.0010054952],"genre_scores_gemma":[0.6619401,6.473054e-7,0.33698013,0.0009357838,0.000109941095,0.00001968873,0.000009693241,0.0000014894142,0.0000025275663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875855,0.00003428675,0.00035565108,0.0002583017,0.00035241447,0.00024079277],"domain_scores_gemma":[0.9991147,0.00015557797,0.00028843133,0.00013143283,0.00022136723,0.00008848717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066888897,0.00010783346,0.00011824385,0.00004955138,0.00044150592,0.0004543822,0.00048098076,0.0000437259,0.000006367374],"category_scores_gemma":[0.00026897533,0.00008475741,0.000030209369,0.00046959313,0.00014754517,0.0039997213,0.00009092732,0.00008800634,0.00001570734],"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.00005471931,0.000030485784,0.0022156495,0.00005422886,0.00003111442,0.0000011565343,0.058467004,0.7391356,0.000505041,0.06855894,0.00033815613,0.13060784],"study_design_scores_gemma":[0.0004927023,0.00014730464,0.0005118459,0.000014315633,0.0000032194807,0.0000024594256,0.00095999386,0.9954748,0.0007023219,0.00061059016,0.0009539768,0.00012646124],"about_ca_topic_score_codex":0.000030133848,"about_ca_topic_score_gemma":0.000019328061,"teacher_disagreement_score":0.64883226,"about_ca_system_score_codex":0.000038189173,"about_ca_system_score_gemma":0.00028145974,"threshold_uncertainty_score":0.43816182},"labels":[],"label_agreement":null},{"id":"W3012677073","doi":"10.1016/j.ins.2020.03.038","title":"Incremental and decremental fuzzy bounded twin support vector machine","year":2020,"lang":"en","type":"article","venue":"Information Sciences","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Hyperplane; Support vector machine; Computer science; Bounded function; Binary classification; Directed acyclic graph; Artificial intelligence; Fuzzy logic; Hinge loss; Algorithm; Mathematics; Pattern recognition (psychology)","score_opus":0.022325844993654392,"score_gpt":0.26475703764242087,"score_spread":0.24243119264876647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012677073","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.7118738,0.000093075156,0.15721156,0.032905374,0.0006531104,0.00039666914,0.000017342856,0.00065672357,0.09619233],"genre_scores_gemma":[0.98531735,0.0000043959026,0.009678113,0.0049419017,0.000029849794,0.0000033051379,0.000006481665,0.00000124488,0.000017357685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989724,0.000029035822,0.00022974261,0.00014897603,0.00043973656,0.00018012275],"domain_scores_gemma":[0.99961805,0.000026966767,0.00010101368,0.00009216873,0.000025577354,0.0001362219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047591684,0.00008537837,0.00008233872,0.00008224745,0.0003369719,0.0006335958,0.0005050577,0.000020758098,0.00007909008],"category_scores_gemma":[0.00007875504,0.00006981598,0.000021384207,0.00040654905,0.00011304457,0.003024373,0.0002491894,0.00006847909,0.00021070187],"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.00005088443,0.000090933325,0.06507451,0.000131833,0.000042782056,0.0000107398255,0.05318196,0.0006005737,0.002474405,0.1939504,0.022303598,0.6620874],"study_design_scores_gemma":[0.0016838345,0.0011926615,0.055940084,0.000019392013,0.000008531127,0.00009062724,0.0014923571,0.72876996,0.0035056984,0.0018688833,0.20478277,0.0006451964],"about_ca_topic_score_codex":0.00011518692,"about_ca_topic_score_gemma":0.000007838153,"teacher_disagreement_score":0.7281694,"about_ca_system_score_codex":0.000015785228,"about_ca_system_score_gemma":0.00007311998,"threshold_uncertainty_score":0.6109779},"labels":[],"label_agreement":null},{"id":"W3017170810","doi":"10.1016/j.ins.2020.04.029","title":"Finite-time adaptive tracking control for unknown nonlinear systems with a novel barrier Lyapunov function","year":2020,"lang":"en","type":"article","venue":"Information Sciences","topic":"Adaptive Control of Nonlinear Systems","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Tai'shan Scholar Engineering Construction Fund of Shandong Province of China; China Postdoctoral Science Foundation","keywords":"Control theory (sociology); Settling time; Tracking error; Nonlinear system; Lyapunov function; Bounded function; Controller (irrigation); Function (biology); Computer science; Tracking (education); Adaptive control; Mathematics; Embedding; Constraint (computer-aided design); Transient (computer programming); Control (management); Control engineering; Engineering; Step response; Artificial intelligence","score_opus":0.029702515916063606,"score_gpt":0.22267958681382413,"score_spread":0.19297707089776053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017170810","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.0025968992,0.000106888525,0.9926755,0.00018632947,0.00036742777,0.0008851999,0.00025852662,0.00032973193,0.0025935385],"genre_scores_gemma":[0.9951897,0.0000013047347,0.0038878815,0.00038931723,0.00036317416,0.00009670323,0.000022719507,0.000015087194,0.00003408823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866354,0.000017777453,0.00047148849,0.00014919906,0.00041999074,0.0002779942],"domain_scores_gemma":[0.9989793,0.00029185126,0.00017205626,0.00009517665,0.00033228102,0.00012934544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004504917,0.00018771511,0.00027233313,0.00013303256,0.0001912539,0.0002825795,0.00021438781,0.00007324768,0.0000156682],"category_scores_gemma":[0.00020097446,0.00014536665,0.000060804337,0.00042524273,0.00010060483,0.002432649,0.00001118129,0.0001045032,0.00012296066],"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.0001810464,0.000006859447,0.000078456826,0.000076373035,0.00007166221,3.5722672e-7,0.0009943134,0.9934138,0.0012593934,0.00081571884,0.00040123094,0.002700784],"study_design_scores_gemma":[0.0013954461,0.00040853102,0.0001086101,0.000048348516,0.000025032274,0.000004176133,0.00074629654,0.94866407,0.000089619556,0.0000036721256,0.048309606,0.00019656705],"about_ca_topic_score_codex":0.0000105256495,"about_ca_topic_score_gemma":0.0000036954973,"teacher_disagreement_score":0.9925928,"about_ca_system_score_codex":0.000050117615,"about_ca_system_score_gemma":0.00009463626,"threshold_uncertainty_score":0.592788},"labels":[],"label_agreement":null},{"id":"W3028015151","doi":"10.1016/j.ins.2020.05.013","title":"A GPU-based residual network for medical image classification in smart medicine","year":2020,"lang":"en","type":"article","venue":"Information Sciences","topic":"AI in cancer detection","field":"Computer Science","cited_by":69,"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; Convolutional neural network; Pooling; Artificial intelligence; Deep learning; Contextual image classification; Graphics processing unit; Pattern recognition (psychology); Dropout (neural networks); Residual; Set (abstract data type); Analytics; Residual neural network; Reduction (mathematics); Machine learning; Image (mathematics); Data mining; Algorithm","score_opus":0.058163718680216796,"score_gpt":0.3221192640737534,"score_spread":0.2639555453935366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028015151","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.0017104435,0.000021001993,0.91765857,0.076542564,0.0004333845,0.00026893686,0.0000017710904,0.00012832407,0.003234985],"genre_scores_gemma":[0.8969859,0.000012347844,0.08581886,0.016562952,0.00046238358,0.0001327543,0.000014412881,0.000003721913,0.0000066747675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981886,0.000052300966,0.0004825199,0.0001974635,0.0008494217,0.00022967858],"domain_scores_gemma":[0.9991109,0.00028802757,0.00020120069,0.0001552035,0.00012600762,0.000118707925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019612934,0.00008203932,0.00011709911,0.0001489137,0.00019208131,0.00015816902,0.0008428685,0.00006484376,0.000038948983],"category_scores_gemma":[0.00090500765,0.00006703755,0.000023089779,0.0014622028,0.00025734687,0.002696437,0.000061015093,0.00010670039,0.000046753757],"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.00018709747,0.00005037804,0.008134752,0.00025235937,0.00001287024,0.000004089258,0.014709028,0.023504341,0.0006419475,0.13813472,0.19236639,0.622002],"study_design_scores_gemma":[0.00055209355,0.00023788704,0.0055944175,0.000038978003,0.0000013477044,0.00000197645,0.00019695716,0.9623416,0.00026104102,0.0018498227,0.028829742,0.0000941051],"about_ca_topic_score_codex":0.000053173637,"about_ca_topic_score_gemma":0.000052032716,"teacher_disagreement_score":0.9388373,"about_ca_system_score_codex":0.000059721384,"about_ca_system_score_gemma":0.00040168763,"threshold_uncertainty_score":0.2733712},"labels":[],"label_agreement":null},{"id":"W3045238515","doi":"10.1016/j.ins.2020.07.026","title":"A hybrid distributed batch-stream processing approach for anomaly detection","year":2020,"lang":"en","type":"article","venue":"Information Sciences","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":24,"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":"Stream processing; Computer science; Batch processing; Data stream; Data processing; Architecture; Distributed computing; Data mining; Database","score_opus":0.037910956204528355,"score_gpt":0.27018378316758174,"score_spread":0.23227282696305337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045238515","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.004164916,0.000009114921,0.9922773,0.00077251525,0.000050358263,0.00028889446,0.00006644136,0.0006516859,0.0017187712],"genre_scores_gemma":[0.72508204,9.85205e-7,0.27431285,0.00045667856,0.000026766975,0.000059246395,0.000058213038,0.0000016699248,0.0000015428047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988739,0.000017084112,0.0003060971,0.0002330489,0.00034479043,0.00022509591],"domain_scores_gemma":[0.9993224,0.00004129933,0.0002250399,0.00017935815,0.00014386202,0.00008800887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045529968,0.00010675139,0.00010733008,0.00011670527,0.0003560267,0.0009666967,0.0010874063,0.000030136951,0.0000015466418],"category_scores_gemma":[0.00026263928,0.00009159771,0.000037982743,0.0007756818,0.00010948372,0.007239698,0.00017554557,0.0000611629,0.0000127209205],"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.000014532069,0.00002973407,0.00024911418,0.00010696863,0.0000055661535,4.635665e-7,0.0025182138,0.001017188,0.00054666196,0.0038208873,0.0045758737,0.9871148],"study_design_scores_gemma":[0.00013615431,0.00020210781,0.0002491598,0.000008785927,0.0000028146646,0.000012558144,0.00019273069,0.9662223,0.02108433,0.0006074573,0.011134761,0.00014686945],"about_ca_topic_score_codex":0.00001681904,"about_ca_topic_score_gemma":5.0234974e-7,"teacher_disagreement_score":0.9869679,"about_ca_system_score_codex":0.000028917493,"about_ca_system_score_gemma":0.0001216846,"threshold_uncertainty_score":0.93218786},"labels":[],"label_agreement":null},{"id":"W3087520709","doi":"10.1016/j.ins.2020.09.024","title":"LIG-Doctor: Efficient patient trajectory prediction using bidirectional minimal gated-recurrent networks","year":2020,"lang":"en","type":"article","venue":"Information Sciences","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo; Agence Nationale de la Recherche; Nvidia","keywords":"Trajectory; Computer science; Artificial intelligence; Physics","score_opus":0.04179744550961578,"score_gpt":0.2903858458059884,"score_spread":0.24858840029637264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087520709","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.39491108,0.0001672262,0.5966495,0.0019023028,0.003010124,0.00029208107,0.000015772719,0.0005599969,0.0024918886],"genre_scores_gemma":[0.9879427,0.0000066381194,0.010709715,0.00113892,0.00017658625,0.000009527953,0.000009371333,0.0000032922471,0.0000032523728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978055,0.00012292931,0.0005616653,0.0002851506,0.0008940517,0.0003307284],"domain_scores_gemma":[0.9990537,0.00009630562,0.00029365512,0.00015967718,0.00019074301,0.00020590374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000532842,0.0001453506,0.0001337663,0.00021142661,0.0005687381,0.00038796826,0.0005705853,0.000065256354,0.00003831652],"category_scores_gemma":[0.00017560866,0.00012837129,0.00006267595,0.0012541866,0.00011645848,0.001648528,0.00017317958,0.0002459172,0.00007043899],"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.000010009093,0.000019646779,0.0038819627,0.000026415011,0.00000435221,6.872249e-7,0.005435456,0.91824186,0.00003247919,0.0014469908,0.0008277396,0.070072405],"study_design_scores_gemma":[0.0001089094,0.00029006074,0.0051974766,0.000025995221,0.0000023563755,0.00001447539,0.00019438901,0.97854334,0.00008834421,0.000008089769,0.015396859,0.00012972335],"about_ca_topic_score_codex":0.00007569164,"about_ca_topic_score_gemma":0.0000027278845,"teacher_disagreement_score":0.5930316,"about_ca_system_score_codex":0.00011603142,"about_ca_system_score_gemma":0.00027067863,"threshold_uncertainty_score":0.523483},"labels":[],"label_agreement":null},{"id":"W3094463742","doi":"10.1016/j.ins.2020.10.051","title":"Differentially private data publishing for arbitrarily partitioned data","year":2020,"lang":"en","type":"article","venue":"Information Sciences","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Sichuan Province Science and Technology Support Program; China Scholarship Council","keywords":"Differential privacy; Data publishing; Computer science; Publication; Private information retrieval; Publishing; Information privacy; Privacy software; Data anonymization; Computer security; Data mining; Business","score_opus":0.23092125979479686,"score_gpt":0.33640218416523,"score_spread":0.10548092437043313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094463742","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009494269,0.00002205322,0.8554146,0.14067844,0.00035513897,0.00026439468,0.000659327,0.0006878452,0.000968765],"genre_scores_gemma":[0.22203079,0.000024852863,0.7705525,0.005450267,0.00010391351,0.000021805174,0.0018097805,0.0000039870492,0.0000020804428],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978749,0.000030858333,0.00048364815,0.00056223146,0.0007002336,0.00034810652],"domain_scores_gemma":[0.98991,0.00024739595,0.00032985304,0.009282721,0.00012061259,0.00010938254],"candidate_categories":["metaresearch","scholarly_communication","open_science"],"consensus_categories":["scholarly_communication","open_science"],"category_scores_codex":[0.0016016648,0.00012351622,0.0001388791,0.00014058892,0.000431149,0.0053063286,0.10602386,0.0000743087,0.000013602048],"category_scores_gemma":[0.05028774,0.0001051682,0.000018883835,0.0010605217,0.00021222791,0.071767375,0.13675657,0.00016514654,0.00006521903],"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.000009938502,0.000020104186,0.00040993743,0.0000635528,0.000018546894,7.2854294e-7,0.00040278173,0.00006872662,0.00015109466,0.052500796,0.8166726,0.12968114],"study_design_scores_gemma":[0.00021481107,0.00004111733,0.00036482865,0.000012576656,0.0000036070303,0.0000020639966,0.000054840348,0.82695866,0.00040608214,0.055532277,0.116265334,0.00014382399],"about_ca_topic_score_codex":0.000024485651,"about_ca_topic_score_gemma":0.0000092126265,"teacher_disagreement_score":0.82688993,"about_ca_system_score_codex":0.000016111228,"about_ca_system_score_gemma":0.00020930941,"threshold_uncertainty_score":0.9957263},"labels":[],"label_agreement":null},{"id":"W3111353949","doi":"10.1016/j.ins.2020.12.007","title":"A privacy-preserving and non-interactive federated learning scheme for regression training with gradient descent","year":2020,"lang":"en","type":"article","venue":"Information Sciences","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Key Research and Development Program of China; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Training (meteorology); Cloud computing; Scheme (mathematics); Gradient descent; Stochastic gradient descent; Machine learning; Process (computing); Logistic regression; Bridge (graph theory); Federated learning; Information privacy; Artificial intelligence; Ridge; Private information retrieval; Data mining; Computer security; Artificial neural network","score_opus":0.06175539154931472,"score_gpt":0.2977091131215243,"score_spread":0.2359537215722096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111353949","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.15553379,0.000024659936,0.8165133,0.026208444,0.00009126644,0.0003912946,0.000003842844,0.0004443621,0.0007890199],"genre_scores_gemma":[0.6900631,0.000009985804,0.3094499,0.0004231988,0.000012406109,0.000030396322,0.000005742528,0.000002940118,0.0000023170958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998556,0.00003314629,0.00030205084,0.00034203363,0.00042865102,0.00033808957],"domain_scores_gemma":[0.99851155,0.00021660783,0.00031135223,0.0006827249,0.00016678685,0.000110970934],"candidate_categories":["metaresearch","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00061552715,0.00015366841,0.00016506249,0.00016709774,0.00072510925,0.0010886289,0.006362057,0.00005415017,0.0000036210245],"category_scores_gemma":[0.011516655,0.000110555244,0.000024026658,0.0008086488,0.00017961425,0.007055432,0.012852543,0.00021839615,0.0000074443246],"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.00044939245,0.000094621224,0.019441944,0.00062759075,0.00014087427,0.000018407822,0.11153268,0.003153984,0.009394361,0.0057220724,0.065349385,0.78407466],"study_design_scores_gemma":[0.00043955047,0.0003632129,0.0008166236,0.00016100114,0.000002405488,0.000012657905,0.0030966233,0.9852385,0.00405596,0.002096309,0.0035333333,0.00018384102],"about_ca_topic_score_codex":0.000016162827,"about_ca_topic_score_gemma":0.0000029607304,"teacher_disagreement_score":0.9820845,"about_ca_system_score_codex":0.000042530206,"about_ca_system_score_gemma":0.00013010978,"threshold_uncertainty_score":0.9999483},"labels":[],"label_agreement":null},{"id":"W3111577069","doi":"10.1016/j.ins.2020.12.004","title":"Fuzzy high-utility pattern mining in parallel and distributed Hadoop framework","year":2020,"lang":"en","type":"article","venue":"Information Sciences","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Data mining; Fuzzy logic; Pruning; Set (abstract data type); Big data; Fuzzy set; Machine learning; Artificial intelligence","score_opus":0.03556424353895083,"score_gpt":0.27385815901749677,"score_spread":0.23829391547854595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111577069","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.071052395,0.0000151827035,0.91943663,0.00869815,0.000059196074,0.00008346638,0.000040165916,0.00007323488,0.0005415842],"genre_scores_gemma":[0.8842576,0.000007212594,0.11416085,0.0015248753,0.000015841128,0.000013084744,0.00001898083,7.079908e-7,8.166571e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913484,0.000018806344,0.00026565522,0.0001806295,0.00023723465,0.00016286105],"domain_scores_gemma":[0.9995083,0.00010739191,0.000099910656,0.0001631633,0.000033949316,0.00008727519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003698575,0.000069427035,0.00008846332,0.00005729766,0.0001755219,0.00049929257,0.00061499624,0.00003475464,0.0000061522373],"category_scores_gemma":[0.00017169253,0.000059769576,0.00001121206,0.0008471773,0.00011593058,0.0027354953,0.00022651914,0.000085484404,0.000039690407],"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.000002500766,0.000023838695,0.034120437,0.000025175677,0.0000031772024,0.0000014515738,0.011870479,0.0012745033,0.000007096248,0.054259628,0.0022410208,0.8961707],"study_design_scores_gemma":[0.00018472037,0.000051177758,0.13212727,0.000026281372,0.000001188007,0.000003050437,0.0010117145,0.8533221,0.000023601631,0.0069626602,0.0061272765,0.00015895131],"about_ca_topic_score_codex":0.00009002281,"about_ca_topic_score_gemma":0.000006950153,"teacher_disagreement_score":0.89601177,"about_ca_system_score_codex":0.000008050291,"about_ca_system_score_gemma":0.00004606231,"threshold_uncertainty_score":0.48146895},"labels":[],"label_agreement":null},{"id":"W3122960981","doi":"10.1016/j.ins.2021.01.009","title":"Modeling of photo-responsive liquid crystal elastomer actuators","year":2021,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Actuator; Deformation (meteorology); Robot; Process (computing); Materials science; Mechanical engineering; Computer science; Elastomer; Artificial intelligence; Engineering; Composite material","score_opus":0.013723172044599162,"score_gpt":0.24177262863076493,"score_spread":0.22804945658616577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122960981","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.69202596,0.000031403484,0.3037449,0.000010304557,0.00036189283,0.000034734006,0.000011419731,0.000049810187,0.0037295492],"genre_scores_gemma":[0.9959894,0.000043821954,0.0038896631,0.000048974416,0.00001174251,0.0000033124622,0.0000034598227,0.000002147091,0.0000075049825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950206,0.000005016275,0.0001982505,0.0000371326,0.00015969502,0.00009783233],"domain_scores_gemma":[0.99977475,0.000015556612,0.00002945349,0.00005910173,0.000095580916,0.000025552548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013996234,0.000047688405,0.00007192643,0.00006915702,0.000045681172,0.000031734828,0.00007026574,0.000024119512,0.0000881117],"category_scores_gemma":[0.00006400683,0.00004273056,0.00001926741,0.00020448198,0.000021794813,0.001046876,0.000022215834,0.000025334555,0.000019260497],"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.000010756208,0.00000244304,5.7624527e-7,0.00003408081,0.0000039567226,3.6375735e-7,0.001167842,0.89841884,0.09581385,0.002087286,0.000031392246,0.0024286355],"study_design_scores_gemma":[0.00008033928,0.000029444494,0.0000013486699,0.000018390741,0.0000021601534,0.00000520124,0.0015084074,0.6515825,0.34304714,0.0003216873,0.0033304936,0.00007291764],"about_ca_topic_score_codex":0.00000326901,"about_ca_topic_score_gemma":0.000002074133,"teacher_disagreement_score":0.3039634,"about_ca_system_score_codex":0.000012557644,"about_ca_system_score_gemma":0.000052859697,"threshold_uncertainty_score":0.17425017},"labels":[],"label_agreement":null},{"id":"W3128355817","doi":"10.1016/j.ins.2021.01.033","title":"Multi-view subspace clustering via partition fusion","year":2021,"lang":"en","type":"article","venue":"Information Sciences","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Partition (number theory); Robustness (evolution); Graph partition; Subspace topology; Data mining; Artificial intelligence; Machine learning; Graph; Constrained clustering; Correlation clustering; Theoretical computer science; CURE data clustering algorithm; Mathematics","score_opus":0.043537893848246745,"score_gpt":0.29065973307289417,"score_spread":0.24712183922464742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128355817","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.01850424,0.00007244261,0.9755215,0.0017652104,0.0005315302,0.00007616431,0.0000014206317,0.00012771216,0.0033997663],"genre_scores_gemma":[0.8495333,0.00016214736,0.147574,0.002487297,0.00003896356,0.000023796527,0.000022229913,0.000002172092,0.00015606651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903077,0.000044863722,0.00023869482,0.00014569657,0.0003656037,0.00017435686],"domain_scores_gemma":[0.9994495,0.000034164987,0.00011200296,0.0001755635,0.0001684004,0.00006035524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042014485,0.000070591734,0.00007310525,0.00010441472,0.00035479054,0.0005033715,0.00031208247,0.000038289025,0.00008257901],"category_scores_gemma":[0.00006635886,0.000059261936,0.000034383505,0.00067252485,0.000047613976,0.0057058916,0.00018627061,0.000055994937,0.0006500658],"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.000004901389,0.00008607341,0.000811854,0.000101134065,0.0000064107753,0.000008161414,0.0068106805,0.005892099,0.02778204,0.003093294,0.0043325555,0.9510708],"study_design_scores_gemma":[0.00030316293,0.00003741933,0.0030184805,0.00010558507,0.0000021184248,0.00004705322,0.00061691826,0.9296732,0.03159603,0.00074365496,0.033658776,0.00019760392],"about_ca_topic_score_codex":0.00002075397,"about_ca_topic_score_gemma":0.000030274956,"teacher_disagreement_score":0.9508732,"about_ca_system_score_codex":0.000017591146,"about_ca_system_score_gemma":0.00007566783,"threshold_uncertainty_score":0.8355497},"labels":[],"label_agreement":null},{"id":"W3144969346","doi":"10.1016/j.ins.2022.05.035","title":"Semi-supervised clustering with inaccurate pairwise annotations","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Pairwise comparison; Computer science; Cluster analysis; Class (philosophy); Relational database; Data mining; Stochastic block model; Link (geometry); Block (permutation group theory); Machine learning; Artificial intelligence; Mathematics","score_opus":0.019955369848768296,"score_gpt":0.2664773533025454,"score_spread":0.2465219834537771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144969346","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.58242285,0.000011572074,0.32631072,0.00082864624,0.00009297092,0.00034248419,0.000048882237,0.00022559272,0.089716256],"genre_scores_gemma":[0.99744946,3.069871e-7,0.0021542907,0.00018145607,0.00002400675,0.00008972729,0.000041520096,0.0000018019939,0.000057444664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992776,0.000030656174,0.00019151626,0.00007646244,0.0002941347,0.00012962995],"domain_scores_gemma":[0.99965054,0.000032380907,0.00012508224,0.00010783441,0.000056471275,0.000027683027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133917,0.000062064966,0.000069874775,0.00014892161,0.00077107805,0.0001667144,0.00023418023,0.0000040419895,0.00080296805],"category_scores_gemma":[0.00000234401,0.000051655417,0.000029969056,0.00084739807,0.000064680156,0.0012121302,0.00011716205,0.000072488,0.000016968163],"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.000031976386,0.000090896145,0.08833807,0.000013968353,0.00006846123,7.6667817e-7,0.011428391,0.6513978,0.00015500389,0.038499586,0.011980171,0.19799492],"study_design_scores_gemma":[0.00031064707,0.00015028995,0.0033458434,0.000009810793,0.000016030961,0.0000030082356,0.012132812,0.9229903,0.00020702982,0.002996016,0.057579793,0.00025839152],"about_ca_topic_score_codex":0.0001767682,"about_ca_topic_score_gemma":0.000011759091,"teacher_disagreement_score":0.41502658,"about_ca_system_score_codex":0.00002258284,"about_ca_system_score_gemma":0.00006691596,"threshold_uncertainty_score":0.8791937},"labels":[],"label_agreement":null},{"id":"W3157786233","doi":"10.1016/j.ins.2021.04.074","title":"Echo state network with a global reversible autoencoder for time series classification","year":2021,"lang":"en","type":"article","venue":"Information Sciences","topic":"Neural Networks and Reservoir Computing","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Windsor","funders":"Natural Science Foundation of Henan Province; China Scholarship Council; National Natural Science Foundation of China","keywords":"Echo state network; Initialization; Autoencoder; Computer science; Series (stratigraphy); Reservoir computing; Algorithm; Time series; Feature (linguistics); Layer (electronics); State (computer science); Artificial intelligence; Recurrent neural network; Artificial neural network; Machine learning","score_opus":0.019614036302512853,"score_gpt":0.25490941652799887,"score_spread":0.23529538022548602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157786233","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030815778,0.00004586229,0.98571646,0.0033320202,0.0003117514,0.00017137265,0.0000046086293,0.0001390497,0.0071973233],"genre_scores_gemma":[0.11075771,0.00003178973,0.88580334,0.0021425758,0.00017899417,0.000031751133,0.000023557319,0.0000039664874,0.0010263054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989129,0.0000317863,0.00023816862,0.00018463194,0.0003398508,0.00029270025],"domain_scores_gemma":[0.9992233,0.000067994246,0.00017220355,0.00020202955,0.00027525108,0.000059242022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047124855,0.00008632636,0.00009724328,0.000032916687,0.0005550714,0.00082277716,0.00051512074,0.000027003669,0.0000074983373],"category_scores_gemma":[0.000032815355,0.00006267118,0.000033894456,0.001262688,0.00009419863,0.0042768614,0.00014501486,0.000046855705,0.00004052983],"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.000034567565,0.000026661175,0.0025508772,0.00005548054,0.000024664214,0.0000051950137,0.0012446016,0.7517819,0.000060702485,0.06146734,0.030437697,0.15231036],"study_design_scores_gemma":[0.0001544696,0.0000943283,0.0016608571,0.00003379929,0.0000019761515,0.00003439595,0.00009863961,0.96944183,0.00012218422,0.006708343,0.021530772,0.00011840382],"about_ca_topic_score_codex":0.0000065352015,"about_ca_topic_score_gemma":0.000014810563,"teacher_disagreement_score":0.21765998,"about_ca_system_score_codex":0.000034983816,"about_ca_system_score_gemma":0.00028799396,"threshold_uncertainty_score":0.79340595},"labels":[],"label_agreement":null},{"id":"W3163723672","doi":"10.1016/j.ins.2021.05.021","title":"A three-way clustering approach for novelty detection","year":2021,"lang":"en","type":"article","venue":"Information Sciences","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Novelty detection; Computer science; Novelty; Set (abstract data type); Artificial intelligence; Data mining; Core (optical fiber); Reduction (mathematics); Key (lock); Machine learning; Pattern recognition (psychology); Mathematics","score_opus":0.03917483380950819,"score_gpt":0.2780907780157492,"score_spread":0.23891594420624102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163723672","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.0007695651,0.000010277675,0.9900396,0.00032935414,0.00011206504,0.00020415752,0.0000029949967,0.00024115106,0.008290867],"genre_scores_gemma":[0.5187711,0.000003168421,0.48064333,0.00035444568,0.000029200246,0.00016174352,0.000003840801,0.000001346709,0.000031798554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926543,0.000006707504,0.00021997416,0.00016112548,0.00020086767,0.00014591106],"domain_scores_gemma":[0.9994249,0.000034385685,0.00011183393,0.00021059233,0.00018086829,0.000037427526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038382868,0.00006258558,0.00006367359,0.00010671367,0.00049672637,0.00045725759,0.00038581976,0.00003940262,0.0000052047108],"category_scores_gemma":[0.000043267028,0.000056279972,0.000049552906,0.0008118302,0.000052885913,0.0022911362,0.00011360065,0.00004616625,0.000015994676],"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.000002573626,0.000030236397,0.000062658546,0.000030306916,0.0000050724557,9.612785e-8,0.0005004477,0.0022585902,0.002865457,0.065343134,0.00042670744,0.9284747],"study_design_scores_gemma":[0.000098164724,0.000042337295,0.00055732596,0.0000030195376,0.0000014492854,0.000026494055,0.00014008001,0.94763863,0.029360063,0.0033513373,0.018679626,0.000101457794],"about_ca_topic_score_codex":0.00002123226,"about_ca_topic_score_gemma":0.000026678845,"teacher_disagreement_score":0.94538003,"about_ca_system_score_codex":0.000027783768,"about_ca_system_score_gemma":0.00006598355,"threshold_uncertainty_score":0.44093454},"labels":[],"label_agreement":null},{"id":"W3165000753","doi":"10.1016/j.ins.2021.05.035","title":"Automated detection of shockable ECG signals: A review","year":2021,"lang":"en","type":"review","venue":"Information Sciences","topic":"ECG Monitoring and Analysis","field":"Medicine","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Université du Québec à Montréal","funders":"","keywords":"Computer science; Ventricular tachycardia; Artificial intelligence; Ventricular fibrillation; Bispectrum; Deep learning; Sudden cardiac arrest; Machine learning; Pattern recognition (psychology); Medicine; Cardiology","score_opus":0.09658138634924963,"score_gpt":0.4300340972464554,"score_spread":0.3334527108972058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165000753","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000029350308,0.9967281,0.00041747617,0.00003632112,0.000148305,0.0002555593,0.000006750988,0.00010941928,0.00229514],"genre_scores_gemma":[0.0000399227,0.99913704,0.00046388517,0.0000847986,0.000043487802,0.000030473204,0.00005459063,0.0000034434001,0.000142373],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99823797,0.00007359478,0.0009094677,0.00012074648,0.0005274619,0.00013078605],"domain_scores_gemma":[0.9986562,0.0000926387,0.00069776556,0.00020120734,0.0002949769,0.000057206667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010769343,0.00014291231,0.0011602485,0.0003840072,0.00009814485,0.0000513728,0.00014314525,0.00010079225,0.00009190637],"category_scores_gemma":[0.00050409755,0.000096140706,0.00038160285,0.0021147497,0.000080180595,0.00048116676,0.000032330132,0.00012965886,0.00010177364],"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":[2.0941847e-7,0.0000072593552,0.0000025388508,0.03447886,0.000044511886,5.873849e-7,0.000018464207,0.000004691576,0.000001473797,0.0000019008435,0.00045862776,0.9649809],"study_design_scores_gemma":[0.000039901763,0.00005181122,0.0000012621118,0.09856725,0.00083306007,0.000048669473,0.000060784598,0.0024781155,0.000044890763,0.0000010328478,0.89777994,0.00009326291],"about_ca_topic_score_codex":0.000035735444,"about_ca_topic_score_gemma":8.75068e-7,"teacher_disagreement_score":0.9648876,"about_ca_system_score_codex":0.00005418732,"about_ca_system_score_gemma":0.00051502534,"threshold_uncertainty_score":0.39205042},"labels":[],"label_agreement":null},{"id":"W3201678309","doi":"10.1016/j.ins.2021.09.060","title":"A new interval type-2 fuzzy reasoning method for classification systems based on normal forms of a possibility-based fuzzy measure","year":2021,"lang":"en","type":"article","venue":"Information Sciences","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Fuzzy logic; Operator (biology); Mathematics; Measure (data warehouse); Artificial intelligence; Fuzzy classification; Data mining; Fuzzy number; Fuzzy set operations; Cluster analysis; Computer science; Matching (statistics); Fuzzy clustering; Defuzzification; Fuzzy set; Statistics","score_opus":0.04390323873399638,"score_gpt":0.3029743265340069,"score_spread":0.25907108780001054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201678309","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.001833555,0.0000598603,0.9643261,0.0009938407,0.0007237732,0.00045533731,0.000011440377,0.000092421855,0.03150371],"genre_scores_gemma":[0.8826576,5.5445037e-7,0.116659164,0.0005120254,0.000051096806,0.000048765185,0.000016223305,0.0000029481282,0.000051620074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997685,0.00017403673,0.0007142428,0.0002939558,0.00084948,0.00028324756],"domain_scores_gemma":[0.99771506,0.00039685858,0.00052702375,0.0004828884,0.00076478027,0.00011339657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030294484,0.00015005354,0.00027762828,0.0002374212,0.00025050621,0.0005317284,0.0007935374,0.00009712274,0.0000032529279],"category_scores_gemma":[0.0006772419,0.0001130965,0.00013278292,0.0011625888,0.00006108963,0.0020353168,0.000050389055,0.00009245835,0.000020106874],"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.00025766666,0.00012216026,0.002234245,0.00045817156,0.00003531339,0.0000015873119,0.0022893122,0.068452165,0.0023872012,0.7482065,0.001833986,0.17372167],"study_design_scores_gemma":[0.000879823,0.00041122988,0.0016974591,0.00017759815,0.000008702351,0.000007394534,0.0007596634,0.99037266,0.0012585599,0.0028385743,0.0014182345,0.00017011575],"about_ca_topic_score_codex":0.00013562602,"about_ca_topic_score_gemma":0.000020919582,"teacher_disagreement_score":0.9219205,"about_ca_system_score_codex":0.00008499614,"about_ca_system_score_gemma":0.0013339317,"threshold_uncertainty_score":0.5127469},"labels":[],"label_agreement":null},{"id":"W3211388698","doi":"10.1016/j.ins.2021.10.065","title":"A dynamic rule-based classification model via granular computing","year":2021,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Engineering and Physical Sciences Research Council; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Granular computing; Computer science; Data mining; Rough set; Representation (politics); Granular material; Classification rule; Task (project management); Artificial intelligence; Machine learning","score_opus":0.034793576750205675,"score_gpt":0.27787864757572056,"score_spread":0.2430850708255149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211388698","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.013241561,0.000031193325,0.97433156,0.002055134,0.00020212063,0.000070281465,0.0000020223697,0.00013643461,0.009929674],"genre_scores_gemma":[0.7761629,0.0000031659044,0.22237566,0.00142829,0.000005600167,0.0000032082592,0.000012114025,0.0000010309814,0.000008036009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987625,0.000035598176,0.0003143554,0.00018657278,0.0004888159,0.00021219398],"domain_scores_gemma":[0.99926305,0.000052118292,0.0001649213,0.0002839932,0.00017972727,0.000056220688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058711227,0.00008551505,0.00008966096,0.0001442484,0.00043227655,0.0006791202,0.0006622012,0.000041272815,0.0000061527658],"category_scores_gemma":[0.000049614468,0.0000716807,0.000046352874,0.0009362316,0.00010296642,0.0026097703,0.00010269943,0.0000709048,0.00010994893],"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.0000023716461,0.000054605098,0.0006398872,0.000032612585,0.0000037381535,0.000003162202,0.0022224674,0.46997505,0.00103165,0.08596425,0.0003271283,0.43974307],"study_design_scores_gemma":[0.00012630952,0.000014906151,0.0032841838,0.000008924915,0.0000012447776,0.000007984719,0.00009292778,0.98805016,0.0001782054,0.0076077585,0.0005235392,0.00010382873],"about_ca_topic_score_codex":0.00000899637,"about_ca_topic_score_gemma":0.0000035197752,"teacher_disagreement_score":0.76292133,"about_ca_system_score_codex":0.0000386365,"about_ca_system_score_gemma":0.00028029812,"threshold_uncertainty_score":0.6548772},"labels":[],"label_agreement":null},{"id":"W330367180","doi":"10.1016/j.ins.2015.05.011","title":"An ordinal ranking criterion for the subjective evaluation of alternatives and exchange reliability","year":2015,"lang":"en","type":"article","venue":"Information Sciences","topic":"Economic and Environmental Valuation","field":"Economics, Econometrics and Finance","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Ranking (information retrieval); Computer science; Decision maker; Reliability (semiconductor); Preference; Perception; Set (abstract data type); Normative; Choice set; Machine learning; Artificial intelligence; Data mining; Econometrics; Mathematics; Operations research; Statistics; Psychology","score_opus":0.33259951038373464,"score_gpt":0.3359485657271087,"score_spread":0.003349055343374041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W330367180","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.9682259,0.0002675508,0.027492872,0.00024479954,0.00018011093,0.00031986085,0.000029009048,0.0000046546656,0.003235236],"genre_scores_gemma":[0.9991098,0.00003182213,0.00071447715,0.000063531144,0.000022844806,0.000043138098,0.0000077141585,0.0000011333682,0.0000055512874],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946827,0.000021892161,0.000279343,0.00009160787,0.00007523714,0.0000636439],"domain_scores_gemma":[0.99949396,0.00006749201,0.00026979716,0.0000799845,0.00006711502,0.000021643873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058565396,0.00003986879,0.00007655127,0.00007552307,0.000120380646,0.00006690134,0.00009957185,0.000018690393,0.000038650745],"category_scores_gemma":[0.00025562526,0.000032356093,0.000016851807,0.000072464354,0.00015751943,0.0021744529,0.000017216043,0.000018416,0.00001134045],"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.00007086829,0.000059010985,0.7302186,0.000048197307,0.00002378163,8.395538e-9,0.045404904,0.033216745,0.000037524907,0.05795322,0.00018007045,0.13278706],"study_design_scores_gemma":[0.00053589593,0.00015174522,0.46742237,0.000003902342,0.0000059315266,5.9361025e-7,0.0035025622,0.48974812,0.0001378079,0.037461523,0.00096788205,0.00006166951],"about_ca_topic_score_codex":0.00019971616,"about_ca_topic_score_gemma":0.000012763101,"teacher_disagreement_score":0.45653138,"about_ca_system_score_codex":0.00007246261,"about_ca_system_score_gemma":0.000020695872,"threshold_uncertainty_score":0.20297714},"labels":[],"label_agreement":null},{"id":"W4200017925","doi":"10.1016/j.ins.2021.12.022","title":"WSN optimization for sampling-based signal estimation using semi-binarized variational autoencoder","year":2021,"lang":"en","type":"article","venue":"Information Sciences","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Mitacs","keywords":"Autoencoder; Computer science; SIGNAL (programming language); Sampling (signal processing); Pattern recognition (psychology); Mean squared error; Artificial intelligence; Feature (linguistics); Noise (video); Encoding (memory); Data mining; Algorithm; Deep learning; Statistics; Mathematics; Computer vision; Image (mathematics)","score_opus":0.03700843849503497,"score_gpt":0.28215579410997427,"score_spread":0.2451473556149393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200017925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002125606,0.00002273445,0.996088,0.00015591577,0.0003101105,0.00017583034,0.000030399477,0.00041869405,0.00067266746],"genre_scores_gemma":[0.36979884,0.00000388245,0.629654,0.00021603581,0.000028619483,0.000033108627,0.00025176714,0.0000067483975,0.000007018973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905896,0.0000122284255,0.00035487546,0.00009797703,0.00029776513,0.00017821488],"domain_scores_gemma":[0.99936235,0.000116013696,0.00009312998,0.000089422254,0.00031214464,0.0000269132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031636137,0.00010210759,0.000102858474,0.00022751966,0.00033098893,0.0002682219,0.00013033957,0.00009588896,0.00015814095],"category_scores_gemma":[0.00025185497,0.00010196977,0.00004357798,0.0006712599,0.00007150402,0.0015556068,0.000015420956,0.000052685777,0.000010321155],"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.0000027697013,0.0000046328523,0.000038742655,0.000034640616,0.0000043726054,7.025468e-8,0.00013509092,0.99291605,0.00015517088,0.0038442619,0.00010684355,0.0027573619],"study_design_scores_gemma":[0.0003432528,0.000015794409,0.000049882325,0.000021277696,0.00000879522,0.0000034271927,0.00018829422,0.9902052,0.006828616,0.0014532546,0.00074826705,0.00013390156],"about_ca_topic_score_codex":0.000004186421,"about_ca_topic_score_gemma":0.0000015146968,"teacher_disagreement_score":0.36767322,"about_ca_system_score_codex":0.00008983342,"about_ca_system_score_gemma":0.00021542948,"threshold_uncertainty_score":0.41582063},"labels":[],"label_agreement":null},{"id":"W4200361938","doi":"10.1016/j.ins.2021.12.091","title":"PR-LTTE: Link travel time estimation based on path recovery from large-scale incomplete trip data","year":2021,"lang":"en","type":"article","venue":"Information Sciences","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China; Shandong University","keywords":"Computer science; Travel time; Path (computing); Scale (ratio); Transport engineering; Estimation; Travel behavior; Data mining; Geography; Computer network; Engineering","score_opus":0.02206821534800807,"score_gpt":0.24277862703193923,"score_spread":0.22071041168393116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200361938","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.003041261,0.000015570029,0.9634067,0.0005602112,0.00037778768,0.00015526258,0.0004144494,0.0014677063,0.030561099],"genre_scores_gemma":[0.94437534,0.00004435994,0.05174549,0.0015459678,0.00007619936,0.000020929043,0.002123665,0.0000074596514,0.00006056474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990778,0.000021152715,0.0002823415,0.00013090899,0.00034858027,0.0001392108],"domain_scores_gemma":[0.9994729,0.00006355393,0.000059245984,0.00032769036,0.00003632563,0.000040256273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048107503,0.0000890126,0.00009466264,0.00016047621,0.00012434636,0.00022693463,0.000326541,0.00004895688,0.00014019854],"category_scores_gemma":[0.00007684823,0.000084695916,0.000023931576,0.00037450934,0.000031545183,0.0022427319,0.000060043294,0.00008206321,0.00025272623],"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.000015308067,0.000050530853,0.000091670925,0.000068619265,0.000023364264,0.000002382389,0.00083987456,0.2978934,0.00048175605,0.000595824,0.20748904,0.49244824],"study_design_scores_gemma":[0.00020591235,0.00002459177,0.0024676248,0.000037352704,0.0000059851914,5.3112757e-7,0.00011103359,0.9604874,0.00069808634,0.000116170144,0.03574718,0.00009812997],"about_ca_topic_score_codex":0.0000095229525,"about_ca_topic_score_gemma":0.0000070981678,"teacher_disagreement_score":0.9413341,"about_ca_system_score_codex":0.000033734923,"about_ca_system_score_gemma":0.000046711397,"threshold_uncertainty_score":0.34537992},"labels":[],"label_agreement":null},{"id":"W4200545901","doi":"10.1016/j.ins.2021.12.033","title":"All state constrained decentralized adaptive implicit inversion control for a class of large scale nonlinear hysteretic systems with time-delays","year":2021,"lang":"en","type":"article","venue":"Information Sciences","topic":"Piezoelectric Actuators and Control","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Control theory (sociology); Nonlinear system; Computer science; Inversion (geology); Bounded function; Tracking error; Decoupling (probability); Adaptive control; Lyapunov function; Mathematics; Control engineering; Engineering; Control (management)","score_opus":0.006891785124736741,"score_gpt":0.21427850325354592,"score_spread":0.20738671812880918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200545901","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.25505117,0.000119512304,0.7421589,0.00009387314,0.00011448866,0.000571988,0.00033829277,0.000087267705,0.0014645186],"genre_scores_gemma":[0.9985273,0.00001285374,0.0012048201,0.00017353076,0.000010591201,0.000030109191,0.00002427215,0.000004513042,0.000012045839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901795,0.00002178304,0.0003424143,0.00008414241,0.00026082218,0.00027290828],"domain_scores_gemma":[0.99936503,0.000117136224,0.00012888439,0.000089059824,0.00023218495,0.000067674875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032282143,0.00010364552,0.0002237433,0.00008918068,0.00007602493,0.00008388567,0.00012284548,0.00004071981,0.000015087158],"category_scores_gemma":[0.000030087445,0.000079651,0.000044545428,0.00029292412,0.00007261648,0.0006768075,0.000009086384,0.000048644695,0.000014970301],"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.0020575495,0.0003307828,0.003464603,0.0017138714,0.0015336779,0.000016296142,0.03230994,0.7643185,0.03361343,0.012009689,0.009709306,0.13892235],"study_design_scores_gemma":[0.002076688,0.00014176573,0.000030019964,0.000039610542,0.000023652234,0.000008607169,0.0011463263,0.99285334,0.0010461025,0.000034975572,0.00249066,0.00010823541],"about_ca_topic_score_codex":0.000018405366,"about_ca_topic_score_gemma":0.000009716889,"teacher_disagreement_score":0.7434761,"about_ca_system_score_codex":0.00004012453,"about_ca_system_score_gemma":0.0001380889,"threshold_uncertainty_score":0.32480735},"labels":[],"label_agreement":null},{"id":"W4213364573","doi":"10.1016/j.ins.2022.02.029","title":"Sentiment mutation and negative emotion contagion dynamics in social media: A case study on the Chinese Sina Microblog","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Microblogging; Social media; Emotional contagion; Mutation; Computer science; Dynamics (music); Sentiment analysis; Psychology; World Wide Web; Natural language processing; Genetics; Social psychology; Biology; Gene","score_opus":0.015400296960560497,"score_gpt":0.30063779732447915,"score_spread":0.28523750036391865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213364573","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.9969064,9.834204e-7,0.0003237662,0.00083720236,0.00014234835,0.00031100688,0.00004360998,0.0000067053966,0.0014279594],"genre_scores_gemma":[0.99976796,2.1507472e-7,0.00001379118,0.000115411865,0.000027177723,0.000048233935,0.000021552638,0.0000012728301,0.0000043708674],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9992845,0.000104668245,0.00020444005,0.000081805025,0.00023204273,0.000092552764],"domain_scores_gemma":[0.9996022,0.00015200902,0.00015244223,0.000039681247,0.000038841947,0.000014850067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000599913,0.000065069755,0.00007081067,0.00009538612,0.0010336285,0.00013977701,0.000084212064,0.000009459586,0.000029563655],"category_scores_gemma":[0.000016388549,0.000047956983,0.000019907668,0.00043472063,0.00010057288,0.0004969418,0.00006449275,0.00011347273,0.000003130909],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.000038879556,0.00052140566,0.2588452,0.000007883317,0.000036808895,0.000029581823,0.46328157,0.010784314,0.000018663934,0.22692391,0.00013849414,0.039373286],"study_design_scores_gemma":[0.0007490764,0.00017482555,0.07765918,0.000004524563,0.000005409593,0.00002010919,0.7433584,0.16484809,0.0000051091647,0.013003724,0.000028320615,0.00014326315],"about_ca_topic_score_codex":0.0009925938,"about_ca_topic_score_gemma":0.00017989187,"teacher_disagreement_score":0.2800768,"about_ca_system_score_codex":0.00008960349,"about_ca_system_score_gemma":0.00003903312,"threshold_uncertainty_score":0.7949939},"labels":[],"label_agreement":null},{"id":"W4214751967","doi":"10.1016/j.ins.2022.02.040","title":"Reversible data hiding for JPEG images with minimum additive distortion","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"JPEG; Embedding; Discrete cosine transform; Distortion (music); Information hiding; Histogram; Block (permutation group theory); Computer science; Artificial intelligence; Mathematics; Image (mathematics); Image quality; Cover (algebra); File size; Algorithm; Computer vision; Pattern recognition (psychology); Statistics","score_opus":0.03816991992211711,"score_gpt":0.28671204288350277,"score_spread":0.24854212296138567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214751967","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.0014976094,0.000018791176,0.9941948,0.00061081117,0.00018728228,0.00024623293,0.00014890748,0.00020751469,0.0028880273],"genre_scores_gemma":[0.75759214,0.000009634553,0.24161482,0.00043987567,0.000021130296,0.0001234341,0.00013715349,0.0000021359988,0.00005966959],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990452,0.000028273735,0.00017693637,0.00019439695,0.0003811894,0.00017400754],"domain_scores_gemma":[0.99926114,0.00009191193,0.00019534823,0.00035251392,0.00007098404,0.00002813009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007770018,0.00007020971,0.00006941966,0.00022177107,0.0010928491,0.0002395923,0.0015042262,0.0000112716725,0.0000074504387],"category_scores_gemma":[0.00003964414,0.000056620214,0.00002133704,0.0007254918,0.00011939301,0.008533767,0.00052908226,0.00006189512,0.000002087912],"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.00020478794,0.00014280467,0.0028762834,0.0001198821,0.000054871038,0.000007390344,0.016702192,0.008194861,0.00074048655,0.11408528,0.14562052,0.71125066],"study_design_scores_gemma":[0.0007655774,0.0012717526,0.0010382014,0.000058856673,0.000015663489,0.0000738439,0.003152401,0.20916732,0.016271459,0.022236215,0.74524176,0.00070693996],"about_ca_topic_score_codex":0.000010667418,"about_ca_topic_score_gemma":0.0000015665369,"teacher_disagreement_score":0.7560945,"about_ca_system_score_codex":0.000036199755,"about_ca_system_score_gemma":0.00007795995,"threshold_uncertainty_score":0.8405422},"labels":[],"label_agreement":null},{"id":"W4220848411","doi":"10.1016/j.ins.2022.03.003","title":"Supervisory control of discrete event systems under asynchronous spiking neuron P systems","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Supervisor; Supervisory control; Asynchronous communication; Computer science; Construct (python library); Event (particle physics); Control system; Process (computing); SNP; Control (management); Control theory (sociology); Theoretical computer science; Control engineering; Distributed computing; Artificial intelligence; Single-nucleotide polymorphism; Engineering; Programming language","score_opus":0.023677495020257643,"score_gpt":0.25377332279406106,"score_spread":0.2300958277738034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220848411","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.94288945,0.00070686935,0.052670185,0.00008287169,0.00065707456,0.00022766866,0.000028125858,0.000014007202,0.0027237346],"genre_scores_gemma":[0.99965703,0.000006294994,0.000020561612,0.00020024269,0.000052431107,0.00001790576,0.000026370504,0.0000015693054,0.000017568804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990731,0.00010399524,0.00030835773,0.00010842902,0.00025805208,0.00014808138],"domain_scores_gemma":[0.99960965,0.000021930413,0.00019006069,0.00010028771,0.00004986968,0.000028228393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006930433,0.000066949586,0.0000994695,0.000048583748,0.00026700055,0.00006442222,0.00025893192,0.000029079974,0.0000075227076],"category_scores_gemma":[0.000035334408,0.000049885188,0.00004469948,0.00013259146,0.00008949896,0.000021796595,0.00013660878,0.000050725826,0.0000029736782],"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.00005934176,0.000042073923,0.010465815,0.00010450544,0.00003410213,8.2206776e-7,0.0002944935,0.87699056,0.10021707,0.0069204615,0.00031882888,0.0045519527],"study_design_scores_gemma":[0.002677828,0.0062414994,0.03358609,0.00010635584,0.000050254504,0.00021515897,0.02545358,0.75136393,0.010122483,0.0002667528,0.1687415,0.0011745911],"about_ca_topic_score_codex":0.000057545993,"about_ca_topic_score_gemma":7.087598e-7,"teacher_disagreement_score":0.16842267,"about_ca_system_score_codex":0.00001417744,"about_ca_system_score_gemma":0.000056544755,"threshold_uncertainty_score":0.20535794},"labels":[],"label_agreement":null},{"id":"W4221096464","doi":"10.1016/j.ins.2022.03.039","title":"Matrix approach for fuzzy description reduction and group decision-making with fuzzy β-covering","year":2022,"lang":"lv","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"National Natural Science Foundation of China","keywords":"Fuzzy logic; Mathematics; Fuzzy number; Fuzzy associative matrix; Matrix (chemical analysis); Reduction (mathematics); Fuzzy classification; Group decision-making; Logical matrix; Data mining; Computer science; Fuzzy set operations; Fuzzy set; Algorithm; Theoretical computer science; Group (periodic table); Artificial intelligence","score_opus":0.031080151841369693,"score_gpt":0.27175616876672976,"score_spread":0.24067601692536006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221096464","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.07850076,0.00038802467,0.9101523,0.00033049544,0.0012995886,0.00089529954,0.000033267203,0.00011029284,0.00828996],"genre_scores_gemma":[0.76138526,0.0000383247,0.23811466,0.0002113222,0.00008881521,0.00012162149,0.000015741578,0.0000051247375,0.000019120873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972477,0.0000810531,0.00060479477,0.00047621378,0.0011197983,0.0004704524],"domain_scores_gemma":[0.99877936,0.000150289,0.00054092647,0.00030061786,0.00013782542,0.00009096311],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002338389,0.00022893972,0.00022684458,0.00051463407,0.002925242,0.002227451,0.0008398863,0.000062954045,0.000013118365],"category_scores_gemma":[0.00007680723,0.00018816467,0.000067289715,0.0015924964,0.00028957936,0.008614717,0.00051239715,0.00021035253,0.000008283874],"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.00025055907,0.0001053801,0.0006741338,0.00017436074,0.00002515035,0.0000016818149,0.015330659,0.18686327,0.000089748384,0.07727169,0.0011133706,0.7181],"study_design_scores_gemma":[0.0008760465,0.0015095765,0.0025655304,0.00009169554,0.000028640241,0.00048407027,0.013818023,0.94416267,0.000011771064,0.0266423,0.009242207,0.0005674605],"about_ca_topic_score_codex":0.00007005214,"about_ca_topic_score_gemma":0.000003951372,"teacher_disagreement_score":0.7572994,"about_ca_system_score_codex":0.00016440138,"about_ca_system_score_gemma":0.0001742864,"threshold_uncertainty_score":0.9988083},"labels":[],"label_agreement":null},{"id":"W4223925960","doi":"10.1016/j.ins.2022.04.027","title":"Federated against the cold: A trust-based federated learning approach to counter the cold start problem in recommendation systems","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Concordia University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cold start (automotive); MovieLens; Recommender system; Machine learning; Artificial intelligence; Benchmark (surveying); Deep learning; Collaborative filtering; Credibility; Information retrieval","score_opus":0.04101153043900531,"score_gpt":0.26681578895435504,"score_spread":0.22580425851534974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4223925960","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.0435835,0.000037515023,0.8460344,0.08638938,0.00088625186,0.0030063223,0.0000546697,0.0010167772,0.018991152],"genre_scores_gemma":[0.9824015,0.0000033791157,0.013292779,0.003444232,0.000010142524,0.00074346346,0.000056910227,0.0000043792456,0.000043212138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751824,0.00043234407,0.0005511218,0.00029151415,0.00083772704,0.00036905555],"domain_scores_gemma":[0.9982629,0.0002782718,0.00034929707,0.0009132555,0.00015979186,0.000036492343],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.005194854,0.00014260119,0.00013568305,0.00034661387,0.00258171,0.0028543537,0.009452807,0.000045443296,0.000010241954],"category_scores_gemma":[0.002142327,0.000091319314,0.000024347073,0.003324308,0.00014980837,0.0027710588,0.009035772,0.00045176945,0.000030406614],"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.000037650418,0.00014159437,0.0021955764,0.00006274259,0.000021689832,0.0000015634348,0.0047713644,0.6962428,0.0006301015,0.011273531,0.25839832,0.026223056],"study_design_scores_gemma":[0.00021550733,0.00008669907,0.00010932558,0.00001445285,9.484597e-7,0.0000048278503,0.0036487323,0.90007156,0.00017878818,0.00016384189,0.09537766,0.00012767714],"about_ca_topic_score_codex":0.00025178117,"about_ca_topic_score_gemma":0.000025022575,"teacher_disagreement_score":0.938818,"about_ca_system_score_codex":0.00030575038,"about_ca_system_score_gemma":0.00033756375,"threshold_uncertainty_score":0.998979},"labels":[],"label_agreement":null},{"id":"W4225264920","doi":"10.1016/j.ins.2022.04.052","title":"CORK: A privacy-preserving and lossless federated learning scheme for deep neural network","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Ministry of Education of the People's Republic of China; Shanxi Provincial Key Research and Development Project; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; MNIST database; Artificial intelligence; Lossless compression; Counterfeit; Inference; Artificial neural network; Machine learning; Scheme (mathematics); Deep learning; Overhead (engineering); Data mining; Data compression","score_opus":0.03948904073060502,"score_gpt":0.28697997804826664,"score_spread":0.2474909373176616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225264920","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.14105733,0.0002448895,0.8364473,0.018475886,0.0007332465,0.00054773083,0.000010987305,0.0010234071,0.0014592375],"genre_scores_gemma":[0.78396416,0.000011115076,0.21513489,0.0006932063,0.00003063613,0.0001251986,0.000019900139,0.000004233779,0.000016653434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981709,0.000086284075,0.00037209393,0.00030767728,0.000578357,0.00048466382],"domain_scores_gemma":[0.9979494,0.0003488279,0.0003004592,0.0012326316,0.0001095202,0.000059140424],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018592251,0.00013260912,0.00014469374,0.0002096063,0.0027072558,0.0013350748,0.014136506,0.000044650722,0.000023645456],"category_scores_gemma":[0.007974141,0.00012708374,0.000032065265,0.0014000506,0.00019678083,0.005477718,0.06299956,0.00029402622,0.0000065783743],"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.00007677052,0.00006724232,0.029078811,0.00018272307,0.0000567093,0.000008307354,0.0054650297,0.16063279,0.000398525,0.039514508,0.2067636,0.557755],"study_design_scores_gemma":[0.0002245309,0.00012274292,0.0007078123,0.000007624678,0.0000014686042,0.000025379617,0.00063272286,0.9547137,0.00007623004,0.025325503,0.01799661,0.00016569614],"about_ca_topic_score_codex":0.000030004581,"about_ca_topic_score_gemma":0.0000052802047,"teacher_disagreement_score":0.7940809,"about_ca_system_score_codex":0.000059351423,"about_ca_system_score_gemma":0.00008631848,"threshold_uncertainty_score":0.9997016},"labels":[],"label_agreement":null},{"id":"W4246225135","doi":"10.1016/j.ins.2003.10.009","title":"Editorial","year":2003,"lang":"es","type":"editorial","venue":"Information Sciences","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":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.01343112448309657,"score_gpt":0.3051205450744952,"score_spread":0.29168942059139863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246225135","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045818724,0.000050611183,0.00011802829,0.00006980133,0.87578857,0.0004941296,0.0010869377,0.00021014472,0.12213597],"genre_scores_gemma":[0.00014453317,0.00012634814,0.00041411922,0.00010117539,0.9982038,0.00005371233,0.0005248243,0.00003184592,0.00039961826],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9871878,0.00030590952,0.0018033904,0.00050173176,0.00913735,0.001063791],"domain_scores_gemma":[0.99359626,0.0010665971,0.0022354012,0.0005735866,0.002211541,0.00031662997],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0073130964,0.000710519,0.0006523396,0.0014729624,0.0015286045,0.0049826987,0.0021210397,0.0016174772,0.0008336705],"category_scores_gemma":[0.010254678,0.0006295489,0.00025929546,0.002967115,0.001859735,0.0155058,0.00021437848,0.0011864776,0.09169608],"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.000036065394,0.000023158893,0.000023865008,0.00007282647,0.000021536216,1.8887674e-7,0.0008184582,0.00024318647,0.000009459339,0.0012100466,0.99646026,0.0010809472],"study_design_scores_gemma":[0.00080883293,0.00025549254,0.0000112676635,0.00013998961,0.00004860006,0.00000256122,0.00062431645,0.00027854496,0.00006484598,0.0003596842,0.99662954,0.0007763107],"about_ca_topic_score_codex":0.00026159498,"about_ca_topic_score_gemma":0.000011141658,"teacher_disagreement_score":0.12241527,"about_ca_system_score_codex":0.00054897583,"about_ca_system_score_gemma":0.0051871864,"threshold_uncertainty_score":0.9997713},"labels":[],"label_agreement":null},{"id":"W4253248299","doi":"10.1016/j.ins.2005.09.005","title":"Attribute value reordering for efficient hybrid OLAP☆","year":2005,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; University of New Brunswick","funders":"","keywords":"Online analytical processing; Normalization (sociology); Heuristics; Computer science; Data cube; Algorithm; Cube (algebra); Dimension (graph theory); Data warehouse; Multidimensional data; Data mining; Mathematics; Combinatorics","score_opus":0.02665205060919379,"score_gpt":0.2877847271022613,"score_spread":0.2611326764930675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253248299","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.014150398,0.000048284623,0.9809315,0.002515796,0.0002703761,0.00023180284,0.000020787611,0.0005833154,0.0012477228],"genre_scores_gemma":[0.5881914,0.0000060010548,0.41115674,0.0005558975,0.000027175269,0.000036193946,0.0000073624597,0.0000015929222,0.000017645227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880594,0.00000860418,0.00030609343,0.00018962011,0.0003799858,0.00030974264],"domain_scores_gemma":[0.9991791,0.00012108118,0.00017252768,0.0003774058,0.00010831648,0.000041550345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073942053,0.00009736374,0.00009528585,0.00024396254,0.0004247335,0.00038328965,0.0014694261,0.000026793054,0.0000035018602],"category_scores_gemma":[0.00041230826,0.000082264174,0.000035988254,0.0006141654,0.00017719608,0.005524227,0.00035715965,0.0000636344,0.00013297386],"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.0000025398933,0.00001654166,0.00004552165,0.000014535442,0.0000032806358,4.304952e-7,0.00070488383,0.23084414,0.00015712505,0.28945482,0.0029618063,0.47579437],"study_design_scores_gemma":[0.00019697582,0.000063899606,0.00011474104,0.000010989685,0.0000011595943,0.000016797143,0.0001646167,0.8066275,0.0144964885,0.0035403934,0.1745998,0.00016665223],"about_ca_topic_score_codex":0.0000047071767,"about_ca_topic_score_gemma":0.0000013224151,"teacher_disagreement_score":0.5757834,"about_ca_system_score_codex":0.00007109516,"about_ca_system_score_gemma":0.00007577173,"threshold_uncertainty_score":0.40049312},"labels":[],"label_agreement":null},{"id":"W4283067317","doi":"10.1016/j.ins.2022.06.061","title":"A q-rung orthopair fuzzy decision-making model with new score function and best-worst method for manufacturer selection","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":98,"is_retracted":false,"has_abstract":false,"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":"Selection (genetic algorithm); Rank (graph theory); Computer science; Score; Fuzzy logic; Product (mathematics); Function (biology); Task (project management); Quality (philosophy); Artificial intelligence; Data mining; Machine learning; Mathematics; Engineering; Systems engineering","score_opus":0.12177980553644743,"score_gpt":0.4158385807792251,"score_spread":0.2940587752427777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283067317","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.15687267,0.00003972346,0.8403143,0.00039360873,0.0006190492,0.00062466844,0.000028781562,0.00008062606,0.0010265546],"genre_scores_gemma":[0.7034345,0.0000021889216,0.29500824,0.0011017518,0.000077624405,0.00008916277,0.0000051965217,0.000009620328,0.00027166645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99429226,0.00015476273,0.0011214331,0.00063879055,0.0033607818,0.00043195908],"domain_scores_gemma":[0.99529505,0.0026901043,0.00082563976,0.0003741738,0.0006458406,0.00016921842],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007959763,0.00025557674,0.00033591094,0.0014458719,0.0024119676,0.0017858326,0.00084896607,0.00007639634,0.00044698492],"category_scores_gemma":[0.0028501807,0.00017991885,0.00010985189,0.0025004258,0.00013807815,0.0054089734,0.00039205232,0.00024231958,0.000045840003],"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.0004264786,0.00002276457,0.0030460726,0.0000058579394,0.000008920761,4.3632036e-7,0.0016351098,0.46587914,0.00010121459,0.0022806688,0.0063163894,0.52027696],"study_design_scores_gemma":[0.0007516538,0.0004899995,0.004945325,0.00003943765,0.000022577762,0.0000921222,0.0037003835,0.87400514,0.00004572488,0.09606671,0.01954112,0.00029977842],"about_ca_topic_score_codex":0.00005894354,"about_ca_topic_score_gemma":0.00014583567,"teacher_disagreement_score":0.5465619,"about_ca_system_score_codex":0.00012588248,"about_ca_system_score_gemma":0.00050244015,"threshold_uncertainty_score":0.9992504},"labels":[],"label_agreement":null},{"id":"W4285404855","doi":"10.1016/j.ins.2022.07.031","title":"GFCNet: Utilizing graph feature collection networks for coronavirus knowledge graph embeddings","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Fundamental Research Funds for the Central Universities; Wuhan University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Key Research and Development Program of China; York University","keywords":"Computer science; Embedding; Knowledge graph; Graph; Relation (database); Task (project management); Coronavirus disease 2019 (COVID-19); Artificial intelligence; Feature (linguistics); Theoretical computer science; Machine learning; Data mining","score_opus":0.04315029785271868,"score_gpt":0.3422635033324763,"score_spread":0.2991132054797576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285404855","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.014200166,0.00067744195,0.9616974,0.003753516,0.0042787413,0.0010773208,0.000018825924,0.00062682776,0.013669735],"genre_scores_gemma":[0.97904557,0.000022104252,0.018751148,0.0014785251,0.000082749786,0.00029878152,0.000026159718,0.0000061611213,0.00028879486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982447,0.00013880018,0.0003593698,0.0002791279,0.0005642483,0.0004137396],"domain_scores_gemma":[0.998829,0.00027967797,0.00033308915,0.00025906254,0.00020602226,0.00009313057],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019518699,0.0001414175,0.00014484,0.0005499833,0.0029995802,0.0005070676,0.0012315289,0.000059546353,0.000033508575],"category_scores_gemma":[0.00014192004,0.00013493338,0.00009379742,0.0029888947,0.00011143697,0.002558386,0.00036356016,0.00035332356,0.000012102188],"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.00006145801,0.000071505754,0.012454826,0.00015312579,0.000023578805,0.0000013571879,0.027581045,0.34766662,0.000027698357,0.20332406,0.063979186,0.3446555],"study_design_scores_gemma":[0.00025226697,0.0002949495,0.0036556942,0.000011988721,0.0000027376807,0.00003391911,0.0011377916,0.86547136,0.000020451524,0.0027071778,0.12622167,0.0001899615],"about_ca_topic_score_codex":0.0001450032,"about_ca_topic_score_gemma":0.00004595724,"teacher_disagreement_score":0.9648454,"about_ca_system_score_codex":0.00012614725,"about_ca_system_score_gemma":0.0002481839,"threshold_uncertainty_score":0.9982984},"labels":[],"label_agreement":null},{"id":"W4287511352","doi":"10.1016/j.ins.2022.07.074","title":"Class-specific weighted broad learning system for imbalanced heartbeat classification","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"ECG Monitoring and Analysis","field":"Medicine","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Heartbeat; Computer science; Generalization; Class (philosophy); Artificial intelligence; Machine learning; Term (time); Scale (ratio); Pattern recognition (psychology); Mathematics","score_opus":0.04245537499133904,"score_gpt":0.30525677605760027,"score_spread":0.2628014010662612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287511352","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.9427975,0.00019965634,0.022548856,0.0033245333,0.0012303621,0.00069383945,0.000022672875,0.0004844869,0.028698087],"genre_scores_gemma":[0.9977347,0.000012353312,0.0013081441,0.00009271436,0.00010536405,0.000107713975,0.00007482753,0.000002940565,0.0005612125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887717,0.000038455477,0.0003091256,0.00011945382,0.00049315544,0.0001626246],"domain_scores_gemma":[0.9994547,0.0000681292,0.0001827469,0.00011234673,0.00012934508,0.000052783034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008124394,0.00006553367,0.00013527194,0.00026368612,0.00097533193,0.00010614992,0.00011082466,0.000023738445,0.000041605937],"category_scores_gemma":[0.00004687243,0.000055296223,0.000073339565,0.0007208442,0.0000568679,0.00049464696,0.00002589806,0.00012474942,0.000050375143],"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.00072594377,0.00026984516,0.30798915,0.0010362102,0.00022193024,0.0000054348498,0.0151135,0.032408167,0.046348296,0.031759467,0.027956393,0.53616565],"study_design_scores_gemma":[0.00094797945,0.00041398007,0.01858924,0.000051092866,0.000033468812,0.00003838866,0.024870751,0.48176152,0.0017581119,0.00003354551,0.47134113,0.00016079652],"about_ca_topic_score_codex":0.000015825904,"about_ca_topic_score_gemma":3.4443204e-7,"teacher_disagreement_score":0.5360049,"about_ca_system_score_codex":0.00015327355,"about_ca_system_score_gemma":0.00007982751,"threshold_uncertainty_score":0.75015634},"labels":[],"label_agreement":null},{"id":"W4289444019","doi":"10.1016/j.ins.2022.07.125","title":"A spatio-temporal sequence-to-sequence network for traffic flow prediction","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Recurrent neural network; Convolution (computer science); Convolutional neural network; Encoder; Node (physics); Sequence (biology); Algorithm; Artificial intelligence; Pattern recognition (psychology); Artificial neural network","score_opus":0.03307046936404626,"score_gpt":0.2586198506734872,"score_spread":0.22554938130944094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289444019","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.06887057,0.000029631336,0.9107464,0.00069391856,0.0025401532,0.0014670902,0.00039933244,0.0075184503,0.0077344626],"genre_scores_gemma":[0.98081774,0.000010405052,0.017819917,0.00051116967,0.000075429336,0.0005697726,0.0001634693,0.00000497186,0.000027141603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989975,0.000015026469,0.00029483906,0.000101755686,0.00036546134,0.00022542731],"domain_scores_gemma":[0.99972665,0.0000236573,0.000052147683,0.0001020308,0.000038042694,0.000057460955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006931486,0.00008852891,0.000078458856,0.00022837934,0.0005577675,0.00012445403,0.0002788502,0.00002296248,0.000050075345],"category_scores_gemma":[0.000021056201,0.0000916151,0.00003755759,0.0007265495,0.000048998634,0.0012806761,0.00004509812,0.00008007929,0.000021582719],"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.0000049521545,0.000003134001,0.00006921248,0.00001269932,0.000003435513,1.0731263e-7,0.00052106444,0.83841765,0.000008806978,0.00088101864,0.09647745,0.06360045],"study_design_scores_gemma":[0.000091143214,0.00010032411,0.00015503711,0.000005559189,0.0000027578694,0.000003127761,0.00026397358,0.7041315,0.000021110714,0.00009771834,0.29505342,0.00007435246],"about_ca_topic_score_codex":0.000010309557,"about_ca_topic_score_gemma":0.000018033026,"teacher_disagreement_score":0.91194713,"about_ca_system_score_codex":0.00011774025,"about_ca_system_score_gemma":0.00004097014,"threshold_uncertainty_score":0.42899534},"labels":[],"label_agreement":null},{"id":"W4292237905","doi":"10.1016/j.ins.2022.06.052","title":"Multi-objective scheduling of priority-based rescue vehicles to extinguish forest fires using a multi-objective discrete gravitational search algorithm","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":93,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"National Natural Science Foundation of China","keywords":"Firefighting; Computer science; Scheduling (production processes); Emergency rescue; Multi-objective optimization; Pareto principle; Mathematical optimization; Operations research; Engineering; Mathematics; Machine learning","score_opus":0.056803093083140854,"score_gpt":0.3180184983496859,"score_spread":0.261215405266545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292237905","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.8088144,0.000015396217,0.18835758,0.00074248086,0.0005413847,0.00084179454,0.00006082273,0.000089154964,0.0005369779],"genre_scores_gemma":[0.937106,7.88361e-7,0.061773915,0.00087677105,0.000072660994,0.00007358872,0.00006274964,0.0000059353865,0.000027553624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978272,0.000047047968,0.00054447656,0.00025310574,0.0010302471,0.0002979775],"domain_scores_gemma":[0.9989708,0.00005597064,0.00018176998,0.00016071749,0.00060495274,0.000025773445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018827227,0.00014857891,0.00016224223,0.0008683362,0.0012026919,0.0003041652,0.0004458818,0.000026023898,0.00010890964],"category_scores_gemma":[0.00051466504,0.00014733044,0.00008093215,0.0019096149,0.00017588484,0.0025670005,0.00038372973,0.00014035472,0.000049441158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034555982,0.00009115856,0.017486362,0.00011552117,0.000016723394,5.375684e-7,0.002739379,0.9683978,0.00022585847,0.0015720977,0.00004349923,0.009276537],"study_design_scores_gemma":[0.0004870243,0.000031118805,0.077116795,0.000026901025,0.000011198522,3.3385865e-7,0.014052706,0.90635985,0.00013024533,0.00013223164,0.0014690172,0.00018260081],"about_ca_topic_score_codex":0.008232672,"about_ca_topic_score_gemma":0.00083252083,"teacher_disagreement_score":0.12829162,"about_ca_system_score_codex":0.00012742821,"about_ca_system_score_gemma":0.00018379188,"threshold_uncertainty_score":0.9983716},"labels":[],"label_agreement":null},{"id":"W4304182941","doi":"10.1016/j.ins.2022.10.039","title":"Mesh Oversegmentation with Segmentation-Aware Loss","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"3D Shape Modeling and Analysis","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":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Polygon mesh; Artificial intelligence; Segmentation; Leverage (statistics); Pattern recognition (psychology); Artificial neural network; Point cloud; End-to-end principle; Cluster analysis; Feature extraction; Feature (linguistics); Deep learning; Face (sociological concept)","score_opus":0.010321555589088807,"score_gpt":0.22328161573493938,"score_spread":0.21296006014585056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304182941","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.53801674,0.00003419186,0.4347466,0.00028489056,0.00031813481,0.00017325183,0.000050839277,0.00040132724,0.025974045],"genre_scores_gemma":[0.9988354,0.000006545882,0.0008689271,0.00016826819,0.000008266596,0.00002840999,0.000043352495,0.0000019414192,0.000038892536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993504,0.00000875201,0.00013200987,0.000044875556,0.0003766674,0.00008726483],"domain_scores_gemma":[0.9998592,0.000011918669,0.000036223635,0.000047125865,0.000025218797,0.000020276579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017876811,0.00004691085,0.000043019758,0.00014126355,0.0003319304,0.000090605514,0.000098628145,0.000006386556,0.0002982867],"category_scores_gemma":[0.0000022956997,0.00004016018,0.000015970907,0.00046982977,0.00003020298,0.0010997778,0.000014603369,0.000043992233,0.00003709099],"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.0000013765555,0.0000020489167,0.0006722875,0.000005655676,0.0000069797597,2.3367346e-7,0.0014633721,0.99196273,0.000029908098,0.00022699783,0.000578402,0.005050019],"study_design_scores_gemma":[0.00017901746,0.000042300162,0.00022169722,0.000003193745,0.000008526776,0.000006258196,0.012988413,0.98377424,0.0005707408,0.00006400169,0.0020375913,0.00010399112],"about_ca_topic_score_codex":0.000018078936,"about_ca_topic_score_gemma":0.00000469786,"teacher_disagreement_score":0.46081865,"about_ca_system_score_codex":0.000052263604,"about_ca_system_score_gemma":0.000023078324,"threshold_uncertainty_score":0.32660303},"labels":[],"label_agreement":null},{"id":"W4306404673","doi":"10.1016/j.ins.2022.09.036","title":"Embedding-based team formation for community question answering","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"Expert finding and Q&A systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Question answering; Embedding; Computer science; Order (exchange); Space (punctuation); Data science; Artificial intelligence","score_opus":0.04333277627546538,"score_gpt":0.32226224651765795,"score_spread":0.27892947024219256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306404673","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.039942335,0.000012800508,0.9547919,0.0007184859,0.00070382905,0.0002845763,0.000010367629,0.00024114907,0.003294553],"genre_scores_gemma":[0.9825719,4.558905e-7,0.016529866,0.00065666763,0.0000204856,0.00016996839,0.000024492032,0.0000016479979,0.00002454013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987239,0.00017407112,0.000330145,0.000084106185,0.00049238064,0.00019534996],"domain_scores_gemma":[0.99919647,0.00018273767,0.00024471842,0.00023898546,0.00009728665,0.00003982508],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0033088028,0.00007611353,0.00008430989,0.00029782683,0.0026463699,0.00052767555,0.00092881895,0.000021828695,0.000005799232],"category_scores_gemma":[0.000125686,0.000071042115,0.000044640507,0.00061215006,0.000050612027,0.005108269,0.00015535051,0.0001344974,0.00001538245],"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.000028045659,0.00013684631,0.0012424035,0.00021554093,0.000009096359,2.974465e-7,0.07009706,0.71706486,0.0011184162,0.10358419,0.019744396,0.08675885],"study_design_scores_gemma":[0.00020974512,0.00020530338,0.00013729466,0.000014384245,8.201125e-7,0.000010227372,0.0028066894,0.95522165,0.0011030347,0.00071823236,0.039464895,0.00010774287],"about_ca_topic_score_codex":0.00014754321,"about_ca_topic_score_gemma":0.000008865155,"teacher_disagreement_score":0.9426295,"about_ca_system_score_codex":0.00012792532,"about_ca_system_score_gemma":0.00010634434,"threshold_uncertainty_score":0.99865204},"labels":[],"label_agreement":null},{"id":"W4307794519","doi":"10.1016/j.ins.2022.10.116","title":"Fuzzy systems research in the United States of America and Canada: A bibliometric overview","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Universidad Michoacana de San Nicolás de Hidalgo; Consejo Nacional de Ciencia y Tecnología","keywords":"Field (mathematics); Fuzzy logic; Computer science; Publication; Bibliometrics; Web of science; Data science; Fuzzy set; Data mining; Visualization; Operations research; Information retrieval; Library science; Artificial intelligence; Political science; Mathematics; MEDLINE","score_opus":0.10693505309878555,"score_gpt":0.32787221834550173,"score_spread":0.2209371652467162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307794519","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.83627284,0.013109624,0.007953662,0.021799738,0.0016667761,0.002322426,0.0000977643,0.0000950662,0.116682105],"genre_scores_gemma":[0.9990063,0.00015458756,0.000063799336,0.00070187583,0.0000052286146,0.000057646237,0.0000029948071,4.4984776e-7,0.0000071593554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975103,0.0004355546,0.00031064797,0.0000898607,0.0014582333,0.00019538387],"domain_scores_gemma":[0.99893403,0.0005762619,0.00014850718,0.00017515867,0.00013689951,0.000029126502],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0037812423,0.000043752512,0.00009904916,0.008087146,0.00039571172,0.00030915957,0.0011282961,0.000008374593,0.0000010921301],"category_scores_gemma":[0.000085312495,0.00002738663,0.000009472596,0.06380328,0.00013761163,0.00086798385,0.00023915152,0.00011007108,0.0000016995855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015481924,0.0000795568,0.015155261,0.00033907252,0.000017385511,0.00001356692,0.025407478,0.11370703,0.000014040585,0.6980216,0.03710443,0.11012511],"study_design_scores_gemma":[0.0005142367,0.00058726623,0.04000812,0.000048185655,0.000002016762,0.00007663643,0.07377056,0.5080268,0.0000029423886,0.007506886,0.369237,0.00021936813],"about_ca_topic_score_codex":0.7311535,"about_ca_topic_score_gemma":0.008153033,"teacher_disagreement_score":0.72300047,"about_ca_system_score_codex":0.00006350831,"about_ca_system_score_gemma":0.0004204564,"threshold_uncertainty_score":0.95609605},"labels":[],"label_agreement":null},{"id":"W4311351088","doi":"10.1016/j.ins.2022.12.017","title":"MIC-Net: A deep network for cross-site segmentation of COVID-19 infection in the fog-assisted IoMT","year":2022,"lang":"en","type":"article","venue":"Information Sciences","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":13,"is_retracted":false,"has_abstract":false,"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; Normalization (sociology); Segmentation; The Internet; Context (archaeology); Deep learning; Artificial intelligence; Data mining; Machine learning; World Wide Web","score_opus":0.06130113148862362,"score_gpt":0.4014718000136166,"score_spread":0.340170668524993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311351088","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.97056717,0.000053128235,0.015645435,0.011744083,0.00040587495,0.0012371466,0.000031631564,0.000049100283,0.00026641876],"genre_scores_gemma":[0.9694703,0.000012486692,0.0011186609,0.028885908,0.000049773862,0.00033408013,0.00011245334,0.0000028948605,0.000013437138],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99860764,0.000075919685,0.00045432532,0.00011122406,0.00057781563,0.0001730594],"domain_scores_gemma":[0.9987786,0.0006085609,0.00033228684,0.00013595053,0.00010115614,0.0000434916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026898815,0.000072225455,0.00012578595,0.00032083018,0.0005743605,0.000108698456,0.00015125147,0.000029011188,0.00007813561],"category_scores_gemma":[0.00069408276,0.000056255558,0.00006123124,0.001519204,0.00015683871,0.00075246923,0.000047112073,0.00008940628,0.000006176592],"study_design_candidate":"observational","study_design_consensus":"observational","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.0003594362,0.00020444476,0.4790699,0.0004470142,0.00002150028,0.0000015234199,0.03498273,0.4361347,0.0007753502,0.0009905802,0.023309188,0.023703642],"study_design_scores_gemma":[0.0031690146,0.0009530395,0.6324227,0.000048270467,0.00004788711,0.00005604539,0.0034287914,0.11296914,0.0005204312,0.0008815312,0.24531561,0.00018754257],"about_ca_topic_score_codex":0.001027447,"about_ca_topic_score_gemma":0.00035692516,"teacher_disagreement_score":0.32316557,"about_ca_system_score_codex":0.00028361,"about_ca_system_score_gemma":0.00039353626,"threshold_uncertainty_score":0.44175744},"labels":[],"label_agreement":null},{"id":"W4313644954","doi":"10.1016/j.ins.2022.12.115","title":"Data-driven set-point control for nonlinear nonaffine systems","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Control theory (sociology); Controller (irrigation); Nonlinear system; Computer science; Feedback linearization; Parametric statistics; Convergence (economics); Nonlinear control; Linearization; Mathematics; Control (management); Artificial intelligence","score_opus":0.03758642766272343,"score_gpt":0.28732545624121447,"score_spread":0.24973902857849103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313644954","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.0019001632,0.000062394916,0.9924695,0.00018773659,0.0011471574,0.00080855965,0.00097598217,0.00084204477,0.0016064622],"genre_scores_gemma":[0.9899584,0.000027140888,0.008423775,0.00010221378,0.00025200951,0.00020915347,0.00092614186,0.000013799161,0.00008736891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989796,0.0000112555745,0.00041096465,0.00010526045,0.0002647655,0.00022811543],"domain_scores_gemma":[0.99933416,0.00015866556,0.00009965117,0.00024544238,0.000117256255,0.000044848777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006437357,0.00009482218,0.00014696922,0.00020810703,0.00015095543,0.00019797155,0.00040803174,0.000042230837,0.0000044055814],"category_scores_gemma":[0.000178704,0.000082571074,0.000021662752,0.0005512593,0.000040774114,0.0032194853,0.00003425801,0.000039466344,0.0002631828],"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.0000027542071,7.9701255e-7,0.000029758641,0.000048276856,0.000008153997,1.03742146e-7,0.00013950937,0.9927539,0.000045970064,0.0004709396,0.004557496,0.0019423033],"study_design_scores_gemma":[0.0004637674,0.000020492784,0.000049211274,0.00001794049,0.000004852598,0.0000024432338,0.00036874053,0.9269498,0.000014438199,0.000029645664,0.071981475,0.000097217395],"about_ca_topic_score_codex":0.000011188641,"about_ca_topic_score_gemma":0.000009409242,"teacher_disagreement_score":0.9880582,"about_ca_system_score_codex":0.000035018504,"about_ca_system_score_gemma":0.000032741464,"threshold_uncertainty_score":0.338277},"labels":[],"label_agreement":null},{"id":"W4315628851","doi":"10.1016/j.ins.2023.01.063","title":"Predefined-time stability for a class of dynamical systems and its application on the consensus control for nonlinear multi-agent systems","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Settling time; Nonlinear system; Upper and lower bounds; Control theory (sociology); Computer science; Convergence (economics); Stability (learning theory); Multi-agent system; Class (philosophy); Protocol (science); Mathematical optimization; Control (management); Topology (electrical circuits); Mathematics; Control engineering; Engineering; Artificial intelligence","score_opus":0.04857077906702088,"score_gpt":0.2867977733831677,"score_spread":0.2382269943161468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315628851","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.06896666,0.000073764844,0.9193071,0.0021330414,0.00067337643,0.0069142478,0.001508215,0.0002403328,0.00018323572],"genre_scores_gemma":[0.99788356,0.000002040934,0.0006213917,0.00007283143,0.000032443142,0.0013036823,0.00004783256,0.0000038927487,0.000032350134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788266,0.00013733623,0.0008203701,0.00028730862,0.0005543289,0.00031799817],"domain_scores_gemma":[0.996481,0.0019152856,0.0005853958,0.00038169653,0.0005574448,0.000079169506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036211167,0.00015264656,0.00029772928,0.00016717461,0.0003490542,0.00039976358,0.00074608455,0.00008062918,6.0207753e-7],"category_scores_gemma":[0.0008843003,0.00010244098,0.000079434336,0.00061139825,0.00015741929,0.00058086286,0.00006866884,0.000054379998,0.00005250117],"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.0003427479,0.0003141874,0.0010170367,0.0021721758,0.0002387249,5.870332e-7,0.0042250385,0.21152724,0.014424398,0.7510722,0.004428283,0.01023736],"study_design_scores_gemma":[0.001141707,0.00015952124,0.00035543126,0.00004155877,0.000009858464,0.0000030102356,0.000557441,0.99410546,0.00022154298,0.000052567808,0.003238612,0.00011328358],"about_ca_topic_score_codex":0.000044466637,"about_ca_topic_score_gemma":0.0000035911094,"teacher_disagreement_score":0.9289169,"about_ca_system_score_codex":0.000070566755,"about_ca_system_score_gemma":0.00013541194,"threshold_uncertainty_score":0.4177422},"labels":[],"label_agreement":null},{"id":"W4318323524","doi":"10.1016/j.ins.2023.01.103","title":"PSO-ELPM: PSO with elite learning, enhanced parameter updating, and exponential mutation operator","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Particle swarm optimization; Mathematical optimization; Benchmark (surveying); Operator (biology); Exponential function; Mutation; Population; Mathematics; Wilcoxon signed-rank test; Computer science; Statistics","score_opus":0.020217666523122513,"score_gpt":0.2964951871606678,"score_spread":0.2762775206375453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318323524","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.11643689,0.000011466401,0.8765875,0.00065007864,0.00019343042,0.0002609938,0.0000024916583,0.0002948437,0.0055622687],"genre_scores_gemma":[0.8830028,0.00008224045,0.11597562,0.00037245074,0.00003646499,0.000064565786,0.0000314161,0.000005495726,0.00042895792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799067,0.00011545232,0.00035692623,0.00025736095,0.00097108504,0.00030851792],"domain_scores_gemma":[0.9989954,0.00020450553,0.00019023643,0.00019440679,0.00030119554,0.00011425744],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001363457,0.000114777766,0.00011856292,0.00048473288,0.0005389483,0.0015028787,0.00052976847,0.000039997212,0.0000733334],"category_scores_gemma":[0.0006747872,0.000087580636,0.00001823542,0.0019878913,0.00022623444,0.0049572336,0.00016091502,0.00012939899,0.00040676226],"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.00003721246,0.000047223126,0.0019919744,0.00011069346,0.00004586869,0.000015285157,0.031169271,0.18669194,0.0012067389,0.027948057,0.0025994438,0.7481363],"study_design_scores_gemma":[0.0003482823,0.00015821143,0.0022417675,0.000019818897,0.0000022356624,0.000014008808,0.001076397,0.9897795,0.002480386,0.00021606452,0.003500351,0.00016299722],"about_ca_topic_score_codex":0.000025371211,"about_ca_topic_score_gemma":0.0000028456677,"teacher_disagreement_score":0.80308753,"about_ca_system_score_codex":0.000018478406,"about_ca_system_score_gemma":0.00015887788,"threshold_uncertainty_score":0.99953365},"labels":[],"label_agreement":null},{"id":"W4328055046","doi":"10.1016/j.ins.2023.03.102","title":"Store, share and transfer: Learning and updating sentiment knowledge for aspect-based sentiment analysis","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Natural Science Foundation of China","keywords":"Computer science; Sentiment analysis; Sentence; Natural language processing; Artificial intelligence; Graph; Context (archaeology); Dependency (UML); Domain knowledge; Theoretical computer science","score_opus":0.03226027747906481,"score_gpt":0.31461164892717625,"score_spread":0.28235137144811145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328055046","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.34308144,0.0002055561,0.6515631,0.0013767185,0.00023795037,0.00039868505,0.000013929057,0.0003265073,0.0027960925],"genre_scores_gemma":[0.9905823,0.000024013063,0.009033548,0.00011690514,0.000021155014,0.000029114886,0.000053893342,0.0000024093931,0.00013667211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987446,0.00004244707,0.00035348028,0.00025808107,0.0003592151,0.00024219477],"domain_scores_gemma":[0.99941516,0.0001911255,0.00010817049,0.00010732481,0.00009918171,0.000079046105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013540077,0.00011241903,0.00017671994,0.0008722765,0.00069327187,0.0008579571,0.000247128,0.000029585359,0.000032811673],"category_scores_gemma":[0.000042000123,0.00009679518,0.000091795875,0.0024076232,0.000075309465,0.0015407406,0.00010612104,0.00005174313,0.00003114485],"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.00002930395,0.00013954258,0.20797296,0.00042114608,0.0012415005,0.0000031152256,0.055411097,0.11185363,0.0013718741,0.08263855,0.0045696707,0.5343476],"study_design_scores_gemma":[0.0002871772,0.000059452886,0.0057330984,0.00001727365,0.00005729857,5.274955e-7,0.0017557859,0.98448855,0.00079076906,0.00006717898,0.006605445,0.00013745915],"about_ca_topic_score_codex":0.000010897708,"about_ca_topic_score_gemma":0.0000085702095,"teacher_disagreement_score":0.8726349,"about_ca_system_score_codex":0.000020347055,"about_ca_system_score_gemma":0.000047888254,"threshold_uncertainty_score":0.82733},"labels":[],"label_agreement":null},{"id":"W4361002030","doi":"10.1016/j.ins.2023.03.110","title":"Priority ranking for the best-worst method","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; Sichuan University; National Natural Science Foundation of China","keywords":"Pairwise comparison; Prioritization; Consistency (knowledge bases); Ranking (information retrieval); Logarithm; Computer science; Mathematical optimization; Simple (philosophy); Monte Carlo method; Mathematics; Statistics; Machine learning; Artificial intelligence; Management science","score_opus":0.42360341012623437,"score_gpt":0.5537606757160536,"score_spread":0.13015726558981922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361002030","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.027768308,0.000049514372,0.9544481,0.0057624746,0.0028296518,0.0008147745,0.00004858784,0.00018965425,0.008088906],"genre_scores_gemma":[0.89989156,0.000031003714,0.09552297,0.00264837,0.00033761532,0.00017442979,0.000008401929,0.000010111402,0.0013755604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951069,0.00018272502,0.001080756,0.00030671342,0.0029136303,0.00040932157],"domain_scores_gemma":[0.98442847,0.013709965,0.0005083392,0.00056466315,0.0007112376,0.00007734729],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.029944463,0.00013334231,0.0002144636,0.0008123707,0.0016962436,0.0027146887,0.0022265387,0.00006490847,0.00021807423],"category_scores_gemma":[0.019239707,0.00007172283,0.00013713216,0.004893996,0.00028216673,0.003988396,0.00034683832,0.00010982377,0.002271398],"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.00001809249,0.000005698789,0.001189114,0.000004423655,0.000005209632,3.515295e-7,0.0038267097,0.008755056,0.0001092399,0.0101045,0.017138405,0.9588432],"study_design_scores_gemma":[0.00028403563,0.00003547204,0.0052034054,0.00001391544,0.0000059608583,0.000006710904,0.008960294,0.5510764,0.00022995032,0.031370535,0.40268,0.00013332108],"about_ca_topic_score_codex":0.00004823073,"about_ca_topic_score_gemma":0.00002465944,"teacher_disagreement_score":0.9587099,"about_ca_system_score_codex":0.000028523838,"about_ca_system_score_gemma":0.00018092676,"threshold_uncertainty_score":0.9996034},"labels":[],"label_agreement":null},{"id":"W4364356857","doi":"10.1016/j.ins.2023.04.010","title":"Low-rank with sparsity constraints for image denoising","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Department of Science and Technology of Sichuan Province; Key Science and Technology Program of Shaanxi Province; China Scholarship Council","keywords":"Artificial intelligence; Noise reduction; Pattern recognition (psychology); Prior probability; Computer science; Neural coding; Image (mathematics); Rank (graph theory); Non-local means; Sparse approximation; Mathematics; Noise (video); Image denoising; Bayesian probability","score_opus":0.03978236051904001,"score_gpt":0.31155898264708237,"score_spread":0.2717766221280424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364356857","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.03362759,0.0000039456186,0.95976835,0.0006541322,0.00020620621,0.00015825851,0.0000045065067,0.00022350221,0.005353482],"genre_scores_gemma":[0.5321998,0.0000036606802,0.46659964,0.0010220658,0.000040318006,0.000016239745,0.000006447107,0.0000028998963,0.00010892825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895364,0.000034301007,0.00019918628,0.00014350777,0.0003949248,0.0002744481],"domain_scores_gemma":[0.99925584,0.00023373033,0.0001097154,0.00016416406,0.0001813979,0.0000551317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017470237,0.00007958662,0.000093806484,0.00024577434,0.0005160891,0.00084737595,0.00062770286,0.000025870313,0.000009269369],"category_scores_gemma":[0.00015085711,0.000059740905,0.000033303848,0.0010720036,0.00034385506,0.0050472654,0.0000860515,0.00004735355,0.0002217434],"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.000049621493,0.00003377716,0.0004534599,0.00014594676,0.000018797873,0.000022642394,0.01120199,0.004675726,0.015482797,0.052300803,0.00918123,0.9064332],"study_design_scores_gemma":[0.0035640765,0.00078762346,0.009870323,0.00025081413,0.000020222684,0.0002260884,0.002431207,0.6959038,0.24061207,0.026844881,0.018341936,0.0011469753],"about_ca_topic_score_codex":0.000008049527,"about_ca_topic_score_gemma":0.0000015667679,"teacher_disagreement_score":0.90528625,"about_ca_system_score_codex":0.000015596957,"about_ca_system_score_gemma":0.00015471166,"threshold_uncertainty_score":0.8171266},"labels":[],"label_agreement":null},{"id":"W4368363113","doi":"10.1016/j.ins.2023.119058","title":"Key-value data collection and statistical analysis with local differential privacy","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":9,"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":"Sichuan Province Science and Technology Support Program; National Natural Science Foundation of China","keywords":"Key (lock); Computer science; Differential privacy; Categorical variable; Data collection; Data mining; Variance (accounting); Sampling (signal processing); Value (mathematics); Statistics; Mathematics; Machine learning; Computer security","score_opus":0.04951285878757365,"score_gpt":0.3165464273946334,"score_spread":0.26703356860705973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368363113","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.036707573,0.0000046278506,0.95652294,0.005539842,0.000109794244,0.0001019793,0.000055286975,0.00053284335,0.00042512128],"genre_scores_gemma":[0.80102885,0.00002685278,0.19868053,0.0000838176,0.000007835253,0.000008803228,0.00015319524,0.0000015083488,0.000008599647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845976,0.000041831125,0.0002531425,0.00032798699,0.0006678787,0.00024938225],"domain_scores_gemma":[0.99680114,0.00022304412,0.000120472134,0.0027381908,0.000060056052,0.00005709688],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00078547694,0.000094352414,0.00013141466,0.00068953366,0.00039813374,0.0008139194,0.011775141,0.000046775276,0.000014341141],"category_scores_gemma":[0.0036366947,0.00006920837,0.000011375071,0.0049384586,0.0005285846,0.0057173804,0.029426958,0.00009811329,0.000055945173],"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.000049673105,0.00007353388,0.042048916,0.000095115625,0.00039139547,0.000017851931,0.0030188798,0.0043616714,0.000056785946,0.13134304,0.32300302,0.4955401],"study_design_scores_gemma":[0.00012485824,0.00006287202,0.039343305,0.000005381937,0.000020661779,0.000007069651,0.00016192434,0.94661635,0.00006704578,0.01200902,0.0014792172,0.00010227397],"about_ca_topic_score_codex":0.0001444722,"about_ca_topic_score_gemma":0.000031675507,"teacher_disagreement_score":0.9422547,"about_ca_system_score_codex":0.000028106224,"about_ca_system_score_gemma":0.00011531728,"threshold_uncertainty_score":0.99357164},"labels":[],"label_agreement":null},{"id":"W4378374920","doi":"10.1016/j.ins.2023.119231","title":"Trusted fingerprint localization for multimedia devices based on blockchain","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Fingerprint (computing); Robustness (evolution); Blockchain; Upload; Vulnerability (computing); Scheme (mathematics); Computer security; Process (computing); Spoofing attack; Collusion; Subsequence; Data mining; Computer network; World Wide Web","score_opus":0.02743374244911958,"score_gpt":0.29201064935299936,"score_spread":0.2645769069038798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378374920","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.0031190217,0.0000023177847,0.9934156,0.0008486993,0.00023556179,0.00028707238,0.000005820994,0.00084344565,0.001242441],"genre_scores_gemma":[0.89734316,0.0000023156251,0.10103359,0.0014744635,0.000019721028,0.000095975935,0.000016592467,0.0000022928202,0.000011871563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989883,0.000025789874,0.00025252916,0.00015747974,0.00035468675,0.0002212417],"domain_scores_gemma":[0.9992613,0.0002491746,0.00014242485,0.00019757205,0.00010705812,0.00004246559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086130336,0.00009105987,0.00007980944,0.00058839633,0.00041052836,0.00026609423,0.0006255699,0.000044105953,0.0000023267132],"category_scores_gemma":[0.00014590999,0.00007299506,0.00004814687,0.0015968323,0.00008928143,0.0011422858,0.000059144117,0.000041137602,0.00003406895],"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.00003269278,0.000040450217,0.0027811953,0.0000999683,0.000007128778,0.0000012093435,0.0041097873,0.42133486,0.00011145645,0.04673634,0.0035253814,0.52121955],"study_design_scores_gemma":[0.00016817708,0.00009930352,0.001016263,0.000032511754,8.957469e-7,4.1784284e-7,0.00006189734,0.97866917,0.003656298,0.0042686826,0.011919033,0.000107348365],"about_ca_topic_score_codex":0.000006394772,"about_ca_topic_score_gemma":0.000002757713,"teacher_disagreement_score":0.89422417,"about_ca_system_score_codex":0.000016324946,"about_ca_system_score_gemma":0.00005001808,"threshold_uncertainty_score":0.31574938},"labels":[],"label_agreement":null},{"id":"W4378649652","doi":"10.1016/j.ins.2023.119247","title":"UtilityAware: A framework for data privacy protection in e-health","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Data publishing; Computer science; Adversary; Differential privacy; Publication; Information sensitivity; Generalization; Information privacy; Privacy software; Personally identifiable information; Data mining; Computer security; Information retrieval; Publishing; Mathematics","score_opus":0.20642405023636085,"score_gpt":0.4000449361176447,"score_spread":0.19362088588128384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378649652","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019645921,0.000016647917,0.90984446,0.085968144,0.00040966008,0.00065577996,0.00003985046,0.0009577535,0.00014309092],"genre_scores_gemma":[0.18005915,0.000051974806,0.81889373,0.00072614074,0.000022590953,0.00016512626,0.00007238641,0.000002836901,0.0000060676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982779,0.0000452179,0.000476409,0.00034367535,0.00046667582,0.0003901344],"domain_scores_gemma":[0.994474,0.00028603565,0.00025749922,0.004881017,0.00006009441,0.000041362695],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0044099228,0.000086678905,0.00011462655,0.00057352276,0.00032775494,0.00047914375,0.028044317,0.000079688296,0.0000033268964],"category_scores_gemma":[0.047041107,0.00007692484,0.000016408547,0.0036587757,0.00014214973,0.009087907,0.033332385,0.00016713557,0.00011307318],"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.000005874736,0.000021562686,0.0010286322,0.00016205458,0.000003324741,4.3428196e-7,0.0012822759,0.00020406657,0.000006969788,0.06603684,0.09508143,0.8361665],"study_design_scores_gemma":[0.0000718769,0.000042134972,0.0018104415,0.00004153969,1.5697168e-7,0.000001482556,0.0001219751,0.6215624,0.000048145932,0.35111526,0.025121193,0.00006336449],"about_ca_topic_score_codex":0.00018116488,"about_ca_topic_score_gemma":0.00001851664,"teacher_disagreement_score":0.83610314,"about_ca_system_score_codex":0.000073124764,"about_ca_system_score_gemma":0.00031088592,"threshold_uncertainty_score":0.97721446},"labels":[],"label_agreement":null},{"id":"W4378977491","doi":"10.1016/j.ins.2023.119276","title":"Refined fault tolerant tracking control of fixed-wing UAVs via fractional calculus and interval type-2 fuzzy neural network under event-triggered communication","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Computer science; Fault tolerance; Interval (graph theory); Fuzzy logic; Event (particle physics); Tracking (education); Artificial neural network; Synchronization (alternating current); Fault (geology); Real-time computing; Control (management); Distributed computing; Mathematics; Computer network; Artificial intelligence","score_opus":0.03363522350224157,"score_gpt":0.29347387469805825,"score_spread":0.2598386511958167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378977491","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.13458684,0.00018528331,0.85927534,0.0034819539,0.0010582387,0.00038953612,0.000019125006,0.00024164107,0.00076204294],"genre_scores_gemma":[0.9986663,0.000009767144,0.00079571945,0.000423465,0.000041194457,0.000015807995,0.000028989052,0.0000026287998,0.000016139658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981206,0.000156783,0.0006747464,0.00016886,0.000594719,0.00028427778],"domain_scores_gemma":[0.9985017,0.0003664311,0.00047142807,0.0002969646,0.00029400492,0.00006945953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015562396,0.00012224392,0.00021483313,0.00020377977,0.00040371384,0.00040988624,0.0007340386,0.00006340824,0.000008028773],"category_scores_gemma":[0.00015772381,0.00010483134,0.000058995975,0.0012131453,0.00014233876,0.0036635287,0.00015221418,0.00012486299,0.000044532026],"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.00007958097,0.00004738076,0.0041721747,0.00006699062,0.000084878375,0.0000022591971,0.003833265,0.8139286,0.001790109,0.038267795,0.0022631253,0.13546385],"study_design_scores_gemma":[0.0006818672,0.000057733374,0.0231375,0.00005491032,0.0000065749127,0.000010460911,0.00042506872,0.9734278,0.000069590154,0.0009139368,0.0010955489,0.00011901326],"about_ca_topic_score_codex":0.00016328793,"about_ca_topic_score_gemma":0.00003657001,"teacher_disagreement_score":0.8640794,"about_ca_system_score_codex":0.00004880759,"about_ca_system_score_gemma":0.000086992135,"threshold_uncertainty_score":0.4274898},"labels":[],"label_agreement":null},{"id":"W4379383388","doi":"10.1016/j.ins.2023.119219","title":"INFER: Distilling knowledge from human-generated rules with uncertainty for STINs","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Process (computing); Human intelligence; Set (abstract data type); Knowledge extraction; Data mining","score_opus":0.064384667922655,"score_gpt":0.3379413348105341,"score_spread":0.2735566668878791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379383388","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.20422643,0.00001561359,0.7885901,0.000976025,0.00022755368,0.0001979731,0.00008158075,0.0005663399,0.005118398],"genre_scores_gemma":[0.9789711,0.0000060709754,0.020043796,0.00012548802,0.00005831062,0.000047728427,0.0006331108,0.0000024527603,0.00011194509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907637,0.0000326564,0.00025346142,0.0001847263,0.0002607075,0.00019210808],"domain_scores_gemma":[0.9991572,0.00022326753,0.00016749854,0.0002315108,0.0001696013,0.000050942646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073397584,0.00008704785,0.000085980304,0.00021859919,0.00068505254,0.0006885691,0.0006623641,0.00003055545,0.000009191752],"category_scores_gemma":[0.00019089424,0.00006199783,0.000020432864,0.000982129,0.000104127495,0.0022850807,0.00008937676,0.000060288006,0.00025595355],"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.000018885232,0.000051452123,0.0109706065,0.00006702475,0.000026146265,6.6882285e-7,0.014147709,0.07361988,0.0009993862,0.45089144,0.008819366,0.44038746],"study_design_scores_gemma":[0.00022168076,0.00007486779,0.019374814,0.000021135133,0.0000026313414,5.859838e-7,0.00027503335,0.9215586,0.00024352504,0.002634405,0.05546147,0.0001312574],"about_ca_topic_score_codex":0.00022770141,"about_ca_topic_score_gemma":0.00009389803,"teacher_disagreement_score":0.8479387,"about_ca_system_score_codex":0.000021482178,"about_ca_system_score_gemma":0.00012623833,"threshold_uncertainty_score":0.66398877},"labels":[],"label_agreement":null},{"id":"W4383216495","doi":"10.1016/j.ins.2023.119371","title":"DyHNet: Learning dynamic heterogeneous network representations","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Computer science; Node (physics); Task (project management); Semantics (computer science); Representation (politics); Artificial intelligence; Baseline (sea); State (computer science); Machine learning","score_opus":0.017741590963126184,"score_gpt":0.32159697203193816,"score_spread":0.303855381068812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383216495","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.578838,0.000038440856,0.2617002,0.00092104083,0.00039807925,0.00044413123,0.000014412483,0.0014255061,0.1562202],"genre_scores_gemma":[0.9985515,0.000004607258,0.0009131399,0.00004850018,0.000072161725,0.000026007647,0.00008627099,0.000002421685,0.00029542577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991909,0.000032541404,0.0002394923,0.00009420701,0.00022867785,0.00021412627],"domain_scores_gemma":[0.9995915,0.000078031924,0.0001331037,0.00011365773,0.000050609477,0.00003306622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041392227,0.00006474562,0.00007889192,0.00015829076,0.0005187843,0.00021338994,0.00020331792,0.000012494544,0.0002805332],"category_scores_gemma":[0.000011081837,0.00005907132,0.00006066414,0.0014073609,0.00008012606,0.0007321939,0.00008028212,0.00007098362,0.00041302814],"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.0000012430386,0.000004830482,0.04436999,0.0000021729466,0.000021814405,2.3904968e-7,0.0007086173,0.850854,0.000020151641,0.009987405,0.008870538,0.08515904],"study_design_scores_gemma":[0.0000706232,0.00002744813,0.009687222,0.0000107673595,0.000009299587,9.839046e-7,0.0009671518,0.93303686,0.00007965823,0.018726088,0.037236493,0.00014742803],"about_ca_topic_score_codex":0.000100421756,"about_ca_topic_score_gemma":0.00001062372,"teacher_disagreement_score":0.41971347,"about_ca_system_score_codex":0.00001028272,"about_ca_system_score_gemma":0.000027263619,"threshold_uncertainty_score":0.5308779},"labels":[],"label_agreement":null},{"id":"W4385578886","doi":"10.1016/j.ins.2023.119437","title":"Identify potential circRNA-disease associations through a multi-objective evolutionary algorithm","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Circular RNAs in diseases","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Science, Technology and Innovation Commission of Shenzhen Municipality; National Natural Science Foundation of China","keywords":"Computer science; Evolutionary algorithm; Mathematical optimization; Multi-objective optimization; Convergence (economics); Set (abstract data type); Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.025793085539871103,"score_gpt":0.32997933276184493,"score_spread":0.30418624722197385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385578886","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.6517053,0.00081132055,0.33339936,0.0013443102,0.0025525566,0.0009849226,0.0016588151,0.00043759175,0.007105789],"genre_scores_gemma":[0.99521255,0.00007826138,0.0030215299,0.00044762425,0.00016067957,0.0000507186,0.0008307929,0.0000055784662,0.0001922609],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99889225,0.00005458381,0.00022553997,0.00018069318,0.00042579995,0.00022115587],"domain_scores_gemma":[0.9994086,0.00001707668,0.00013020977,0.00017417235,0.00018927676,0.000080679034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031522338,0.00009245359,0.00006656674,0.00012031167,0.00045065314,0.00013656658,0.0002700483,0.000058995018,0.000022483975],"category_scores_gemma":[0.0006428367,0.00009364401,0.000099547826,0.0005612531,0.00020012223,0.00015440003,0.00014485113,0.000045587436,0.00028331587],"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.00021807397,0.0014266658,0.1669792,0.00028235535,0.001042314,0.00005688281,0.009786442,0.17464739,0.08324249,0.008935851,0.31638464,0.2369977],"study_design_scores_gemma":[0.0007953131,0.000079262754,0.90448815,0.000018205867,0.000041404994,0.000009706577,0.0017407319,0.06572684,0.0025595515,0.0032138007,0.02091629,0.00041071928],"about_ca_topic_score_codex":0.000047494388,"about_ca_topic_score_gemma":0.0000047523436,"teacher_disagreement_score":0.73750895,"about_ca_system_score_codex":0.00003339518,"about_ca_system_score_gemma":0.0002493951,"threshold_uncertainty_score":0.3818692},"labels":[],"label_agreement":null},{"id":"W4385729101","doi":"10.1016/j.ins.2023.119481","title":"Reward shaping using convolutional neural network","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Reinforcement Learning in Robotics","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":"Concordia University","funders":"","keywords":"Computer science; Markov decision process; Reinforcement learning; Convolutional neural network; Stochastic matrix; Representation (politics); Convolution (computer science); Artificial intelligence; Matrix (chemical analysis); Function (biology); Markov chain; Bellman equation; Algorithm; Artificial neural network; Markov process; Machine learning; Mathematical optimization; Mathematics; Statistics","score_opus":0.12628818183703894,"score_gpt":0.3253652114570306,"score_spread":0.19907702961999169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385729101","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.018145045,0.000011360731,0.9736726,0.0007472765,0.0011271706,0.00009504554,5.391678e-7,0.00041892013,0.005782017],"genre_scores_gemma":[0.95292807,0.000007130563,0.0454482,0.001337666,0.00014203197,0.000005111736,0.000008024496,0.0000025816735,0.000121179444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998474,0.00003210565,0.0003232408,0.00012391001,0.00068090076,0.00036586748],"domain_scores_gemma":[0.9993793,0.000112444046,0.00018094828,0.00017170909,0.00010007141,0.00005555179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011189037,0.00007925187,0.000077191275,0.00023496118,0.0006526841,0.0006398838,0.00082929735,0.000032595395,0.00001799436],"category_scores_gemma":[0.00013688585,0.00007138437,0.000035891553,0.0020450894,0.00014725317,0.0051175486,0.00030056218,0.00008608896,0.0005075623],"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":[3.9540194e-7,4.4119471e-7,0.0015300572,0.0000035214089,0.0000016383923,4.0641453e-7,0.00038717187,0.96949375,0.000009187403,0.02513359,0.0014456772,0.0019941872],"study_design_scores_gemma":[0.000068604415,0.000022698712,0.0047035087,0.000014019974,9.1147854e-7,0.000009371443,0.00009180405,0.9880069,0.0000114748955,0.0007492065,0.00622582,0.00009566577],"about_ca_topic_score_codex":0.000016749125,"about_ca_topic_score_gemma":5.199238e-7,"teacher_disagreement_score":0.93478304,"about_ca_system_score_codex":0.00004090004,"about_ca_system_score_gemma":0.00013742829,"threshold_uncertainty_score":0.6523856},"labels":[],"label_agreement":null},{"id":"W4385737670","doi":"10.1016/j.ins.2023.119480","title":"Efficient and privacy-preserving tree-based inference via additive homomorphic encryption","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Shanxi Provincial Key Research and Development Project; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Inference; Ciphertext; Encryption; Data mining; Theoretical computer science; Interpretability; Scheme (mathematics); Artificial intelligence; Machine learning; Computer security","score_opus":0.025700730386582514,"score_gpt":0.27346101720839755,"score_spread":0.24776028682181503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385737670","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.2520471,0.000017309794,0.74481153,0.0008427492,0.00021084097,0.0001709867,0.000024733783,0.00045487905,0.0014198855],"genre_scores_gemma":[0.98998195,0.0000144976075,0.009662445,0.00028216664,0.0000144247115,0.000021247326,0.000020870633,0.0000014521011,9.394415e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986609,0.000049571616,0.00026281967,0.00021243963,0.00055439124,0.0002598452],"domain_scores_gemma":[0.9990304,0.00030027842,0.00014843786,0.0003131635,0.000118484626,0.000089215304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009826055,0.00010336484,0.000092777016,0.0005487267,0.0004975427,0.0006305838,0.0009289686,0.000042140553,0.000020701404],"category_scores_gemma":[0.00030022682,0.00008792556,0.0000336319,0.0024540185,0.00025911137,0.002639143,0.00045278922,0.00008605214,0.0001970845],"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.000025267578,0.000109142435,0.010518584,0.00013620532,0.000017272869,0.000008182325,0.022996841,0.028261201,0.0010503278,0.30892208,0.0039055657,0.6240493],"study_design_scores_gemma":[0.00018858732,0.00006822683,0.042688537,0.000026934942,0.0000016493155,0.0000023766904,0.00023915495,0.9467771,0.00051318615,0.0068977945,0.0024577428,0.00013871427],"about_ca_topic_score_codex":0.00006551151,"about_ca_topic_score_gemma":0.000016450065,"teacher_disagreement_score":0.9185159,"about_ca_system_score_codex":0.000014325366,"about_ca_system_score_gemma":0.00010344508,"threshold_uncertainty_score":0.6080734},"labels":[],"label_agreement":null},{"id":"W4385741168","doi":"10.1016/j.ins.2023.119487","title":"Pioneering approaches for enhancing the speed of hierarchical LA by ordering the actions","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Estimator; A priori and a posteriori; Benchmark (surveying); Assertion; Automaton; Tree (set theory); Salient; Theoretical computer science; Action (physics); Convergence (economics); Algorithm; Artificial intelligence; Mathematics","score_opus":0.10418225204715947,"score_gpt":0.31282389437804803,"score_spread":0.20864164233088855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385741168","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.0038746053,0.0000068943714,0.98179483,0.0062651215,0.00011012053,0.0002320035,0.0000028287575,0.0000859472,0.0076276637],"genre_scores_gemma":[0.9909223,0.000018793085,0.00867721,0.00021365687,0.000013068989,0.00003725074,0.00000389462,0.000001589956,0.00011224418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992363,0.00003935526,0.00020938175,0.00006871166,0.00030027516,0.00014601742],"domain_scores_gemma":[0.99917895,0.0005267612,0.00008122741,0.00013604066,0.000054183663,0.000022815224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018312132,0.000041384348,0.000046861365,0.000102257145,0.0005584472,0.0003570947,0.00067083415,0.000017904737,0.0000030576762],"category_scores_gemma":[0.0002183378,0.00002287459,0.000028209572,0.0010920357,0.00018225018,0.001428091,0.00013096875,0.000066782195,0.000013057819],"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.0000023662708,0.000011666833,0.000041615247,0.000030244897,0.000009552641,3.543429e-8,0.018405654,0.48988065,0.0010039127,0.39652377,0.003738562,0.090351984],"study_design_scores_gemma":[0.000060127502,0.000017396436,0.00013592494,0.000006332183,6.3847693e-7,0.0000015590434,0.001489958,0.9778248,0.0013450611,0.0019091435,0.017172161,0.000036862773],"about_ca_topic_score_codex":0.000010601903,"about_ca_topic_score_gemma":0.0000048986603,"teacher_disagreement_score":0.9870477,"about_ca_system_score_codex":0.000007090014,"about_ca_system_score_gemma":0.00007267262,"threshold_uncertainty_score":0.42951807},"labels":[],"label_agreement":null},{"id":"W4387824501","doi":"10.1016/j.ins.2023.119799","title":"Z-relation-based multistage decision making","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reliability (semiconductor); Computer science; Relation (database); State (computer science); Class (philosophy); Fuzzy logic; Operations research; Mathematical optimization; Mathematics; Data mining; Algorithm; Artificial intelligence","score_opus":0.22499797294568444,"score_gpt":0.48561020064794724,"score_spread":0.2606122277022628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387824501","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.37364835,0.00001905526,0.60166985,0.0010790478,0.0030423796,0.0004246213,0.000041689516,0.00053709553,0.019537916],"genre_scores_gemma":[0.9691399,0.0000019699644,0.029411493,0.00112968,0.000054801407,0.000019476978,0.000010493635,0.0000062505587,0.00022594015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99263763,0.00017274969,0.0016054359,0.0004483557,0.0046582143,0.0004776027],"domain_scores_gemma":[0.9904567,0.0074300915,0.00068435277,0.0006747141,0.00063128804,0.00012286859],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.011514296,0.00019288089,0.00026238305,0.0026287073,0.0010544794,0.0024796845,0.0017811839,0.00011475667,0.0014736009],"category_scores_gemma":[0.018587686,0.00013961711,0.00014531241,0.0068856496,0.00033386145,0.0052889916,0.00029874325,0.00014637498,0.016068075],"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.00004147018,0.000014535173,0.023303395,0.000004920964,0.0000029933706,0.00000649853,0.0015461541,0.12954834,0.00013430609,0.004534281,0.028676586,0.81218654],"study_design_scores_gemma":[0.00038752743,0.000032581884,0.13282791,0.00005909091,0.000002040415,0.000004184541,0.0012946881,0.7788309,0.00006767138,0.01850213,0.067781635,0.00020965564],"about_ca_topic_score_codex":0.000016778216,"about_ca_topic_score_gemma":0.000022563441,"teacher_disagreement_score":0.81197685,"about_ca_system_score_codex":0.000065728535,"about_ca_system_score_gemma":0.0002205835,"threshold_uncertainty_score":0.9994392},"labels":[],"label_agreement":null},{"id":"W4391277777","doi":"10.1016/j.ins.2024.120231","title":"Probabilistic rotation modeling based on directional mixture density networks","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Robustness (evolution); Probabilistic logic; Artificial intelligence; Algorithm; Ambiguity; Statistical model; Noise (video); Machine learning; Flexibility (engineering); Rotation (mathematics); Pattern recognition (psychology); Mathematics; Image (mathematics); Statistics","score_opus":0.013589856287362246,"score_gpt":0.22360338166513044,"score_spread":0.21001352537776818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391277777","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.02288053,0.000034650388,0.9716381,0.00012905626,0.0007295698,0.00010507446,0.0000027691303,0.00031304595,0.0041672494],"genre_scores_gemma":[0.9985288,0.0000062727718,0.0011990825,0.00014776677,0.00006229383,0.00000769667,0.0000383879,0.0000037084283,0.000006031266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936795,0.000010716198,0.00017762235,0.000072997296,0.0002649472,0.00010575562],"domain_scores_gemma":[0.9997785,0.00006039649,0.000014041734,0.000053890893,0.00006363657,0.000029540583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025250466,0.000070282484,0.000048780363,0.0001651538,0.00013963839,0.00029677476,0.000057382476,0.000045444078,0.000018024566],"category_scores_gemma":[0.00004556019,0.000059335875,0.000025072146,0.00045431603,0.000028582575,0.0006979974,0.0000035986952,0.00007950754,0.000040430794],"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.0000015747171,0.0000018844529,0.000027121308,0.00002808314,0.0000015891324,1.8872291e-7,0.00009167634,0.9919754,0.000007670485,0.003390995,0.00024283987,0.0042309286],"study_design_scores_gemma":[0.00004450846,0.000016547021,0.00010318278,0.000047164307,0.0000032968826,0.0000012133956,0.000028527656,0.9986561,0.00006455502,0.000457946,0.00050036336,0.000076624616],"about_ca_topic_score_codex":0.00000986311,"about_ca_topic_score_gemma":0.0000063484567,"teacher_disagreement_score":0.9756482,"about_ca_system_score_codex":0.00005697636,"about_ca_system_score_gemma":0.00003603731,"threshold_uncertainty_score":0.2861806},"labels":[],"label_agreement":null},{"id":"W4391311137","doi":"10.1016/j.ins.2024.120230","title":"Dynamic multi-granularity spatial-temporal graph attention network for traffic forecasting","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Granularity; Computer science; Data mining; Graph; Temporal database; Intelligent transportation system; Theoretical computer science","score_opus":0.02580911046902964,"score_gpt":0.2601725078783156,"score_spread":0.23436339740928594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391311137","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.023400651,0.00011598334,0.9695858,0.00008449502,0.0012017072,0.00035400764,0.000018369721,0.004286151,0.0009528867],"genre_scores_gemma":[0.976406,0.000036065147,0.023327451,0.00004062265,0.0000351001,0.00006666191,0.000067694775,0.0000050941294,0.000015315058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929374,0.000006747904,0.00026254033,0.00008653977,0.00016500965,0.00018542177],"domain_scores_gemma":[0.99982584,0.00002732754,0.000030113211,0.00005908374,0.000027404016,0.000030214089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056038785,0.00008644998,0.000070247006,0.000225035,0.00018141467,0.0003043666,0.00012439047,0.00004419209,0.000005231885],"category_scores_gemma":[0.000013733709,0.00007881793,0.000065643544,0.0004257533,0.00005526492,0.0014628367,0.000013758085,0.000065128836,0.000016330117],"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.0000033538856,0.000007937587,0.00015524229,0.00032556563,0.000023052327,5.568344e-7,0.00048966194,0.33574554,0.000034581044,0.002109106,0.019120345,0.64198506],"study_design_scores_gemma":[0.00009565881,0.00002642768,0.0009267609,0.000057554364,0.000008018413,0.0000024606627,0.00010204906,0.97917247,0.000011445253,0.00018539852,0.019318953,0.0000927936],"about_ca_topic_score_codex":0.000017620907,"about_ca_topic_score_gemma":0.00014107299,"teacher_disagreement_score":0.9530053,"about_ca_system_score_codex":0.00003088844,"about_ca_system_score_gemma":0.000013238565,"threshold_uncertainty_score":0.3214102},"labels":[],"label_agreement":null},{"id":"W4391427667","doi":"10.1016/j.ins.2024.120253","title":"Towards privacy-preserving category-aware POI recommendation over encrypted LBSN data","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China; Natural Science Foundation of Jilin Province","keywords":"Computer science; Encryption; Outsourcing; Cloud computing; Data mining; Merge (version control); Location-based service; Popularity; Information retrieval; Computer security; Computer network","score_opus":0.08274629982190981,"score_gpt":0.34558189125816724,"score_spread":0.26283559143625745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391427667","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.0034199646,0.00015014892,0.90970707,0.06655687,0.0019355239,0.0003044686,0.00017695014,0.002477577,0.015271415],"genre_scores_gemma":[0.74371266,0.00021021195,0.25364825,0.001473845,0.00012412375,0.000042974603,0.0007267181,0.000012739296,0.00004844439],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973152,0.00007674179,0.00061800773,0.000633669,0.00088232843,0.00047400768],"domain_scores_gemma":[0.9924095,0.00025737027,0.0002037827,0.0069157896,0.00012653846,0.00008700902],"candidate_categories":["metaresearch","scholarly_communication","open_science"],"consensus_categories":["scholarly_communication","open_science"],"category_scores_codex":[0.00255603,0.00021109798,0.0001660699,0.0007018584,0.000441054,0.0032110307,0.050179943,0.00013281521,0.00028399035],"category_scores_gemma":[0.011381268,0.00017700958,0.000041070423,0.002638371,0.00023292008,0.033724744,0.10079481,0.0003128161,0.0004556214],"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.0000020334173,0.000012862547,0.00020737691,0.00007746066,0.000016705939,0.0000033187525,0.0007874731,0.000037229594,0.00006630787,0.011786659,0.54253966,0.4444629],"study_design_scores_gemma":[0.00008679821,0.00003355389,0.00064126693,0.00006030245,0.0000039352494,0.000017153414,0.00020107902,0.78911483,0.0005643449,0.071652755,0.13740517,0.00021879026],"about_ca_topic_score_codex":0.00036800728,"about_ca_topic_score_gemma":0.00002099327,"teacher_disagreement_score":0.78907764,"about_ca_system_score_codex":0.00012974352,"about_ca_system_score_gemma":0.00046003354,"threshold_uncertainty_score":0.9978237},"labels":[],"label_agreement":null},{"id":"W4392514722","doi":"10.1016/j.ins.2024.120419","title":"Performance-oriented design and analysis for direct data-driven control of multi-agent systems","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Youth Innovation Team Project for Talent Introduction and Cultivation in Universities of Shandong Province; National Natural Science Foundation of China","keywords":"Computer science; Convergence (economics); Affine transformation; Linearization; Nonlinear system; Network topology; Protocol (science); Multi-agent system; Control theory (sociology); Topology (electrical circuits); Function (biology); Control (management); Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Computer network","score_opus":0.06691679664605192,"score_gpt":0.2992203712030256,"score_spread":0.23230357455697365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392514722","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.0034677507,0.00046006468,0.9937105,0.00011800127,0.0007480253,0.00083502923,0.00029769453,0.00015546576,0.0002074222],"genre_scores_gemma":[0.98277944,0.000026029717,0.016953165,0.000032874985,0.000020922847,0.00009272774,0.00006322478,0.0000024159403,0.000029199848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811774,0.00009664661,0.00066246255,0.00032570623,0.0005393992,0.0002580125],"domain_scores_gemma":[0.99847835,0.0004329073,0.00026900004,0.00050345133,0.00023360031,0.000082674924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025079735,0.00013744434,0.0003154803,0.00060549215,0.00020793878,0.00080790557,0.0011276957,0.000046641406,0.0000019217073],"category_scores_gemma":[0.00015419774,0.000103808045,0.00007080847,0.0017118315,0.00013151158,0.0052449657,0.00014826257,0.00004529316,0.00001918242],"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.000038144106,0.00006876854,0.013020112,0.0007212812,0.0011722264,0.000002008318,0.0042137625,0.89926684,0.0004194815,0.016976727,0.0014579719,0.062642656],"study_design_scores_gemma":[0.0004596577,0.000088769564,0.001978601,0.00005214483,0.000105179315,0.0000035047935,0.00015144348,0.9895292,0.00007595358,0.000003159828,0.00743099,0.00012141805],"about_ca_topic_score_codex":0.00006638867,"about_ca_topic_score_gemma":0.0000027876144,"teacher_disagreement_score":0.9793117,"about_ca_system_score_codex":0.000040694216,"about_ca_system_score_gemma":0.00015733993,"threshold_uncertainty_score":0.77906525},"labels":[],"label_agreement":null},{"id":"W4394981804","doi":"10.1016/j.ins.2024.120647","title":"Multi-association evidential feature selection and its application to identifying schizophrenia","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Feature selection; Selection (genetic algorithm); Schizophrenia (object-oriented programming); Association (psychology); Computer science; Feature (linguistics); Artificial intelligence; Evidential reasoning approach; Pattern recognition (psychology); Data mining; Machine learning; Psychology; Decision support system; Psychotherapist","score_opus":0.02385081771858439,"score_gpt":0.3015634790128809,"score_spread":0.2777126612942965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394981804","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.04367738,0.00036918744,0.9492063,0.0044307588,0.0009041677,0.00034685628,0.0000035408873,0.00035984925,0.00070194155],"genre_scores_gemma":[0.9638365,0.00003673384,0.03556283,0.0003702385,0.00008029265,0.000031426705,0.0000031380073,0.0000016753154,0.000077167366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898314,0.000024448593,0.00018656836,0.0002030552,0.00043504048,0.00016773907],"domain_scores_gemma":[0.9996252,0.000049224574,0.00008373463,0.000075762546,0.00010630348,0.000059769372],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082608475,0.00007663341,0.00006415667,0.00030359178,0.00036509105,0.0020292157,0.00032862558,0.000058868085,0.0000034482691],"category_scores_gemma":[0.000102001955,0.00006352479,0.000023789533,0.0013202229,0.000010652342,0.006351027,0.000108667875,0.000090468,0.00032845195],"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.000011216518,0.000027312917,0.0017157819,0.00018080804,0.000030692023,0.0000011583201,0.011661183,0.0053312983,0.01080505,0.09212623,0.00894632,0.869163],"study_design_scores_gemma":[0.00010401318,0.000040315434,0.013500956,0.00003520261,0.0000044235167,0.000011437999,0.00007588365,0.96718955,0.0007523698,0.0008044288,0.017348047,0.00013334297],"about_ca_topic_score_codex":0.000026743546,"about_ca_topic_score_gemma":0.00003125656,"teacher_disagreement_score":0.9618583,"about_ca_system_score_codex":0.0000847751,"about_ca_system_score_gemma":0.000065453605,"threshold_uncertainty_score":0.99900675},"labels":[],"label_agreement":null},{"id":"W4396691630","doi":"10.1016/j.ins.2024.120711","title":"A novel intervention effect-based quadratic time-varying nonlinear discrete grey model for forecasting carbon emissions intensity","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Grey System Theory Applications","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"Humanities and Social Sciences Youth Foundation, Ministry of Education of the People's Republic of China; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Intensity (physics); Nonlinear system; Quadratic equation; Discrete time and continuous time; Carbon fibers; Intervention (counseling); Applied mathematics; Mathematics; Econometrics; Computer science; Environmental science; Statistics; Mathematical optimization; Algorithm; Physics; Psychology; Geometry","score_opus":0.12240096505059837,"score_gpt":0.3916220335033118,"score_spread":0.26922106845271343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396691630","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.13337699,0.000028605877,0.860297,0.0008753864,0.00045316163,0.00096500263,0.00010428218,0.00020654582,0.0036929855],"genre_scores_gemma":[0.9829459,1.8668472e-7,0.0161667,0.00015063319,0.00005690889,0.00020981561,0.000040395436,0.000008730654,0.00042072468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967189,0.00010037211,0.0012223156,0.00041819148,0.001210563,0.00032968193],"domain_scores_gemma":[0.9958536,0.0025584155,0.00043636898,0.00041734238,0.0005985064,0.00013577884],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009438827,0.00020187529,0.00030209444,0.000765319,0.0006895143,0.0016436097,0.0008396677,0.000090198475,0.00003784754],"category_scores_gemma":[0.005506336,0.00013802938,0.0002525942,0.0017808055,0.0002473676,0.0028224022,0.00013423349,0.00014356362,0.0002516182],"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.00037220228,0.00017218689,0.0015860929,0.00096236373,0.000096,0.0000024546005,0.01855591,0.7088062,0.021048982,0.01682185,0.0050747376,0.22650103],"study_design_scores_gemma":[0.00026886293,0.00010954956,0.000037379938,0.0002757636,0.000020732115,0.000014550845,0.00045639335,0.9908119,0.0014602258,0.005609611,0.00076535315,0.0001696905],"about_ca_topic_score_codex":0.00005027857,"about_ca_topic_score_gemma":0.000018765855,"teacher_disagreement_score":0.8495689,"about_ca_system_score_codex":0.00009267876,"about_ca_system_score_gemma":0.00025504592,"threshold_uncertainty_score":0.9993928},"labels":[],"label_agreement":null},{"id":"W4396796193","doi":"10.1016/j.ins.2024.120723","title":"Important-data-based attack design and resilient remote estimation for recurrent neural networks","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Smart Grid Security and Resilience","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":"University of Alberta","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Computer science; Estimation; Artificial neural network; Artificial intelligence; Data mining; Machine learning; Computer security; Engineering","score_opus":0.05309606258327444,"score_gpt":0.3116631855062817,"score_spread":0.25856712292300726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396796193","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.01978071,0.0010191086,0.97691804,0.00032083367,0.0012491753,0.00034050588,0.000019350817,0.00023337983,0.000118889555],"genre_scores_gemma":[0.97347665,0.00013420546,0.0260981,0.00011422692,0.00008218699,0.000012508806,0.00007314608,0.0000049735922,0.00000401604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918956,0.0000139317635,0.00029052232,0.00012514112,0.00020574665,0.00017511248],"domain_scores_gemma":[0.99954045,0.00021184841,0.00003426191,0.00013344514,0.00002977558,0.00005021682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008701122,0.000086359585,0.000071923605,0.00013307587,0.0001687618,0.0003792654,0.00021025214,0.0000430948,0.000005028843],"category_scores_gemma":[0.00008958047,0.00006868766,0.000018350498,0.00033230707,0.000106875945,0.001870587,0.000025835303,0.00007613669,0.00000771701],"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.0000054097122,0.000001091984,0.000015087136,0.00007810726,0.000002104228,2.9269773e-7,0.00021546356,0.90268266,0.000004063204,0.00013892185,0.004109082,0.09274771],"study_design_scores_gemma":[0.00007113066,0.000060786308,0.00013196957,0.000057879064,0.000006030557,0.000005812337,0.000055241173,0.9917592,0.000115348776,0.00010868911,0.007533019,0.00009492996],"about_ca_topic_score_codex":0.0000035942066,"about_ca_topic_score_gemma":0.000005299494,"teacher_disagreement_score":0.95369595,"about_ca_system_score_codex":0.000020411097,"about_ca_system_score_gemma":0.00004065621,"threshold_uncertainty_score":0.3657265},"labels":[],"label_agreement":null},{"id":"W4398203199","doi":"10.1016/j.ins.2024.120761","title":"An axiomatic framework for three-way clustering","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Axiom; Axiomatic system; Data mining; Mathematics; Artificial intelligence","score_opus":0.054430876012930327,"score_gpt":0.39105383680820793,"score_spread":0.3366229607952776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398203199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016241189,0.00006505802,0.994776,0.0009538096,0.00079701253,0.00026593325,0.0000042747115,0.0004611233,0.0010526889],"genre_scores_gemma":[0.38113794,0.0000035871287,0.6184922,0.00018441235,0.000080342565,0.00007599273,0.0000021030935,0.000003918948,0.00001948689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858004,0.000017715918,0.00028163413,0.00021936269,0.00056313607,0.00033808695],"domain_scores_gemma":[0.9990818,0.000343568,0.000053009488,0.00033133815,0.00009535597,0.0000949287],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010394268,0.00009700357,0.00008836205,0.0003318278,0.0003708108,0.0022657462,0.0013029969,0.000048374943,0.000010089743],"category_scores_gemma":[0.00018298898,0.00007805887,0.0000405183,0.0010686086,0.00012433421,0.009953756,0.00018549344,0.00010730756,0.000162798],"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.0000015685526,0.0000052141977,0.000010751286,0.00010343476,0.0000038092376,0.0000010273404,0.0022973532,0.018627375,0.000059680337,0.20309055,0.000055891825,0.77574337],"study_design_scores_gemma":[0.000042088435,0.00011920494,0.00015018143,0.000073667085,7.776214e-7,0.0000142152085,0.00013866721,0.9167971,0.000229297,0.07903678,0.0032917499,0.00010628253],"about_ca_topic_score_codex":0.000012279707,"about_ca_topic_score_gemma":0.000009530579,"teacher_disagreement_score":0.8981697,"about_ca_system_score_codex":0.00005336169,"about_ca_system_score_gemma":0.00012071521,"threshold_uncertainty_score":0.99877},"labels":[],"label_agreement":null},{"id":"W4399356382","doi":"10.1016/j.ins.2024.120835","title":"CPS-3WS: A critical pattern supported three-way sampling method for classifying class-overlapped imbalanced data","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"National Key Research and Development Program of China; Anhui University; National Natural Science Foundation of China","keywords":"Class (philosophy); Computer science; Sampling (signal processing); Data mining; Artificial intelligence; Pattern recognition (psychology); Computer vision","score_opus":0.16655484710524662,"score_gpt":0.4331206472449304,"score_spread":0.2665658001396838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399356382","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000925364,0.00007392806,0.9887534,0.0063062576,0.0009868772,0.0004923052,0.00040167727,0.0012217171,0.001671325],"genre_scores_gemma":[0.26172236,0.000019746314,0.73588777,0.0016906736,0.00012260559,0.00015623028,0.00036558442,0.000010568553,0.000024479585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970094,0.00006875796,0.00082681014,0.00070433767,0.0008295805,0.00056111027],"domain_scores_gemma":[0.9967718,0.0013180802,0.00020404039,0.001302993,0.00027371754,0.00012936616],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0034366082,0.00022634515,0.0002462319,0.0004902906,0.0005057394,0.0029711798,0.0034994688,0.00012725567,0.000030458546],"category_scores_gemma":[0.0011329349,0.00019229404,0.00007497304,0.0013521595,0.00025390048,0.015160658,0.0007548372,0.00023059254,0.00014593938],"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.0000061343794,0.000026267247,0.00028319907,0.00023008551,0.000020377083,0.0000018335697,0.0008296927,0.0000531941,0.0026248135,0.22341497,0.01539527,0.7571142],"study_design_scores_gemma":[0.00013457389,0.00006478913,0.00095844496,0.00010313413,0.000009496224,0.000024902109,0.00014459962,0.87830234,0.0015285828,0.013925243,0.10453866,0.0002652643],"about_ca_topic_score_codex":0.000046448407,"about_ca_topic_score_gemma":0.000024358982,"teacher_disagreement_score":0.8782491,"about_ca_system_score_codex":0.000094736315,"about_ca_system_score_gemma":0.0004140354,"threshold_uncertainty_score":0.9986138},"labels":[],"label_agreement":null},{"id":"W4399622529","doi":"10.1016/j.ins.2024.120970","title":"Stable predictive control of continuous stirred-tank reactors using deep learning","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Model predictive control; Continuous stirred-tank reactor; Control (management); Computer science; Control theory (sociology); Artificial intelligence; Chemical engineering; Engineering","score_opus":0.00787495032901624,"score_gpt":0.2299156500891669,"score_spread":0.22204069976015064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399622529","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.022135375,0.00057312316,0.9707765,0.000014585504,0.0005011276,0.00019886532,0.000012828599,0.000337167,0.0054504485],"genre_scores_gemma":[0.99821484,0.000018244844,0.0016867849,0.0000072853227,0.000032929085,0.000009406384,0.000004983222,0.000005983389,0.000019531757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990905,0.000020676476,0.0003728163,0.00007205324,0.00028126038,0.00016270904],"domain_scores_gemma":[0.99958545,0.0001193972,0.000092945185,0.00006104393,0.00010902675,0.00003212008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003894452,0.00008638616,0.00014428247,0.0002326204,0.00008653964,0.00014912242,0.00010551519,0.000042586027,0.000016121041],"category_scores_gemma":[0.00012976803,0.000076739474,0.00003018039,0.00051122427,0.000073252086,0.0032235063,0.000009559495,0.00009153816,0.000015035973],"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.0000034234567,9.419074e-7,0.00038115936,0.000047145135,0.00001573923,2.4697147e-7,0.0009934421,0.98924553,0.0013511576,0.00043221988,0.000012624078,0.007516392],"study_design_scores_gemma":[0.00015404396,0.000036104277,0.00012279229,0.00007511963,0.000011662098,0.0000042882166,0.0010462531,0.9947643,0.0004958372,0.000069949805,0.0031401736,0.000079459365],"about_ca_topic_score_codex":0.000022352544,"about_ca_topic_score_gemma":0.000002394759,"teacher_disagreement_score":0.97607946,"about_ca_system_score_codex":0.00007951118,"about_ca_system_score_gemma":0.000038013746,"threshold_uncertainty_score":0.31293452},"labels":[],"label_agreement":null},{"id":"W4400114566","doi":"10.1016/j.ins.2024.121094","title":"Shadowed set approximations of L-fuzzy sets","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","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 Regina","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Approximations of π; Set (abstract data type); Computer science; Fuzzy set; Fuzzy logic; Mathematics; Artificial intelligence; Applied mathematics","score_opus":0.04172640108115302,"score_gpt":0.3032473127055439,"score_spread":0.2615209116243909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400114566","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.013178859,0.00022427029,0.70858085,0.003951434,0.0011556636,0.0002524221,0.000030650062,0.00042624914,0.27219957],"genre_scores_gemma":[0.9557971,0.000013140568,0.043828163,0.0003083556,0.0000137683965,0.000009106623,0.0000063234643,9.580743e-7,0.000023137534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990236,0.000017466971,0.00029844634,0.00011333329,0.0004041127,0.0001430516],"domain_scores_gemma":[0.99956036,0.0000775546,0.00007597743,0.00018288313,0.0000653038,0.000037895483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006360639,0.0000636229,0.00007566847,0.0002693779,0.0001471736,0.00060258125,0.000691858,0.000029089282,0.00002140153],"category_scores_gemma":[0.00004577806,0.000045170786,0.000040890234,0.0012411651,0.00013165017,0.004868438,0.00011099142,0.00005193545,0.00024501898],"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":[6.120471e-7,0.000009636924,0.000101999096,0.00006587993,0.0000061593723,8.775626e-7,0.008093283,0.0015846901,0.000035182034,0.7922999,0.0063276542,0.1914741],"study_design_scores_gemma":[0.00007943562,0.00008230126,0.0015536872,0.000047261656,0.0000028415593,0.00002121892,0.00049614,0.90961653,0.00029226395,0.055576842,0.032085408,0.00014605848],"about_ca_topic_score_codex":0.000023261597,"about_ca_topic_score_gemma":0.0000016561933,"teacher_disagreement_score":0.9426182,"about_ca_system_score_codex":0.000012644226,"about_ca_system_score_gemma":0.00013357397,"threshold_uncertainty_score":0.5810705},"labels":[],"label_agreement":null},{"id":"W4400269603","doi":"10.1016/j.ins.2024.121136","title":"Finite/fixed-time cluster synchronization for directed and multiplex coupled dynamic networks","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Neural Networks Stability and Synchronization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; National University's Basic Research Foundation of China; China Scholarship Council; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Multiplex; Synchronization (alternating current); Computer science; Cluster (spacecraft); Time synchronization; Mathematics; Topology (electrical circuits); Real-time computing; Combinatorics; Computer network; Bioinformatics","score_opus":0.009435300644424834,"score_gpt":0.24667776453864823,"score_spread":0.2372424638942234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400269603","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.004245019,0.0002643008,0.9924688,0.0012463419,0.00058891636,0.00046035097,0.0000064519863,0.0004934864,0.00022632888],"genre_scores_gemma":[0.9857284,0.000058956506,0.013542726,0.0004274521,0.000053884138,0.000041138985,0.00006125996,0.0000042427755,0.000081946535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882793,0.000044745702,0.00035847354,0.0002544322,0.00026695177,0.0002474747],"domain_scores_gemma":[0.99888927,0.00064821285,0.000090123925,0.00016033705,0.00015317516,0.000058900678],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007602896,0.00012205767,0.000116967145,0.00019550986,0.00041739468,0.0013743832,0.00034953296,0.00007401276,0.00001743608],"category_scores_gemma":[0.00020597967,0.0001005302,0.000037604408,0.0011077819,0.0001554332,0.0052373717,0.000109081244,0.00007425721,0.000037141403],"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.000013724885,0.000018051436,0.00022576694,0.00015616797,0.000016290403,5.8488405e-7,0.0022814043,0.66663224,0.00007045035,0.010575387,0.0015768417,0.31843314],"study_design_scores_gemma":[0.00017173906,0.000068275935,0.00037813422,0.000041843312,0.000004560108,0.0000061171754,0.000023456063,0.99550366,0.0000135865575,0.0009840552,0.0026684727,0.00013611901],"about_ca_topic_score_codex":0.000010770904,"about_ca_topic_score_gemma":0.000018928382,"teacher_disagreement_score":0.9814834,"about_ca_system_score_codex":0.00005696414,"about_ca_system_score_gemma":0.00009314998,"threshold_uncertainty_score":0.9996623},"labels":[],"label_agreement":null},{"id":"W4400722748","doi":"10.1016/j.ins.2024.121195","title":"On homology groups for pairwise comparisons method","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"University of Alberta; Laurentian University","funders":"Ministerstwo Edukacji i Nauki","keywords":"Pairwise comparison; Mathematics; Homology (biology); Algebraic number; Mayer–Vietoris sequence; Persistent homology; Combinatorics; Pure mathematics; Algorithm; Genetics; Biology; Statistics; Gene","score_opus":0.34824259162578103,"score_gpt":0.547241422165759,"score_spread":0.19899883053997797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400722748","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.015502579,0.000078966215,0.96287435,0.0026894792,0.0028470329,0.0003788153,0.000067409164,0.00017024187,0.015391103],"genre_scores_gemma":[0.8564214,0.0000031559616,0.14071535,0.002166148,0.00011283591,0.00007554903,0.00000842382,0.0000062694808,0.00049087463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960038,0.00022636555,0.0011095251,0.0004271505,0.001875886,0.00035724207],"domain_scores_gemma":[0.98978907,0.009072648,0.00024794092,0.00042108828,0.0003564235,0.00011284184],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.013018339,0.0001589539,0.0002818478,0.0013979996,0.0005342625,0.002662589,0.0012994324,0.00009109147,0.00070467964],"category_scores_gemma":[0.007150911,0.0001030687,0.00017171295,0.0019980227,0.00027396425,0.0033798553,0.00015486016,0.00013864895,0.0028841414],"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.000036390935,0.000020005202,0.00015524527,0.000012447371,0.000007735489,0.000002063293,0.002339911,0.005467578,0.000075393975,0.35624075,0.1962502,0.4393923],"study_design_scores_gemma":[0.00017411215,0.0001427327,0.00070659665,0.000026995018,0.0000041236253,0.000020090685,0.0012813412,0.53841364,0.00016663606,0.09788639,0.36104336,0.00013396867],"about_ca_topic_score_codex":0.000016084492,"about_ca_topic_score_gemma":0.00001316584,"teacher_disagreement_score":0.84091884,"about_ca_system_score_codex":0.000048393817,"about_ca_system_score_gemma":0.00017992927,"threshold_uncertainty_score":0.99837273},"labels":[],"label_agreement":null},{"id":"W4401503623","doi":"10.1016/j.ins.2024.121317","title":"An analytic formulation of convolutional neural network learning for pattern recognition","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea; National Natural Science Foundation of China","keywords":"MNIST database; Computer science; Interpretability; Convolutional neural network; Artificial intelligence; Machine learning; Overfitting; Benchmark (surveying); Artificial neural network; Regularization (linguistics); Deep learning; Perceptron; Pattern recognition (psychology)","score_opus":0.044810043358564096,"score_gpt":0.3101929272162299,"score_spread":0.2653828838576658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401503623","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.04856971,0.00003917641,0.94993055,0.000533516,0.0002541446,0.00017524273,0.0000056232275,0.00011521105,0.00037681687],"genre_scores_gemma":[0.991756,0.0000052902624,0.007872375,0.00016863263,0.00010485469,0.000030117832,0.000053968797,0.0000014432492,0.0000072906837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921757,0.000019375631,0.0002780215,0.00012279139,0.000216701,0.00014552768],"domain_scores_gemma":[0.999494,0.00014941007,0.00011140998,0.000087996836,0.00012232387,0.000034849523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051176024,0.000056314606,0.00006309819,0.00011687581,0.0002627944,0.0003644064,0.0002776336,0.000025594873,0.0000097520815],"category_scores_gemma":[0.0000174208,0.000047202207,0.00004362633,0.0007011816,0.000046887963,0.004318755,0.00002596054,0.00005477764,0.000018927376],"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.0000018857053,0.0000071169884,0.00069331075,0.000028622766,0.0000042823417,6.4405285e-8,0.00037334693,0.30615723,0.00007907375,0.034014896,0.0006558547,0.6579843],"study_design_scores_gemma":[0.000050866296,0.00009119646,0.0027571179,0.000021455191,0.0000033303709,0.00000354475,0.000034319695,0.98457533,0.000084452084,0.00958958,0.002725096,0.00006371774],"about_ca_topic_score_codex":0.000012827454,"about_ca_topic_score_gemma":0.000004364007,"teacher_disagreement_score":0.94318634,"about_ca_system_score_codex":0.00001362442,"about_ca_system_score_gemma":0.00005046884,"threshold_uncertainty_score":0.35139796},"labels":[],"label_agreement":null},{"id":"W4402047046","doi":"10.1016/j.ins.2024.121394","title":"Experimental evaluation of the effect of community structures on link prediction","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Galatasaray Üniversitesi; Providence Health Care","keywords":"Link (geometry); Computer science; Data mining; Computer network","score_opus":0.03280480671375124,"score_gpt":0.36198096131836743,"score_spread":0.3291761546046162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402047046","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.9862023,0.000021641512,0.0011013929,0.0000335846,0.00011332556,0.00015917818,0.000011626156,0.00001737452,0.0123395575],"genre_scores_gemma":[0.9999103,9.753587e-8,0.000028170756,0.0000060636985,0.000030119669,0.000012731847,0.000009825643,7.2005594e-7,0.0000019475672],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991445,0.00018254762,0.00018072121,0.00002629274,0.00042678276,0.000039166982],"domain_scores_gemma":[0.9996156,0.00010559531,0.00009962256,0.00011937068,0.000053292115,0.000006528482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013519482,0.00004081642,0.000059081765,0.0000793883,0.00013615443,0.000042245134,0.00016665495,0.0000103424545,0.00010085062],"category_scores_gemma":[0.000013891949,0.000023279223,0.000055972596,0.00032371713,0.00011660248,0.0003795331,0.000036649333,0.00007292365,0.0000019170345],"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.000024957393,0.00003724879,0.028481387,0.000076114804,0.00010641756,4.504112e-9,0.013449746,0.069781035,0.0074993847,0.061032932,0.0029892228,0.8165215],"study_design_scores_gemma":[0.00018312903,0.00042615228,0.028337011,0.00009332316,0.00006172933,2.0980869e-7,0.0015043323,0.29790765,0.6605065,0.010329629,0.0005891269,0.00006124796],"about_ca_topic_score_codex":0.00012647743,"about_ca_topic_score_gemma":9.4254557e-7,"teacher_disagreement_score":0.8164603,"about_ca_system_score_codex":0.00001670831,"about_ca_system_score_gemma":0.00003146064,"threshold_uncertainty_score":0.11042436},"labels":[],"label_agreement":null},{"id":"W4403458004","doi":"10.1016/j.ins.2024.121564","title":"Tree smoothing: Post-hoc regularization of tree ensembles for interpretable machine learning","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":14,"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":"Austrian Science Fund","keywords":"Artificial intelligence; Regularization (linguistics); Smoothing; Tree (set theory); Computer science; Machine learning; Post hoc; Pattern recognition (psychology); Mathematics; Combinatorics; Medicine","score_opus":0.02549530159241103,"score_gpt":0.2852611363255154,"score_spread":0.2597658347331044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403458004","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.008243128,0.0002823919,0.97581387,0.0017753891,0.0005496253,0.00024823585,0.0000064378332,0.0002509225,0.012830012],"genre_scores_gemma":[0.96392864,0.00003075684,0.03515857,0.00030586042,0.000032500197,0.000027227179,0.000016852859,0.0000050791105,0.00049451157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851435,0.000044316574,0.0005249093,0.00021206903,0.00044708146,0.00025725216],"domain_scores_gemma":[0.99892396,0.00033055228,0.00018556557,0.00020161399,0.00030904432,0.00004924246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014424818,0.000114305025,0.00013737043,0.0005009473,0.0003170442,0.0009206681,0.0008297058,0.000054710472,0.00002200419],"category_scores_gemma":[0.000512339,0.00009538124,0.000078020465,0.0012025632,0.00014780542,0.0077934717,0.0001383225,0.00009503733,0.00006358843],"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.000019336332,0.000015501819,0.00010437702,0.00013678141,0.000011892935,7.756143e-7,0.016071439,0.008874127,0.005373507,0.3946871,0.0005217534,0.5741834],"study_design_scores_gemma":[0.000049314323,0.0003382511,0.00003716072,0.0000834915,0.0000043269424,0.000006474808,0.0011736788,0.92871124,0.03856662,0.012128675,0.018779399,0.000121368415],"about_ca_topic_score_codex":0.00008970698,"about_ca_topic_score_gemma":0.00006764442,"teacher_disagreement_score":0.9556855,"about_ca_system_score_codex":0.00003581252,"about_ca_system_score_gemma":0.00019514204,"threshold_uncertainty_score":0.88780236},"labels":[],"label_agreement":null},{"id":"W4403528821","doi":"10.1016/j.ins.2024.121566","title":"Integrating granular computing with density estimation for anomaly detection in high-dimensional heterogeneous data","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fundamental Research Funds for the Central Universities; Sichuan Province Science and Technology Support Program; National Natural Science Foundation of China","keywords":"Anomaly detection; Anomaly (physics); Granular computing; Computer science; Density estimation; Estimation; Data mining; Mathematics; Statistics; Physics","score_opus":0.023956480829232678,"score_gpt":0.2899104868076396,"score_spread":0.2659540059784069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403528821","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.13481613,0.000018578876,0.8640464,0.00032005037,0.00012742913,0.00029508027,0.000007891112,0.00030205084,0.00006638338],"genre_scores_gemma":[0.7849484,0.0000010451954,0.21486759,0.000110797846,0.000017862458,0.000026386517,0.00002297954,0.0000021706078,0.000002744328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892426,0.000021134216,0.00032707595,0.00028737757,0.00027404327,0.0001660948],"domain_scores_gemma":[0.9993354,0.00012466912,0.00011130817,0.00029634297,0.000098995835,0.000033299217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008812036,0.00009705509,0.00009133831,0.00031987435,0.00038882665,0.0006826785,0.000587059,0.00004180675,0.0000017384549],"category_scores_gemma":[0.000049485017,0.000076196426,0.000022011025,0.0010154519,0.00007809294,0.0039047857,0.00015890098,0.000091464106,0.000014353601],"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.000008638007,0.000018734454,0.0002479923,0.000054053686,0.0000065031613,0.0000018123786,0.0006177735,0.04232432,0.00069051335,0.038271677,0.000096894546,0.9176611],"study_design_scores_gemma":[0.00008133233,0.00010113435,0.00070896314,0.000046809426,0.0000029297898,0.000057522728,0.000036643185,0.9876219,0.007783072,0.0028703746,0.00058354577,0.00010574902],"about_ca_topic_score_codex":0.00022757167,"about_ca_topic_score_gemma":0.00013074862,"teacher_disagreement_score":0.9452976,"about_ca_system_score_codex":0.000055706627,"about_ca_system_score_gemma":0.00010223551,"threshold_uncertainty_score":0.65830845},"labels":[],"label_agreement":null},{"id":"W4404355808","doi":"10.1016/j.ins.2024.121640","title":"Safe reinforcement learning-based control using deep deterministic policy gradient algorithm and slime mould algorithm with experimental tower crane system validation","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Robot Manipulation and Learning","field":"Engineering","cited_by":21,"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":"Reinforcement learning; Tower; Algorithm; Computer science; Reinforcement; Tower crane; Control (management); Artificial intelligence; Engineering; Structural engineering","score_opus":0.015136855170394571,"score_gpt":0.25975898775127065,"score_spread":0.2446221325808761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404355808","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.0109829735,0.00014092893,0.98595214,0.000039805953,0.00023534606,0.00024463385,0.000001218575,0.0003264186,0.0020765618],"genre_scores_gemma":[0.9915211,0.0000034354691,0.008268918,0.000062339524,0.00006510726,0.000022199469,0.000019266728,0.000009374434,0.0000282526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988629,0.000028338869,0.00034936846,0.00012658567,0.0004077868,0.00022499549],"domain_scores_gemma":[0.9996723,0.000054364566,0.00007108803,0.000070576956,0.000048516213,0.000083172206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033840226,0.00015241625,0.00013097815,0.0004185845,0.0003084175,0.0005933157,0.000083537874,0.000047100068,0.00004347208],"category_scores_gemma":[0.000014191898,0.00012634725,0.000028253666,0.0004270994,0.00008843315,0.0013403498,0.000010870823,0.00011961789,0.00003071504],"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.0000031030452,0.0000024734131,0.000026207013,0.0000545335,0.00001061754,0.0000021395788,0.001207896,0.9637457,0.00010413967,0.00021314029,0.0000050675194,0.03462497],"study_design_scores_gemma":[0.000365213,0.00015522394,0.00007567867,0.00011123508,0.000014118118,0.000043080126,0.0012897496,0.9952595,0.00097101496,0.0000022453203,0.00154219,0.00017072758],"about_ca_topic_score_codex":0.000064650856,"about_ca_topic_score_gemma":5.406704e-7,"teacher_disagreement_score":0.98053813,"about_ca_system_score_codex":0.00020514958,"about_ca_system_score_gemma":0.00007208119,"threshold_uncertainty_score":0.5721357},"labels":[],"label_agreement":null},{"id":"W4404396638","doi":"10.1016/j.ins.2024.121642","title":"Introducing fairness in network visualization","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Data Visualization and Analytics","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 Lethbridge","funders":"Ministero dell'Università e della Ricerca; Università degli Studi di Perugia; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Computer science; Visualization; Data mining","score_opus":0.02119981720258693,"score_gpt":0.3277941109098233,"score_spread":0.30659429370723634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404396638","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.000807961,0.000065111184,0.99062604,0.00078688865,0.00071198016,0.00005792844,0.000001219575,0.0001985855,0.0067442637],"genre_scores_gemma":[0.98820496,0.000045558412,0.01017078,0.0013161622,0.00012909422,0.0000068700315,0.000026364072,0.000002400974,0.00009783235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903333,0.000030584994,0.00029476406,0.00014431887,0.0003296654,0.00016732483],"domain_scores_gemma":[0.99968034,0.000054772325,0.000048744052,0.0001345799,0.000051019106,0.00003053498],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010961893,0.000059214883,0.00006136782,0.0003552204,0.00012196024,0.0015194458,0.000488661,0.00002449956,0.000025536398],"category_scores_gemma":[0.00009068862,0.000049597682,0.000016667866,0.0029713742,0.00004986589,0.0076595508,0.00010829368,0.00004564284,0.00022592247],"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":[2.2955162e-7,0.0000036717627,0.0005325037,0.00001799874,0.0000011197418,7.0349216e-7,0.0014319209,0.033937,0.000003818942,0.91971475,0.0044636894,0.0398926],"study_design_scores_gemma":[0.000036423375,0.000011845327,0.00049677235,0.00004708763,6.1814416e-7,0.0000032128382,0.00012014325,0.9410026,0.000048230133,0.0053142677,0.052846424,0.000072360126],"about_ca_topic_score_codex":0.000020744406,"about_ca_topic_score_gemma":0.000012602253,"teacher_disagreement_score":0.98739696,"about_ca_system_score_codex":0.00002984877,"about_ca_system_score_gemma":0.00011750283,"threshold_uncertainty_score":0.9995171},"labels":[],"label_agreement":null},{"id":"W4404623603","doi":"10.1016/j.ins.2024.121676","title":"Three-way conflict analysis with preference-based conflict situations","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Preference; Conflict analysis; Computer science; Mathematical economics; Conflict resolution; Social psychology; Mathematics; Psychology; Political science; Statistics; Law","score_opus":0.09302595117401276,"score_gpt":0.2847824686846517,"score_spread":0.19175651751063894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404623603","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.0043513267,0.00009907202,0.9580397,0.002422695,0.0001659718,0.00015871068,0.000011541175,0.00030116996,0.034449786],"genre_scores_gemma":[0.96617866,0.000012303302,0.032903265,0.0008049052,0.000020949641,0.000029444958,0.000019600235,0.0000016138248,0.000029274961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985467,0.000020337924,0.00029844872,0.00023393393,0.00066778366,0.00023278092],"domain_scores_gemma":[0.99920475,0.00015679997,0.00009903202,0.00031580875,0.00014267118,0.0000809415],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006321904,0.00012080377,0.0001384867,0.0006750533,0.00035705848,0.0020903642,0.0008164162,0.000040813346,0.00007999955],"category_scores_gemma":[0.000027622833,0.00007543656,0.000075038806,0.0040337313,0.00021968797,0.0038735901,0.00006109221,0.000089926376,0.00026330646],"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.000011086658,0.000052606083,0.005999953,0.00006915455,0.00028729838,0.000008718687,0.011055597,0.1191502,0.000027531314,0.5872537,0.004255534,0.27182865],"study_design_scores_gemma":[0.000099971956,0.00012356804,0.009878121,0.000018332492,0.000037045676,0.0000034508307,0.00008668496,0.9571831,0.00007488285,0.0014896089,0.030850686,0.0001545543],"about_ca_topic_score_codex":0.00015051545,"about_ca_topic_score_gemma":0.00013681232,"teacher_disagreement_score":0.96182734,"about_ca_system_score_codex":0.000026942698,"about_ca_system_score_gemma":0.00030277646,"threshold_uncertainty_score":0.99894553},"labels":[],"label_agreement":null},{"id":"W4405436926","doi":"10.1016/j.ins.2024.121755","title":"Group role assignment with conflicting and cooperating agents based on three-way decision","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Group decision-making; Group (periodic table); Computer science; Operations research; Mathematics; Psychology; Social psychology; Chemistry","score_opus":0.025188773937255857,"score_gpt":0.28438602677680713,"score_spread":0.25919725283955125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405436926","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.23190826,0.000028298464,0.7635875,0.00014932308,0.00026350986,0.00017209614,7.824508e-7,0.000098205484,0.003792044],"genre_scores_gemma":[0.9874188,0.0000015298053,0.012227682,0.00030640292,0.000017434108,0.000013773382,0.0000019845454,0.0000017225206,0.000010717802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988086,0.00002152426,0.0002472647,0.00018080157,0.000602153,0.00013963683],"domain_scores_gemma":[0.9995377,0.00015371594,0.000089008456,0.000121968325,0.000044081633,0.000053535383],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093080476,0.00008659247,0.00007022554,0.00018751514,0.00039581273,0.0013893934,0.00022630872,0.00002585365,0.000013283788],"category_scores_gemma":[0.000035888275,0.000056198227,0.000014598876,0.00043894685,0.00003406442,0.002908354,0.00003912719,0.000055982167,0.00005209067],"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.000017557415,0.00003022162,0.009757891,0.000076978744,0.000010967154,0.0000041339385,0.01043213,0.041593723,0.0012755399,0.06320099,0.00016048382,0.8734394],"study_design_scores_gemma":[0.00016046102,0.00014147637,0.008330223,0.000178111,0.0000013141246,0.000004194498,0.00026626445,0.98838574,0.000675522,0.000085927306,0.0016843122,0.00008644795],"about_ca_topic_score_codex":0.000052878288,"about_ca_topic_score_gemma":0.000023996105,"teacher_disagreement_score":0.946792,"about_ca_system_score_codex":0.000029444749,"about_ca_system_score_gemma":0.00004734067,"threshold_uncertainty_score":0.99964726},"labels":[],"label_agreement":null},{"id":"W4405761688","doi":"10.1016/j.ins.2024.121783","title":"Finding Nash equilibrium in bimatrix games in zero-error probabilistic polynomial time","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Wilfrid Laurier University","funders":"","keywords":"Nash equilibrium; Probabilistic logic; Zero (linguistics); Zero-sum game; Best response; Correlated equilibrium; Epsilon-equilibrium; Mathematics; Polynomial; Mathematical economics; Game theory; Computer science; Mathematical optimization; Repeated game; Statistics; Equilibrium selection; Mathematical analysis","score_opus":0.09798014279736016,"score_gpt":0.40554001085171065,"score_spread":0.3075598680543505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405761688","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.95841074,0.00007573968,0.0011768509,0.002170611,0.0003572101,0.0003597789,0.00002438341,0.00009640779,0.03732826],"genre_scores_gemma":[0.99858034,0.0000014042297,0.00043317457,0.00015314324,0.000032814307,0.000044942644,0.000004565863,0.0000028072925,0.0007468335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739075,0.000114321185,0.0009497864,0.00029563505,0.00093120086,0.00031829075],"domain_scores_gemma":[0.99816304,0.0013002906,0.00014680998,0.0002528403,0.00007001576,0.00006699703],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006339013,0.00011828715,0.00018542176,0.0013417988,0.00012212283,0.0012828481,0.00090671616,0.000064522355,0.00041786628],"category_scores_gemma":[0.0018997514,0.0000860809,0.000059516475,0.004149732,0.00037296134,0.004404787,0.00014522838,0.0001541403,0.0043710377],"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.0001490979,0.00026042102,0.022838194,0.00018426293,0.000016863514,0.000023779525,0.062379565,0.09581726,0.009944545,0.30870393,0.055892408,0.4437897],"study_design_scores_gemma":[0.0004987958,0.0001244538,0.025277324,0.00022138125,0.000006100677,0.0000360464,0.0041622464,0.56836706,0.0010197766,0.3281662,0.07159731,0.00052329345],"about_ca_topic_score_codex":0.000031401014,"about_ca_topic_score_gemma":0.00002396829,"teacher_disagreement_score":0.47254983,"about_ca_system_score_codex":0.000076017466,"about_ca_system_score_gemma":0.00027959596,"threshold_uncertainty_score":0.9997539},"labels":[],"label_agreement":null},{"id":"W4406012028","doi":"10.1016/j.ins.2024.121821","title":"Class-specific semi-supervised feature selection with fuzzy convex balling information granularity","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Granularity; Class (philosophy); Feature selection; Regular polygon; Selection (genetic algorithm); Pattern recognition (psychology); Feature (linguistics); Computer science; Artificial intelligence; Granular computing; Mathematics; Fuzzy logic; Data mining; Rough set","score_opus":0.01375251796031445,"score_gpt":0.23456429671374604,"score_spread":0.22081177875343158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406012028","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.012184646,0.00006872568,0.87636685,0.004237367,0.0006046682,0.00037462794,0.000005259079,0.00033965107,0.10581821],"genre_scores_gemma":[0.9455826,0.00006119512,0.05063868,0.0035585978,0.000039685565,0.00002871946,0.000030591236,0.0000017637237,0.000058129677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998448,0.000043330263,0.0003840456,0.00018085814,0.0006391682,0.00030456588],"domain_scores_gemma":[0.9990825,0.00006564194,0.00020628603,0.0002478331,0.00033279284,0.000064922606],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007846025,0.00015915235,0.0001557579,0.00046852528,0.00076389464,0.0017720944,0.0008397562,0.00011109927,0.000010897748],"category_scores_gemma":[0.000040006584,0.000115018534,0.00004521426,0.0024455846,0.0001588389,0.0136586195,0.000108707405,0.00021135043,0.00010797629],"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.00005853472,0.000051640196,0.009513548,0.00014100337,0.000032442385,0.000001194436,0.0075629973,0.019257007,0.000120000004,0.5954421,0.024754712,0.34306479],"study_design_scores_gemma":[0.0009881059,0.00023234406,0.020882268,0.000094242896,0.000008362745,0.000030410185,0.0011674674,0.6531166,0.0007427451,0.00790802,0.31438434,0.0004451183],"about_ca_topic_score_codex":0.000041665735,"about_ca_topic_score_gemma":0.000013902971,"teacher_disagreement_score":0.933398,"about_ca_system_score_codex":0.0000761658,"about_ca_system_score_gemma":0.00024855824,"threshold_uncertainty_score":0.9992642},"labels":[],"label_agreement":null},{"id":"W4406053661","doi":"10.1016/j.ins.2024.121833","title":"Improving preference disaggregation in multicriteria decision making: Incorporating time series analysis and a multi-objective approach","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Preference; Series (stratigraphy); Time series; Computer science; Decision analysis; Econometrics; Operations research; Machine learning; Mathematical optimization; Artificial intelligence; Data mining; Statistics; Mathematics","score_opus":0.043528293611673506,"score_gpt":0.34129733944197516,"score_spread":0.29776904583030167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406053661","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.39110962,0.0000063238263,0.6061106,0.00007912596,0.000019266625,0.00028152284,0.000010292318,0.00005402676,0.0023292631],"genre_scores_gemma":[0.7242269,0.0000011828305,0.27564055,0.00004765333,0.0000026845607,0.000044515848,0.000008947589,0.0000011317213,0.00002643213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990882,0.00004117086,0.0004246484,0.00015794196,0.00017975926,0.00010825848],"domain_scores_gemma":[0.9992265,0.00026195825,0.00025174377,0.00012533487,0.00011284469,0.00002159327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000578933,0.00008911961,0.00015144615,0.0006280693,0.0002766681,0.00031712884,0.00014496589,0.00004538668,0.000008777072],"category_scores_gemma":[0.00046521286,0.000075793876,0.000029438226,0.0017846066,0.00014125108,0.0018103217,0.00007867699,0.00006621197,0.000006887005],"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.00016700246,0.0005211593,0.12179812,0.00047863775,0.00018199903,7.557838e-7,0.031686164,0.0063459696,0.0065889517,0.30858013,0.00019528405,0.5234558],"study_design_scores_gemma":[0.00034622801,0.000018961107,0.08141923,0.00009265941,0.000046533314,0.0000024442415,0.0027351994,0.883991,0.0005539178,0.030632177,0.000017222492,0.00014445564],"about_ca_topic_score_codex":0.0000462885,"about_ca_topic_score_gemma":0.00008302188,"teacher_disagreement_score":0.877645,"about_ca_system_score_codex":0.000043760716,"about_ca_system_score_gemma":0.000048544956,"threshold_uncertainty_score":0.30907845},"labels":[],"label_agreement":null},{"id":"W4406098331","doi":"10.1016/j.ins.2024.121859","title":"Multi-view data representation via adaptive label propagation nonnegative matrix factorization","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Representation (politics); Non-negative matrix factorization; Computer science; Matrix decomposition; Matrix (chemical analysis); External Data Representation; Nonnegative matrix; Artificial intelligence; Mathematics; Theoretical computer science; Algebra over a field; Symmetric matrix; Pure mathematics","score_opus":0.1040003659572495,"score_gpt":0.37818157387121376,"score_spread":0.2741812079139643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406098331","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.0015471714,0.000042629592,0.9934136,0.001118874,0.000563379,0.00044309613,0.000020665166,0.00016265447,0.002687896],"genre_scores_gemma":[0.78313214,0.00007513265,0.21525687,0.00085086527,0.000035948226,0.00006695822,0.00031112254,0.000002949043,0.00026803894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984828,0.00010019425,0.00043754568,0.00031400242,0.00048738153,0.00017807489],"domain_scores_gemma":[0.9987036,0.00011991811,0.00030467715,0.0004685148,0.0003610097,0.00004226267],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00069027743,0.00011581039,0.00011594207,0.00036266175,0.00046601816,0.0005611322,0.0011209741,0.00006305456,0.000016524627],"category_scores_gemma":[0.00029507012,0.000095235504,0.000020218667,0.0017543125,0.00010396594,0.015194625,0.00038245853,0.00008635918,0.00023335553],"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.00002899185,0.0001524541,0.0013132433,0.00009157714,0.000034144214,8.5183365e-7,0.0063200817,0.0030262163,0.005142753,0.03469939,0.0069960984,0.9421942],"study_design_scores_gemma":[0.00041412466,0.000046996392,0.0022864067,0.00008622654,0.0000061592764,0.00000172799,0.0006120053,0.9845016,0.0065515735,0.0029413432,0.0024128123,0.00013900708],"about_ca_topic_score_codex":0.00011115247,"about_ca_topic_score_gemma":0.000018837432,"teacher_disagreement_score":0.9814754,"about_ca_system_score_codex":0.000047275087,"about_ca_system_score_gemma":0.00018730208,"threshold_uncertainty_score":0.9985793},"labels":[],"label_agreement":null},{"id":"W4406852867","doi":"10.1016/j.ins.2025.121908","title":"Adaptive knowledge transfer based on machine learning method for evolutionary multitasking optimization","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Defense Basic Scientific Research Program of China; Northwestern Polytechnical University; National Natural Science Foundation of China","keywords":"Human multitasking; Computer science; Transfer of learning; Artificial intelligence; Knowledge transfer; Machine learning; Distributed computing; Theoretical computer science; Knowledge management; Psychology; Cognitive psychology","score_opus":0.03902144589697563,"score_gpt":0.3539665320585347,"score_spread":0.31494508616155903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406852867","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003792769,0.000045422443,0.980896,0.0010005613,0.0003103094,0.0004777817,0.000011830049,0.00014577643,0.017108548],"genre_scores_gemma":[0.03209536,0.000007909259,0.96691364,0.00052987185,0.000016336602,0.00010398909,0.000033581637,0.0000030911333,0.00029622111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983702,0.00021666041,0.00039318838,0.0002568578,0.00050452066,0.00025862473],"domain_scores_gemma":[0.9980505,0.0010639942,0.00007888218,0.00019491861,0.000550917,0.0000607598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020831835,0.00012528004,0.00013443819,0.0009166217,0.00075993943,0.00038415744,0.000725905,0.000058716796,0.000043070977],"category_scores_gemma":[0.00094893103,0.00010893158,0.00006451038,0.0018176074,0.00009674399,0.0021106063,0.0000768779,0.00014164987,0.000029967707],"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.0000135221735,0.000024631414,0.000028610828,0.000016375756,0.0000046031614,7.1303e-8,0.0003598669,0.90945435,0.0000027815236,0.03281241,0.0002268768,0.057055913],"study_design_scores_gemma":[0.00054055767,0.0001410335,0.00009101353,0.000035475598,0.000003990422,7.0492547e-7,0.00009928135,0.99178207,0.00016835911,0.0003807883,0.0066421917,0.0001145055],"about_ca_topic_score_codex":0.000021570966,"about_ca_topic_score_gemma":0.00000221743,"teacher_disagreement_score":0.08232776,"about_ca_system_score_codex":0.000097250166,"about_ca_system_score_gemma":0.0004153807,"threshold_uncertainty_score":0.58449167},"labels":[],"label_agreement":null},{"id":"W4407240655","doi":"10.1016/j.ins.2025.121957","title":"NEEP-ADF: Neuro-encoded expression programming with automatically defined functions","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Taishan Scholar Project of Shandong Province; Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Computer science; Expression (computer science); Artificial intelligence; Programming language","score_opus":0.011140181132587027,"score_gpt":0.2515186582510849,"score_spread":0.24037847711849786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407240655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005058174,0.000014710094,0.9724473,0.0045575453,0.00016312358,0.00026028557,0.0000020256045,0.00036994967,0.017126918],"genre_scores_gemma":[0.47461888,0.000004009319,0.52343726,0.0013055681,0.00002162656,0.00022322162,0.000010385175,0.0000021511053,0.00037692033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884766,0.00002522812,0.0003141394,0.00019003938,0.00040179616,0.00022114023],"domain_scores_gemma":[0.9991847,0.00015296703,0.00012564709,0.00030052444,0.00017335116,0.00006279296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002835768,0.00009912915,0.00008700261,0.00026399357,0.00087998743,0.00059011404,0.0007087023,0.00003495439,0.000011057747],"category_scores_gemma":[0.00008796599,0.000071335686,0.000030351086,0.0019443847,0.00018380031,0.0038080604,0.00015258507,0.0000872649,0.000099876306],"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.000007604978,0.00013451348,0.0015092414,0.000039626986,0.000011151856,8.6726965e-7,0.001257124,0.009453923,0.0006649381,0.67204726,0.008658777,0.306215],"study_design_scores_gemma":[0.00039389543,0.00015817359,0.009840301,0.000081053004,0.000007523058,0.000020568586,0.0006209615,0.89344186,0.00072439486,0.0075449995,0.08693467,0.00023157679],"about_ca_topic_score_codex":0.000017935188,"about_ca_topic_score_gemma":0.0000044308676,"teacher_disagreement_score":0.88398796,"about_ca_system_score_codex":0.00002666657,"about_ca_system_score_gemma":0.00027724844,"threshold_uncertainty_score":0.6768241},"labels":[],"label_agreement":null},{"id":"W4407946104","doi":"10.1016/j.ins.2025.122017","title":"Ensuring privacy and correlation awareness in multi-dimensional service quality prediction and recommendation for IoT","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Recommender Systems and Techniques","field":"Computer Science","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":"University of Calgary","funders":"","keywords":"Computer science; Internet of Things; Correlation; Internet privacy; Quality (philosophy); Privacy protection; Service (business); Computer security; Data mining; Business; Mathematics","score_opus":0.09104766350588545,"score_gpt":0.37061107159453194,"score_spread":0.2795634080886465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407946104","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.15538572,0.000019581797,0.8407692,0.0027350008,0.00030802694,0.00033893294,0.0000059229574,0.00008204421,0.00035562355],"genre_scores_gemma":[0.9540574,0.000008422748,0.04535849,0.00049014133,0.000006270214,0.000053993957,0.000013025092,8.4058325e-7,0.000011395382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999198,0.00005168218,0.00037942478,0.00015287669,0.00011815028,0.000099851524],"domain_scores_gemma":[0.9994389,0.00018089016,0.00015065125,0.000088230736,0.00011936253,0.000022006134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015405496,0.00006437801,0.000089370806,0.00027473952,0.00026069404,0.00026450946,0.00014860251,0.000047463953,7.7112793e-7],"category_scores_gemma":[0.000094273615,0.000057383415,0.000009855115,0.00044593963,0.000027745624,0.0023883025,0.000118020704,0.000044881148,6.635742e-7],"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.000023578015,0.00006235067,0.2754886,0.00040360537,0.000011833968,7.339302e-8,0.008990379,0.0025833505,0.0003300747,0.09721102,0.0005499302,0.6143452],"study_design_scores_gemma":[0.00036390877,0.00002191059,0.22715294,0.00006126327,9.99124e-7,0.0000022050592,0.00016714302,0.76640564,0.000292607,0.0028650812,0.0026027712,0.00006352446],"about_ca_topic_score_codex":0.0003508379,"about_ca_topic_score_gemma":0.00009373206,"teacher_disagreement_score":0.7986717,"about_ca_system_score_codex":0.000034210818,"about_ca_system_score_gemma":0.00008086411,"threshold_uncertainty_score":0.25506708},"labels":[],"label_agreement":null},{"id":"W4408225310","doi":"10.1016/j.ins.2025.122067","title":"A group recommendation method based on automatically integrating members' preferences via taking advantages of LLM","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Science Foundation of Shandong Province","keywords":"Group (periodic table); Computer science; Information retrieval; Data mining","score_opus":0.025149281178178714,"score_gpt":0.34980298836291973,"score_spread":0.324653707184741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408225310","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.0010109133,0.000004613736,0.9215892,0.0015520026,0.00031944583,0.00022552937,0.0000020704701,0.00021252676,0.07508368],"genre_scores_gemma":[0.603517,0.0000019348481,0.39557734,0.0008557367,0.0000053578947,0.000030442152,0.00000392208,9.787427e-7,0.0000072947705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983797,0.00018274918,0.0006882281,0.00018714125,0.00038664104,0.00017552252],"domain_scores_gemma":[0.998399,0.00057338335,0.00060460943,0.00024283328,0.00014711592,0.00003304242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026019327,0.00012496163,0.00019477868,0.0005977624,0.0002474312,0.00040199517,0.00082229555,0.000077621175,0.000035973022],"category_scores_gemma":[0.00026182283,0.00009181884,0.000056643097,0.0010846305,0.0000686602,0.0031554576,0.000121276265,0.00013682392,0.0000053766594],"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.0000033541753,0.00003627686,0.00069975515,0.000076795906,0.000006615303,7.5681186e-8,0.0010184218,0.00037745392,0.00014241449,0.14088057,0.0004949433,0.85626334],"study_design_scores_gemma":[0.000139374,0.00022622726,0.0011723674,0.00025389588,0.0000031280288,0.000001610565,0.0005067804,0.9794858,0.0045393817,0.00954325,0.004012446,0.00011574779],"about_ca_topic_score_codex":0.00017952663,"about_ca_topic_score_gemma":0.000026396165,"teacher_disagreement_score":0.97910833,"about_ca_system_score_codex":0.000044005454,"about_ca_system_score_gemma":0.000113352384,"threshold_uncertainty_score":0.38764486},"labels":[],"label_agreement":null},{"id":"W4408740429","doi":"10.1016/j.ins.2025.122114","title":"A multi-modal unsupervised machine learning approach for biomedical signal processing during cardiopulmonary resuscitation","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Non-Invasive Vital Sign Monitoring","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cardiopulmonary resuscitation; Modal; Computer science; Signal processing; SIGNAL (programming language); Artificial intelligence; Unsupervised learning; Machine learning; Resuscitation; Medicine; Emergency medicine; Digital signal processing; Computer hardware; Chemistry","score_opus":0.019692580474461742,"score_gpt":0.26209983083910515,"score_spread":0.24240725036464342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408740429","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.123448655,0.00026695748,0.8704618,0.000043739994,0.00028889233,0.00040532893,0.000013174139,0.0003901234,0.004681316],"genre_scores_gemma":[0.9563164,0.000008169302,0.04341464,0.000016678126,0.00007333085,0.00009566546,0.00004612842,0.0000066883617,0.000022287533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883527,0.000021842068,0.00036564845,0.00014077633,0.00035513536,0.00028132633],"domain_scores_gemma":[0.9996437,0.00006966629,0.000058453377,0.00006525304,0.000103627404,0.00005929653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055839476,0.0001334628,0.00013889388,0.00048015604,0.0005236624,0.00023996943,0.0002301982,0.00007212895,0.0000026317057],"category_scores_gemma":[0.00010988814,0.00012370007,0.000055259705,0.00090818043,0.00012776373,0.0019495744,0.000043893102,0.00014947736,0.0000054812217],"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.0000689773,0.000050574105,0.017708877,0.002303798,0.000058374797,0.0000018677781,0.005166804,0.6649138,0.14625363,0.00018764954,0.00007765618,0.163208],"study_design_scores_gemma":[0.00060591486,0.000031332373,0.00257283,0.000100312376,0.00000922878,0.000003965104,0.0013776317,0.9874029,0.006944555,0.000059741247,0.0007153511,0.00017625061],"about_ca_topic_score_codex":0.000018200813,"about_ca_topic_score_gemma":9.277476e-7,"teacher_disagreement_score":0.83286774,"about_ca_system_score_codex":0.00010124263,"about_ca_system_score_gemma":0.00007643429,"threshold_uncertainty_score":0.5044342},"labels":[],"label_agreement":null},{"id":"W4409430152","doi":"10.1016/j.ins.2025.122194","title":"Diverse and feasible retrosynthesis using GFlowNets","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Narodowe Centrum Nauki; Fundacja na rzecz Nauki Polskiej","keywords":"Retrosynthetic analysis; Computer science; Chemistry","score_opus":0.041252676565881975,"score_gpt":0.3047082114465902,"score_spread":0.2634555348807082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409430152","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.08216491,0.00004406603,0.86538595,0.0008830406,0.0003492699,0.00008624726,8.055857e-7,0.00011073493,0.05097498],"genre_scores_gemma":[0.9452071,0.000011820784,0.05354869,0.0010714834,0.00000635029,0.0000017460187,3.5799195e-7,5.5038726e-7,0.00015188669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999339,0.000027066424,0.00016189515,0.00010437173,0.00023749446,0.00013021678],"domain_scores_gemma":[0.9996388,0.00007653121,0.000079132646,0.00011028725,0.0000581102,0.00003716706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005641491,0.00005314596,0.00006025951,0.0002802942,0.00046465034,0.0006433777,0.00034407657,0.000023726008,0.000015520725],"category_scores_gemma":[0.00015762613,0.000045087007,0.000016227303,0.0007996553,0.00012060519,0.0037037076,0.00014247009,0.000043293247,0.000032565156],"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.0000047746753,0.000011637187,0.010325486,0.000028203158,0.000009012846,9.24866e-7,0.0042839274,0.0058749616,0.00046527907,0.31099227,0.0010371495,0.6669664],"study_design_scores_gemma":[0.00019018808,0.000020572352,0.016222963,0.000035402536,0.0000030282076,0.0000056353883,0.001864693,0.95066595,0.0005738823,0.0027581588,0.0275408,0.00011872837],"about_ca_topic_score_codex":0.000041222735,"about_ca_topic_score_gemma":0.0000034146979,"teacher_disagreement_score":0.94479096,"about_ca_system_score_codex":0.00002147524,"about_ca_system_score_gemma":0.00009710307,"threshold_uncertainty_score":0.62041056},"labels":[],"label_agreement":null},{"id":"W4409744558","doi":"10.1016/j.ins.2025.122238","title":"Reward shaping in DRL: A novel framework for adaptive resource management in dynamic environments","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Dynamic capabilities; Adaptive management; Resource (disambiguation); Process management; Knowledge management; Business; Environmental resource management; Computer network","score_opus":0.034461723783076166,"score_gpt":0.3075118458420571,"score_spread":0.27305012205898094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409744558","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.008387826,0.000027095368,0.98085064,0.0047015008,0.00015074843,0.0005600033,0.0000023531286,0.000116436095,0.005203403],"genre_scores_gemma":[0.5338382,0.000009264571,0.4642928,0.0015899015,0.0000029108337,0.000170727,0.0000013070763,0.0000014784528,0.000093406816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986628,0.0000139163285,0.00038023334,0.00025383616,0.00035398777,0.000335196],"domain_scores_gemma":[0.9993873,0.00016103726,0.00010634131,0.0003071033,0.000013357873,0.000024834553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009985206,0.00010348197,0.00011920862,0.0010108467,0.00012654747,0.00022946327,0.0015335571,0.000071352166,7.9618434e-7],"category_scores_gemma":[0.000152519,0.000099765246,0.00002443098,0.0022463128,0.00010751936,0.0016051038,0.00062989903,0.00012324766,0.000021315029],"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.00001735588,0.000039672246,0.0008379368,0.000023716131,0.000008602601,0.0000012863007,0.0032291613,0.063359745,0.000023606017,0.5442049,0.00065420085,0.38759986],"study_design_scores_gemma":[0.00055404514,0.00010324529,0.026926404,0.00040650927,0.0000023515975,0.0000011663046,0.0033862535,0.8274851,0.00017075824,0.091020934,0.049666222,0.000277012],"about_ca_topic_score_codex":0.000015292295,"about_ca_topic_score_gemma":0.000037342183,"teacher_disagreement_score":0.76412535,"about_ca_system_score_codex":0.00021589806,"about_ca_system_score_gemma":0.00003719707,"threshold_uncertainty_score":0.40683088},"labels":[],"label_agreement":null},{"id":"W4410031989","doi":"10.1016/j.ins.2025.122254","title":"Improving confidence intervals and central value estimation in small datasets through hybrid parametric bootstrapping","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nuclear Laboratories","funders":"","keywords":"Bootstrapping (finance); Confidence interval; Parametric statistics; Value (mathematics); Statistics; Computer science; Estimation; Robust confidence intervals; Econometrics; Mathematics","score_opus":0.02868751015281328,"score_gpt":0.3120221090664929,"score_spread":0.2833345989136796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410031989","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.013972186,0.00012394223,0.9828261,0.000591114,0.00026682724,0.00018822029,0.00000758014,0.00004768337,0.001976331],"genre_scores_gemma":[0.617262,0.000022602095,0.38184175,0.0008517193,0.0000039497663,0.0000075256157,0.00000525763,6.5245e-7,0.0000045102342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883145,0.00008145728,0.00041590605,0.00021963603,0.00018644905,0.00026509637],"domain_scores_gemma":[0.99932265,0.00021666431,0.0001669946,0.00021270015,0.000039269242,0.00004170954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011490147,0.000100096564,0.00013036256,0.0003922427,0.00017497402,0.0007714454,0.0006259932,0.000033618187,0.0000015902624],"category_scores_gemma":[0.00043354215,0.0000867981,0.000020806683,0.0011485505,0.00013403835,0.005819787,0.00021263472,0.00010605865,0.0000038795565],"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.0000021302599,0.000008680763,0.0002851659,0.00005564624,0.0000027397386,0.0000012218167,0.0012643199,0.0024814487,0.000054641274,0.3733728,0.00013790013,0.62233335],"study_design_scores_gemma":[0.00016900443,0.000024434814,0.0029855878,0.000095182244,0.0000023854311,0.000009086146,0.00007822476,0.92295825,0.001441453,0.071713254,0.00041778266,0.00010535104],"about_ca_topic_score_codex":0.00042663226,"about_ca_topic_score_gemma":0.000013624541,"teacher_disagreement_score":0.9204768,"about_ca_system_score_codex":0.00003609062,"about_ca_system_score_gemma":0.00015821245,"threshold_uncertainty_score":0.7439066},"labels":[],"label_agreement":null},{"id":"W4410194857","doi":"10.1016/j.ins.2025.122273","title":"ECG-STAR: Spatio-temporal attention residual networks for multi-label ECG abnormality classification","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"ECG Monitoring and Analysis","field":"Medicine","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Science and Technology Council","keywords":"Residual; Abnormality; Computer science; Artificial intelligence; Pattern recognition (psychology); Data mining; Medicine; Algorithm","score_opus":0.0995800255986423,"score_gpt":0.38660553967648503,"score_spread":0.2870255140778427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410194857","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.40739164,0.00009386259,0.58606005,0.003083227,0.0006347527,0.00049813214,0.000015627164,0.0001402118,0.0020824887],"genre_scores_gemma":[0.9571561,0.00003159421,0.041058447,0.0004461391,0.00010515332,0.000050249757,0.00028246507,0.000002271629,0.00086755503],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988476,0.000029980227,0.00047693116,0.00014429424,0.00031002675,0.00019116266],"domain_scores_gemma":[0.99914765,0.000065251144,0.00023159794,0.00016171634,0.00033878235,0.000054974207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011732755,0.00009218515,0.00015139612,0.00029748134,0.0004350696,0.00015945523,0.00012740547,0.00008153442,0.000011664669],"category_scores_gemma":[0.00022094056,0.00007615182,0.00006863347,0.0007182418,0.00013524466,0.0011428107,0.00002356099,0.000091069705,0.000020590081],"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.00016368926,0.0001621023,0.68163896,0.0002267074,0.000084812265,4.805007e-7,0.0005468603,0.0015906933,0.0001465238,0.0016677816,0.007566588,0.30620483],"study_design_scores_gemma":[0.0007259713,0.00006900916,0.14860138,0.0000676434,0.000053636926,0.0000012043395,0.000891686,0.84599817,0.00013659206,0.000055498134,0.0033255012,0.00007373338],"about_ca_topic_score_codex":0.00016178694,"about_ca_topic_score_gemma":0.000056303183,"teacher_disagreement_score":0.84440744,"about_ca_system_score_codex":0.00007111245,"about_ca_system_score_gemma":0.00015510843,"threshold_uncertainty_score":0.33462477},"labels":[],"label_agreement":null},{"id":"W4410315560","doi":"10.1016/j.ins.2025.122262","title":"A high-order hesitancy fuzzy time series model based on improved cumulative probability distribution approach and weighted fuzzy logic relationship","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"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":"Fuzzy logic; Series (stratigraphy); Computer science; Mathematics; Order (exchange); Cumulative distribution function; Artificial intelligence; Statistics; Probability density function","score_opus":0.08265644704290166,"score_gpt":0.35739903518682115,"score_spread":0.2747425881439195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410315560","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.09817299,0.000017767217,0.81818014,0.0024303063,0.00024251259,0.0009813312,0.000113027665,0.00016898019,0.079692945],"genre_scores_gemma":[0.776348,7.5572405e-7,0.22246185,0.00036976713,0.000013594298,0.00008013165,0.00006016721,0.0000030724043,0.0006626423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961228,0.0005770756,0.0010872554,0.00053741003,0.0013328736,0.000342607],"domain_scores_gemma":[0.9946395,0.0032300493,0.0005799667,0.0005156371,0.0009350947,0.00009975369],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0105629545,0.00024289776,0.00033984828,0.00059192703,0.0010641014,0.0008075365,0.00062911655,0.00016027436,0.000034495384],"category_scores_gemma":[0.018530797,0.00016864434,0.000076007746,0.0038863753,0.0007199801,0.00370506,0.00015533046,0.00022274282,0.000053354503],"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.00063203805,0.00023366242,0.023938099,0.00010015704,0.000024291707,3.7123633e-7,0.0023517958,0.27486837,0.000094270705,0.5649072,0.003472161,0.12937757],"study_design_scores_gemma":[0.0002626439,0.000080845646,0.029410072,0.000017686407,0.000007290142,0.0000010250883,0.00017681556,0.60662496,0.00005671133,0.3630645,0.00017048756,0.00012695188],"about_ca_topic_score_codex":0.000025293642,"about_ca_topic_score_gemma":0.0000049704313,"teacher_disagreement_score":0.67817503,"about_ca_system_score_codex":0.0001448261,"about_ca_system_score_gemma":0.00047058877,"threshold_uncertainty_score":0.98973656},"labels":[],"label_agreement":null},{"id":"W4410335224","doi":"10.1016/j.ins.2025.122290","title":"TrueCome: Effective data truth discovery based on fuzzy clustering with prior constraints","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","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":"University of Alberta","funders":"Higher Education Discipline Innovation Project; Xidian University; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Cluster analysis; Fuzzy clustering; Data mining; Fuzzy logic; Artificial intelligence","score_opus":0.015871188956005543,"score_gpt":0.2709001222210193,"score_spread":0.25502893326501375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410335224","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.029850861,0.000005811482,0.9341559,0.00067993,0.000494424,0.0002646337,0.000015364638,0.0001323903,0.034400728],"genre_scores_gemma":[0.985521,6.721e-7,0.013370165,0.0010459824,0.000013323544,0.000011217701,0.0000103469,0.0000014636436,0.00002578587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987578,0.000055937042,0.0002460373,0.00028967098,0.00041907595,0.00023152103],"domain_scores_gemma":[0.9986098,0.00047151488,0.00013938024,0.00067051774,0.00006452444,0.000044262626],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010518731,0.00012233101,0.00012975039,0.00032242766,0.00047516578,0.0014506805,0.0011799078,0.00003292234,0.0000029623611],"category_scores_gemma":[0.00022682587,0.00008689741,0.000022107548,0.0009328982,0.0003528938,0.0050696614,0.0002642417,0.000103865474,0.000020536563],"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.000049102997,0.00004571677,0.0015562397,0.000094466166,0.000018497203,0.0000042902843,0.0014012981,0.07804285,0.000047507932,0.028789634,0.0006473595,0.889303],"study_design_scores_gemma":[0.00059861684,0.00015608185,0.0073387125,0.00028057332,0.0000055255464,0.000009355015,0.00045034048,0.98850316,0.00081264065,0.00026714356,0.0013991547,0.00017872003],"about_ca_topic_score_codex":0.0000272146,"about_ca_topic_score_gemma":0.00001426553,"teacher_disagreement_score":0.9556702,"about_ca_system_score_codex":0.000044278775,"about_ca_system_score_gemma":0.00029778376,"threshold_uncertainty_score":0.9995859},"labels":[],"label_agreement":null},{"id":"W4410992343","doi":"10.1016/j.ins.2025.122376","title":"A trilevel framework of rough sets and granular rough sets: Characterizing existing models and formulating new models","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Humanities and Social Science Fund of Ministry of Education of China; China Scholarship Council; Natural Science Foundation of Xinjiang Province","keywords":"Rough set; Computer science; Mathematics; Data mining","score_opus":0.08700347332519923,"score_gpt":0.3213662840405609,"score_spread":0.23436281071536166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410992343","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.08489239,0.00025767772,0.90432185,0.00093061244,0.00017131928,0.00019970625,0.0000063509938,0.00007260325,0.009147462],"genre_scores_gemma":[0.7763466,0.0000615603,0.22275932,0.00080189,0.000012113433,0.0000051879124,0.0000023476637,0.0000016500131,0.000009312413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984975,0.000029295472,0.0005702665,0.00023690458,0.0003863493,0.00027967847],"domain_scores_gemma":[0.99907184,0.0002165913,0.00031925028,0.00022082994,0.00009457921,0.00007690923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083589205,0.00014705822,0.0002273412,0.0002496897,0.0004580313,0.00070399203,0.0005100567,0.00008712397,0.0000012466514],"category_scores_gemma":[0.00014088716,0.00011995201,0.00003475442,0.0008406567,0.00013145659,0.009931151,0.00034535324,0.00012466908,0.0000011860744],"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.000007724647,0.000010710563,0.0005239083,0.00011065527,0.000009157929,6.55104e-7,0.019277181,0.03204937,0.00004212547,0.50239456,0.00008435785,0.44548962],"study_design_scores_gemma":[0.00016097586,0.000035053406,0.0008043482,0.00014940719,0.0000032651385,0.000005906494,0.00024195408,0.7340361,0.00005717598,0.26423946,0.00016290383,0.00010346838],"about_ca_topic_score_codex":0.00015488407,"about_ca_topic_score_gemma":0.0000023460834,"teacher_disagreement_score":0.70198673,"about_ca_system_score_codex":0.00001847207,"about_ca_system_score_gemma":0.00014485916,"threshold_uncertainty_score":0.7199845},"labels":[],"label_agreement":null},{"id":"W4412048596","doi":"10.1016/j.ins.2025.122479","title":"Adapting lightweight SAM with gradient map for mirror object segmentation","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Visual Attention and Saliency Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Information and Communications Technology Promotion; Information Technology Research Centre; Ministry of Science and ICT, South Korea; National Natural Science Foundation of China","keywords":"Computer vision; Computer science; Artificial intelligence; Object (grammar); Segmentation","score_opus":0.023431195796034622,"score_gpt":0.3051023279948464,"score_spread":0.28167113219881174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412048596","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.030646643,0.000014782718,0.96133155,0.0018261633,0.00076637045,0.00038389658,0.000002067105,0.00015838668,0.004870134],"genre_scores_gemma":[0.91526276,0.0000033146075,0.08304405,0.0011373863,0.000013906388,0.00011126099,0.000007647896,0.0000015690258,0.0004180974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899775,0.000024801802,0.00029137617,0.00016543666,0.0003332953,0.00018732213],"domain_scores_gemma":[0.99944615,0.000059872746,0.00016153863,0.00012953686,0.00016742514,0.000035486693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060436095,0.00008600657,0.00007856719,0.0003459861,0.0005789239,0.000521829,0.00038740077,0.00002787923,0.000006457515],"category_scores_gemma":[0.00003492129,0.00006242693,0.000039596962,0.00092045736,0.000069429196,0.0035977443,0.000046481426,0.000040226085,0.000041432908],"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.00007103708,0.000114812065,0.0027131531,0.00024614338,0.00004599609,6.6665456e-7,0.008606378,0.0016040552,0.0034893132,0.6264326,0.004231144,0.3524447],"study_design_scores_gemma":[0.0021544439,0.0014158124,0.014533995,0.00023538557,0.000025885567,0.000019903368,0.004210904,0.75426674,0.061782744,0.011810163,0.14888681,0.0006572074],"about_ca_topic_score_codex":0.000028323617,"about_ca_topic_score_gemma":0.000028820363,"teacher_disagreement_score":0.88461614,"about_ca_system_score_codex":0.000050806266,"about_ca_system_score_gemma":0.000109902794,"threshold_uncertainty_score":0.50320095},"labels":[],"label_agreement":null},{"id":"W4413049812","doi":"10.1016/j.ins.2025.122561","title":"A context-aware multi-stream attentive convolutional neural network for surface defect segmentation","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Convolutional neural network; Computer science; Context (archaeology); Segmentation; Artificial intelligence; Surface (topology); Artificial neural network; Pattern recognition (psychology); Machine learning; Geology; Mathematics","score_opus":0.036288707917104986,"score_gpt":0.293265785071727,"score_spread":0.25697707715462204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413049812","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.47535148,0.00015918055,0.5175972,0.00009541306,0.0034493047,0.0009741376,0.00008331659,0.0002998595,0.0019900738],"genre_scores_gemma":[0.9987848,0.0000030446372,0.00084008306,0.00013043966,0.00006371616,0.000047460777,0.00003519244,0.0000025088166,0.00009277494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920595,0.000024916508,0.00032460334,0.0000851719,0.00017686721,0.00018249066],"domain_scores_gemma":[0.99955297,0.00014000916,0.000078550125,0.000057753852,0.00014303689,0.000027684635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004725352,0.0000932303,0.00010999038,0.00010678063,0.0003506293,0.00016677685,0.00008852186,0.00007143611,0.000013980641],"category_scores_gemma":[0.0000435228,0.0000821565,0.00007867647,0.0004724772,0.000057754314,0.0010791963,0.0000128541815,0.00006366292,0.000033493707],"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.000036423666,0.000008513537,0.004956266,0.00006780418,0.000046859703,1.03222945e-7,0.0006412859,0.93401337,0.00045374568,0.0013499168,0.01608669,0.04233901],"study_design_scores_gemma":[0.0009791323,0.00006844798,0.004534824,0.000057173784,0.000013270623,0.000002619295,0.0018799774,0.97657883,0.0019236665,0.000084006104,0.013734615,0.00014342814],"about_ca_topic_score_codex":0.00006433534,"about_ca_topic_score_gemma":0.000039447157,"teacher_disagreement_score":0.52343327,"about_ca_system_score_codex":0.000077289835,"about_ca_system_score_gemma":0.000048644066,"threshold_uncertainty_score":0.33502448},"labels":[],"label_agreement":null},{"id":"W4413324272","doi":"10.1016/j.ins.2025.122603","title":"On the consistency of GNN explanations for malware detection","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Malware Detection 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 New Brunswick","funders":"","keywords":"Malware; Consistency (knowledge bases); Computer science; Natural language processing; Computer security; Artificial intelligence","score_opus":0.020758196650309736,"score_gpt":0.29724954850089214,"score_spread":0.2764913518505824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413324272","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.0016369667,0.00000815133,0.9851389,0.0019614084,0.00028188404,0.00032917722,0.0000060605,0.00015389001,0.010483554],"genre_scores_gemma":[0.97419596,0.0000043325613,0.024611108,0.00097514084,0.000004735321,0.00014431012,8.731204e-7,7.5537224e-7,0.00006277234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993083,0.000021442589,0.00026558404,0.00009399901,0.0002131231,0.00009755978],"domain_scores_gemma":[0.99881566,0.0005227746,0.00017392653,0.00021989839,0.0002551573,0.0000125882825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005356241,0.000056304845,0.00006392428,0.0003254043,0.00043918882,0.00011312137,0.0005432065,0.000028695024,0.000005251835],"category_scores_gemma":[0.0006175612,0.00003859023,0.00004083797,0.00094057637,0.00013992596,0.0015830093,0.000053934804,0.0000460821,0.0000074149557],"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.0000037238403,0.000006626141,0.0000106898015,0.000012124486,0.0000029212326,1.4588906e-8,0.00026252598,0.00049792806,0.00023631584,0.87353075,0.000978921,0.124457434],"study_design_scores_gemma":[0.00036758365,0.00050342834,0.0012735885,0.00010528484,0.0000076105002,0.0000063587668,0.0014846093,0.12766147,0.38569528,0.416841,0.06581058,0.00024318944],"about_ca_topic_score_codex":0.00001033243,"about_ca_topic_score_gemma":0.000009965764,"teacher_disagreement_score":0.97255903,"about_ca_system_score_codex":0.00002873411,"about_ca_system_score_gemma":0.00008772292,"threshold_uncertainty_score":0.33779296},"labels":[],"label_agreement":null},{"id":"W4413422792","doi":"10.1016/j.ins.2025.122608","title":"Domain adaptation techniques for natural and medical image classification","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Specific Research Project of Guangxi for Research Bases and Talents; Guilin University of Electronic Technology; National Natural Science Foundation of China","keywords":"Domain adaptation; Computer science; Domain (mathematical analysis); Adaptation (eye); Natural (archaeology); Image (mathematics); Artificial intelligence; Contextual image classification; Pattern recognition (psychology); Computer vision; Data mining; Geography; Mathematics; Classifier (UML); Psychology","score_opus":0.03627827472817568,"score_gpt":0.386686340633927,"score_spread":0.3504080659057513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413422792","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.096859895,0.00016695328,0.5859203,0.30706418,0.0005065903,0.0015258703,0.000010257707,0.00036964475,0.007576337],"genre_scores_gemma":[0.91166854,0.000053665433,0.06131781,0.026673542,0.00004533797,0.00013174007,0.000034748893,0.000002036852,0.00007259811],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992325,0.000013324722,0.00023663422,0.00009126618,0.0003334426,0.00009284238],"domain_scores_gemma":[0.99937445,0.00025969325,0.00008045756,0.00007315915,0.00017294945,0.000039317787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009112001,0.000051580402,0.00008104505,0.00027421577,0.00017622861,0.00010578536,0.00007973769,0.000053773096,0.00000979638],"category_scores_gemma":[0.0009096293,0.0000404209,0.00002182762,0.00036079696,0.00024553976,0.00092984916,0.000022029071,0.000059534606,0.0000052815826],"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.00011806077,0.000063578875,0.003580649,0.0004769782,0.000018927072,6.74361e-7,0.0035539418,0.0000063913435,0.004407539,0.08579652,0.03747444,0.8645023],"study_design_scores_gemma":[0.0013669678,0.00024564448,0.077806115,0.00054753124,0.00003809395,0.000019449319,0.0040198555,0.19576387,0.00903881,0.0074896473,0.70347387,0.00019014989],"about_ca_topic_score_codex":0.00003116872,"about_ca_topic_score_gemma":0.000011788254,"teacher_disagreement_score":0.8643122,"about_ca_system_score_codex":0.000056691046,"about_ca_system_score_gemma":0.0003388381,"threshold_uncertainty_score":0.16483164},"labels":[],"label_agreement":null},{"id":"W4414187888","doi":"10.1016/j.ins.2025.122684","title":"SEAD-MGFE-Net: Schrödinger equation-based adaptive dropout multi-granular feature enhancement network for conversational aspect-based sentiment quadruple analysis","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"Science and Technology Service Network Plan; National Key Research and Development Program of China; Sichuan Province Science and Technology Support Program; Chengdu Science and Technology Bureau; Organization Department of Sichuan Provincial Party Committee; Ministry of Science and Technology of the People's Republic of China; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Dropout (neural networks); Sentiment analysis; Feature (linguistics); Benchmark (surveying); Regularization (linguistics); Adjacency list; Feature extraction; Syntax; Sentence","score_opus":0.033696778352127754,"score_gpt":0.3038836580473439,"score_spread":0.27018687969521615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414187888","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.0021541803,0.00009296001,0.99306005,0.0029288938,0.00047945022,0.0004593565,0.000014256737,0.00007900026,0.000731853],"genre_scores_gemma":[0.6976402,0.0000026528905,0.299446,0.002179701,0.00005047163,0.00011571808,0.00024475766,0.0000027520716,0.00031779264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976309,0.000081461265,0.00058716873,0.00040068434,0.0009151156,0.00038465988],"domain_scores_gemma":[0.9982495,0.000377189,0.00047284475,0.00033621315,0.0004844596,0.000079805075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016024328,0.00020498355,0.0002861724,0.0009495489,0.0008615323,0.0008143215,0.0007382482,0.00007568691,0.00012615639],"category_scores_gemma":[0.000083019506,0.00018097908,0.00030684358,0.003787622,0.00013728722,0.0016149885,0.00007569553,0.00008679742,0.000055739678],"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.000040606323,0.00015491735,0.020666752,0.00003482535,0.00042756365,3.5581408e-7,0.0010435426,0.9100315,0.00010502008,0.053369284,0.008375094,0.0057505397],"study_design_scores_gemma":[0.0008292701,0.000081398364,0.0024722584,0.00003402643,0.00013811243,5.2352203e-8,0.000313591,0.98796153,0.0023470523,0.00025388383,0.0053622993,0.00020654645],"about_ca_topic_score_codex":0.00006450624,"about_ca_topic_score_gemma":0.000036251127,"teacher_disagreement_score":0.695486,"about_ca_system_score_codex":0.00015242558,"about_ca_system_score_gemma":0.0004972176,"threshold_uncertainty_score":0.7852521},"labels":[],"label_agreement":null},{"id":"W4414253664","doi":"10.1016/j.ins.2025.122690","title":"Data stream clustering via fuzzy similarity and diffusion-enhanced contextual affinity","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Data Stream Mining Techniques","field":"Computer Science","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":"University of Alberta","funders":"National Natural Science Foundation of China; Key Research and Development Program of Liaoning Province; Key Project of Research and Development Plan of Hunan Province","keywords":"Cluster analysis; Fuzzy clustering; Data stream clustering; Similarity (geometry); Data stream; Pairwise comparison; Fuzzy logic; Pattern recognition (psychology); Fuzzy set; Set (abstract data type)","score_opus":0.04328846388808345,"score_gpt":0.3203184941303876,"score_spread":0.27703003024230416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414253664","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.030885486,0.000019768919,0.9444808,0.0008643453,0.00024918126,0.00016367473,0.00007621721,0.00035335828,0.022907201],"genre_scores_gemma":[0.915496,0.000024347963,0.08358258,0.00081789726,0.000010083235,0.000008219769,0.00003808153,9.816478e-7,0.000021788888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988117,0.000037512236,0.00033232872,0.00028293004,0.00033128075,0.00020419841],"domain_scores_gemma":[0.99871004,0.00019045355,0.00014984004,0.00081114576,0.000084433086,0.000054094555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010145312,0.000110048066,0.00012646712,0.00023567495,0.00041101157,0.0008386872,0.00241809,0.000050908093,0.0000052263304],"category_scores_gemma":[0.00037370776,0.000093608964,0.000012851562,0.00066624425,0.00026914134,0.008477119,0.0028189148,0.00010154141,0.000014023445],"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.0000067775522,0.000036048743,0.001214898,0.000037277823,0.00000828864,6.8134136e-7,0.0015762706,0.000043139513,0.00045087436,0.02087222,0.006560759,0.96919274],"study_design_scores_gemma":[0.0005612194,0.0001684952,0.019369913,0.00016377715,0.000009492694,0.000014582159,0.0009540945,0.93489164,0.0051677977,0.016138088,0.022112997,0.00044791732],"about_ca_topic_score_codex":0.00015015501,"about_ca_topic_score_gemma":0.00014393602,"teacher_disagreement_score":0.9687449,"about_ca_system_score_codex":0.000021808293,"about_ca_system_score_gemma":0.00012886309,"threshold_uncertainty_score":0.80874795},"labels":[],"label_agreement":null},{"id":"W4414306926","doi":"10.1016/j.ins.2025.122697","title":"FedWAPR: Bridging theory and practice in probability-driven weighted aggregation for federated learning","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","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":"University of Windsor","funders":"","keywords":"Modular design; Robustness (evolution); Bridging (networking); Data aggregator; Exponential function; Simplicity; Laplace distribution; Exponential growth","score_opus":0.026618178407947068,"score_gpt":0.3155311290338786,"score_spread":0.28891295062593153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414306926","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.03169836,0.0000756839,0.9405367,0.022704294,0.00015780199,0.0004351944,0.0000022070642,0.00031158174,0.0040782145],"genre_scores_gemma":[0.60918844,0.00004127947,0.3900037,0.0006601036,0.00000622826,0.00006643827,0.0000100158995,0.0000014954232,0.000022293038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881566,0.00019532941,0.00032857124,0.00022731615,0.00022736742,0.0002057743],"domain_scores_gemma":[0.99703985,0.001914689,0.00021295162,0.0006286463,0.00018453084,0.000019322504],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.004321215,0.0000828363,0.00009628577,0.00041041107,0.00049264205,0.0009412132,0.0034737065,0.000063097476,0.0000011957936],"category_scores_gemma":[0.08521682,0.000073635114,0.000013875519,0.001324444,0.0002048368,0.008662618,0.0054212576,0.00014378804,0.0000048250536],"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.000037082063,0.000022473814,0.002657594,0.000070408925,0.000008627324,4.8192743e-7,0.0015874217,0.00064996566,0.000104198276,0.16654374,0.0032269792,0.82509106],"study_design_scores_gemma":[0.00023269899,0.000040302446,0.0012602695,0.00007088402,0.0000019581578,0.000005133278,0.0005535994,0.72849417,0.0008929261,0.26394945,0.004410191,0.00008843451],"about_ca_topic_score_codex":0.000029940526,"about_ca_topic_score_gemma":0.000012232144,"teacher_disagreement_score":0.8250026,"about_ca_system_score_codex":0.000066158194,"about_ca_system_score_gemma":0.00016979393,"threshold_uncertainty_score":0.9224888},"labels":[],"label_agreement":null},{"id":"W4414681521","doi":"10.1016/j.ins.2025.122704","title":"3WD-DRT: A three-way decision enhanced dynamic routing transformer for cost-sensitive multimodal sentiment analysis","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"National Key Research and Development Program of China; Sichuan Province Science and Technology Support Program; National Natural Science Foundation of China; Department of Science and Technology of Sichuan Province; Organization Department of Sichuan Provincial Party Committee; Ministry of Science and Technology of the People's Republic of China; Chinese Academy of Sciences","keywords":"Sentiment analysis; Transformer; Key (lock); Partition (number theory); Routing (electronic design automation); Information fusion","score_opus":0.015098924396555299,"score_gpt":0.32011335375433064,"score_spread":0.30501442935777534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414681521","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.05712282,0.00001690588,0.9389042,0.0006506212,0.00035220437,0.00042299274,0.000007903887,0.00006744576,0.0024548583],"genre_scores_gemma":[0.9324053,0.000007721748,0.06699293,0.00043323205,0.000010023877,0.000045196397,0.000022024951,0.0000015271318,0.00008207257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980218,0.000028687828,0.0006690908,0.00033019425,0.0006031625,0.00034709525],"domain_scores_gemma":[0.9987504,0.00036031828,0.00027187905,0.00026259097,0.00029250453,0.0000623191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013253262,0.0001597273,0.0002765803,0.0010687894,0.0006900357,0.00078223913,0.0006522645,0.000057416313,0.000022519542],"category_scores_gemma":[0.000095460346,0.00013004588,0.0002972131,0.0034166654,0.0000967259,0.002969029,0.000082325314,0.000066682194,0.00004165467],"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.00003233143,0.00004894516,0.001624711,0.000015169925,0.0004015636,3.08766e-7,0.005397335,0.047865205,0.0013469214,0.01765593,0.00016266458,0.9254489],"study_design_scores_gemma":[0.00046376517,0.00003638133,0.0071594664,0.000036164285,0.00009295284,3.777114e-7,0.00080455106,0.9817512,0.008311396,0.00058307505,0.0006009226,0.000159766],"about_ca_topic_score_codex":0.000052702948,"about_ca_topic_score_gemma":0.00014042373,"teacher_disagreement_score":0.933886,"about_ca_system_score_codex":0.00008711643,"about_ca_system_score_gemma":0.000114433424,"threshold_uncertainty_score":0.754315},"labels":[],"label_agreement":null},{"id":"W4415140567","doi":"10.1016/j.ins.2025.122763","title":"Hesitant fuzzy linguistic term set based preference representation for composite decision makers in the graph model for conflict resolution","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for International Governance Innovation; University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Preference; Fuzzy logic; Term (time); Semantics (computer science); Group decision-making; Conflict resolution; Fuzzy set; Representation (politics); Set (abstract data type)","score_opus":0.37290882480777676,"score_gpt":0.48740631251294936,"score_spread":0.1144974877051726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415140567","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.096457526,0.000034948032,0.89738435,0.0011145774,0.00060009013,0.0016567309,0.00013151595,0.000038800208,0.002581473],"genre_scores_gemma":[0.9397309,0.000005048833,0.05817045,0.0016859501,0.000027295813,0.00026778848,0.000044028442,0.000003557037,0.000064992004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954189,0.00020366734,0.0016033177,0.0004866698,0.001913099,0.000374313],"domain_scores_gemma":[0.9885304,0.009112798,0.0006182873,0.0006428032,0.0010395602,0.00005614371],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010761202,0.00018871266,0.00029073787,0.0014948503,0.00084832177,0.0017101947,0.0016567733,0.00010434309,0.000011647479],"category_scores_gemma":[0.013904021,0.00012169825,0.00016275709,0.0024616015,0.0002687526,0.0018882077,0.00010719184,0.00011297293,0.0000219201],"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.002361769,0.0001417384,0.011780364,0.00009895672,0.00001721176,0.0000014598069,0.021078259,0.65434724,0.0015483405,0.07106802,0.022314806,0.21524185],"study_design_scores_gemma":[0.0010875472,0.000072684554,0.013124169,0.000104932325,0.0000096985905,0.0000014372317,0.0013723639,0.88541967,0.00019170326,0.09447625,0.0040040812,0.00013548146],"about_ca_topic_score_codex":0.00003766093,"about_ca_topic_score_gemma":0.00008435984,"teacher_disagreement_score":0.84327334,"about_ca_system_score_codex":0.00008093142,"about_ca_system_score_gemma":0.00030180515,"threshold_uncertainty_score":0.9993261},"labels":[],"label_agreement":null},{"id":"W4415254920","doi":"10.1016/j.ins.2025.122804","title":"Federated domain generalization with source knowledge preservation via discriminative ensembles","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Information and Communications Technology Promotion; Information Technology Research Centre; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; Ministry of Education, Ethiopia","keywords":"Discriminative model; Generalization; Regularization (linguistics); Benchmark (surveying); Ensemble learning; Feature (linguistics); Domain (mathematical analysis); Adversarial system; Labeled data","score_opus":0.01684071150768637,"score_gpt":0.2873510741744416,"score_spread":0.27051036266675527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415254920","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.012591243,0.000025796866,0.9493304,0.0026789166,0.00011919514,0.0001619566,0.0000013815211,0.00017911843,0.03491198],"genre_scores_gemma":[0.9756052,0.000005672651,0.022959286,0.0005103714,0.00001594119,0.000033582775,0.00007405388,0.0000017734029,0.000794149],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989786,0.0001150085,0.000267442,0.00018942414,0.0002955573,0.00015397609],"domain_scores_gemma":[0.99923414,0.00008733361,0.00019284053,0.0001789907,0.00027372123,0.000032959975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067470747,0.00009923685,0.00008285833,0.000323659,0.00068506127,0.00087137666,0.00048802528,0.00003855743,0.000006001838],"category_scores_gemma":[0.00011294086,0.000072385825,0.000015288599,0.0015607559,0.00011548127,0.0061664386,0.00010884462,0.0000699244,0.000045575],"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.00001918241,0.00006329128,0.005918646,0.00006979848,0.000016447395,2.0140735e-7,0.0143058635,0.00958563,0.00079993333,0.47888657,0.002739548,0.48759487],"study_design_scores_gemma":[0.00028138352,0.00007590343,0.01672819,0.000043683078,0.000003816694,0.0000030198541,0.0006557194,0.92652303,0.0013325035,0.0042870096,0.049917795,0.00014794551],"about_ca_topic_score_codex":0.00011734027,"about_ca_topic_score_gemma":0.00007162479,"teacher_disagreement_score":0.96301395,"about_ca_system_score_codex":0.0000551564,"about_ca_system_score_gemma":0.00025392752,"threshold_uncertainty_score":0.8402705},"labels":[],"label_agreement":null},{"id":"W4415879833","doi":"10.1016/j.ins.2025.122866","title":"A high-performance method for handling dual mixed data based on three-way decision","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","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":"University of Regina","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Natural Science Foundation of Fujian Province","keywords":"Dual (grammatical number); Curse of dimensionality; Mixed model; Data set; Fuse (electrical); Data modeling; Representation (politics); Rough set","score_opus":0.0654073141323612,"score_gpt":0.34193381291056724,"score_spread":0.276526498778206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415879833","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007759432,0.000014019019,0.985879,0.0014465243,0.0010995134,0.00025668327,0.000019238674,0.000091506816,0.003434051],"genre_scores_gemma":[0.37438458,0.000003918266,0.6239577,0.0015813025,0.000024233446,0.000019221028,0.000019695319,0.0000010139942,0.000008355895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855965,0.00002652143,0.00037981034,0.00028759806,0.00049883843,0.0002475852],"domain_scores_gemma":[0.99826455,0.00073248125,0.00015056654,0.0006939981,0.000117254196,0.000041151114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026955213,0.00011028859,0.0001373808,0.0003499501,0.0006190573,0.00075519725,0.0018707757,0.000050091927,0.000004853264],"category_scores_gemma":[0.0003603251,0.00007717898,0.000029049084,0.0010527802,0.00007212057,0.0042000646,0.0003422799,0.0000694049,0.0000376524],"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.000020363008,0.000015404219,0.00013976671,0.00001836446,0.0000028248937,1.4585534e-7,0.00010757378,0.050408635,0.000008516753,0.031453088,0.0027384488,0.91508687],"study_design_scores_gemma":[0.00040753276,0.00013603784,0.0026980636,0.000056689965,0.000002878927,8.9112444e-7,0.000030531824,0.97911876,0.00055317616,0.005315193,0.011577572,0.000102674094],"about_ca_topic_score_codex":0.000033597647,"about_ca_topic_score_gemma":0.000018168503,"teacher_disagreement_score":0.9287101,"about_ca_system_score_codex":0.000025084868,"about_ca_system_score_gemma":0.0002132595,"threshold_uncertainty_score":0.72823846},"labels":[],"label_agreement":null},{"id":"W4415984389","doi":"10.1016/j.ins.2025.122872","title":"Prediction of airport runway subsidence using SBAS-InSAR and LSTM networks optimized by EnKF","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Synthetic Aperture Radar (SAR) Applications and Techniques","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":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Sichuan Province Science and Technology Support Program; Natural Science Foundation of Sichuan Province; National Natural Science Foundation of China","keywords":"Runway; Adaptability; Artificial neural network; Synthetic aperture radar; Kalman filter; Process (computing); Data modeling","score_opus":0.012692465472156444,"score_gpt":0.23413569053518887,"score_spread":0.22144322506303243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415984389","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.021321135,0.00017573636,0.96446526,0.0000665821,0.00009194218,0.00016326533,0.000010918128,0.00013664461,0.01356851],"genre_scores_gemma":[0.8754495,0.00014925793,0.12429565,0.0000619751,0.000009012756,0.0000131608285,0.0000061001256,0.0000020085129,0.000013331559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942076,0.0000062384397,0.0002781737,0.00006365026,0.00013828848,0.00009287924],"domain_scores_gemma":[0.9997113,0.00005146693,0.000066295535,0.000099344295,0.00004998928,0.000021602757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031343126,0.00006677414,0.00009294602,0.00012939612,0.000119847915,0.000052093448,0.00011991291,0.00004855465,0.00001712817],"category_scores_gemma":[0.00001946452,0.000058256344,0.000017143811,0.00039547408,0.00014265055,0.0007342944,0.000020835309,0.000049238748,5.8829227e-7],"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.000012412954,0.000029994291,0.010222773,0.00015704546,0.000052815903,1.4354319e-7,0.0010892479,0.039999474,0.0020776002,0.015927529,0.0097449105,0.92068607],"study_design_scores_gemma":[0.00009628427,0.000010251379,0.00086519966,0.00005230977,0.000008929644,0.000002893954,0.00015217665,0.95479596,0.009012659,0.0003869014,0.03455216,0.00006429742],"about_ca_topic_score_codex":0.000044317047,"about_ca_topic_score_gemma":5.943893e-7,"teacher_disagreement_score":0.92062175,"about_ca_system_score_codex":0.000018712111,"about_ca_system_score_gemma":0.000026329406,"threshold_uncertainty_score":0.23756248},"labels":[],"label_agreement":null},{"id":"W4416118636","doi":"10.1016/j.ins.2025.122669","title":"Spatio-frequency texture analysis using wavelet increment entropy: Methodology and application to MRI in multiple sclerosis","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Multiple Sclerosis Research Studies","field":"Medicine","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":"Centre for Addiction and Mental Health","funders":"","keywords":"Wavelet; Pattern recognition (psychology); Wavelet transform; Entropy (arrow of time); Haar wavelet; Discrete wavelet transform; Wavelet packet decomposition","score_opus":0.15281280392941984,"score_gpt":0.39688465739333006,"score_spread":0.24407185346391022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416118636","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.67759424,0.00007455954,0.31594548,0.0042933025,0.00004628529,0.0008777318,0.000014168644,0.000029411833,0.0011248481],"genre_scores_gemma":[0.9292237,0.00014027189,0.06963612,0.0008749969,0.000012866052,0.000083447034,0.000017960834,0.0000013981992,0.000009235269],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99857587,0.00010701943,0.00043993705,0.00020497074,0.00043015953,0.00024206282],"domain_scores_gemma":[0.99912167,0.00029806918,0.0001102657,0.00018021755,0.00021161948,0.000078159545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017361395,0.00009996138,0.00027543306,0.0014498397,0.00024977833,0.00008235526,0.00014019686,0.000054259046,0.000023251401],"category_scores_gemma":[0.0013126448,0.000079693265,0.000042637308,0.0031288008,0.00020373157,0.00053918996,0.00014000868,0.000098299846,0.000010645591],"study_design_candidate":"observational","study_design_consensus":"observational","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.00005455486,0.00004229752,0.8690818,0.00009280011,0.00014852655,1.9707555e-7,0.003913454,0.0049688634,0.025659245,0.0013362283,0.00025755825,0.09444447],"study_design_scores_gemma":[0.00052065746,0.00004867897,0.79035395,0.000051381965,0.000060457278,4.6377212e-7,0.0015575374,0.20474383,0.0015621975,0.0001194751,0.00090662,0.00007475991],"about_ca_topic_score_codex":0.0022824167,"about_ca_topic_score_gemma":0.0010302434,"teacher_disagreement_score":0.25162947,"about_ca_system_score_codex":0.00016773459,"about_ca_system_score_gemma":0.000117638505,"threshold_uncertainty_score":0.34503463},"labels":[],"label_agreement":null}]}