{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015876427,0.0019791601,0.97662246,0.000605874,0.000084073516,0.000029667137,0.00010106059,0.000079531594,0.0046216743],"genre_scores_gemma":[0.66560215,0.0029809638,0.32151878,0.00020578734,0.00029783367,0.00024714932,0.00033465843,0.00008065183,0.00873199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728334,0.0013280545,0.00016679829,0.00027329611,0.00076816685,0.00018032995],"domain_scores_gemma":[0.9958619,0.0025655644,0.0005235927,0.0004309169,0.0004504999,0.00016753169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036323194,0.00093693915,0.002056802,0.0015415546,0.0007781579,0.005318748,0.0020140565,0.0014653829,0.0021655776],"category_scores_gemma":[0.0070970873,0.0006838809,0.0020384048,0.0019994418,0.002285422,0.0050958907,0.0016974784,0.0023314774,0.00046967802],"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.000036072273,0.000028889153,0.00024236088,0.00010787353,0.00006216761,0.00009308473,0.000224194,0.27585503,0.00055774563,0.7126989,0.00063968817,0.009454042],"study_design_scores_gemma":[0.000011628054,0.000024605162,0.00013011527,0.000024017176,0.000022899347,0.000022638953,0.000052147683,0.5194419,0.00021344192,0.47827336,0.0017661727,0.000017007225],"about_ca_topic_score_codex":0.0032069387,"about_ca_topic_score_gemma":0.0022305378,"teacher_disagreement_score":0.005318748,"about_ca_system_score_codex":0.0021789852,"about_ca_system_score_gemma":0.0010076631,"threshold_uncertainty_score":0.019209802},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17822632,0.00054678234,0.8137006,0.00082095887,0.000028618106,0.000031763873,0.00024571415,0.00019278581,0.0062065306],"genre_scores_gemma":[0.73767316,0.0006760185,0.25985378,0.000095595904,0.000050662453,0.00008894387,0.00036529114,0.0001213954,0.0010753011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977416,0.00010091096,0.000013522857,0.00003550621,0.000050816285,0.00002523277],"domain_scores_gemma":[0.9990706,0.00034530176,0.00012457797,0.00024168112,0.0001312363,0.000086684595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011646465,0.00024994428,0.0007432707,0.0015326564,0.0007462313,0.0015195892,0.0011531069,0.0007663439,0.0021333518],"category_scores_gemma":[0.003370176,0.00024976037,0.00088114094,0.0016063994,0.00088225066,0.0024949638,0.0013863544,0.0010960256,0.00022751794],"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.00011395724,0.00005839827,0.002078145,0.000107540414,0.000055282144,0.0000842073,0.000385633,0.20286584,0.0096735805,0.73408836,0.0010391378,0.049450006],"study_design_scores_gemma":[0.000010237801,0.000023498611,0.0005980197,0.000014424208,0.00001947115,0.00002574927,0.00008164767,0.7182139,0.0007903171,0.27897418,0.0012399057,0.000008609377],"about_ca_topic_score_codex":0.0022651292,"about_ca_topic_score_gemma":0.0020492792,"teacher_disagreement_score":0.0022651292,"about_ca_system_score_codex":0.00087382423,"about_ca_system_score_gemma":0.00064707256,"threshold_uncertainty_score":0.0071367025},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029186806,0.017641595,0.8980804,0.0035351808,0.0012797258,0.00006610399,0.00018412583,0.0013425028,0.04868351],"genre_scores_gemma":[0.70054704,0.011010026,0.24956758,0.0009908937,0.0012736281,0.000060077156,0.0004780494,0.00008975321,0.035982963],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996681,0.00004005047,0.000016581875,0.00009466218,0.000153433,0.000027095497],"domain_scores_gemma":[0.9995876,0.00014918642,0.000051682884,0.00010660826,0.00008818182,0.000016759595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003383826,0.00049123674,0.0007483435,0.0010612397,0.00035548743,0.0017751016,0.00069438026,0.0011601145,0.0040493156],"category_scores_gemma":[0.0011866643,0.0002348074,0.0004342526,0.00076090446,0.0010028677,0.0015877564,0.00065332785,0.0007298221,0.0012534925],"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.00014430236,0.00010864017,0.0016353466,0.00037252237,0.000083940846,0.00032097712,0.00011089526,0.039219152,0.024334516,0.24157344,0.011501268,0.68059504],"study_design_scores_gemma":[0.000033634853,0.00020488472,0.0035484578,0.000110129724,0.00010213152,0.0008544618,0.00012688927,0.41125834,0.037711553,0.4312179,0.11477461,0.00005705962],"about_ca_topic_score_codex":0.0006998646,"about_ca_topic_score_gemma":0.0005793938,"teacher_disagreement_score":0.0040493156,"about_ca_system_score_codex":0.00059254165,"about_ca_system_score_gemma":0.00045244436,"threshold_uncertainty_score":0.013546288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003208825,0.000096142176,0.9961898,0.00002956507,0.000019330442,0.000017338178,0.000017643773,0.00008017657,0.000341193],"genre_scores_gemma":[0.10816609,0.0004071509,0.8883598,0.000045987123,0.000057244888,0.000066658715,0.000106373634,0.000047162608,0.0027435469],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996437,0.000052158226,0.000028583918,0.00010463154,0.00015478072,0.000016117894],"domain_scores_gemma":[0.9996917,0.00012709938,0.000028483299,0.00003248666,0.000106110456,0.000014181156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005660726,0.00039452975,0.0007147306,0.0006437752,0.000352511,0.0005404874,0.00067168067,0.0004940357,0.0022536898],"category_scores_gemma":[0.0010920911,0.00025418718,0.00070553564,0.00082702725,0.0003799492,0.0010199186,0.00049147935,0.0008639124,0.000384215],"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.0002504005,0.00008262523,0.00071538135,0.0003415474,0.00009232801,0.0002092809,0.00025394285,0.10935037,0.082767986,0.08489258,0.0028932055,0.71815026],"study_design_scores_gemma":[0.000019119167,0.00007567361,0.00035345223,0.000010279519,0.000042573713,0.00020262203,0.000017842127,0.9770832,0.014081029,0.0047675865,0.0033190595,0.00002762415],"about_ca_topic_score_codex":0.0022214856,"about_ca_topic_score_gemma":0.0019161444,"teacher_disagreement_score":0.0022536898,"about_ca_system_score_codex":0.00028480726,"about_ca_system_score_gemma":0.00057949906,"threshold_uncertainty_score":0.007539332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008320126,0.3014306,0.6169888,0.008391762,0.008042872,0.00012621908,0.00092375773,0.001758062,0.054017853],"genre_scores_gemma":[0.46459463,0.18768206,0.27005172,0.002969793,0.007969285,0.00026921564,0.0019820458,0.0003347112,0.06414666],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967444,0.000045358145,0.000021756767,0.000072795025,0.000144751,0.000040855728],"domain_scores_gemma":[0.9995975,0.00020823545,0.00004283752,0.000070032875,0.000059198315,0.00002220174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884179,0.00069181476,0.0009105977,0.001290906,0.00025189284,0.0013656301,0.000864764,0.001627181,0.0062487815],"category_scores_gemma":[0.0014301778,0.00038861512,0.00052272883,0.0017367087,0.0014464607,0.0021481335,0.001034757,0.0013858369,0.0025032144],"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.00014623575,0.00010554675,0.00073268585,0.0015517543,0.00008944533,0.00013889071,0.00011003644,0.017908169,0.004144688,0.11442695,0.13371365,0.7269318],"study_design_scores_gemma":[0.000045273984,0.00020013803,0.002646587,0.00056477025,0.00013480117,0.00121102,0.00012759103,0.11482925,0.026913261,0.3713848,0.48187482,0.00006774978],"about_ca_topic_score_codex":0.00069540774,"about_ca_topic_score_gemma":0.000782127,"teacher_disagreement_score":0.0062487815,"about_ca_system_score_codex":0.0005759548,"about_ca_system_score_gemma":0.00036082888,"threshold_uncertainty_score":0.020904243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027481965,0.000109760564,0.9953296,0.00013661695,0.000025619722,0.000054860164,0.000025671427,0.00066679803,0.0009029075],"genre_scores_gemma":[0.25049147,0.00052700314,0.7449165,0.00028522193,0.00004687048,0.00041952307,0.00020091461,0.0004229352,0.0026895131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99293035,0.0034413312,0.00042089022,0.00051469106,0.002386107,0.00030664922],"domain_scores_gemma":[0.9880377,0.008304097,0.00047675986,0.0022570866,0.00084939686,0.00007492802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006777778,0.0008443889,0.0010376968,0.001113837,0.0006942804,0.0023617696,0.0021169502,0.0015231386,0.003669466],"category_scores_gemma":[0.021330446,0.0013113131,0.0020639237,0.00083774026,0.00242118,0.0037525282,0.0019276564,0.002518465,0.0008441447],"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.0002436113,0.0001995518,0.0013640447,0.00091265247,0.00017746734,0.0003408023,0.00032900638,0.24761519,0.009413229,0.5380798,0.0027860939,0.19853853],"study_design_scores_gemma":[0.000096241805,0.00008558575,0.00015601725,0.00016702584,0.00009783945,0.00012921584,0.000039149985,0.6644185,0.016850313,0.31056955,0.0073582367,0.000032295553],"about_ca_topic_score_codex":0.0032113164,"about_ca_topic_score_gemma":0.0025210872,"teacher_disagreement_score":0.006777778,"about_ca_system_score_codex":0.0014020797,"about_ca_system_score_gemma":0.002960694,"threshold_uncertainty_score":0.035844743},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46682742,0.0018909603,0.37862977,0.0016717745,0.00040959576,0.000106386644,0.00076967996,0.0004353312,0.14925902],"genre_scores_gemma":[0.9642577,0.0008549968,0.026164131,0.0001965853,0.0002457096,0.000049847957,0.0002680279,0.000078965335,0.007883943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985147,0.000029020455,0.000009520192,0.000030697636,0.00005183332,0.00002742371],"domain_scores_gemma":[0.9994105,0.00018578634,0.00012076039,0.00006900796,0.000117764364,0.000096238095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002946912,0.00024634838,0.00028522083,0.0012728731,0.00062885444,0.0014266919,0.00056189473,0.00056020194,0.0056510433],"category_scores_gemma":[0.0016611913,0.0002481267,0.00035511618,0.0009258329,0.0008949814,0.0020215886,0.00054464734,0.00073232775,0.00037306832],"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.00005470872,0.00002315214,0.0004858593,0.00009266891,0.000012698467,0.00026128907,0.00018464352,0.010120496,0.008242796,0.9618654,0.0024913067,0.01616492],"study_design_scores_gemma":[0.000023068094,0.0000610528,0.0010110681,0.000022770942,0.000019982306,0.0005239145,0.00021417196,0.11829552,0.0022212327,0.8704847,0.007097168,0.000025311823],"about_ca_topic_score_codex":0.00069785316,"about_ca_topic_score_gemma":0.0007386277,"teacher_disagreement_score":0.0056510433,"about_ca_system_score_codex":0.0005011255,"about_ca_system_score_gemma":0.00023810337,"threshold_uncertainty_score":0.018904686},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09427846,0.0006501661,0.8649419,0.00042047392,0.00019941213,0.00019111368,0.00028086558,0.0005539981,0.038483646],"genre_scores_gemma":[0.5018986,0.00068592787,0.4848027,0.00020942694,0.00011385585,0.00020332959,0.00034803874,0.00015264611,0.011585478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995016,0.00010918573,0.000040096762,0.00008995869,0.00017133234,0.00008782486],"domain_scores_gemma":[0.9994413,0.00014358283,0.00007981122,0.0001948769,0.00007141743,0.00006903175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071111415,0.0007053663,0.0006145622,0.0009779433,0.0008304735,0.0010830082,0.00081278355,0.0009623317,0.0037783307],"category_scores_gemma":[0.0013663762,0.00057212956,0.000547317,0.0011588692,0.00094587356,0.00093744637,0.0013518964,0.0009813593,0.0010263538],"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.00028875557,0.00008373059,0.00071004295,0.00028326345,0.00002907358,0.00043356974,0.0002445463,0.017785152,0.07999642,0.8406161,0.0014869809,0.058042344],"study_design_scores_gemma":[0.00018905062,0.0004839744,0.0014883972,0.0002704795,0.000113062204,0.0023633044,0.00012161472,0.27798724,0.13444515,0.5289315,0.053391825,0.00021445913],"about_ca_topic_score_codex":0.0002510661,"about_ca_topic_score_gemma":0.0005273201,"teacher_disagreement_score":0.0037783307,"about_ca_system_score_codex":0.0007267479,"about_ca_system_score_gemma":0.0009802342,"threshold_uncertainty_score":0.012639821},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008413839,0.00010936286,0.99538827,0.000068043475,0.000047272068,0.000015022581,0.000016835407,0.00003985714,0.00347386],"genre_scores_gemma":[0.24636209,0.0011968343,0.72933954,0.0003019577,0.00038555532,0.0004944683,0.00022801694,0.00014276463,0.021548698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994985,0.0001537803,0.00002564406,0.00007067659,0.00023142691,0.000019981673],"domain_scores_gemma":[0.99961793,0.00013474052,0.000035706908,0.00005205193,0.00014289642,0.000016652226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006238614,0.0010450438,0.0010057881,0.0009460985,0.0006427566,0.0016127364,0.0015732364,0.0012279405,0.0045184623],"category_scores_gemma":[0.001667707,0.00049474847,0.0012428287,0.0005888374,0.0005819524,0.0013042166,0.0013017879,0.0016624707,0.0011614708],"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.00009557879,0.00013834987,0.00089476013,0.00046938733,0.0002121987,0.00035078262,0.00033217037,0.3486281,0.015372174,0.45795494,0.004521361,0.17103033],"study_design_scores_gemma":[0.000010176109,0.000067189554,0.00011447043,0.000030637042,0.000035113855,0.00010296175,0.000016026543,0.9344374,0.0012918116,0.055522796,0.008352224,0.000019285813],"about_ca_topic_score_codex":0.001332659,"about_ca_topic_score_gemma":0.0019913483,"teacher_disagreement_score":0.0045184623,"about_ca_system_score_codex":0.000526652,"about_ca_system_score_gemma":0.00078958075,"threshold_uncertainty_score":0.015115738},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015887173,0.0011290251,0.98041064,0.00016985042,0.00007250193,0.000014130012,0.000040536535,0.00015860375,0.0021175905],"genre_scores_gemma":[0.5474228,0.0031196815,0.44522342,0.00009732767,0.00039840705,0.000046370194,0.00015952399,0.0001253961,0.0034070606],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968755,0.00014197627,0.000021016065,0.000039458148,0.000090306305,0.000019678611],"domain_scores_gemma":[0.9990006,0.0007297136,0.000039136794,0.000103609695,0.00009816148,0.000028806791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096575404,0.0003332918,0.00033023834,0.00075211836,0.00019120218,0.00076597737,0.00040443483,0.00040219352,0.0014048076],"category_scores_gemma":[0.0033284745,0.00012724331,0.00033561382,0.0007954122,0.00084746315,0.0011681804,0.00046402702,0.0005004959,0.00041350527],"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.00028787393,0.00008881405,0.0018356452,0.0003718639,0.00013664148,0.00033788013,0.0004051686,0.042658348,0.10766161,0.16246338,0.0019286425,0.6818241],"study_design_scores_gemma":[0.00004048851,0.00036975928,0.0068934327,0.00006222799,0.000060525766,0.0014963159,0.00018721125,0.66072214,0.027308134,0.28578568,0.016976062,0.000098066],"about_ca_topic_score_codex":0.00039434608,"about_ca_topic_score_gemma":0.0002231262,"teacher_disagreement_score":0.0014048076,"about_ca_system_score_codex":0.00015007162,"about_ca_system_score_gemma":0.00029247414,"threshold_uncertainty_score":0.0051074624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9967237,0.00024455466,0.00009277628,0.0005311569,0.00003893414,0.0000031486813,0.00018882677,0.0000055806463,0.0021713413],"genre_scores_gemma":[0.99906665,0.00013194217,0.000022222097,0.000057205034,0.00006524104,0.0000013151817,0.000094126095,0.0000032620144,0.0005579564],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996061,0.00015803675,0.000029986088,0.000056151897,0.000046540288,0.000103085884],"domain_scores_gemma":[0.96999085,0.023121377,0.0037010435,0.0006123576,0.00065344217,0.0019209011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013527252,0.00023289969,0.00041216364,0.00066425133,0.00038313106,0.0027539493,0.00026538258,0.001275664,0.006922649],"category_scores_gemma":[0.018104801,0.00027572538,0.00041475715,0.00056272413,0.00055532536,0.00097556144,0.00059047935,0.0012451279,0.0006738324],"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.008087134,0.0018204607,0.94657755,0.000115440904,0.0007906442,0.0009341772,0.00056332,0.005188221,0.005469834,0.0029671462,0.0028071997,0.024678864],"study_design_scores_gemma":[0.00014167538,0.0004449256,0.98910195,0.000015477362,0.00029963604,0.000099785524,0.00050663576,0.00642569,0.0005355743,0.0018314333,0.0005727919,0.000024433188],"about_ca_topic_score_codex":0.004101117,"about_ca_topic_score_gemma":0.004983355,"teacher_disagreement_score":0.006922649,"about_ca_system_score_codex":0.00051163376,"about_ca_system_score_gemma":0.000252086,"threshold_uncertainty_score":0.02315861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048823603,0.0003129625,0.98915535,0.0003682848,0.00026782893,0.00012657956,0.00021635361,0.00096665847,0.0037035493],"genre_scores_gemma":[0.055536482,0.00024506927,0.93425894,0.0004092499,0.00025405452,0.00021444703,0.00081855594,0.00024384393,0.008019363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751663,0.00053651765,0.00016974767,0.0007137571,0.0009229061,0.00014055033],"domain_scores_gemma":[0.9971698,0.0006114518,0.00014728415,0.0008384091,0.0010273252,0.00020572843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002364921,0.0008225071,0.0016720506,0.0031971494,0.0027992227,0.0032349022,0.0043312614,0.0029162783,0.008636435],"category_scores_gemma":[0.0077327164,0.00061362213,0.0009972502,0.003963693,0.0013721995,0.003723201,0.0032280106,0.002585558,0.004586506],"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.0005256451,0.0002743099,0.0013170178,0.00024987423,0.00013173274,0.00009165914,0.00018236577,0.06678295,0.008830116,0.14045267,0.02585397,0.7553077],"study_design_scores_gemma":[0.00015574344,0.00011174363,0.00052181154,0.000051314673,0.000050229235,0.00027842543,0.00006398199,0.86583334,0.005109157,0.10479344,0.02296761,0.0000632525],"about_ca_topic_score_codex":0.003334033,"about_ca_topic_score_gemma":0.0048242174,"teacher_disagreement_score":0.008636435,"about_ca_system_score_codex":0.0014728844,"about_ca_system_score_gemma":0.002952846,"threshold_uncertainty_score":0.028891802},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07378752,0.00025877744,0.91016424,0.0011080906,0.000035235484,0.00040250685,0.0000773496,0.00034282374,0.013823414],"genre_scores_gemma":[0.6337659,0.00019750907,0.3644136,0.00006997287,0.0000266235,0.00023549366,0.000070760834,0.00005152764,0.0011686662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926611,0.0045494465,0.0003430196,0.00044213643,0.0015733506,0.00043080404],"domain_scores_gemma":[0.9802742,0.014419564,0.0019322595,0.0011662216,0.0013142421,0.0008935209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011435533,0.0010928181,0.0013751581,0.0037533983,0.0017569446,0.0067059305,0.0027939274,0.00196543,0.0064559155],"category_scores_gemma":[0.027425146,0.0007298517,0.0013230079,0.0022296084,0.0012187383,0.0099636065,0.00553904,0.0021172513,0.0004675836],"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.0006937543,0.0011234495,0.0072363107,0.00054235413,0.0003382388,0.00052054133,0.003738352,0.38968664,0.007445077,0.23736854,0.0029459693,0.34836078],"study_design_scores_gemma":[0.00004112385,0.00010434498,0.00078559155,0.00008005742,0.00006569474,0.0001071018,0.0010667389,0.8870361,0.0017357012,0.10649133,0.0024356518,0.00005057592],"about_ca_topic_score_codex":0.0024876595,"about_ca_topic_score_gemma":0.0041496255,"teacher_disagreement_score":0.011435533,"about_ca_system_score_codex":0.0020825784,"about_ca_system_score_gemma":0.004379207,"threshold_uncertainty_score":0.060477614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003053371,0.01133555,0.93533194,0.01589009,0.009720245,0.0000571951,0.00013036956,0.00088145735,0.023599783],"genre_scores_gemma":[0.22595273,0.021336136,0.6692612,0.0077341455,0.025772404,0.0002223835,0.00024632024,0.0011894872,0.048285224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982855,0.0005909714,0.00011525751,0.00028943422,0.0006112947,0.000107458975],"domain_scores_gemma":[0.99278176,0.0049823006,0.00015703014,0.0011586758,0.0006741334,0.00024607318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033739095,0.001331953,0.0014987811,0.0005971077,0.00078585424,0.0019964096,0.002673741,0.0018791335,0.006807106],"category_scores_gemma":[0.012775138,0.00044049017,0.0012485047,0.0011341237,0.0022166902,0.005169928,0.0018448567,0.0077113495,0.0018539857],"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.0006075343,0.00029908353,0.00040206476,0.0004982185,0.00015583665,0.00023123222,0.00009783008,0.1647861,0.0058056405,0.52325344,0.061195523,0.24266742],"study_design_scores_gemma":[0.000053031647,0.00017976391,0.00035890416,0.00009607883,0.00006431183,0.00013213158,0.000020984955,0.5075361,0.004847021,0.4219168,0.06470935,0.00008548558],"about_ca_topic_score_codex":0.0030561222,"about_ca_topic_score_gemma":0.0033719684,"teacher_disagreement_score":0.006807106,"about_ca_system_score_codex":0.0014021938,"about_ca_system_score_gemma":0.001225421,"threshold_uncertainty_score":0.022772074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0149208335,0.00014743519,0.96469694,0.00032098498,0.00012123212,0.00031416563,0.0022972547,0.0100969365,0.0070842328],"genre_scores_gemma":[0.11259694,0.00012512237,0.87076294,0.0003717808,0.00011612191,0.00071312813,0.007494273,0.00084812957,0.006971495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998919,0.0002107998,0.00006253674,0.00020939924,0.0004971688,0.00010108827],"domain_scores_gemma":[0.9966407,0.0020612867,0.000093734525,0.00033542502,0.00076427794,0.00010457311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018626623,0.0011520891,0.0011149463,0.003596855,0.0011271535,0.0011931033,0.0032470746,0.0012874784,0.02010374],"category_scores_gemma":[0.008301367,0.0005232969,0.0010837322,0.0022867739,0.00071706116,0.0014579298,0.0024301624,0.0019901462,0.0036416224],"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.0005285636,0.0004340519,0.005317377,0.00056099985,0.00016554966,0.00046282684,0.00015491364,0.054554425,0.005096053,0.021451967,0.06041208,0.8508612],"study_design_scores_gemma":[0.00012843305,0.00011205838,0.0008894232,0.00006797656,0.000059279693,0.00020165333,0.00007300433,0.941636,0.011236803,0.028763553,0.016806033,0.000025746744],"about_ca_topic_score_codex":0.0034350127,"about_ca_topic_score_gemma":0.0070724026,"teacher_disagreement_score":0.02010374,"about_ca_system_score_codex":0.00084491534,"about_ca_system_score_gemma":0.002068986,"threshold_uncertainty_score":0.06725377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11241625,0.003027945,0.8765178,0.00081466854,0.00009022384,0.000034749708,0.00006497062,0.00017880548,0.0068546156],"genre_scores_gemma":[0.9695341,0.0014325222,0.02488971,0.000057511606,0.00011209772,0.000044626147,0.00007070899,0.00006494646,0.0037937723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996381,0.00013819824,0.000012518619,0.000037548212,0.00012431966,0.000049353603],"domain_scores_gemma":[0.9989452,0.0005942293,0.00012730797,0.00008562914,0.00022546506,0.000022263386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088779186,0.00036656385,0.0004136689,0.000993201,0.00038307332,0.0006450385,0.0006261273,0.00047118982,0.0013019547],"category_scores_gemma":[0.0037708373,0.0002431058,0.00043219107,0.0007394066,0.00076880486,0.0010196,0.00041534664,0.000592149,0.00015289745],"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.00008467732,0.000020367881,0.0009096025,0.00011763459,0.00003493376,0.000091108916,0.000083028826,0.89619553,0.004649478,0.07976482,0.0008020939,0.017246693],"study_design_scores_gemma":[0.0000024558408,0.000012460519,0.00026976588,0.000006254092,0.000007249438,0.000020273465,0.0000177622,0.9603695,0.0008367081,0.03815129,0.00030264078,0.0000036372558],"about_ca_topic_score_codex":0.002830452,"about_ca_topic_score_gemma":0.00168594,"teacher_disagreement_score":0.002830452,"about_ca_system_score_codex":0.00089434854,"about_ca_system_score_gemma":0.00059190096,"threshold_uncertainty_score":0.0064890385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29418343,0.001667847,0.6942932,0.0011955826,0.00013005215,0.00011727895,0.0006020172,0.00021249073,0.007598056],"genre_scores_gemma":[0.8724718,0.0004945227,0.12445862,0.00010364474,0.00007890893,0.00011479234,0.00058241794,0.00005596069,0.0016392366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99326587,0.0027084337,0.00058577675,0.00077198044,0.0022473733,0.00042056793],"domain_scores_gemma":[0.9871838,0.008552782,0.0013337341,0.0014313526,0.0012130963,0.0002853189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063777724,0.0005819205,0.0020233758,0.0031182247,0.0013684402,0.0062718815,0.0017970213,0.0013551216,0.0017498969],"category_scores_gemma":[0.026558649,0.0010182657,0.0021171304,0.003088178,0.0023603218,0.0063325875,0.0019613395,0.0026350904,0.00021004766],"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.0003406808,0.00008616841,0.0034412104,0.00020602043,0.0002365426,0.00046759658,0.0009853762,0.1666813,0.0006815673,0.79519975,0.0013078325,0.030365955],"study_design_scores_gemma":[0.000033728647,0.000044199613,0.0005916204,0.000049104106,0.00010528051,0.00017413532,0.00015402661,0.2760671,0.0005260616,0.72122294,0.0009914332,0.000040424304],"about_ca_topic_score_codex":0.0032740328,"about_ca_topic_score_gemma":0.0018319505,"teacher_disagreement_score":0.0063777724,"about_ca_system_score_codex":0.001856838,"about_ca_system_score_gemma":0.0018145423,"threshold_uncertainty_score":0.033729255},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005062721,0.00015293797,0.991491,0.00010183882,0.0000709517,0.00006580698,0.00005062311,0.0017256611,0.0012785455],"genre_scores_gemma":[0.12528603,0.00020567134,0.8705369,0.00016651579,0.00006308923,0.00012369211,0.00022003366,0.0003799046,0.00301812],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986811,0.00041506716,0.00012470793,0.00022870717,0.0004104792,0.0001398043],"domain_scores_gemma":[0.99838245,0.00056857336,0.00012916897,0.00059292454,0.00023790843,0.00008898217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023409775,0.0009140875,0.0017584212,0.0016301917,0.0010053272,0.0033420697,0.002119621,0.0017251964,0.006611709],"category_scores_gemma":[0.0053587807,0.00059862284,0.0013609831,0.001646139,0.0012710879,0.0039195046,0.0041163554,0.0019281253,0.002254831],"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.00093920314,0.00018509445,0.0006669297,0.00040691296,0.00016903777,0.00043390205,0.0006681144,0.10479089,0.022357954,0.16027683,0.009394675,0.6997104],"study_design_scores_gemma":[0.00012791969,0.00015710281,0.00023889591,0.00008348594,0.000095275405,0.00025645093,0.00013648222,0.84950906,0.019967841,0.112047076,0.017307032,0.000073371426],"about_ca_topic_score_codex":0.0015457305,"about_ca_topic_score_gemma":0.0014293274,"teacher_disagreement_score":0.006611709,"about_ca_system_score_codex":0.00059393456,"about_ca_system_score_gemma":0.0010091037,"threshold_uncertainty_score":0.02211833},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18873054,0.0052498477,0.7346755,0.003651333,0.006779814,0.0012481342,0.008116968,0.02015158,0.031396344],"genre_scores_gemma":[0.13165064,0.0013108776,0.8224975,0.0009515088,0.00087292964,0.00023597316,0.008185465,0.0027016916,0.031593494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986506,0.0001763561,0.00024079012,0.00019264936,0.00055011566,0.0001894997],"domain_scores_gemma":[0.99302906,0.001686921,0.00031645127,0.0030942021,0.0016515274,0.0002218886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006994642,0.0015361923,0.0014083366,0.0036478823,0.0013546209,0.0031998053,0.001299883,0.00081744307,0.028816983],"category_scores_gemma":[0.0072274855,0.00058898196,0.0009119213,0.007089997,0.0008394716,0.0037108122,0.0013171692,0.0017311672,0.009513365],"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.0010310068,0.00043067956,0.001379704,0.0004690512,0.00009070709,0.00045950542,0.00027959942,0.0054461355,0.09906585,0.018140351,0.048654,0.8245535],"study_design_scores_gemma":[0.00046058086,0.0012411945,0.0042646863,0.00036333626,0.00038119275,0.00230461,0.001255268,0.13094947,0.4782349,0.09274049,0.287547,0.00025731616],"about_ca_topic_score_codex":0.003059602,"about_ca_topic_score_gemma":0.007322508,"teacher_disagreement_score":0.028816983,"about_ca_system_score_codex":0.0006743171,"about_ca_system_score_gemma":0.0021398694,"threshold_uncertainty_score":0.09640235},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012218671,0.00007918454,0.9863007,0.00008142635,0.000026271902,0.000076136654,0.000029796947,0.000097041135,0.0010907627],"genre_scores_gemma":[0.4409945,0.00016579316,0.55489504,0.00007599103,0.0000509863,0.0005703645,0.0001672829,0.00007832351,0.0030017484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954549,0.0017909106,0.000375645,0.00079982687,0.001271081,0.00030761072],"domain_scores_gemma":[0.9959239,0.002486587,0.0002449653,0.00020159004,0.00097616494,0.0001668571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053557665,0.0014045321,0.0024642607,0.002819293,0.0017879434,0.0028635443,0.0023560757,0.0021006134,0.0035591996],"category_scores_gemma":[0.0075720507,0.0009779442,0.0022115777,0.0027923444,0.0013717271,0.004313287,0.0027168102,0.0017627749,0.0003249203],"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.00097452494,0.00028963617,0.0020311736,0.0009689932,0.00041852743,0.00040247623,0.001346306,0.65045494,0.012302745,0.10186274,0.0022418874,0.22670604],"study_design_scores_gemma":[0.000035306726,0.00007850311,0.00019400303,0.000028743149,0.000085340056,0.00002336835,0.000053712334,0.97669286,0.0018998018,0.020391071,0.00048635012,0.000030896597],"about_ca_topic_score_codex":0.0038259046,"about_ca_topic_score_gemma":0.003284734,"teacher_disagreement_score":0.0053557665,"about_ca_system_score_codex":0.0020235837,"about_ca_system_score_gemma":0.0028591023,"threshold_uncertainty_score":0.028324306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04211122,0.025764462,0.6820575,0.010656427,0.0010296986,0.00009416189,0.0007096885,0.00030277038,0.23727411],"genre_scores_gemma":[0.76298046,0.01798819,0.16675617,0.0018574065,0.00241149,0.00037637528,0.00088512205,0.00013238288,0.046612483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797684,0.0006907402,0.000113062706,0.0004091064,0.0006963722,0.00011403404],"domain_scores_gemma":[0.9966132,0.0021402084,0.00020416103,0.0004302583,0.00043477037,0.00017733724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022170118,0.00060622185,0.0014053255,0.0027309123,0.0026253648,0.005655158,0.001365827,0.0019377706,0.0077384706],"category_scores_gemma":[0.008527487,0.00062942406,0.0011361003,0.002987768,0.0050287,0.0085148495,0.0031861675,0.003959302,0.0012704724],"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.0000032756882,0.000004071776,0.0000346937,0.000022670034,0.000004735331,0.000008151971,0.00006684778,0.00049403124,0.000041717252,0.9953987,0.00057110476,0.0033499794],"study_design_scores_gemma":[0.0000023891193,0.0000029357118,0.00003364907,0.000009915978,0.0000031018803,0.000014675803,0.00002415688,0.0012840235,0.000024445924,0.9942281,0.0043699117,0.0000025327097],"about_ca_topic_score_codex":0.001646701,"about_ca_topic_score_gemma":0.0009365876,"teacher_disagreement_score":0.0077384706,"about_ca_system_score_codex":0.0024019,"about_ca_system_score_gemma":0.0011707057,"threshold_uncertainty_score":0.025887787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7466546,0.0010676525,0.23753826,0.002501894,0.00029158377,0.000030270134,0.0000682948,0.00024852878,0.011598928],"genre_scores_gemma":[0.9554777,0.00055224745,0.041374035,0.00021804766,0.00002692741,0.000045700002,0.000045437686,0.000042389678,0.0022175754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983895,0.00008117809,0.000006171779,0.000027441576,0.000031142776,0.000015067175],"domain_scores_gemma":[0.99889827,0.0008780162,0.000060470724,0.00009115537,0.000041897594,0.000030079322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068312435,0.00020360666,0.00037629512,0.00016480045,0.0003586496,0.00064627937,0.00068184105,0.0012906779,0.00090876414],"category_scores_gemma":[0.0033766571,0.00023287925,0.00032669917,0.00023164599,0.0010406143,0.0010041107,0.0004057708,0.0008108523,0.00012520087],"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.00026155912,0.00017493773,0.0029603038,0.00018049603,0.00016322015,0.0006135618,0.00028827396,0.5958012,0.02796436,0.335825,0.0026938685,0.033073224],"study_design_scores_gemma":[0.00011956482,0.00010449217,0.0003034551,0.000010606932,0.00003097269,0.00015726003,0.00006514112,0.881874,0.005445226,0.10996783,0.0019023451,0.00001903833],"about_ca_topic_score_codex":0.0006283473,"about_ca_topic_score_gemma":0.0006463912,"teacher_disagreement_score":0.0012906779,"about_ca_system_score_codex":0.00029265627,"about_ca_system_score_gemma":0.00038146952,"threshold_uncertainty_score":0.0036127567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0657842,0.00073362584,0.9176961,0.0007203714,0.00029533825,0.000051422336,0.00010152302,0.00020918706,0.014408205],"genre_scores_gemma":[0.8055805,0.0008110184,0.18519638,0.0002791137,0.00043891196,0.00009476173,0.0001704851,0.00004596103,0.007382934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987336,0.00031285023,0.00010687107,0.00019176073,0.0005516979,0.00010316381],"domain_scores_gemma":[0.99832624,0.0007145412,0.00018199995,0.00016686718,0.00046179563,0.00014864349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018336393,0.0003816023,0.0006784743,0.0012793794,0.0007916945,0.001953071,0.0007390907,0.0006668838,0.0026281308],"category_scores_gemma":[0.0038856277,0.00022481555,0.0010328405,0.00090460066,0.0014761476,0.004152182,0.001318575,0.0015372795,0.0003249144],"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.000101472244,0.000041790056,0.00028101116,0.00009095827,0.000037076232,0.00018995117,0.00024399984,0.0056198346,0.005520424,0.9627177,0.001029289,0.024126519],"study_design_scores_gemma":[0.000027807639,0.00010500259,0.0003812329,0.000019922332,0.000050010185,0.0002999132,0.00007473052,0.09129712,0.0027394085,0.9009127,0.0040494734,0.00004262291],"about_ca_topic_score_codex":0.0003310554,"about_ca_topic_score_gemma":0.00027372374,"teacher_disagreement_score":0.0026281308,"about_ca_system_score_codex":0.0005820323,"about_ca_system_score_gemma":0.00069083506,"threshold_uncertainty_score":0.009697318},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002285517,0.00004974831,0.99713457,0.000016658194,0.000011458261,0.000007690629,0.000011342364,0.0001191269,0.0003639076],"genre_scores_gemma":[0.27485827,0.00022778875,0.7219164,0.000046470428,0.000054116692,0.00020832955,0.000118805336,0.00017151634,0.0023981961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998604,0.000036108046,0.0000063343405,0.000026834245,0.000057765465,0.0000125135],"domain_scores_gemma":[0.9996226,0.00020979988,0.000039942457,0.000026000918,0.00008196066,0.000019655894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040569543,0.00046820755,0.0005811623,0.000494209,0.00040487672,0.0003379032,0.0009578541,0.0006770377,0.0022623073],"category_scores_gemma":[0.0010854205,0.0002654618,0.0004898541,0.0005912982,0.00042269903,0.0006110586,0.00052122696,0.0007063221,0.00036023374],"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.00019444087,0.00005972343,0.0004939717,0.00020706275,0.00005484127,0.00008236851,0.0001313921,0.74061966,0.014364447,0.028567988,0.0021919725,0.21303216],"study_design_scores_gemma":[0.0000028591855,0.0000144254855,0.00005232845,0.0000022556196,0.000003048944,0.000009721123,0.0000027198473,0.9976215,0.0005614931,0.0013226882,0.0004034304,0.0000036156766],"about_ca_topic_score_codex":0.0030994818,"about_ca_topic_score_gemma":0.0029491577,"teacher_disagreement_score":0.0030994818,"about_ca_system_score_codex":0.00046557083,"about_ca_system_score_gemma":0.0007874689,"threshold_uncertainty_score":0.007568121},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054313242,0.00051553256,0.93964255,0.00030585175,0.00007264678,0.00002927457,0.00016296947,0.00008581927,0.004872158],"genre_scores_gemma":[0.70633304,0.0005518121,0.29016286,0.000063668645,0.000056668527,0.000075000105,0.00028485653,0.000025432568,0.002446736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730694,0.0009908228,0.00022129383,0.00030130448,0.00094994024,0.00022977585],"domain_scores_gemma":[0.9961189,0.0021075336,0.00042511744,0.00050708174,0.0005897074,0.00025171478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031961268,0.0006162634,0.0012305628,0.0018352992,0.00076683774,0.0045408322,0.0013804092,0.0010195494,0.0024879125],"category_scores_gemma":[0.009877155,0.00040255758,0.0017599151,0.0018949964,0.002164804,0.0034592408,0.001698052,0.001783955,0.0003460904],"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.00021885178,0.00003912676,0.00088229665,0.0001224628,0.00008020866,0.00011994559,0.00058867945,0.1468015,0.0015532271,0.8164165,0.00075806206,0.03241915],"study_design_scores_gemma":[0.000023110852,0.000048454225,0.00028107644,0.00004638042,0.000038846498,0.00007864545,0.00016475277,0.49267504,0.0009843638,0.5033732,0.0022534812,0.000032696997],"about_ca_topic_score_codex":0.003008359,"about_ca_topic_score_gemma":0.0020752007,"teacher_disagreement_score":0.0045408322,"about_ca_system_score_codex":0.0021094428,"about_ca_system_score_gemma":0.0009818044,"threshold_uncertainty_score":0.016902924},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.578396,0.00088161085,0.41617346,0.00024747124,0.000059916434,0.00008133262,0.0010436302,0.00025231222,0.00286424],"genre_scores_gemma":[0.95925397,0.00022924518,0.03923361,0.000019742172,0.00005845732,0.000042973206,0.00059170043,0.00001968795,0.0005507733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994012,0.0001571442,0.00004347081,0.00016243599,0.00015979935,0.00007590783],"domain_scores_gemma":[0.9961904,0.0024467863,0.0005244217,0.00029908787,0.00040562873,0.0001335712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014895848,0.0003387554,0.0007145607,0.0023202787,0.0003928188,0.0012595179,0.0013413369,0.0004306753,0.0021577668],"category_scores_gemma":[0.0069399728,0.00015901952,0.00077130797,0.0031666637,0.00037179867,0.0015717706,0.0005909427,0.0005805278,0.0001592239],"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.0025759272,0.0005975437,0.16609731,0.0006837779,0.000890217,0.0006865091,0.0017510523,0.31747591,0.011136193,0.06366348,0.003979473,0.43046263],"study_design_scores_gemma":[0.00003166041,0.00016894825,0.03448406,0.000027131277,0.00016704285,0.00023893669,0.0005816637,0.93266064,0.0019476567,0.028128048,0.0015240002,0.00004028924],"about_ca_topic_score_codex":0.003743455,"about_ca_topic_score_gemma":0.0025579322,"teacher_disagreement_score":0.003743455,"about_ca_system_score_codex":0.0007079965,"about_ca_system_score_gemma":0.00049480906,"threshold_uncertainty_score":0.007877767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031332746,0.00020468958,0.9657426,0.00010685594,0.000041661344,0.00006710748,0.000047682133,0.00010165904,0.0023550675],"genre_scores_gemma":[0.4956119,0.00019520994,0.5002289,0.000071060036,0.00004789938,0.00023494325,0.00012255671,0.00006827791,0.0034192242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992987,0.00030456122,0.000026563604,0.00010379531,0.0001553111,0.00011103121],"domain_scores_gemma":[0.99718827,0.0022688655,0.00014115572,0.00009160028,0.00018841514,0.000121732584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013078345,0.0009895576,0.0015711586,0.0013322243,0.00075423456,0.0015699151,0.0022604181,0.0021635413,0.0026932328],"category_scores_gemma":[0.005824983,0.0011381063,0.0012190847,0.0015161047,0.0009408641,0.0019261295,0.0021152424,0.0012007939,0.00027250202],"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.00009085392,0.00005390355,0.0002663849,0.0000730598,0.000036223795,0.000061621045,0.000040850162,0.9702354,0.00066500163,0.01576383,0.0004460848,0.0122667765],"study_design_scores_gemma":[0.000024448043,0.00002554231,0.000032339965,0.0000047460594,0.0000089209125,0.000013619122,0.0000132954665,0.9932528,0.00019497675,0.0061490634,0.00027462767,0.0000056997756],"about_ca_topic_score_codex":0.009010954,"about_ca_topic_score_gemma":0.008283474,"teacher_disagreement_score":0.009010954,"about_ca_system_score_codex":0.0010905878,"about_ca_system_score_gemma":0.00145982,"threshold_uncertainty_score":0.017916977},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3062531,0.0040425155,0.6655293,0.00082698493,0.00072020147,0.00042386574,0.0020215681,0.013480508,0.0067018378],"genre_scores_gemma":[0.6311443,0.0012156193,0.35533026,0.00021908125,0.00037897733,0.00015984853,0.0053845025,0.0006846861,0.0054827384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995265,0.0012492213,0.00040262606,0.0010012668,0.0016981649,0.00038364803],"domain_scores_gemma":[0.9894729,0.0056414143,0.00067525165,0.001465453,0.002332633,0.0004122241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028864269,0.0013818055,0.0022071819,0.00449686,0.00089968514,0.0030747047,0.0013285378,0.001603899,0.0028300958],"category_scores_gemma":[0.018931547,0.00036392352,0.0016416814,0.0028401536,0.00044962243,0.0025011445,0.0009562287,0.00075872283,0.0029876542],"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.0015863064,0.0004589563,0.0067492547,0.00046206077,0.00019044545,0.00018339796,0.00017031531,0.014138899,0.051364392,0.0012422252,0.0064834473,0.9169704],"study_design_scores_gemma":[0.00013650801,0.00091416657,0.017824091,0.000058635098,0.0006510583,0.00078249944,0.00048104007,0.8211321,0.14684528,0.003926788,0.007148025,0.00009974917],"about_ca_topic_score_codex":0.0037480139,"about_ca_topic_score_gemma":0.0030815909,"teacher_disagreement_score":0.00449686,"about_ca_system_score_codex":0.0005175191,"about_ca_system_score_gemma":0.0021384382,"threshold_uncertainty_score":0.015265107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09833131,0.0015611735,0.8795939,0.0004098226,0.00036874923,0.00011836058,0.00009930953,0.00042784453,0.019089492],"genre_scores_gemma":[0.7928898,0.0005006984,0.19884439,0.00024358564,0.00012153264,0.00021324336,0.00021198843,0.00006807722,0.006906664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947995,0.00015750572,0.000028588913,0.00007359243,0.00018747896,0.00007279148],"domain_scores_gemma":[0.9993641,0.00024037434,0.000051504794,0.00006193425,0.00023185172,0.000050363342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009204742,0.0007020808,0.0015484543,0.0007691423,0.00074055785,0.0008479543,0.0014397674,0.0012021076,0.0022968769],"category_scores_gemma":[0.0018180021,0.00031418775,0.0007548299,0.0008604624,0.00031203695,0.0010786117,0.0009490675,0.0007558492,0.0004183741],"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.00019661972,0.00021117987,0.0019081386,0.00008293276,0.0002528611,0.00011068892,0.00005886094,0.8224668,0.0036910786,0.008134837,0.0035069224,0.1593791],"study_design_scores_gemma":[0.000009412244,0.000030803432,0.00015191014,0.0000035731837,0.000016762746,0.000018399269,0.0000053707818,0.9983741,0.00026842402,0.0008254054,0.00029175717,0.000003985931],"about_ca_topic_score_codex":0.0022353064,"about_ca_topic_score_gemma":0.0028145595,"teacher_disagreement_score":0.0022968769,"about_ca_system_score_codex":0.00044959242,"about_ca_system_score_gemma":0.0007013408,"threshold_uncertainty_score":0.007683754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065059215,0.0009290203,0.93017155,0.0007125627,0.00006324094,0.00012635137,0.00032181642,0.00013662715,0.0024796387],"genre_scores_gemma":[0.56764215,0.0004990505,0.4292364,0.00024707854,0.00010334105,0.00026618424,0.0009554382,0.000087860615,0.0009624773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9838074,0.008308259,0.0013174096,0.0014958931,0.0043828716,0.00068819517],"domain_scores_gemma":[0.89000505,0.09293598,0.0041740374,0.0049238703,0.007154092,0.00080691924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023869012,0.00074792997,0.0026859257,0.0052576642,0.0018950233,0.0052518016,0.0032209728,0.001416651,0.0033248274],"category_scores_gemma":[0.109357886,0.0012201843,0.0019406519,0.0051536327,0.0022638266,0.006747025,0.0032157535,0.0027493043,0.0002358143],"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.00072023965,0.00017250459,0.013516529,0.0006422074,0.00051387155,0.000812938,0.001175856,0.15259075,0.0008906356,0.7047175,0.003588688,0.12065821],"study_design_scores_gemma":[0.000037286587,0.000037701328,0.0008125966,0.00011122359,0.0001189231,0.00020141853,0.0001580313,0.40514106,0.0008920522,0.59135854,0.0011030269,0.000028230526],"about_ca_topic_score_codex":0.0025430333,"about_ca_topic_score_gemma":0.0019931914,"teacher_disagreement_score":0.023869012,"about_ca_system_score_codex":0.0020434677,"about_ca_system_score_gemma":0.0026444874,"threshold_uncertainty_score":0.12623286},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16011567,0.0037376063,0.7899568,0.00195877,0.00024638622,0.00005832702,0.0002110762,0.0001624896,0.043552916],"genre_scores_gemma":[0.9799153,0.0016186027,0.014535083,0.00012253507,0.00037444063,0.00004405373,0.000085240325,0.000038395407,0.0032663418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842525,0.0005729453,0.000102357495,0.00029892498,0.00043447205,0.00016613945],"domain_scores_gemma":[0.98951006,0.008276217,0.0006574227,0.0005335031,0.0007349448,0.00028786313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021256872,0.0006597605,0.0010152846,0.0014433655,0.0009639693,0.0018270044,0.0007117928,0.0009079575,0.003962874],"category_scores_gemma":[0.010218658,0.00032215565,0.0012655159,0.0010302529,0.0035475823,0.0040533193,0.0018059209,0.0023664616,0.0002451048],"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.00018966105,0.00005210057,0.0007447864,0.00024260842,0.000057298657,0.0004466667,0.0008712336,0.034948528,0.0032544525,0.93066585,0.0008050113,0.027721783],"study_design_scores_gemma":[0.000031867043,0.0001070219,0.00068635936,0.00005459131,0.000035625297,0.00018855579,0.00012871712,0.105751686,0.001199672,0.8897595,0.0020288979,0.000027452514],"about_ca_topic_score_codex":0.002227212,"about_ca_topic_score_gemma":0.0009090192,"teacher_disagreement_score":0.003962874,"about_ca_system_score_codex":0.0006325859,"about_ca_system_score_gemma":0.0004901598,"threshold_uncertainty_score":0.013257146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1537171,0.0028800704,0.83787787,0.0006950912,0.00012103493,0.00009100543,0.00025149388,0.0008906765,0.0034756137],"genre_scores_gemma":[0.77872777,0.0009210798,0.217877,0.00011449917,0.00011299731,0.00011382775,0.00070912845,0.0001942034,0.0012294299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993946,0.0028523095,0.00039878226,0.0005124581,0.0019158579,0.0003745375],"domain_scores_gemma":[0.9706932,0.02330771,0.000884687,0.001420288,0.0035008425,0.00019331802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010337905,0.0008464161,0.0011209308,0.0018516417,0.0006836782,0.0017315611,0.0009282018,0.0012625507,0.0017983221],"category_scores_gemma":[0.040693812,0.00045811047,0.000789404,0.0018664916,0.001021566,0.0022448665,0.0016406219,0.0007969334,0.00040779778],"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.002197822,0.00015512625,0.0038868042,0.00024861316,0.00023897951,0.000061365536,0.00011708763,0.76731443,0.0074958946,0.02644974,0.001709826,0.19012438],"study_design_scores_gemma":[0.000019057581,0.00011424934,0.0010138645,0.000008785515,0.00002852692,0.000051313506,0.00002317471,0.9888383,0.0040533952,0.005546456,0.0002837269,0.000019195077],"about_ca_topic_score_codex":0.004154796,"about_ca_topic_score_gemma":0.0023162279,"teacher_disagreement_score":0.010337905,"about_ca_system_score_codex":0.001553222,"about_ca_system_score_gemma":0.002623353,"threshold_uncertainty_score":0.054672718},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47943786,0.25742626,0.0017976757,0.032448668,0.0030022971,0.00009619792,0.006795537,0.000060980452,0.21893464],"genre_scores_gemma":[0.8009075,0.096879765,0.0011601244,0.001122311,0.00082834205,0.00008197244,0.0022479456,0.00006384592,0.09670821],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973947,0.000049655395,0.000024194336,0.000059289672,0.000054212363,0.00007315867],"domain_scores_gemma":[0.9996389,0.000103120736,0.00008876457,0.000034324523,0.00006547668,0.00006940043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007857663,0.00036944996,0.00025535314,0.0033086154,0.0017352997,0.002118884,0.00030191027,0.00064077607,0.006268248],"category_scores_gemma":[0.0018748993,0.00024242367,0.00013505199,0.007217823,0.0014360045,0.002654276,0.0016653896,0.0013337389,0.0013644315],"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.00057954714,0.00016302305,0.04179235,0.0015759376,0.0000957677,0.0015229259,0.11189176,0.00062041875,0.0014438836,0.18321979,0.1386848,0.5184098],"study_design_scores_gemma":[0.000007180133,0.000024750525,0.16557023,0.00043456533,0.00001778151,0.00055234163,0.0066693397,0.000041119358,0.0003126907,0.0033450066,0.8230075,0.000017411661],"about_ca_topic_score_codex":0.029024474,"about_ca_topic_score_gemma":0.054949723,"teacher_disagreement_score":0.029024474,"about_ca_system_score_codex":0.0025443279,"about_ca_system_score_gemma":0.0016806482,"threshold_uncertainty_score":0.057711065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23179656,0.0055939974,0.74705386,0.0020593852,0.00019920367,0.0002905211,0.00056376995,0.00085144705,0.011591287],"genre_scores_gemma":[0.83754116,0.0021840355,0.15343462,0.00015748407,0.00035519552,0.000123476,0.00042668884,0.0000789143,0.0056984704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984724,0.00078508665,0.00007062748,0.00020855204,0.00038408412,0.0000792316],"domain_scores_gemma":[0.98835385,0.009500835,0.00029524183,0.00090171763,0.0008240095,0.00012426986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026155144,0.00065485016,0.0011513168,0.0033063893,0.0008165097,0.0015139045,0.0008289997,0.0013238499,0.0020660167],"category_scores_gemma":[0.014577399,0.0004028654,0.00074253825,0.0033083684,0.00058009394,0.004363994,0.00091591256,0.00080974784,0.0005790005],"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.00078060233,0.0010133771,0.026558362,0.00051177066,0.00051970326,0.00015183118,0.0008018494,0.18034841,0.006088589,0.047798604,0.00794087,0.727486],"study_design_scores_gemma":[0.00003302582,0.00010512593,0.003892664,0.000037057845,0.00011632297,0.000074492295,0.00013000895,0.965837,0.0016943304,0.025892757,0.002156274,0.00003103459],"about_ca_topic_score_codex":0.008896177,"about_ca_topic_score_gemma":0.0144029055,"teacher_disagreement_score":0.008896177,"about_ca_system_score_codex":0.000750067,"about_ca_system_score_gemma":0.0005995821,"threshold_uncertainty_score":0.01768881},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117761426,0.0005642687,0.8770458,0.00033260672,0.000035182286,0.0002631575,0.002430703,0.0010798711,0.0004869231],"genre_scores_gemma":[0.7705964,0.00041681642,0.2247493,0.00006747019,0.00005551434,0.00042264635,0.0029225377,0.00004495028,0.00072447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998247,0.0005757155,0.00019991772,0.00055791804,0.00031933602,0.00010013647],"domain_scores_gemma":[0.98614615,0.011442751,0.000994017,0.00065264024,0.00050487753,0.00025946472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027256268,0.0008908687,0.001263442,0.0044559673,0.0006199934,0.0010633138,0.0016896477,0.0011966132,0.0013786501],"category_scores_gemma":[0.0139317475,0.0006864501,0.0017651981,0.0030420711,0.00046453218,0.0020333477,0.0010071334,0.0014341801,0.0004075706],"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.0006578477,0.00093600363,0.11143589,0.0005228623,0.00088099076,0.0007336309,0.0007688995,0.68828964,0.00265731,0.017166628,0.0018383476,0.17411187],"study_design_scores_gemma":[0.00000909698,0.000029444042,0.0016824041,0.000011073774,0.00003987968,0.00005606767,0.00003208015,0.9917646,0.0001920326,0.0059809624,0.000195782,0.0000066008906],"about_ca_topic_score_codex":0.0155997705,"about_ca_topic_score_gemma":0.019672055,"teacher_disagreement_score":0.0155997705,"about_ca_system_score_codex":0.000762303,"about_ca_system_score_gemma":0.0015773276,"threshold_uncertainty_score":0.0310179},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006021382,0.0057434356,0.013467798,0.74787754,0.06714934,0.0001659726,0.00032562166,0.00033245352,0.15891649],"genre_scores_gemma":[0.047411926,0.0023345673,0.0063965702,0.7850233,0.020934256,0.00027405407,0.00008961031,0.00019506038,0.1373408],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98097587,0.0036316982,0.0014769036,0.0033481894,0.008333806,0.002233558],"domain_scores_gemma":[0.97907066,0.014459241,0.0010679226,0.0018787363,0.00277339,0.00075010076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011012989,0.0016491062,0.001451008,0.0010371805,0.011007122,0.008581927,0.007092566,0.058102336,0.009697425],"category_scores_gemma":[0.04323935,0.0016856623,0.0030254351,0.0013548661,0.014642402,0.0140495645,0.0052757305,0.063747816,0.005263333],"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.00018214186,0.00006321599,0.0004247221,0.00015476013,0.00005935898,0.0013480517,0.0012327438,0.0003485525,0.0017990246,0.4083224,0.57741255,0.008652486],"study_design_scores_gemma":[0.00011050264,0.00014035235,0.0018997127,0.0007830074,0.00013408835,0.0007275141,0.00072392623,0.0010287162,0.002975896,0.15185058,0.8392949,0.00033086343],"about_ca_topic_score_codex":0.027551368,"about_ca_topic_score_gemma":0.054740816,"teacher_disagreement_score":0.058102336,"about_ca_system_score_codex":0.007184571,"about_ca_system_score_gemma":0.009464576,"threshold_uncertainty_score":0.058242917},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8902373,0.00032145937,0.10738549,0.00012944143,0.000014126437,0.00010295365,0.00026032334,0.000769123,0.0007798095],"genre_scores_gemma":[0.95458984,0.00008129762,0.044572353,0.00001135482,0.000009506,0.000063802836,0.0003738514,0.00006276995,0.00023522206],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686396,0.00081533974,0.00041745233,0.00037824613,0.001345412,0.00017960102],"domain_scores_gemma":[0.9501494,0.025415814,0.011920098,0.0027901349,0.008685101,0.0010394966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030472758,0.00085844286,0.00080287614,0.00862263,0.00046534676,0.0012360788,0.000992754,0.00092420285,0.00050921424],"category_scores_gemma":[0.028301325,0.0004122305,0.0007045084,0.0024626146,0.0005632889,0.0022463815,0.00081694865,0.000652898,0.00010969158],"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.0005914911,0.00049879466,0.537718,0.0005643025,0.0003456121,0.0005071963,0.0012531555,0.10634142,0.036476836,0.0060902317,0.0012378102,0.30837515],"study_design_scores_gemma":[0.000050237348,0.00081421837,0.15487638,0.00009261835,0.00024523417,0.0006849662,0.00036274764,0.8109054,0.019731447,0.011055116,0.0011110759,0.000070591486],"about_ca_topic_score_codex":0.0026177382,"about_ca_topic_score_gemma":0.003811344,"teacher_disagreement_score":0.00862263,"about_ca_system_score_codex":0.00081449,"about_ca_system_score_gemma":0.0010418658,"threshold_uncertainty_score":0.016115725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012821901,0.00050374144,0.9829056,0.0001428219,0.00011262019,0.000059092916,0.000031299336,0.00008818097,0.0033347025],"genre_scores_gemma":[0.48146254,0.00055265037,0.5067477,0.00015800359,0.00015987038,0.00043338118,0.00013547968,0.00007293346,0.010277511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950683,0.00018034599,0.00003591237,0.000097476026,0.0001460978,0.00003339197],"domain_scores_gemma":[0.9994967,0.00023124318,0.00004841636,0.000043604843,0.00016214396,0.000017927368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014868624,0.00078434934,0.0011717828,0.00071449124,0.00071424275,0.0011301333,0.0018733364,0.0023897488,0.0019066274],"category_scores_gemma":[0.0037038624,0.0005734786,0.00092937256,0.0012720489,0.0005953767,0.00152276,0.0012075516,0.0010040288,0.00044061866],"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.000061588085,0.000032579366,0.00026105472,0.00007872393,0.000053793756,0.000039922215,0.000045260967,0.9268352,0.0010110778,0.020081392,0.0008512082,0.05064822],"study_design_scores_gemma":[0.000003365287,0.0000068585496,0.000030836127,0.000003528254,0.000003761542,0.0000069438906,0.0000020800644,0.9969331,0.00018807201,0.0026407754,0.00017709649,0.0000035268647],"about_ca_topic_score_codex":0.0054600383,"about_ca_topic_score_gemma":0.004891299,"teacher_disagreement_score":0.0054600383,"about_ca_system_score_codex":0.001098109,"about_ca_system_score_gemma":0.0008254553,"threshold_uncertainty_score":0.010856509},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001311637,0.06923683,0.013431513,0.01942764,0.7932901,0.00027862436,0.00067844463,0.0006669677,0.10167828],"genre_scores_gemma":[0.005817276,0.05935055,0.003380962,0.0034651489,0.6678467,0.00025228746,0.0015190205,0.00050025526,0.25786787],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982663,0.00027464668,0.00017671695,0.00025457266,0.0008819692,0.00014593889],"domain_scores_gemma":[0.9924905,0.002338455,0.00039746793,0.0007270377,0.0029992915,0.0010473579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021756908,0.0024889188,0.0031679207,0.0056940163,0.0019949519,0.0066617653,0.0026296384,0.003556757,0.10306572],"category_scores_gemma":[0.005809884,0.00064889254,0.0014965016,0.0058768024,0.001107367,0.005046594,0.0019104577,0.0028276867,0.036365766],"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.000045732188,0.00007606343,0.0001881775,0.0004607604,0.000020863652,0.00009489323,0.00003050514,0.00020498951,0.00029767488,0.0038672187,0.92987585,0.06483728],"study_design_scores_gemma":[0.000011374236,0.00005108183,0.00062495994,0.00016108391,0.00002633332,0.0001783921,0.000038380178,0.00045675974,0.00013616055,0.0031488934,0.99515605,0.000010479826],"about_ca_topic_score_codex":0.0013183634,"about_ca_topic_score_gemma":0.003218662,"teacher_disagreement_score":0.10306572,"about_ca_system_score_codex":0.0013461449,"about_ca_system_score_gemma":0.0016865885,"threshold_uncertainty_score":0.3447892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7319758,0.001785683,0.24612708,0.0004782807,0.00015164039,0.0005172897,0.0024152894,0.0012943719,0.015254515],"genre_scores_gemma":[0.8787809,0.001354067,0.11492322,0.00011050061,0.000080807586,0.00012612311,0.0007025939,0.000048139253,0.003873641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981195,0.000031187647,0.000017356155,0.00003918154,0.00007811391,0.00002223265],"domain_scores_gemma":[0.99957746,0.00015435994,0.000043596727,0.00003460771,0.00016904801,0.000020921489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038961426,0.0003164188,0.00034693445,0.0030227995,0.00017665635,0.00061458413,0.00021443254,0.00034878394,0.003998969],"category_scores_gemma":[0.00123979,0.00014881109,0.00040517363,0.0011171811,0.00019835925,0.00065924536,0.00037412377,0.000241705,0.00065070146],"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.0012883857,0.0001711516,0.07575602,0.0003467734,0.00014374687,0.0007952388,0.00013368802,0.0036859438,0.17350462,0.0012508262,0.002350987,0.7405726],"study_design_scores_gemma":[0.00024962606,0.0010020499,0.46332958,0.00019593076,0.00084822153,0.01010282,0.0011161066,0.35482588,0.15397197,0.004635151,0.009569766,0.00015296313],"about_ca_topic_score_codex":0.0042376434,"about_ca_topic_score_gemma":0.004455984,"teacher_disagreement_score":0.0042376434,"about_ca_system_score_codex":0.00028261467,"about_ca_system_score_gemma":0.00045585528,"threshold_uncertainty_score":0.013377845},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46906817,0.0033139014,0.50520176,0.0011420966,0.00047325678,0.0010628382,0.010418454,0.0044653756,0.004854149],"genre_scores_gemma":[0.48099378,0.0024260296,0.497242,0.00022874841,0.0002693759,0.00052352267,0.01184624,0.000872356,0.005597945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780196,0.0005117883,0.00029802098,0.0005396069,0.00066915015,0.00017946596],"domain_scores_gemma":[0.99037373,0.0052560735,0.00071887893,0.00083519315,0.0023913675,0.00042481985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003039313,0.0008106418,0.0007687209,0.010593924,0.001094692,0.0026398292,0.00078963756,0.0011857705,0.0022826553],"category_scores_gemma":[0.014715638,0.00055747025,0.0011976281,0.008340877,0.0008329282,0.0048050988,0.001601623,0.001655107,0.0009448373],"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.0025289308,0.00051713677,0.1236347,0.0019161252,0.0006019353,0.00078290195,0.0064363345,0.023981694,0.07042203,0.037143927,0.015339213,0.7166952],"study_design_scores_gemma":[0.0005851669,0.0014538174,0.1288785,0.0010832755,0.0036986968,0.0033033234,0.008490203,0.3743203,0.07835824,0.26199308,0.1373865,0.0004488308],"about_ca_topic_score_codex":0.0075602275,"about_ca_topic_score_gemma":0.013862051,"teacher_disagreement_score":0.010593924,"about_ca_system_score_codex":0.0012805089,"about_ca_system_score_gemma":0.0023342841,"threshold_uncertainty_score":0.016073644},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023176039,0.00068235194,0.9707427,0.00018462277,0.00010219366,0.00009029652,0.00022195399,0.0003715697,0.0044282237],"genre_scores_gemma":[0.41910812,0.00053215655,0.57412136,0.000103023296,0.00015084074,0.00018451967,0.00083960925,0.00016996672,0.0047903885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966486,0.00071064476,0.00024592402,0.0005395438,0.0017078375,0.00014733864],"domain_scores_gemma":[0.9972562,0.000877328,0.00017924453,0.00041126122,0.0012214611,0.000054454144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028140363,0.00069947884,0.0012909214,0.0038302399,0.0018825817,0.002466691,0.0015145125,0.0013299431,0.0030720078],"category_scores_gemma":[0.009360615,0.0003807458,0.0011409547,0.0030377035,0.0010285925,0.0018636307,0.001149554,0.00091537036,0.00082604744],"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.0005813787,0.00013133867,0.0025515747,0.00055890175,0.00026732672,0.00015260767,0.0003792745,0.3873131,0.014473926,0.1259692,0.0073291166,0.46029225],"study_design_scores_gemma":[0.000017607703,0.00005858805,0.0017592515,0.000034414883,0.0000613569,0.00014778053,0.00006914468,0.9534481,0.008317977,0.031802624,0.004224219,0.000058953374],"about_ca_topic_score_codex":0.0047228723,"about_ca_topic_score_gemma":0.0038237807,"teacher_disagreement_score":0.0047228723,"about_ca_system_score_codex":0.0016642666,"about_ca_system_score_gemma":0.0016943518,"threshold_uncertainty_score":0.0148822665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08918204,0.0003321788,0.8891938,0.0019686471,0.000051916282,0.00012611152,0.000072026676,0.00017742478,0.018895963],"genre_scores_gemma":[0.8942626,0.00017021419,0.10116469,0.00013524688,0.000051574767,0.00014377129,0.00006062538,0.00007148077,0.003939655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99374455,0.0031262012,0.00026024523,0.0005779015,0.0018864637,0.0004047318],"domain_scores_gemma":[0.97940356,0.015150415,0.0013801077,0.0017713853,0.0018010729,0.0004934632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008146475,0.0010386227,0.0007766685,0.00183019,0.000894642,0.003435543,0.0025244555,0.0028420745,0.0045927125],"category_scores_gemma":[0.028019842,0.0010606742,0.001082362,0.0010359791,0.0020636958,0.008660873,0.002074781,0.0027036604,0.00064100575],"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.0003199093,0.0002114687,0.0022548842,0.00023741602,0.000098957455,0.0004118433,0.0010471495,0.29778007,0.003741378,0.64832014,0.0011814787,0.04439535],"study_design_scores_gemma":[0.000043915545,0.0001322743,0.0007377655,0.00004221512,0.00004660282,0.00015261777,0.00015361013,0.70267254,0.0005411126,0.29416305,0.0012827829,0.000031522766],"about_ca_topic_score_codex":0.0019086057,"about_ca_topic_score_gemma":0.0018055274,"teacher_disagreement_score":0.008146475,"about_ca_system_score_codex":0.0025481563,"about_ca_system_score_gemma":0.0017708171,"threshold_uncertainty_score":0.04308319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017124005,0.0011761688,0.9791393,0.00015764654,0.000111632384,0.000014048243,0.00005967324,0.00012079021,0.0020968185],"genre_scores_gemma":[0.485506,0.005238491,0.49889338,0.00017426426,0.00066033524,0.00005342853,0.0004240884,0.0001963183,0.008853668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958557,0.00009764179,0.00002647294,0.00009478137,0.00016575532,0.000029766483],"domain_scores_gemma":[0.998852,0.0003154385,0.00015481826,0.00027705694,0.0003494374,0.000051240946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009887462,0.00047688917,0.0005574732,0.0013765574,0.00022435155,0.0009540683,0.0005292941,0.0004987443,0.0017336543],"category_scores_gemma":[0.003308942,0.00025343336,0.0008477802,0.0010063564,0.00053120253,0.0013793528,0.0008315092,0.0010136353,0.00044318382],"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.00022339089,0.0001484879,0.0019411879,0.00052704616,0.00017092336,0.0005064176,0.00038607026,0.08351693,0.09235724,0.28804213,0.003687655,0.52849257],"study_design_scores_gemma":[0.00001006858,0.00006980247,0.0026756122,0.00004082351,0.00007268041,0.00044657756,0.00006060433,0.8890786,0.009626795,0.089272045,0.008612459,0.00003385424],"about_ca_topic_score_codex":0.00054765516,"about_ca_topic_score_gemma":0.0005052066,"teacher_disagreement_score":0.0017336543,"about_ca_system_score_codex":0.0001965751,"about_ca_system_score_gemma":0.00036428485,"threshold_uncertainty_score":0.005799651},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124373734,0.0039548543,0.80401605,0.004436071,0.00080668676,0.00050777144,0.00074833643,0.0009678173,0.06018873],"genre_scores_gemma":[0.8958958,0.002184822,0.07949712,0.00079908315,0.0004475908,0.00045400026,0.00047085632,0.00014631532,0.02010448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973757,0.00079842145,0.00014269615,0.00022922961,0.0010858038,0.00036819564],"domain_scores_gemma":[0.99534696,0.0024122267,0.0005339892,0.0011731788,0.0003455126,0.00018812732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016471589,0.00081079936,0.0010347837,0.0013971339,0.0012308981,0.0023462109,0.0010751524,0.0023277104,0.006203546],"category_scores_gemma":[0.007642886,0.00062518724,0.0007583661,0.0024070172,0.0019170992,0.004327629,0.0048510022,0.0026171124,0.0017346761],"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.0005211197,0.000071180235,0.00022105573,0.00032919136,0.000043241642,0.0001373847,0.00033982293,0.020076314,0.012612199,0.91627127,0.00291252,0.046464674],"study_design_scores_gemma":[0.00021204814,0.00016360561,0.00024109411,0.00017810952,0.000042169257,0.00039426752,0.0000489101,0.08451245,0.017115425,0.8841591,0.0128461085,0.000086627915],"about_ca_topic_score_codex":0.00024738378,"about_ca_topic_score_gemma":0.00021217708,"teacher_disagreement_score":0.006203546,"about_ca_system_score_codex":0.0013998402,"about_ca_system_score_gemma":0.0012821124,"threshold_uncertainty_score":0.020752907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056499653,0.0035233065,0.9882876,0.00039456997,0.00018603216,0.00006160556,0.00006889325,0.0001101144,0.0017178374],"genre_scores_gemma":[0.37959027,0.005297682,0.609616,0.00030216677,0.0008356793,0.00033114507,0.00030542174,0.000057103953,0.0036645334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99409074,0.0027442395,0.00046290606,0.00041775336,0.0020532883,0.00023104966],"domain_scores_gemma":[0.9941368,0.0032644859,0.0005521246,0.00055341003,0.0013704288,0.00012270213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004610679,0.0009795144,0.002743053,0.004028724,0.0008310886,0.0032547617,0.0028290693,0.0017531494,0.0013500726],"category_scores_gemma":[0.014017717,0.0004686456,0.0021523896,0.0041778334,0.0014336455,0.0031987012,0.001947782,0.0021310314,0.00045746696],"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.00016896709,0.00017108508,0.0007701755,0.00067840493,0.00035488055,0.00018202828,0.00027314687,0.19546026,0.001734703,0.393721,0.0047446396,0.4017407],"study_design_scores_gemma":[0.00002023948,0.0001506088,0.0003887815,0.00007837908,0.00007679869,0.0001065684,0.00006198144,0.66300344,0.0012285183,0.330897,0.0039305463,0.000057118603],"about_ca_topic_score_codex":0.0016420878,"about_ca_topic_score_gemma":0.0011688615,"teacher_disagreement_score":0.004610679,"about_ca_system_score_codex":0.0015898213,"about_ca_system_score_gemma":0.0013144241,"threshold_uncertainty_score":0.024383843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99317557,0.000085367006,0.004839061,0.00009365303,0.0000025451875,0.000026739468,0.00005690922,0.000028442037,0.0016917522],"genre_scores_gemma":[0.99474996,0.000039882518,0.0044792164,0.000009253973,0.0000030335764,0.000009630559,0.00007388786,0.000010510264,0.00062459585],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99785006,0.00090333296,0.00014994363,0.00020130187,0.0007041917,0.00019117513],"domain_scores_gemma":[0.92074805,0.06307381,0.004754476,0.0024274176,0.007937048,0.0010591712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033932857,0.00031125257,0.00029003998,0.0022550044,0.00066034583,0.0010954577,0.0012844781,0.0009780141,0.0013460213],"category_scores_gemma":[0.028218241,0.00030688755,0.0003067372,0.001769512,0.0005408528,0.0017893618,0.00076262304,0.0008185796,0.00021468641],"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.0009040535,0.0014228896,0.79432994,0.00024682126,0.00004913355,0.0039408333,0.012150499,0.013044455,0.015144065,0.00480788,0.0008489189,0.15311043],"study_design_scores_gemma":[0.000040533283,0.0017704598,0.8339455,0.00014058939,0.00011431264,0.0015922973,0.01365934,0.11589071,0.024404105,0.0039645964,0.0043513784,0.00012620512],"about_ca_topic_score_codex":0.014219511,"about_ca_topic_score_gemma":0.024020614,"teacher_disagreement_score":0.014219511,"about_ca_system_score_codex":0.0017059075,"about_ca_system_score_gemma":0.0007888768,"threshold_uncertainty_score":0.028273523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038552083,0.0002919854,0.9528069,0.00013558603,0.00011296346,0.000047584916,0.000010676084,0.00017502415,0.007867237],"genre_scores_gemma":[0.6893696,0.00034662217,0.30661124,0.0001388843,0.00008530896,0.00013708652,0.000043426353,0.00008444172,0.0031832908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996213,0.00012175316,0.000015107054,0.000031226544,0.00018232434,0.00002827817],"domain_scores_gemma":[0.99953747,0.00022926007,0.000058448906,0.000042307012,0.000115634626,0.000016956637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009431838,0.00055777456,0.00086568156,0.00052385055,0.0003181257,0.0007326042,0.0008004783,0.0009391207,0.0010161153],"category_scores_gemma":[0.0018854584,0.000250182,0.0005452265,0.0006128279,0.00050583616,0.00083316205,0.00090600655,0.0007107533,0.00023155747],"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.0001299381,0.0001394966,0.00053327327,0.00013073336,0.00007582215,0.00008112991,0.000072616334,0.8663871,0.010636628,0.015617536,0.00092744635,0.1052682],"study_design_scores_gemma":[0.000011777651,0.00003250171,0.000059845792,0.000003223164,0.00000668296,0.00001581168,0.0000036001359,0.99736685,0.0007240406,0.0014463733,0.00032642164,0.0000029698642],"about_ca_topic_score_codex":0.00087961665,"about_ca_topic_score_gemma":0.00079711,"teacher_disagreement_score":0.0010161153,"about_ca_system_score_codex":0.0002926345,"about_ca_system_score_gemma":0.00037618165,"threshold_uncertainty_score":0.0049880743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014468186,0.000666276,0.98057324,0.00052123726,0.000087487715,0.00005390938,0.00008910016,0.0000662409,0.003474319],"genre_scores_gemma":[0.7373012,0.0010849412,0.2573187,0.0003033741,0.00021672528,0.000263868,0.00024575225,0.000042104322,0.0032232732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99083734,0.005133344,0.00045583333,0.0009558942,0.002153427,0.00046421937],"domain_scores_gemma":[0.9884919,0.008747163,0.0008538235,0.0005676728,0.0010989202,0.0002404392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0095376,0.0017994101,0.0047302498,0.0023397906,0.0010043446,0.00487273,0.0028116275,0.0021068286,0.0023941852],"category_scores_gemma":[0.017414877,0.0010245972,0.0023306622,0.0029493526,0.0040234737,0.0049950224,0.0023057756,0.0026645674,0.00031334985],"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.0001249794,0.00005915709,0.00032524145,0.00026489169,0.00025720499,0.00025321427,0.00018527264,0.5858869,0.00041394934,0.39292085,0.000726076,0.018582253],"study_design_scores_gemma":[0.000030518797,0.0000347461,0.000086887405,0.000031375457,0.00004222887,0.000026563455,0.000018346858,0.67090195,0.00013214778,0.32827246,0.00039846325,0.000024327252],"about_ca_topic_score_codex":0.004898614,"about_ca_topic_score_gemma":0.0036447605,"teacher_disagreement_score":0.0095376,"about_ca_system_score_codex":0.004074965,"about_ca_system_score_gemma":0.0028343485,"threshold_uncertainty_score":0.050440192},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023026869,0.0003784433,0.9735065,0.0001151255,0.000050917366,0.00004235352,0.000079049096,0.0009336124,0.0018671412],"genre_scores_gemma":[0.24644452,0.00054746633,0.74997,0.00007924721,0.000075259144,0.00009807643,0.0003428539,0.00020509734,0.0022374424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881315,0.00023123957,0.000041845866,0.0001581438,0.00067843276,0.000077239274],"domain_scores_gemma":[0.9990484,0.00024294716,0.00008738695,0.00014209973,0.00044697674,0.00003215414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001259576,0.0007122027,0.0013130546,0.001712979,0.0010937486,0.0011520743,0.0011423755,0.0010694996,0.002329966],"category_scores_gemma":[0.0019859776,0.0007409726,0.001256979,0.003362158,0.0006156907,0.0016743323,0.0017436999,0.0015189968,0.0008320747],"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.0006823235,0.00034417573,0.0027527784,0.00028341543,0.00029254865,0.00020696789,0.00029518415,0.06396027,0.22943662,0.014553767,0.00290757,0.6842844],"study_design_scores_gemma":[0.00004429364,0.00022269617,0.006934908,0.00002324031,0.00023095445,0.0006130181,0.000080080754,0.8147144,0.1653612,0.005050681,0.0065824757,0.00014204248],"about_ca_topic_score_codex":0.0020840317,"about_ca_topic_score_gemma":0.00392849,"teacher_disagreement_score":0.002329966,"about_ca_system_score_codex":0.0004938073,"about_ca_system_score_gemma":0.0010219577,"threshold_uncertainty_score":0.007794559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072247987,0.0004380806,0.9858165,0.0007518881,0.000038989325,0.00005680232,0.00004174798,0.000026591173,0.0056047584],"genre_scores_gemma":[0.40675703,0.0015244571,0.58524144,0.00026416668,0.0002908673,0.00048225993,0.00016485897,0.00006342716,0.005211411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774015,0.001334918,0.000078438476,0.00018797492,0.00050213287,0.00015642482],"domain_scores_gemma":[0.9943461,0.004621303,0.0002309451,0.00012899516,0.0005635287,0.0001091765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005407177,0.0014416031,0.0017840602,0.0020491865,0.00108226,0.002878084,0.0018801544,0.0023352215,0.0036914411],"category_scores_gemma":[0.014558239,0.0009263358,0.0018671004,0.0024115052,0.0023999813,0.0034700788,0.0021224278,0.002696698,0.00029910033],"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.00008265966,0.00006566068,0.00020795326,0.00028852705,0.000078824836,0.0001283839,0.00018697712,0.5174156,0.00067505357,0.4528385,0.001661632,0.026370378],"study_design_scores_gemma":[0.000022489477,0.000029617002,0.000047069916,0.000052752213,0.000017707802,0.000024383666,0.000044214295,0.7427077,0.00024230544,0.25595534,0.0008427863,0.000013677474],"about_ca_topic_score_codex":0.005492183,"about_ca_topic_score_gemma":0.0029875478,"teacher_disagreement_score":0.005492183,"about_ca_system_score_codex":0.0017281512,"about_ca_system_score_gemma":0.0028150748,"threshold_uncertainty_score":0.028596163},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08527886,0.010481027,0.8014371,0.018151846,0.0014544888,0.00031619097,0.00237025,0.00077147817,0.07973884],"genre_scores_gemma":[0.6396126,0.012164999,0.29716262,0.0042861383,0.00800045,0.0011787089,0.0050044656,0.0011200653,0.031469878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955895,0.0009913878,0.00026912667,0.00076836284,0.0018669179,0.0005146667],"domain_scores_gemma":[0.9606086,0.032778095,0.0015042315,0.0024622176,0.0016801732,0.0009666244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034349358,0.002157962,0.002471519,0.0041931965,0.002114562,0.007401161,0.003843298,0.0033351234,0.01593795],"category_scores_gemma":[0.031899348,0.0010559929,0.0030978082,0.0053377924,0.0037541382,0.020017289,0.006083444,0.009351212,0.001916292],"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.00044995442,0.0003164557,0.002192313,0.00088721176,0.00019810232,0.00035760755,0.00044354095,0.07633328,0.0024115744,0.80611604,0.03316693,0.077127025],"study_design_scores_gemma":[0.00004196145,0.00003639067,0.0005136429,0.00005387341,0.00004701154,0.00020898072,0.0000884449,0.11599463,0.0005366437,0.87729686,0.0051466553,0.0000348725],"about_ca_topic_score_codex":0.0017139096,"about_ca_topic_score_gemma":0.0020021456,"teacher_disagreement_score":0.01593795,"about_ca_system_score_codex":0.0040548462,"about_ca_system_score_gemma":0.0020875917,"threshold_uncertainty_score":0.053317785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11758891,0.00085284543,0.86405814,0.00082036236,0.00009262115,0.00021937743,0.00010439578,0.00032254987,0.015940791],"genre_scores_gemma":[0.7749073,0.0003624004,0.2173278,0.00017127489,0.00006101179,0.00014071932,0.00015201882,0.000096500844,0.0067809923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978642,0.0010737353,0.00009565563,0.00020659211,0.0004831703,0.00027672885],"domain_scores_gemma":[0.9897803,0.0076613645,0.00049696484,0.00071691914,0.00095746276,0.00038688793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004287644,0.00061904726,0.0014178143,0.0014486746,0.0011260653,0.0019953032,0.0022477796,0.0015324958,0.004093435],"category_scores_gemma":[0.023716297,0.00046476364,0.0006169501,0.001116177,0.0011101586,0.0029107344,0.0020606685,0.0017785624,0.0003719775],"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.00033020056,0.00031952505,0.0053016366,0.00020346764,0.00012573299,0.00019445267,0.00054687756,0.4801265,0.0015725866,0.32269022,0.0057204654,0.18286836],"study_design_scores_gemma":[0.000031772834,0.00005729598,0.000497615,0.000032998403,0.000044803804,0.00007307316,0.000060143324,0.8496239,0.00044531326,0.14744128,0.0016807646,0.000011082868],"about_ca_topic_score_codex":0.0046098456,"about_ca_topic_score_gemma":0.0070677497,"teacher_disagreement_score":0.0046098456,"about_ca_system_score_codex":0.0012750797,"about_ca_system_score_gemma":0.0017640793,"threshold_uncertainty_score":0.022675514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.679614,0.00048559371,0.3160417,0.00042487838,0.00014275925,0.000040648836,0.000051695886,0.00077224977,0.0024265542],"genre_scores_gemma":[0.9949706,0.000022854916,0.0045475285,0.000011088942,0.0000043626737,0.0000059576796,0.0000137642655,0.0000044556705,0.00041943265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998652,0.000019638364,0.000009989933,0.000043494307,0.000034500605,0.000027170685],"domain_scores_gemma":[0.9996061,0.00018533193,0.000069539,0.000026291575,0.00008368755,0.000029097624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023123756,0.0007881998,0.0007980779,0.0005420142,0.00057640264,0.0005084884,0.0005614742,0.0008226317,0.00062965025],"category_scores_gemma":[0.0008739654,0.00031359313,0.0003963813,0.0001767824,0.00033891192,0.0006158621,0.00045327705,0.00053789536,0.000093590745],"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.0020424572,0.00035095718,0.0067553674,0.00025706174,0.00021181286,0.0009857585,0.00017557727,0.75721395,0.09884277,0.0024161073,0.0007124768,0.1300357],"study_design_scores_gemma":[0.000008977754,0.00007146739,0.00094904774,0.0000029582347,0.00001592305,0.00003897286,0.000012126921,0.9922654,0.006222612,0.00033286063,0.00007272539,0.0000068150803],"about_ca_topic_score_codex":0.0053389673,"about_ca_topic_score_gemma":0.0048674564,"teacher_disagreement_score":0.0053389673,"about_ca_system_score_codex":0.00047973124,"about_ca_system_score_gemma":0.00051622133,"threshold_uncertainty_score":0.010615766},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009147745,0.27042434,0.6943471,0.002114431,0.0006237625,0.00019727806,0.00018609477,0.0004318518,0.022527436],"genre_scores_gemma":[0.14380047,0.33105823,0.5136182,0.0012618735,0.0020454607,0.00050061865,0.00069137546,0.0003606368,0.006663096],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916124,0.00026789831,0.000077880446,0.0001366607,0.0002975883,0.000058758153],"domain_scores_gemma":[0.99854666,0.0010101219,0.00010537,0.00010767063,0.00018271897,0.000047505215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019609688,0.0020021715,0.0030240875,0.0017423583,0.000659817,0.0026734038,0.002476307,0.0023706248,0.0030809345],"category_scores_gemma":[0.0042445506,0.0006545319,0.0013996683,0.005418752,0.00090382824,0.0024964286,0.0013595464,0.0020832126,0.0015497613],"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.00012572632,0.000382773,0.0009990274,0.0032017205,0.0003191829,0.000078364064,0.00010123737,0.2548856,0.0014384465,0.058306016,0.009448622,0.6707132],"study_design_scores_gemma":[0.00011679244,0.00027565987,0.0007802006,0.00089413975,0.0002329032,0.00022127976,0.00017682034,0.80560863,0.0020336509,0.10310038,0.08650527,0.000054212305],"about_ca_topic_score_codex":0.0023107666,"about_ca_topic_score_gemma":0.0025283236,"teacher_disagreement_score":0.0030809345,"about_ca_system_score_codex":0.00079719396,"about_ca_system_score_gemma":0.0016062701,"threshold_uncertainty_score":0.010370672},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08041908,0.0021020512,0.91199076,0.0014158593,0.0001097001,0.00015430043,0.0005250617,0.00059872406,0.0026843625],"genre_scores_gemma":[0.87121373,0.0022516784,0.114075616,0.00029744755,0.00039791298,0.0005608755,0.001025803,0.00020846477,0.00996851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631965,0.0018100895,0.00023265523,0.0008022539,0.00056367717,0.0002716021],"domain_scores_gemma":[0.9819687,0.015176521,0.001105151,0.00082635926,0.00067308993,0.0002501177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058980905,0.0010270262,0.0022931842,0.003303752,0.0011472873,0.0032088903,0.0029982475,0.0038401699,0.0041645607],"category_scores_gemma":[0.03849712,0.0014451693,0.002332366,0.004070184,0.001351964,0.0075604143,0.0021883703,0.0028648474,0.0016345225],"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.0004184147,0.00025231965,0.0043324367,0.0003724401,0.0002645561,0.00022505254,0.00060848915,0.7971791,0.0016940627,0.13605544,0.0026961004,0.05590159],"study_design_scores_gemma":[0.000023111827,0.00003325273,0.00032617108,0.0000132477635,0.000046689485,0.00006147779,0.000020309062,0.94683886,0.00017386486,0.052012566,0.00043185885,0.000018548164],"about_ca_topic_score_codex":0.010447591,"about_ca_topic_score_gemma":0.009870564,"teacher_disagreement_score":0.010447591,"about_ca_system_score_codex":0.002292605,"about_ca_system_score_gemma":0.0013580607,"threshold_uncertainty_score":0.031192422},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006123568,0.00026238651,0.9923745,0.00005931776,0.000060311955,0.000043051863,0.00007156466,0.0006639006,0.00034148231],"genre_scores_gemma":[0.15456864,0.00045329644,0.8406865,0.00023487817,0.0003335189,0.00017483551,0.00059538364,0.00022079896,0.0027320941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843115,0.0002991603,0.00012378542,0.0003714432,0.0006625891,0.00011181342],"domain_scores_gemma":[0.998353,0.0006372331,0.000100377154,0.0002319476,0.0006159135,0.00006162133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002087703,0.0015009427,0.0024853637,0.002550676,0.0005464965,0.0017500327,0.0014168742,0.0014137991,0.00141622],"category_scores_gemma":[0.0035402807,0.00051129836,0.0015626804,0.0029823298,0.00039184283,0.001785479,0.0011100523,0.0008382282,0.0010109104],"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.00038010266,0.0002924198,0.0017199337,0.00019702116,0.0005083339,0.00014819157,0.000058129473,0.024777217,0.03888468,0.0031727145,0.0057684453,0.9240928],"study_design_scores_gemma":[0.0000963943,0.0004200248,0.003972907,0.000037734946,0.0005737128,0.0004397391,0.000043832122,0.9454323,0.032499652,0.008621013,0.0077583054,0.00010433032],"about_ca_topic_score_codex":0.0015551997,"about_ca_topic_score_gemma":0.0018827574,"teacher_disagreement_score":0.002550676,"about_ca_system_score_codex":0.0002468054,"about_ca_system_score_gemma":0.0006892932,"threshold_uncertainty_score":0.011040926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052694514,0.00061429595,0.9204029,0.00053513556,0.00017674387,0.00011810025,0.00066017313,0.0002787506,0.024519378],"genre_scores_gemma":[0.45591235,0.0006021863,0.532825,0.00023220779,0.00024560065,0.0003374398,0.0009340597,0.00014881934,0.00876224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989231,0.00018905746,0.00011,0.0002886672,0.00036386529,0.0001252335],"domain_scores_gemma":[0.99837947,0.0005790278,0.00020915845,0.00022200683,0.00045733617,0.00015303642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014614223,0.00054350385,0.00052900123,0.0029068636,0.0016511409,0.0030865036,0.0012719599,0.0011325171,0.005127498],"category_scores_gemma":[0.0033445037,0.00058049103,0.0011875457,0.0024437679,0.0022380874,0.0071247094,0.0012840568,0.0018169387,0.0006502898],"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.000040446143,0.00001756839,0.00018952758,0.000060451533,0.000011483019,0.00007866686,0.00031970046,0.0022387493,0.001744616,0.9811787,0.0006268631,0.013493155],"study_design_scores_gemma":[0.000036946083,0.000033187334,0.0003599452,0.000045821766,0.00003931045,0.00019604717,0.0002900624,0.021217486,0.0018217413,0.9595451,0.016385995,0.000028366228],"about_ca_topic_score_codex":0.0030658292,"about_ca_topic_score_gemma":0.0038652157,"teacher_disagreement_score":0.005127498,"about_ca_system_score_codex":0.0011265589,"about_ca_system_score_gemma":0.00063223817,"threshold_uncertainty_score":0.017153144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024505006,0.0011419705,0.9696398,0.00017718968,0.00006539782,0.000040934283,0.00009162782,0.00015272637,0.0041852333],"genre_scores_gemma":[0.6232242,0.0019617837,0.37042958,0.00011943311,0.00016541449,0.00014437851,0.00045998453,0.000077757824,0.0034175343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974433,0.00091761525,0.00014878054,0.00022066357,0.0011076224,0.00016210278],"domain_scores_gemma":[0.9949824,0.0032335725,0.00028047117,0.00086194515,0.0005496483,0.000091922746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026609697,0.00071519054,0.0021127367,0.002308378,0.00064702914,0.0025324035,0.0011297221,0.0010274819,0.00226625],"category_scores_gemma":[0.0114088105,0.00059494446,0.0021051783,0.0026262417,0.00089696795,0.0027748265,0.0013511324,0.0015707562,0.0004309437],"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.00025702524,0.000072944684,0.0009712519,0.00031768344,0.00022684464,0.00027429688,0.0004105031,0.44593093,0.0036052347,0.385414,0.0026285306,0.15989068],"study_design_scores_gemma":[0.0000142198005,0.00006956953,0.00036196972,0.000039229264,0.00006415558,0.00012583534,0.000049836737,0.85148287,0.0012830939,0.14368613,0.0027994574,0.000023654608],"about_ca_topic_score_codex":0.0014278514,"about_ca_topic_score_gemma":0.0008550215,"teacher_disagreement_score":0.0026609697,"about_ca_system_score_codex":0.0013166405,"about_ca_system_score_gemma":0.00060752674,"threshold_uncertainty_score":0.014072776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10659434,0.002213022,0.8619236,0.0008486025,0.0005091836,0.0005352963,0.0010302064,0.0053574266,0.020988407],"genre_scores_gemma":[0.7443077,0.0024781178,0.22355272,0.0008909457,0.00028569446,0.00070211355,0.0014827438,0.00088448543,0.025415499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992755,0.00020649088,0.000051118073,0.000115591865,0.00023355275,0.00011773757],"domain_scores_gemma":[0.9987828,0.0002587499,0.00019252277,0.00050523895,0.0001395726,0.00012110953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012756962,0.0011783644,0.000697023,0.0008060318,0.0005115055,0.0012799504,0.0007444545,0.0008764347,0.0016018912],"category_scores_gemma":[0.0023169112,0.00032943903,0.0008022185,0.00088950986,0.0009852537,0.0018479087,0.0012827269,0.0015145887,0.0013532921],"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.0015671,0.00027368354,0.002481427,0.0007039834,0.00024190235,0.00072718,0.0003299916,0.04503926,0.09088428,0.5476194,0.029101891,0.2810299],"study_design_scores_gemma":[0.0003869435,0.001228851,0.002365513,0.0002227648,0.0002780174,0.003893923,0.00009362863,0.26232293,0.15676059,0.43991056,0.13234928,0.00018696774],"about_ca_topic_score_codex":0.000102037484,"about_ca_topic_score_gemma":0.00009929002,"teacher_disagreement_score":0.0016018912,"about_ca_system_score_codex":0.00040531348,"about_ca_system_score_gemma":0.00074977824,"threshold_uncertainty_score":0.0067466497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13475685,0.0014122474,0.82731414,0.0006949479,0.00018476928,0.00021623132,0.00004902351,0.00025050354,0.035121232],"genre_scores_gemma":[0.9177901,0.00038702652,0.06929144,0.00007599818,0.000035412446,0.00016902873,0.000033911823,0.00005146597,0.012165602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968743,0.0001331009,0.000014509085,0.000030460546,0.00009076243,0.0000437006],"domain_scores_gemma":[0.9995689,0.00022543507,0.000050078554,0.0000328629,0.00009015395,0.000032535903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006761959,0.00063427864,0.00067598006,0.0005905511,0.00067550095,0.00092969055,0.0011902637,0.0009578226,0.003979328],"category_scores_gemma":[0.0018814317,0.0002574486,0.00035047784,0.0005646416,0.00045751562,0.0010044278,0.0008475832,0.0005622081,0.00034446875],"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.0001691625,0.00012724075,0.00044878156,0.00016016317,0.00007664483,0.00017300056,0.00025892316,0.82255214,0.004924398,0.091105886,0.0025696908,0.07743397],"study_design_scores_gemma":[0.000020727077,0.000052193813,0.00007749219,0.0000055654864,0.000011402661,0.000035957568,0.000028128401,0.9857314,0.0003981051,0.012722961,0.00091069913,0.000005354829],"about_ca_topic_score_codex":0.0017209748,"about_ca_topic_score_gemma":0.0012447123,"teacher_disagreement_score":0.003979328,"about_ca_system_score_codex":0.0005509838,"about_ca_system_score_gemma":0.000475531,"threshold_uncertainty_score":0.013312161},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01128387,0.00041121783,0.9829038,0.00014794456,0.000091977716,0.00004961788,0.000049274306,0.00009900204,0.004963253],"genre_scores_gemma":[0.8120823,0.0010321395,0.17178841,0.000227288,0.00040189672,0.00040651456,0.00030641668,0.00016563947,0.0135894185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989674,0.000159306,0.00006840221,0.0001571497,0.00057303335,0.00007473432],"domain_scores_gemma":[0.99820316,0.0006941084,0.00025153116,0.000079603036,0.0006605957,0.00011098904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013664503,0.001325415,0.00073863054,0.0011690882,0.0005379748,0.0016050395,0.0010424242,0.0013776126,0.003460686],"category_scores_gemma":[0.0046866154,0.00025875136,0.0005820698,0.00063364516,0.0007725246,0.0017844322,0.0016734296,0.0015321691,0.00057211396],"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.0003394487,0.00014575537,0.0010344455,0.0004934943,0.00010446482,0.00037841563,0.0005038538,0.2944565,0.07893702,0.44407633,0.007926714,0.17160347],"study_design_scores_gemma":[0.00001959484,0.0000920558,0.00032303578,0.000025404759,0.000015461992,0.00010237786,0.00003122923,0.93506736,0.0032255265,0.058556475,0.002512147,0.000029339666],"about_ca_topic_score_codex":0.00096378796,"about_ca_topic_score_gemma":0.001040317,"teacher_disagreement_score":0.003460686,"about_ca_system_score_codex":0.0009380892,"about_ca_system_score_gemma":0.0006008032,"threshold_uncertainty_score":0.011577129},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039329913,0.00092045957,0.94740456,0.00020573633,0.00021587772,0.00006851181,0.00003061041,0.00012543314,0.011698872],"genre_scores_gemma":[0.7054039,0.00047571937,0.28639776,0.00012253995,0.00016367613,0.0002582414,0.000073128205,0.0000741061,0.0070308675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996352,0.00013875791,0.000014557612,0.000041303745,0.0001485038,0.000021659009],"domain_scores_gemma":[0.99937797,0.0003444698,0.000051247396,0.000056763358,0.0001472425,0.000022241575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009028745,0.00047261966,0.00090609427,0.00063841365,0.0004810097,0.00077337463,0.0009113143,0.0011639888,0.0015707742],"category_scores_gemma":[0.0027620357,0.000334069,0.0005073816,0.0007425698,0.00044307063,0.0010971136,0.0010071041,0.0006919664,0.0002477513],"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.00015190677,0.00008885039,0.0006669632,0.00011326324,0.00007423006,0.00008561657,0.00006881546,0.8903753,0.0027851264,0.025917828,0.0014645057,0.07820754],"study_design_scores_gemma":[0.000015887088,0.000034065266,0.00008695238,0.0000047576114,0.000009355449,0.00001836308,0.0000038332378,0.9967715,0.00040130733,0.0021751118,0.00047504934,0.0000037640252],"about_ca_topic_score_codex":0.0013506224,"about_ca_topic_score_gemma":0.0010154644,"teacher_disagreement_score":0.0015707742,"about_ca_system_score_codex":0.0003832664,"about_ca_system_score_gemma":0.00043246386,"threshold_uncertainty_score":0.0052547455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08657462,0.00017091141,0.9084608,0.0003543999,0.00004131381,0.00003468599,0.000025614583,0.00011397561,0.0042237253],"genre_scores_gemma":[0.9760852,0.000102134814,0.022578416,0.000029559,0.00001789967,0.000038675676,0.000016927781,0.00001433653,0.001116897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974257,0.00009458936,0.000014313446,0.000044281172,0.000064641295,0.00003960909],"domain_scores_gemma":[0.99934155,0.00033352702,0.00013199108,0.00004853889,0.00010580444,0.0000385573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008020672,0.00057824794,0.000756797,0.0005312212,0.00074677943,0.0010832595,0.001210129,0.00089815963,0.00094672607],"category_scores_gemma":[0.0017431547,0.0002936787,0.0006146374,0.00044795935,0.00098028,0.0014373522,0.0006842209,0.0005951308,0.00009198503],"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.000030567968,0.000019386704,0.0002530791,0.000014134356,0.000019535812,0.000053355525,0.00005288541,0.98503417,0.00059412577,0.00979829,0.00013769322,0.003992794],"study_design_scores_gemma":[0.000002452227,0.0000041436006,0.0000422744,9.502737e-7,0.0000029348028,0.000002982077,0.000008034196,0.99701416,0.00007272097,0.0028113998,0.0000361797,0.000001726786],"about_ca_topic_score_codex":0.009665099,"about_ca_topic_score_gemma":0.0073681516,"teacher_disagreement_score":0.009665099,"about_ca_system_score_codex":0.0012229076,"about_ca_system_score_gemma":0.00073418865,"threshold_uncertainty_score":0.01921767},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011274984,0.00027946496,0.9849968,0.00029866947,0.00007137064,0.00005536882,0.000073766925,0.00009757853,0.0028520178],"genre_scores_gemma":[0.49442962,0.0007446509,0.50041944,0.00012347262,0.00017000388,0.00030955623,0.00018975373,0.00005073162,0.0035628262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99379843,0.002908706,0.0004722716,0.00070342707,0.0017657477,0.00035145515],"domain_scores_gemma":[0.9884886,0.008962397,0.0008230874,0.000948062,0.0005232855,0.0002545025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008426912,0.0011725829,0.002389269,0.0018564385,0.001215686,0.00494455,0.002010481,0.0017724178,0.0041310717],"category_scores_gemma":[0.022991804,0.0011730208,0.0032679169,0.0026532172,0.0026994017,0.007918915,0.0029183961,0.0023748023,0.00054686127],"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.00029777293,0.00008530662,0.00076200423,0.00018079815,0.0002106524,0.00031852108,0.0004507666,0.492144,0.0004271494,0.44037715,0.0013696607,0.06337631],"study_design_scores_gemma":[0.00002554708,0.000034618675,0.00012986801,0.000016542497,0.0000375771,0.00004596159,0.00004230051,0.576109,0.00030747277,0.422381,0.0008304366,0.000039697163],"about_ca_topic_score_codex":0.003062773,"about_ca_topic_score_gemma":0.0022452008,"teacher_disagreement_score":0.008426912,"about_ca_system_score_codex":0.0016629733,"about_ca_system_score_gemma":0.001358328,"threshold_uncertainty_score":0.044566333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004634625,0.0012182212,0.9919728,0.00014941546,0.0001451425,0.000025899,0.000048611182,0.00023678898,0.0015684481],"genre_scores_gemma":[0.48216197,0.0021329594,0.5079094,0.00014376038,0.0006558768,0.00022925842,0.00024030729,0.000101177,0.0064252187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893636,0.00048764603,0.00007922247,0.000121395984,0.0003270666,0.00004824757],"domain_scores_gemma":[0.9984841,0.0009240743,0.00009795599,0.0001789059,0.00028269162,0.000032364314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014934986,0.0008208573,0.0013412826,0.0010250171,0.00034681885,0.0015293617,0.00090272696,0.0012843503,0.0029528192],"category_scores_gemma":[0.007786679,0.0003715209,0.00070023985,0.0015632891,0.0006191818,0.0020066097,0.0010064101,0.0013988721,0.001471645],"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.00042480163,0.00010435449,0.000515363,0.0004944796,0.00014362147,0.00015808188,0.00009960672,0.21595779,0.0033680487,0.09371303,0.004742226,0.68027866],"study_design_scores_gemma":[0.000017361672,0.00006774234,0.0001644798,0.00003306502,0.000021546679,0.000060264498,0.000014210309,0.90852326,0.002026728,0.08564788,0.0034079934,0.000015499169],"about_ca_topic_score_codex":0.00067581394,"about_ca_topic_score_gemma":0.00030445564,"teacher_disagreement_score":0.0029528192,"about_ca_system_score_codex":0.00027974093,"about_ca_system_score_gemma":0.00033048494,"threshold_uncertainty_score":0.009878159},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024415562,0.00033720443,0.9702251,0.00036146614,0.00004880035,0.00006613647,0.0000736064,0.000058301248,0.0044138455],"genre_scores_gemma":[0.8026159,0.00073945994,0.18062349,0.00013745751,0.00012389483,0.00037377622,0.00026789017,0.000081772734,0.015036476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994429,0.0031649934,0.00026664833,0.0007321429,0.0010403487,0.00036692494],"domain_scores_gemma":[0.982206,0.013215738,0.0011593279,0.00074530224,0.002198667,0.00047498135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010251684,0.0015521167,0.0029730573,0.0023446488,0.0011411482,0.003548715,0.004610181,0.002535718,0.0061557246],"category_scores_gemma":[0.026063506,0.00092556607,0.002168835,0.002884808,0.002512435,0.007810448,0.0025807421,0.0028510874,0.0008474677],"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.00012070958,0.00006771032,0.0003497751,0.0001484565,0.00011857178,0.00007515563,0.00038054437,0.4789283,0.00043129802,0.4992828,0.00083360093,0.019263122],"study_design_scores_gemma":[0.00001451876,0.000028364637,0.00007717517,0.000010948231,0.000017391667,0.00001528432,0.00003482408,0.84527075,0.00008862965,0.15409966,0.00032525908,0.000017161254],"about_ca_topic_score_codex":0.005599698,"about_ca_topic_score_gemma":0.004198006,"teacher_disagreement_score":0.010251684,"about_ca_system_score_codex":0.0034252407,"about_ca_system_score_gemma":0.0016933461,"threshold_uncertainty_score":0.054216743},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008333225,0.0025145726,0.95478064,0.0019193339,0.0006909372,0.000102749305,0.0005164592,0.00017558655,0.030966472],"genre_scores_gemma":[0.26150265,0.0033735598,0.7132475,0.0010369957,0.0015553762,0.00060950144,0.0011517296,0.00016596439,0.01735661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978307,0.00073939736,0.00023971684,0.00047524765,0.00048395508,0.00023091739],"domain_scores_gemma":[0.9986274,0.0004255662,0.0001589732,0.00025456035,0.00037508155,0.00015844888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038117755,0.0011992342,0.0015668046,0.0034195012,0.0019006451,0.005518703,0.0019026725,0.0020024888,0.0052612065],"category_scores_gemma":[0.0036357362,0.000681549,0.0027075447,0.0034868042,0.0033656785,0.007520779,0.0024026427,0.0031740058,0.0013468664],"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.0000090863205,0.0000054356383,0.00002091011,0.000026434845,0.00000640974,0.000039036106,0.00014827425,0.0005187034,0.00022775454,0.9956791,0.0006458334,0.00267303],"study_design_scores_gemma":[0.000017895287,0.000028818644,0.00008277111,0.000049040824,0.000020152242,0.00007570902,0.000103709885,0.006664764,0.0002407384,0.96981937,0.022876317,0.000020708909],"about_ca_topic_score_codex":0.002373569,"about_ca_topic_score_gemma":0.0018206743,"teacher_disagreement_score":0.005518703,"about_ca_system_score_codex":0.0022076378,"about_ca_system_score_gemma":0.0010971862,"threshold_uncertainty_score":0.020158827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5068943,0.0020778885,0.47420755,0.003983134,0.00034701495,0.0007505427,0.00043678802,0.0002011561,0.011101615],"genre_scores_gemma":[0.83999556,0.0003678952,0.1577443,0.00016594915,0.000113835114,0.00041784314,0.00021681115,0.000027272063,0.0009506134],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9760985,0.018333567,0.00082261785,0.0006072578,0.0036388903,0.0004991048],"domain_scores_gemma":[0.95763975,0.03663044,0.0016279415,0.0007632944,0.0025025778,0.00083607103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018719468,0.0011136609,0.0018407992,0.0054126396,0.0018422717,0.005193944,0.0014090992,0.002064185,0.0027239397],"category_scores_gemma":[0.051132225,0.00036730475,0.0012451877,0.0032632062,0.003021613,0.004527742,0.0021064228,0.0026997663,0.0004141483],"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.004905794,0.0022813843,0.018580023,0.0024155537,0.0009582684,0.00067755533,0.0048401114,0.33202282,0.006255102,0.18974091,0.0069960714,0.43032634],"study_design_scores_gemma":[0.00028565835,0.0008308024,0.00392349,0.0004357876,0.00022557344,0.00007924779,0.001884281,0.65981543,0.002635897,0.32756633,0.002146131,0.00017133019],"about_ca_topic_score_codex":0.0015705768,"about_ca_topic_score_gemma":0.002591704,"teacher_disagreement_score":0.018719468,"about_ca_system_score_codex":0.0024375755,"about_ca_system_score_gemma":0.0021320041,"threshold_uncertainty_score":0.0989992},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076613806,0.024090217,0.84282535,0.042619828,0.0005702278,0.00007480388,0.0003324094,0.0002171026,0.01265624],"genre_scores_gemma":[0.8850016,0.026169254,0.0812789,0.0012383686,0.0013834479,0.00018449464,0.00018009868,0.00007808308,0.004485812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741757,0.001846598,0.00008943111,0.00019463744,0.0003492339,0.000102566126],"domain_scores_gemma":[0.98648536,0.011568056,0.0007333707,0.00040968534,0.00044893462,0.00035451894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005442609,0.0008393951,0.002115774,0.0009667455,0.0006841045,0.004768311,0.0030274494,0.0031558778,0.0012546477],"category_scores_gemma":[0.016044963,0.0007949607,0.0007293285,0.0013761132,0.0029967302,0.006516381,0.0019823932,0.002966406,0.00026813673],"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.000050039172,0.000085584936,0.0030593849,0.0002234963,0.0001575229,0.000095496194,0.00021457976,0.6699943,0.00023387479,0.29883447,0.0021833268,0.024867957],"study_design_scores_gemma":[0.00001624441,0.000013716093,0.00023127177,0.000025986013,0.000015492618,0.000025641759,0.000052727588,0.81082374,0.00005364386,0.18621653,0.0025109139,0.000014091075],"about_ca_topic_score_codex":0.007689958,"about_ca_topic_score_gemma":0.0047383946,"teacher_disagreement_score":0.007689958,"about_ca_system_score_codex":0.0016641429,"about_ca_system_score_gemma":0.0017314325,"threshold_uncertainty_score":0.02878356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09471186,0.00056140486,0.89964783,0.00025319803,0.00017853381,0.00023458383,0.00038602087,0.0015890527,0.0024375583],"genre_scores_gemma":[0.7512818,0.00031609618,0.24129382,0.00015594302,0.00026014334,0.00027402648,0.0023346534,0.00021780953,0.0038657254],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908686,0.00016282825,0.000090325055,0.00020499341,0.00035616144,0.00009893538],"domain_scores_gemma":[0.9985709,0.00042839325,0.00008510331,0.0002160254,0.0006366171,0.00006293421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009351105,0.00075858936,0.0016960972,0.0034028583,0.000890763,0.0012485957,0.0009021496,0.0008396555,0.0026912712],"category_scores_gemma":[0.003602042,0.00026194495,0.0015525756,0.003065841,0.0003431665,0.001064565,0.0008574332,0.00064273603,0.0014090046],"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.00089653244,0.0004475108,0.005842826,0.00019557048,0.00034063892,0.000203449,0.00007378526,0.026698107,0.03955876,0.0045084152,0.009076702,0.9121576],"study_design_scores_gemma":[0.00016285009,0.000634095,0.007883973,0.000028175065,0.00036438458,0.00051541993,0.00012305517,0.94964087,0.024722476,0.010813681,0.005056765,0.00005423733],"about_ca_topic_score_codex":0.0013383114,"about_ca_topic_score_gemma":0.0017544917,"teacher_disagreement_score":0.0034028583,"about_ca_system_score_codex":0.00032175574,"about_ca_system_score_gemma":0.00093019824,"threshold_uncertainty_score":0.009003162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5161607,0.04876592,0.22770545,0.07806775,0.00076642877,0.000117055155,0.0020427275,0.0006481756,0.1257258],"genre_scores_gemma":[0.97706497,0.009252058,0.009753834,0.0007179482,0.0005763602,0.000026115797,0.0002984599,0.000036691436,0.002273613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99632436,0.001509937,0.00017163987,0.0004201145,0.0012923104,0.00028162618],"domain_scores_gemma":[0.94698906,0.03808665,0.006248783,0.0036967492,0.0042288317,0.00074986607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048624887,0.00039813772,0.0005343991,0.004905396,0.0010153097,0.009484897,0.0010460035,0.0023042394,0.0035147218],"category_scores_gemma":[0.03197265,0.00036649627,0.00059832906,0.007729494,0.0035585894,0.018176643,0.0013388067,0.0029318084,0.00047346717],"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.00041328382,0.00018929689,0.022347422,0.00041531867,0.00012586932,0.00031697092,0.0011326812,0.011646872,0.0019376385,0.75201744,0.006007556,0.2034496],"study_design_scores_gemma":[0.00004461614,0.00024589125,0.026603423,0.0006522144,0.0002324482,0.001060622,0.0026438637,0.1173634,0.0067151873,0.7781795,0.06611187,0.00014693695],"about_ca_topic_score_codex":0.0016270548,"about_ca_topic_score_gemma":0.0012399955,"teacher_disagreement_score":0.009484897,"about_ca_system_score_codex":0.0023202067,"about_ca_system_score_gemma":0.0012786892,"threshold_uncertainty_score":0.02571559},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078469067,0.00024996,0.99690056,0.00046598446,0.000024276715,0.000019998983,0.000098544486,0.000086685744,0.0013693876],"genre_scores_gemma":[0.15171656,0.0028021536,0.83800995,0.0008221756,0.0005594615,0.00042303206,0.0005007229,0.00017995587,0.0049859695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961966,0.0020279146,0.00030535195,0.0005429685,0.0007837298,0.00014346035],"domain_scores_gemma":[0.9828965,0.014147183,0.0008564186,0.0010447521,0.00081272976,0.00024242242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051843566,0.0016715346,0.0020056178,0.004073199,0.0012989709,0.0045103407,0.0039492315,0.0036044952,0.00886152],"category_scores_gemma":[0.032963656,0.0014777868,0.0030935174,0.0039787255,0.003568072,0.009906871,0.0026243737,0.0045823585,0.0016303089],"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.00001278714,0.000025838468,0.00030129068,0.00016905567,0.00007311309,0.00012045497,0.00021730935,0.038736276,0.00043513812,0.93853754,0.0014733432,0.019897765],"study_design_scores_gemma":[0.0000057529214,0.0000050101553,0.000062008374,0.000019262092,0.000020017967,0.00004591931,0.000012820971,0.05915605,0.00006589335,0.9391666,0.0014291293,0.000011487209],"about_ca_topic_score_codex":0.006700749,"about_ca_topic_score_gemma":0.0057900515,"teacher_disagreement_score":0.00886152,"about_ca_system_score_codex":0.0018481859,"about_ca_system_score_gemma":0.0019029197,"threshold_uncertainty_score":0.029644728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007842682,0.0002717555,0.99024874,0.00007295948,0.000072046714,0.000052319116,0.00003587558,0.0004339329,0.00096973125],"genre_scores_gemma":[0.12222569,0.00024531077,0.87406975,0.000063937805,0.00004473166,0.00014620779,0.00014609961,0.00014115938,0.0029171226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992182,0.00016414444,0.00005356136,0.00021413146,0.00030279852,0.00004705724],"domain_scores_gemma":[0.9988663,0.00023405031,0.00007214116,0.0000912122,0.00070620683,0.000030113606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012458325,0.0008293932,0.0011640659,0.0014247538,0.001514074,0.00081584434,0.0016384295,0.0018864844,0.0021842665],"category_scores_gemma":[0.0024702696,0.00046116955,0.0010283533,0.0022267925,0.0004667126,0.0009445443,0.0005881764,0.0009860045,0.0012337598],"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.00026895307,0.00015284045,0.0008694464,0.00027052083,0.00014209919,0.000114422786,0.00020800164,0.38630494,0.02517484,0.009726186,0.0046366407,0.5721312],"study_design_scores_gemma":[0.000011269666,0.00003741307,0.0004714152,0.000010597449,0.000016963817,0.0000482736,0.000017920764,0.99142975,0.0048797172,0.0010755694,0.0019666413,0.000034410834],"about_ca_topic_score_codex":0.013142739,"about_ca_topic_score_gemma":0.010725525,"teacher_disagreement_score":0.013142739,"about_ca_system_score_codex":0.00077777647,"about_ca_system_score_gemma":0.0016100898,"threshold_uncertainty_score":0.026132464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029914383,0.00072439614,0.95277363,0.0007240725,0.000110800574,0.00017394146,0.0000996853,0.00037576052,0.015103186],"genre_scores_gemma":[0.7024884,0.0007673714,0.28228572,0.00023845737,0.00016626525,0.00040457924,0.0001906344,0.00018628337,0.013272273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681526,0.0015124432,0.00021084992,0.00049492385,0.00055261893,0.0004138735],"domain_scores_gemma":[0.9869708,0.010522938,0.00044940447,0.0012197536,0.00043706805,0.00039995112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051241643,0.0013173028,0.003357815,0.0012669162,0.0011268486,0.0033813189,0.003918265,0.004407225,0.006159305],"category_scores_gemma":[0.018883843,0.0010559276,0.001590969,0.0019297457,0.0038945875,0.010483451,0.0055707805,0.002803536,0.0007222693],"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.00025458276,0.00018262303,0.00051532494,0.00026539646,0.000107746,0.00014330397,0.00041617226,0.42238393,0.0006437929,0.52466667,0.0014309238,0.048989482],"study_design_scores_gemma":[0.000037965,0.00003610939,0.000058519396,0.000012364754,0.000017359445,0.000024000923,0.0000403376,0.69904697,0.00022781869,0.29978466,0.0006996288,0.000014214193],"about_ca_topic_score_codex":0.00452014,"about_ca_topic_score_gemma":0.0038050131,"teacher_disagreement_score":0.006159305,"about_ca_system_score_codex":0.0014888012,"about_ca_system_score_gemma":0.0032773067,"threshold_uncertainty_score":0.02709949},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04152048,0.00078332,0.95193505,0.00021481868,0.00025052272,0.00003573189,0.000026210208,0.0001311088,0.0051027415],"genre_scores_gemma":[0.9650846,0.000517668,0.030898316,0.00006135286,0.00007277639,0.00006550646,0.000031712643,0.00001175802,0.003256342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998135,0.00004047173,0.000012296523,0.00004205966,0.00006509745,0.000026618382],"domain_scores_gemma":[0.9996848,0.00015338726,0.00004409295,0.000017684026,0.0000867589,0.000013293849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043781055,0.000504655,0.0006947522,0.00025936094,0.00046084856,0.00082716317,0.000609517,0.00069720537,0.0011351877],"category_scores_gemma":[0.0010530308,0.00021500578,0.000505392,0.00041648894,0.0005034889,0.00046339602,0.00045755118,0.00078659144,0.00015963482],"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.00025412792,0.00006857787,0.0004016532,0.00017257944,0.000087046945,0.00011498233,0.00017511188,0.9023889,0.016676178,0.023382181,0.00076075905,0.05551795],"study_design_scores_gemma":[0.00001069163,0.000041015985,0.00010767623,0.0000056236904,0.000011189655,0.0000124933595,0.0000055572286,0.997544,0.00055769953,0.0014194441,0.00027895998,0.000005702921],"about_ca_topic_score_codex":0.007441587,"about_ca_topic_score_gemma":0.0055798884,"teacher_disagreement_score":0.007441587,"about_ca_system_score_codex":0.00055738736,"about_ca_system_score_gemma":0.00048014458,"threshold_uncertainty_score":0.014796555},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039187595,0.0013194251,0.89429694,0.0022610738,0.00068303366,0.000057242636,0.00021239354,0.00013226444,0.061850116],"genre_scores_gemma":[0.808126,0.0021150457,0.16289714,0.0010875766,0.0015562555,0.00019294705,0.0002277897,0.00027670537,0.023520675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944,0.00017543642,0.000038449245,0.000069492045,0.00022427429,0.000052317308],"domain_scores_gemma":[0.9976846,0.001260614,0.00019596479,0.00024905303,0.0003966454,0.00021311373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015224447,0.0008862477,0.00064573204,0.0019709535,0.00091946777,0.0019924073,0.0013105477,0.0018241509,0.004500992],"category_scores_gemma":[0.0067547844,0.0003667119,0.0009384222,0.0008758678,0.0021649862,0.0043801647,0.0020802727,0.002074378,0.0006936022],"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.0000023686098,0.0000036243412,0.000039420964,0.000015331321,0.000004026076,0.000051224928,0.000030451645,0.002132837,0.00044671062,0.99550664,0.00031691394,0.0014503512],"study_design_scores_gemma":[0.0000027487476,0.0000114793165,0.000116509924,0.000020798074,0.0000046814976,0.00013988459,0.000022099883,0.07390141,0.00026352445,0.92368716,0.001814499,0.000015343498],"about_ca_topic_score_codex":0.00058772945,"about_ca_topic_score_gemma":0.0005601021,"teacher_disagreement_score":0.004500992,"about_ca_system_score_codex":0.0009240307,"about_ca_system_score_gemma":0.0008770424,"threshold_uncertainty_score":0.015057266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14668438,0.0016435615,0.81881285,0.0008596744,0.001181596,0.0006452449,0.000497693,0.009201779,0.020473314],"genre_scores_gemma":[0.70747405,0.0008167571,0.25897104,0.0005641832,0.00040083574,0.00029475917,0.0005715309,0.000232917,0.030673891],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994124,0.00009639692,0.000043544904,0.00010056382,0.00029050306,0.000056695255],"domain_scores_gemma":[0.9993623,0.00010545647,0.000071207774,0.00018579564,0.00020859206,0.00006658793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045090725,0.0006442195,0.00086769485,0.0008434015,0.0006456856,0.0010912244,0.0009525629,0.0010701296,0.00615338],"category_scores_gemma":[0.0008126632,0.00027815663,0.00034865845,0.00057164766,0.00032900085,0.0015746639,0.00091275194,0.000716513,0.0045341384],"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.0013251823,0.00023319852,0.0016082138,0.0003372536,0.00007087845,0.00043158888,0.00015843038,0.0014253638,0.6727753,0.010310355,0.0060317386,0.30529255],"study_design_scores_gemma":[0.00022400571,0.0020085613,0.004913639,0.000100563484,0.00027650516,0.0050266422,0.000104231556,0.10550619,0.8234552,0.0043422696,0.05386489,0.00017726158],"about_ca_topic_score_codex":0.00018457942,"about_ca_topic_score_gemma":0.00023916388,"teacher_disagreement_score":0.00615338,"about_ca_system_score_codex":0.0002961643,"about_ca_system_score_gemma":0.00069449574,"threshold_uncertainty_score":0.02058506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12471051,0.0003795358,0.87312067,0.00014342373,0.000087980734,0.00002971606,0.00009735478,0.0005245723,0.00090621965],"genre_scores_gemma":[0.81625915,0.0002691938,0.17973179,0.00012321745,0.00011991607,0.00007999429,0.00036286845,0.00010392627,0.002950025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994259,0.0001785239,0.000026583155,0.00014960635,0.00013606469,0.000083405575],"domain_scores_gemma":[0.99902153,0.00045580007,0.00007079421,0.00015328563,0.0002460126,0.000052555686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008962811,0.00048526246,0.0008067517,0.00043446125,0.000393699,0.0004897684,0.0009516535,0.00074379327,0.00095925404],"category_scores_gemma":[0.002710874,0.00032061787,0.00061677577,0.00039301976,0.0002772062,0.0008065508,0.00091712124,0.0011392881,0.0004316599],"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.00038994907,0.00027555178,0.0039278995,0.000055292978,0.00019208631,0.00009023357,0.00015247094,0.47099233,0.04466584,0.0028235775,0.002747647,0.4736872],"study_design_scores_gemma":[0.0000021480248,0.000024929992,0.00064260355,0.0000020239806,0.000008481517,0.000017475306,0.00001025885,0.9960328,0.0023629402,0.000735499,0.00015639873,0.000004430027],"about_ca_topic_score_codex":0.003806226,"about_ca_topic_score_gemma":0.00602216,"teacher_disagreement_score":0.003806226,"about_ca_system_score_codex":0.00036932775,"about_ca_system_score_gemma":0.00034824503,"threshold_uncertainty_score":0.0075681806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118998215,0.0018214192,0.87199485,0.0001088619,0.000078050536,0.00021075373,0.00011415757,0.0007638281,0.005909861],"genre_scores_gemma":[0.48724756,0.0009483235,0.5093908,0.000058199264,0.00002815162,0.000116656964,0.00022365723,0.00015284293,0.0018338851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989893,0.0004282512,0.000070993134,0.00011817726,0.00030703258,0.00008630916],"domain_scores_gemma":[0.997741,0.0011211046,0.00007860269,0.0002520999,0.00075631705,0.000050833896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020229502,0.00073707866,0.0007417964,0.0019811748,0.00064506155,0.0011621951,0.0010206248,0.00092789007,0.0015701004],"category_scores_gemma":[0.0055506146,0.000259402,0.00074915256,0.0016759641,0.00032624693,0.001291018,0.00061197486,0.0002590698,0.0005027494],"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.0014871183,0.00038157604,0.0037237322,0.0006556641,0.0004889516,0.00011889731,0.00046937546,0.0778971,0.024377117,0.013364651,0.0013896613,0.8756462],"study_design_scores_gemma":[0.00018938316,0.0011979581,0.009905453,0.00010921788,0.00084471237,0.00046033118,0.0008272303,0.9075706,0.06540944,0.008167994,0.0051920316,0.0001255493],"about_ca_topic_score_codex":0.004241944,"about_ca_topic_score_gemma":0.006242004,"teacher_disagreement_score":0.004241944,"about_ca_system_score_codex":0.00040525262,"about_ca_system_score_gemma":0.0007037437,"threshold_uncertainty_score":0.010698497},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011849541,0.0030081982,0.99419594,0.000081727216,0.000046409594,0.000028207372,0.000083175815,0.0010244611,0.00034695645],"genre_scores_gemma":[0.046397634,0.00675345,0.94296783,0.00016834827,0.00029601375,0.00016653203,0.000825361,0.00047118688,0.0019537448],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775726,0.0005396,0.00021397669,0.00070361875,0.0006841307,0.000101402155],"domain_scores_gemma":[0.9931879,0.0035869924,0.00036603268,0.001653571,0.0010970351,0.00010833917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418055,0.0013950452,0.0027582939,0.002459379,0.00085373246,0.0018347662,0.00492011,0.0014519175,0.0027542962],"category_scores_gemma":[0.011864307,0.0011285293,0.0019382115,0.003793414,0.00069140806,0.003042211,0.0017370592,0.0030053686,0.0025562502],"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.000100898484,0.0000876877,0.0012327206,0.00048837473,0.00015203429,0.00005359235,0.00012211186,0.034067612,0.004634015,0.008086788,0.0034549492,0.9475193],"study_design_scores_gemma":[0.000035529163,0.00016029534,0.002388691,0.0002064898,0.00023424324,0.0007363917,0.00013133703,0.9124162,0.016147157,0.04475805,0.02265811,0.00012756456],"about_ca_topic_score_codex":0.0062418804,"about_ca_topic_score_gemma":0.0070282193,"teacher_disagreement_score":0.0062418804,"about_ca_system_score_codex":0.00080722006,"about_ca_system_score_gemma":0.0013696834,"threshold_uncertainty_score":0.012788057},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010961398,0.0007640261,0.9396316,0.004243919,0.000498554,0.00037648916,0.0006454335,0.0023177697,0.04056077],"genre_scores_gemma":[0.14191918,0.00047015172,0.8346708,0.0009951683,0.00027291873,0.00037938435,0.000828277,0.0007360244,0.019728176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973028,0.0007668993,0.00014244806,0.000566288,0.0007891183,0.00043242547],"domain_scores_gemma":[0.99458164,0.003306131,0.000197932,0.0011922976,0.00050117663,0.00022086322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032552164,0.0011588291,0.0018923329,0.0021749642,0.0017605325,0.003125111,0.0044247108,0.004324801,0.032624587],"category_scores_gemma":[0.019749105,0.0009552799,0.0019678813,0.002406312,0.00275391,0.0058585694,0.004694093,0.005044933,0.005938684],"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.000415753,0.00019303283,0.00032324268,0.0006576844,0.00008697345,0.00015608322,0.00037488493,0.034349587,0.0023590147,0.6498419,0.049100246,0.2621416],"study_design_scores_gemma":[0.00021043402,0.000078880264,0.00010037729,0.000090465655,0.000047818532,0.00018428928,0.000085323256,0.12790099,0.0014571679,0.85099316,0.018818738,0.00003226452],"about_ca_topic_score_codex":0.0016146917,"about_ca_topic_score_gemma":0.0022581436,"teacher_disagreement_score":0.032624587,"about_ca_system_score_codex":0.0018394389,"about_ca_system_score_gemma":0.0033145454,"threshold_uncertainty_score":0.10914004},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052966806,0.00059981574,0.98957586,0.00019929522,0.0001498996,0.00012240016,0.00041765367,0.0015153739,0.0021231466],"genre_scores_gemma":[0.12065541,0.00084685045,0.8741213,0.00019825005,0.00021152734,0.0002572053,0.00065055134,0.00017632557,0.002882576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985856,0.00033919976,0.00015566275,0.00016790196,0.00070011744,0.000051553878],"domain_scores_gemma":[0.99917245,0.00036083203,0.00007850495,0.00016772881,0.00018703597,0.00003348308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012820185,0.00061323197,0.001612996,0.002371825,0.00046391378,0.002108365,0.0011229599,0.00092100835,0.0030706497],"category_scores_gemma":[0.0041393777,0.00034945327,0.0016836181,0.0020614306,0.00065491156,0.0022944622,0.0011515953,0.0010846923,0.0010361164],"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.0005356157,0.00017319882,0.0009828099,0.0008066377,0.0002723807,0.0004842395,0.0003141134,0.20487955,0.01425438,0.17082205,0.014771944,0.5917031],"study_design_scores_gemma":[0.00010054477,0.00024802928,0.0007903852,0.00010026928,0.00015242027,0.0004447609,0.000064797576,0.8438249,0.007944222,0.1103215,0.035912573,0.0000955639],"about_ca_topic_score_codex":0.0012860132,"about_ca_topic_score_gemma":0.00085467857,"teacher_disagreement_score":0.0030706497,"about_ca_system_score_codex":0.00053074775,"about_ca_system_score_gemma":0.0007213981,"threshold_uncertainty_score":0.010272384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9030043,0.0002866407,0.065060735,0.0004146617,0.000047916536,0.00003445685,0.00043916938,0.00019274323,0.030519482],"genre_scores_gemma":[0.9791448,0.00016633318,0.0127691515,0.00004483894,0.00003397644,0.00003934152,0.00032273817,0.00004295545,0.0074358727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998597,0.00003914976,0.00000586547,0.000029933231,0.00003939342,0.000025942978],"domain_scores_gemma":[0.9990864,0.00041647334,0.00014389338,0.00004691151,0.0001463538,0.00016001295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013823352,0.00028257963,0.00031536023,0.0008272471,0.00048517084,0.0009774477,0.0005640566,0.00056846347,0.0059667733],"category_scores_gemma":[0.0012514128,0.00019063041,0.00021312192,0.00053659495,0.000617657,0.0008322468,0.00055984245,0.00044782466,0.0006402654],"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.0010776949,0.00013547856,0.0068647643,0.0002882054,0.00005850347,0.0006787324,0.0007404519,0.06599503,0.051763877,0.8051866,0.0070724497,0.060138296],"study_design_scores_gemma":[0.00008513205,0.00023137096,0.009984299,0.00004523162,0.00004079199,0.00074922165,0.00055500783,0.28479308,0.010154845,0.6851587,0.008159491,0.000042733536],"about_ca_topic_score_codex":0.0007649241,"about_ca_topic_score_gemma":0.0009784712,"teacher_disagreement_score":0.0059667733,"about_ca_system_score_codex":0.00039910027,"about_ca_system_score_gemma":0.00031326682,"threshold_uncertainty_score":0.01996088},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20107983,0.00012428993,0.79488546,0.00021834833,0.00014215651,0.00004221781,0.000026735444,0.00022797019,0.0032530876],"genre_scores_gemma":[0.9878271,0.00002564872,0.0110231275,0.000016627884,0.000024137036,0.00003432132,0.0000151019785,0.0000087349645,0.0010252079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974006,0.000050579765,0.000012482437,0.00009078322,0.00007087919,0.00003511978],"domain_scores_gemma":[0.999508,0.0001494605,0.00011968088,0.00007426493,0.00010829324,0.000040316885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005256151,0.0005430647,0.0005455015,0.00030231324,0.00062063284,0.0005182237,0.00077418383,0.00054878095,0.00081550266],"category_scores_gemma":[0.0012864517,0.00024880492,0.0004018718,0.00037532696,0.0007496361,0.0006151077,0.0010212726,0.00046945774,0.00015009008],"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.00089504186,0.00015652984,0.001459221,0.00013283046,0.00012128911,0.00024418495,0.00033902496,0.84611946,0.048821393,0.014173928,0.00093983853,0.086597204],"study_design_scores_gemma":[0.000090996014,0.00020583368,0.00048229113,0.0000035816095,0.000026449597,0.000016573327,0.000020944417,0.9937211,0.00237751,0.0027480999,0.00029797174,0.000008661831],"about_ca_topic_score_codex":0.0031377145,"about_ca_topic_score_gemma":0.0033028335,"teacher_disagreement_score":0.0031377145,"about_ca_system_score_codex":0.00045598543,"about_ca_system_score_gemma":0.0004955456,"threshold_uncertainty_score":0.006238878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077173844,0.0005589364,0.91931283,0.00024067657,0.00006275819,0.0000535281,0.00015965686,0.0013237312,0.0011139603],"genre_scores_gemma":[0.8244408,0.00050867186,0.16862912,0.00022708633,0.00013542848,0.00009739924,0.0009358222,0.00011808631,0.004907669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996642,0.00008501711,0.000013516652,0.00011775573,0.000071477654,0.0000481356],"domain_scores_gemma":[0.9991398,0.00041091235,0.00007910314,0.0001684228,0.00016198592,0.000039820952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076671096,0.0007237683,0.0010858636,0.0011718945,0.0002662935,0.0005353313,0.0012623583,0.0012184317,0.001006145],"category_scores_gemma":[0.002412135,0.00037223278,0.0006978655,0.000924856,0.0005926797,0.0014982012,0.0011829772,0.0011774971,0.0006488721],"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.00035667993,0.00030784615,0.002313157,0.0002061071,0.0002192016,0.00014991952,0.000107030115,0.3088263,0.03461742,0.0040693996,0.00436169,0.6444652],"study_design_scores_gemma":[0.0000052477994,0.00002902307,0.00063874386,0.000003958384,0.0000111200625,0.0000290182,0.0000124142625,0.9906557,0.0044476693,0.003884396,0.00027635795,0.000006275321],"about_ca_topic_score_codex":0.0035947226,"about_ca_topic_score_gemma":0.0032735425,"teacher_disagreement_score":0.0035947226,"about_ca_system_score_codex":0.00044512632,"about_ca_system_score_gemma":0.0005821463,"threshold_uncertainty_score":0.00714761},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089086354,0.003396632,0.8936645,0.0009978502,0.00014876242,0.000075507916,0.00012879362,0.00004385038,0.0124577265],"genre_scores_gemma":[0.7239176,0.002473662,0.26823008,0.00010859114,0.00017195752,0.0001662033,0.00007315663,0.00002201325,0.004836654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975084,0.0012840687,0.00013200527,0.00022053534,0.00073126785,0.00012367927],"domain_scores_gemma":[0.9893629,0.008984883,0.0006769212,0.00020358333,0.00056610233,0.00020562357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006238636,0.0007927276,0.0012044143,0.0022282328,0.0008935022,0.0030691847,0.0009790019,0.0013167966,0.0022664021],"category_scores_gemma":[0.015372369,0.00042653183,0.0011759138,0.0034466886,0.0021949771,0.00412149,0.0010522453,0.0014971658,0.0001594965],"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.00012254143,0.00015373716,0.0020865675,0.00039111444,0.00018740569,0.0004206948,0.00068428926,0.2819078,0.0011924922,0.6405261,0.0011101759,0.07121707],"study_design_scores_gemma":[0.000012428141,0.00006583358,0.001050315,0.00007491484,0.000037380356,0.00012149376,0.0003046234,0.43701217,0.00047944876,0.5591249,0.0016768337,0.00003971835],"about_ca_topic_score_codex":0.0015985697,"about_ca_topic_score_gemma":0.0018295428,"teacher_disagreement_score":0.006238636,"about_ca_system_score_codex":0.0015327439,"about_ca_system_score_gemma":0.00067807996,"threshold_uncertainty_score":0.032993495},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91751814,0.006350481,0.0037401547,0.0007992616,0.00008279161,0.000060686583,0.0077659977,0.000044584845,0.06363789],"genre_scores_gemma":[0.9862904,0.002365942,0.0014065268,0.000052630192,0.00003770123,0.000025331088,0.0069049653,0.000014616493,0.002901829],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99743193,0.0008814279,0.00019696764,0.00031120807,0.0008291051,0.00034930915],"domain_scores_gemma":[0.99470466,0.0017820001,0.001018742,0.0004640101,0.001709615,0.00032096473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023006026,0.00027206694,0.00035300016,0.015927186,0.00054707425,0.0021397064,0.00034841438,0.00020698593,0.004990247],"category_scores_gemma":[0.0073176334,0.00011986255,0.00053208903,0.032013875,0.000542851,0.002633339,0.001001324,0.00039536937,0.00036884344],"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.0002636209,0.000111426714,0.788323,0.000787116,0.0005303915,0.0007321766,0.0033265462,0.0028207554,0.0018782989,0.044564623,0.007483755,0.1491784],"study_design_scores_gemma":[0.000014052023,0.00012748443,0.93996483,0.00022756575,0.0002845676,0.00027818166,0.0067388765,0.0030900938,0.0027343957,0.0018573268,0.044651035,0.000031623567],"about_ca_topic_score_codex":0.023452926,"about_ca_topic_score_gemma":0.039951183,"teacher_disagreement_score":0.023452926,"about_ca_system_score_codex":0.0017193126,"about_ca_system_score_gemma":0.0014025765,"threshold_uncertainty_score":0.046632826},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038939337,0.0028463413,0.9853538,0.00082156784,0.00009412313,0.00018613716,0.000048109257,0.00025997325,0.0064959023],"genre_scores_gemma":[0.070369266,0.0039590336,0.9210905,0.00024822287,0.00011076509,0.00048874883,0.0002666219,0.0003058509,0.0031610257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.97576046,0.013257399,0.001850431,0.0028937634,0.005788413,0.0004495169],"domain_scores_gemma":[0.9204714,0.061224658,0.0026478088,0.008693653,0.006326529,0.0006360668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022898411,0.0014889863,0.0013729366,0.0073031094,0.0022676026,0.008537486,0.0040217238,0.0019062771,0.0056223315],"category_scores_gemma":[0.059879787,0.001628928,0.0028752952,0.0084123295,0.007524231,0.029476251,0.0048878794,0.0055239866,0.0015717413],"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.00007239128,0.00017127278,0.0025126815,0.001854487,0.00014756499,0.00011614643,0.0060317414,0.0029804162,0.0027342415,0.56096184,0.0025855615,0.41983166],"study_design_scores_gemma":[0.000084384716,0.00015829018,0.0026623907,0.0017720484,0.0001879355,0.0012359146,0.004741978,0.060623188,0.014273065,0.76748884,0.1465733,0.00019868695],"about_ca_topic_score_codex":0.0042816857,"about_ca_topic_score_gemma":0.0022483028,"teacher_disagreement_score":0.022898411,"about_ca_system_score_codex":0.0038986094,"about_ca_system_score_gemma":0.004233935,"threshold_uncertainty_score":0.12109977},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9300941,0.008301435,0.0037096424,0.0017175163,0.00013902466,0.00013864756,0.014640005,0.00022764574,0.041031905],"genre_scores_gemma":[0.97466135,0.0043350756,0.009683296,0.00017503374,0.000104851664,0.00011264659,0.006784786,0.00004211303,0.0041008242],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988815,0.00019073213,0.00019682792,0.0001551372,0.00045604314,0.00011967797],"domain_scores_gemma":[0.9865426,0.005426545,0.0033416834,0.0004398424,0.003784885,0.00046456506],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0015870513,0.00021160333,0.00025773153,0.036923017,0.0008473271,0.0022647046,0.00026015693,0.00030134866,0.0026443666],"category_scores_gemma":[0.0070500565,0.00013754731,0.00029947524,0.04050757,0.00047350055,0.001621519,0.00082980935,0.00022128469,0.00071073574],"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.00031687977,0.000086007516,0.6565674,0.0022762553,0.0001754642,0.0005809443,0.011131677,0.00049171236,0.011922438,0.0066749593,0.015428472,0.29434785],"study_design_scores_gemma":[0.000010627215,0.00007430055,0.905708,0.00045263846,0.00011575345,0.0006109061,0.03053807,0.00069677434,0.0028075723,0.0014218405,0.057520363,0.00004310714],"about_ca_topic_score_codex":0.007157023,"about_ca_topic_score_gemma":0.018508611,"teacher_disagreement_score":0.963077,"about_ca_system_score_codex":0.0009454789,"about_ca_system_score_gemma":0.0020708416,"threshold_uncertainty_score":0.014230728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07008199,0.01466893,0.51772285,0.09834567,0.009462086,0.0018151416,0.0013311985,0.0036915336,0.28288066],"genre_scores_gemma":[0.76990724,0.0062679863,0.17300946,0.01563467,0.0061310357,0.0016378469,0.0011396587,0.0009010827,0.025371052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.82606626,0.05054095,0.020830674,0.01806071,0.07900568,0.0054957173],"domain_scores_gemma":[0.5636942,0.17381276,0.015589273,0.07878057,0.16227844,0.0058447677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.11361583,0.0006559104,0.0013255317,0.0066030864,0.009229807,0.02181827,0.0055589667,0.0064602136,0.006468817],"category_scores_gemma":[0.3423546,0.0011023155,0.0014857202,0.0044198865,0.017631501,0.036094576,0.009192516,0.011495268,0.004124795],"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.00026571838,0.00009097166,0.003523061,0.00043462485,0.000049195158,0.00034851523,0.002764461,0.0009581391,0.0020666022,0.87630814,0.0339541,0.079236455],"study_design_scores_gemma":[0.0003849495,0.00038846966,0.0064490153,0.001789898,0.00027299495,0.0018751139,0.0043282425,0.01877723,0.018440517,0.6784071,0.26833993,0.00054666563],"about_ca_topic_score_codex":0.0073144124,"about_ca_topic_score_gemma":0.002410824,"teacher_disagreement_score":0.11361583,"about_ca_system_score_codex":0.007472984,"about_ca_system_score_gemma":0.015313255,"threshold_uncertainty_score":0.6008651},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31324708,0.252863,0.05877793,0.17402756,0.0040475605,0.00032359303,0.0009863507,0.00023349437,0.19549339],"genre_scores_gemma":[0.8458625,0.12267659,0.019489208,0.0043330397,0.0017148637,0.00017093588,0.00029390282,0.000039647304,0.0054192888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951806,0.0018416361,0.00046072048,0.0009917909,0.0012630562,0.0002620691],"domain_scores_gemma":[0.96932364,0.017950306,0.0047315448,0.0013890102,0.005531581,0.0010739433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009751678,0.0003861429,0.00042680063,0.0071146013,0.0019918724,0.0075062066,0.0012013962,0.0020433997,0.0033215233],"category_scores_gemma":[0.0161853,0.00031656455,0.0004992247,0.010956657,0.0079200985,0.020394249,0.001973579,0.004691556,0.0003875441],"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.00014425408,0.00025466483,0.049165957,0.0020464067,0.00005663387,0.00055475824,0.014364168,0.00075092545,0.0011887678,0.63190866,0.006450101,0.2931146],"study_design_scores_gemma":[0.000052168547,0.0007934226,0.10470239,0.0059655337,0.00027743116,0.006779811,0.08604392,0.0070754495,0.0070017125,0.32689303,0.45415998,0.0002551807],"about_ca_topic_score_codex":0.0020377822,"about_ca_topic_score_gemma":0.0011007154,"teacher_disagreement_score":0.009751678,"about_ca_system_score_codex":0.004513007,"about_ca_system_score_gemma":0.0057188394,"threshold_uncertainty_score":0.051572442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9780797,0.00061087543,0.00020769327,0.00045891549,0.000009995541,0.000027621852,0.0001509556,0.000016242695,0.020438079],"genre_scores_gemma":[0.99842,0.00016793257,0.000047711295,0.00003726402,0.0000040650825,0.000006034826,0.00008648732,0.0000023769217,0.0012280968],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987386,0.00031697942,0.00007871325,0.00011208126,0.00033249558,0.00042109293],"domain_scores_gemma":[0.99828315,0.0002115575,0.00039816968,0.00010041724,0.0006456778,0.0003609796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015448328,0.00013025073,0.00022202502,0.0035877135,0.0013848012,0.002892953,0.00042237077,0.00018434144,0.003491196],"category_scores_gemma":[0.0025515228,0.000106924366,0.00025452158,0.00520858,0.0009359417,0.0010178563,0.0014620022,0.0002154585,0.00022587826],"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.0003137727,0.00015985385,0.82775205,0.0002974386,0.00026138054,0.0008581918,0.015190768,0.0050929002,0.0020407876,0.050827462,0.0033819124,0.09382363],"study_design_scores_gemma":[0.00002079166,0.00011496231,0.966969,0.00006976794,0.000066376895,0.00009456407,0.012627086,0.0019187349,0.000843174,0.00089863833,0.016350826,0.000026062373],"about_ca_topic_score_codex":0.09243795,"about_ca_topic_score_gemma":0.09012741,"teacher_disagreement_score":0.09243795,"about_ca_system_score_codex":0.008306633,"about_ca_system_score_gemma":0.006826259,"threshold_uncertainty_score":0.1837998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19197737,0.006204758,0.005975639,0.054735493,0.00018714066,0.00093404506,0.0025228912,0.00013856792,0.737324],"genre_scores_gemma":[0.8616356,0.005476781,0.01426807,0.0025881277,0.000026427253,0.00047027392,0.0012355401,0.000055064836,0.11424411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9977036,0.00050379045,0.000056796485,0.0001066948,0.0006831607,0.0009458781],"domain_scores_gemma":[0.9977208,0.0003552629,0.00008240365,0.00005516782,0.0012712696,0.0005149914],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012355237,0.00039686015,0.0002501405,0.0024371615,0.010550634,0.01030405,0.0009736426,0.001383267,0.00450302],"category_scores_gemma":[0.0023464186,0.0002111724,0.0002969735,0.00630694,0.002994084,0.00200216,0.0023217273,0.0009855011,0.00043357344],"study_design_candidate":"qualitative","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.000059710703,0.00015020579,0.026222514,0.00049654994,0.000027870941,0.0013186324,0.02481917,0.0029286318,0.0009809987,0.7501411,0.11006037,0.082794234],"study_design_scores_gemma":[0.000050791492,0.000071137205,0.045057196,0.00036016203,0.000042397267,0.00023722198,0.097739935,0.003529817,0.0011677899,0.018632557,0.8330056,0.00010547814],"about_ca_topic_score_codex":0.9871156,"about_ca_topic_score_gemma":0.99323326,"teacher_disagreement_score":0.98969597,"about_ca_system_score_codex":0.13230741,"about_ca_system_score_gemma":0.1908685,"threshold_uncertainty_score":0.95996195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22676614,0.0014143096,0.7443666,0.0035587936,0.00065643236,0.0005911242,0.0016702062,0.0068259956,0.0141504835],"genre_scores_gemma":[0.9586146,0.0003638492,0.035293777,0.00019226238,0.00014417348,0.000074320524,0.00045455302,0.00012243875,0.004740008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614835,0.00058583234,0.00035333968,0.00045750066,0.001614191,0.0008409225],"domain_scores_gemma":[0.993396,0.0012625234,0.00054990716,0.00331131,0.0010281932,0.00045207504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002921149,0.0005498587,0.0016714296,0.0010623544,0.002330467,0.0043422566,0.0021125376,0.0014322542,0.003445411],"category_scores_gemma":[0.006352397,0.00047048478,0.0007913947,0.0026443414,0.0011627787,0.0059718634,0.0039747325,0.0018334236,0.0017696813],"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.006475492,0.00096916925,0.009461411,0.0007699876,0.0003255312,0.0028341732,0.0012023452,0.09379571,0.141064,0.38856184,0.040740933,0.31379935],"study_design_scores_gemma":[0.00027713482,0.00039562656,0.0016584417,0.00005132882,0.00015336266,0.0014401834,0.00075241865,0.71606517,0.09588735,0.15687725,0.026292,0.00014979416],"about_ca_topic_score_codex":0.002433245,"about_ca_topic_score_gemma":0.0019554445,"teacher_disagreement_score":0.0043422566,"about_ca_system_score_codex":0.0017395158,"about_ca_system_score_gemma":0.0033863604,"threshold_uncertainty_score":0.015448689},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34896547,0.0034630767,0.62153655,0.0019582205,0.00022562903,0.0001883239,0.00026217545,0.0004666367,0.022933897],"genre_scores_gemma":[0.8782721,0.0005966937,0.11858578,0.00009563748,0.00006681611,0.00006465135,0.0001331367,0.00004208324,0.0021430403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928826,0.0002453378,0.000078112025,0.00011381707,0.0002105339,0.00006400465],"domain_scores_gemma":[0.9978806,0.0010073911,0.00025035613,0.00047436688,0.0002663708,0.00012097197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012644093,0.0002315623,0.0005710824,0.0023456619,0.00092253345,0.0030477392,0.0005277766,0.00069510756,0.002757511],"category_scores_gemma":[0.0077999453,0.00025874889,0.000536167,0.0024269845,0.0027693245,0.004660429,0.0014749715,0.0006847333,0.00027860122],"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.00024292906,0.00008292919,0.005670147,0.00032484613,0.0000919495,0.0002770832,0.0035117716,0.028292235,0.004796247,0.7856171,0.0022430455,0.16884981],"study_design_scores_gemma":[0.00001617751,0.000044383203,0.0036676521,0.000047847745,0.000037228092,0.00013481006,0.0008348489,0.04079944,0.0010715231,0.94949675,0.0038187667,0.000030651514],"about_ca_topic_score_codex":0.0015452286,"about_ca_topic_score_gemma":0.0011959854,"teacher_disagreement_score":0.0030477392,"about_ca_system_score_codex":0.0007217894,"about_ca_system_score_gemma":0.0005605785,"threshold_uncertainty_score":0.009224832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09948673,0.00069215224,0.86614317,0.0006686779,0.00080569845,0.00011115144,0.000061989114,0.00085752324,0.031172983],"genre_scores_gemma":[0.95277184,0.00015866426,0.036044545,0.00008127337,0.00010944248,0.000057196426,0.00003246859,0.000036713496,0.010707877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998018,0.000030878793,0.000011443683,0.000033978216,0.00008929403,0.000032641703],"domain_scores_gemma":[0.9997266,0.000060848255,0.00003428742,0.000048805832,0.00009840318,0.0000309764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002506385,0.0004895283,0.00040489272,0.0005178615,0.00046396285,0.0009827637,0.0005040029,0.0005212908,0.0025386624],"category_scores_gemma":[0.00056829874,0.00016655317,0.0002699402,0.0003020332,0.000593302,0.00044985392,0.00061348797,0.0004279758,0.00045228307],"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.0016424375,0.00046605655,0.00188499,0.000778156,0.00013287591,0.00042228316,0.00056659366,0.21370846,0.2552358,0.072226785,0.005764921,0.4471706],"study_design_scores_gemma":[0.00038393907,0.0010664419,0.002497027,0.00004354327,0.000058024674,0.00019615273,0.00011521264,0.93469673,0.03694964,0.009389228,0.014533019,0.00007102785],"about_ca_topic_score_codex":0.0015583246,"about_ca_topic_score_gemma":0.0017467072,"teacher_disagreement_score":0.0025386624,"about_ca_system_score_codex":0.00033134464,"about_ca_system_score_gemma":0.00048127663,"threshold_uncertainty_score":0.008492649},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020992942,0.00074396416,0.97276354,0.00018889512,0.00013131436,0.00020126025,0.000103858685,0.00010937531,0.004764864],"genre_scores_gemma":[0.42691225,0.00076995627,0.5681703,0.000094267256,0.00007797678,0.0008094946,0.00022425165,0.000053100182,0.0028884143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99285275,0.0038314802,0.00038306433,0.00055533356,0.0020647396,0.0003125927],"domain_scores_gemma":[0.99370897,0.00400768,0.0003171978,0.00034139658,0.0014866727,0.00013809641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071452917,0.0011656504,0.0026630003,0.004893331,0.0012308413,0.0029847925,0.0023673465,0.0013601481,0.0032265673],"category_scores_gemma":[0.017937325,0.00054277596,0.0030901397,0.0046332045,0.0010489074,0.0019571697,0.0027597554,0.0015080839,0.00047493534],"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.0004601616,0.00035857904,0.0023000403,0.0016328862,0.0011643183,0.00040955187,0.0008605137,0.3494812,0.003506181,0.28252783,0.002614764,0.354684],"study_design_scores_gemma":[0.000028576429,0.00018410388,0.0005453107,0.000082719314,0.00013131,0.000078075245,0.00014990967,0.92257214,0.00059219194,0.07405968,0.0015229482,0.000053059244],"about_ca_topic_score_codex":0.0055875746,"about_ca_topic_score_gemma":0.006132091,"teacher_disagreement_score":0.0071452917,"about_ca_system_score_codex":0.0022208008,"about_ca_system_score_gemma":0.0034325207,"threshold_uncertainty_score":0.03778833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62117404,0.0010247802,0.36827368,0.00065910124,0.000407156,0.0000919284,0.00007623756,0.00066443003,0.007628691],"genre_scores_gemma":[0.9909924,0.000051328374,0.008142283,0.000018724257,0.000029232444,0.000011326864,0.00001580474,0.000019435345,0.00071957125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993006,0.00028408703,0.000034066183,0.000094999734,0.00016386376,0.00012227733],"domain_scores_gemma":[0.99869174,0.0005258332,0.00016317166,0.00023101638,0.0002472297,0.00014092137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011585878,0.0001942576,0.00037562905,0.00034470035,0.00061603176,0.0011720714,0.0006943922,0.00031234266,0.0010385163],"category_scores_gemma":[0.002571993,0.00021356964,0.00015450577,0.0004734487,0.00044084634,0.001031147,0.0005840075,0.00039224327,0.00013047199],"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.00082379335,0.00038041663,0.008026148,0.00014069283,0.00011071991,0.0002173309,0.00028953035,0.81391615,0.022321146,0.060133044,0.0041744416,0.08946665],"study_design_scores_gemma":[0.00001115619,0.00004922469,0.0007601813,0.0000025942693,0.000008066576,0.000025900505,0.000040929917,0.98963225,0.0013590744,0.0074317497,0.00067427085,0.000004621011],"about_ca_topic_score_codex":0.0016004834,"about_ca_topic_score_gemma":0.0019099177,"teacher_disagreement_score":0.0016004834,"about_ca_system_score_codex":0.00072736037,"about_ca_system_score_gemma":0.0013190988,"threshold_uncertainty_score":0.006127298},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6079813,0.03806808,0.004145121,0.004146655,0.000978367,0.00022674215,0.29191092,0.000447113,0.052095745],"genre_scores_gemma":[0.77948076,0.023489045,0.00430505,0.0007615463,0.001440855,0.00023236685,0.16940725,0.00030233688,0.020580871],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9966582,0.00027470704,0.0007139881,0.00041458724,0.0016229193,0.00031560802],"domain_scores_gemma":[0.96847343,0.0062302756,0.0101263095,0.0031821635,0.010660991,0.0013268609],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0033205037,0.0005663913,0.0006806977,0.029744968,0.0008845802,0.002808987,0.0007704235,0.00069300155,0.0031492766],"category_scores_gemma":[0.02692447,0.00034092966,0.0008009623,0.051159523,0.00080440816,0.0027349123,0.0018930734,0.0009323588,0.0036285836],"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.0011793567,0.00021113124,0.7333357,0.0022343523,0.00064459315,0.00090571394,0.0020348453,0.001316035,0.0017094368,0.005827375,0.064032376,0.18656908],"study_design_scores_gemma":[0.00001441713,0.00010088769,0.77706724,0.0007768211,0.0003539589,0.0007797325,0.0007649763,0.00036756127,0.0025369092,0.0009261089,0.2162664,0.000045051063],"about_ca_topic_score_codex":0.03083964,"about_ca_topic_score_gemma":0.03813508,"teacher_disagreement_score":0.970255,"about_ca_system_score_codex":0.002049643,"about_ca_system_score_gemma":0.0041629793,"threshold_uncertainty_score":0.061320305},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119497344,0.00040568865,0.86136365,0.0011159619,0.000100175996,0.00037932539,0.00031501387,0.00028991504,0.016532829],"genre_scores_gemma":[0.9251914,0.00034400407,0.06839218,0.00008092789,0.000038012196,0.0002700953,0.0001389303,0.000039682458,0.005504658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923825,0.00023872856,0.000026067377,0.0002395313,0.00012872436,0.00012866287],"domain_scores_gemma":[0.9988551,0.00048075113,0.00024156999,0.00004394846,0.00023078793,0.00014779135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010437061,0.0009922457,0.0013916297,0.0012474938,0.0012729579,0.0021319685,0.0015409222,0.0028110354,0.0053671207],"category_scores_gemma":[0.0023949016,0.0010160393,0.0010672372,0.0010488379,0.001147101,0.0015889442,0.0017768204,0.0008348102,0.00040107494],"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.00005930389,0.000024087682,0.00030385473,0.00005401684,0.000021424232,0.00012364259,0.000031816307,0.98857415,0.0012933175,0.0041953856,0.0001963228,0.005122603],"study_design_scores_gemma":[0.000013625042,0.000047064193,0.000092351045,0.0000067115125,0.000017618246,0.000015849053,0.0000187134,0.9973959,0.0002749898,0.0018208968,0.00028936611,0.0000069261177],"about_ca_topic_score_codex":0.008682123,"about_ca_topic_score_gemma":0.0064331605,"teacher_disagreement_score":0.008682123,"about_ca_system_score_codex":0.0023941442,"about_ca_system_score_gemma":0.0023079836,"threshold_uncertainty_score":0.017954826},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118543185,0.0033734033,0.8121131,0.0011176819,0.0011236595,0.00017056474,0.00085871364,0.00039043775,0.06230919],"genre_scores_gemma":[0.61844903,0.0040159468,0.35297006,0.00039540793,0.00054581906,0.0006605608,0.00070003996,0.00012365752,0.022139488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989981,0.00029252618,0.000094069655,0.00020871976,0.00029372095,0.00011288854],"domain_scores_gemma":[0.99836975,0.0007580755,0.00027378567,0.00013717375,0.00036070394,0.000100574034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011636191,0.0011558969,0.000633985,0.0038416493,0.0006304714,0.003185886,0.0010169786,0.000727584,0.003873558],"category_scores_gemma":[0.0041238507,0.00018559665,0.00057999935,0.003312251,0.0017936707,0.002730933,0.0010672596,0.0011659208,0.0014300558],"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.00014714914,0.000057003297,0.0007803381,0.00022304268,0.000053164746,0.00026912036,0.0002617135,0.00597887,0.008405867,0.91385126,0.0021257037,0.067846864],"study_design_scores_gemma":[0.000060786864,0.00021262582,0.0016895358,0.00022939914,0.00006466028,0.00096669066,0.00037816586,0.043643292,0.006720817,0.8902644,0.055687543,0.00008215589],"about_ca_topic_score_codex":0.00037493178,"about_ca_topic_score_gemma":0.0003697979,"teacher_disagreement_score":0.003873558,"about_ca_system_score_codex":0.0010134681,"about_ca_system_score_gemma":0.00063771184,"threshold_uncertainty_score":0.012958348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046525104,0.00013906146,0.994422,0.00011256804,0.000019882973,0.000013814074,0.000012381699,0.0001801397,0.00044769642],"genre_scores_gemma":[0.28082484,0.00031232327,0.7152293,0.0001304143,0.000108603366,0.00015574765,0.00011122188,0.00024404435,0.0028835144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930227,0.00030560943,0.000042163345,0.00011551219,0.00019177828,0.00004267354],"domain_scores_gemma":[0.99805546,0.0013092324,0.0001187938,0.00023271544,0.00024845634,0.000035414832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017037798,0.0005712904,0.0011563683,0.0010343139,0.00044561946,0.0010767289,0.001107119,0.0011756775,0.0016662048],"category_scores_gemma":[0.006328037,0.0006051176,0.0011338887,0.0009578536,0.0006065212,0.001569369,0.0011895949,0.0013912785,0.00040946697],"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.00008000044,0.00014752905,0.0012988675,0.00012715216,0.00011656537,0.00010198856,0.000072066796,0.5431708,0.0054528415,0.071219824,0.0018408791,0.37637144],"study_design_scores_gemma":[0.000003570668,0.000014455786,0.00009230944,0.000004036361,0.0000057714583,0.0000129956925,0.0000023944594,0.98849595,0.0003991601,0.01064322,0.0003223256,0.0000037009088],"about_ca_topic_score_codex":0.0021949208,"about_ca_topic_score_gemma":0.0028697485,"teacher_disagreement_score":0.0021949208,"about_ca_system_score_codex":0.0006952159,"about_ca_system_score_gemma":0.0009959722,"threshold_uncertainty_score":0.009010553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010079529,0.00013301501,0.9887177,0.000046167777,0.000022743774,0.000023713292,0.000009842304,0.00009363123,0.0008736138],"genre_scores_gemma":[0.36897835,0.00030456923,0.62604123,0.00010674901,0.00006666118,0.0001771049,0.00008133422,0.000096948344,0.004147017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996717,0.00009917539,0.000019694256,0.00006125982,0.00011647865,0.00003180604],"domain_scores_gemma":[0.99926144,0.0004074933,0.00007914364,0.000054890406,0.00016813276,0.00002904399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008789175,0.000638417,0.00089225674,0.0007940665,0.00039270497,0.0007383047,0.0010358553,0.0007570202,0.0012664407],"category_scores_gemma":[0.0023306357,0.00029342598,0.0006962101,0.00074257865,0.00059421454,0.0012183872,0.0009552253,0.0007855772,0.0002520615],"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.00014923245,0.00015748835,0.0009653544,0.00013813715,0.00013600527,0.000074692085,0.00010564862,0.7561162,0.008747939,0.04657105,0.0011037712,0.1857344],"study_design_scores_gemma":[0.0000055604173,0.000018753957,0.000060319348,0.0000023621856,0.00000651162,0.000009260307,0.0000033238282,0.99761957,0.00059626845,0.0015485301,0.00012558809,0.0000039307088],"about_ca_topic_score_codex":0.0027382816,"about_ca_topic_score_gemma":0.0033379886,"teacher_disagreement_score":0.0027382816,"about_ca_system_score_codex":0.00058728934,"about_ca_system_score_gemma":0.0007938115,"threshold_uncertainty_score":0.0054447055},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009509505,0.95800513,0.002426367,0.015041531,0.0014425071,0.000059245416,0.002330341,0.00019327534,0.010992131],"genre_scores_gemma":[0.055934053,0.92366225,0.004698047,0.0046205767,0.006221545,0.00011008707,0.003055237,0.00012174156,0.0015764855],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.98897934,0.0026428204,0.0022338452,0.0011202911,0.004566234,0.00045739263],"domain_scores_gemma":[0.93185365,0.044843134,0.007212593,0.0024687422,0.011290373,0.0023314941],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.015771668,0.001214218,0.003424079,0.10091137,0.001693268,0.013566029,0.0014536198,0.0021762517,0.0033913609],"category_scores_gemma":[0.047889482,0.00087980786,0.001594492,0.15089975,0.0024247747,0.01925655,0.005136043,0.0019378563,0.0012703551],"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.00021961676,0.00021713683,0.036878128,0.01554339,0.0010891573,0.0001670589,0.0014518073,0.0010129461,0.00077931926,0.02937836,0.089147635,0.8241154],"study_design_scores_gemma":[0.000040123483,0.00023454844,0.12869272,0.020184368,0.0011077768,0.0010973733,0.0033019618,0.0015851296,0.0007436442,0.047350116,0.79547167,0.00019057671],"about_ca_topic_score_codex":0.003921311,"about_ca_topic_score_gemma":0.007159029,"teacher_disagreement_score":0.8990886,"about_ca_system_score_codex":0.004133654,"about_ca_system_score_gemma":0.005766591,"threshold_uncertainty_score":0.08340955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053015123,0.00028530537,0.99070764,0.000046872297,0.00007795679,0.000027246975,0.00016489012,0.002750824,0.0006378436],"genre_scores_gemma":[0.3704944,0.0010648872,0.61275184,0.00018025443,0.00019371373,0.0002216043,0.0015701269,0.00060581596,0.012917371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996407,0.000059621736,0.000024700612,0.000121796176,0.00010053596,0.00005266721],"domain_scores_gemma":[0.99965584,0.00010897724,0.000023760234,0.000068675974,0.00010975688,0.000033018885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032131953,0.00057080074,0.00104976,0.00046395292,0.00032085084,0.00062910496,0.0009162369,0.000737947,0.004247865],"category_scores_gemma":[0.00076932635,0.00036791438,0.00076259545,0.00067937886,0.00024435416,0.00093725475,0.0006953027,0.0010521455,0.0030862892],"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.00042420326,0.0002204526,0.0008852747,0.00021133297,0.00012744831,0.00022339863,0.00009994599,0.111915395,0.088882335,0.007627609,0.0063063647,0.78307617],"study_design_scores_gemma":[0.0000085076845,0.00006979592,0.0006398469,0.0000110487845,0.000027980912,0.00008775458,0.000013578307,0.9834819,0.0115704555,0.0017690486,0.0022971102,0.000022939772],"about_ca_topic_score_codex":0.011196926,"about_ca_topic_score_gemma":0.014757254,"teacher_disagreement_score":0.011196926,"about_ca_system_score_codex":0.00033610614,"about_ca_system_score_gemma":0.0009384552,"threshold_uncertainty_score":0.022263467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21133444,0.0006547823,0.7659005,0.00091125304,0.000137871,0.0001466008,0.00032180603,0.00019028739,0.02040244],"genre_scores_gemma":[0.93404514,0.0003467973,0.053258084,0.000087614615,0.000035921457,0.00014955318,0.00020004547,0.00008306641,0.011793789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971014,0.000094280185,0.000010183202,0.000050364015,0.000057218138,0.00007781399],"domain_scores_gemma":[0.999204,0.0005090453,0.000114849376,0.000025298063,0.000087561406,0.00005935463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009902894,0.0008938288,0.0010168629,0.0008778759,0.0004918808,0.0013719316,0.0013039836,0.0021734692,0.0032615021],"category_scores_gemma":[0.0023314084,0.0008477577,0.0010448373,0.00085030193,0.0006473538,0.0010571484,0.0008970799,0.0012055511,0.00025591516],"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.0000046996142,0.0000060696543,0.00005497836,0.000005233108,0.0000039836414,0.000010255635,0.0000029217742,0.99863064,0.000061675586,0.0006793074,0.000035016634,0.000505267],"study_design_scores_gemma":[0.000002205365,0.0000040909476,0.000027005999,0.0000011195425,0.0000017319867,0.0000017630977,0.0000028665183,0.99955827,0.00002242633,0.00033207415,0.00004551028,9.625718e-7],"about_ca_topic_score_codex":0.02038119,"about_ca_topic_score_gemma":0.011366342,"teacher_disagreement_score":0.02038119,"about_ca_system_score_codex":0.0013726498,"about_ca_system_score_gemma":0.0016686432,"threshold_uncertainty_score":0.04052508},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080987636,0.000069489186,0.9978942,0.000067396715,0.000025477997,0.000020565525,0.00003711827,0.0002792342,0.0007966204],"genre_scores_gemma":[0.25565118,0.00043114065,0.73750126,0.0004704958,0.00020000686,0.00030395578,0.0004001028,0.00044094308,0.0046008667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973502,0.0008309852,0.00014632285,0.00030354183,0.0012250645,0.00014381166],"domain_scores_gemma":[0.9956398,0.0024868224,0.00025190393,0.000517248,0.0009647811,0.00013943492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035007328,0.0011008332,0.002311204,0.0013661315,0.00060974323,0.0024268853,0.0042812503,0.0016966213,0.0061499164],"category_scores_gemma":[0.010629298,0.0009534777,0.0014025846,0.0013483063,0.0015383997,0.0036431937,0.003819063,0.0044578607,0.0014370175],"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.00017972606,0.00019221626,0.00055284763,0.00032212722,0.00023928555,0.00013062313,0.00014069026,0.5932438,0.0026503936,0.15784925,0.0045177415,0.23998137],"study_design_scores_gemma":[0.000008710643,0.000015516778,0.000024868517,0.000008608184,0.000012162141,0.000009558763,0.0000037986038,0.9706623,0.0003587936,0.028178072,0.00071099726,0.000006681058],"about_ca_topic_score_codex":0.005370726,"about_ca_topic_score_gemma":0.006414716,"teacher_disagreement_score":0.0061499164,"about_ca_system_score_codex":0.0010855617,"about_ca_system_score_gemma":0.001983236,"threshold_uncertainty_score":0.020573497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07911259,0.00029900373,0.9120344,0.00031320413,0.00018745843,0.000032982174,0.00006293627,0.00045898661,0.007498384],"genre_scores_gemma":[0.9848609,0.00004331133,0.013685348,0.000030322986,0.000021812393,0.00002326448,0.000026148351,0.000009370287,0.0012995638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995571,0.00010603639,0.000018350323,0.00010768033,0.00013435842,0.00007646216],"domain_scores_gemma":[0.9995801,0.00016897432,0.000048571543,0.00007344653,0.00009529193,0.000033552118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003514542,0.0003963337,0.0009451633,0.00021002642,0.00054844684,0.00071069476,0.000961714,0.0004467862,0.001470364],"category_scores_gemma":[0.0011370925,0.00024155017,0.0003039009,0.0005510881,0.00044484294,0.0007253074,0.0012387029,0.00062299275,0.00017406218],"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.00030783235,0.00007384595,0.0009886012,0.00007078679,0.00003640207,0.00011146047,0.00009082964,0.9289411,0.0038964069,0.013251308,0.0011137094,0.05111774],"study_design_scores_gemma":[0.000007696644,0.000019367899,0.000090775735,0.0000012575252,0.0000033475021,0.000008555119,0.000005284663,0.9976928,0.00039005763,0.0015879585,0.00018993064,0.0000030216042],"about_ca_topic_score_codex":0.0032391485,"about_ca_topic_score_gemma":0.0031538713,"teacher_disagreement_score":0.0032391485,"about_ca_system_score_codex":0.0005058265,"about_ca_system_score_gemma":0.00068155973,"threshold_uncertainty_score":0.00644058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010805207,0.00040578016,0.98697644,0.00011755895,0.000093903676,0.00006818431,0.00028520293,0.0003719057,0.0008759127],"genre_scores_gemma":[0.3499971,0.0013887838,0.6370568,0.00019473904,0.00065019086,0.00033896387,0.0019640673,0.00026964647,0.0081397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987104,0.00040717327,0.00008933804,0.00030044527,0.00042724653,0.0000654382],"domain_scores_gemma":[0.992615,0.0047355387,0.00042907038,0.0009002089,0.0011685431,0.00015170018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031763902,0.0008191015,0.0012168613,0.0028691848,0.0007130964,0.0010380509,0.0029919527,0.0012132949,0.0032258925],"category_scores_gemma":[0.013765276,0.0004801121,0.0010955199,0.0030175592,0.00044242427,0.0032594614,0.0012311426,0.0014054244,0.0014739002],"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.00018941877,0.00052212237,0.007202449,0.00031230977,0.0003951497,0.0001217949,0.0002472134,0.5020243,0.001998433,0.035422426,0.0059287837,0.44563562],"study_design_scores_gemma":[0.0000047939434,0.00001390563,0.0002570765,0.000008109543,0.00001910781,0.000020459027,0.000008612384,0.99043906,0.00019941315,0.008395884,0.0006278704,0.000005713617],"about_ca_topic_score_codex":0.0071396995,"about_ca_topic_score_gemma":0.009185132,"teacher_disagreement_score":0.0071396995,"about_ca_system_score_codex":0.0005290514,"about_ca_system_score_gemma":0.0010049868,"threshold_uncertainty_score":0.016798556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04265777,0.00042663116,0.9483665,0.00033396727,0.00009354868,0.00005925139,0.00004494083,0.000154079,0.007863231],"genre_scores_gemma":[0.9682146,0.0003243336,0.022281624,0.00010140367,0.000047741083,0.00017648046,0.000064816384,0.000041991727,0.008747167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947006,0.00017042641,0.000035314635,0.000099168625,0.00016614303,0.000059049875],"domain_scores_gemma":[0.99808145,0.0010757959,0.00026361144,0.000093339244,0.0004241586,0.00006154668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016779429,0.0012956236,0.00090197724,0.0004309408,0.00046251694,0.001147894,0.001099949,0.0015607293,0.001968762],"category_scores_gemma":[0.005736442,0.00033411672,0.00044990258,0.000407211,0.0016318494,0.0013018685,0.0019997843,0.0012494809,0.00023302162],"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.00018172957,0.000056180546,0.00039197528,0.0002126365,0.000046617075,0.000094291296,0.00021695385,0.871796,0.0050289505,0.09566449,0.00086299644,0.025447201],"study_design_scores_gemma":[0.0000071460026,0.000025486823,0.000064630614,0.000005961213,0.0000034993568,0.000004452641,0.000003882962,0.99387884,0.00023537214,0.0056727445,0.000093994226,0.000003939573],"about_ca_topic_score_codex":0.009534915,"about_ca_topic_score_gemma":0.007247471,"teacher_disagreement_score":0.009534915,"about_ca_system_score_codex":0.0016422115,"about_ca_system_score_gemma":0.0013607971,"threshold_uncertainty_score":0.018958867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049065735,0.0005782329,0.93898517,0.0018529517,0.00027224486,0.0005313466,0.00048439903,0.00085929234,0.007370695],"genre_scores_gemma":[0.90820485,0.00019452292,0.082624994,0.0003550049,0.00020975733,0.0003713647,0.0002697445,0.0001131476,0.0076566003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9901376,0.0041671656,0.0004452133,0.0019235627,0.001924775,0.0014017004],"domain_scores_gemma":[0.9797202,0.011427939,0.0011219521,0.005381245,0.0013071924,0.0010414807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01037029,0.0014939102,0.0037151675,0.0011641153,0.0030834298,0.0036078964,0.0052357363,0.0040047755,0.007494763],"category_scores_gemma":[0.03631592,0.0011367871,0.0014114731,0.0021290022,0.0025516076,0.006013612,0.0068767886,0.003219811,0.0017471943],"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.0036581082,0.0010641195,0.0040486003,0.0006164154,0.00037123854,0.0007432723,0.0012916618,0.43801394,0.009954141,0.25426632,0.021962542,0.26400965],"study_design_scores_gemma":[0.0001607071,0.00016165628,0.00035554127,0.000027488108,0.000038209855,0.00010979463,0.00017950259,0.81403357,0.0014461392,0.18032001,0.0031247244,0.00004266082],"about_ca_topic_score_codex":0.0041406755,"about_ca_topic_score_gemma":0.0055536265,"teacher_disagreement_score":0.01037029,"about_ca_system_score_codex":0.0019518121,"about_ca_system_score_gemma":0.0045514726,"threshold_uncertainty_score":0.054843962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053703547,0.00032181357,0.9418546,0.0010029752,0.000048676164,0.0001254984,0.00012447925,0.0008820215,0.00193635],"genre_scores_gemma":[0.7336517,0.00014956787,0.26232722,0.00022849267,0.00008497141,0.00011737232,0.00022929203,0.00018704598,0.0030243713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970788,0.0015182355,0.00018026373,0.00038384993,0.0005575883,0.0002812289],"domain_scores_gemma":[0.99239576,0.0047352808,0.00035190926,0.0012585864,0.0009910432,0.0002674265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055113984,0.00064476527,0.0018099757,0.0024481684,0.0012436718,0.0025238274,0.0026144711,0.0020701971,0.0023867176],"category_scores_gemma":[0.025307346,0.0005075906,0.0011566002,0.0023271977,0.0011903486,0.004637081,0.0025185274,0.0019869201,0.00066120067],"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.0015091813,0.0010476528,0.016681446,0.000251169,0.0005485831,0.000277372,0.0012211109,0.32223415,0.0066573913,0.12093823,0.012987358,0.51564634],"study_design_scores_gemma":[0.00002870304,0.00004406998,0.0007188137,0.000009613232,0.000041776817,0.00003756568,0.00006354355,0.95653737,0.00074745546,0.041125868,0.0006229862,0.000022213837],"about_ca_topic_score_codex":0.006492777,"about_ca_topic_score_gemma":0.006694563,"teacher_disagreement_score":0.006492777,"about_ca_system_score_codex":0.0013287719,"about_ca_system_score_gemma":0.0015913692,"threshold_uncertainty_score":0.029147446},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047474854,0.0017033885,0.93597126,0.0012796875,0.00009948947,0.00008137661,0.00024567067,0.00019828534,0.012945968],"genre_scores_gemma":[0.74851716,0.0015941794,0.24087268,0.00034987312,0.00026032297,0.0002429955,0.0005682409,0.0001548755,0.0074397726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972155,0.001273877,0.0001956949,0.00042847116,0.0006442975,0.00024211669],"domain_scores_gemma":[0.9945201,0.0036414736,0.00033514606,0.0008768296,0.000414245,0.00021216039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063524516,0.00094282796,0.0020338441,0.0028989853,0.0015551479,0.004246022,0.0021421115,0.0012278593,0.0030065118],"category_scores_gemma":[0.013436382,0.00084731827,0.0032171067,0.0035479392,0.003907046,0.011983457,0.0045406013,0.004048604,0.0003558682],"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.000035744953,0.000023089378,0.0003594336,0.00006148788,0.0000378688,0.000045878307,0.0004672372,0.013438759,0.00015568951,0.97497004,0.00061046076,0.009794222],"study_design_scores_gemma":[0.000004230474,0.000013491466,0.00009867269,0.000015292062,0.000015424159,0.000013173823,0.000051336996,0.048475396,0.000101560145,0.9503472,0.000855908,0.000008402886],"about_ca_topic_score_codex":0.0032159153,"about_ca_topic_score_gemma":0.0024430603,"teacher_disagreement_score":0.0063524516,"about_ca_system_score_codex":0.0021565475,"about_ca_system_score_gemma":0.0012111212,"threshold_uncertainty_score":0.033595383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028582538,0.0012216633,0.95018893,0.0010198014,0.00034791048,0.0000984663,0.00010208669,0.0009967949,0.017441886],"genre_scores_gemma":[0.6716171,0.00153928,0.2931496,0.0003419947,0.00042904727,0.00012323415,0.0002140042,0.00028472205,0.03230105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996288,0.00010133621,0.000023514942,0.000041594725,0.00014763215,0.00005711813],"domain_scores_gemma":[0.9992005,0.00023298422,0.000042772022,0.00026692342,0.000221532,0.000035273548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007028175,0.00048940466,0.00044673143,0.00046873806,0.0007149551,0.0012307749,0.0006733882,0.0008638436,0.004379319],"category_scores_gemma":[0.001776033,0.0001867715,0.00046786334,0.0007977655,0.0008741961,0.00137401,0.0009045463,0.0012391018,0.0012764734],"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.0005353144,0.00018987007,0.0007403659,0.00027753,0.00004346444,0.00044848153,0.0004109113,0.0450797,0.043180417,0.6901605,0.0130533585,0.20588002],"study_design_scores_gemma":[0.00006892904,0.00024159926,0.0005240618,0.00009001726,0.00007525808,0.0010907354,0.00016739193,0.54253596,0.050606787,0.3545651,0.049984664,0.000049495688],"about_ca_topic_score_codex":0.00077756896,"about_ca_topic_score_gemma":0.0010847822,"teacher_disagreement_score":0.004379319,"about_ca_system_score_codex":0.0006876467,"about_ca_system_score_gemma":0.0006712749,"threshold_uncertainty_score":0.014650345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026248943,0.00023325138,0.9949233,0.00007512803,0.00007461251,0.0000724016,0.00007931401,0.0014078817,0.0005092454],"genre_scores_gemma":[0.042352423,0.00022061824,0.953111,0.00012482954,0.00005980209,0.00020355186,0.0005270432,0.00040075163,0.0029999332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753654,0.0004896289,0.00012324862,0.0004897926,0.0012186858,0.00014213483],"domain_scores_gemma":[0.9977344,0.00049965153,0.0001279131,0.00048858946,0.0010416678,0.000107823915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021252332,0.0013164718,0.0025846667,0.003130736,0.001805811,0.0020625433,0.00508545,0.0022704762,0.0039122603],"category_scores_gemma":[0.007451648,0.001144015,0.0016328782,0.0031590417,0.0010115028,0.0035229127,0.003751785,0.0024539814,0.0034974257],"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.00035513658,0.00024312257,0.0014653045,0.0002781906,0.0002404281,0.00010860088,0.00024282178,0.112141654,0.010172768,0.0201129,0.013931118,0.84070784],"study_design_scores_gemma":[0.00003546243,0.00004371945,0.0005465161,0.00001748637,0.00002727034,0.00017812912,0.000051726773,0.97893846,0.00531612,0.006792321,0.007997538,0.00005526114],"about_ca_topic_score_codex":0.00878654,"about_ca_topic_score_gemma":0.010807758,"teacher_disagreement_score":0.00878654,"about_ca_system_score_codex":0.0013638604,"about_ca_system_score_gemma":0.002091153,"threshold_uncertainty_score":0.017470777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026986863,0.00032330124,0.9704258,0.00044260858,0.00005173027,0.00009388838,0.0001130861,0.0001274895,0.0014351942],"genre_scores_gemma":[0.6861991,0.00041553585,0.31056258,0.00015544686,0.00015555615,0.00018526558,0.00023795018,0.000082127735,0.0020063696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99405247,0.0021736037,0.00034617336,0.00091717974,0.0019584247,0.0005521941],"domain_scores_gemma":[0.98378986,0.011923626,0.0012270516,0.0012739412,0.0013702019,0.00041535246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007580555,0.0010063545,0.002906923,0.002887238,0.0009803805,0.0039551463,0.0033555385,0.0020624853,0.0029222032],"category_scores_gemma":[0.022123026,0.0008997567,0.001868383,0.0034980758,0.0019371511,0.0054477863,0.002615726,0.0026248167,0.00027453713],"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.00038518276,0.00018084445,0.0030643607,0.0002292662,0.00023422929,0.00018776444,0.00031281947,0.74740064,0.0022474648,0.12098753,0.001812311,0.1229576],"study_design_scores_gemma":[0.0000065861846,0.000030606694,0.0003481667,0.000011374634,0.000021698283,0.000020939517,0.000023763543,0.9494013,0.00034929463,0.049496848,0.00027271616,0.000016663596],"about_ca_topic_score_codex":0.0046089287,"about_ca_topic_score_gemma":0.003230724,"teacher_disagreement_score":0.007580555,"about_ca_system_score_codex":0.0028099448,"about_ca_system_score_gemma":0.0020550857,"threshold_uncertainty_score":0.040090263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072621848,0.00017539534,0.98858637,0.00013172344,0.00012205105,0.000078713,0.000031054307,0.0005186761,0.003093771],"genre_scores_gemma":[0.21200942,0.00019471916,0.7819882,0.00017693217,0.00013090853,0.00032765185,0.00019477896,0.00017015189,0.004807243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944395,0.00013505036,0.000038489496,0.00009751118,0.00024002358,0.000044975182],"domain_scores_gemma":[0.9991135,0.00033150063,0.00007472779,0.000112196714,0.0003283614,0.000039746225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017037538,0.000987631,0.0016205619,0.0010159343,0.000823323,0.0012955207,0.001539608,0.0020012856,0.0023466551],"category_scores_gemma":[0.0037165564,0.00059704797,0.0007961292,0.0010329225,0.0005801915,0.0014361133,0.0012393413,0.0013746493,0.0010508923],"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.00019696409,0.00013477681,0.0006496193,0.00009458664,0.00009596418,0.000044555276,0.000053202955,0.67311704,0.003397391,0.012936244,0.0039109644,0.30536866],"study_design_scores_gemma":[0.000012508674,0.000024020332,0.00005730836,0.0000036842482,0.000007137199,0.000007280682,0.0000020869136,0.998245,0.000393296,0.0008104327,0.0004341387,0.0000031828095],"about_ca_topic_score_codex":0.0043906374,"about_ca_topic_score_gemma":0.0026262389,"teacher_disagreement_score":0.0043906374,"about_ca_system_score_codex":0.0007814312,"about_ca_system_score_gemma":0.0011877262,"threshold_uncertainty_score":0.009010434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10656392,0.0028024837,0.8679262,0.0012128085,0.000563467,0.00019945313,0.0003129954,0.0010576801,0.019361036],"genre_scores_gemma":[0.9200441,0.00082566525,0.06729876,0.00034201876,0.0001480147,0.0001432434,0.00015682387,0.000042447587,0.010998853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999047,0.00020819798,0.000057040696,0.00017378779,0.0003313158,0.0001826279],"domain_scores_gemma":[0.99853504,0.0003408418,0.00024446394,0.0005103211,0.0002728581,0.00009646654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079757004,0.00047410798,0.0005803414,0.000634679,0.0009437352,0.0010517502,0.0009954197,0.000908975,0.0039013955],"category_scores_gemma":[0.0018444124,0.00022405077,0.0004161401,0.00077915186,0.001238926,0.0036908498,0.0023587977,0.0014835579,0.00090560096],"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.0022379882,0.00018860752,0.0017245264,0.0010578536,0.00021319167,0.0010104638,0.0011945291,0.02840237,0.20115285,0.5391282,0.012169515,0.21151984],"study_design_scores_gemma":[0.0004088127,0.0016780312,0.0018672423,0.00030286852,0.00036268568,0.0036133495,0.0005079155,0.3822829,0.27728716,0.25813967,0.073166154,0.00038317728],"about_ca_topic_score_codex":0.0002391559,"about_ca_topic_score_gemma":0.00026024002,"teacher_disagreement_score":0.0039013955,"about_ca_system_score_codex":0.00080084446,"about_ca_system_score_gemma":0.0008901088,"threshold_uncertainty_score":0.01305145},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05800543,0.00063757977,0.9382392,0.0005946001,0.000045614746,0.00006849394,0.00025021305,0.00018365255,0.0019752402],"genre_scores_gemma":[0.8578621,0.00053297187,0.13853723,0.00015118506,0.00007615625,0.00018558273,0.0003518324,0.00015325658,0.0021497312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980076,0.0009823337,0.00007201305,0.00046211405,0.00023974631,0.00023622779],"domain_scores_gemma":[0.9956909,0.0029015339,0.00062070397,0.00029666699,0.00027768788,0.00021260107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036146701,0.0015259954,0.0020269386,0.0010452704,0.00048696576,0.002141119,0.0015330425,0.002289565,0.0020162517],"category_scores_gemma":[0.007390792,0.00066014664,0.0016251265,0.0010849186,0.0013874558,0.002458193,0.0015503671,0.0014759641,0.00025471457],"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.000042725183,0.00002301001,0.00037166386,0.00006135195,0.000060722876,0.00003491847,0.000025018562,0.99015206,0.00044534425,0.004229873,0.00022304396,0.004330315],"study_design_scores_gemma":[0.000010829245,0.000056456513,0.00029599975,0.000012309657,0.000019243438,0.00002249674,0.00003065705,0.9898984,0.00033820473,0.008892845,0.00041277552,0.000009811888],"about_ca_topic_score_codex":0.00549397,"about_ca_topic_score_gemma":0.0021331394,"teacher_disagreement_score":0.00549397,"about_ca_system_score_codex":0.001380312,"about_ca_system_score_gemma":0.0013215162,"threshold_uncertainty_score":0.019116402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011470112,0.0003409474,0.98220587,0.00021176224,0.00005255458,0.000045805926,0.0000319733,0.00007026031,0.0055706725],"genre_scores_gemma":[0.37167734,0.0006847223,0.6155659,0.00016994306,0.00015575232,0.00030564793,0.00015608643,0.00014328447,0.011141259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959975,0.00016377578,0.000012695448,0.000075923715,0.000105629006,0.000042243606],"domain_scores_gemma":[0.9993192,0.00048510983,0.000055897523,0.00003104275,0.000081984246,0.000026857755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092578435,0.0007172942,0.0010639684,0.0008594807,0.00043813433,0.00085014635,0.0018515545,0.001407764,0.00311747],"category_scores_gemma":[0.00258288,0.0004771208,0.00073624647,0.00081711286,0.0006035935,0.0013639332,0.0010210775,0.0009821375,0.00033962607],"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.000033893702,0.00006870571,0.00028761328,0.000072896255,0.000034509296,0.000053529446,0.000043158434,0.90922517,0.0006451086,0.05010947,0.0017051375,0.03772084],"study_design_scores_gemma":[0.0000061586047,0.000014118633,0.00002765283,0.000004372622,0.000004663385,0.000011635388,0.000007996663,0.99251646,0.0000853482,0.006866068,0.000453146,0.0000024201493],"about_ca_topic_score_codex":0.0047750636,"about_ca_topic_score_gemma":0.003935811,"teacher_disagreement_score":0.0047750636,"about_ca_system_score_codex":0.00069575873,"about_ca_system_score_gemma":0.0011301527,"threshold_uncertainty_score":0.010428965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0506906,0.00044848552,0.9368371,0.0006088468,0.00012213693,0.00006479212,0.000052073352,0.000052136707,0.0111238025],"genre_scores_gemma":[0.6517032,0.00077328825,0.33421558,0.0001300175,0.00011646139,0.00015753499,0.0000825025,0.00009661408,0.012724752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997148,0.00011250077,0.00000974799,0.00003950003,0.00009474852,0.000028667144],"domain_scores_gemma":[0.99804485,0.0014865804,0.00012604054,0.00006321094,0.00017926587,0.000100103774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001154544,0.0004918923,0.0009996288,0.00081430725,0.0006388355,0.0013990578,0.0013987867,0.0014084653,0.0025626912],"category_scores_gemma":[0.005104541,0.00033719238,0.0005975133,0.0014486064,0.0012397092,0.0012996849,0.0014034717,0.0013999616,0.00013414664],"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.000036103014,0.000055332537,0.0004210106,0.00006827901,0.000019321511,0.000095664516,0.00006685986,0.7001858,0.0007167515,0.27508155,0.00090089376,0.022352511],"study_design_scores_gemma":[0.0000060124494,0.00001164345,0.000049999857,0.0000037194193,0.000004245969,0.000015337435,0.000008039565,0.9744761,0.00013348539,0.024676487,0.0006104134,0.0000044280628],"about_ca_topic_score_codex":0.004163432,"about_ca_topic_score_gemma":0.004401939,"teacher_disagreement_score":0.004163432,"about_ca_system_score_codex":0.0015077629,"about_ca_system_score_gemma":0.0012432489,"threshold_uncertainty_score":0.010939598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020736633,0.00079063594,0.9752263,0.00033908972,0.00012333234,0.00007235484,0.00012673263,0.00037066435,0.0022143207],"genre_scores_gemma":[0.6563519,0.0008016877,0.33233306,0.00029505102,0.0007623866,0.0002330726,0.0005222849,0.00023069786,0.008469832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9872248,0.0055032335,0.00075198733,0.003034859,0.0029272058,0.0005578766],"domain_scores_gemma":[0.92192984,0.051270194,0.0027077259,0.017768338,0.0053959056,0.0009280194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013090731,0.0012481683,0.004631285,0.0027203152,0.0018352072,0.004191644,0.0040344545,0.0035339515,0.0028575747],"category_scores_gemma":[0.0579571,0.0016036417,0.0024048747,0.0047371825,0.0020599342,0.009862881,0.003998335,0.0032425558,0.0011298415],"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.0020659247,0.0007287283,0.011357254,0.0010231942,0.0014559494,0.00043358025,0.00087763125,0.39245257,0.0062030135,0.22152802,0.009081816,0.35279238],"study_design_scores_gemma":[0.00013604389,0.00025167546,0.0011947758,0.000042465985,0.00025097272,0.00028954964,0.00007136593,0.9121701,0.0021022721,0.08149526,0.0019233023,0.00007226043],"about_ca_topic_score_codex":0.0027038378,"about_ca_topic_score_gemma":0.0027610983,"teacher_disagreement_score":0.013090731,"about_ca_system_score_codex":0.0010709445,"about_ca_system_score_gemma":0.001645622,"threshold_uncertainty_score":0.06923121},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06282127,0.0008075891,0.84712833,0.0004846327,0.0008641334,0.00056041835,0.00085887517,0.06877641,0.017698353],"genre_scores_gemma":[0.7178081,0.00048784414,0.25820372,0.0007179836,0.0002759485,0.00027848233,0.0021100417,0.0031039824,0.01701382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996927,0.000029401415,0.000014495331,0.000051431645,0.00011201941,0.000099941884],"domain_scores_gemma":[0.99969304,0.00004341753,0.000015514073,0.000116027455,0.00006354664,0.00006850735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003733636,0.00078443007,0.00053799717,0.00036955738,0.0007007926,0.0012442393,0.0014265195,0.0005439086,0.0038507753],"category_scores_gemma":[0.00072373933,0.00028368668,0.00045760768,0.00032206968,0.00032777985,0.0009528706,0.0018558132,0.0014212216,0.0014869041],"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.0031466316,0.0013411244,0.0036069273,0.00056967704,0.0002614143,0.0011504359,0.00045320182,0.09007725,0.19999056,0.04037985,0.1362561,0.5227669],"study_design_scores_gemma":[0.00017482886,0.00029876735,0.0017237547,0.000037747748,0.00006527316,0.0003151253,0.000072692026,0.87518007,0.0659415,0.012081664,0.044014808,0.00009374743],"about_ca_topic_score_codex":0.0023141527,"about_ca_topic_score_gemma":0.0032028942,"teacher_disagreement_score":0.0038507753,"about_ca_system_score_codex":0.00040084068,"about_ca_system_score_gemma":0.00073413237,"threshold_uncertainty_score":0.012882173},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7964038,0.0014715095,0.19778891,0.0019558617,0.000067872366,0.00003184972,0.00029301672,0.00012758235,0.001859649],"genre_scores_gemma":[0.9868606,0.0002748451,0.011385095,0.000048471702,0.00003256816,0.000010165659,0.0001441338,0.000013907216,0.001230232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948573,0.0002245889,0.000024619158,0.00010508196,0.00008170316,0.000078229525],"domain_scores_gemma":[0.9905771,0.008184978,0.00036271792,0.00023643981,0.00046707343,0.0001717119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028941445,0.0005075016,0.00075235486,0.0006599347,0.00041492024,0.0009127181,0.0012843595,0.0010401743,0.00095760863],"category_scores_gemma":[0.009123275,0.0004240551,0.0005416813,0.0014163959,0.00065843697,0.002074936,0.0006726803,0.0019733084,0.00007918092],"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.00014420874,0.00018762915,0.0130909765,0.00006996361,0.00008855698,0.00009086713,0.00012998637,0.94209933,0.0004744879,0.009247007,0.0008364668,0.03354054],"study_design_scores_gemma":[0.0000020786101,0.0000104345845,0.00070237415,0.0000025428105,0.0000039947754,0.0000036538822,0.000013321368,0.9973997,0.00006872156,0.0017426778,0.00004874687,0.0000018750583],"about_ca_topic_score_codex":0.028145932,"about_ca_topic_score_gemma":0.015727999,"teacher_disagreement_score":0.028145932,"about_ca_system_score_codex":0.0013856337,"about_ca_system_score_gemma":0.0011720033,"threshold_uncertainty_score":0.05596423},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020635424,0.00058362825,0.96509737,0.0003120525,0.0001062928,0.0001840418,0.00012632793,0.00024899477,0.012705924],"genre_scores_gemma":[0.56501245,0.00077402743,0.4296299,0.000098631936,0.00005193044,0.00031155947,0.00020508315,0.0000468691,0.003869508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596196,0.001516548,0.00022266325,0.00040340782,0.0017358066,0.00015964358],"domain_scores_gemma":[0.99756914,0.001328966,0.00017723686,0.00013623675,0.00072957017,0.00005890885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035977112,0.00100374,0.0016561215,0.0028048947,0.0016225212,0.0036590674,0.0021076219,0.0014415159,0.0043668146],"category_scores_gemma":[0.006759182,0.0004108609,0.0026522812,0.0040420205,0.0009788908,0.0020140777,0.0013226956,0.0016568872,0.00046490895],"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.0003868727,0.00035656567,0.0028713087,0.0012931564,0.00075814186,0.0006380157,0.0017618787,0.40578386,0.004381222,0.2001989,0.0050178957,0.37655225],"study_design_scores_gemma":[0.000035426587,0.00019335555,0.0010897269,0.0001228472,0.00015634847,0.00026318806,0.00044483354,0.9266108,0.0009594513,0.06701981,0.003012897,0.00009123406],"about_ca_topic_score_codex":0.011632056,"about_ca_topic_score_gemma":0.010489809,"teacher_disagreement_score":0.011632056,"about_ca_system_score_codex":0.0024538017,"about_ca_system_score_gemma":0.0032872187,"threshold_uncertainty_score":0.023128688},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009541461,0.0007833101,0.98637414,0.00053788413,0.00010337425,0.00007068914,0.0002807491,0.0010134577,0.0012949299],"genre_scores_gemma":[0.6029726,0.0011656712,0.37127814,0.001100701,0.0007042028,0.0006133041,0.0032104144,0.0007139566,0.01824094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991584,0.00034234993,0.000048513975,0.00024783608,0.00012080986,0.00008212818],"domain_scores_gemma":[0.9970912,0.002244147,0.00016615227,0.00017601691,0.00023765603,0.000084842126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017854687,0.0014712212,0.0015089357,0.0008871463,0.00062467804,0.0010452201,0.0021715786,0.002285932,0.00365836],"category_scores_gemma":[0.0056564854,0.00075386564,0.0011576876,0.0011063489,0.000835804,0.0018803485,0.0019169799,0.0027774468,0.0014687253],"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.00050475966,0.00014355786,0.00047584626,0.00040596383,0.00019012633,0.00027485634,0.0002805092,0.73319817,0.010583708,0.019104552,0.010372545,0.22446536],"study_design_scores_gemma":[0.00001068446,0.000023121303,0.000051973246,0.000009978063,0.000018147202,0.000017430619,0.0000076020597,0.9916324,0.0008561866,0.006827339,0.0005384813,0.0000066604725],"about_ca_topic_score_codex":0.0032001128,"about_ca_topic_score_gemma":0.0052708304,"teacher_disagreement_score":0.00365836,"about_ca_system_score_codex":0.00075905764,"about_ca_system_score_gemma":0.0010497276,"threshold_uncertainty_score":0.012238443},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1649825,0.0005815461,0.82938445,0.00022599206,0.00022417544,0.00007918827,0.00015713018,0.00067892246,0.0036861664],"genre_scores_gemma":[0.8176911,0.0001498226,0.17810313,0.00005280265,0.000043897344,0.00005529482,0.00028885703,0.000058979764,0.003556163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900466,0.0001990727,0.00009236673,0.00021023263,0.00039157656,0.000102026854],"domain_scores_gemma":[0.9954574,0.0017735022,0.00018207397,0.00073677296,0.0016227474,0.00022749807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024502478,0.0005059639,0.0010336683,0.000716983,0.00044323597,0.0013215691,0.0023247877,0.0008454972,0.003091925],"category_scores_gemma":[0.011762558,0.00028239138,0.00053011853,0.00069191266,0.00073861505,0.002273941,0.0018934717,0.0012425191,0.00037711608],"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.0019122784,0.0003936193,0.004838625,0.00039805222,0.00015567847,0.00034923156,0.00028006604,0.23062958,0.014111683,0.043452047,0.0033125826,0.7001666],"study_design_scores_gemma":[0.000011419079,0.000091850074,0.00041358266,0.000007935408,0.00001912394,0.000052538777,0.000019512621,0.99167037,0.0023184724,0.0048854956,0.0005012012,0.000008442591],"about_ca_topic_score_codex":0.0025978128,"about_ca_topic_score_gemma":0.0022457575,"teacher_disagreement_score":0.003091925,"about_ca_system_score_codex":0.00052220264,"about_ca_system_score_gemma":0.0013699823,"threshold_uncertainty_score":0.012958288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03388198,0.0004223504,0.9619769,0.00014441462,0.00014627406,0.00002108492,0.000011245772,0.00014734878,0.003248454],"genre_scores_gemma":[0.93482476,0.0003458091,0.059989527,0.000075666,0.00005336741,0.0000978625,0.00003149176,0.00004418937,0.0045372355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989283,0.000030201702,0.0000068668255,0.00001795816,0.000040891122,0.00001117104],"domain_scores_gemma":[0.9998155,0.000062148545,0.000029470442,0.000013986563,0.00006291664,0.000015975289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003896239,0.000463706,0.00048115943,0.0002773262,0.00021181164,0.00055980374,0.0007348025,0.00076712173,0.0010060166],"category_scores_gemma":[0.00073993776,0.00016712444,0.00033600954,0.0002046694,0.00038555695,0.00062890025,0.0007104408,0.0005974985,0.00025631514],"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.00045290604,0.00019529635,0.0007423483,0.00060162914,0.00017000895,0.0005488207,0.00024771236,0.5968429,0.15407252,0.14887452,0.0022295092,0.095021814],"study_design_scores_gemma":[0.000010105154,0.000061872706,0.000066079774,0.0000052421046,0.000005105005,0.000030056877,0.000003439765,0.99659866,0.001201451,0.0015340077,0.00047831592,0.0000057013376],"about_ca_topic_score_codex":0.00073885405,"about_ca_topic_score_gemma":0.0006425275,"teacher_disagreement_score":0.0010060166,"about_ca_system_score_codex":0.00023803735,"about_ca_system_score_gemma":0.00041263938,"threshold_uncertainty_score":0.003365457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02720972,0.00028095237,0.9660651,0.00022223296,0.000105087405,0.00006440567,0.00015559702,0.0031775455,0.002719344],"genre_scores_gemma":[0.39454076,0.00032938473,0.5914601,0.00035091888,0.00007721791,0.00012586468,0.0006999789,0.00045539392,0.011960282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998517,0.000024662628,0.000006634654,0.000034757366,0.000057535035,0.000024559567],"domain_scores_gemma":[0.9997625,0.000058191396,0.000014930028,0.00003846451,0.00010191016,0.000024079798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003114417,0.00045586049,0.00051265064,0.00050856353,0.00025941906,0.00057852495,0.0013089435,0.00072839984,0.0057013775],"category_scores_gemma":[0.0009291105,0.00026715887,0.0003729552,0.00047919832,0.00019912387,0.00057747634,0.00065039645,0.00062791747,0.0016153997],"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.0005895521,0.00020434718,0.0018216863,0.00011786072,0.000105971274,0.00016075735,0.000068491354,0.2314511,0.049122825,0.005141697,0.011984156,0.6992315],"study_design_scores_gemma":[0.000007185772,0.000029219347,0.00016711396,0.0000031878553,0.000007948435,0.000026346877,0.000004455072,0.99466527,0.003397697,0.00052380614,0.0011637,0.0000039863244],"about_ca_topic_score_codex":0.010993738,"about_ca_topic_score_gemma":0.015610295,"teacher_disagreement_score":0.010993738,"about_ca_system_score_codex":0.00046686034,"about_ca_system_score_gemma":0.0007250472,"threshold_uncertainty_score":0.021859527},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068651214,0.0002093662,0.9905524,0.000110935005,0.00007590258,0.0000660569,0.000046842346,0.0014916915,0.00058173836],"genre_scores_gemma":[0.26333928,0.000419891,0.7305992,0.00025979592,0.00021782391,0.00022098084,0.0003747233,0.00022425238,0.004343966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990829,0.00013929482,0.000054681925,0.0002982753,0.00034557402,0.00007920749],"domain_scores_gemma":[0.9988576,0.00028616778,0.0000766237,0.00021113933,0.00049974123,0.00006863181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010811558,0.001137598,0.0010645026,0.0013763189,0.0006943975,0.0013102732,0.0025780897,0.0009012806,0.0019305217],"category_scores_gemma":[0.0018274941,0.00046226897,0.0009847292,0.0014214037,0.00072002277,0.002176483,0.0010726276,0.0014862445,0.00081297604],"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.0009776427,0.00039494684,0.0055035455,0.00031096264,0.00035378474,0.0003663808,0.00033185657,0.21698043,0.068659514,0.021083465,0.009737143,0.6753003],"study_design_scores_gemma":[0.000023970591,0.000093585455,0.00042785925,0.0000055997093,0.000037677604,0.00007418541,0.000025214185,0.98202145,0.009635114,0.0051500774,0.0024850352,0.00002032023],"about_ca_topic_score_codex":0.005957233,"about_ca_topic_score_gemma":0.005802309,"teacher_disagreement_score":0.005957233,"about_ca_system_score_codex":0.0010286106,"about_ca_system_score_gemma":0.0014032571,"threshold_uncertainty_score":0.011845112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046883818,0.0006544027,0.9333884,0.0006461838,0.00024588758,0.0001220312,0.0024979014,0.014017639,0.001543708],"genre_scores_gemma":[0.70780194,0.00032534718,0.27402717,0.0004151992,0.00018915473,0.00026295707,0.006944203,0.0005055557,0.009528453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977,0.000046879628,0.000012134946,0.00007329331,0.000050153205,0.00004750154],"domain_scores_gemma":[0.99961036,0.00018557007,0.00003671564,0.00006314258,0.00005790063,0.000046390265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006729513,0.0008677226,0.0010181211,0.0005352155,0.00037343675,0.00059185305,0.0017428278,0.0011422047,0.004164646],"category_scores_gemma":[0.0020362798,0.0005354872,0.0006686485,0.00048213114,0.00025738333,0.00066641456,0.0013985151,0.0012903031,0.001503545],"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.00110144,0.00037017767,0.004916345,0.00015452589,0.00021404328,0.00038896996,0.00008895739,0.5120285,0.005996286,0.005238935,0.034612987,0.43488884],"study_design_scores_gemma":[0.000014673889,0.000016127324,0.00013440866,0.0000026812563,0.0000057357065,0.000015770916,0.0000027615658,0.99802834,0.00051757,0.00095975585,0.00029835853,0.0000036982249],"about_ca_topic_score_codex":0.018113442,"about_ca_topic_score_gemma":0.033569444,"teacher_disagreement_score":0.018113442,"about_ca_system_score_codex":0.0006437942,"about_ca_system_score_gemma":0.0016901296,"threshold_uncertainty_score":0.036015987},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05468506,0.0011226159,0.93441075,0.003120449,0.00029918936,0.00013969546,0.00064217945,0.0006313654,0.0049487064],"genre_scores_gemma":[0.8266339,0.0011970315,0.16151103,0.0008913509,0.00063887716,0.00029292065,0.0009952035,0.00028739456,0.007552326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9880989,0.0042204997,0.0010620205,0.0017268119,0.003484954,0.001406793],"domain_scores_gemma":[0.9327752,0.032259773,0.0024698924,0.028963745,0.0024609251,0.0010703761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008626017,0.0005571075,0.0023530817,0.001314498,0.001996647,0.005847956,0.0026782078,0.0019773177,0.0036788757],"category_scores_gemma":[0.045655098,0.0009335192,0.0011433973,0.003881494,0.0034303684,0.0128767,0.0065822904,0.0047231033,0.0014306117],"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.0019409294,0.00025917328,0.0018925274,0.0003338579,0.00012555698,0.0005561654,0.00077294535,0.080792345,0.009676866,0.8073918,0.007059968,0.089197814],"study_design_scores_gemma":[0.00014736956,0.00011094649,0.00023933264,0.00005236929,0.000057821147,0.00052203814,0.00014190812,0.22244918,0.011542618,0.757489,0.007216249,0.000031088763],"about_ca_topic_score_codex":0.0004570231,"about_ca_topic_score_gemma":0.00045181753,"teacher_disagreement_score":0.008626017,"about_ca_system_score_codex":0.0029535438,"about_ca_system_score_gemma":0.0029732694,"threshold_uncertainty_score":0.04561925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010241215,0.0001464135,0.9874614,0.00025648432,0.000050924664,0.000052641997,0.00011991431,0.0009731422,0.00069781],"genre_scores_gemma":[0.57862407,0.00018562411,0.41389352,0.00034362593,0.000117456475,0.0002870378,0.0004779688,0.00020951925,0.0058611725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951492,0.0017901574,0.00028480665,0.0009911205,0.001253411,0.00053126714],"domain_scores_gemma":[0.99408495,0.0023127098,0.00037200245,0.0023733042,0.0006110127,0.00024601253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038453469,0.0008535315,0.0021488296,0.00068404194,0.0011814169,0.0018452678,0.0036718566,0.0024536196,0.00251979],"category_scores_gemma":[0.011580648,0.00057868107,0.0011795397,0.001306223,0.0015228281,0.003632007,0.0045201466,0.003241052,0.0009883045],"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.0021734661,0.00060822663,0.0014421822,0.00024266233,0.0002497164,0.0003431915,0.0003737443,0.49331787,0.017059537,0.19504587,0.011766119,0.27737746],"study_design_scores_gemma":[0.000045900655,0.000058335292,0.00009972928,0.000008937105,0.000012522395,0.000065584754,0.000009692442,0.96377355,0.0024947522,0.032745384,0.0006695651,0.00001594652],"about_ca_topic_score_codex":0.001522236,"about_ca_topic_score_gemma":0.0018580394,"teacher_disagreement_score":0.0038453469,"about_ca_system_score_codex":0.0013884571,"about_ca_system_score_gemma":0.0029241224,"threshold_uncertainty_score":0.02033639},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0679172,0.0003825899,0.9264825,0.0002986688,0.000053636177,0.00026552327,0.0006968944,0.0025038475,0.0013990647],"genre_scores_gemma":[0.4464618,0.00023257639,0.54988873,0.00011142729,0.000040349478,0.0002187651,0.0013551967,0.00006799997,0.0016231473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985905,0.00021746312,0.00014571531,0.0003732351,0.00049785734,0.00017518118],"domain_scores_gemma":[0.9981997,0.0005044434,0.00015689676,0.00040009778,0.0005868904,0.00015191663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016047255,0.00067337725,0.0011593208,0.0021429483,0.0013595963,0.0013881002,0.0026645001,0.0005909252,0.000675163],"category_scores_gemma":[0.0039005508,0.00041033403,0.0012219545,0.002612619,0.0005645187,0.001689643,0.0011155577,0.0006955757,0.00031537976],"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.0010403869,0.0006311845,0.02391262,0.0005642275,0.00053010334,0.0017654842,0.0006751,0.31488875,0.016048461,0.027314376,0.012869724,0.59975946],"study_design_scores_gemma":[0.00003988804,0.00006279701,0.0014790697,0.0000119000315,0.00003959783,0.0003979926,0.00016226781,0.9618399,0.004807401,0.028952878,0.0021866038,0.000019679577],"about_ca_topic_score_codex":0.006534601,"about_ca_topic_score_gemma":0.007154018,"teacher_disagreement_score":0.006534601,"about_ca_system_score_codex":0.00079711236,"about_ca_system_score_gemma":0.002397284,"threshold_uncertainty_score":0.012993157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46722966,0.001116469,0.34896487,0.0014188946,0.0002076458,0.00027209852,0.0009771368,0.0009623803,0.17885071],"genre_scores_gemma":[0.96527094,0.00031877655,0.011332072,0.00010431194,0.000014333327,0.00016359959,0.00014323961,0.00010115719,0.022551449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998783,0.000018647672,0.0000033201482,0.000021501606,0.000047930083,0.000030245968],"domain_scores_gemma":[0.9998479,0.000075858086,0.000019198445,0.000013069649,0.000028802093,0.000015068717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000163545,0.00040375625,0.0004610621,0.00023527395,0.00043694375,0.0008595994,0.0010834747,0.0016300544,0.004789802],"category_scores_gemma":[0.00050427223,0.00042755055,0.0005092509,0.00023343168,0.00049082533,0.0006687728,0.00039690992,0.00039711333,0.0005512247],"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.000022867272,0.000024825222,0.00015776689,0.00003740383,0.0000094382485,0.00011332851,0.000023922088,0.98507,0.00823911,0.0047494336,0.00021039868,0.0013416222],"study_design_scores_gemma":[0.000003427846,0.00000627231,0.000067973015,0.0000018736172,0.0000019300637,0.000007413919,0.000005912921,0.9986216,0.00075618294,0.0002778934,0.0002466295,0.0000030273375],"about_ca_topic_score_codex":0.010870616,"about_ca_topic_score_gemma":0.0066207284,"teacher_disagreement_score":0.010870616,"about_ca_system_score_codex":0.0008274458,"about_ca_system_score_gemma":0.001088904,"threshold_uncertainty_score":0.02161467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006073409,0.00020801356,0.9917412,0.00006569477,0.00003885047,0.00004678045,0.00014265702,0.000930088,0.00075326354],"genre_scores_gemma":[0.201849,0.00044459038,0.7911341,0.00014597923,0.00009237604,0.00021243055,0.0023098295,0.00048457604,0.0033269906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981225,0.000431268,0.00009010338,0.00048884825,0.0006075474,0.0002596981],"domain_scores_gemma":[0.99869424,0.00025805918,0.00008202601,0.00032144724,0.000563817,0.00008043841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011047749,0.0016022278,0.0026126378,0.0023020534,0.0013032858,0.0019493344,0.0018190866,0.0013111987,0.003077663],"category_scores_gemma":[0.0029326447,0.0006736321,0.0027733424,0.0030633032,0.00087264227,0.0018494715,0.0033421968,0.0015439271,0.0031999757],"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.0005126262,0.00021111296,0.0011902236,0.0002273065,0.00041649796,0.00008449339,0.00035849382,0.09293773,0.032249823,0.008847025,0.01027568,0.85268897],"study_design_scores_gemma":[0.000026405029,0.000114390925,0.0012979365,0.00002229076,0.000104433115,0.0001304202,0.00017287214,0.9716431,0.010009605,0.012779219,0.0036375711,0.00006165533],"about_ca_topic_score_codex":0.007895047,"about_ca_topic_score_gemma":0.008139413,"teacher_disagreement_score":0.007895047,"about_ca_system_score_codex":0.0006824271,"about_ca_system_score_gemma":0.0016267673,"threshold_uncertainty_score":0.015698195},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02597542,0.0004308776,0.96975785,0.00022881306,0.00011204107,0.0000963786,0.0006489176,0.0014503341,0.0012993646],"genre_scores_gemma":[0.46282372,0.00036840892,0.52304333,0.00029892693,0.00025766372,0.00036777862,0.0057897735,0.00079894875,0.0062514613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909356,0.0033017814,0.0005063299,0.002864419,0.0020190836,0.00037287592],"domain_scores_gemma":[0.9772676,0.011775388,0.0015509417,0.005734828,0.0033328903,0.00033835616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054399227,0.0019516876,0.002765374,0.0037043619,0.002229169,0.002587994,0.004858904,0.0027315395,0.0015867007],"category_scores_gemma":[0.024338992,0.0012835469,0.0015098288,0.004384424,0.0011239942,0.0035025247,0.0027250345,0.0022861506,0.0021122482],"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.0010146456,0.0004284694,0.010620045,0.0010811728,0.0010075467,0.0007776323,0.0010463235,0.4387459,0.02353351,0.020981928,0.02915513,0.47160777],"study_design_scores_gemma":[0.000016637961,0.00002748507,0.0012912343,0.000035937825,0.00006468026,0.00016022766,0.00009981388,0.9639262,0.004560468,0.027063454,0.002731909,0.000021984952],"about_ca_topic_score_codex":0.008434593,"about_ca_topic_score_gemma":0.020073988,"teacher_disagreement_score":0.008434593,"about_ca_system_score_codex":0.0013611523,"about_ca_system_score_gemma":0.0019542146,"threshold_uncertainty_score":0.028769374},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038586233,0.00097444624,0.95716536,0.00021263279,0.00008342542,0.000034693807,0.000078766105,0.00081549736,0.002048849],"genre_scores_gemma":[0.80377805,0.0009879922,0.18638995,0.00019633856,0.00009093537,0.00012793539,0.00043253595,0.00011499486,0.0078812055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997758,0.000045948884,0.000017637465,0.00008047463,0.00005308148,0.00002712849],"domain_scores_gemma":[0.9996488,0.00016210662,0.00004197156,0.000046030847,0.00008546542,0.000015704236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066344533,0.00066144177,0.00052614446,0.0003786962,0.00022031585,0.0005052788,0.0007035365,0.00071842916,0.0012696444],"category_scores_gemma":[0.0014192254,0.00038076684,0.0006759385,0.0004334602,0.00041738997,0.0010027187,0.00065280346,0.0014505611,0.0003714984],"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.00010465186,0.00007518937,0.001179147,0.000084337174,0.000118747244,0.00009296795,0.00007561695,0.75154114,0.013544313,0.01072138,0.0012519258,0.22121058],"study_design_scores_gemma":[0.0000015306642,0.000010230373,0.000097406635,0.00000233696,0.000006162157,0.0000066990315,0.0000021331496,0.99758065,0.00096145435,0.0011144591,0.00021330969,0.0000035891135],"about_ca_topic_score_codex":0.004360487,"about_ca_topic_score_gemma":0.004244295,"teacher_disagreement_score":0.004360487,"about_ca_system_score_codex":0.00043347117,"about_ca_system_score_gemma":0.0006325473,"threshold_uncertainty_score":0.008670211},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057284143,0.00016287612,0.99218327,0.00009630683,0.00008369996,0.00008697843,0.00012192521,0.0009327571,0.0006037347],"genre_scores_gemma":[0.091413066,0.00016355018,0.90392965,0.00009863042,0.0000985631,0.00020188917,0.000700407,0.00027623755,0.0031180065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960155,0.000774233,0.0003455586,0.0009171546,0.0016322106,0.00031538316],"domain_scores_gemma":[0.99556476,0.00097290357,0.00023651638,0.00074963225,0.0022715968,0.00020463047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026002713,0.0013685478,0.0020136742,0.0051839603,0.0025414592,0.0028893433,0.003751218,0.0024070651,0.00276678],"category_scores_gemma":[0.006489899,0.0006100066,0.0035038816,0.0047215386,0.00088274595,0.0020590376,0.002452384,0.0020469227,0.0023137806],"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.00051087246,0.00043557753,0.005013579,0.0003521811,0.00077702757,0.00023327729,0.0006337887,0.060261767,0.035989147,0.020165266,0.010143917,0.8654836],"study_design_scores_gemma":[0.000030841624,0.00015812393,0.0028040062,0.000030262463,0.0001444824,0.00040736987,0.00016237715,0.96122766,0.011233597,0.017897084,0.005786361,0.00011795538],"about_ca_topic_score_codex":0.008339366,"about_ca_topic_score_gemma":0.009668015,"teacher_disagreement_score":0.008339366,"about_ca_system_score_codex":0.0010689878,"about_ca_system_score_gemma":0.0018719702,"threshold_uncertainty_score":0.016581655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000091379945,0.9990803,0.00032466502,0.00011436063,0.000104760526,0.0000072962803,0.000026999754,0.000009048409,0.00024123282],"genre_scores_gemma":[0.0006992483,0.99812573,0.00056851114,0.00018472386,0.00019023952,0.000008437349,0.00004906716,0.0000021162864,0.00017199121],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99955195,0.000073760406,0.00008798119,0.000105970736,0.00015218627,0.000028159095],"domain_scores_gemma":[0.9978834,0.0013490046,0.00022835893,0.00004361196,0.0004226075,0.00007296827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014164513,0.0013397646,0.0025291895,0.0034020548,0.00022906445,0.0013317397,0.0015215751,0.0014406116,0.0031878506],"category_scores_gemma":[0.002947355,0.00045041498,0.0012562966,0.0027868727,0.0004542144,0.0018727125,0.00083475816,0.0013085185,0.0015624766],"study_design_candidate":"systematic_review","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.00011228601,0.0000815536,0.0003320696,0.036523055,0.00032171572,0.00010457976,0.000036823785,0.0003122824,0.0013404016,0.0008973557,0.012841468,0.9470964],"study_design_scores_gemma":[0.00015616829,0.0007455746,0.0057830927,0.03813889,0.003775168,0.0032928155,0.00022051674,0.0013689864,0.0031902767,0.00427975,0.93885034,0.00019851816],"about_ca_topic_score_codex":0.001523988,"about_ca_topic_score_gemma":0.0019870072,"teacher_disagreement_score":0.0034020548,"about_ca_system_score_codex":0.00044466194,"about_ca_system_score_gemma":0.0013793154,"threshold_uncertainty_score":0.010664463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017247288,0.00019130719,0.9969313,0.000049945647,0.00008137514,0.00003274638,0.000026555017,0.00012915945,0.0008329111],"genre_scores_gemma":[0.07851687,0.00029726146,0.91824675,0.00008138178,0.00014250606,0.00013304147,0.00012645088,0.000049729137,0.002406085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980107,0.00035739888,0.00018683613,0.00050040707,0.00088328024,0.0000614364],"domain_scores_gemma":[0.9991085,0.00032548644,0.00005993715,0.000086854874,0.00037090376,0.00004831542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016779102,0.00070836226,0.0011950902,0.002244939,0.00077531894,0.0019178697,0.0016509773,0.0009020619,0.0027941547],"category_scores_gemma":[0.003132174,0.00037861156,0.0016173326,0.001490456,0.00081501954,0.0029970817,0.0010140355,0.0013440273,0.0008164256],"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.0002631489,0.0001680999,0.001078014,0.00052154914,0.00023645419,0.00035557945,0.0006947515,0.04328546,0.035243344,0.18364234,0.0052081547,0.729303],"study_design_scores_gemma":[0.000050149796,0.00016728033,0.0007952836,0.000057610803,0.000114151015,0.00064476294,0.0000969288,0.86989075,0.009140254,0.10235928,0.016560115,0.00012342572],"about_ca_topic_score_codex":0.0018503562,"about_ca_topic_score_gemma":0.0018089776,"teacher_disagreement_score":0.0027941547,"about_ca_system_score_codex":0.00075651717,"about_ca_system_score_gemma":0.001081486,"threshold_uncertainty_score":0.009347379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031652812,0.00043233144,0.963403,0.000635657,0.00012082165,0.00007792222,0.0002781882,0.00048508652,0.002914159],"genre_scores_gemma":[0.72483635,0.0005500211,0.27002603,0.00018754313,0.00012430601,0.00021637074,0.0005521509,0.000060452177,0.0034466777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985869,0.00024891028,0.00015740778,0.00041776765,0.00044402733,0.00014508248],"domain_scores_gemma":[0.9983165,0.0008664585,0.00019030437,0.00019067623,0.00034568127,0.00009039625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016989529,0.00056371855,0.0018120903,0.0018598594,0.0007818699,0.0038953223,0.0025765356,0.0013705486,0.002289295],"category_scores_gemma":[0.004627297,0.00048048134,0.001224992,0.0029972943,0.00079691864,0.0043217773,0.0013261631,0.0016042527,0.0005900619],"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.00038735557,0.00034032654,0.0031811793,0.00019342556,0.00025575722,0.00045004598,0.00030890206,0.65611154,0.0035166251,0.09076981,0.0036329275,0.24085203],"study_design_scores_gemma":[0.000007989645,0.000015829626,0.0001395787,0.000007392033,0.000021261187,0.000024205412,0.000008593967,0.98590547,0.00017535563,0.01340307,0.00028219182,0.000009107422],"about_ca_topic_score_codex":0.008019888,"about_ca_topic_score_gemma":0.0043889973,"teacher_disagreement_score":0.008019888,"about_ca_system_score_codex":0.001154213,"about_ca_system_score_gemma":0.0012317167,"threshold_uncertainty_score":0.015946448},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11794779,0.0009863046,0.8623127,0.0010054344,0.0001976375,0.0004206178,0.001089035,0.00019342137,0.01584709],"genre_scores_gemma":[0.7406691,0.00031485467,0.2553826,0.00010546784,0.0002391531,0.0005574031,0.0007773967,0.000062650885,0.0018914682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96727633,0.018116217,0.002855497,0.0013181854,0.009629687,0.00080410216],"domain_scores_gemma":[0.8778376,0.089002945,0.007375282,0.0069534243,0.016539222,0.002291564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026148662,0.001021765,0.0013359765,0.011285711,0.0012389265,0.004597478,0.0015020282,0.001645202,0.005024715],"category_scores_gemma":[0.13745938,0.00030384294,0.001394413,0.0063441405,0.0030697158,0.0054475334,0.0027701699,0.0018920935,0.00056714483],"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.0011229387,0.00048819298,0.030022522,0.0011108799,0.00070557673,0.00039614594,0.0021495698,0.06041582,0.0056793606,0.59991163,0.008972502,0.2890249],"study_design_scores_gemma":[0.00014681484,0.0011528137,0.02551517,0.0004606945,0.00024338544,0.00060036825,0.001659762,0.38727173,0.002533531,0.5716255,0.008452258,0.00033801838],"about_ca_topic_score_codex":0.0012017322,"about_ca_topic_score_gemma":0.0012492149,"teacher_disagreement_score":0.026148662,"about_ca_system_score_codex":0.0020235039,"about_ca_system_score_gemma":0.0015378812,"threshold_uncertainty_score":0.13828897},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049265935,0.000116403404,0.994393,0.00005076803,0.000014486547,0.0000110772635,0.000024054485,0.00007931249,0.00038427618],"genre_scores_gemma":[0.5828327,0.0006554816,0.40970537,0.00014786015,0.00007903417,0.00027553664,0.00049615995,0.00022338997,0.0055844537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996855,0.00010058333,0.00001768124,0.00008102758,0.00008132548,0.000033949254],"domain_scores_gemma":[0.99934596,0.00041201126,0.000052412106,0.000037295416,0.00013114272,0.000021185757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093931984,0.00084861997,0.0010246909,0.00039962315,0.0002538561,0.00062713906,0.00092311285,0.0010097553,0.0014038774],"category_scores_gemma":[0.002371507,0.00067092676,0.00086414575,0.000602888,0.0007217144,0.0009319147,0.0011077109,0.001036575,0.00030012324],"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.000042895783,0.000017735785,0.000329507,0.000064493026,0.000036829326,0.000022068773,0.000031476473,0.9715848,0.0022935783,0.0041846214,0.00042454194,0.02096745],"study_design_scores_gemma":[0.0000010198003,0.0000041115545,0.000033826323,0.0000016916986,0.0000016278063,0.0000028718312,0.0000018600932,0.99923205,0.0001575813,0.0004958373,0.00006631342,0.0000013315957],"about_ca_topic_score_codex":0.008989311,"about_ca_topic_score_gemma":0.0066109193,"teacher_disagreement_score":0.008989311,"about_ca_system_score_codex":0.0006548776,"about_ca_system_score_gemma":0.0011475512,"threshold_uncertainty_score":0.017873943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033739783,0.00018532305,0.95930403,0.00011781513,0.00008839662,0.000089377565,0.0012023196,0.0044172485,0.00085564377],"genre_scores_gemma":[0.51434106,0.00026923543,0.47329924,0.00009516978,0.00015369347,0.00026524163,0.0063782805,0.00028707832,0.0049109966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996395,0.000068783855,0.00001707971,0.00010394812,0.000113241345,0.000057555917],"domain_scores_gemma":[0.99888426,0.00040341538,0.000121175435,0.00032193365,0.00021138914,0.00005782123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064166676,0.0008388838,0.0011697381,0.0010740428,0.00035243577,0.00067457487,0.0020350774,0.00079664716,0.0025440631],"category_scores_gemma":[0.0036931266,0.00036126995,0.00054421456,0.0014813078,0.00030774277,0.0014840242,0.0012688888,0.0010942594,0.0013722073],"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.00041941446,0.0002277724,0.003472707,0.00017006717,0.00016734608,0.00015970331,0.000079378064,0.608031,0.006225164,0.0030784016,0.009371393,0.36859772],"study_design_scores_gemma":[0.000005887247,0.000019401412,0.00031071255,0.000003052816,0.0000060430025,0.000023243092,0.0000081515955,0.9978011,0.0007025607,0.00065663405,0.00045786178,0.00000531293],"about_ca_topic_score_codex":0.009048233,"about_ca_topic_score_gemma":0.010851089,"teacher_disagreement_score":0.009048233,"about_ca_system_score_codex":0.00033734075,"about_ca_system_score_gemma":0.0013320029,"threshold_uncertainty_score":0.017991126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12541169,0.00027810133,0.8628163,0.00026025137,0.00006948835,0.000042862,0.00008082504,0.00016526564,0.010875126],"genre_scores_gemma":[0.9875935,0.00007750414,0.008228708,0.000022497914,0.000011695853,0.000030337922,0.000034567984,0.00000753971,0.003993757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992216,0.000013674112,0.0000033851932,0.000022428181,0.000023556415,0.0000148212675],"domain_scores_gemma":[0.9998635,0.00004223372,0.000032869862,0.00001678023,0.00003600483,0.00000862267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019726212,0.00041491372,0.00032127326,0.00011256035,0.00035465977,0.0005293304,0.00041635256,0.00035172267,0.0017957918],"category_scores_gemma":[0.0004565156,0.00013707465,0.00017211703,0.00015731501,0.0004071677,0.0003793352,0.00067113515,0.0004149369,0.00013498118],"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.0003074691,0.000102466394,0.00086512597,0.00018645637,0.00006858797,0.00017510644,0.0001614355,0.8320274,0.025559023,0.04354428,0.0020539367,0.09494873],"study_design_scores_gemma":[0.000009397528,0.000037511647,0.00021069468,0.0000024885064,0.0000035879798,0.000013609873,0.00000754939,0.9959967,0.00081774115,0.0024231793,0.00047488068,0.0000027159201],"about_ca_topic_score_codex":0.0024653045,"about_ca_topic_score_gemma":0.003285485,"teacher_disagreement_score":0.0024653045,"about_ca_system_score_codex":0.00024802284,"about_ca_system_score_gemma":0.00054041215,"threshold_uncertainty_score":0.006007552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9980751,0.000037129463,0.00023802421,0.00011318022,0.0000047639196,0.000012103382,0.000033771863,0.0000037020259,0.001482234],"genre_scores_gemma":[0.9993261,0.000028214203,0.00016805338,0.000014559691,0.000007851009,0.000005649372,0.00002649981,0.0000019799866,0.00042110283],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972945,0.000088500004,0.000010289247,0.000032449523,0.00007121505,0.000068028705],"domain_scores_gemma":[0.99843293,0.0009711803,0.0002091517,0.000060227292,0.00017898242,0.00014748421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063318637,0.00024147464,0.00018025903,0.00089101086,0.0017049506,0.0010302372,0.00038368974,0.00061147695,0.0011643271],"category_scores_gemma":[0.001971799,0.0000969765,0.00019660828,0.0007483445,0.00070048746,0.0010715914,0.00067041884,0.0004243082,0.00012419042],"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.0004474115,0.000678545,0.8443575,0.00023946635,0.0001140742,0.014742216,0.053779725,0.0033559913,0.014282303,0.008134063,0.0039520077,0.0559167],"study_design_scores_gemma":[0.000030379422,0.0002971529,0.82136947,0.00005906129,0.00017261003,0.0027061952,0.08035597,0.078545876,0.0047118673,0.0029083812,0.008768762,0.00007422562],"about_ca_topic_score_codex":0.020605663,"about_ca_topic_score_gemma":0.023489324,"teacher_disagreement_score":0.020605663,"about_ca_system_score_codex":0.0008991187,"about_ca_system_score_gemma":0.0005659951,"threshold_uncertainty_score":0.040971458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19745426,0.0021435984,0.78573334,0.0003981623,0.00013313867,0.00011240026,0.00020464018,0.000493764,0.01332666],"genre_scores_gemma":[0.78494334,0.0019369356,0.19318624,0.00006666245,0.00008609683,0.000057289602,0.0002215858,0.00010782053,0.01939401],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998186,0.000016943206,0.000006012972,0.000016384813,0.00012329836,0.00001889949],"domain_scores_gemma":[0.9997681,0.00011022563,0.00003117236,0.000043258853,0.000038424692,0.000008795127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001546874,0.00030611668,0.00018201796,0.00038202378,0.00016344912,0.00033218187,0.00039263663,0.00031613628,0.0027410984],"category_scores_gemma":[0.00082534645,0.00017065184,0.00028516346,0.00023849167,0.00038803558,0.0004955704,0.00027734233,0.00049748586,0.00047761295],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047133272,0.00016023278,0.00047215988,0.00056020473,0.00005896805,0.00039838962,0.00018059564,0.03631495,0.6903704,0.07227262,0.0017828909,0.1969572],"study_design_scores_gemma":[0.000066355096,0.00040725898,0.0015612138,0.0000480487,0.00008363181,0.0010382138,0.000049247472,0.30267838,0.67408276,0.012257819,0.0076789223,0.000048099228],"about_ca_topic_score_codex":0.0008386444,"about_ca_topic_score_gemma":0.0021979965,"teacher_disagreement_score":0.0027410984,"about_ca_system_score_codex":0.0002435712,"about_ca_system_score_gemma":0.00032551156,"threshold_uncertainty_score":0.009169877},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37100008,0.00020908086,0.61836594,0.00040097974,0.0001810541,0.00006663575,0.00012052226,0.0007358569,0.008919788],"genre_scores_gemma":[0.9967278,0.000025705918,0.0025404328,0.000013768692,0.000011207958,0.000017761398,0.000010913227,0.000005653264,0.00064677297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995536,0.000087855486,0.000031349988,0.0001397984,0.00010914476,0.00007816966],"domain_scores_gemma":[0.9986552,0.00063431234,0.00025112505,0.000085511594,0.0002705108,0.000103364684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070939725,0.00039186148,0.00053745694,0.0002663938,0.00040831842,0.0010733845,0.0006730372,0.00038581764,0.0016853302],"category_scores_gemma":[0.002045613,0.00014023038,0.00031606155,0.00019433207,0.0007073862,0.00048212698,0.00072903524,0.0006244661,0.00011712735],"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.0009645697,0.0002256847,0.0023563355,0.0002554644,0.0001437947,0.000647912,0.0004787181,0.79968894,0.05346812,0.0766643,0.0013444137,0.0637618],"study_design_scores_gemma":[0.000033131295,0.00012569617,0.0004807257,0.000005521066,0.000012461556,0.000026877891,0.000017221088,0.9875938,0.0026311255,0.008838156,0.00022771598,0.0000075924286],"about_ca_topic_score_codex":0.0024495218,"about_ca_topic_score_gemma":0.002446826,"teacher_disagreement_score":0.0024495218,"about_ca_system_score_codex":0.00049758307,"about_ca_system_score_gemma":0.00078019244,"threshold_uncertainty_score":0.0056379437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052725337,0.00046380222,0.99228024,0.00016527194,0.000040522646,0.00003347286,0.000056143654,0.000035086552,0.0016529179],"genre_scores_gemma":[0.3954408,0.0014856816,0.59802216,0.00015762815,0.00018447272,0.0003654574,0.00030306584,0.00004616606,0.0039945585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824226,0.0007936726,0.0001152044,0.00020591356,0.0005440441,0.00009888465],"domain_scores_gemma":[0.9985139,0.0009753375,0.00009313013,0.00012402053,0.00023989468,0.00005383352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018075275,0.0006897344,0.0013991406,0.0014426303,0.00068102375,0.0017752647,0.0012217759,0.0006723044,0.0023093598],"category_scores_gemma":[0.0036998878,0.00035097604,0.0017210952,0.0020633433,0.0009633876,0.001976309,0.0012764856,0.0012497224,0.00034472777],"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.00009465226,0.00008829218,0.00031866925,0.0003707341,0.00020490367,0.00016102966,0.00035971627,0.2186476,0.003174145,0.67878807,0.0022730879,0.095519155],"study_design_scores_gemma":[0.000011528335,0.000053735992,0.0001227134,0.000026440337,0.000042039355,0.000046781395,0.000052426414,0.59229237,0.00073642505,0.403926,0.002666354,0.000023146038],"about_ca_topic_score_codex":0.003994148,"about_ca_topic_score_gemma":0.0022763438,"teacher_disagreement_score":0.003994148,"about_ca_system_score_codex":0.0014290683,"about_ca_system_score_gemma":0.0010501852,"threshold_uncertainty_score":0.010368645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05592792,0.00052933564,0.93882406,0.001118696,0.00017380984,0.00018793899,0.0001496257,0.0016325068,0.0014560876],"genre_scores_gemma":[0.87454045,0.00013566836,0.12158214,0.00060476136,0.00017559671,0.000107588145,0.00023084681,0.00010666255,0.0025163663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9901141,0.0039547207,0.00061495305,0.0019894263,0.0021371075,0.0011897972],"domain_scores_gemma":[0.966204,0.014505924,0.0024927019,0.009019255,0.0061465222,0.0016315656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01421645,0.0014025717,0.004226714,0.002160478,0.0028565042,0.003557952,0.006132204,0.0048696236,0.0023240822],"category_scores_gemma":[0.033212934,0.0010103846,0.0016393859,0.0023127627,0.0026153128,0.011870888,0.006247671,0.00482689,0.0008561217],"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.0041553862,0.0028608525,0.013841446,0.00035494126,0.0010134834,0.0005673287,0.0013679789,0.45241556,0.007904817,0.05036437,0.013042486,0.45211124],"study_design_scores_gemma":[0.000049025493,0.0002005666,0.0003554738,0.000021776768,0.00007264692,0.0000828637,0.000087863045,0.96725726,0.0014997203,0.029683398,0.0006558382,0.000033706685],"about_ca_topic_score_codex":0.0053987773,"about_ca_topic_score_gemma":0.0067176167,"teacher_disagreement_score":0.01421645,"about_ca_system_score_codex":0.0017030459,"about_ca_system_score_gemma":0.003283749,"threshold_uncertainty_score":0.0751847},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015660394,0.0005230646,0.97401285,0.0011355429,0.00019950516,0.00016212558,0.0007641166,0.004406856,0.0031355023],"genre_scores_gemma":[0.693974,0.00044233198,0.2900087,0.0012964266,0.00015090757,0.0004478528,0.0013298579,0.00051604153,0.011833839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951746,0.0014479668,0.000297958,0.0008168449,0.0015635602,0.0006990787],"domain_scores_gemma":[0.992671,0.0022052,0.0003679026,0.0039067958,0.00063183956,0.00021728415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056370953,0.000851768,0.00166533,0.0009142921,0.0013541933,0.0029399935,0.0037730809,0.0029541194,0.0050912728],"category_scores_gemma":[0.014462179,0.00049023103,0.0012254197,0.0016761547,0.0023791387,0.0067020566,0.006297056,0.0045548356,0.0014537417],"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.0022917658,0.00049221027,0.001029188,0.00040672073,0.00023573799,0.00026901066,0.00027193906,0.21875952,0.010218152,0.36663342,0.033099,0.36629328],"study_design_scores_gemma":[0.0001492495,0.00013209652,0.0001758495,0.000047446258,0.000036303933,0.00014528263,0.000035840756,0.6806041,0.010391119,0.3023446,0.0058837477,0.000054349228],"about_ca_topic_score_codex":0.0016826526,"about_ca_topic_score_gemma":0.0019347757,"teacher_disagreement_score":0.0056370953,"about_ca_system_score_codex":0.0024586995,"about_ca_system_score_gemma":0.0039839726,"threshold_uncertainty_score":0.029812157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007641099,0.0055657285,0.00011426201,0.03757842,0.9421221,0.000075688404,0.00023468865,0.00013963193,0.014093076],"genre_scores_gemma":[0.0012899874,0.0067417417,0.00023095215,0.033856075,0.8610733,0.00008072356,0.00032911383,0.00014355866,0.09625462],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99722314,0.00050982006,0.00025637404,0.00031719587,0.0014216851,0.0002717346],"domain_scores_gemma":[0.984946,0.003107198,0.0012260637,0.0008737178,0.0073153405,0.0025317029],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004061918,0.0033613818,0.0028262418,0.0053819865,0.002466767,0.0072226054,0.0025527936,0.008894697,0.069551155],"category_scores_gemma":[0.019616714,0.0008589206,0.0020711068,0.0024631582,0.0013074913,0.0025444224,0.0014053248,0.009033592,0.04667258],"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.000016841477,0.0000050519366,0.000008866611,0.000044111686,0.000004395742,0.0000366239,0.0000023855264,0.000004349447,0.000012812772,0.00004609174,0.99737227,0.0024462314],"study_design_scores_gemma":[0.000051918207,0.000015419848,0.00021086054,0.00019774104,0.000035875135,0.00011715188,0.000019204588,0.000056424975,0.00008448561,0.00035833422,0.99884474,0.00000778616],"about_ca_topic_score_codex":0.0030919677,"about_ca_topic_score_gemma":0.006056603,"teacher_disagreement_score":0.93044883,"about_ca_system_score_codex":0.0027650662,"about_ca_system_score_gemma":0.0030736348,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11113135,0.0009519987,0.86571896,0.00044003586,0.00033181027,0.00029758603,0.0017108448,0.010426581,0.008990855],"genre_scores_gemma":[0.33208197,0.00037972876,0.6464484,0.00025481425,0.00009856257,0.00013242214,0.0047366126,0.0007208801,0.015146705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988146,0.00018093058,0.00012695043,0.00020846541,0.00048818887,0.00018092435],"domain_scores_gemma":[0.99744546,0.00067656237,0.00012869795,0.001084626,0.0005776556,0.000087095104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008504,0.00082333555,0.0010347501,0.0016823955,0.0008327374,0.0017244689,0.0018910159,0.00050078315,0.00715135],"category_scores_gemma":[0.002980055,0.00057335454,0.00084334315,0.0032247335,0.0006310777,0.0025766972,0.0015766819,0.0012398225,0.0024272373],"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.0010919162,0.00041320227,0.0029435018,0.0002891646,0.0001287638,0.00029194323,0.00038110546,0.029129015,0.027085053,0.039061356,0.023689,0.8754959],"study_design_scores_gemma":[0.00019662073,0.00046556088,0.002549413,0.00011321288,0.0002544117,0.00067974516,0.0008352035,0.65312546,0.10999894,0.17300184,0.058616888,0.00016272628],"about_ca_topic_score_codex":0.003867682,"about_ca_topic_score_gemma":0.007394249,"teacher_disagreement_score":0.00715135,"about_ca_system_score_codex":0.00074603467,"about_ca_system_score_gemma":0.0016529127,"threshold_uncertainty_score":0.023923576},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014025363,0.0002902984,0.98184276,0.00024120374,0.00006565918,0.00012143461,0.000091844435,0.00020318772,0.0031181623],"genre_scores_gemma":[0.68553007,0.0005828808,0.304096,0.00017663745,0.00008730738,0.0006927656,0.0003095466,0.00008622326,0.008438574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963374,0.0018214311,0.00020290706,0.000589564,0.0007313685,0.00031729185],"domain_scores_gemma":[0.9975157,0.0014945875,0.00016091617,0.00008507972,0.0006380146,0.00010584768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062960833,0.0016070695,0.0032722359,0.0025156431,0.0016437186,0.003759501,0.003581633,0.0031542927,0.0052854163],"category_scores_gemma":[0.0062128194,0.0009807966,0.002254966,0.0026441365,0.001236882,0.0034531595,0.0016429535,0.0020500468,0.00060427614],"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.00009303698,0.00007345631,0.00057454937,0.000105255225,0.00012194272,0.000106020176,0.00010056818,0.9592167,0.00044742876,0.014331424,0.00078197976,0.02404759],"study_design_scores_gemma":[0.000008513342,0.000026980648,0.00008336518,0.0000068601767,0.00002145422,0.000013400228,0.000010183056,0.9963987,0.0000631098,0.0031899093,0.00016585425,0.000011512467],"about_ca_topic_score_codex":0.020163367,"about_ca_topic_score_gemma":0.013543727,"teacher_disagreement_score":0.020163367,"about_ca_system_score_codex":0.002888452,"about_ca_system_score_gemma":0.0033233454,"threshold_uncertainty_score":0.04009199},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084099986,0.0021720652,0.8318862,0.0009465578,0.0007745442,0.00064579677,0.026825149,0.04757291,0.0050768564],"genre_scores_gemma":[0.38037613,0.0012915053,0.54388934,0.00047624647,0.00022544431,0.00058874127,0.063689895,0.0017315659,0.0077310763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953985,0.00008577217,0.000024980127,0.00017132304,0.00012261306,0.000055436216],"domain_scores_gemma":[0.99907756,0.00032251136,0.00007729082,0.00026520158,0.00019306947,0.000064372296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006832321,0.0018311684,0.001144161,0.0034784027,0.0008451729,0.001431593,0.0018756007,0.0014377416,0.0048960946],"category_scores_gemma":[0.004098308,0.0005550126,0.001334096,0.0033168604,0.00041135898,0.0027943049,0.0019331843,0.0015222839,0.0020332905],"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.00082531065,0.0006416122,0.010336394,0.00072821986,0.00059393275,0.00046598777,0.00018951233,0.12331753,0.011449565,0.012670715,0.10411159,0.73466957],"study_design_scores_gemma":[0.000051523664,0.00011131139,0.001118115,0.000037691418,0.00006938796,0.00017960457,0.00007392829,0.9680389,0.003976031,0.014726035,0.011586586,0.000030959414],"about_ca_topic_score_codex":0.016261809,"about_ca_topic_score_gemma":0.028654575,"teacher_disagreement_score":0.016261809,"about_ca_system_score_codex":0.00082302024,"about_ca_system_score_gemma":0.0011690502,"threshold_uncertainty_score":0.032334328},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12354476,0.0036110852,0.85883886,0.000631099,0.0004948539,0.0003838941,0.0017274978,0.0067327847,0.004035228],"genre_scores_gemma":[0.7162475,0.0011469392,0.26366475,0.00076516566,0.0004076334,0.0004667783,0.0057856864,0.0002628118,0.011252786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987914,0.00021605083,0.000112289184,0.00037868824,0.000325493,0.0001760425],"domain_scores_gemma":[0.9988116,0.00026016432,0.00007638196,0.00017695333,0.0005736367,0.00010115184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027252808,0.0012214576,0.0013704625,0.0022049535,0.00076382235,0.0010990032,0.0013592099,0.0014188563,0.0028908013],"category_scores_gemma":[0.0031304506,0.00029248054,0.00094645907,0.0016590316,0.00031629938,0.0013950407,0.0024956497,0.0014738376,0.0022805126],"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.00061728025,0.00054614595,0.00547234,0.00009912522,0.00017130682,0.000096313415,0.000066960776,0.013694721,0.017688066,0.0008434989,0.009071962,0.95163214],"study_design_scores_gemma":[0.00007025753,0.00048254358,0.010260351,0.00005024432,0.00021590173,0.0002343819,0.00010650975,0.9634238,0.013635679,0.0042083203,0.0072565423,0.00005537903],"about_ca_topic_score_codex":0.002593058,"about_ca_topic_score_gemma":0.0040593566,"teacher_disagreement_score":0.0028908013,"about_ca_system_score_codex":0.00041301438,"about_ca_system_score_gemma":0.00095179945,"threshold_uncertainty_score":0.01441288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032053977,0.00041498372,0.9634893,0.0001944743,0.00014448492,0.00010745945,0.0009349475,0.0013986675,0.0012617225],"genre_scores_gemma":[0.56603473,0.00076409866,0.4251208,0.00014545173,0.00015094862,0.00029888196,0.0026311663,0.00008268928,0.0047712466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964213,0.000072806484,0.000027443553,0.000112835456,0.000107618245,0.00003722118],"domain_scores_gemma":[0.9991417,0.00036758342,0.00007042944,0.00012119094,0.00024393035,0.00005519136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008939697,0.0005161468,0.0009268669,0.0013531143,0.00061544287,0.00061497843,0.0011978876,0.00072558393,0.0020911081],"category_scores_gemma":[0.0024015652,0.00028268367,0.00054308906,0.001414288,0.00035904694,0.0012304661,0.0008234187,0.0006422584,0.0005602521],"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.0004981886,0.00024461266,0.00324517,0.00007852289,0.00008239605,0.00016142643,0.000060638915,0.7540392,0.0062381164,0.013727654,0.004491433,0.21713257],"study_design_scores_gemma":[0.0000025124566,0.00001406799,0.00011352364,0.0000018116473,0.000005130967,0.000011413702,0.0000030462718,0.9977837,0.00030480765,0.0014558941,0.00030149077,0.000002530769],"about_ca_topic_score_codex":0.017359601,"about_ca_topic_score_gemma":0.02040284,"teacher_disagreement_score":0.017359601,"about_ca_system_score_codex":0.0009213024,"about_ca_system_score_gemma":0.0014331732,"threshold_uncertainty_score":0.03451717},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17529242,0.00043256127,0.81662875,0.0003620705,0.0001558968,0.00021866038,0.00009812242,0.0003681239,0.006443455],"genre_scores_gemma":[0.87625563,0.00014912759,0.12092461,0.00008178316,0.000040481005,0.0001601261,0.00010920349,0.00003916488,0.002239878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974066,0.000077576515,0.000012881997,0.000048187325,0.00006322698,0.000057414534],"domain_scores_gemma":[0.9994609,0.0002826308,0.0000728039,0.000016507789,0.00009154107,0.00007564006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077080535,0.0007812231,0.0012868869,0.00095667207,0.00057821436,0.0008740037,0.0012470126,0.0010832383,0.0018473637],"category_scores_gemma":[0.0013481196,0.0004919183,0.00079934933,0.0006623391,0.0005193526,0.00057250564,0.0007859916,0.00068501726,0.0001497093],"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.000058334615,0.00005555727,0.00024712697,0.000029699486,0.000026996673,0.000027131171,0.00002133695,0.98824084,0.0007602674,0.0012417494,0.00025957238,0.00903151],"study_design_scores_gemma":[0.000014941234,0.000024711275,0.000063714775,0.0000014090261,0.000005329692,0.0000025671545,0.0000053686463,0.9995449,0.0000800824,0.00019800273,0.000057139325,0.000001697331],"about_ca_topic_score_codex":0.015121017,"about_ca_topic_score_gemma":0.009456345,"teacher_disagreement_score":0.015121017,"about_ca_system_score_codex":0.0010198837,"about_ca_system_score_gemma":0.0019652906,"threshold_uncertainty_score":0.030066013},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039390784,0.00037605155,0.9540637,0.00025387452,0.00016284376,0.00006189363,0.00024212264,0.0029133877,0.0025352454],"genre_scores_gemma":[0.53870666,0.0005019026,0.44333172,0.00035044848,0.00014384427,0.00009644197,0.0013752872,0.0023176929,0.013175914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993352,0.00008220933,0.000034739183,0.00013984865,0.00032069118,0.000087196975],"domain_scores_gemma":[0.99896586,0.0002784283,0.000069417416,0.00046052446,0.00018011896,0.00004563899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076671975,0.00084621087,0.0009380981,0.0011669397,0.0003787906,0.0012760807,0.0011378439,0.0010421332,0.0045401813],"category_scores_gemma":[0.002738499,0.00044022736,0.00078002585,0.001121864,0.00058053585,0.0011749101,0.0017274546,0.0009250164,0.001201053],"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.001224575,0.00018669272,0.0017391513,0.0002474331,0.00017202727,0.0003505814,0.000181457,0.2275847,0.11432987,0.013849889,0.010353407,0.6297802],"study_design_scores_gemma":[0.000020722673,0.00009025406,0.0006817521,0.000015065328,0.000044813212,0.0002755371,0.00002502057,0.952945,0.03600018,0.0059173917,0.0039713215,0.000012858438],"about_ca_topic_score_codex":0.0020470347,"about_ca_topic_score_gemma":0.0032752668,"teacher_disagreement_score":0.0045401813,"about_ca_system_score_codex":0.00062598207,"about_ca_system_score_gemma":0.00066578126,"threshold_uncertainty_score":0.015188396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06624036,0.0005528175,0.927373,0.0007127322,0.00011349705,0.000271379,0.0007100643,0.0013705388,0.0026555555],"genre_scores_gemma":[0.6610938,0.00021582673,0.32920662,0.00022719451,0.00017628708,0.0003033459,0.003133008,0.00024998718,0.005393945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711096,0.0010554941,0.00019021564,0.00089646137,0.00044763452,0.0002991953],"domain_scores_gemma":[0.9860874,0.009310706,0.0007316306,0.0015828575,0.001519662,0.0007677147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026291157,0.0009774026,0.0022730788,0.0033443086,0.0017807276,0.0018445187,0.0035110095,0.0034860156,0.006037833],"category_scores_gemma":[0.016857207,0.0007078133,0.0014902643,0.0026334708,0.0012414586,0.0058103385,0.0059900973,0.002198605,0.0017948434],"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.0012153034,0.0014333997,0.010356541,0.0007786373,0.0003601318,0.0002981971,0.0024007082,0.28442147,0.012037731,0.07049625,0.023971174,0.59223044],"study_design_scores_gemma":[0.000027829887,0.000049771796,0.00031789503,0.000015108714,0.000020883856,0.000024749654,0.00016518371,0.9625806,0.00088152563,0.034964133,0.00094163785,0.000010629183],"about_ca_topic_score_codex":0.0063299323,"about_ca_topic_score_gemma":0.008500538,"teacher_disagreement_score":0.0063299323,"about_ca_system_score_codex":0.0010364939,"about_ca_system_score_gemma":0.0014701365,"threshold_uncertainty_score":0.020198584},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03255828,0.8798204,0.00089887745,0.017620066,0.0007043427,0.00011222881,0.021334605,0.00019944977,0.04675182],"genre_scores_gemma":[0.18674152,0.7939269,0.0028650926,0.0016567467,0.00078711193,0.00006268444,0.009673064,0.000059131205,0.0042277635],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.991002,0.0006001185,0.0010886657,0.0006660969,0.005862799,0.00078033644],"domain_scores_gemma":[0.9359972,0.009399495,0.0051403944,0.0006533674,0.045770887,0.0030386043],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.008031045,0.00085960026,0.0022699286,0.1566822,0.0038022285,0.012018244,0.0019549336,0.0012877028,0.003100565],"category_scores_gemma":[0.026349628,0.0005166356,0.0012855387,0.3376083,0.002559378,0.0038086257,0.002289234,0.0011747456,0.00042315281],"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.00021346546,0.00018113934,0.18670169,0.01938082,0.0015005935,0.0002876291,0.0022274584,0.002063017,0.00044526928,0.039220873,0.13867979,0.60909826],"study_design_scores_gemma":[0.000036249956,0.000071671835,0.58107764,0.017170956,0.0016043858,0.0005166742,0.0061632977,0.0019605234,0.00081039517,0.00717998,0.38321677,0.00019140581],"about_ca_topic_score_codex":0.94397664,"about_ca_topic_score_gemma":0.96672666,"teacher_disagreement_score":0.9370433,"about_ca_system_score_codex":0.06295667,"about_ca_system_score_gemma":0.122253545,"threshold_uncertainty_score":0.45678473},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24421932,0.0072150454,0.6478826,0.0037239157,0.001403868,0.00070167024,0.03561969,0.042134874,0.017099],"genre_scores_gemma":[0.76291174,0.0014044228,0.18467505,0.0022863275,0.0005222499,0.00043385464,0.03036979,0.0014155296,0.015981058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997551,0.000039235212,0.000012934452,0.00008675722,0.000031969903,0.00007394359],"domain_scores_gemma":[0.9997415,0.00009923236,0.000029970908,0.000032943957,0.000050186703,0.000046211895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058020424,0.0014530725,0.00078104634,0.001335804,0.0005325043,0.0009363693,0.0015373527,0.001749433,0.004024026],"category_scores_gemma":[0.0018015724,0.0005288324,0.00092407514,0.0007416451,0.00027173563,0.00070085836,0.0013749413,0.0010914827,0.0018169839],"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.0018072778,0.00059220527,0.055823587,0.0005195425,0.00086915074,0.0013330441,0.00030282332,0.18732485,0.012332232,0.0032727835,0.13582574,0.5999967],"study_design_scores_gemma":[0.000039715607,0.000118876414,0.0043681026,0.00006770746,0.00012510837,0.00026345605,0.00008706844,0.97879046,0.0041433857,0.005398616,0.006562219,0.000035363937],"about_ca_topic_score_codex":0.024997735,"about_ca_topic_score_gemma":0.043518383,"teacher_disagreement_score":0.024997735,"about_ca_system_score_codex":0.0008498985,"about_ca_system_score_gemma":0.0013468234,"threshold_uncertainty_score":0.049704492},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018862208,0.00025738307,0.977453,0.00018930156,0.000097112345,0.00004818278,0.00009998826,0.00023524743,0.0027576424],"genre_scores_gemma":[0.960284,0.0002315126,0.03567451,0.00009263839,0.000046993166,0.00018497424,0.00020231944,0.00008742733,0.0031955258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995703,0.00012782744,0.000024901468,0.0000755011,0.00016220416,0.0000392579],"domain_scores_gemma":[0.99880433,0.0006806856,0.00010623457,0.000092556285,0.00027492602,0.000041292322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010715552,0.000706241,0.0008700341,0.00038983734,0.0003528084,0.0010679532,0.0009696226,0.0006941384,0.0026697181],"category_scores_gemma":[0.0037125754,0.0004273515,0.00040828594,0.00048177852,0.00088533113,0.0009483095,0.0017584212,0.0012267866,0.00039110705],"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.00031230733,0.000077110046,0.00030449155,0.0003820236,0.000042998832,0.00007222709,0.00017623836,0.8729186,0.008374177,0.049793355,0.0020998097,0.065446675],"study_design_scores_gemma":[0.000009571192,0.00003608113,0.000062744606,0.000007086382,0.000002346495,0.000005246817,0.0000049271566,0.9896263,0.0010453227,0.008803184,0.0003912808,0.0000058326805],"about_ca_topic_score_codex":0.0025013613,"about_ca_topic_score_gemma":0.0017293091,"teacher_disagreement_score":0.0026697181,"about_ca_system_score_codex":0.00061659975,"about_ca_system_score_gemma":0.00070418214,"threshold_uncertainty_score":0.0089311},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030046966,0.0009628224,0.9588484,0.00033012396,0.00014246632,0.00006655436,0.00008078725,0.00015630966,0.009365544],"genre_scores_gemma":[0.9212391,0.0018988951,0.06726895,0.00016950577,0.0003333394,0.0003007444,0.0002482951,0.0001356905,0.008405413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994166,0.00013838786,0.000037057875,0.00016996916,0.00018604226,0.000051870058],"domain_scores_gemma":[0.9984847,0.0007831255,0.00019653817,0.00008822475,0.00037791493,0.00006960222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009133488,0.00088646566,0.0007366886,0.0013212224,0.0007706155,0.0013688691,0.0008403159,0.0011566135,0.0024963906],"category_scores_gemma":[0.0035885451,0.00018587327,0.0011957905,0.0011418354,0.001229109,0.0013910169,0.0011900874,0.0014598276,0.00035344702],"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.0001234428,0.00007763116,0.0008385294,0.0002332568,0.000094601404,0.00036881294,0.00041443759,0.2800497,0.013674215,0.6459124,0.0024691953,0.055743814],"study_design_scores_gemma":[0.000011478193,0.000050736737,0.00017542635,0.000010789955,0.000010198037,0.000072393676,0.000024309302,0.91131264,0.0007001844,0.086129494,0.0014883231,0.000014079291],"about_ca_topic_score_codex":0.0022931274,"about_ca_topic_score_gemma":0.00080379826,"teacher_disagreement_score":0.0024963906,"about_ca_system_score_codex":0.00068689045,"about_ca_system_score_gemma":0.00072069414,"threshold_uncertainty_score":0.008351266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012706814,0.00077852106,0.9771006,0.00028433307,0.00036388278,0.00011040303,0.0001509435,0.0027993154,0.0057052555],"genre_scores_gemma":[0.30415928,0.00074689277,0.6805368,0.00035649343,0.00021942092,0.00029209274,0.00066283334,0.0006507104,0.012375478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995376,0.000116567026,0.000034998764,0.00008950025,0.00018460308,0.000036723406],"domain_scores_gemma":[0.9995807,0.00011400596,0.000043924803,0.00008952861,0.00013674103,0.000035050845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078608416,0.0006691502,0.0010368677,0.00068478746,0.0003553104,0.0008369105,0.0014209483,0.0012626342,0.0025022347],"category_scores_gemma":[0.002969985,0.00023056871,0.0005882459,0.001193966,0.00045402563,0.0012977028,0.0009977539,0.0014497434,0.0010084262],"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.00044709363,0.00038788677,0.0016270638,0.00044914923,0.00024532925,0.00024911412,0.000104902705,0.38568687,0.014455039,0.027757347,0.019832926,0.5487572],"study_design_scores_gemma":[0.000092064016,0.00008444314,0.00032906755,0.000015401192,0.000027346678,0.00013262012,0.000006069738,0.9844632,0.005562665,0.0030218556,0.0062463228,0.00001889639],"about_ca_topic_score_codex":0.0019507246,"about_ca_topic_score_gemma":0.0018013982,"teacher_disagreement_score":0.0025022347,"about_ca_system_score_codex":0.0004048032,"about_ca_system_score_gemma":0.0006631956,"threshold_uncertainty_score":0.008370817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104311995,0.0006026342,0.8589705,0.00079590967,0.000511193,0.00070096116,0.0017024693,0.028234996,0.004169398],"genre_scores_gemma":[0.37360796,0.00045012872,0.6146602,0.00030358188,0.000241483,0.0004094593,0.0035944146,0.00079992745,0.005932951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991574,0.00017832572,0.00007126701,0.00026694653,0.00023907877,0.00008699425],"domain_scores_gemma":[0.99730104,0.0012140148,0.0002122296,0.00054474856,0.00059223885,0.0001356677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025099313,0.0016004331,0.0009422389,0.001867942,0.0006899323,0.0018838869,0.0018940368,0.0011586926,0.005249326],"category_scores_gemma":[0.008489119,0.00065517414,0.0009900687,0.0017820632,0.00048361113,0.00485439,0.002272694,0.0019852822,0.003304966],"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.00040681186,0.00042674522,0.0029029967,0.00011816814,0.00012771272,0.000078855795,0.00034938482,0.006991743,0.011096414,0.0013632686,0.015375264,0.9607627],"study_design_scores_gemma":[0.00014426585,0.00026445376,0.0029476988,0.000032363885,0.00019325776,0.000104688836,0.0003551,0.9496488,0.021175904,0.016369086,0.008703682,0.000060638667],"about_ca_topic_score_codex":0.0044111037,"about_ca_topic_score_gemma":0.009043433,"teacher_disagreement_score":0.005249326,"about_ca_system_score_codex":0.0007229563,"about_ca_system_score_gemma":0.0010562863,"threshold_uncertainty_score":0.01756072},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005193076,0.0009818783,0.985782,0.00051917264,0.00026181384,0.0001322026,0.00011550947,0.00022703176,0.0067873024],"genre_scores_gemma":[0.16493325,0.0006574573,0.82924306,0.00026358163,0.00024948883,0.00023231376,0.00032125838,0.00019276614,0.0039068405],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9803477,0.012209312,0.0008509398,0.0012799605,0.0044242144,0.000887874],"domain_scores_gemma":[0.9810052,0.012984132,0.00057593687,0.0013669237,0.003368494,0.0006992444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015729638,0.0017397966,0.0033157256,0.007362675,0.0024111427,0.0055679283,0.0025234735,0.0021284919,0.011543684],"category_scores_gemma":[0.037420914,0.00068998395,0.0024803728,0.004151356,0.0019053556,0.0038466274,0.0021690396,0.0033424112,0.0013316808],"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.0009406234,0.0004382811,0.0028333538,0.0014681908,0.00064335624,0.00016123646,0.00032449496,0.15134299,0.0018952849,0.3174726,0.018853797,0.50362575],"study_design_scores_gemma":[0.0001706077,0.0003543696,0.00082124287,0.00020971101,0.00023311094,0.00025304517,0.00014440676,0.59301966,0.0015965785,0.39329392,0.009799354,0.000103991355],"about_ca_topic_score_codex":0.00373313,"about_ca_topic_score_gemma":0.004121251,"teacher_disagreement_score":0.015729638,"about_ca_system_score_codex":0.0025444746,"about_ca_system_score_gemma":0.004374257,"threshold_uncertainty_score":0.08318728},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027186465,0.00063448143,0.99457633,0.00036434975,0.00006509142,0.000019282925,0.0001159096,0.00013132738,0.001374535],"genre_scores_gemma":[0.17557202,0.0039043499,0.79574263,0.0007445232,0.00077799626,0.0002884478,0.0011568157,0.00046221836,0.021351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991295,0.00034319877,0.000043429238,0.00013767644,0.00028551446,0.000060718845],"domain_scores_gemma":[0.99733764,0.0016525085,0.00020097567,0.000296409,0.00042418038,0.000088307985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001595101,0.0011997169,0.0013121207,0.00075109804,0.00036662555,0.001254441,0.0010761059,0.002092893,0.0039300127],"category_scores_gemma":[0.008609364,0.00056841224,0.000644405,0.0013284018,0.001405488,0.002007739,0.0016410775,0.0029781542,0.0014023582],"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.00050188426,0.00025950672,0.00047660907,0.0011785281,0.00020793271,0.00027511033,0.00023288958,0.33496645,0.03338756,0.28603002,0.026540589,0.3159429],"study_design_scores_gemma":[0.000028101533,0.00005680337,0.00013500098,0.000030110208,0.000021443206,0.00008201791,0.000024649127,0.9016364,0.003991668,0.08964673,0.0043247826,0.000022264596],"about_ca_topic_score_codex":0.0030408187,"about_ca_topic_score_gemma":0.0036911326,"teacher_disagreement_score":0.0039300127,"about_ca_system_score_codex":0.00046626144,"about_ca_system_score_gemma":0.0009615037,"threshold_uncertainty_score":0.013147175},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003203597,0.0000974487,0.9956632,0.00027165053,0.000020352894,0.000049392886,0.000088333254,0.00015703405,0.0004489391],"genre_scores_gemma":[0.585728,0.00045856892,0.40857708,0.00041605387,0.00029413553,0.000516683,0.0005850281,0.00015432756,0.0032700994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98058414,0.010638302,0.001209947,0.0026535739,0.004060065,0.00085389626],"domain_scores_gemma":[0.9585312,0.019873194,0.0023806628,0.016223898,0.0024318253,0.00055921153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013049808,0.00090754626,0.0020412225,0.0018379092,0.0014288499,0.004813721,0.0030659225,0.0014387786,0.0027258224],"category_scores_gemma":[0.063036084,0.00096651894,0.0017295938,0.0037561664,0.0040456885,0.008430303,0.009155415,0.0032299196,0.0012820233],"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.0011790288,0.0002070929,0.003628559,0.0003625724,0.0003010286,0.00046060383,0.00061262836,0.08189649,0.0075183017,0.7255759,0.004801168,0.17345673],"study_design_scores_gemma":[0.00007788927,0.00014448666,0.0005167062,0.000043148157,0.00007152724,0.0005280297,0.00011281656,0.45059454,0.011254115,0.53313756,0.0034759096,0.000043399275],"about_ca_topic_score_codex":0.000695249,"about_ca_topic_score_gemma":0.00052489067,"teacher_disagreement_score":0.013049808,"about_ca_system_score_codex":0.0020597668,"about_ca_system_score_gemma":0.0034726355,"threshold_uncertainty_score":0.06901485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19318727,0.00075853063,0.79650956,0.00036102984,0.00012227356,0.00019082463,0.00018189194,0.0020411867,0.0066473563],"genre_scores_gemma":[0.97778225,0.000118549724,0.020135086,0.000020605508,0.000017796718,0.00003503838,0.00005190169,0.000012316074,0.0018263733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881244,0.000273534,0.00006221119,0.0001950225,0.0004469788,0.00020994215],"domain_scores_gemma":[0.99829334,0.0004711492,0.00026080967,0.000525154,0.00033958687,0.00010990591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007500105,0.00040609625,0.0009484397,0.0008437069,0.0010484648,0.001288153,0.0009814701,0.0010504763,0.0031314893],"category_scores_gemma":[0.0024873412,0.00023343213,0.0002417301,0.0007345361,0.00067279127,0.0023174798,0.0016433273,0.00061338855,0.0007455013],"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.0035989897,0.0004271675,0.012415088,0.0006606853,0.0002070406,0.0022530796,0.0007323819,0.2594512,0.16883138,0.11086735,0.0059117754,0.4346439],"study_design_scores_gemma":[0.00007737363,0.00038077158,0.0009572062,0.00004023163,0.00004359907,0.00053965946,0.000095947,0.9459806,0.035064988,0.013877603,0.0029055653,0.000036378256],"about_ca_topic_score_codex":0.0013378711,"about_ca_topic_score_gemma":0.0015374478,"teacher_disagreement_score":0.0031314893,"about_ca_system_score_codex":0.00064352306,"about_ca_system_score_gemma":0.0011166453,"threshold_uncertainty_score":0.010475814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012565323,0.00023102175,0.9935309,0.00117955,0.0000704467,0.00011554762,0.0001680179,0.0010858158,0.0023621458],"genre_scores_gemma":[0.3029518,0.0012342086,0.6791296,0.0020012066,0.00041088843,0.00057909614,0.00094813714,0.00067756296,0.012067589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991524,0.0035890276,0.00061261497,0.0009718912,0.0026175005,0.00068497757],"domain_scores_gemma":[0.990442,0.0037041304,0.00055115507,0.0038468274,0.00097095105,0.00048491583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012318585,0.0009270771,0.0011597716,0.0018288846,0.0019879066,0.007906502,0.005029237,0.0029852788,0.005765487],"category_scores_gemma":[0.019949531,0.001080592,0.0023690872,0.0019833418,0.0040067597,0.010091868,0.009470086,0.0055473885,0.0014080214],"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.00018964785,0.00009535275,0.00077150884,0.00017780412,0.00008486787,0.0003167809,0.00058884645,0.021090055,0.001352278,0.91046655,0.009271046,0.055595186],"study_design_scores_gemma":[0.00006253825,0.00008506443,0.00031724732,0.00015972018,0.00011006192,0.00046745388,0.00024127898,0.22111596,0.006102376,0.715902,0.055362906,0.00007341885],"about_ca_topic_score_codex":0.0037031637,"about_ca_topic_score_gemma":0.0039516347,"teacher_disagreement_score":0.012318585,"about_ca_system_score_codex":0.0021498513,"about_ca_system_score_gemma":0.0046278615,"threshold_uncertainty_score":0.06514764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15235579,0.00032361696,0.8426024,0.00015185958,0.00012070928,0.000027361966,0.000028797293,0.00008735762,0.004302052],"genre_scores_gemma":[0.9930315,0.0000714779,0.0059561883,0.000013661194,0.000008448408,0.000011768063,0.000009815926,0.0000031099107,0.00089404447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983656,0.000026205282,0.000008320373,0.000046721136,0.000052160525,0.000029933452],"domain_scores_gemma":[0.99981564,0.000053405118,0.000053487485,0.000012567186,0.00005341653,0.000011450938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003866955,0.0004911792,0.0005734469,0.00025421093,0.00042584457,0.00067660626,0.00055917935,0.00058645953,0.0004732244],"category_scores_gemma":[0.00076847564,0.00015973988,0.0004151806,0.0002922219,0.00057614833,0.00051296904,0.00051379215,0.00044495435,0.00004190231],"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.00009016538,0.000019681507,0.00034045815,0.000037663056,0.000022074028,0.000088658606,0.00005894812,0.974398,0.006296693,0.008469172,0.00015113142,0.010027395],"study_design_scores_gemma":[0.0000028078264,0.000018895302,0.000092840935,0.0000013305091,0.000003147683,0.0000040047603,0.000003364697,0.99873084,0.00023600341,0.0008550828,0.000049683033,0.0000020052512],"about_ca_topic_score_codex":0.010856265,"about_ca_topic_score_gemma":0.0055345716,"teacher_disagreement_score":0.010856265,"about_ca_system_score_codex":0.00067159045,"about_ca_system_score_gemma":0.00067438075,"threshold_uncertainty_score":0.02158618},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079624556,0.001327501,0.8913141,0.0018971957,0.00035941164,0.00036127315,0.0050031426,0.014311371,0.0058014565],"genre_scores_gemma":[0.6409075,0.0005280955,0.34576485,0.0007760621,0.00022582155,0.00025567028,0.0077796173,0.0005218201,0.0032405553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979843,0.00049344235,0.00016922163,0.0006639023,0.0005670743,0.000121990786],"domain_scores_gemma":[0.9866498,0.010194284,0.00046410272,0.0016557572,0.00075739756,0.0002787681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036735735,0.0016167654,0.0013473424,0.0028703518,0.0008895009,0.0031044537,0.0030084306,0.0024222294,0.008177763],"category_scores_gemma":[0.025450815,0.00084507023,0.0019551588,0.001486749,0.001468463,0.006414227,0.0038210573,0.0039226892,0.0017052678],"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.0013385974,0.00049926084,0.007305731,0.00061290833,0.00040751338,0.00074383017,0.00057565165,0.29247537,0.003786805,0.029836291,0.017456975,0.64496106],"study_design_scores_gemma":[0.000037094946,0.00009718243,0.00036108942,0.00007288692,0.000048626556,0.000066975495,0.000075609634,0.94644564,0.0024504357,0.047737163,0.0025849545,0.000022381777],"about_ca_topic_score_codex":0.006490781,"about_ca_topic_score_gemma":0.01259967,"teacher_disagreement_score":0.008177763,"about_ca_system_score_codex":0.001392805,"about_ca_system_score_gemma":0.0021085248,"threshold_uncertainty_score":0.02735734},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012028331,0.0005105475,0.9646077,0.0005622164,0.00020196868,0.00017524099,0.0053146165,0.014430673,0.0021686458],"genre_scores_gemma":[0.21688017,0.00097406836,0.7481113,0.0005415737,0.00019788454,0.0007926985,0.020530928,0.0023855232,0.009585823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952805,0.00014241681,0.000017941582,0.00018518002,0.000094337476,0.00003203876],"domain_scores_gemma":[0.99824727,0.0011227576,0.000084835425,0.0003438742,0.00011894588,0.000082274724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012607438,0.0015327234,0.0010639086,0.0020973843,0.00067723944,0.0016903622,0.0022337576,0.0016030975,0.008484999],"category_scores_gemma":[0.0073775207,0.0008888431,0.0011799093,0.001954287,0.00061789044,0.0031200515,0.002459144,0.002772993,0.0027072204],"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.00049644575,0.00032437764,0.002777411,0.0005334098,0.00046140878,0.00031581722,0.00016239955,0.5143293,0.0032678868,0.045159984,0.07417234,0.35799915],"study_design_scores_gemma":[0.000035076137,0.00001840232,0.000088703826,0.000011622677,0.000016525175,0.000025463953,0.000013528292,0.9748327,0.00052382745,0.02133379,0.0030940503,0.000006229566],"about_ca_topic_score_codex":0.0072292103,"about_ca_topic_score_gemma":0.014790596,"teacher_disagreement_score":0.008484999,"about_ca_system_score_codex":0.0009687459,"about_ca_system_score_gemma":0.0011649217,"threshold_uncertainty_score":0.028385103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21473278,0.0007138246,0.7800699,0.00066399545,0.00009171731,0.00021472928,0.00029522972,0.0007933888,0.0024244296],"genre_scores_gemma":[0.59505755,0.00022273438,0.3987409,0.00045313078,0.0000928418,0.00048682198,0.0009871472,0.00012464906,0.0038342364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931943,0.00024343129,0.000047519494,0.00021162246,0.00009975006,0.000078342],"domain_scores_gemma":[0.9971745,0.0022827452,0.00012370072,0.00006013355,0.00028143887,0.00007735562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021719206,0.0015836058,0.0019392264,0.0024775253,0.00084059336,0.0012006034,0.002297442,0.0024923198,0.0029402939],"category_scores_gemma":[0.005032583,0.0007132242,0.0013260576,0.0013493507,0.00072755973,0.0008108624,0.0013671656,0.0011823671,0.00035919313],"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.00028167182,0.0002768206,0.00699798,0.000116602685,0.0002825904,0.0002279215,0.00008928888,0.9035244,0.0019688765,0.002726897,0.0013046644,0.08220216],"study_design_scores_gemma":[0.000023691502,0.00003506727,0.00020770382,0.0000051834304,0.000022250186,0.000021182252,0.000008959256,0.9988681,0.00012811317,0.0005929989,0.00008355068,0.0000032162554],"about_ca_topic_score_codex":0.0043949643,"about_ca_topic_score_gemma":0.004094279,"teacher_disagreement_score":0.0043949643,"about_ca_system_score_codex":0.00064891385,"about_ca_system_score_gemma":0.0015929594,"threshold_uncertainty_score":0.0114863515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038558807,0.0007560504,0.95129025,0.00035157526,0.000120023455,0.00006574291,0.00012522098,0.0025194527,0.0062128557],"genre_scores_gemma":[0.8979196,0.00033611228,0.09607769,0.0002137071,0.000027593382,0.00009760748,0.00017838807,0.000104931365,0.005044412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974674,0.0000405974,0.000012601423,0.00007432341,0.00007241135,0.00005322288],"domain_scores_gemma":[0.9995976,0.00016816061,0.000059770315,0.000052460815,0.0000868033,0.000035258836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005180545,0.0007198931,0.00057437434,0.00036901896,0.0002615489,0.000588022,0.0013540632,0.00076209847,0.0023008764],"category_scores_gemma":[0.0016795292,0.00032568848,0.0004322351,0.0003216125,0.000605925,0.00090666336,0.000808834,0.000998216,0.00038953387],"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.000089218556,0.00006377732,0.0007856735,0.00007094155,0.00003991745,0.00007204539,0.00003241115,0.86970335,0.0052410313,0.011472968,0.0015918139,0.110836826],"study_design_scores_gemma":[0.0000031118873,0.00001598111,0.00006416258,0.0000037189577,0.000003897248,0.000007776733,0.0000014408383,0.99544,0.00095340016,0.0031158477,0.00038740292,0.0000032171974],"about_ca_topic_score_codex":0.0070768204,"about_ca_topic_score_gemma":0.007491525,"teacher_disagreement_score":0.0070768204,"about_ca_system_score_codex":0.0011953043,"about_ca_system_score_gemma":0.0010602272,"threshold_uncertainty_score":0.014071286},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020485265,0.0002778266,0.97437084,0.0005665274,0.00007771235,0.00008768829,0.00048044845,0.0011422132,0.002511458],"genre_scores_gemma":[0.7388282,0.00049490324,0.25293243,0.00062026427,0.0002316839,0.00019934739,0.0011245061,0.00022602487,0.0053426847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916501,0.0021518192,0.0005427596,0.0013791448,0.0031310383,0.0011452057],"domain_scores_gemma":[0.9822275,0.0089601,0.00083682785,0.0063250717,0.0012824729,0.00036799943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003662252,0.00076287525,0.0026430138,0.0012543054,0.0014390176,0.003529652,0.0036436094,0.0021237482,0.0034115906],"category_scores_gemma":[0.014099927,0.0010392928,0.0021663206,0.0021372216,0.002014571,0.008689863,0.0065049906,0.004311375,0.0015085118],"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.0015431495,0.00060944335,0.0031121382,0.00049045094,0.0004550138,0.000675271,0.00081420067,0.17021121,0.020679576,0.52898234,0.013907393,0.25851992],"study_design_scores_gemma":[0.00010539107,0.000142605,0.0004833618,0.00003875058,0.0001196814,0.0004905065,0.00009240274,0.57689005,0.011642548,0.40738678,0.002545206,0.00006285415],"about_ca_topic_score_codex":0.001209039,"about_ca_topic_score_gemma":0.0017717016,"teacher_disagreement_score":0.003662252,"about_ca_system_score_codex":0.0014881139,"about_ca_system_score_gemma":0.004120787,"threshold_uncertainty_score":0.019368112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064079734,0.0014961078,0.9813405,0.00035241348,0.00014935965,0.00012511069,0.00013307032,0.002585691,0.0074097114],"genre_scores_gemma":[0.120049804,0.0010321705,0.8715006,0.0004188757,0.00020321978,0.00023268088,0.00026143802,0.0004557539,0.005845431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982888,0.00053527084,0.00013395766,0.00033030083,0.0005008736,0.00021066601],"domain_scores_gemma":[0.99456716,0.0024670786,0.00020451726,0.0018295234,0.00071732496,0.00021439441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022988752,0.001617841,0.0013189907,0.0016076717,0.0010934622,0.0021699208,0.0028926793,0.0015852457,0.011033092],"category_scores_gemma":[0.0097564915,0.00088336354,0.0013233054,0.0021091579,0.0016304144,0.0043953964,0.0026700802,0.004539789,0.003984686],"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.0006023322,0.00039301848,0.00091743405,0.00083648873,0.00015270326,0.000080416416,0.00040424478,0.080186255,0.023237748,0.22381596,0.01365495,0.6557185],"study_design_scores_gemma":[0.00017281348,0.00027869054,0.00046672992,0.00012643762,0.00010489337,0.0001272271,0.0001134857,0.79310924,0.025245886,0.14928932,0.030862192,0.00010298685],"about_ca_topic_score_codex":0.007100757,"about_ca_topic_score_gemma":0.011830556,"teacher_disagreement_score":0.011033092,"about_ca_system_score_codex":0.0016950163,"about_ca_system_score_gemma":0.003010853,"threshold_uncertainty_score":0.03690934},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020093704,0.00014296568,0.9765206,0.00010095758,0.000021642943,0.00026316664,0.00007224759,0.00016527879,0.0026194123],"genre_scores_gemma":[0.5478656,0.00026709453,0.44815642,0.000089030356,0.00002776005,0.00052020076,0.00021155,0.000052488405,0.0028098172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994493,0.003227214,0.0003347651,0.0006432141,0.00094601547,0.00035569252],"domain_scores_gemma":[0.9929288,0.0056149336,0.0003022936,0.00026719837,0.00072469254,0.00016218306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007417478,0.0009604768,0.0022352375,0.002007372,0.0011533129,0.0024875696,0.002093411,0.0015340799,0.0067639314],"category_scores_gemma":[0.010086701,0.0007640458,0.0022447545,0.0019590177,0.0013858093,0.0026329006,0.0023361738,0.0012757435,0.0007324269],"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.0009143246,0.00025249633,0.0019743724,0.00057077943,0.00031523328,0.00020386498,0.00058658974,0.72250485,0.0047625573,0.0895522,0.0012667679,0.17709595],"study_design_scores_gemma":[0.000047209385,0.00023836156,0.00031887786,0.000037999238,0.00007864536,0.00003606538,0.00005912451,0.9619426,0.0018118873,0.03455901,0.0008459476,0.00002421294],"about_ca_topic_score_codex":0.006235518,"about_ca_topic_score_gemma":0.0057114502,"teacher_disagreement_score":0.007417478,"about_ca_system_score_codex":0.001723065,"about_ca_system_score_gemma":0.002466732,"threshold_uncertainty_score":0.039227903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004325774,0.00016687796,0.99458283,0.00007307001,0.00003210615,0.000012486638,0.00005557564,0.00020794143,0.0005433431],"genre_scores_gemma":[0.72506607,0.0018778937,0.26130632,0.00016233839,0.00019022352,0.00022985702,0.0010441841,0.00035532168,0.009767763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914896,0.00031381872,0.00003906187,0.00021694429,0.00020114357,0.0000800174],"domain_scores_gemma":[0.998485,0.00089904177,0.00018391009,0.00016306758,0.00021554524,0.000053423842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012065385,0.00090757565,0.0013431732,0.001258402,0.0004958901,0.0011905268,0.0017674614,0.0010775278,0.0022608978],"category_scores_gemma":[0.0047544483,0.0012008757,0.0014753458,0.0020153807,0.0010789261,0.001956175,0.001317378,0.0015130047,0.0011696032],"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.00008919344,0.000018953144,0.00065281085,0.00004128471,0.00005474471,0.000031183554,0.00004925513,0.94857424,0.00096265634,0.018866673,0.00057398365,0.030084914],"study_design_scores_gemma":[0.0000026917091,0.000006407369,0.00009990212,0.0000033752613,0.000008414411,0.000014037581,0.0000029346181,0.9954788,0.00017822103,0.0039016234,0.00029714257,0.000006450243],"about_ca_topic_score_codex":0.010303378,"about_ca_topic_score_gemma":0.009605645,"teacher_disagreement_score":0.010303378,"about_ca_system_score_codex":0.0008066961,"about_ca_system_score_gemma":0.00078156195,"threshold_uncertainty_score":0.020486832},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1477851,0.0027648816,0.842103,0.00083435554,0.00034746336,0.00004895392,0.00089355576,0.0015825724,0.0036401886],"genre_scores_gemma":[0.96300054,0.0006973537,0.03288928,0.00012616292,0.0001552529,0.000036340807,0.00066556997,0.000048312497,0.0023812926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997471,0.00004160044,0.000011281399,0.000097198295,0.000045225548,0.00005764572],"domain_scores_gemma":[0.9994017,0.0002938993,0.000060529823,0.000054132626,0.00014446316,0.000045203284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049038156,0.0006363195,0.0008919112,0.0015239517,0.00045697976,0.00063656934,0.0012472495,0.0007642359,0.0014974845],"category_scores_gemma":[0.0018255466,0.00028494906,0.00052576547,0.0018384246,0.00027956654,0.0015372195,0.00072386663,0.0009319271,0.00024699562],"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.00033946274,0.0002201769,0.004428356,0.000108438915,0.000121460296,0.00012083365,0.00009385823,0.76093584,0.0040221587,0.009804856,0.0063970825,0.21340741],"study_design_scores_gemma":[0.0000012547098,0.000005699779,0.00022798475,0.0000013227678,0.000006802019,0.0000047433336,0.0000040279842,0.99802184,0.00010603368,0.0015176801,0.000100939884,0.0000016191473],"about_ca_topic_score_codex":0.030579709,"about_ca_topic_score_gemma":0.027954161,"teacher_disagreement_score":0.030579709,"about_ca_system_score_codex":0.0011556982,"about_ca_system_score_gemma":0.0008267341,"threshold_uncertainty_score":0.060803473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048672244,0.0009866429,0.9415607,0.00075426156,0.00020816784,0.00024514718,0.0022576398,0.0020017999,0.0033134208],"genre_scores_gemma":[0.77864605,0.0010485388,0.20740338,0.0005221299,0.00028280608,0.0001831577,0.004555414,0.00012847841,0.007229986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572045,0.0008521527,0.00030377385,0.00067012233,0.0018829693,0.0005706136],"domain_scores_gemma":[0.9924556,0.0019636436,0.00048018998,0.0036967604,0.0011833245,0.00022045837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002146522,0.0007596261,0.0022478888,0.0019431442,0.0013611459,0.0026632003,0.0028090712,0.0017138516,0.0015066342],"category_scores_gemma":[0.012225666,0.0006241772,0.0011429568,0.005413892,0.0009172811,0.0050069713,0.003412581,0.0017328152,0.0016369815],"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.0018088645,0.0007321553,0.017581617,0.0007423554,0.00048540233,0.0010695796,0.0011513806,0.23466398,0.03863539,0.07886044,0.027429694,0.59683913],"study_design_scores_gemma":[0.000028988952,0.00010034344,0.0012967086,0.000039850915,0.000058825673,0.0006205339,0.0002703043,0.9407653,0.007143929,0.0447712,0.004861125,0.00004293742],"about_ca_topic_score_codex":0.007865201,"about_ca_topic_score_gemma":0.010663678,"teacher_disagreement_score":0.007865201,"about_ca_system_score_codex":0.00096740614,"about_ca_system_score_gemma":0.0026598398,"threshold_uncertainty_score":0.015638828},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00445999,0.00010364527,0.99276733,0.00007720906,0.000024120996,0.00005038508,0.000011958811,0.00011312979,0.00239219],"genre_scores_gemma":[0.90768415,0.00027188158,0.08854027,0.000104636514,0.00006182504,0.0002761494,0.00006455007,0.00011345152,0.0028831903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875116,0.0003352249,0.000060987826,0.00015147585,0.00056528783,0.00013589347],"domain_scores_gemma":[0.99835926,0.0007197583,0.00018660627,0.000115231516,0.00056964596,0.000049553135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026116115,0.0011575917,0.0008332728,0.0005990044,0.00051720784,0.0016019348,0.0010735088,0.00073450146,0.0025213235],"category_scores_gemma":[0.004469982,0.0004907486,0.00073627697,0.00029925408,0.0009293774,0.0008344711,0.0014450523,0.0010248657,0.00043463073],"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.00009036521,0.00006760507,0.00029600863,0.00017280427,0.00003677524,0.00005942844,0.00008854998,0.92793936,0.005447582,0.032660227,0.0005676659,0.03257365],"study_design_scores_gemma":[0.000005987809,0.00003480975,0.000049885017,0.0000049761456,0.000005701273,0.0000057098055,0.00000504126,0.9941906,0.0009746035,0.004441654,0.00027789976,0.0000031595423],"about_ca_topic_score_codex":0.0024021957,"about_ca_topic_score_gemma":0.0019026336,"teacher_disagreement_score":0.0026116115,"about_ca_system_score_codex":0.001036489,"about_ca_system_score_gemma":0.0014736027,"threshold_uncertainty_score":0.013811648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13114844,0.0017151874,0.8652371,0.00045277624,0.00006520882,0.00005511983,0.00017474066,0.00018805203,0.00096342753],"genre_scores_gemma":[0.80592024,0.0006630108,0.19251853,0.0000414482,0.000058491027,0.000043719985,0.0001321141,0.000014393979,0.00060805964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994802,0.0002687432,0.000054081873,0.000070321395,0.0000991596,0.000027507964],"domain_scores_gemma":[0.9968388,0.0024953748,0.00015921993,0.00015248757,0.00031070402,0.00004339447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034732514,0.0003597845,0.0009964544,0.0018169319,0.00046132345,0.0009437874,0.0005373409,0.0005786292,0.00064130605],"category_scores_gemma":[0.0066906833,0.00018550854,0.0009206013,0.0015436206,0.0003277283,0.00064143905,0.00056279975,0.00057791604,0.0001286608],"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.0009001465,0.00041282456,0.023334078,0.00041327832,0.0005695221,0.0010714913,0.0004622406,0.2060676,0.018127045,0.023988161,0.0021001121,0.72255355],"study_design_scores_gemma":[0.00002435203,0.0001417707,0.012092979,0.000022945527,0.00014594257,0.00035877823,0.0000729789,0.9655199,0.0023980455,0.018402308,0.0007800661,0.00003990936],"about_ca_topic_score_codex":0.0015696394,"about_ca_topic_score_gemma":0.0015402524,"teacher_disagreement_score":0.0034732514,"about_ca_system_score_codex":0.00022751662,"about_ca_system_score_gemma":0.0006339309,"threshold_uncertainty_score":0.018368542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08827484,0.0006707781,0.9024083,0.00087336457,0.00012360717,0.00007767731,0.00035187963,0.0003504032,0.006869141],"genre_scores_gemma":[0.9654714,0.0004391172,0.028118635,0.000107426764,0.000036206897,0.00013417183,0.00027551598,0.000032244385,0.0053851763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973625,0.00007835151,0.00001454185,0.000085042215,0.000047767455,0.000037973357],"domain_scores_gemma":[0.99956983,0.00024878493,0.00005105185,0.000014849995,0.00009197943,0.000023517008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000718387,0.00062920095,0.00078785286,0.00040124994,0.0003369271,0.00094694935,0.0012690043,0.00103972,0.0018649369],"category_scores_gemma":[0.0018103765,0.00031254013,0.00079325127,0.00045413623,0.00055826653,0.00077473663,0.0007111555,0.0011346115,0.00019585053],"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.00002640992,0.000014478621,0.000800688,0.000039437415,0.000020885473,0.00003858025,0.000032627515,0.9878598,0.0006140008,0.004869302,0.00034589425,0.0053379405],"study_design_scores_gemma":[0.000002613063,0.0000050360036,0.00008822584,0.0000014427691,0.000004058226,0.0000017763703,0.0000024314463,0.9990275,0.00004793984,0.0007180139,0.00009874382,0.0000022737202],"about_ca_topic_score_codex":0.022186726,"about_ca_topic_score_gemma":0.013383856,"teacher_disagreement_score":0.022186726,"about_ca_system_score_codex":0.00077432103,"about_ca_system_score_gemma":0.0011162093,"threshold_uncertainty_score":0.044115186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005486891,0.00012849507,0.99371934,0.00005894102,0.000019731193,0.000017543145,0.0000094186635,0.000122017926,0.00043763773],"genre_scores_gemma":[0.8657262,0.0003484274,0.13121553,0.0001489345,0.00008318248,0.00014179063,0.000102312304,0.000060227343,0.0021733548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989334,0.00029953753,0.00007424687,0.00031081308,0.00027211886,0.00010997281],"domain_scores_gemma":[0.9984535,0.0007270802,0.00024408498,0.00014783735,0.0003605038,0.00006688777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017541168,0.0013371056,0.0009539029,0.00044935552,0.0003553385,0.00082275085,0.0015313952,0.0011317272,0.0011661312],"category_scores_gemma":[0.005037141,0.00048905326,0.00064735475,0.00032199535,0.0010864773,0.0014876733,0.0016455122,0.0018307458,0.00026306245],"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.00021666552,0.00007011355,0.0011778323,0.00018760675,0.00010479817,0.00016742996,0.00015532023,0.8435674,0.013403375,0.031137522,0.00080542354,0.109006524],"study_design_scores_gemma":[0.000002838094,0.00003117523,0.000051372943,0.0000036713375,0.000007845134,0.000015338128,0.0000033207082,0.99694073,0.0011860994,0.0016145832,0.00013780035,0.000005227267],"about_ca_topic_score_codex":0.0019237604,"about_ca_topic_score_gemma":0.0017782366,"teacher_disagreement_score":0.0019237604,"about_ca_system_score_codex":0.00066495215,"about_ca_system_score_gemma":0.00084857625,"threshold_uncertainty_score":0.009276807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016704284,0.00013904124,0.99011594,0.0007731585,0.00007503252,0.000033871675,0.0001563536,0.0001844641,0.006851647],"genre_scores_gemma":[0.09963619,0.00039967475,0.8919525,0.0008950664,0.00020466275,0.00042949626,0.00074881414,0.00017287798,0.005560807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99367744,0.0024794396,0.0005496865,0.0012456042,0.0016547631,0.0003932381],"domain_scores_gemma":[0.9913033,0.003349984,0.0003985347,0.0022017292,0.0022621583,0.00048431757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070496355,0.0009650214,0.0010970164,0.0029885478,0.0054395227,0.0066496967,0.004972012,0.0031964183,0.008382871],"category_scores_gemma":[0.011170665,0.0009309203,0.0036964128,0.0036372654,0.007687851,0.009575742,0.0063592303,0.005692362,0.002819049],"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.000006420022,0.0000068684726,0.00008501163,0.000036137557,0.000009571299,0.00002285817,0.000112350055,0.0014137587,0.00015354967,0.9923298,0.0012155187,0.004608222],"study_design_scores_gemma":[0.000011010754,0.0000075907888,0.00007709669,0.000020606492,0.0000128212705,0.00010059775,0.0000686739,0.0141391205,0.00026808365,0.97733384,0.00794573,0.000014937169],"about_ca_topic_score_codex":0.0036751202,"about_ca_topic_score_gemma":0.004085636,"teacher_disagreement_score":0.008382871,"about_ca_system_score_codex":0.002570467,"about_ca_system_score_gemma":0.0023062069,"threshold_uncertainty_score":0.037282467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022673076,0.00013912287,0.974018,0.000111962385,0.00010270582,0.00029157609,0.0003722166,0.0019763873,0.0003149092],"genre_scores_gemma":[0.21272403,0.00010872504,0.78284556,0.00018658378,0.000113508286,0.0007890745,0.0019247455,0.00030628598,0.001001402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995635,0.0012499919,0.0003971682,0.0006981712,0.0017908989,0.00022879505],"domain_scores_gemma":[0.9915705,0.0037524877,0.0005448262,0.0015162716,0.002242789,0.0003731753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005765987,0.0010606939,0.0016934685,0.0029245385,0.0013628387,0.0015262731,0.0026889008,0.0011973788,0.00238106],"category_scores_gemma":[0.018414827,0.000480984,0.0013833131,0.0028117972,0.0010104703,0.001727434,0.002554386,0.0020575742,0.0007812425],"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.0015875628,0.0005433453,0.018216768,0.00038049583,0.00042516776,0.00028184833,0.00066604,0.041473113,0.020072512,0.01083087,0.010862928,0.8946593],"study_design_scores_gemma":[0.00011977903,0.00026431613,0.002577954,0.00003085932,0.000072280265,0.00019099934,0.00016958873,0.97287875,0.0075368397,0.011400959,0.0047204113,0.000037324186],"about_ca_topic_score_codex":0.0033437936,"about_ca_topic_score_gemma":0.005256041,"teacher_disagreement_score":0.005765987,"about_ca_system_score_codex":0.00067790586,"about_ca_system_score_gemma":0.0026836707,"threshold_uncertainty_score":0.030493855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12760223,0.000905695,0.8588261,0.0006889678,0.00025201598,0.000050108105,0.00014297347,0.0006511269,0.010880863],"genre_scores_gemma":[0.9810146,0.0001364237,0.015874702,0.000052067404,0.000028087241,0.000045982728,0.000057873283,0.000025352794,0.0027648385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998654,0.000021985416,0.0000060312586,0.000037004193,0.000042519285,0.000026965883],"domain_scores_gemma":[0.9995086,0.00026687665,0.00006602272,0.000028809625,0.00010398656,0.000025712818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000542125,0.0006763071,0.000699037,0.00031707983,0.00038937942,0.001017407,0.00093195913,0.00088045775,0.0013604556],"category_scores_gemma":[0.001243885,0.00051112706,0.00042694062,0.00031690398,0.0008153322,0.000758532,0.0010097725,0.0012184097,0.0001709013],"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.000055268978,0.000023602399,0.00016642104,0.000031057687,0.000013296153,0.000015845839,0.000014384483,0.98477745,0.001726111,0.002221931,0.00025466364,0.010699973],"study_design_scores_gemma":[0.0000018593364,0.00000455988,0.000016688624,0.0000010036941,8.167154e-7,5.007463e-7,6.5129257e-7,0.9993724,0.00018680935,0.00037852788,0.000035363762,8.2686836e-7],"about_ca_topic_score_codex":0.015710933,"about_ca_topic_score_gemma":0.014750157,"teacher_disagreement_score":0.015710933,"about_ca_system_score_codex":0.0011157751,"about_ca_system_score_gemma":0.0012239808,"threshold_uncertainty_score":0.031238973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10387247,0.00025809027,0.886399,0.00015051673,0.00006223155,0.00004336221,0.000084813546,0.00017282504,0.00895664],"genre_scores_gemma":[0.71385694,0.00021660615,0.28313762,0.00005823829,0.00004388936,0.000067790716,0.00012987392,0.000038290505,0.0024507502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980726,0.00049068924,0.00016140232,0.0002983413,0.0008183549,0.00015848428],"domain_scores_gemma":[0.99758554,0.0009613994,0.00031744948,0.00047514992,0.0004961407,0.00016434825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017416775,0.00039043467,0.00068715634,0.0016823539,0.0005895335,0.0022486837,0.0008889303,0.00049375626,0.0018335738],"category_scores_gemma":[0.006529774,0.00036258748,0.0009829253,0.0010048097,0.0021419108,0.0024200375,0.0017197995,0.0015177144,0.0002934839],"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.00020138657,0.000059957416,0.0016020185,0.00015302109,0.00006963784,0.00031628244,0.0011510511,0.144179,0.014480605,0.7755147,0.000873847,0.061398383],"study_design_scores_gemma":[0.000033083787,0.00007870234,0.0007173718,0.00005351649,0.000022268627,0.00015697183,0.0002586449,0.69559985,0.00598998,0.2907686,0.0062740967,0.00004678902],"about_ca_topic_score_codex":0.0020638707,"about_ca_topic_score_gemma":0.0015041019,"teacher_disagreement_score":0.0022486837,"about_ca_system_score_codex":0.0017385919,"about_ca_system_score_gemma":0.00063961436,"threshold_uncertainty_score":0.012614429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28728735,0.0005615532,0.69886976,0.0005572701,0.00013935711,0.000040454375,0.00017535465,0.0002271748,0.012141674],"genre_scores_gemma":[0.9857137,0.00015972268,0.010120618,0.00004003614,0.000022215187,0.00003678112,0.000039380153,0.000025603073,0.0038419762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983156,0.00003872298,0.000007316649,0.00005447307,0.000037476053,0.000030494353],"domain_scores_gemma":[0.9989913,0.00050391845,0.00017200234,0.00008463044,0.00015843273,0.00008976342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056965754,0.00029270345,0.00043942657,0.0006297565,0.0005201701,0.0007286668,0.0009605245,0.00054214953,0.0025576574],"category_scores_gemma":[0.0033000312,0.00018572732,0.00040520722,0.00039935336,0.0010842134,0.0009931859,0.0009415895,0.0006196074,0.00016580243],"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.00022416617,0.000036502555,0.0008626615,0.00011040503,0.00008045208,0.0001894127,0.00019247396,0.4945669,0.013149271,0.47333223,0.0012516503,0.016003856],"study_design_scores_gemma":[0.000009137699,0.000011834898,0.00022208675,0.00000669313,0.0000112908065,0.000024931349,0.000024260487,0.9521412,0.0010360962,0.046218455,0.00028239028,0.000011570869],"about_ca_topic_score_codex":0.0038120197,"about_ca_topic_score_gemma":0.0036586414,"teacher_disagreement_score":0.0038120197,"about_ca_system_score_codex":0.0012554415,"about_ca_system_score_gemma":0.00062431284,"threshold_uncertainty_score":0.009108901},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027976106,0.0002731656,0.9950245,0.00012802516,0.000064558546,0.00004993886,0.000053777963,0.00012789298,0.0014805966],"genre_scores_gemma":[0.14775708,0.00059431145,0.8457902,0.00026953954,0.00045185033,0.0007640333,0.000517635,0.0003188981,0.00353652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98585886,0.009463765,0.00040141045,0.0017092816,0.0021734703,0.00039316097],"domain_scores_gemma":[0.9671715,0.027099399,0.00065621483,0.0029465964,0.001640727,0.00048552515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009614237,0.0009345881,0.0019777298,0.004046067,0.0016491832,0.0017193878,0.0037223133,0.0018973831,0.010946631],"category_scores_gemma":[0.03247954,0.0005572886,0.0019717491,0.0037513182,0.0036171507,0.005190695,0.005694211,0.004170696,0.002047515],"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.0002690315,0.00021147057,0.001025679,0.000476554,0.00019235747,0.00013992489,0.0005927695,0.04463177,0.0031563295,0.61518514,0.00548913,0.32862982],"study_design_scores_gemma":[0.000037936596,0.00013881647,0.00044728446,0.00005799582,0.000048108748,0.00010027241,0.000092382856,0.21522546,0.0015576478,0.7758687,0.006388198,0.000037170354],"about_ca_topic_score_codex":0.0015802687,"about_ca_topic_score_gemma":0.0009404737,"teacher_disagreement_score":0.010946631,"about_ca_system_score_codex":0.0011744484,"about_ca_system_score_gemma":0.001471521,"threshold_uncertainty_score":0.050845563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004059533,0.0012229383,0.9832606,0.0011112946,0.00013485718,0.00002004307,0.00011634445,0.00007962662,0.009994691],"genre_scores_gemma":[0.54594475,0.006056459,0.3907609,0.0013532751,0.0011063782,0.0002488781,0.0004645267,0.00030888186,0.05375593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997887,0.00006237166,0.000011979733,0.0000346542,0.000079852674,0.000022349395],"domain_scores_gemma":[0.99953675,0.0002151905,0.000050275386,0.000037517955,0.00013567507,0.000024551573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071311544,0.00064264325,0.0004627103,0.00069875695,0.00031729185,0.0011373309,0.001077401,0.00091467856,0.0039413143],"category_scores_gemma":[0.0028638316,0.0003145678,0.00054077903,0.000695364,0.0009538393,0.0019427079,0.000782426,0.0012732064,0.00071290135],"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.000007923099,0.0000118517,0.00013178543,0.00008576791,0.000014190147,0.000045851288,0.000046786045,0.07595325,0.0016638942,0.90179557,0.0028312835,0.017411841],"study_design_scores_gemma":[0.0000020071302,0.000007167233,0.00007727195,0.000014871587,0.0000042595457,0.000033626136,0.000010459138,0.63193375,0.00023241698,0.3645451,0.0031336537,0.0000053924846],"about_ca_topic_score_codex":0.0034059517,"about_ca_topic_score_gemma":0.0034356772,"teacher_disagreement_score":0.0039413143,"about_ca_system_score_codex":0.0011687112,"about_ca_system_score_gemma":0.0009239193,"threshold_uncertainty_score":0.013185024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9789408,0.00019579008,0.01817599,0.00026995412,0.0000725035,0.00005581885,0.00077418826,0.00032668034,0.0011883833],"genre_scores_gemma":[0.98856586,0.00009131871,0.009788859,0.000034991837,0.000020645282,0.000043816744,0.00088699424,0.00006035683,0.0005071767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976006,0.0008928287,0.0001365708,0.0006150538,0.0005415718,0.0002134609],"domain_scores_gemma":[0.92385095,0.06101706,0.0029585138,0.0061565214,0.0046989936,0.0013179904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042851367,0.00075558375,0.0004700141,0.0009963139,0.0008409234,0.0008305031,0.0011027482,0.0010429015,0.0029969325],"category_scores_gemma":[0.049243294,0.0003185931,0.0003528683,0.0010374996,0.0009381084,0.0023836982,0.0009485603,0.0013512482,0.00059380435],"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.007626745,0.0075853653,0.05957494,0.0013728965,0.00054006133,0.0003924414,0.0005422418,0.44171357,0.34995577,0.008204848,0.005421642,0.11706945],"study_design_scores_gemma":[0.00011102081,0.0016650391,0.012993607,0.000032516436,0.00006811692,0.000117476695,0.00012020433,0.8851952,0.09531126,0.0038717785,0.0004705171,0.000043352535],"about_ca_topic_score_codex":0.0025569396,"about_ca_topic_score_gemma":0.0024679713,"teacher_disagreement_score":0.0042851367,"about_ca_system_score_codex":0.0005357657,"about_ca_system_score_gemma":0.0006628863,"threshold_uncertainty_score":0.022662282},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007867595,0.00012584664,0.990919,0.00008072509,0.000030462177,0.000026428872,0.00004275889,0.0005371895,0.00036997275],"genre_scores_gemma":[0.3850398,0.00033654325,0.60965145,0.00033923326,0.00023269656,0.00031102865,0.00086922705,0.0005973638,0.0026226067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853754,0.0005338652,0.000071886425,0.00030034428,0.00043486065,0.00012152748],"domain_scores_gemma":[0.99554956,0.0023214398,0.00042204192,0.00081693724,0.0007455847,0.00014451325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030736187,0.0010098043,0.0011568305,0.0010461864,0.00073220325,0.00096031895,0.0017974055,0.0014757569,0.0015325389],"category_scores_gemma":[0.009210476,0.00046334811,0.0015461242,0.00096275314,0.0008854454,0.0013457143,0.0015815776,0.002740284,0.0007116734],"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.00016646915,0.00016826141,0.0040540327,0.00017092485,0.00023214096,0.00015948106,0.00038207963,0.6011855,0.017394459,0.030914804,0.00709751,0.3380743],"study_design_scores_gemma":[0.00000818207,0.00003123499,0.0002825405,0.000011537874,0.000015657844,0.000024268973,0.000011376114,0.98373955,0.0021790534,0.01237693,0.0013100067,0.000009570873],"about_ca_topic_score_codex":0.0024440028,"about_ca_topic_score_gemma":0.0045578717,"teacher_disagreement_score":0.0030736187,"about_ca_system_score_codex":0.0006177362,"about_ca_system_score_gemma":0.0010976414,"threshold_uncertainty_score":0.016255021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029547103,0.00038349268,0.9685661,0.00021403837,0.0000668641,0.000034966506,0.00011873015,0.0006980491,0.0003705574],"genre_scores_gemma":[0.77268046,0.00045364766,0.22565341,0.00012566334,0.00014487341,0.00006718389,0.00039859134,0.00010721048,0.00036881256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833316,0.0004168865,0.0001744509,0.00030668377,0.000597047,0.000171717],"domain_scores_gemma":[0.9940758,0.0033645488,0.0006835854,0.001044141,0.0006262991,0.00020560827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029108648,0.00075961446,0.0020651203,0.002795727,0.00075404125,0.0031529914,0.0017222622,0.00095292,0.0005573465],"category_scores_gemma":[0.015672533,0.00054602895,0.0010177153,0.004059823,0.00095802196,0.0033315623,0.0025868213,0.0017938082,0.00019387974],"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.00045753559,0.00028235398,0.020211166,0.00027772845,0.00041287442,0.000459559,0.00033189173,0.6784279,0.007821557,0.0375948,0.0026222055,0.25110048],"study_design_scores_gemma":[0.0000043533705,0.0000105465115,0.00061551324,0.0000074130066,0.000011914678,0.000031639698,0.000023722005,0.981557,0.00048359213,0.01706975,0.00017597816,0.000008627462],"about_ca_topic_score_codex":0.007270903,"about_ca_topic_score_gemma":0.005161628,"teacher_disagreement_score":0.007270903,"about_ca_system_score_codex":0.001039627,"about_ca_system_score_gemma":0.0009237618,"threshold_uncertainty_score":0.01539433},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46064973,0.000709739,0.5184067,0.00044306178,0.00019877845,0.00028527025,0.00020865304,0.0039637685,0.015134275],"genre_scores_gemma":[0.9786547,0.000031680855,0.02003092,0.000022776923,0.0000025389472,0.00008560498,0.00007160249,0.00003887387,0.0010613195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962544,0.00010005256,0.00002357729,0.00006805017,0.00011183523,0.00007110585],"domain_scores_gemma":[0.9982834,0.00081992894,0.00016210428,0.00019352169,0.00045920938,0.000081918486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014414459,0.0010434341,0.00059571245,0.00057229726,0.00048348735,0.00053078495,0.0007703365,0.0008613803,0.0021381942],"category_scores_gemma":[0.0027769925,0.0003091163,0.0005446619,0.00024255109,0.0007146782,0.0005137373,0.0007259681,0.0013431534,0.0002115216],"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.0001365331,0.00011422159,0.0011330904,0.00012191662,0.000030678824,0.000056557,0.0000727966,0.97395927,0.0043131537,0.0013810344,0.0004593774,0.018221244],"study_design_scores_gemma":[0.0000129200835,0.000060397735,0.00024455672,0.0000056055396,0.0000036671197,0.0000037714724,0.000007573135,0.9975309,0.0017807744,0.00020571286,0.00013921114,0.000004848868],"about_ca_topic_score_codex":0.023045953,"about_ca_topic_score_gemma":0.016454078,"teacher_disagreement_score":0.023045953,"about_ca_system_score_codex":0.0008409498,"about_ca_system_score_gemma":0.0013653896,"threshold_uncertainty_score":0.045823634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008437477,0.00022529569,0.9866087,0.00071807724,0.000072688716,0.00004596503,0.000053046886,0.00025668327,0.0035821355],"genre_scores_gemma":[0.44079226,0.0004716633,0.5544324,0.00041870767,0.00018771431,0.00025324133,0.00010088074,0.0003016928,0.0030414604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906274,0.0061506806,0.0003004894,0.001062835,0.0014659445,0.00039254717],"domain_scores_gemma":[0.97378355,0.018246233,0.0016094625,0.0035398977,0.0021573992,0.0006633065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00857389,0.0012591059,0.0009908023,0.001517018,0.001598474,0.0044749053,0.0017661056,0.0020067624,0.0056032627],"category_scores_gemma":[0.0481397,0.0006131501,0.00080018194,0.0015650614,0.0034493757,0.006789848,0.0044656596,0.0032539293,0.0005243236],"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.00019951588,0.00007324089,0.0018936185,0.00018267568,0.00004861051,0.00013535681,0.0010349386,0.28109372,0.004250212,0.61733043,0.0025211961,0.09123652],"study_design_scores_gemma":[0.00003686813,0.000055259756,0.00032697417,0.00006746062,0.000019045607,0.0000857365,0.00013484128,0.46415845,0.0026507853,0.52318096,0.009250473,0.000033211156],"about_ca_topic_score_codex":0.0027899197,"about_ca_topic_score_gemma":0.0024371988,"teacher_disagreement_score":0.00857389,"about_ca_system_score_codex":0.0024497455,"about_ca_system_score_gemma":0.002076132,"threshold_uncertainty_score":0.045343578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13081372,0.00023502234,0.8607044,0.00025003424,0.000051321527,0.0003073635,0.00017514465,0.00007719204,0.007385833],"genre_scores_gemma":[0.84313965,0.000121647354,0.15493593,0.000034780798,0.000021903072,0.00025410176,0.00015374353,0.000015304566,0.0013229364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905483,0.00618547,0.00047531075,0.0006060986,0.001571338,0.00061350426],"domain_scores_gemma":[0.98682654,0.010042813,0.0009163268,0.0004972228,0.0011653922,0.00055163004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007970327,0.0010085218,0.0010642208,0.0031154852,0.0015057154,0.004315079,0.0017668054,0.001095165,0.0049093897],"category_scores_gemma":[0.016665446,0.00050653645,0.0022116052,0.0036440766,0.0019734981,0.005834523,0.0025930393,0.0014789229,0.0002763757],"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.0020427431,0.0005178812,0.015343268,0.0006226703,0.00088242214,0.0015150737,0.0046175066,0.3672345,0.0031577945,0.500283,0.0023143142,0.10146885],"study_design_scores_gemma":[0.00006784716,0.00016064837,0.0015331655,0.000043209155,0.00013589447,0.00027492468,0.0015407918,0.82871246,0.0014438926,0.16471873,0.0012876462,0.000080729944],"about_ca_topic_score_codex":0.0018826356,"about_ca_topic_score_gemma":0.0013733277,"teacher_disagreement_score":0.007970327,"about_ca_system_score_codex":0.0014108568,"about_ca_system_score_gemma":0.0012140481,"threshold_uncertainty_score":0.04215163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1140561,0.00009440558,0.8809579,0.00032247583,0.00011118225,0.0002322294,0.000024672916,0.0001532161,0.0040477514],"genre_scores_gemma":[0.86240834,0.000050005645,0.13422197,0.000057829984,0.000026879055,0.0002205511,0.000038388658,0.000024089448,0.0029518784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961455,0.0017423166,0.00021165524,0.00056575314,0.0007603836,0.00057451334],"domain_scores_gemma":[0.99233174,0.0052768695,0.00042967015,0.0003556566,0.0007399042,0.00086609216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005516568,0.0008249945,0.0022978943,0.001243487,0.0025102717,0.0029355728,0.0030992357,0.0019555842,0.003706249],"category_scores_gemma":[0.009106659,0.0006949046,0.0011197345,0.0012536377,0.0019808195,0.0028961143,0.0025362691,0.001378872,0.0004710482],"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.0023372574,0.0008982402,0.005685713,0.0003315524,0.0004029595,0.0010074396,0.0037240256,0.68440014,0.0095785605,0.14771697,0.003040922,0.1408763],"study_design_scores_gemma":[0.00007353808,0.00008348404,0.00017948978,0.000008324952,0.000048338094,0.000042996322,0.00017107869,0.98135686,0.0006422479,0.016954318,0.00040638162,0.000033002943],"about_ca_topic_score_codex":0.002390939,"about_ca_topic_score_gemma":0.0024382586,"teacher_disagreement_score":0.005516568,"about_ca_system_score_codex":0.0011463647,"about_ca_system_score_gemma":0.0018311866,"threshold_uncertainty_score":0.029174805},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04258975,0.000046768568,0.95464873,0.00022542795,0.000015467931,0.00012592626,0.000043628705,0.00033796718,0.0019663665],"genre_scores_gemma":[0.58405066,0.00008873288,0.41298762,0.00012559611,0.0000192097,0.00027213155,0.00015167953,0.00008730274,0.0022170788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975768,0.00093160593,0.00011394486,0.0006254489,0.0004366066,0.00031565168],"domain_scores_gemma":[0.9938273,0.004914193,0.00040311806,0.00040745508,0.00029681463,0.0001511096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026212176,0.00077166926,0.001267455,0.0006565968,0.0010024804,0.0017372535,0.0018687459,0.0011735483,0.0029709875],"category_scores_gemma":[0.009909649,0.00043292664,0.0008919716,0.0006030164,0.0020882424,0.0034327444,0.0023297088,0.0020439492,0.00035376422],"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.00052698934,0.00025174892,0.0023513979,0.0002926842,0.00012913173,0.000188119,0.0003781277,0.6450787,0.0045348224,0.2329452,0.0015515151,0.11177159],"study_design_scores_gemma":[0.000047511323,0.000059052152,0.00015681167,0.000008942288,0.000012230821,0.000046061497,0.00003722707,0.8797497,0.0021345788,0.11741012,0.00032329673,0.000014469269],"about_ca_topic_score_codex":0.0038710234,"about_ca_topic_score_gemma":0.004718797,"teacher_disagreement_score":0.0038710234,"about_ca_system_score_codex":0.0016387563,"about_ca_system_score_gemma":0.0028617107,"threshold_uncertainty_score":0.013862491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017461715,0.0001963424,0.98111,0.00008420384,0.000023466648,0.000040913797,0.00008267581,0.00029108385,0.00070968],"genre_scores_gemma":[0.66880465,0.00027074083,0.32810187,0.00010910955,0.00012238478,0.00017481759,0.0006305662,0.000109295645,0.0016764868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978005,0.0005339035,0.00022418928,0.00055608165,0.000711362,0.00017394994],"domain_scores_gemma":[0.9975948,0.0009177126,0.00021504193,0.0005275725,0.00062460237,0.00012034641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022248935,0.0006568131,0.0023025034,0.0014458982,0.00075854245,0.0016231764,0.0014319452,0.0009398655,0.0014314933],"category_scores_gemma":[0.006791524,0.00041756468,0.001347911,0.0015132603,0.0008086424,0.0020872152,0.0021576448,0.0010669032,0.00038403974],"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.0012430195,0.00027485864,0.002774132,0.00047754773,0.00029647938,0.00029058583,0.00034892486,0.27091348,0.034440167,0.05125957,0.0075252037,0.6301561],"study_design_scores_gemma":[0.000015032823,0.00008238317,0.0006789146,0.000015261372,0.000028862978,0.00006780456,0.000024561776,0.9801634,0.0037434278,0.0143367965,0.0008253432,0.00001820195],"about_ca_topic_score_codex":0.0017336219,"about_ca_topic_score_gemma":0.0013515783,"teacher_disagreement_score":0.0023025034,"about_ca_system_score_codex":0.0007073423,"about_ca_system_score_gemma":0.00094794057,"threshold_uncertainty_score":0.011766493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034662027,0.0002746408,0.96389717,0.00026541456,0.000043941356,0.000039682112,0.000049574595,0.0000608022,0.00070686557],"genre_scores_gemma":[0.6225289,0.00042507003,0.37558737,0.00016082558,0.00010626071,0.00013738837,0.00019860407,0.00006927275,0.0007862963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953501,0.0029359395,0.00031542836,0.00043269937,0.00071681564,0.00024900542],"domain_scores_gemma":[0.98954356,0.0074401144,0.0009497927,0.0005981508,0.001168041,0.00030030144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0081395125,0.0013482409,0.0028768773,0.0020227972,0.00063185015,0.0022317881,0.0010818492,0.0013223958,0.0014181595],"category_scores_gemma":[0.016189257,0.0007448221,0.0021178066,0.0023963968,0.00068711047,0.0036463577,0.0020395333,0.0019832482,0.00016887386],"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.00015752928,0.00021670856,0.0014064341,0.00017627544,0.0003133083,0.000065595996,0.00015986436,0.9220416,0.0014398622,0.015452972,0.00050227216,0.05806766],"study_design_scores_gemma":[0.000003983569,0.000023210603,0.000119040014,0.0000067572932,0.000016979153,0.000004064559,0.00001346636,0.99318933,0.0001528459,0.006388504,0.00007646147,0.0000052618525],"about_ca_topic_score_codex":0.006619985,"about_ca_topic_score_gemma":0.0062852483,"teacher_disagreement_score":0.0081395125,"about_ca_system_score_codex":0.001180214,"about_ca_system_score_gemma":0.0021001096,"threshold_uncertainty_score":0.043046355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003056877,0.00013058861,0.9956436,0.000115714836,0.000052492145,0.000030778832,0.0001428942,0.00060418434,0.0002228121],"genre_scores_gemma":[0.16645682,0.0005284715,0.8266323,0.00030625658,0.00019785897,0.00030121292,0.0024245323,0.0003488587,0.0028035822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982672,0.00034685296,0.00008218602,0.0005815639,0.0005488139,0.00017327645],"domain_scores_gemma":[0.99770087,0.00067039044,0.00025092313,0.0005585207,0.0006951453,0.00012403922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014949185,0.0016052466,0.0018673242,0.001424264,0.00078089297,0.0018025031,0.0029021488,0.001740595,0.0020378763],"category_scores_gemma":[0.0048743123,0.0008202337,0.0020011475,0.002172363,0.0008329485,0.002830373,0.0024658216,0.0034828566,0.0018672345],"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.0004604417,0.00047817652,0.001528825,0.0002945859,0.00023157566,0.00018767791,0.00025225023,0.108185895,0.04701411,0.017146152,0.017935243,0.80628496],"study_design_scores_gemma":[0.000009644507,0.000033801774,0.00023012249,0.000009298822,0.000020845073,0.000057368226,0.000025370788,0.9889663,0.003186439,0.006347611,0.0010950016,0.000018115627],"about_ca_topic_score_codex":0.007060334,"about_ca_topic_score_gemma":0.0098529635,"teacher_disagreement_score":0.007060334,"about_ca_system_score_codex":0.00075492705,"about_ca_system_score_gemma":0.0013931454,"threshold_uncertainty_score":0.014038503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024894493,0.00026833458,0.97018045,0.00020580186,0.00009431834,0.00007544466,0.000013929174,0.00015006267,0.004117223],"genre_scores_gemma":[0.7573408,0.00024630327,0.2362488,0.00021029056,0.00011212918,0.00042994475,0.000064280546,0.00008361638,0.0052639297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995604,0.00018560523,0.000021257847,0.000068644345,0.00011448654,0.00004964721],"domain_scores_gemma":[0.9986688,0.0009124292,0.00008106468,0.00006258121,0.00022520524,0.000049925406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014168452,0.0006063386,0.0011062335,0.0008038442,0.00061086967,0.00068501494,0.0013741107,0.0014118698,0.0029092333],"category_scores_gemma":[0.0035097285,0.0003191053,0.00073336804,0.0007126066,0.00067989534,0.0011129301,0.0011709275,0.0011087212,0.0002922269],"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.000059366266,0.00012994364,0.00030249567,0.00006818941,0.000050637063,0.000057347137,0.000056629207,0.92045325,0.0014956509,0.011036692,0.00087093114,0.065418944],"study_design_scores_gemma":[0.0000045964634,0.000015122362,0.00003504104,0.0000024445274,0.0000035918897,0.00000552361,0.0000027130438,0.99829704,0.00011767849,0.0014071873,0.00010711673,0.0000019513648],"about_ca_topic_score_codex":0.0030991575,"about_ca_topic_score_gemma":0.0019938063,"teacher_disagreement_score":0.0030991575,"about_ca_system_score_codex":0.0007930233,"about_ca_system_score_gemma":0.0010796778,"threshold_uncertainty_score":0.009732366},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034635903,0.000046009816,0.99084455,0.00006805818,0.000051260595,0.00003826174,0.00015099139,0.00220937,0.0031280129],"genre_scores_gemma":[0.100665316,0.0001084881,0.8903987,0.00019864416,0.00003001024,0.000316557,0.00059746526,0.0009229745,0.0067619286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957997,0.000100795965,0.000028303335,0.000091578964,0.0001543624,0.00004503835],"domain_scores_gemma":[0.99956673,0.00023015641,0.000022111235,0.00006670058,0.00009418157,0.000020078036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066541403,0.00060990197,0.00053729455,0.00041993885,0.00037941366,0.0009934438,0.0017215016,0.00090952724,0.0067668827],"category_scores_gemma":[0.0024750836,0.00030963274,0.00074817735,0.00040359714,0.00066158583,0.00097188394,0.0011676619,0.0023774789,0.0016581008],"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.00024601797,0.00022243174,0.000720525,0.0003061904,0.00005485541,0.00025894804,0.00022360579,0.23633572,0.013766012,0.21356769,0.016585493,0.5177125],"study_design_scores_gemma":[0.000038160662,0.00004420631,0.00008648038,0.000045612094,0.000017343697,0.00011751834,0.000020374084,0.9163266,0.010418959,0.056703966,0.016162429,0.000018380751],"about_ca_topic_score_codex":0.0013787951,"about_ca_topic_score_gemma":0.0023944436,"teacher_disagreement_score":0.0067668827,"about_ca_system_score_codex":0.00052648835,"about_ca_system_score_gemma":0.0008288741,"threshold_uncertainty_score":0.022637486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058796026,0.00082244026,0.93670213,0.0011391875,0.00016642366,0.000060828268,0.00022262598,0.0005277681,0.0015626171],"genre_scores_gemma":[0.95163584,0.00036848,0.04644504,0.00025390412,0.00015706857,0.000043253298,0.00024824293,0.000032632957,0.0008155821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925614,0.0025019946,0.000532567,0.0013639716,0.0022852824,0.00075479114],"domain_scores_gemma":[0.96514654,0.0191743,0.0027037149,0.008764717,0.003400915,0.00080983446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007829427,0.0007257419,0.002349811,0.0008559937,0.0013982088,0.0031902622,0.0022636866,0.0023248629,0.0006785211],"category_scores_gemma":[0.03810494,0.0010081221,0.0009874715,0.0019566873,0.0011574323,0.0061839926,0.0035857281,0.0036257177,0.00041340478],"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.0012672052,0.00074699434,0.054526865,0.0004925515,0.0008833459,0.00078237837,0.0012794768,0.49126923,0.018552694,0.073547296,0.010393714,0.3462583],"study_design_scores_gemma":[0.000014294515,0.00007407835,0.002471479,0.000024775332,0.00004960619,0.00019533769,0.00013134703,0.97323024,0.002290486,0.020658493,0.0008305411,0.000029261793],"about_ca_topic_score_codex":0.006376352,"about_ca_topic_score_gemma":0.007848663,"teacher_disagreement_score":0.007829427,"about_ca_system_score_codex":0.0011551061,"about_ca_system_score_gemma":0.0022925602,"threshold_uncertainty_score":0.041406453},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034094106,0.0010949849,0.9566985,0.00027855494,0.0002929538,0.00029427322,0.0006901487,0.004055183,0.0025013045],"genre_scores_gemma":[0.25166366,0.0003283171,0.73894656,0.00031686056,0.00022662083,0.0003554411,0.0011646298,0.00013462098,0.0068633165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998838,0.0002329692,0.00009657949,0.0003170618,0.00043700458,0.0000783937],"domain_scores_gemma":[0.9986534,0.00044607217,0.00009857458,0.00024029917,0.00046506108,0.000096652395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010360759,0.000801619,0.0013409908,0.00308533,0.0008113574,0.0008435317,0.0013982621,0.0013161472,0.0032968286],"category_scores_gemma":[0.0027896794,0.00033076992,0.00094325293,0.0028803074,0.00021892149,0.0013242698,0.00091016013,0.0008596833,0.0025138287],"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.0004517492,0.0003965559,0.006397428,0.00030618664,0.0002537234,0.00013115769,0.00017642634,0.006183929,0.021312846,0.0015294055,0.01386333,0.94899726],"study_design_scores_gemma":[0.00023382013,0.0005271297,0.008816302,0.00008268006,0.00046676124,0.00061443925,0.00024721093,0.9485395,0.020350918,0.0043958984,0.015552981,0.00017244894],"about_ca_topic_score_codex":0.0075731436,"about_ca_topic_score_gemma":0.015946442,"teacher_disagreement_score":0.0075731436,"about_ca_system_score_codex":0.00039077873,"about_ca_system_score_gemma":0.00077487243,"threshold_uncertainty_score":0.01505816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004292952,0.0002815205,0.99455726,0.00010157905,0.000032130592,0.000024818464,0.000033918484,0.0002058158,0.00046996423],"genre_scores_gemma":[0.32451895,0.0012038926,0.6668508,0.00035042054,0.0003694447,0.0003237825,0.0005208256,0.00016722946,0.0056945467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947065,0.00015120958,0.000030713527,0.000142688,0.00016073012,0.000043984353],"domain_scores_gemma":[0.9994748,0.00022390981,0.000065586035,0.000043113894,0.0001722263,0.000020499507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008622803,0.0006732704,0.00063379644,0.00082722266,0.00037979166,0.00060661836,0.0010102196,0.001090392,0.00091566175],"category_scores_gemma":[0.00201867,0.0002863546,0.0011826537,0.0008119027,0.0004947975,0.0007102709,0.0007494347,0.001415996,0.000496082],"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.00016521379,0.00019360633,0.001493641,0.00024939523,0.00021028277,0.00021075379,0.00023973997,0.43736356,0.033832736,0.01051689,0.003561847,0.51196235],"study_design_scores_gemma":[0.0000026715675,0.000036451995,0.0003528245,0.000007790941,0.000014172569,0.000036687892,0.000010822407,0.99387485,0.002231971,0.0023782372,0.0010423424,0.000011208293],"about_ca_topic_score_codex":0.0024091993,"about_ca_topic_score_gemma":0.0031833127,"teacher_disagreement_score":0.0024091993,"about_ca_system_score_codex":0.0003947809,"about_ca_system_score_gemma":0.0006740723,"threshold_uncertainty_score":0.0047903657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029888641,0.0005102172,0.960112,0.0002228855,0.00014342068,0.00006262796,0.00027048067,0.0020355545,0.0067541744],"genre_scores_gemma":[0.46561077,0.0003364863,0.52289426,0.00031517536,0.00014829944,0.000113815244,0.0015612858,0.0007139292,0.008305944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996013,0.00009844172,0.000016440159,0.00015705249,0.000075121134,0.000051661962],"domain_scores_gemma":[0.99910104,0.000491297,0.00003768207,0.00020141034,0.00009488117,0.00007366795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079859904,0.001439864,0.0010463872,0.00079628633,0.00070991565,0.001155494,0.0017108495,0.0016635972,0.008710885],"category_scores_gemma":[0.0028638805,0.00050821295,0.00078739726,0.0005405418,0.00077208446,0.0025597506,0.0023040266,0.0014416471,0.0022961774],"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.0012985796,0.00027420116,0.001231691,0.0004656652,0.00014636423,0.00068418914,0.00021984827,0.32636014,0.056787908,0.059175827,0.008596793,0.54475886],"study_design_scores_gemma":[0.000034120436,0.000075110824,0.00016809534,0.000029406247,0.000027090175,0.00011110551,0.000058279424,0.9348033,0.008997856,0.05264007,0.0030363046,0.000019307132],"about_ca_topic_score_codex":0.0017537462,"about_ca_topic_score_gemma":0.0045395996,"teacher_disagreement_score":0.008710885,"about_ca_system_score_codex":0.00039197193,"about_ca_system_score_gemma":0.0007526317,"threshold_uncertainty_score":0.02914083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008005752,0.00033021337,0.98775357,0.0004042488,0.00005506806,0.0000512045,0.000117742326,0.0015253703,0.0017567731],"genre_scores_gemma":[0.6534577,0.0005652888,0.33739784,0.00075862976,0.00010659993,0.00026139023,0.00048102753,0.000466396,0.006505091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992944,0.0002209464,0.000031456126,0.00018567921,0.00015102727,0.00011651144],"domain_scores_gemma":[0.9990293,0.00045255554,0.00012522258,0.00011826756,0.00017634407,0.00009838633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014516673,0.0009696226,0.00093942054,0.0006684105,0.0003726725,0.0011147935,0.0025346917,0.0012093938,0.0023208493],"category_scores_gemma":[0.0037992224,0.00057047396,0.00066361006,0.0006223826,0.0011801005,0.0018192199,0.0018032616,0.0021792743,0.00064228993],"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.000088318186,0.00008547953,0.0008967012,0.00008180032,0.000039193947,0.00008538029,0.00008188164,0.88679516,0.002087568,0.018288448,0.0033350936,0.08813494],"study_design_scores_gemma":[0.0000039287247,0.000009246166,0.00003383994,0.0000036455795,0.0000027198794,0.000006631168,0.000003082818,0.9955604,0.00023635727,0.003749132,0.00038802737,0.0000029754663],"about_ca_topic_score_codex":0.0115357265,"about_ca_topic_score_gemma":0.0137693165,"teacher_disagreement_score":0.0115357265,"about_ca_system_score_codex":0.0020631116,"about_ca_system_score_gemma":0.0024872322,"threshold_uncertainty_score":0.022937179},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003563845,0.0003648914,0.9954424,0.00009434459,0.000024926836,0.000018248764,0.00003970107,0.00023982825,0.0002117452],"genre_scores_gemma":[0.16085593,0.00071370957,0.83617926,0.0002378289,0.00023235462,0.00028054992,0.0005194544,0.00049840455,0.00048254573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97403914,0.018638534,0.0010479738,0.0023643372,0.0035362842,0.0003738141],"domain_scores_gemma":[0.72458076,0.24550912,0.005162196,0.016334813,0.0073799426,0.001033136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.042851795,0.0016822217,0.0033230833,0.0054742466,0.001185792,0.004073725,0.005527513,0.002997149,0.0027484964],"category_scores_gemma":[0.26673782,0.0018602923,0.002319526,0.0054450897,0.0027576801,0.006235554,0.005690435,0.005925809,0.0008354743],"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.0009604638,0.00037677877,0.0068127774,0.0011159254,0.0013453296,0.00042186637,0.00070174475,0.44144657,0.0057259416,0.17082572,0.005754811,0.36451206],"study_design_scores_gemma":[0.00007191064,0.000050288876,0.0007513088,0.00008240264,0.000094590396,0.00009029753,0.000034443,0.8696618,0.0015292322,0.12646434,0.0011255858,0.00004385822],"about_ca_topic_score_codex":0.0030274119,"about_ca_topic_score_gemma":0.0023317756,"teacher_disagreement_score":0.042851795,"about_ca_system_score_codex":0.0010362788,"about_ca_system_score_gemma":0.002065771,"threshold_uncertainty_score":0.22662467},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059022497,0.00240407,0.9123086,0.00084002153,0.00045756347,0.0002178955,0.0030717556,0.018358111,0.0033194677],"genre_scores_gemma":[0.5802887,0.0010641476,0.3935683,0.0009162885,0.00030880782,0.00025328808,0.0079662185,0.0008030141,0.014831132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965596,0.00007648336,0.000015996626,0.00013230903,0.00006213222,0.000057221856],"domain_scores_gemma":[0.9993789,0.00028799308,0.000047163117,0.00008833696,0.00014953685,0.00004801835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011585029,0.0013691351,0.0008445623,0.00092539104,0.00037066935,0.0006450487,0.0018593832,0.0014613988,0.0037384755],"category_scores_gemma":[0.0026623341,0.0004524133,0.00081885885,0.00076548336,0.00025473474,0.0008557661,0.0013094317,0.0015085263,0.0014635378],"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.000845138,0.00046656374,0.0030678844,0.00018928766,0.00035260606,0.00025407146,0.00008813747,0.15195352,0.01557069,0.0031163394,0.032252435,0.79184335],"study_design_scores_gemma":[0.000021468357,0.00007345452,0.00053680566,0.0000097182565,0.00003572524,0.000038306647,0.000014683676,0.99237275,0.0029176408,0.00251352,0.0014556686,0.0000102607655],"about_ca_topic_score_codex":0.0183785,"about_ca_topic_score_gemma":0.031205755,"teacher_disagreement_score":0.0183785,"about_ca_system_score_codex":0.0006924107,"about_ca_system_score_gemma":0.0008577298,"threshold_uncertainty_score":0.03654307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031556707,0.0002795204,0.9644569,0.000117423355,0.0000622148,0.000030682233,0.000047505262,0.00013419111,0.0033147703],"genre_scores_gemma":[0.92951006,0.0004647029,0.062225394,0.000059681264,0.00005952824,0.000100357815,0.00013440661,0.000036580044,0.0074094413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996346,0.00006328434,0.00002717323,0.0001247883,0.00011597577,0.000034114666],"domain_scores_gemma":[0.9996693,0.00012959771,0.000037839483,0.000016561758,0.00013058925,0.000016018656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007002672,0.0005762818,0.0009529278,0.0006567564,0.0005671654,0.0012267979,0.0014720956,0.00092118647,0.001676434],"category_scores_gemma":[0.0011101855,0.00032929392,0.00084757747,0.0008656424,0.00041787408,0.0016695935,0.00047933398,0.0007657004,0.00021705213],"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.00004498133,0.00003798418,0.00089483446,0.00008811311,0.000073171395,0.00019126228,0.000093414914,0.9373468,0.0029513198,0.027691862,0.00053125323,0.030054936],"study_design_scores_gemma":[0.0000019719812,0.000008457481,0.00009735213,0.0000019696056,0.000011028868,0.000015111352,0.0000029263028,0.99764246,0.00017314688,0.0018994432,0.00014108607,0.0000049514324],"about_ca_topic_score_codex":0.009116678,"about_ca_topic_score_gemma":0.006248601,"teacher_disagreement_score":0.009116678,"about_ca_system_score_codex":0.0006652885,"about_ca_system_score_gemma":0.0008495059,"threshold_uncertainty_score":0.018127203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036180012,0.00030676805,0.99357754,0.0004143091,0.00008235443,0.000096859716,0.00032148891,0.0009646015,0.0006180772],"genre_scores_gemma":[0.1849346,0.0005619375,0.8070449,0.00049867295,0.00047625793,0.0003289276,0.0020582653,0.0004862227,0.0036102624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99350125,0.0017787666,0.00031187496,0.0018936235,0.0021222245,0.0003922955],"domain_scores_gemma":[0.9769604,0.015372799,0.0011062077,0.003741926,0.002078171,0.00074059056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008102102,0.0018350064,0.00404108,0.004442779,0.0026862998,0.0049864342,0.00799402,0.0045645926,0.005383702],"category_scores_gemma":[0.03595098,0.0018931312,0.0024771094,0.0040922184,0.0035483034,0.009706322,0.009659915,0.005368312,0.0015530023],"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.002273674,0.00048772473,0.0023206528,0.000881233,0.0004952343,0.0005817206,0.0008581431,0.37718996,0.007908447,0.1558654,0.021737998,0.4293999],"study_design_scores_gemma":[0.000057745863,0.000048584065,0.00014852252,0.00003505264,0.00003064366,0.00009721025,0.00006019607,0.91755337,0.0019565993,0.078051776,0.0019271453,0.000033072007],"about_ca_topic_score_codex":0.010285855,"about_ca_topic_score_gemma":0.012201457,"teacher_disagreement_score":0.010285855,"about_ca_system_score_codex":0.0023608003,"about_ca_system_score_gemma":0.004331907,"threshold_uncertainty_score":0.042848527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019356046,0.0023133932,0.96380687,0.0018529891,0.00011108804,0.00009677856,0.00022604672,0.00014457597,0.012092229],"genre_scores_gemma":[0.49565175,0.003098823,0.4958415,0.00040720438,0.00028186405,0.00041044492,0.0003841975,0.00007111933,0.0038529907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730647,0.0010162516,0.00020116036,0.00039210997,0.00081337744,0.00027055768],"domain_scores_gemma":[0.9972299,0.0011468515,0.00048617413,0.0005571505,0.0003497267,0.00023017303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003478239,0.00083226344,0.0013279541,0.0043510306,0.0010142849,0.0056005507,0.0020656765,0.0012896642,0.0026548342],"category_scores_gemma":[0.0058532506,0.00055518246,0.0028741674,0.004061119,0.0036783463,0.008304092,0.0028545004,0.002528499,0.00046631283],"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.0000118798625,0.000016312146,0.00036239056,0.00007610776,0.000029781499,0.000060521437,0.00028251696,0.016360061,0.0003066412,0.975422,0.0005251812,0.00654669],"study_design_scores_gemma":[0.000010485375,0.000038652583,0.00036371415,0.00007123455,0.000028043572,0.000070251124,0.00025884877,0.13304459,0.00021276913,0.8599481,0.005926142,0.000027177734],"about_ca_topic_score_codex":0.0029248637,"about_ca_topic_score_gemma":0.002210305,"teacher_disagreement_score":0.0056005507,"about_ca_system_score_codex":0.0025933513,"about_ca_system_score_gemma":0.0011104494,"threshold_uncertainty_score":0.018816173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041217316,0.00049182813,0.94691634,0.000107144944,0.0001755506,0.000077556455,0.00025135267,0.00821376,0.002549073],"genre_scores_gemma":[0.35307738,0.00020127019,0.6403181,0.0002196305,0.00011121569,0.00008988175,0.0007732251,0.00066589296,0.0045434586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997923,0.00002592906,0.000007991006,0.00006157003,0.00007178953,0.000040522813],"domain_scores_gemma":[0.9997626,0.000052325908,0.000012871399,0.00006663754,0.000077711506,0.000027809196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028149653,0.0007900651,0.0010899547,0.0008397183,0.0003731882,0.0006603455,0.0012540062,0.00070570817,0.005757006],"category_scores_gemma":[0.0008532213,0.00036785967,0.00064924883,0.00080036157,0.00020866471,0.0008897251,0.0010958246,0.0005857507,0.0021851042],"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.00074684503,0.00020408377,0.001397978,0.0001471944,0.0001279396,0.00018233166,0.000095388525,0.022603713,0.12768337,0.0026145729,0.009144037,0.83505243],"study_design_scores_gemma":[0.000029660087,0.00010867529,0.0011951643,0.0000072154685,0.000036108773,0.00018258533,0.00004029285,0.9619407,0.029156532,0.0034147364,0.0038720812,0.000016269476],"about_ca_topic_score_codex":0.0028673809,"about_ca_topic_score_gemma":0.006234363,"teacher_disagreement_score":0.005757006,"about_ca_system_score_codex":0.00025054242,"about_ca_system_score_gemma":0.0006417973,"threshold_uncertainty_score":0.019259095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12780651,0.003984977,0.8497362,0.000575588,0.0004351416,0.0001373515,0.0009654623,0.0103595825,0.0059990813],"genre_scores_gemma":[0.7346623,0.0008938041,0.24990405,0.000602279,0.00012238747,0.0000955234,0.0020459322,0.00023524887,0.0114385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986553,0.000010759421,0.0000055418886,0.000052533862,0.000038980917,0.00002669283],"domain_scores_gemma":[0.9998965,0.00002113675,0.00001143063,0.000015798674,0.000043469958,0.000011631029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020169203,0.0009766198,0.00056597625,0.0004939966,0.00021847546,0.00045824936,0.0013025122,0.000785974,0.0015697477],"category_scores_gemma":[0.00043256715,0.0003542131,0.0005190223,0.00036274342,0.0002840688,0.0008107357,0.00064214366,0.0008903769,0.000555374],"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.00047563107,0.0002755418,0.0026967775,0.00019372444,0.00016208187,0.00031354895,0.00006513961,0.33085498,0.06604855,0.0034102593,0.012840808,0.58266294],"study_design_scores_gemma":[0.000012372313,0.000048494014,0.0004467214,0.000007465385,0.000027797965,0.000045597855,0.0000064116116,0.9896017,0.0076106926,0.0008226586,0.0013617205,0.000008357836],"about_ca_topic_score_codex":0.008408933,"about_ca_topic_score_gemma":0.019734541,"teacher_disagreement_score":0.008408933,"about_ca_system_score_codex":0.0007030201,"about_ca_system_score_gemma":0.0010503002,"threshold_uncertainty_score":0.016719997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.201948,0.00073218625,0.7923133,0.00068789616,0.000040242412,0.000113930204,0.00051037583,0.002013419,0.0016407068],"genre_scores_gemma":[0.8606209,0.00026026618,0.13720874,0.00011109085,0.000035496916,0.00007154351,0.0008911491,0.00016140519,0.00063945906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835604,0.00056216866,0.000102683785,0.00041163235,0.00046546475,0.00010192075],"domain_scores_gemma":[0.98648435,0.009566034,0.0013358177,0.0010908325,0.0013326086,0.00019034393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024292322,0.0009271667,0.00053899107,0.0032043515,0.0006210166,0.0010048667,0.0010548111,0.0011384164,0.0016225065],"category_scores_gemma":[0.027001727,0.0003419306,0.0006537072,0.0009861337,0.0010972536,0.0030483145,0.0013622787,0.0012404515,0.00021115688],"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.0006577408,0.00022065558,0.054766018,0.00057667965,0.00032291308,0.0006397702,0.0013650449,0.4047998,0.01737955,0.036062412,0.0035191274,0.47969028],"study_design_scores_gemma":[0.000016495664,0.00008113148,0.003941323,0.000048060792,0.00006089776,0.00013391764,0.000138983,0.966219,0.005458593,0.022826198,0.0010582187,0.000017142798],"about_ca_topic_score_codex":0.0045532254,"about_ca_topic_score_gemma":0.0063622985,"teacher_disagreement_score":0.0045532254,"about_ca_system_score_codex":0.0009067652,"about_ca_system_score_gemma":0.0009697912,"threshold_uncertainty_score":0.012847185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01481726,0.0010791629,0.97921133,0.00028052018,0.000137192,0.00008192655,0.0001956965,0.0017994063,0.0023975042],"genre_scores_gemma":[0.32926902,0.0018675752,0.6555254,0.00051131856,0.0002951258,0.000247027,0.0018080595,0.0003684811,0.01010805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994288,0.00017304352,0.000044090695,0.00015117743,0.00014730688,0.00005563273],"domain_scores_gemma":[0.9986539,0.0006150872,0.000073199204,0.00027107986,0.0003404404,0.00004623842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013770917,0.0006157001,0.0006385235,0.0015418482,0.00043476268,0.00080529175,0.0009176575,0.0008056498,0.0029273345],"category_scores_gemma":[0.0029981965,0.0002106164,0.0011528905,0.001775843,0.0005124061,0.00088763324,0.0010998615,0.0014368006,0.0015824717],"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.00014983989,0.00018268648,0.0016046128,0.0001430973,0.000103741884,0.00010824569,0.00011748086,0.04474753,0.025163427,0.0069969,0.007904243,0.91277814],"study_design_scores_gemma":[0.000017586795,0.00008757062,0.002578236,0.000032175878,0.0000678011,0.0002565724,0.00013408625,0.95066446,0.017312463,0.018355282,0.010471463,0.000022182108],"about_ca_topic_score_codex":0.0029409705,"about_ca_topic_score_gemma":0.0032129027,"teacher_disagreement_score":0.0029409705,"about_ca_system_score_codex":0.00044075033,"about_ca_system_score_gemma":0.0006715178,"threshold_uncertainty_score":0.009792924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010498974,0.00010797951,0.9843423,0.00021900568,0.00008188812,0.000055988054,0.00034326816,0.001276009,0.0030747142],"genre_scores_gemma":[0.43927017,0.00031629,0.5405845,0.0005411309,0.000112545145,0.0005707877,0.0019882382,0.0007896011,0.015826708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986124,0.00004360569,0.0000067139113,0.000028496444,0.00004101735,0.000018920116],"domain_scores_gemma":[0.9996233,0.0002014497,0.000020655298,0.00005011774,0.00007019283,0.000034312794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053285086,0.00043748325,0.0007170427,0.00043681217,0.0005630189,0.00057861436,0.0017145028,0.0011888603,0.00738585],"category_scores_gemma":[0.0017408578,0.00031067623,0.0006043133,0.00041369317,0.00038904045,0.0012511029,0.0011682571,0.0012935979,0.0020171632],"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.00034794022,0.00022149672,0.0015784319,0.00029804363,0.00013412436,0.00038975693,0.00025009303,0.625366,0.015601437,0.12044387,0.02184057,0.2135282],"study_design_scores_gemma":[0.0000042832858,0.000006390676,0.000037620997,0.0000028817756,0.0000023960786,0.000007104853,0.0000044441485,0.9912533,0.0004351078,0.007685509,0.00055762904,0.0000033208282],"about_ca_topic_score_codex":0.004025704,"about_ca_topic_score_gemma":0.0073240367,"teacher_disagreement_score":0.00738585,"about_ca_system_score_codex":0.0005864967,"about_ca_system_score_gemma":0.00070735003,"threshold_uncertainty_score":0.024708152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06326014,0.00045233272,0.9345184,0.00017166747,0.000070540395,0.00008038001,0.00009010843,0.00025962997,0.0010968031],"genre_scores_gemma":[0.7846439,0.0004476403,0.21128201,0.00007329471,0.00016384476,0.00011527171,0.00033376072,0.00006949517,0.0028707262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987054,0.00019318446,0.00011219624,0.00036119498,0.0004975576,0.00013053737],"domain_scores_gemma":[0.9973961,0.00096637564,0.00029144526,0.0002533855,0.00094735844,0.00014533353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011880996,0.00047131383,0.0014139398,0.0032810473,0.0011819723,0.0018701319,0.001760365,0.0012304402,0.001105136],"category_scores_gemma":[0.0065059857,0.0003878351,0.0012830482,0.0037958708,0.00083698827,0.002575117,0.0017208895,0.00091495446,0.00031050155],"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.0010127802,0.00059391255,0.017569138,0.0005123654,0.00044964015,0.00038060008,0.0010509918,0.3793072,0.020551205,0.08048549,0.0046175425,0.49346906],"study_design_scores_gemma":[0.0000106028565,0.000044432345,0.0010208545,0.000007820249,0.000028920758,0.000068642235,0.00004432358,0.99088156,0.0014861583,0.005843497,0.00054579205,0.00001742048],"about_ca_topic_score_codex":0.007320581,"about_ca_topic_score_gemma":0.007188872,"teacher_disagreement_score":0.007320581,"about_ca_system_score_codex":0.0012351383,"about_ca_system_score_gemma":0.0012825057,"threshold_uncertainty_score":0.014555931},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018970625,0.000094602605,0.9966343,0.00019692429,0.00003483121,0.000027065433,0.00004419493,0.0006627185,0.00040831981],"genre_scores_gemma":[0.1529003,0.0003025852,0.84294724,0.0003619471,0.00017643478,0.00021407894,0.000414315,0.00047437527,0.0022087719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900221,0.005036985,0.0005710461,0.0013203692,0.0026389826,0.0004104423],"domain_scores_gemma":[0.9756999,0.013810448,0.00084225996,0.006808696,0.002233695,0.0006050434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016774673,0.0011025066,0.0026032052,0.0019936487,0.0016299606,0.0049972506,0.0040353667,0.0025549035,0.0040739668],"category_scores_gemma":[0.042695083,0.0008227658,0.0020520126,0.002702204,0.0022475158,0.0087077,0.008584346,0.005478321,0.0012887323],"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.0002983106,0.00047834596,0.0019098817,0.000260736,0.0002845843,0.00013215789,0.00046712116,0.28263512,0.0013958223,0.39545983,0.00922701,0.30745113],"study_design_scores_gemma":[0.000015444317,0.00003430912,0.00009265247,0.000027273203,0.000015261343,0.00003168403,0.000027666129,0.79333663,0.0009308131,0.20280567,0.002669865,0.000012732264],"about_ca_topic_score_codex":0.0034978825,"about_ca_topic_score_gemma":0.003994501,"teacher_disagreement_score":0.016774673,"about_ca_system_score_codex":0.0021497572,"about_ca_system_score_gemma":0.003791488,"threshold_uncertainty_score":0.088714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009317933,0.00018918814,0.98195136,0.00014721305,0.0001727452,0.00012209955,0.00044891302,0.0045456025,0.0031049454],"genre_scores_gemma":[0.37163806,0.00037057363,0.61287755,0.0005085271,0.00014530907,0.00027151348,0.0020760908,0.0009093275,0.01120303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951696,0.000102326834,0.00003428729,0.00009948702,0.00018309984,0.000063717736],"domain_scores_gemma":[0.9995701,0.0001305876,0.000028846973,0.00006850205,0.00017102671,0.000030969833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070855033,0.0007946001,0.00096367445,0.0010193266,0.00046394803,0.0011615416,0.0013772866,0.0007264965,0.00922992],"category_scores_gemma":[0.0018410962,0.00035033238,0.0008432801,0.00084537076,0.00028803851,0.0016357375,0.0011411399,0.0010632464,0.002635217],"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.0005853494,0.00027933542,0.0008551948,0.00023838635,0.00011781739,0.0002016938,0.000106933716,0.09424875,0.03909133,0.019139703,0.026881034,0.81825453],"study_design_scores_gemma":[0.00002595094,0.00007853862,0.00019163081,0.000010097286,0.000028647102,0.00007904326,0.000032580698,0.977089,0.008342457,0.008175531,0.0059256423,0.000020910195],"about_ca_topic_score_codex":0.0042596487,"about_ca_topic_score_gemma":0.0061701233,"teacher_disagreement_score":0.00922992,"about_ca_system_score_codex":0.0007848907,"about_ca_system_score_gemma":0.001067167,"threshold_uncertainty_score":0.030877173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03374728,0.00015649642,0.9608202,0.00032290304,0.000047816913,0.0000522968,0.00010235057,0.00007265443,0.0046780077],"genre_scores_gemma":[0.85655457,0.00018624273,0.13872318,0.00009025387,0.000030156652,0.00015741351,0.00014735092,0.00002976495,0.0040811487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814415,0.0012220555,0.00006470749,0.00016900923,0.0002789815,0.00012102655],"domain_scores_gemma":[0.99847597,0.0009550338,0.00013531349,0.00008370143,0.0002617957,0.00008819941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024146573,0.00067623396,0.0008689997,0.0012992109,0.0005764178,0.0024385506,0.0014580993,0.001066608,0.004069378],"category_scores_gemma":[0.004871089,0.0002908039,0.0009869528,0.0015509785,0.0008662513,0.0033143864,0.0010218117,0.0014615497,0.00037437014],"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.00028192598,0.00015646842,0.00055984245,0.0002172562,0.00013715551,0.00023518637,0.00055952696,0.6576711,0.0022803654,0.2949949,0.0017233059,0.041182972],"study_design_scores_gemma":[0.00001043717,0.00003765802,0.00007204284,0.000012479464,0.000021770838,0.000018833887,0.00006356946,0.9397039,0.00027968938,0.05935583,0.00040774338,0.000015926793],"about_ca_topic_score_codex":0.0031627691,"about_ca_topic_score_gemma":0.003435383,"teacher_disagreement_score":0.004069378,"about_ca_system_score_codex":0.001419804,"about_ca_system_score_gemma":0.0011509473,"threshold_uncertainty_score":0.013613462},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026578905,0.00047714947,0.9683985,0.00027306867,0.00008597897,0.000044520773,0.00030911356,0.00216788,0.0016648864],"genre_scores_gemma":[0.6490435,0.0005714072,0.34099913,0.0004406425,0.00022680427,0.00012427755,0.0026965144,0.00037553883,0.0055221696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986884,0.0003634625,0.000090098416,0.00040739114,0.0003087671,0.00014183423],"domain_scores_gemma":[0.99678874,0.00091074454,0.00014542716,0.0015299309,0.00050723937,0.00011789603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018503527,0.0013450589,0.0016544595,0.0015648671,0.0006967909,0.0013918657,0.001907565,0.0014731699,0.0024639233],"category_scores_gemma":[0.005338281,0.0005418724,0.0016541688,0.0018439629,0.0007795087,0.002927485,0.0039688265,0.0024078519,0.0015010565],"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.00059167005,0.0004715734,0.002685621,0.00014772198,0.00038637812,0.00030313863,0.0002099797,0.25800154,0.01479123,0.012568372,0.011227764,0.698615],"study_design_scores_gemma":[0.00001956582,0.00006136555,0.00040617285,0.000020458549,0.00008358068,0.00012726472,0.000047412836,0.9699896,0.0063226316,0.02127416,0.0016281962,0.000019536305],"about_ca_topic_score_codex":0.0026088778,"about_ca_topic_score_gemma":0.003988024,"teacher_disagreement_score":0.0026088778,"about_ca_system_score_codex":0.00049848907,"about_ca_system_score_gemma":0.0012918125,"threshold_uncertainty_score":0.009785712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018757533,0.000060526007,0.9974886,0.000017435363,0.000029607938,0.000023334054,0.00001990099,0.0002873458,0.00019757562],"genre_scores_gemma":[0.042971104,0.00007950641,0.95522976,0.000038688107,0.00004586893,0.00010206742,0.0001534704,0.000069347785,0.0013101861],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873036,0.0002705822,0.00009815177,0.00026578098,0.00054512365,0.00008997649],"domain_scores_gemma":[0.99814975,0.0008793837,0.00009143633,0.00017069528,0.00060751557,0.00010130852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018296046,0.0010679989,0.0018886997,0.0018856361,0.0010935288,0.0015815016,0.0020170577,0.001247145,0.0042836578],"category_scores_gemma":[0.0033678897,0.0007038859,0.0014057223,0.0018437515,0.0004785759,0.0017261879,0.0018001761,0.0017518497,0.0016259932],"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.00044000795,0.00021848195,0.0015601496,0.00031138572,0.0002633162,0.00023568555,0.00022570857,0.07866408,0.03104241,0.019066019,0.0035222515,0.8644505],"study_design_scores_gemma":[0.000024776202,0.000052176725,0.0002724724,0.00000949917,0.000040440584,0.00010392001,0.000026636204,0.98730797,0.004941412,0.0046813535,0.0025044854,0.00003486266],"about_ca_topic_score_codex":0.0040673628,"about_ca_topic_score_gemma":0.0042485995,"teacher_disagreement_score":0.0042836578,"about_ca_system_score_codex":0.00046449146,"about_ca_system_score_gemma":0.0015651016,"threshold_uncertainty_score":0.014330268},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9277649,0.0005944433,0.06600428,0.00034949137,0.00039309758,0.000018662662,0.0008975416,0.0012652471,0.0027122942],"genre_scores_gemma":[0.99286723,0.000071819864,0.005459358,0.000019889409,0.000026897846,0.000005713544,0.00049119303,0.00002080783,0.0010371775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993134,0.000008493694,0.0000036665679,0.00002335856,0.000011865595,0.000021218899],"domain_scores_gemma":[0.99990356,0.000023261013,0.000010958475,0.000010060695,0.000038383452,0.000013715415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018003694,0.00072621304,0.00046515584,0.00044087894,0.00025379995,0.00044591495,0.0003808137,0.0007306283,0.00096875837],"category_scores_gemma":[0.00046015714,0.0002987119,0.00048310158,0.00043425674,0.00021779056,0.00056663994,0.00023370136,0.0007193222,0.00036303315],"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.00016504455,0.00009296187,0.007948031,0.00002678226,0.000054636745,0.00012242328,0.000020516974,0.95525944,0.004841492,0.0003404739,0.0017307585,0.029397469],"study_design_scores_gemma":[0.000003220963,0.0000034335337,0.0012086887,9.509116e-7,0.000003322878,0.0000024402398,0.0000029753862,0.9984621,0.00020974185,0.000059664904,0.000041705087,0.0000018356592],"about_ca_topic_score_codex":0.026662339,"about_ca_topic_score_gemma":0.02890469,"teacher_disagreement_score":0.026662339,"about_ca_system_score_codex":0.00036905322,"about_ca_system_score_gemma":0.00065913546,"threshold_uncertainty_score":0.053014338},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20820619,0.0007902514,0.7886603,0.00022031553,0.00006494832,0.000087602784,0.0002630615,0.00019386898,0.0015134673],"genre_scores_gemma":[0.7405941,0.0010270927,0.25694233,0.00002860406,0.00008359981,0.00007504387,0.00012729663,0.000055377277,0.001066466],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980515,0.00007971999,0.000017873537,0.000027811573,0.000053054897,0.000016457789],"domain_scores_gemma":[0.9991072,0.0005491039,0.00007766596,0.00006388591,0.00016146875,0.00004064191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013381935,0.00021901877,0.0003661378,0.0017129423,0.00023353631,0.0008430399,0.00022978916,0.00026997447,0.0010283187],"category_scores_gemma":[0.0028613692,0.000116591575,0.00039539175,0.0015500026,0.00033387283,0.0005473695,0.0004867599,0.0003919002,0.00015306988],"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.0006104167,0.00025786867,0.023965936,0.0003536219,0.00016555678,0.00027355528,0.00039815198,0.046766017,0.07551232,0.018448044,0.0010378727,0.8322108],"study_design_scores_gemma":[0.000028154349,0.00030718785,0.060482617,0.000047984096,0.00019481176,0.0005693785,0.00029505772,0.90593565,0.019629447,0.010564777,0.0018798263,0.00006520506],"about_ca_topic_score_codex":0.0011775487,"about_ca_topic_score_gemma":0.001247328,"teacher_disagreement_score":0.0017129423,"about_ca_system_score_codex":0.0001974987,"about_ca_system_score_gemma":0.00046367812,"threshold_uncertainty_score":0.0070771575},"labels":[],"label_agreement":null}]}